pythonic-fp-circulararray 6.0.3__py3-none-any.whl → 6.1.0__py3-none-any.whl

pythonic_fp/circulararray/__init__.py

@@ -14,19 +14,17 @@
 
 """
 Circular Array
---------------
+==============
 
-.. admonition:: Stateful circular array data structures.
+.. admonition:: Stateful circular array data structures
 
-    - O(1) pops and pushes either end
+    - O(1) pops and pushes on either side
     - O(1) size determination
     - O(1) indexing
-    - Two types of circular arrays, fixed and variable capacity
+    - two types of circular arrays
 
-.. note::
-
-    - Class constructors ``CA`` and ``CAF`` take an optional iterator to populate circular array.
-    - Factory Functions ``ca`` and ``caf`` take a variable number of parameters to populate circular array.
+      - fixed capacity: ``CAF``
+      - variable capacity: ``CA``
 
 """
 

pythonic_fp/circulararray/auto.py

@@ -12,20 +12,6 @@
 # See the License for the specific language governing permissions and
 # limitations under the License.
 
-"""
-.. admonition:: Variable storage capacity circular array CA
-
-    - O(1) pops either end
-    - O(1) amortized pushes either end
-    - O(1) indexing, fully supports slicing
-    - auto-resizing more storage capacity when necessary, manually compatible
-    - iterable, safely mutates while iterators iterating over previous state
-    - comparisons compare identity before equality, like builtins
-    - in boolean context, falsy when empty, otherwise truthy
-    - function ``ca`` produces auto-resizing circular array from arguments
-
-"""
-
 from collections.abc import Callable, Iterable, Iterator
 from typing import cast, Final, overload
 from pythonic_fp.gadgets.sentinels.novalue import NoValue
@@ -36,17 +22,31 @@ nada: Final[NoValue] = NoValue()
 
 
 class CA[X]:
+    """
+    .. admonition:: Variable storage capacity circular array CA
+
+        - O(1) pops either end
+        - O(1) amortized pushes either end
+        - O(1) indexing, fully supports slicing
+        - auto-resizing more storage capacity when necessary, manually compatible
+        - iterable but not threadsafe
+        - comparisons compare identity before equality, like builtins
+        - in boolean context, falsy when empty, otherwise truthy
+        - function ``ca`` produces auto-resizing circular array from arguments
+
+    """
     __slots__ = '_xs', '_cnt', '_cap', '_front', '_rear'
 
     def __init__(self, *xs: Iterable[X]) -> None:
         """
-        :param xs: Optionally takes a single iterable to initially populate the circular array.
-        :raises TypeError: When ``xs[0]`` not iterable.
-        :raises ValueError: If more than 1 iterable is given.
+        :param xs: Takes 0 or 1 iterable parameters to initially
+                   populate the ``CA`` left (front) to right (back).
+        :raises ValueError: When more than one iterable is provided.
+        :raises TypeError: When passed a non-iterable parameter.
 
         """
         if (size := len(xs)) > 1:
-            msg = f'CA expects at most 1 argument, got {size}'
+            msg = f'CA expects at most 1 iterable, got {size}'
             raise ValueError(msg)
         if size:
             values: list[X | NoValue] = list(cast(Iterable[X | NoValue], xs[0]))
@@ -139,6 +139,61 @@ class CA[X]:
                         + [nada],
                     )
 
+    def __bool__(self) -> bool:
+        return self._cnt > 0
+
+    def __len__(self) -> int:
+        return self._cnt
+
+    def __eq__(self, other: object) -> bool:
+        """
+        .. admonition:: Equality comparison
+
+            Efficiently compare ``CA`` to another object.
+
+        :param other: The object to be compared.
+        :returns: ``True`` if ``other`` is another ``CA`` whose
+                  contents compare as equal to the corresponding
+                  contents of the ``CA``, otherwise ``False``.
+
+        """
+        if self is other:
+            return True
+        if not isinstance(other, type(self)):
+            return False
+
+        (
+            front1,
+            cnt1,
+            capacity1,
+            front2,
+            cnt2,
+            capacity2,
+        ) = (
+            self._front,
+            self._cnt,
+            self._cap,
+            other._front,
+            other._cnt,
+            other._cap,
+        )
+
+        if cnt1 != cnt2:
+            return False
+
+        for nn in range(cnt1):
+            if (
+                self._xs[(front1 + nn) % capacity1]
+                is other._xs[(front2 + nn) % capacity2]
+            ):
+                continue
+            if (
+                self._xs[(front1 + nn) % capacity1]
+                != other._xs[(front2 + nn) % capacity2]
+            ):
+                return False
+        return True
+
     def __iter__(self) -> Iterator[X]:
         if self._cnt > 0:
             (
@@ -177,26 +232,6 @@ class CA[X]:
                 position = (position - 1) % capacity
             yield cast(X, current_state[position])
 
-    def __repr__(self) -> str:
-        """
-        :returns: String of the form ``ca(x1, x2, ..., xn)``.
-
-        """
-        return 'ca(' + ', '.join(map(repr, self)) + ')'
-
-    def __str__(self) -> str:
-        """
-        :returns: String of the form ``(|x1, x2, ..., xn|)``.
-
-        """
-        return '(|' + ', '.join(map(str, self)) + '|)'
-
-    def __bool__(self) -> bool:
-        return self._cnt > 0
-
-    def __len__(self) -> int:
-        return self._cnt
-
     @overload
     def __getitem__(self, idx: int) -> X: ...
     @overload
@@ -289,50 +324,31 @@ class CA[X]:
         )
         del _ca
 
-    def __eq__(self, other: object) -> bool:
+    def __repr__(self) -> str:
         """
-        :param other: The object to be compared to.
-        :returns: ``True`` if object is another ``CA`` whose items compare
-                  as equal to the corresponding items in the ``CA``,
-                  otherwise ``False``.
+        .. admonition:: String representation
+
+            Return 'CA("repr(x1)", "repr(x2)", ..., "repr(xn)")'
+            where x1, x2, ..., xn are the circular array's
+            contents and "repr(xi)" is the repr-string for xi.
+
+        :returns: A string to reproduce the ``CA``. 
 
         """
-        if self is other:
-            return True
-        if not isinstance(other, type(self)):
-            return False
+        return 'ca(' + ', '.join(map(repr, self)) + ')'
 
-        (
-            front1,
-            cnt1,
-            capacity1,
-            front2,
-            cnt2,
-            capacity2,
-        ) = (
-            self._front,
-            self._cnt,
-            self._cap,
-            other._front,
-            other._cnt,
-            other._cap,
-        )
+    def __str__(self) -> str:
+        r"""
+        .. admonition:: User string
 
-        if cnt1 != cnt2:
-            return False
+            Return string '(\| x1, x2, ..., xn \|)'
+            where x1, x2, ..., xn are the circular array's
+            contents displayed as strings.
 
-        for nn in range(cnt1):
-            if (
-                self._xs[(front1 + nn) % capacity1]
-                is other._xs[(front2 + nn) % capacity2]
-            ):
-                continue
-            if (
-                self._xs[(front1 + nn) % capacity1]
-                != other._xs[(front2 + nn) % capacity2]
-            ):
-                return False
-        return True
+        :returns: A string meaningful to an end user.
+
+        """
+        return '(| ' + ', '.join(map(str, self)) + ' |)'
 
     def pushl(self, *xs: X) -> None:
         """
@@ -344,7 +360,7 @@ class CA[X]:
         :param xs: Items to be pushed onto the front of the circular array from the left.
 
         """
-        for item in xs:
+        for x in xs:
             if self._cnt == self._cap:
                 self._double_storage_capacity()
             (
@@ -353,7 +369,7 @@ class CA[X]:
                 self._cnt,
             ) = (
                 (self._front - 1) % self._cap,
-                item,
+                x,
                 self._cnt + 1,
             )
 
@@ -392,7 +408,7 @@ class CA[X]:
         """
         if self._cnt > 1:
             (
-                d,
+                x,
                 self._xs[self._front],
                 self._front,
                 self._cnt,
@@ -404,7 +420,7 @@ class CA[X]:
             )
         elif self._cnt == 1:
             (
-                d,
+                x,
                 self._xs[self._front],
                 self._cnt,
                 self._front,
@@ -419,7 +435,7 @@ class CA[X]:
         else:
             msg = 'Method popl called on an empty CA'
             raise ValueError(msg)
-        return cast(X, d)
+        return cast(X, x)
 
     def popr(self) -> X:
         """
@@ -433,7 +449,7 @@ class CA[X]:
         """
         if self._cnt > 1:
             (
-                d,
+                x,
                 self._xs[self._rear],
                 self._rear,
                 self._cnt,
@@ -445,7 +461,7 @@ class CA[X]:
             )
         elif self._cnt == 1:
             (
-                d,
+                x,
                 self._xs[self._front],
                 self._cnt,
                 self._front,
@@ -460,7 +476,7 @@ class CA[X]:
         else:
             msg = 'Method popr called on an empty CA'
             raise ValueError(msg)
-        return cast(X, d)
+        return cast(X, x)
 
     def popld(self, default: X) -> X:
         """
@@ -506,17 +522,17 @@ class CA[X]:
         :returns: A ``tuple`` of the items popped, left to right.
 
         """
-        item_list: list[X] = []
+        xs: list[X] = []
 
         while maximum > 0:
             try:
-                item_list.append(self.popl())
+                xs.append(self.popl())
             except ValueError:
                 break
             else:
                 maximum -= 1
 
-        return tuple(item_list)
+        return tuple(xs)
 
     def poprt(self, maximum: int) -> tuple[X, ...]:
         """
@@ -610,8 +626,8 @@ class CA[X]:
             return acc
 
         acc = cast(L, start)
-        for d in self:
-            acc = f(acc, d)
+        for x in self:
+            acc = f(acc, x)
         return acc
 
     @overload
@@ -644,8 +660,8 @@ class CA[X]:
             return acc
 
         acc = cast(R, start)
-        for d in reversed(self):
-            acc = f(d, acc)
+        for x in reversed(self):
+            acc = f(x, acc)
         return acc
 
     def capacity(self) -> int:

pythonic_fp/circulararray/fixed.py

@@ -12,19 +12,6 @@
 # See the License for the specific language governing permissions and
 # limitations under the License.
 
-"""
-.. admonition:: Fixed storage capacity circular array CAF
-
-    - O(1) pops and pushes either end
-    - O(1) indexing, does not support slicing
-    - fixed total storage capacity
-    - iterable, safely mutates while iterators iterating over previous state
-    - comparisons compare identity before equality, like builtins
-    - in boolean context, falsy when either empty or full, otherwise truthy
-    - function ``caf`` produces fixed capacity circular array from arguments
-
-"""
-
 from collections.abc import Callable, Iterable, Iterator
 from typing import cast, Final, overload
 from pythonic_fp.gadgets.sentinels.novalue import NoValue
@@ -35,19 +22,33 @@ nada: Final[NoValue] = NoValue()
 
 
 class CAF[X]:
+
+    """
+    .. admonition:: Fixed storage capacity circular array CAF
+
+        - O(1) pops and pushes either end
+        - O(1) indexing, does not support slicing
+        - fixed total storage capacity
+        - iterable but not threadsafe
+        - comparisons compare identity before equality, like builtins
+        - in boolean context, falsy when either empty or full, otherwise truthy
+        - function ``caf`` produces fixed capacity circular array from arguments
+
+    """
     __slots__ = '_xs', '_cnt', '_cap', '_front', '_rear'
 
     def __init__(self, *xs: Iterable[X], cap: int = 2) -> None:
         """
-        :param xs: Optionally takes a single iterable to initially populate the circular array.
+        :param xs: Takes 0 or 1 iterable parameters to initially
+                   populate the ``CAF`` left (front) to right (back).
         :param cap: Minimum fixed storage capacity of circular array.
-        :raises TypeError: When ``xs[0]`` not iterable,
-        :raises ValueError: If more than 1 iterable is given.
+        :raises ValueError: When more than one iterable is provided.
+        :raises TypeError: When passed a non-iterable positional parameter.
 
         """
         cap = max(2, cap)
         if (size := len(xs)) > 1:
-            msg = f'CAF expects at most 1 argument, got {size}'
+            msg = f'CAF expects at most 1 iterable, got {size}'
             raise ValueError(msg)
         if size:
             values: list[X | NoValue] = list(cast(Iterable[X | NoValue], xs[0]))
@@ -66,6 +67,61 @@ class CAF[X]:
             self._front = 0
             self._rear = cnt - 1
 
+    def __bool__(self) -> bool:
+        return 0 < self._cnt < self._cap
+
+    def __len__(self) -> int:
+        return self._cnt
+
+    def __eq__(self, other: object) -> bool:
+        """
+        .. admonition:: Equality comparison
+
+            Efficiently compare ``CAF`` to another object.
+
+        :param other: The object to be compared.
+        :returns: ``True`` if ``other`` is another ``CAF`` whose
+                  contents compare as equal to the corresponding
+                  contents of the ``CAF``, otherwise ``False``.
+
+        """
+        if self is other:
+            return True
+        if not isinstance(other, type(self)):
+            return False
+
+        (
+            front1,
+            cnt1,
+            cap1,
+            front2,
+            cnt2,
+            cap2,
+        ) = (
+            self._front,
+            self._cnt,
+            self._cap,
+            other._front,
+            other._cnt,
+            other._cap,
+        )
+
+        if cnt1 != cnt2:
+            return False
+
+        for nn in range(cnt1):
+            if (
+                self._xs[(front1 + nn) % cap1]
+                is other._xs[(front2 + nn) % cap2]
+            ):
+                continue
+            if (
+                self._xs[(front1 + nn) % cap1]
+                != other._xs[(front2 + nn) % cap2]
+            ):
+                return False
+        return True
+
     def __iter__(self) -> Iterator[X]:
         if self._cnt > 0:
             (
@@ -104,26 +160,6 @@ class CAF[X]:
                 position = (position - 1) % cap
             yield cast(X, current_state[position])
 
-    def __repr__(self) -> str:
-        """
-        :returns: String of the form ``caf(x1, x2, ..., xn)``.
-
-        """
-        return 'caf(' + ', '.join(map(repr, self)) + ')'
-
-    def __str__(self) -> str:
-        """
-        :returns: String of the form ``(|x1, x2, ..., xn|)``.
-
-        """
-        return '(|' + ', '.join(map(str, self)) + '|)'
-
-    def __bool__(self) -> bool:
-        return 0 < self._cnt < self._cap
-
-    def __len__(self) -> int:
-        return self._cnt
-
     def __getitem__(self, idx: int) -> X:
         cnt = self._cnt
         if 0 <= idx < cnt:
@@ -173,52 +209,33 @@ class CAF[X]:
         )
         del _ca
 
-    def __eq__(self, other: object) -> bool:
+    def __repr__(self) -> str:
         """
-        :param other: The object to be compared to.
-        :returns: ``True`` if object is another ``CAF`` whose items compare
-                  as equal to the corresponding items in the ``CAF``,
-                  otherwise ``False``.
+        .. admonition:: String representation
+
+            Return 'CAF("repr(x1)", "repr(x2)", ..., "repr(xn)")'
+            where x1, x2, ..., xn are the circular array's
+            contents and "repr(xi)" is the repr-string for xi.
+
+        :returns: A string to reproduce the ``CAF``.
 
         """
-        if self is other:
-            return True
-        if not isinstance(other, type(self)):
-            return False
+        return 'caf(' + ', '.join(map(repr, self)) + ')'
 
-        (
-            front1,
-            cnt1,
-            cap1,
-            front2,
-            cnt2,
-            cap2,
-        ) = (
-            self._front,
-            self._cnt,
-            self._cap,
-            other._front,
-            other._cnt,
-            other._cap,
-        )
+    def __str__(self) -> str:
+        r"""
+        .. admonition:: User string
 
-        if cnt1 != cnt2:
-            return False
+            Return '(\|x1, x2, ..., xn\|)'
+            where x1, x2, ..., xn are the circular array's
+            contents displayed as strings.
 
-        for nn in range(cnt1):
-            if (
-                self._xs[(front1 + nn) % cap1]
-                is other._xs[(front2 + nn) % cap2]
-            ):
-                continue
-            if (
-                self._xs[(front1 + nn) % cap1]
-                != other._xs[(front2 + nn) % cap2]
-            ):
-                return False
-        return True
+        :returns: A string meaningful to an end user.
+
+        """
+        return '(|' + ', '.join(map(str, self)) + '|)'
 
-    def pushl(self, item: X) -> None:
+    def pushl(self, x: X) -> None:
         """
         .. admonition:: Push left
 
@@ -238,11 +255,11 @@ class CAF[X]:
             self._cnt,
         ) = (
             (self._front - 1) % self._cap,
-            item,
+            x,
             self._cnt + 1,
         )
 
-    def pushr(self, item: X) -> None:
+    def pushr(self, x: X) -> None:
         """
         .. admonition:: Push right
 
@@ -262,7 +279,7 @@ class CAF[X]:
             self._cnt,
         ) = (
             (self._rear + 1) % self._cap,
-            item,
+            x,
             self._cnt + 1,
         )
 
@@ -278,7 +295,7 @@ class CAF[X]:
         """
         if self._cnt > 1:
             (
-                d,
+                x,
                 self._xs[self._front],
                 self._front,
                 self._cnt,
@@ -290,7 +307,7 @@ class CAF[X]:
             )
         elif self._cnt == 1:
             (
-                d,
+                x,
                 self._xs[self._front],
                 self._cnt,
                 self._front,
@@ -305,7 +322,7 @@ class CAF[X]:
         else:
             msg = 'Method popl called on an empty CAF'
             raise ValueError(msg)
-        return cast(X, d)
+        return cast(X, x)
 
     def popr(self) -> X:
         """
@@ -319,7 +336,7 @@ class CAF[X]:
         """
         if self._cnt > 1:
             (
-                d,
+                x,
                 self._xs[self._rear],
                 self._rear,
                 self._cnt,
@@ -331,7 +348,7 @@ class CAF[X]:
             )
         elif self._cnt == 1:
             (
-                d,
+                x,
                 self._xs[self._front],
                 self._cnt,
                 self._front,
@@ -346,7 +363,7 @@ class CAF[X]:
         else:
             msg = 'Method popr called on an empty CAF'
             raise ValueError(msg)
-        return cast(X, d)
+        return cast(X, x)
 
     def popld(self, default: X) -> X:
         """
@@ -392,17 +409,17 @@ class CAF[X]:
         :returns: A ``tuple`` of the items popped, left to right.
 
         """
-        item_list: list[X] = []
+        xs: list[X] = []
 
         while maximum > 0:
             try:
-                item_list.append(self.popl())
+                xs.append(self.popl())
             except ValueError:
                 break
             else:
                 maximum -= 1
 
-        return tuple(item_list)
+        return tuple(xs)
 
     def poprt(self, maximum: int) -> tuple[X, ...]:
         """
@@ -414,15 +431,15 @@ class CAF[X]:
         :returns: A ``tuple`` of the items popped, right to left.
 
         """
-        item_list: list[X] = []
+        xs: list[X] = []
         while maximum > 0:
             try:
-                item_list.append(self.popr())
+                xs.append(self.popr())
             except ValueError:
                 break
             else:
                 maximum -= 1
-        return tuple(item_list)
+        return tuple(xs)
 
     def rotl(self, n: int = 1) -> None:
         """
@@ -496,8 +513,8 @@ class CAF[X]:
             return acc
 
         acc = cast(L, start)
-        for d in self:
-            acc = f(acc, d)
+        for x in self:
+            acc = f(acc, x)
         return acc
 
     @overload
@@ -530,8 +547,8 @@ class CAF[X]:
             return acc
 
         acc = cast(R, start)
-        for d in reversed(self):
-            acc = f(d, acc)
+        for x in reversed(self):
+            acc = f(x, acc)
         return acc
 
     def capacity(self) -> int:

{pythonic_fp_circulararray-6.0.3.dist-info → pythonic_fp_circulararray-6.1.0.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pythonic-fp-circulararray
-Version: 6.0.3
+Version: 6.1.0
 Summary: Circular Array
 Keywords: auto resizing,circular array,circulararray,dequeue,indexable,pop,push
 Author-email: "Geoffrey R. Scheller" <geoffrey@scheller.com>
@@ -17,8 +17,8 @@ License-File: LICENSE
 Requires-Dist: pythonic-fp-gadgets>=4.0.2
 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/
-Project-URL: Homepage, https://grscheller.github.io/pythonic-fp/homepage/build/html/
+Project-URL: Documentation, https://grscheller.github.io/pythonic-fp/projects/circulararray.html
+Project-URL: Homepage, https://grscheller.github.io/pythonic-fp/
 Project-URL: Source, https://github.com/grscheller/pythonic-fp-circulararray
 Provides-Extra: test
 
@@ -54,15 +54,15 @@ Python module implementing stateful circular array data structures.
 
 Part of the
 `pythonic-fp
-<https://grscheller.github.io/pythonic-fp>`_
+<https://grscheller.github.io/pythonic-fp/>`_
 PyPI projects.
 
 Documentation
 -------------
 
-Documentation for this project is hosted on
+Documentation and other links for this project are hosted on
 `GitHub Pages
-<https://grscheller.github.io/pythonic-fp-circulararray>`_.
+<https://grscheller.github.io/pythonic-fp/projects/circulararray.html>`_.
 
 Copyright and License
 ---------------------

pythonic_fp_circulararray-6.1.0.dist-info/RECORD

@@ -0,0 +1,11 @@
+pythonic_fp/circulararray/__init__.py,sha256=PJsikfFReHq2QXpmcg_AYeBbuyauGjfJ9bBdc2YNtzo,1016
+pythonic_fp/circulararray/__init__.pyi,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pythonic_fp/circulararray/auto.py,sha256=HNi_xbjITgqMYx-ReqzFSkd3CViPLvLky83PnUVJm94,21669
+pythonic_fp/circulararray/auto.pyi,sha256=kSJ3b7tleHTZIWy3QmYPTmJJ54xNb4lC8ipNBhtyGsA,1786
+pythonic_fp/circulararray/fixed.py,sha256=XyoQFIRCzxDWMBSb1CRWzjYhlsQmFNSG58ZxmRjgtJg,17647
+pythonic_fp/circulararray/fixed.pyi,sha256=SUtEp8QWNKwJKJ5PzqL3MIuAHfAkIJU1Dy_BlqaWb48,1503
+pythonic_fp/circulararray/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pythonic_fp_circulararray-6.1.0.dist-info/licenses/LICENSE,sha256=psuoW8kuDP96RQsdhzwOqi6fyWv0ct8CR6Jr7He_P_k,10173
+pythonic_fp_circulararray-6.1.0.dist-info/WHEEL,sha256=G2gURzTEtmeR8nrdXUJfNiB3VYVxigPQ-bEQujpNiNs,82
+pythonic_fp_circulararray-6.1.0.dist-info/METADATA,sha256=XzABxLHhGc6NYy5INTWSOuSe67Hn5EaSH3dBMl2ghyI,2699
+pythonic_fp_circulararray-6.1.0.dist-info/RECORD,,

pythonic_fp_circulararray-6.0.3.dist-info/RECORD

@@ -1,11 +0,0 @@
-pythonic_fp/circulararray/__init__.py,sha256=MYPgNiLNoBf84VldZ7r0iszP13kaG0AxJF3pOOUETJg,1193
-pythonic_fp/circulararray/__init__.pyi,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-pythonic_fp/circulararray/auto.py,sha256=u7PPffiRhCs3EXDkH65REi0ZYGLEnEgOf7NT8RQHQ5c,21119
-pythonic_fp/circulararray/auto.pyi,sha256=kSJ3b7tleHTZIWy3QmYPTmJJ54xNb4lC8ipNBhtyGsA,1786
-pythonic_fp/circulararray/fixed.py,sha256=SJ6vlp0g3NlTAwWRk3PPTtA8uoJlg0kMg5JCBg13Ji0,17125
-pythonic_fp/circulararray/fixed.pyi,sha256=SUtEp8QWNKwJKJ5PzqL3MIuAHfAkIJU1Dy_BlqaWb48,1503
-pythonic_fp/circulararray/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-pythonic_fp_circulararray-6.0.3.dist-info/licenses/LICENSE,sha256=psuoW8kuDP96RQsdhzwOqi6fyWv0ct8CR6Jr7He_P_k,10173
-pythonic_fp_circulararray-6.0.3.dist-info/WHEEL,sha256=G2gURzTEtmeR8nrdXUJfNiB3VYVxigPQ-bEQujpNiNs,82
-pythonic_fp_circulararray-6.0.3.dist-info/METADATA,sha256=uWOl3wbd0dRLcYDz-OLpg-yuCVQyPqyw_eEGjIb0c2M,2697
-pythonic_fp_circulararray-6.0.3.dist-info/RECORD,,