oups 2025.9.5__py3-none-any.whl

oups/store/store/store.py

@@ -0,0 +1,345 @@
+#!/usr/bin/env python3
+"""
+Created on Wed Dec  4 18:00:00 2021.
+
+@author: pierrot
+
+"""
+from collections.abc import Iterator
+from pathlib import Path
+
+from pandas import Timestamp
+from sortedcontainers import SortedSet
+
+from oups.store.filepath_utils import files_at_depth
+from oups.store.indexer import StoreKey
+from oups.store.indexer import TopLevelIndexer
+from oups.store.indexer import is_toplevel
+from oups.store.ordered_parquet_dataset import OrderedParquetDataset
+from oups.store.ordered_parquet_dataset.metadata_filename import get_md_basename
+from oups.store.store.dataset_cache import cached_datasets
+from oups.store.store.iter_intersections import iter_intersections
+
+
+def get_keys[K: StoreKey](basepath: Path, indexer: TopLevelIndexer[K]) -> SortedSet[K]:
+    """
+    Identify ordered parquet dataset in directory.
+
+    Scan 'basepath' directory and create instances of 'indexer' class from
+    compatible subpaths. Only file which name ends by '_opdmd' are retained
+    to construct a key.
+
+    Parameters
+    ----------
+    basepath : Path
+        Path to directory containing a dataset collection, in folders complying
+        with the schema defined by the indexer class.
+    indexer : TopLevelIndexer[K]
+        Class decorated with '@toplevel' decorator, and defining a path
+        schema.
+
+    Returns
+    -------
+    SortedSet[StoreKey]
+        Sorted set of keys (i.e. instances of indexer) that can be
+        found in 'basepath' directory and with a 'valid' opd metadata file
+        (ending by '_opdmd').
+
+    """
+    depth = indexer.depth - 1
+    # Filter, keeping only folders having files with correct extension,
+    # then materialize paths into keys, filtering out those that can't.
+    return SortedSet(
+        [
+            key
+            for path, files in files_at_depth(basepath, depth)
+            for file in files
+            if (
+                (opdmd_basename := get_md_basename(file))
+                and (
+                    key := indexer.from_path(
+                        Path(*path.parts[-depth:]) / opdmd_basename,
+                    )
+                )
+            )
+        ],
+    )
+
+
+class Store[K: StoreKey]:
+    """
+    Sorted list of keys (indexes to parquet datasets).
+
+    Attributes
+    ----------
+    basepath : Path
+        Directory path to the set of parquet datasets.
+    indexer : TopLevelIndexer[KT]
+        Indexer schema (class) to be used to index parquet datasets.
+    keys : SortedSet[K]
+        Set of indexes of existing parquet datasets.
+    _needs_keys_refresh : bool
+        Flag indicating that the 'keys' property needs to be refreshed from
+        disk. Set to True when a new 'OrderedParquetDataset' is accessed but
+        doesn't yet have a metadata file on disk. When True, the next access to
+        the 'keys' property will rescan the filesystem to update the keys
+        collection.
+
+    Methods
+    -------
+    get
+        Return the ``OrderedParquetDataset`` instance corresponding to ``key``.
+    iter_intersections
+        Iterate over row group intersections across multiple datasets in store.
+    __getitem__
+        Return the ``OrderedParquetDataset`` instance corresponding to ``key``.
+    __delitem__
+        Remove dataset from parquet set.
+    __iter__
+        Iterate over keys.
+    __len__
+        Return number of datasets.
+    __repr__
+        List of datasets.
+    __contains__
+        Assess presence of this dataset.
+
+    Notes
+    -----
+    ``SortedSet`` is the data structure retained for ``keys`` instead of
+    ``SortedList`` as its ``__contains__`` appears faster.
+
+    """
+
+    def __init__(self, basepath: str | Path, indexer: TopLevelIndexer[K]):
+        """
+        Instantiate parquet set.
+
+        Parameters
+        ----------
+        basepath : Union[str, Path]
+            Path of directory containing parquet datasets.
+        indexer : TopLevelIndexer[K]
+            Class (not class instance) of the indexer to be used for:
+
+              - identifying existing parquet datasets in 'basepath' directory,
+              - creating the folders where recording new parquet datasets.
+
+        """
+        if not is_toplevel(indexer):
+            raise TypeError(f"{indexer.__name__} has to be '@toplevel' decorated.")
+        self._basepath = Path(basepath).resolve()
+        self._indexer = indexer
+        self._keys = get_keys(basepath, indexer)
+        self._needs_keys_refresh = False
+
+    @property
+    def basepath(self) -> Path:
+        """
+        Return basepath.
+
+        Returns
+        -------
+        Path
+            Basepath.
+
+        """
+        return self._basepath
+
+    @property
+    def indexer(self) -> TopLevelIndexer[K]:
+        """
+        Return indexer.
+
+        Returns
+        -------
+        TopLevelIndexer[K]
+            The toplevel indexer class used by this store.
+
+        """
+        return self._indexer
+
+    @property
+    def keys(self) -> SortedSet[K]:
+        """
+        Return keys.
+
+        Returns
+        -------
+        SortedSet[K]
+            Sorted set of keys.
+
+        """
+        if self._needs_keys_refresh:
+            # Refresh keys.
+            self._keys = get_keys(self.basepath, self.indexer)
+            self._needs_keys_refresh = False
+        return self._keys
+
+    def __len__(self) -> int:
+        """
+        Return number of datasets.
+
+        Returns
+        -------
+        int
+            Number of datasets.
+
+        """
+        return len(self.keys)
+
+    def __repr__(self) -> str:
+        """
+        List of datasets.
+
+        Returns
+        -------
+        str
+            String representation of the store.
+
+        """
+        return "\n".join(map(str, self.keys))
+
+    def __contains__(self, key: K) -> bool:
+        """
+        Assess presence of this dataset.
+
+        Parameters
+        ----------
+        key : K
+            Key to assess presence of.
+
+        Returns
+        -------
+        bool
+            True if the dataset exists, False otherwise.
+
+        """
+        return key in self.keys
+
+    def __iter__(self) -> Iterator[K]:
+        """
+        Iterate over keys.
+
+        Yields
+        ------
+        KT
+            Key of each dataset.
+
+        """
+        yield from self.keys
+
+    def __delitem__(self, key: K):
+        """
+        Remove dataset from parquet set.
+
+        Parameter
+        ---------
+        key : K
+            Key specifying the location where to delete the data. It has to be
+            an instance produced by the indexer class provided at Store
+            instantiation.
+
+        Raises
+        ------
+        KeyError
+            If the key is not found in the store.
+
+        """
+        if key in self.keys:
+            # Get OPD instance and remove its files
+            self.get(key).remove_from_disk()
+            # Update store's key collection
+            self._keys.remove(key)
+            # Clean up empty parent directories
+            upper_dir = (self.basepath / key.to_path()).parent
+            while (upper_dir != self.basepath) and (not list(upper_dir.iterdir())):
+                upper_dir.rmdir()
+                upper_dir = upper_dir.parent
+        else:
+            raise KeyError(f"key '{key}' not found in store.")
+
+    def __getitem__(self, key: K) -> OrderedParquetDataset:
+        """
+        Return the ``OrderedParquetDataset`` instance corresponding to ``key``.
+
+        Wrapper to ``get`` method.
+
+        Parameters
+        ----------
+        key : K
+            Key specifying the location where to read the data from. It has to
+            be an instance produced by the indexer class provided at Store
+            instantiation.
+
+        Returns
+        -------
+        OrderedParquetDataset
+            The ``OrderedParquetDataset`` instance corresponding to ``key``.
+
+        """
+        return self.get(key)
+
+    def get(self, key: K, **kwargs) -> OrderedParquetDataset:
+        """
+        Return the OrderedParquetDataset instance with custom parameters.
+
+        Parameters
+        ----------
+        key : K
+            Key specifying the location where to read the data from.
+        **kwargs : dict
+            Additional parameters to pass to OrderedParquetDataset constructor
+            (e.g., 'ordered_on', 'lock_timeout', 'lock_lifetime').
+
+        Returns
+        -------
+        OrderedParquetDataset
+            The OrderedParquetDataset instance corresponding to key. Creates a
+            new OrderedParquetDataset object if the key doesn't exist.
+
+        """
+        opd = OrderedParquetDataset(self.basepath / key.to_path(), **kwargs)
+        if opd.is_newly_initialized:
+            self._needs_keys_refresh = True
+        return opd
+
+    def iter_intersections(
+        self,
+        keys: list[K],
+        start: float | Timestamp | None = None,
+        n_prev: int | list[int] | None = 0,
+        end_excl: float | Timestamp | None = None,
+    ):
+        """
+        Iterate over row group intersections across multiple datasets in store.
+
+        This method handles dataset caching and lifecycle management, then
+        delegates to the core iter_intersections function.
+
+        Parameters
+        ----------
+        keys : list[K]
+            List of dataset keys.
+        start : Optional[Union[int, float, Timestamp]], default None
+            Start value (inclusive) for the 'ordered_on' column range.
+        n_prev : Union[int, list[int]], default 0
+            Number of previous rows (number of values before 'start') to prepend
+            to first yielded dataframe for each key.
+            If a list, values are used for each key in the same order as 'keys'.
+        end_excl : Optional[Union[int, float, Timestamp]], default None
+            End value (exclusive) for the 'ordered_on' column range.
+
+        Yields
+        ------
+        dict[K, DataFrame]
+            Dictionary mapping each key to its corresponding DataFrame chunk.
+
+        """
+        with cached_datasets(self, keys) as datasets:
+            yield from iter_intersections(
+                datasets=datasets,
+                start=start,
+                n_prev=n_prev,
+                end_excl=end_excl,
+            )

oups-2025.9.5.dist-info/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2025, pierrot
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

oups-2025.9.5.dist-info/METADATA

@@ -0,0 +1,44 @@
+Metadata-Version: 2.3
+Name: oups
+Version: 2025.9.5
+Summary: Out-of-core pipelines over ordered data: StatefulLoop, stateful ops, and ordered Parquet Store.
+License: Apache-2.0
+Keywords: out-of-core,streaming,stateful,time-series,pandas,parquet,data-engineering
+Author: pierrot
+Requires-Python: >=3.13,<4.0
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.13
+Requires-Dist: cloudpickle (>=3.1.1)
+Requires-Dist: fastparquet (>=2023.10.1)
+Requires-Dist: flufl-lock (>=8.2.0)
+Requires-Dist: joblib (>=1.3.2)
+Requires-Dist: numba (>=0.61.2)
+Requires-Dist: numpy (>=2.0)
+Requires-Dist: pandas (>=2.2.3)
+Requires-Dist: sortedcontainers (>=2.4.0)
+Project-URL: Changelog, https://codeberg.org/pierrot/oups/src/branch/main/CHANGELOG.md
+Project-URL: Documentation, https://codeberg.org/pierrot/oups/src/branch/main/docs
+Project-URL: Homepage, https://codeberg.org/pierrot/oups
+Project-URL: Issues, https://codeberg.org/pierrot/oups/issues
+Project-URL: Source, https://codeberg.org/pierrot/oups
+Description-Content-Type: text/markdown
+
+# Welcome to oups!
+
+## What is oups?
+*oups* stands for Ordered Unified Processing Stack — out-of-core processing for ordered data (batch + live).
+
+*oups* is a Python toolkit for building end-to-end pipelines over ordered data with the same code in offline training and live streaming/batch contexts.
+
+It centers on ``StatefulLoop`` (``loop.bind_function_state``, ``loop.iterate``, ``loop.buffer``), which binds and persists function/object state, orchestrates chunked iteration, and buffers DataFrames under a memory cap with flush-on-limit or last-iteration semantics.
+Complementing the loop, ``stateful_ops`` provides vectorized, chunk-friendly primitives like ``AsofMerger`` for multi-DataFrame as-of joins (with optional windows of previous values) and ``SegmentedAggregator`` (planned) for streamed segmentation and aggregation.
+The ``store`` package manages ordered Parquet datasets via schema-driven keys (``@toplevel``), supports incremental updates (``store[key].write(...)``) and duplicate handling, and offers synchronized iteration across datasets via ``store.iter_intersections(...)`` with optional warm-up (``n_prev``).
+
+Together these pieces enable out-of-core processing with resumability, and deterministic buffering. The design favors explicit, minimal APIs and reproducible results, aligning offline feature generation with online serving.
+
+## Links
+
+- 📖 **[Documentation](https://pierrot.codeberg.page/oups/)** - Guides and API reference
+- 📋 **[Changelog](CHANGELOG.md)** - Release notes and version history
+

oups-2025.9.5.dist-info/RECORD

@@ -0,0 +1,43 @@
+oups/__init__.py,sha256=Tkw_6ZVwI7Ajr9P2YqDJV-AOAt-MJhxAwYSjLV1Xmq0,1060
+oups/date_utils.py,sha256=3E1K1b2oIZVlI0FO4Eq8hW24ZFTEL-2UwnRLPHnPXxA,1501
+oups/defines.py,sha256=d4f0O1m717WlqN8lP9jGdY3q0Z2qyzpSJVMkukqySog,959
+oups/numpy_utils.py,sha256=KmtBillsNwKdB-1Nv8k-fbJHsADvYfPE2uMBNGdpMoY,3404
+oups/stateful_loop/__init__.py,sha256=hSPoYRGm0nZZKE5ieYze5d5zIdU3pVGTrBIRHuwNUPg,210
+oups/stateful_loop/loop_persistence_io.py,sha256=Dx41DgEa2KQ9-BCfGQnajjcbIi3YWbiPfxS400qJXY4,1666
+oups/stateful_loop/stateful_loop.py,sha256=w7NUyY4SwbzCfgCJQvMW_DaFuEN39DRqPbo-s0gKTmM,26144
+oups/stateful_loop/validate_loop_usage.py,sha256=mnJWjcYKZZ_9446ao7IPy5kkrd3QQgxVcT9yxnzr-To,12249
+oups/stateful_ops/__init__.py,sha256=nRxqMdhYHkB8_7aKY6Oa_Ah05Kp-PFnKwSVIDqaGi5w,470
+oups/stateful_ops/aggstream/__init__.py,sha256=iVbdABSRg1l14h9cO0oCuNPppmnYLlHEbz3MAOUWpAw,204
+oups/stateful_ops/aggstream/aggstream.py,sha256=g9bbNAuFTpiOmmP8tZ8KXOz8gh-ln1d-kdaaLjWXSXU,70392
+oups/stateful_ops/aggstream/cumsegagg.py,sha256=G_jz2FNfrVv9Ix-qcgnC3OYC9QGMlRtd_b6wyF9rXPc,27389
+oups/stateful_ops/aggstream/jcumsegagg.py,sha256=Zm_yojGxFEGnBv9zuIexWpWSCEJmFFT89EpAuoGQHhE,14607
+oups/stateful_ops/aggstream/segmentby.py,sha256=nJEI2-_y6k7_8-RCDSOEsheSHTkvotke2kw716YBrBs,46485
+oups/stateful_ops/aggstream/utils.py,sha256=lIWJmLDY3mT71CJ1J_Fv-tECKEKKqIE0yhCkniJxF1k,2054
+oups/stateful_ops/asof_merger/__init__.py,sha256=vHSmkxKrDg4wU9s1oj88IAe0t1z5PZQ-5xLcuf6U-0Y,161
+oups/stateful_ops/asof_merger/asof_merger.py,sha256=djPKMPXYS91bsIGeJrP_uXID6Glkt8k-98A3uVCho7o,36652
+oups/stateful_ops/asof_merger/get_config.py,sha256=cUo6JwzneruhsSYWJzstnulfFn0uTqnFT7p-0n3WiiI,16974
+oups/stateful_ops/asof_merger/validate_params.py,sha256=W7oEpF8XC0Il6swGMAY75KQotSlp8MwUseo3sXbjPOg,10148
+oups/store/__init__.py,sha256=cApoS3iSXwcegv-iqbSOh5bXXN5ezNNdqGGABTSwWlM,422
+oups/store/filepath_utils.py,sha256=bBkFCIExgeJgrk_TAOT7jsK1UjYe-eQTkQsVDmgmOHo,1811
+oups/store/indexer.py,sha256=KQr1TcWnGx4C1-iBJs9N0JhrIA44BuSk04OiClmbP2w,14831
+oups/store/ordered_parquet_dataset/__init__.py,sha256=KT0-7oOY1GZl2hTwjAYDVWFS22OUMCKMfb7hKxp_K9o,372
+oups/store/ordered_parquet_dataset/metadata_filename.py,sha256=YqhmKUQ6T5QyxixU_KTF9j5vD1w6uhSOeUipz1vuN44,1059
+oups/store/ordered_parquet_dataset/ordered_parquet_dataset/__init__.py,sha256=SKQxlX-xzTfxwBef2rzgn2BbUdE5c3UJ0IMXhgz_Zmc,248
+oups/store/ordered_parquet_dataset/ordered_parquet_dataset/base.py,sha256=Rju3mBIDJ8sS4BpPDL4CavmYkvx4LjJe6j-rKJ2USFQ,33358
+oups/store/ordered_parquet_dataset/ordered_parquet_dataset/read_only.py,sha256=3Cv4OH2UM5gj1ekyGmcVkgABtMwDSujfcJEanght1rs,8832
+oups/store/ordered_parquet_dataset/parquet_adapter.py,sha256=xhOhudNLi0bDvxObT0Rvx3_t5HB_ojIF72uWKiNJ0Vs,4988
+oups/store/ordered_parquet_dataset/write/__init__.py,sha256=IwjAp3s0y7dtsR_MQ3HvV-JxrIZUcWmJX3l5rf6eNUk,396
+oups/store/ordered_parquet_dataset/write/iter_merge_split_data.py,sha256=zU-oRz20kQOeYDA3RHVmzXjTQKJhMBQ0tYpAeNm3caw,5270
+oups/store/ordered_parquet_dataset/write/merge_split_strategies/__init__.py,sha256=kjNLNjojUjKedK7ZAVVyKLOK1dXWzWsEV0qZsEEyivo,700
+oups/store/ordered_parquet_dataset/write/merge_split_strategies/base.py,sha256=hl-7Q1iyslbBZE3HY4SEEuKOETgTuLoTJomuglOQdx4,34029
+oups/store/ordered_parquet_dataset/write/merge_split_strategies/n_rows_strategy.py,sha256=uRtDO8vS0CvPXF3b73pI7d1W1F22NeKE43poKn24PbQ,11801
+oups/store/ordered_parquet_dataset/write/merge_split_strategies/time_period_strategy.py,sha256=Ye47ZoBy6P7TEL2Glmq_34qzpSeKvTBQrRqsDh_n3f8,12691
+oups/store/ordered_parquet_dataset/write/write.py,sha256=CAZgPkXgpjM7mq6PgiJg4rlocl61P2CDr8TCqy8mM4c,12052
+oups/store/store/__init__.py,sha256=OVm6fQncS1_726-K5O1cob68DVc9cGizPwfnfrKmozc,121
+oups/store/store/dataset_cache.py,sha256=J0fE4RHyA2TWNQehgI580ndlrtJZfOyez_wtv1IbEg8,1091
+oups/store/store/iter_intersections.py,sha256=xgPWHxDhbJH6pOwuNy3pabcU9_4s3-iN8RJQ1V86JOk,16740
+oups/store/store/store.py,sha256=aJg2p9O_YVPG3-SPbCXTuCyX4BoJwU6UEKK29nj4rb8,10460
+oups-2025.9.5.dist-info/LICENSE,sha256=feEGyubvFPPWktFR_FTDkcjTaosHXBhKdi9IB4klelk,11539
+oups-2025.9.5.dist-info/METADATA,sha256=g6qoIN2Mkhklk94z9lXNGO2oOycEa26QKF_iGKIPVaw,2671
+oups-2025.9.5.dist-info/WHEEL,sha256=b4K_helf-jlQoXBBETfwnf4B04YC67LOev0jo4fX5m8,88
+oups-2025.9.5.dist-info/RECORD,,

oups-2025.9.5.dist-info/WHEEL

@@ -0,0 +1,4 @@
+Wheel-Version: 1.0
+Generator: poetry-core 2.1.3
+Root-Is-Purelib: true
+Tag: py3-none-any