wavelet-matrix 2.0.1__cp313-cp313-manylinux_2_17_aarch64.manylinux2014_aarch64.whl

wavelet_matrix/__init__.py

@@ -0,0 +1,5 @@
+from .wavelet_matrix import *
+
+__doc__ = wavelet_matrix.__doc__
+if hasattr(wavelet_matrix, "__all__"):
+    __all__ = wavelet_matrix.__all__

wavelet_matrix/__init__.pyi

@@ -0,0 +1,63 @@
+from typing import Iterable
+
+class WaveletMatrix:
+    def __init__(self, data: Iterable[int]) -> None: ...
+    def __getitem__(self, index: int) -> int: ...
+    def __len__(self) -> int: ...
+    def __str__(self) -> str: ...
+    def __repr__(self) -> str: ...
+    def __copy__(self) -> WaveletMatrix: ...
+    def __deepcopy__(self, memo) -> WaveletMatrix: ...
+    def values(self) -> list[int]: ...
+    def access(self, index: int) -> int: ...
+    def rank(self, value: int, end: int) -> int: ...
+    def select(self, value: int, kth: int) -> int | None: ...
+    def quantile(self, start: int, end: int, kth: int) -> int: ...
+    def topk(self, start: int, end: int, k: int | None = None) -> list[dict[str, int]]: ...
+    def range_sum(self, start: int, end: int) -> int: ...
+    def range_intersection(
+        self, start1: int, end1: int, start2: int, end2: int
+    ) -> list[dict[str, int]]: ...
+    def range_freq(
+        self, start: int, end: int, lower: int | None = None, upper: int | None = None
+    ) -> int: ...
+    def range_list(
+        self, start: int, end: int, lower: int | None = None, upper: int | None = None
+    ) -> list[dict[str, int]]: ...
+    def range_maxk(self, start: int, end: int, k: int | None = None) -> list[dict[str, int]]: ...
+    def range_mink(self, start: int, end: int, k: int | None = None) -> list[dict[str, int]]: ...
+    def prev_value(self, start: int, end: int, upper: int | None = None) -> int | None: ...
+    def next_value(self, start: int, end: int, lower: int | None = None) -> int | None: ...
+
+class DynamicWaveletMatrix:
+    def __init__(self, data: Iterable[int], max_bit: int | None = None) -> None: ...
+    def __getitem__(self, index: int) -> int: ...
+    def __len__(self) -> int: ...
+    def __str__(self) -> str: ...
+    def __repr__(self) -> str: ...
+    def __copy__(self) -> DynamicWaveletMatrix: ...
+    def __deepcopy__(self, memo) -> DynamicWaveletMatrix: ...
+    def values(self) -> list[int]: ...
+    def access(self, index: int) -> int: ...
+    def rank(self, value: int, end: int) -> int: ...
+    def select(self, value: int, kth: int) -> int | None: ...
+    def quantile(self, start: int, end: int, kth: int) -> int: ...
+    def topk(self, start: int, end: int, k: int | None = None) -> list[dict[str, int]]: ...
+    def range_sum(self, start: int, end: int) -> int: ...
+    def range_intersection(
+        self, start1: int, end1: int, start2: int, end2: int
+    ) -> list[dict[str, int]]: ...
+    def range_freq(
+        self, start: int, end: int, lower: int | None = None, upper: int | None = None
+    ) -> int: ...
+    def range_list(
+        self, start: int, end: int, lower: int | None = None, upper: int | None = None
+    ) -> list[dict[str, int]]: ...
+    def range_maxk(self, start: int, end: int, k: int | None = None) -> list[dict[str, int]]: ...
+    def range_mink(self, start: int, end: int, k: int | None = None) -> list[dict[str, int]]: ...
+    def prev_value(self, start: int, end: int, upper: int | None = None) -> int | None: ...
+    def next_value(self, start: int, end: int, lower: int | None = None) -> int | None: ...
+    def max_bit(self) -> int: ...
+    def insert(self, index: int, value: int) -> None: ...
+    def remove(self, index: int) -> int: ...
+    def update(self, index: int, value: int) -> int: ...

wavelet_matrix-2.0.1.dist-info/METADATA

@@ -0,0 +1,214 @@
+Metadata-Version: 2.4
+Name: wavelet-matrix
+Version: 2.0.1
+Classifier: Intended Audience :: Developers
+Classifier: Intended Audience :: Science/Research
+Classifier: Intended Audience :: Information Technology
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
+Classifier: Programming Language :: Python :: Implementation :: CPython
+Classifier: Programming Language :: Python :: Implementation :: PyPy
+Classifier: Topic :: Software Development :: Libraries :: Python Modules
+Classifier: Topic :: Scientific/Engineering :: Information Analysis
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Dist: maturin>=1.9,<2.0 ; extra == 'dev'
+Requires-Dist: pdoc>=16.0 ; extra == 'dev'
+Requires-Dist: pytest>=7.0 ; extra == 'dev'
+Requires-Dist: pytest-benchmark>=4.0 ; extra == 'dev'
+Requires-Dist: ruff>=0.14 ; extra == 'dev'
+Provides-Extra: dev
+License-File: LICENSE
+Summary: High-performance indexed sequence data structure powered by Rust, supporting fast rank/select and range queries.
+Keywords: wavelet matrix,data structure,algorithm,sequence index,rank,select,quantile,top-k,range query,dynamic update,indexing,succinct
+Author: Koki Watanabe
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown; charset=UTF-8; variant=GFM
+Project-URL: homepage, https://github.com/math-hiyoko/wavelet-matrix
+Project-URL: documentation, https://math-hiyoko.github.io/wavelet-matrix
+Project-URL: repository, https://github.com/math-hiyoko/wavelet-matrix
+
+# Wavelet Matrix
+
+High-performance indexed sequence data structure powered by Rust, supporting fast rank/select and range queries.
+
+- Document: https://math-hiyoko.github.io/wavelet-matrix
+- Repository: https://github.com/math-hiyoko/wavelet-matrix
+
+
+## Quick Start
+
+### WaveletMatrix
+```python
+>>> from wavelet_matrix import WaveletMatrix
+>>>
+>>> # Create a WaveletMatrix
+>>> data = [5, 4, 5, 5, 2, 1, 5, 6, 1, 3, 5, 0]
+>>> wm = WaveletMatrix(data)
+>>> wm
+WaveletMatrix([5, 4, 5, 5, 2, 1, 5, 6, 1, 3, 5, 0])
+```
+
+#### Count occurrences (rank)
+```python
+>>> # Count of 5 in the range [0, 9)
+>>> wm.rank(value=5, end=9)
+4
+```
+
+#### Find position (select)
+```python
+>>> # Find the index of 4th occurrence of value 5
+>>> wm.select(value=5, kth=4)
+6
+```
+
+#### Find k-th smallest (quantile)
+```python
+>>> # Find 8th smallest value in the range [2, 12)
+>>> wm.quantile(start=2, end=12, kth=8)
+5
+```
+
+#### List top-k highest frequent values (topk)
+```python
+>>> # List values in [1, 10) with the top-2 highest frequencies.
+>>> wm.topk(start=1, end=10, k=2)
+[{'value': 5, 'count': 3}, {'value': 1, 'count': 2}]
+```
+
+#### Sum values in a range (range_sum)
+```python
+>>> # Sum of elements in the range [2, 8).
+>>> wm.range_sum(start=2, end=8)
+24
+```
+
+#### List intersection of two ranges (range_intersection)
+```python
+>>> # List the intersection of two ranges [0, 6) and [6, 11).
+>>> wm.range_intersection(start1=0, end1=6, start2=6, end2=11)
+[{'value': 1, 'count1': 1, 'count2': 1}, {'value': 5, 'count1': 3, 'count2': 2}]
+```
+
+#### Count values in a range (range_freq)
+```python
+>>> # Count values c in the range [1, 9) such that 4 <= c < 6.
+>>> wm.range_freq(start=1, end=9, lower=4, upper=6)
+4
+```
+
+#### List values in a range (range_list)
+```python
+>>> # List values c in the range [1, 9) such that 4 <= c < 6.
+>>> wm.range_list(start=1, end=9, lower=4, upper=6)
+[{'value': 4, 'count': 1}, {'value': 5, 'count': 3}]
+```
+
+#### List top-k maximum values (range_maxk)
+```python
+>>> # List values in [1, 9) with the top-2 maximum values.
+>>> wm.range_maxk(start=1, end=9, k=2)
+[{'value': 6, 'count': 1}, {'value': 5, 'count': 3}]
+```
+
+#### List top-k minimum values (range_mink)
+```python
+>>> # List values in [1, 9) with the top-2 minimum values.
+>>> wm.range_mink(start=1, end=9, k=2)
+[{'value': 1, 'count': 2}, {'value': 2, 'count': 1}]
+```
+
+#### Get the maximun value (prev_value)
+```python
+>>> # Get the maximum value c in the range [1, 9) such that c < 7.
+>>> wm.prev_value(start=1, end=9, upper=7)
+6
+```
+
+#### Get the minimun value (next_value)
+```python
+>>> # Get the minimum value c in the range [1, 9) such that 4 <= c.
+>>> wm.next_value(start=1, end=9, lower=4)
+4
+```
+
+### Dynamic Wavelet Matrix
+```python
+>>> from wavelet_matrix import DynamicWaveletMatrix
+>>>
+>>> # Create a DynamicWaveletMatrix
+>>> # max_bit sets the maximum bit-width of stored values (auto-inferred if omitted).
+>>> data = [5, 4, 5, 5, 2, 1, 5, 6, 1, 3, 5, 0]
+>>> dwm = DynamicWaveletMatrix(data, max_bit=4)
+>>> dwm
+DynamicWaveletMatrix([5, 4, 5, 5, 2, 1, 5, 6, 1, 3, 5, 0], max_bit=4)
+```
+
+#### Insert value (insert)
+```python
+>>> dwm
+DynamicWaveletMatrix([5, 4, 5, 5, 2, 1, 5, 6, 1, 3, 5, 0], max_bit=4)
+>>> # Inserts 8 at index 4.
+>>> # The bit width of the new value must not exceed max_bit.
+>>> dwm.insert(index=4, value=8)
+>>> dwm
+DynamicWaveletMatrix([5, 4, 5, 5, 8, 2, 1, 5, 6, 1, 3, 5, 0], max_bit=4)
+```
+
+#### Remove value (remove)
+```python
+>>> dwm
+DynamicWaveletMatrix([5, 4, 5, 5, 8, 2, 1, 5, 6, 1, 3, 5, 0], max_bit=4)
+>>> # Remove the value at index 4.
+>>> dwm.remove(index=4)
+8
+>>> dwm
+DynamicWaveletMatrix([5, 4, 5, 5, 2, 1, 5, 6, 1, 3, 5, 0], max_bit=4)
+```
+
+#### Update value (update)
+```python
+>>> dwm
+DynamicWaveletMatrix([5, 4, 5, 5, 2, 1, 5, 6, 1, 3, 5, 0], max_bit=4)
+>>> # Update the value at index 4 to 5
+>>> # The bit width of the new value must not exceed max_bit.
+>>> dwm.update(index=4, value=5)
+2
+>>> dwm
+DynamicWaveletMatrix([5, 4, 5, 5, 5, 1, 5, 6, 1, 3, 5, 0], max_bit=4)
+```
+
+## Development
+
+### Running Tests
+
+```bash
+$ pip install -e ".[dev]"
+
+# Cargo test
+$ cargo test --all --release
+
+# Run tests
+$ pytest --benchmark-skip
+
+# Run benchmarks
+$ pytest --benchmark-only
+```
+
+## References
+
+- Francisco Claude, Gonzalo Navarro, Alberto Ordóñez,
+  The wavelet matrix: An efficient wavelet tree for large alphabets,
+  Information Systems,
+  Volume 47,
+  2015,
+  Pages 15-32,
+  ISSN 0306-4379,
+  https://doi.org/10.1016/j.is.2014.06.002.
+

wavelet_matrix-2.0.1.dist-info/RECORD

@@ -0,0 +1,8 @@
+wavelet_matrix-2.0.1.dist-info/METADATA,sha256=Qrb1gc_Gam7Krcoj58K1EZcMdk7ZpDBN5J0-7GyPG3I,6263
+wavelet_matrix-2.0.1.dist-info/WHEEL,sha256=2IDlv-zwrdhNo5yIhN9Z6LFfXMwNY8Z9N7ZBX4JgDAk,149
+wavelet_matrix-2.0.1.dist-info/licenses/LICENSE,sha256=RLItjifD2pjpecDwt0BdQ7bFR6517amHYtkEENvrPac,1060
+wavelet_matrix/__init__.py,sha256=bY2bBHUr5LI7lsksSDxTm_ZQY6vJGBV63B5ryuJVa-U,139
+wavelet_matrix/__init__.pyi,sha256=EomBIOBB63drZDkP025K3IMqmFARHTkC8Pb_rDOyY9A,3309
+wavelet_matrix/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+wavelet_matrix/wavelet_matrix.cpython-313-aarch64-linux-gnu.so,sha256=fty2NF1MyJZFg-RSuI_5oYeG4OljiVC8OumrvpH5q_Q,1474528
+wavelet_matrix-2.0.1.dist-info/RECORD,,

wavelet_matrix-2.0.1.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: maturin (1.10.2)
+Root-Is-Purelib: false
+Tag: cp313-cp313-manylinux_2_17_aarch64
+Tag: cp313-cp313-manylinux2014_aarch64

wavelet_matrix-2.0.1.dist-info/licenses/LICENSE

@@ -0,0 +1,7 @@
+Copyright 2025 Koki Watanabe
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.