pythonic-fp-circulararray 5.3.0__py3-none-any.whl → 5.3.2__py3-none-any.whl

pythonic_fp/circulararray/__init__.py

@@ -12,7 +12,11 @@
 # See the License for the specific language governing permissions and
 # limitations under the License.
 
-"""Package implementing stateful circular array data structures.
+"""
+Circular Array
+==============
+
+Package implementing stateful circular array data structures.
 
 - O(1) pops and pushes either end
 - O(1) indexing and size determination

pythonic_fp/circulararray/auto.py

@@ -12,7 +12,11 @@
 # See the License for the specific language governing permissions and
 # limitations under the License.
 
-"""Circular array with variable storage capacity.
+"""
+Variable Storage Capacity
+=========================
+
+Circular array with variable storage capacity.
 
 - O(1) pops either end 
 - O(1) amortized pushes either end 
@@ -25,27 +29,21 @@
 
 """
 from collections.abc import Callable, Iterable, Iterator
-from typing import cast, Never, overload, TypeVar
+from typing import cast, overload
 
 __all__ = ['CA', 'ca']
 
-I = TypeVar('I')
-T = TypeVar('T')
-
 
 class CA[I]():
 
-    L = TypeVar('L')
-    R = TypeVar('R')
-    U = TypeVar('U')
-
     __slots__ = '_items', '_cnt', '_cap', '_front', '_rear'
 
     def __init__(
             self,
             items: Iterable[I] | None = None
         ) -> None:
-        """Basically a list that can be grown from both ends
+        """
+        Basically a list that can be grown from both ends
         in O(1) time and space complexity.
 
         :param items: optional iterable to initial populate circular array
@@ -312,7 +310,8 @@ class CA[I]():
         return True
 
     def pushl(self, *items: I) -> None:
-        """Push items onto left side (front) of circular array.
+        """
+        Push items onto left side (front) of circular array.
 
         :param items: items pushed onto circular array from left
 
@@ -331,7 +330,8 @@ class CA[I]():
                 )
 
     def pushr(self, *items: I) -> None:
-        """Push items onto right side (rear) of circular array.
+        """
+        Push items onto right side (rear) of circular array.
 
         :param items: items pushed onto circular array from right
 
@@ -349,10 +349,11 @@ class CA[I]():
                     self._cnt + 1,
                 )
 
-    def popl(self) -> I | Never:
-        """Pop item off left side (front) of circular array.
+    def popl(self) -> I:
+        """
+        Pop item off left side (front) of circular array.
 
-        :return: item popped from left side of circular array
+        :returns: item popped from left side of circular array
         :raises ValueError: when called on an empty circular array
 
         """
@@ -387,8 +388,9 @@ class CA[I]():
             raise ValueError(msg)
         return cast(I, d)
 
-    def popr(self) -> I | Never:
-        """Pop item off right side (rear) of circular array.
+    def popr(self) -> I:
+        """
+        Pop item off right side (rear) of circular array.
 
         :return: item popped from right side of circular array
         :raises ValueError: when called on an empty circular array
@@ -426,7 +428,8 @@ class CA[I]():
         return cast(I, d)
 
     def popld(self, default: I) -> I:
-        """Pop one item from left side of the circular array, provide
+        """
+        Pop one item from left side of the circular array, provide
         a mandatory default value. "Safe" version of popl.
 
         :param default: item returned if circular array is empty
@@ -439,7 +442,8 @@ class CA[I]():
             return default
 
     def poprd(self, default: I) -> I:
-        """Pop one item from right side of the circular array, provide
+        """
+        Pop one item from right side of the circular array, provide
         a mandatory default value. "Safe" version of popr.
 
         :param default: item returned if circular array is empty
@@ -452,7 +456,8 @@ class CA[I]():
             return default
 
     def poplt(self, maximum: int) -> tuple[I, ...]:
-        """Pop multiple items from left side of circular array.
+        """
+        Pop multiple items from left side of circular array.
 
         :param maximum: maximum number of items to pop, may pop less if not enough items
         :return: items in the order popped, left to right
@@ -471,7 +476,8 @@ class CA[I]():
         return tuple(item_list)
 
     def poprt(self, maximum: int) -> tuple[I, ...]:
-        """Pop multiple items from right side of circular array.
+        """
+        Pop multiple items from right side of circular array.
 
         :param maximum: maximum number of items to pop, may pop less if not enough items
         :return: items in the order popped, right to left
@@ -488,7 +494,8 @@ class CA[I]():
         return tuple(item_list)
 
     def rotl(self, n: int = 1) -> None:
-        """Rotate items left.
+        """
+        Rotate items to the left.
 
         :param n: number of times to shift elements to the left
 
@@ -499,7 +506,8 @@ class CA[I]():
             self.pushr(self.popl())
 
     def rotr(self, n: int = 1) -> None:
-        """Rotate items right.
+        """
+        Rotate items to the right.
 
         :param n: number of times to shift elements to the right
 
@@ -510,20 +518,22 @@ class CA[I]():
             self.pushl(self.popr())
 
     def map[U](self, f: Callable[[I], U]) -> "CA[U]":
-        """Apply function f over the circular array's contents,
+        """
+        Apply function f over the circular array's contents,
 
         :param f: callable from type I to type U
-        :return: new circular array instance
+        :returns: new circular array instance
 
         """
         return CA(map(f, self))
 
-    def foldl[L](self, f: Callable[[L, I], L], start: L | None = None) -> L | Never:
-        """Fold left with a function and optional starting item.
+    def foldl[L](self, f: Callable[[L, I], L], start: L | None = None) -> L:
+        """
+        Fold left with a function and optional starting item.
 
         :param f: first argument to f is for the accumulator
         :param start: optional starting item
-        :return: reduced value produced by the left fold
+        :returns: reduced value produced by the left fold
         :raises ValueError: when circular array empty and no starting item given
 
         """
@@ -544,12 +554,13 @@ class CA[I]():
             acc = f(acc, d)
         return acc
 
-    def foldr[R](self, f: Callable[[I, R], R], start: R | None = None) -> R | Never:
-        """Fold right with a function and an optional starting item.
+    def foldr[R](self, f: Callable[[I, R], R], start: R | None = None) -> R:
+        """
+        Fold right with a function and an optional starting item.
 
         :param f: second argument to f is for the accumulator
         :param start: optional starting item
-        :return: reduced value produced by the right fold
+        :returns: reduced value produced by the right fold
         :raises ValueError: when circular array empty and no starting item given
 
         """
@@ -571,15 +582,17 @@ class CA[I]():
         return acc
 
     def capacity(self) -> int:
-        """Return current storage capacity of the circular array.
+        """
+        Return current storage capacity of the circular array.
 
-        :return: current storage capacity
+        :returns: current storage capacity
 
         """
         return self._cap
 
     def empty(self) -> None:
-        """Empty the circular array, keep current storage capacity."""
+        """
+        Empty the circular array, keep current storage capacity."""
         (
                 self._items,
                 self._front,
@@ -593,15 +606,17 @@ class CA[I]():
             )
 
     def fraction_filled(self) -> float:
-        """Find fraction of the storage capacity which is filled.
+        """
+        Find fraction of the storage capacity which is filled.
 
-        :return: the ratio count/capacity
+        :returns: the ratio count/capacity
 
         """
         return self._cnt / self._cap
 
     def resize(self, minimum_capacity: int = 2) -> None:
-        """Compact circular array and, if necessary, resize to a minimum
+        """
+        Compact circular array and, if necessary, resize to a minimum
         storage capacity. To just compact the circular array, do not
         provide ``minimum_capacity``.
 
@@ -622,10 +637,11 @@ class CA[I]():
 
 
 def ca[T](*items: T) -> CA[T]:
-    """Produce circular array from a variable number of arguments.
+    """
+    Produce circular array from a variable number of arguments.
 
     :param items: initial items for a new circular array
-    :return: new variable storage capacity circular array
+    :returns: new variable storage capacity circular array
 
     """
     return CA(items)

pythonic_fp/circulararray/auto.pyi

@@ -1,103 +1,43 @@
-# Copyright 2023-202 Geoffrey R. Scheller
-#
-# 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.
-
 from collections.abc import Callable, Iterable, Iterator
-from typing import Never, overload, TypeVar
+from typing import overload
 
 __all__ = ['CA', 'ca']
 
-I = TypeVar('I')
-T = TypeVar('T')
-
-
-class CA[I]():
-
-    L = TypeVar('L')
-    R = TypeVar('R')
-    U = TypeVar('U')
-
-    def __init__(
-            self,
-            items: Iterable[I] | None = None
-        ) -> None: ...
-
-    def _double_storage_capacity(self) -> None: ...
-
-    def _compact_storage_capacity(self) -> None: ...
-
+class CA[I]:
+    def __init__(self, items: Iterable[I] | None = None) -> None: ...
     def __iter__(self) -> Iterator[I]: ...
-
     def __reversed__(self) -> Iterator[I]: ...
-
-    def __repr__(self) -> str: ...
-
-    def __str__(self) -> str: ...
-
     def __bool__(self) -> bool: ...
-
     def __len__(self) -> int: ...
-
     @overload
     def __getitem__(self, idx: int) -> I: ...
     @overload
     def __getitem__(self, idx: slice) -> CA[I]: ...
-
     @overload
     def __setitem__(self, idx: int, vals: I) -> None: ...
     @overload
     def __setitem__(self, idx: slice, vals: Iterable[I]) -> None: ...
-
     @overload
     def __delitem__(self, idx: int) -> None: ...
     @overload
     def __delitem__(self, idx: slice) -> None: ...
-
     def __eq__(self, other: object) -> bool: ...
-
     def pushl(self, *items: I) -> None: ...
-
     def pushr(self, *items: I) -> None: ...
-
-    def popl(self) -> I | Never: ...
-
-    def popr(self) -> I | Never: ...
-
+    def popl(self) -> I: ...
+    def popr(self) -> I: ...
     def popld(self, default: I) -> I: ...
-
     def poprd(self, default: I) -> I: ...
-
     def poplt(self, maximum: int) -> tuple[I, ...]: ...
-
     def poprt(self, maximum: int) -> tuple[I, ...]: ...
-
     def rotl(self, n: int = 1) -> None: ...
-
     def rotr(self, n: int = 1) -> None: ...
-
     def map[U](self, f: Callable[[I], U]) -> CA[U]: ...
-
-    def foldl[L](self, f: Callable[[L, I], L], start: L | None = None) -> L | Never: ...
-
-    def foldr[R](self, f: Callable[[I, R], R], start: R | None = None) -> R | Never: ...
-
+    def foldl[L](self, f: Callable[[L, I], L], start: L | None = None) -> L: ...
+    def foldr[R](self, f: Callable[[I, R], R], start: R | None = None) -> R: ...
     def capacity(self) -> int: ...
-
     def empty(self) -> None: ...
-
     def fraction_filled(self) -> float: ...
-
     def resize(self, minimum_capacity: int = 2) -> None: ...
 
-
 def ca[T](*items: T) -> CA[T]: ...

pythonic_fp/circulararray/fixed.py

@@ -12,7 +12,11 @@
 # See the License for the specific language governing permissions and
 # limitations under the License.
 
-"""Circular array with fixed storage capacity.
+"""
+Fixed Storage Capacity
+======================
+
+Circular array with fixed storage capacity.
 
 - O(1) pops and pushes either end 
 - O(1) indexing, does not support slicing
@@ -24,20 +28,13 @@
 
 """
 from collections.abc import Callable, Iterable, Iterator
-from typing import cast, Final, Never, TypeVar
+from typing import cast, Final
 
 __all__ = ['CAF', 'caf']
 
-I = TypeVar('I')
-T = TypeVar('T')
-
 
 class CAF[I]():
 
-    L = TypeVar('L')
-    R = TypeVar('R')
-    U = TypeVar('U')
-
     __slots__ = '_items', '_cnt', '_cap', '_front', '_rear'
 
     def __init__(
@@ -45,7 +42,8 @@ class CAF[I]():
             items: Iterable[I] | None = None,
             capacity: int = 2
         ) -> None:
-        """Basically a list that can be grown from both ends
+        """
+        Basically a list that can be grown from both ends
         in O(1) time and space complexity.
 
         :param items: optional iterable to initial populate circular array
@@ -203,7 +201,8 @@ class CAF[I]():
         return True
 
     def pushl(self, item: I) -> None:
-        """Push single item onto left side (front) of circular array.
+        """
+        Push single item onto left side (front) of circular array.
 
         :param item: single item pushed onto circular array from left
         :raises ValueError: when called on a full CAF
@@ -224,7 +223,8 @@ class CAF[I]():
             )
 
     def pushr(self, item: I) -> None:
-        """Push a single item onto right side (rear) of circular array.
+        """
+        Push a single item onto right side (rear) of circular array.
 
         :param item: single item pushed onto circular array from right
         :raises ValueError: when called on a full fixed storage capacity circular array
@@ -244,10 +244,11 @@ class CAF[I]():
                 self._cnt + 1,
             )
 
-    def popl(self) -> I | Never:
-        """Pop item off left side (front) of circular array.
+    def popl(self) -> I:
+        """
+        Pop item off left side (front) of circular array.
 
-        :return: item popped from left side of circular array
+        :returns: item popped from left side of circular array
         :raises ValueError: when called on an empty circular array
 
         """
@@ -282,10 +283,11 @@ class CAF[I]():
             raise ValueError(msg)
         return cast(I, d)
 
-    def popr(self) -> I | Never:
-        """Pop item off right side (rear) of circular array.
+    def popr(self) -> I:
+        """
+        Pop item off right side (rear) of circular array.
 
-        :return: item popped from right side of circular array
+        :returns: item popped from right side of circular array
         :raises ValueError: when called on an empty circular array
 
         """
@@ -321,15 +323,12 @@ class CAF[I]():
         return cast(I, d)
 
     def popld(self, default: I) -> I:
-        """Pop one item from left side of the circular array, provide
-        a mandatory default value. "Safe" version of popl.
-
-
+        """
         Pop one item from left side of the circular array, provide
         a mandatory default value. "Safe" version of popl.
 
         :param default: item returned if circular array is empty
-        :return: item popped from left side or default item if empty
+        :returns: item popped from left side or default item if empty
 
         """
         try:
@@ -338,11 +337,12 @@ class CAF[I]():
             return default
 
     def poprd(self, default: I) -> I:
-        """Pop one item from right side of the circular array, provide
+        """
+        Pop one item from right side of the circular array, provide
         a mandatory default value. "Safe" version of popr.
 
         :param default: item returned if circular array is empty
-        :return: item popped from right side or default item if empty
+        :returns: item popped from right side or default item if empty
 
         """
         try:
@@ -351,10 +351,11 @@ class CAF[I]():
             return default
 
     def poplt(self, maximum: int) -> tuple[I, ...]:
-        """Pop multiple items from left side of circular array.
+        """
+        Pop multiple items from left side of circular array.
 
         :param maximum: maximum number of items to pop, may pop less if not enough items
-        :return: items in the order popped, left to right
+        :returns: items in the order popped, left to right
 
         """
         item_list: list[I] = []
@@ -370,10 +371,11 @@ class CAF[I]():
         return tuple(item_list)
 
     def poprt(self, maximum: int) -> tuple[I, ...]:
-        """Pop multiple items from right side of circular array.
+        """
+        Pop multiple items from right side of circular array.
 
         :param maximum: maximum number of items to pop, may pop less if not enough items
-        :return: items in the order popped, right to left
+        :returns: items in the order popped, right to left
 
         """
         item_list: list[I] = []
@@ -387,7 +389,8 @@ class CAF[I]():
         return tuple(item_list)
 
     def rotl(self, n: int = 1) -> None:
-        """Rotate items left.
+        """
+        Rotate items to the left.
 
         :param n: number of times to shift elements to the left
 
@@ -398,7 +401,8 @@ class CAF[I]():
             self.pushr(self.popl())
 
     def rotr(self, n: int = 1) -> None:
-        """Rotate items right.
+        """
+        Rotate items to the right.
 
         :param n: number of times to shift elements to the right
 
@@ -409,20 +413,22 @@ class CAF[I]():
             self.pushl(self.popr())
 
     def map[U](self, f: Callable[[I], U]) -> "CAF[U]":
-        """Apply function f over the circular array's contents,
+        """
+        Apply function ``f`` over the circular array's contents,
 
         :param f: callable from type I to type U
-        :return: new fixed circular array instance
+        :returns: new fixed circular array instance
 
         """
         return CAF(map(f, self), self._cap)
 
-    def foldl[L](self, f: Callable[[L, I], L], start: L | None = None) -> L | Never:
-        """Fold left with a function and optional stating item.
+    def foldl[L](self, f: Callable[[L, I], L], start: L | None = None) -> L:
+        """
+        Fold left with a function and optional stating item.
 
         :param f: first argument to f is for the accumulator
         :param start: optional starting item
-        :return: reduced value produced by the left fold
+        :returns: reduced value produced by the left fold
         :raises ValueError: when circular array empty and no starting item given
 
         """
@@ -443,12 +449,13 @@ class CAF[I]():
             acc = f(acc, d)
         return acc
 
-    def foldr[R](self, f: Callable[[I, R], R], start: R | None = None) -> R | Never:
-        """Fold right with a function and an optional starting item.
+    def foldr[R](self, f: Callable[[I, R], R], start: R | None = None) -> R:
+        """
+        Fold right with a function and an optional starting item.
 
         :param f: second argument to f is for the accumulator
         :param start: optional starting item
-        :return: reduced value produced by the right fold
+        :returns: reduced value produced by the right fold
         :raises ValueError: when circular array empty and no starting item given
 
         """
@@ -470,15 +477,17 @@ class CAF[I]():
         return acc
 
     def capacity(self) -> int:
-        """Return fixed storage capacity of the circular array.
+        """
+        Return fixed storage capacity of the circular array.
 
-        :return: fixed storage capacity
+        :returns: fixed storage capacity
 
         """
         return self._cap
 
     def empty(self) -> None:
-        """Empty the circular array."""
+        """
+        Empty the circular array."""
         (
                 self._items,
                 self._front,
@@ -492,20 +501,22 @@ class CAF[I]():
             )
 
     def fraction_filled(self) -> float:
-        """Find fraction of the storage capacity which is filled.
+        """
+        Find fraction of the storage capacity which is filled.
 
-        :return: the ratio count/capacity
+        :returns: the ratio count/capacity
 
         """
         return self._cnt / self._cap
 
 
 def caf[T](*items: T, capacity: int = 2) -> CAF[T]:
-    """Produce a circular array from a variable number of arguments.
+    """
+    Produce a circular array from a variable number of arguments.
 
     :param items: initial items for a new circular array
     :param capacity: the minimum storage capacity to set
-    :return: new fixed storage capacity circular array
+    :returns: new fixed storage capacity circular array
 
     """
     return CAF(items, capacity = capacity)

pythonic_fp/circulararray/fixed.pyi

@@ -1,89 +1,32 @@
-# Copyright 2023-2025 Geoffrey R. Scheller
-#
-# 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.
-
 from collections.abc import Callable, Iterable, Iterator
-from typing import Never, TypeVar
 
 __all__ = ['CAF', 'caf']
 
-I = TypeVar('I')
-T = TypeVar('T')
-
-
-class CAF[I]():
-
-    L = TypeVar('L')
-    R = TypeVar('R')
-    U = TypeVar('U')
-
-    def __init__(
-            self,
-            items: Iterable[I] | None = None,
-            capacity: int = 2
-        ) -> None: ...
-
+class CAF[I]:
+    def __init__(self, items: Iterable[I] | None = None, capacity: int = 2) -> None: ...
     def __iter__(self) -> Iterator[I]: ...
-
     def __reversed__(self) -> Iterator[I]: ...
-
-    def __repr__(self) -> str: ...
-
-    def __str__(self) -> str: ...
-
     def __bool__(self) -> bool: ...
-
     def __len__(self) -> int: ...
-
     def __getitem__(self, idx: int) -> I: ...
-
     def __setitem__(self, idx: int, val: I) -> None: ...
-
     def __delitem__(self, idx: int) -> None: ...
-
     def __eq__(self, other: object) -> bool: ...
-
     def pushl(self, item: I) -> None: ...
-
     def pushr(self, item: I) -> None: ...
-
-    def popl(self) -> I | Never: ...
-
-    def popr(self) -> I | Never: ...
-
+    def popl(self) -> I: ...
+    def popr(self) -> I: ...
     def popld(self, default: I) -> I: ...
-
     def poprd(self, default: I) -> I: ...
-
     def poplt(self, maximum: int) -> tuple[I, ...]: ...
-
     def poprt(self, maximum: int) -> tuple[I, ...]: ...
-
     def rotl(self, n: int = 1) -> None: ...
-
     def rotr(self, n: int = 1) -> None: ...
-
     def map[U](self, f: Callable[[I], U]) -> CAF[U]: ...
-
-    def foldl[L](self, f: Callable[[L, I], L], start: L | None = None) -> L | Never: ...
-
-    def foldr[R](self, f: Callable[[I, R], R], start: R | None = None) -> R | Never: ...
-
+    def foldl[L](self, f: Callable[[L, I], L], start: L | None = None) -> L: ...
+    def foldr[R](self, f: Callable[[I, R], R], start: R | None = None) -> R: ...
     def capacity(self) -> int: ...
-
     def empty(self) -> None: ...
-
     def fraction_filled(self) -> float: ...
 
-
 def caf[T](*items: T, capacity: int = 2) -> CAF[T]: ...

{pythonic_fp_circulararray-5.3.0.dist-info → pythonic_fp_circulararray-5.3.2.dist-info}/METADATA

@@ -1,10 +1,10 @@
 Metadata-Version: 2.4
 Name: pythonic-fp-circulararray
-Version: 5.3.0
-Summary: Package implementing stateful circular array data structures.
-Keywords: auto resizing,circular array,dequeue,indexable,pop,push
+Version: 5.3.2
+Summary: Circular Array
+Keywords: auto resizing,circular array,circulararray,dequeue,indexable,pop,push
 Author-email: "Geoffrey R. Scheller" <geoffrey@scheller.com>
-Requires-Python: >=3.12
+Requires-Python: >=3.13
 Description-Content-Type: text/x-rst
 Classifier: Development Status :: 5 - Production/Stable
 Classifier: Framework :: Pytest
@@ -17,16 +17,16 @@ License-File: LICENSE
 Requires-Dist: pytest>=8.4.1 ; extra == "test"
 Project-URL: Changelog, https://github.com/grscheller/pythonic-fp-circulararray/blob/main/CHANGELOG.rst
 Project-URL: Documentation, https://grscheller.github.io/pythonic-fp/circulararray/development/build/html/releases.html
-Project-URL: Homepage, https://github.com/grscheller/pythonic-fp/blob/main/README.rst
+Project-URL: Homepage, https://github.com/grscheller/pythonic-fp/blob/main/README.md
 Project-URL: Source, https://github.com/grscheller/pythonic-fp-circulararray
 Provides-Extra: test
 
-PPythonic FP - Circular Array
-=============================
+Pythonic FP - Circular Array
+============================
 
 PyPI project
-`pythonic-fp.circulararray
-<https://pypi.org/project/pythonic-fp.circulararray>`_.
+`pythonic-fp-circulararray
+<https://pypi.org/project/pythonic-fp-circulararray>`_.
 
 Python module implementing stateful circular array data structures.
 

pythonic_fp_circulararray-5.3.2.dist-info/RECORD

@@ -0,0 +1,10 @@
+pythonic_fp/circulararray/__init__.py,sha256=4RaMexsQxHwp80j3Z75_td8PGRqLoz1yMvK_ZZ07vi8,1516
+pythonic_fp/circulararray/auto.py,sha256=YIBKvnjerpCg8hmcAS-HSSjGRZSD4C7S_RyCNH4FwoE,19502
+pythonic_fp/circulararray/auto.pyi,sha256=yfQ2kzIiXFb2Bpg3cMwHwv2oSlyOUMTgmdPZM_-oU_8,1669
+pythonic_fp/circulararray/fixed.py,sha256=G58qee_2Rl9e-4hG3vZrQIJTDbpqoECpT-d2M98BcgY,15494
+pythonic_fp/circulararray/fixed.pyi,sha256=y_7eMvH18B1lpLPp2P-VkN-xcQVKJn6cOisp9LSBBRk,1362
+pythonic_fp/circulararray/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pythonic_fp_circulararray-5.3.2.dist-info/licenses/LICENSE,sha256=psuoW8kuDP96RQsdhzwOqi6fyWv0ct8CR6Jr7He_P_k,10173
+pythonic_fp_circulararray-5.3.2.dist-info/WHEEL,sha256=G2gURzTEtmeR8nrdXUJfNiB3VYVxigPQ-bEQujpNiNs,82
+pythonic_fp_circulararray-5.3.2.dist-info/METADATA,sha256=DJnFE-yTJU7yhdQNjXA4lTc4tsWWp1zULxsBlN5e46w,2183
+pythonic_fp_circulararray-5.3.2.dist-info/RECORD,,

pythonic_fp_circulararray-5.3.0.dist-info/RECORD

@@ -1,10 +0,0 @@
-pythonic_fp/circulararray/__init__.py,sha256=YjAKcjcSpEYW5mhTiGwtnx9xhCdK68CrAiYAhlqSkCY,1484
-pythonic_fp/circulararray/auto.py,sha256=DzQJl6-Yuns3pgYe7a_pgKxEPY5RBx8gHD4rUIvhHcc,19407
-pythonic_fp/circulararray/auto.pyi,sha256=xK10nhGdyHcBSEsaWfZA83y3fZc89FP2_YsFAO7Iyzc,2647
-pythonic_fp/circulararray/fixed.py,sha256=-FhBFwxnSgeqJhNLSARM_jhUIr0nPmFiMmGXMWotmMc,15533
-pythonic_fp/circulararray/fixed.pyi,sha256=HhAWh7hHl432wsvMUuTrlqgzZ7MSK7mpWF4k_Wq32Xk,2263
-pythonic_fp/circulararray/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-pythonic_fp_circulararray-5.3.0.dist-info/licenses/LICENSE,sha256=psuoW8kuDP96RQsdhzwOqi6fyWv0ct8CR6Jr7He_P_k,10173
-pythonic_fp_circulararray-5.3.0.dist-info/WHEEL,sha256=G2gURzTEtmeR8nrdXUJfNiB3VYVxigPQ-bEQujpNiNs,82
-pythonic_fp_circulararray-5.3.0.dist-info/METADATA,sha256=MZHH8D03wZ1d6iazBeOuQTTS0c63ajCzx9D6svbIRIE,2219
-pythonic_fp_circulararray-5.3.0.dist-info/RECORD,,