pythonic-fp-circulararray 5.4.0__tar.gz → 6.0.1__tar.gz

{pythonic_fp_circulararray-5.4.0 → pythonic_fp_circulararray-6.0.1}/CHANGELOG.rst

@@ -17,12 +17,26 @@ See `Semantic Versioning 2.0.0 <https://semver.org>`_.
 Releases and Important Milestones
 ---------------------------------
 
-PyPI 5.4.0 - TBD
-~~~~~~~~~~~~~~~~
+PyPI 6.0.1 - 2026-01-TBD
+~~~~~~~~~~~~~~~~~~~~~~~~
 
-- updated README.rst
+Docstring improvements based on lessons learned from my PyPI
+boring-math-abstract-algebra project.
 
-  - previous version never fully updated for two circular array types
+PyPI 6.0.0 - 2025-09-26
+~~~~~~~~~~~~~~~~~~~~~~~
+
+Changed how "optional" iterator in initializer signature is handled.
+
+- same trick as is done in queues project.
+- no longer need to use a sentinel in the signature
+- less typing boilerplate
+- required a bump in major version number
+
+PyPI 5.4.0 - 2025-09-25
+~~~~~~~~~~~~~~~~~~~~~~~
+
+Gave both circular arrays the ability to store None as a value.
 
 - realized that both circular array types cannot store None as a value
 
@@ -30,10 +44,14 @@ PyPI 5.4.0 - TBD
 
     - typing for foldl & foldr a bit quirky (mypy bug?)
 
-  - bumping minor version number
+  - bumping minor version number to 5.4.0
 
     - more than a bug fix but not really an API change either
 
+- updated README.rst for last two PyPI releases
+
+  - previous version never fully updated for two circular array types
+
 PyPI 5.3.3 - 2025-09-21
 ~~~~~~~~~~~~~~~~~~~~~~~
 

{pythonic_fp_circulararray-5.4.0 → pythonic_fp_circulararray-6.0.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pythonic-fp-circulararray
-Version: 5.4.0
+Version: 6.0.1
 Summary: Circular Array
 Keywords: auto resizing,circular array,circulararray,dequeue,indexable,pop,push
 Author-email: "Geoffrey R. Scheller" <geoffrey@scheller.com>
@@ -14,11 +14,11 @@ Classifier: Operating System :: OS Independent
 Classifier: Programming Language :: Python :: 3.13
 Classifier: Typing :: Typed
 License-File: LICENSE
-Requires-Dist: pythonic-fp-gadgets>=3.1.0
+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/index.html
-Project-URL: Homepage, https://github.com/grscheller/pythonic-fp/blob/main/README.md
+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: Source, https://github.com/grscheller/pythonic-fp-circulararray
 Provides-Extra: test
 
@@ -54,7 +54,7 @@ Python module implementing stateful circular array data structures.
 
 Part of the
 `pythonic-fp
-<https://grscheller.github.io/pythonic-fp/homepage/build/html/index.html>`_
+<https://grscheller.github.io/pythonic-fp>`_
 PyPI projects.
 
 Documentation
@@ -62,7 +62,7 @@ Documentation
 
 Documentation for this project is hosted on
 `GitHub Pages
-<https://grscheller.github.io/pythonic-fp/circulararray/development/build/html>`_.
+<https://grscheller.github.io/pythonic-fp/circulararray>`_.
 
 Copyright and License
 ---------------------

{pythonic_fp_circulararray-5.4.0 → pythonic_fp_circulararray-6.0.1}/README.rst

@@ -30,7 +30,7 @@ Python module implementing stateful circular array data structures.
 
 Part of the
 `pythonic-fp
-<https://grscheller.github.io/pythonic-fp/homepage/build/html/index.html>`_
+<https://grscheller.github.io/pythonic-fp>`_
 PyPI projects.
 
 Documentation
@@ -38,7 +38,7 @@ Documentation
 
 Documentation for this project is hosted on
 `GitHub Pages
-<https://grscheller.github.io/pythonic-fp/circulararray/development/build/html>`_.
+<https://grscheller.github.io/pythonic-fp/circulararray>`_.
 
 Copyright and License
 ---------------------

{pythonic_fp_circulararray-5.4.0 → pythonic_fp_circulararray-6.0.1}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "pythonic-fp-circulararray"
-version = "5.4.0"
+version = "6.0.1"
 readme = "README.rst"
 requires-python = ">=3.13"
 license = { file = "LICENSE" }
@@ -24,14 +24,14 @@ classifiers = [
   "Typing :: Typed",
 ]
 dependencies = [
-  "pythonic-fp-gadgets>=3.1.0",
+  "pythonic-fp-gadgets>=4.0.2",
 ]
 dynamic = ["description"]
 
 [project.urls]
 Changelog = "https://github.com/grscheller/pythonic-fp-circulararray/blob/main/CHANGELOG.rst"
-Documentation = "https://grscheller.github.io/pythonic-fp/circulararray/development/build/html/index.html"
-Homepage = "https://github.com/grscheller/pythonic-fp/blob/main/README.md"
+Documentation = "https://grscheller.github.io/pythonic-fp/circulararray/development/build/html/"
+Homepage = "https://grscheller.github.io/pythonic-fp/homepage/build/html/"
 Source = "https://github.com/grscheller/pythonic-fp-circulararray"
 
 [project.optional-dependencies]

pythonic_fp_circulararray-6.0.1/src/pythonic_fp/circulararray/__init__.py

@@ -0,0 +1,37 @@
+# Copyright 2024-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.
+
+"""
+Circular Array
+--------------
+
+.. admonition:: Stateful circular array data structures.
+
+    +-------------------------------------+-------------------------------------------+
+    | Module                              | Description                               |
+    +=====================================+===========================================+
+    | **pythonic_fp.circulararray.auto**  | Variable storage capacity circular array. |
+    +-------------------------------------+-------------------------------------------+
+    | **pythonic_fp.circulararray.fixed** | Fixed storage capacity circular array.    |
+    +-------------------------------------+-------------------------------------------+
+
+    - O(1) pops and pushes either end
+    - O(1) size determination
+    - O(1) indexing
+
+"""
+
+__author__ = 'Geoffrey R. Scheller'
+__copyright__ = 'Copyright (c) 2023-2026 Geoffrey R. Scheller'
+__license__ = 'Apache License 2.0'

{pythonic_fp_circulararray-5.4.0 → pythonic_fp_circulararray-6.0.1}/src/pythonic_fp/circulararray/auto.py

@@ -13,19 +13,16 @@
 # limitations under the License.
 
 """
-Variable Storage Capacity
-=========================
+.. admonition:: Variable storage capacity circular array.**
 
-**Circular array with variable storage capacity.**
-
-- 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
+    - 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
 
 """
 
@@ -41,22 +38,22 @@ nada: Final[NoValue] = NoValue()
 class CA[I]:
     __slots__ = '_items', '_cnt', '_cap', '_front', '_rear'
 
-    @overload
-    def __init__(self) -> None: ...
-    @overload
-    def __init__(self, items: Iterable[I]) -> None: ...
-
-    def __init__(self, items: Iterable[I | NoValue] | NoValue = nada) -> None:
+    def __init__(self, *items: Iterable[I]) -> None:
         """
-        :param items: "Optional" iterable to initial populate circular array.
-        :raises TypeError: When ``items`` not Iterable.
+        :param items: Optionally takes a single iterable to
+                      initially populate the circular array.
+        :raises TypeError: When ``items[0]`` not iterable.
+        :raises ValueError: If more than 1 iterable is given.
         """
-        if items is nada:
-            self._items: list[I | NoValue] = [nada, nada]
-        else:
-            values: list[I | NoValue] = list(cast(Iterable[I | NoValue], items))
+        if (size := len(items)) > 1:
+            msg = f'CA expects at most 1 argument, got {size}'
+            raise ValueError(msg)
+        if size:
+            values: list[I | NoValue] = list(cast(Iterable[I | NoValue], items[0]))
             self._items = [nada] + values + [nada]
-        self._cap = cap = len(self._items)
+        else:
+            self._items = [nada, nada]
+        self._cap = (cap := len(self._items))
         self._cnt = cap - 2
         if cap == 2:
             self._front = 0
@@ -285,6 +282,12 @@ class CA[I]:
         del _ca
 
     def __eq__(self, other: object) -> bool:
+        """
+        :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``.
+        """
         if self is other:
             return True
         if not isinstance(other, type(self)):
@@ -292,10 +295,10 @@ class CA[I]:
 
         (
             front1,
-            count1,
+            cnt1,
             capacity1,
             front2,
-            count2,
+            cnt2,
             capacity2,
         ) = (
             self._front,
@@ -306,10 +309,10 @@ class CA[I]:
             other._cap,
         )
 
-        if count1 != count2:
+        if cnt1 != cnt2:
             return False
 
-        for nn in range(count1):
+        for nn in range(cnt1):
             if (
                 self._items[(front1 + nn) % capacity1]
                 is other._items[(front2 + nn) % capacity2]
@@ -459,7 +462,8 @@ class CA[I]:
     def poplt(self, maximum: int) -> tuple[I, ...]:
         """Pop multiple items from left side of circular array.
 
-        :param maximum: Maximum number of items to pop, may pop less if not enough items.
+        :param maximum: Maximum number of items to pop, may pop less
+                        if not enough items.
         :returns: Tuple of items in the order popped, left to right.
         """
         item_list: list[I] = []
@@ -477,7 +481,8 @@ class CA[I]:
     def poprt(self, maximum: int) -> tuple[I, ...]:
         """Pop multiple items from right side of circular array.
 
-        :param maximum: Maximum number of items to pop, may pop less if not enough items.
+        :param maximum: Maximum number of items to pop, may pop less
+                        if not enough items.
         :returns: Tuple of items in the order popped, right to left.
         """
         item_list: list[I] = []
@@ -526,10 +531,12 @@ class CA[I]:
     def foldl[L](self, f: Callable[[L, I], L], start: L | NoValue = NoValue()) -> L:
         """Fold left with a function and optional starting item.
 
-        :param f: Folding function, first argument to ``f`` is for the accumulator.
+        :param f: Folding function, first argument to ``f`` is for
+                  the accumulator.
         :param start: "Optional" starting item.
         :returns: Reduced value produced by the left fold.
-        :raises ValueError: When circular array empty and no starting item given.
+        :raises ValueError: When circular array empty and no starting
+                            item given.
         """
         if self._cnt == 0:
             if start is nada:
@@ -556,10 +563,12 @@ class CA[I]:
     def foldr[R](self, f: Callable[[I, R], R], start: R | NoValue = nada) -> R:
         """Fold right with a function and an optional starting item.
 
-        :param f: Folding function, second argument to ``f`` is for the accumulator.
-        :param start: "Optional" starting item.
+        :param f: Folding function, second argument to ``f`` is for
+                  the accumulator.
+        :param start: Optional starting item.
         :returns: Reduced value produced by the right fold.
-        :raises ValueError: When circular array empty and no starting item given.
+        :raises ValueError: When circular array empty and no starting
+                            item given.
         """
         if self._cnt == 0:
             if start is nada:
@@ -611,7 +620,8 @@ class CA[I]:
         storage capacity. To just compact the circular array, do not
         provide ``minimum_capacity``.
 
-        :param minimum_capacity: Minimum storage capacity to compact the circular array.
+        :param minimum_capacity: Minimum storage capacity to compact
+                                 the circular array.
         """
         self._compact_storage_capacity()
         if (min_cap := minimum_capacity) > self._cap:

{pythonic_fp_circulararray-5.4.0 → pythonic_fp_circulararray-6.0.1}/src/pythonic_fp/circulararray/auto.pyi

@@ -4,10 +4,7 @@ from typing import overload
 __all__ = ['CA', 'ca']
 
 class CA[I]:
-    @overload
-    def __init__(self) -> None: ...
-    @overload
-    def __init__(self, items: Iterable[I]) -> None: ...
+    def __init__(self, *items: Iterable[I]) -> None: ...
     def __iter__(self) -> Iterator[I]: ...
     def __reversed__(self) -> Iterator[I]: ...
     def __bool__(self) -> bool: ...

{pythonic_fp_circulararray-5.4.0 → pythonic_fp_circulararray-6.0.1}/src/pythonic_fp/circulararray/fixed.py

@@ -13,18 +13,15 @@
 # limitations under the License.
 
 """
-Fixed Storage Capacity
-======================
+.. admonition:: Fixed storage capacity circular array.**
 
-**Circular array with fixed storage capacity.**
-
-- 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
+    - 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
 
 """
 
@@ -40,44 +37,39 @@ nada: Final[NoValue] = NoValue()
 class CAF[I]:
     __slots__ = '_items', '_cnt', '_cap', '_front', '_rear'
 
-    @overload
-    def __init__(self) -> None: ...
-    @overload
-    def __init__(self, items: Iterable[I]) -> None: ...
-    @overload
-    def __init__(self, items: Iterable[I], capacity: int) -> None: ...
-
-    def __init__(
-        self, items: Iterable[I | NoValue] | NoValue = nada, capacity: int = 2
-    ) -> None:
+    def __init__(self, *items: Iterable[I], cap: int = 2) -> None:
         """
-        :param items: "Optional" iterable to initial populate circular array.
-        :param capacity: Minimum fixed storage capacity of circular array.
-        :raises TypeError: When ``items`` not Iterable,
+        :param items: Optionally takes a single iterable to
+                      initially populate the circular array.
+        :param cap: Minimum fixed storage capacity of circular array.
+        :raises TypeError: When ``items[0]`` not iterable,
+        :raises ValueError: If more than 1 iterable is given.
         """
-        capacity = max(2, capacity)
-        if items is nada:
-            self._items: list[I | NoValue] = [nada] * capacity
-            count = 0
+        cap = max(2, cap)
+        if (size := len(items)) > 1:
+            msg = f'CAF expects at most 1 argument, got {size}'
+            raise ValueError(msg)
+        if size:
+            values: list[I | NoValue] = list(cast(Iterable[I | NoValue], items[0]))
+            cnt = len(values)
+            cap = max(cnt, cap)
+            self._items = values + [nada] * (cap - cnt)
         else:
-            values: list[I | NoValue] = list(cast(Iterable[I | NoValue], items))
-            dlist: list[I | NoValue] = list(values)
-            count = len(dlist)
-            capacity = max(count, capacity)
-            self._items = dlist + [nada] * (capacity - count)
-        self._cap: Final[int] = capacity
-        self._cnt = count
-        if count == 0:
+            self._items = [nada] * cap
+            cnt = 0
+        self._cap: Final[int] = cap
+        self._cnt = cnt
+        if cnt == 0:
             self._front = 0
-            self._rear = capacity - 1
+            self._rear = cap - 1
         else:
             self._front = 0
-            self._rear = count - 1
+            self._rear = cnt - 1
 
     def __iter__(self) -> Iterator[I]:
         if self._cnt > 0:
             (
-                capacity,
+                cap,
                 rear,
                 position,
                 current_state,
@@ -90,13 +82,13 @@ class CAF[I]:
 
             while position != rear:
                 yield cast(I, current_state[position])
-                position = (position + 1) % capacity
+                position = (position + 1) % cap
             yield cast(I, current_state[position])
 
     def __reversed__(self) -> Iterator[I]:
         if self._cnt > 0:
             (
-                capacity,
+                cap,
                 front,
                 position,
                 current_state,
@@ -109,7 +101,7 @@ class CAF[I]:
 
             while position != front:
                 yield cast(I, current_state[position])
-                position = (position - 1) % capacity
+                position = (position - 1) % cap
             yield cast(I, current_state[position])
 
     def __repr__(self) -> str:
@@ -159,7 +151,7 @@ class CAF[I]:
     def __delitem__(self, idx: int) -> None:
         item_list = list(self)
         del item_list[idx]
-        _ca = CAF(item_list, self._cap)
+        _ca = CAF(item_list, cap = self._cap)
         (
             self._items,
             self._cnt,
@@ -174,6 +166,12 @@ class CAF[I]:
         del _ca
 
     def __eq__(self, other: object) -> bool:
+        """
+        :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``.
+        """
         if self is other:
             return True
         if not isinstance(other, type(self)):
@@ -181,11 +179,11 @@ class CAF[I]:
 
         (
             front1,
-            count1,
-            capacity1,
+            cnt1,
+            cap1,
             front2,
-            count2,
-            capacity2,
+            cnt2,
+            cap2,
         ) = (
             self._front,
             self._cnt,
@@ -195,18 +193,18 @@ class CAF[I]:
             other._cap,
         )
 
-        if count1 != count2:
+        if cnt1 != cnt2:
             return False
 
-        for nn in range(count1):
+        for nn in range(cnt1):
             if (
-                self._items[(front1 + nn) % capacity1]
-                is other._items[(front2 + nn) % capacity2]
+                self._items[(front1 + nn) % cap1]
+                is other._items[(front2 + nn) % cap2]
             ):
                 continue
             if (
-                self._items[(front1 + nn) % capacity1]
-                != other._items[(front2 + nn) % capacity2]
+                self._items[(front1 + nn) % cap1]
+                != other._items[(front2 + nn) % cap2]
             ):
                 return False
         return True
@@ -352,7 +350,8 @@ class CAF[I]:
     def poplt(self, maximum: int) -> tuple[I, ...]:
         """Pop multiple items from left side of circular array.
 
-        :param maximum: Maximum number of items to pop, may pop less if not enough items.
+        :param maximum: Maximum number of items to pop, may pop less
+                        if not enough items.
         :returns: Tuple of items in the order popped, left to right.
         """
         item_list: list[I] = []
@@ -370,7 +369,8 @@ class CAF[I]:
     def poprt(self, maximum: int) -> tuple[I, ...]:
         """Pop multiple items from right side of circular array.
 
-        :param maximum: Maximum number of items to pop, may pop less if not enough items.
+        :param maximum: Maximum number of items to pop, may pop less
+                        if not enough items.
         :returns: Tuple of items in the order popped, right to left.
         """
         item_list: list[I] = []
@@ -409,7 +409,7 @@ class CAF[I]:
         :param f: Callable from type ``I`` to type ``U``.
         :returns: New fixed capacity circular array instance.
         """
-        return CAF(map(f, self), self._cap)
+        return CAF(map(f, self), cap = self._cap)
 
     @overload
     def foldl[L](self, f: Callable[[I, I], I]) -> I: ...
@@ -419,10 +419,12 @@ class CAF[I]:
     def foldl[L](self, f: Callable[[L, I], L], start: L | NoValue = nada) -> L:
         """Fold left with a function and optional stating item.
 
-        :param f: Folding function, first argument to ``f`` is for the accumulator.
+        :param f: Folding function, first argument to ``f`` is for
+                  the accumulator.
         :param start: Optional starting item.
         :returns: Reduced value produced by the left fold.
-        :raises ValueError: When circular array empty and no starting item given.
+        :raises ValueError: When circular array empty and no starting
+                            item given.
         """
         if self._cnt == 0:
             if start is nada:
@@ -449,10 +451,12 @@ class CAF[I]:
     def foldr[R](self, f: Callable[[I, R], R], start: R | NoValue = nada) -> R:
         """Fold right with a function and an optional starting item.
 
-        :param f: Folding function, second argument to ``f`` is for the accumulator.
+        :param f: Folding function, second argument to ``f`` is for
+                  the accumulator.
         :param start: Optional starting item.
         :returns: Reduced value produced by the right fold.
-        :raises ValueError: When circular array empty and no starting item given.
+        :raises ValueError: When circular array empty and no starting
+                            item given.
         """
         if self._cnt == 0:
             if start is nada:
@@ -500,11 +504,11 @@ class CAF[I]:
         return self._cnt / self._cap
 
 
-def caf[T](*items: T, capacity: int = 2) -> CAF[T]:
+def caf[T](*items: T, cap: int = 2) -> CAF[T]:
     """Produce a circular array from a variable number of arguments.
 
     :param items: Initial items for a new fixed capacity :circular array.
-    :param capacity: The minimum storage capacity to set.
+    :param cap: The minimum storage capacity to set.
     :returns: New fixed storage capacity circular array.
     """
-    return CAF(items, capacity=capacity)
+    return CAF(items, cap=cap)

{pythonic_fp_circulararray-5.4.0 → pythonic_fp_circulararray-6.0.1}/src/pythonic_fp/circulararray/fixed.pyi

@@ -4,12 +4,7 @@ from typing import overload
 __all__ = ['CAF', 'caf']
 
 class CAF[I]:
-    @overload
-    def __init__(self) -> None: ...
-    @overload
-    def __init__(self, items: Iterable[I]) -> None: ...
-    @overload
-    def __init__(self, items: Iterable[I], capacity: int) -> None: ...
+    def __init__(self, *items: Iterable[I], cap: int = 2) -> None: ...
     def __iter__(self) -> Iterator[I]: ...
     def __reversed__(self) -> Iterator[I]: ...
     def __bool__(self) -> bool: ...
@@ -41,4 +36,4 @@ class CAF[I]:
     def empty(self) -> None: ...
     def fraction_filled(self) -> float: ...
 
-def caf[T](*items: T, capacity: int = 2) -> CAF[T]: ...
+def caf[T](*items: T, cap: int = 2) -> CAF[T]: ...

{pythonic_fp_circulararray-5.4.0 → pythonic_fp_circulararray-6.0.1}/tests/auto/test_ca.py

@@ -485,3 +485,13 @@ class TestCircularArrayResizing:
         assert baz == ca(3, 2, 1, 3, 4, 0, 6, 1, 8, 2, 10)
         del baz[6:10:2]
         assert baz == ca(3, 2, 1, 3, 4, 0, 1, 2, 10)
+
+    def test_store_none(self) -> None:
+        ca1 = ca(1, 'a', None, (), 42)
+        assert ca1.popl() == 1
+        assert ca1.popr() == 42
+        assert ca1
+        assert ca1.popl() == 'a'
+        assert ca1.popl() is None
+        assert ca1.popr() == ()
+        assert not ca1

{pythonic_fp_circulararray-5.4.0 → pythonic_fp_circulararray-6.0.1}/tests/fixed/test_caf.py

@@ -20,7 +20,7 @@ class TestCircularArrayFixed:
 
     def test_mutate_returns_none(self) -> None:
         """Test for builtin behaviors"""
-        ca1: CAF[int] = caf(capacity=4)
+        ca1: CAF[int] = caf(cap=4)
         assert not ca1
         assert ca1.pushl(1) is None  # type: ignore[func-returns-value]
         assert ca1
@@ -63,7 +63,7 @@ class TestCircularArrayFixed:
 
     def test_push_then_pop(self) -> None:
         """Functionality test"""
-        ca0: CAF[str] = caf(capacity=42)
+        ca0: CAF[str] = caf(cap=42)
         pushed1 = '42'
         ca0.pushl(pushed1)
         popped1 = ca0.popl()
@@ -156,8 +156,8 @@ class TestCircularArrayFixed:
 
     def test_equality(self) -> None:
         """Functionality test"""
-        c1: CAF[object] = caf(1, 2, 3, 'Forty-Two', (7, 11, 'foobar'), capacity=7)
-        c2: CAF[object] = caf(2, 3, 'Forty-Two', capacity=7)
+        c1: CAF[object] = caf(1, 2, 3, 'Forty-Two', (7, 11, 'foobar'), cap=7)
+        c2: CAF[object] = caf(2, 3, 'Forty-Two', cap=7)
         c2.pushl(1)
         c2.pushr((7, 11, 'foobar'))
         assert c1 == c2
@@ -175,7 +175,7 @@ class TestCircularArrayFixed:
         assert c1 == c2
 
         hold_a = c1.popl()
-        c1 = CAF(c1, 42)
+        c1 = CAF(c1, cap=42)
         hold_b = c1.popl()
         hold_c = c1.popr()
         c1.pushl(hold_b)
@@ -312,7 +312,7 @@ class TestCircularArrayFixed:
 
     def test_readme(self) -> None:
         """Functionality test"""
-        ca0 = caf(1, 2, 3, capacity=10)
+        ca0 = caf(1, 2, 3, cap=10)
         assert ca0.popl() == 1
         assert ca0.popr() == 3
         ca0.pushr(42)
@@ -340,7 +340,7 @@ class TestCircularArrayFixed:
 
     def test_pop(self) -> None:
         """Functionality test"""
-        ca1 = caf(1, 2, 3, capacity=4)
+        ca1 = caf(1, 2, 3, cap=4)
         assert ca1.popld(42) == 1
         assert ca1.poprd(42) == 3
         assert ca1.popld(42) == 2
@@ -348,7 +348,7 @@ class TestCircularArrayFixed:
         assert ca1.popld(42) == 42
         assert len(ca1) == 0
 
-        ca2: CAF[int] = caf(0, 1, 2, 3, 4, 5, 6, capacity=10)
+        ca2: CAF[int] = caf(0, 1, 2, 3, 4, 5, 6, cap=10)
         assert ca2.popl() == 0
         assert ca2.popr() == 6
         assert ca2 == caf(1, 2, 3, 4, 5)
@@ -437,8 +437,8 @@ class TestCircularArrayFixed:
             (4, 1),
             (4, 3),
         )
-        foo = caf(0, 1, 2, 3, 4, capacity=10)
-        bar = CAF[tuple[int, int]]((), capacity=100)
+        foo = caf(0, 1, 2, 3, 4, cap=10)
+        bar = CAF[tuple[int, int]]((), cap=100)
 
         for ii in foo:
             if ii % 2 == 1:
@@ -489,3 +489,14 @@ class TestCircularArrayFixed:
             assert False
         else:
             assert bar == 0
+
+    def test_store_none(self) -> None:
+        caf1 = caf(1, 'a', None, (), 42)
+        assert not caf1
+        assert caf1.popl() == 1
+        assert caf1.popr() == 42
+        assert caf1
+        assert caf1.popl() == 'a'
+        assert caf1.popl() is None
+        assert caf1.popr() == ()
+        assert not caf1

{pythonic_fp_circulararray-5.4.0 → pythonic_fp_circulararray-6.0.1}/tests/fixed/test_caf_capacity.py

@@ -22,7 +22,7 @@ class TestCapacityFixed:
         ca0: CAF[int] = CAF()
         assert ca0.capacity() == 2
 
-        ca0 = caf(1, 2, capacity=8)
+        ca0 = caf(1, 2, cap=8)
         assert ca0.fraction_filled() == 2 / 8
 
         ca0.pushl(0)
@@ -49,7 +49,7 @@ class TestCapacityFixed:
 
     def test_empty(self) -> None:
         """Functionality test"""
-        c: CAF[int] = caf(capacity=401)
+        c: CAF[int] = caf(cap=401)
         assert c == caf()
         assert len(c) == 0
         for ii in 1, 2, 3, 4, 5:
@@ -73,7 +73,7 @@ class TestCapacityFixed:
 
     def test_one(self) -> None:
         """Functionality test"""
-        c = caf(42, capacity=5)
+        c = caf(42, cap=5)
         assert c.capacity() == 5
         assert len(c) == 1
         popped = c.popld(0)

{pythonic_fp_circulararray-5.4.0 → pythonic_fp_circulararray-6.0.1}/tests/fixed/test_repr_str_fixed.py

@@ -25,7 +25,7 @@ class TestReprFixed:
         bar: CAF[int] = eval(repr(ca0))
         assert foo == bar
 
-        ca1: CAF[str|int] = CAF((), capacity=10)
+        ca1: CAF[str|int] = CAF((), cap=10)
         assert repr(ca1) == 'caf()'
         ca2: CAF[int|str] = eval(repr(ca1))
         assert ca2 == ca1
@@ -51,7 +51,7 @@ class TestReprFixed:
         assert ca2 == ca1
         assert ca2 is not ca1
 
-        ca3: CAF[int] = caf(1, 10, 0, 42, capacity=10)
+        ca3: CAF[int] = caf(1, 10, 0, 42, cap=10)
         ca3.pushr(2)
         ca3.pushr(100)
         ca3.pushr(3)
@@ -65,7 +65,7 @@ class TestReprFixed:
         ca3.pushr(3)
         assert repr(ca3) == 'caf(8, 9, 10, 0, 42, 1, 2, 3)'
 
-        ca4: CAF[int] = CAF([1, 10, 0, 42], capacity=100)
+        ca4: CAF[int] = CAF([1, 10, 0, 42], cap=100)
         ca4.pushr(2)
         ca4.pushr(100)
         ca4.pushr(3)

pythonic_fp_circulararray-5.4.0/src/pythonic_fp/circulararray/__init__.py

@@ -1,36 +0,0 @@
-# Copyright 2024-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.
-
-"""
-Circular Array
---------------
-
-Package implementing stateful circular array data structures.
-
-- O(1) pops and pushes either end
-- O(1) indexing and size determination
-- O(1) size determination
-
-+-------------------------------------+-------------------------------------------+
-| Module                              | Description                               |
-+=====================================+===========================================+
-| **pythonic_fp.circulararray.auto**  | Variable storage capacity circular array. |
-+-------------------------------------+-------------------------------------------+
-| **pythonic_fp.circulararray.fixed** | Fixed storage capacity circular array.    |
-+-------------------------------------+-------------------------------------------+
-"""
-
-__author__ = 'Geoffrey R. Scheller'
-__copyright__ = 'Copyright (c) 2023-2025 Geoffrey R. Scheller'
-__license__ = 'Apache License 2.0'