pythonic-fp.queues 5.1.3__py3-none-any.whl → 6.0.0__py3-none-any.whl

pythonic_fp/queues/de.py

@@ -14,6 +14,7 @@
 
 from collections.abc import Callable, Iterable, Iterator
 from typing import cast, overload
+
 from pythonic_fp.circulararray.auto import CA
 from pythonic_fp.fptools.maybe import MayBe
 
@@ -138,7 +139,7 @@ class DEQueue[D]:
         """
         return '>< ' + ' | '.join(map(str, self)) + ' ><'
 
-    def copy(self) -> 'DEQueue[D]':
+    def copy(self) -> DEQueue[D]:
         """
         .. admonition:: Copy
 
@@ -273,7 +274,7 @@ class DEQueue[D]:
             return MayBe(cast(R, self._ca.foldr(cast(Callable[[D, D], D], f))))  # R = D
         return MayBe(self._ca.foldr(f, start))
 
-    def map[U](self, f: Callable[[D], U]) -> 'DEQueue[U]':
+    def map[U](self, f: Callable[[D], U]) -> DEQueue[U]:
         """
         .. admonition:: Map
 

pythonic_fp/queues/fifo.py

@@ -14,6 +14,7 @@
 
 from collections.abc import Callable, Iterable, Iterator
 from typing import cast, overload
+
 from pythonic_fp.circulararray.auto import CA
 from pythonic_fp.fptools.maybe import MayBe
 
@@ -126,7 +127,7 @@ class FIFOQueue[D]:
         """
         return '<< ' + ' < '.join(map(str, self)) + ' <<'
 
-    def copy(self) -> 'FIFOQueue[D]':
+    def copy(self) -> FIFOQueue[D]:
         """
         .. admonition:: Copy
 
@@ -213,7 +214,7 @@ class FIFOQueue[D]:
             return MayBe(cast(T, self._ca.foldl(cast(Callable[[D, D], D], f))))   # T = D
         return MayBe(self._ca.foldl(f, start))
 
-    def map[U](self, f: Callable[[D], U]) -> 'FIFOQueue[U]':
+    def map[U](self, f: Callable[[D], U]) -> FIFOQueue[U]:
         """
         .. admonition:: Map
 

pythonic_fp/queues/lifo.py

@@ -14,6 +14,7 @@
 
 from collections.abc import Callable, Iterable, Iterator
 from typing import cast, overload
+
 from pythonic_fp.circulararray.auto import CA
 from pythonic_fp.fptools.function import swap
 from pythonic_fp.fptools.maybe import MayBe
@@ -126,7 +127,7 @@ class LIFOQueue[D]:
         """
         return '|| ' + ' > '.join(map(str, self)) + ' ><'
 
-    def copy(self) -> 'LIFOQueue[D]':
+    def copy(self) -> LIFOQueue[D]:
         """
         .. admonition:: Copy
 
@@ -198,7 +199,7 @@ class LIFOQueue[D]:
             return MayBe(cast(T, self._ca.foldl(cast(Callable[[D, D], D], f))))   # T = D
         return MayBe(self._ca.foldr(swap(f), start))
 
-    def map[U](self, f: Callable[[D], U]) -> 'LIFOQueue[U]':
+    def map[U](self, f: Callable[[D], U]) -> LIFOQueue[U]:
         """
         .. admonition:: Map
 

pythonic_fp_queues-6.0.0.dist-info/METADATA

@@ -0,0 +1,50 @@
+Metadata-Version: 2.4
+Name: pythonic-fp-queues
+Version: 6.0.0
+Summary: Queues useful for different algorithmic use cases.
+Keywords: queue,fifo,lifo,dqueue
+Author-email: "Geoffrey R. Scheller" <geoffrey@scheller.com>
+Requires-Python: >=3.14
+Description-Content-Type: text/markdown
+Classifier: Development Status :: 4 - Beta
+Classifier: Framework :: Pytest
+Classifier: Intended Audience :: Developers
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3.14
+Classifier: Programming Language :: Python :: 3.15
+Classifier: Typing :: Typed
+License-File: LICENSE
+Requires-Dist: pythonic-fp-circulararray>=6.4,<7
+Requires-Dist: pythonic-fp-fptools>=6.2,<7
+Project-URL: Changelog, https://github.com/grscheller/pythonic-fp-queues/blob/main/CHANGELOG.md
+Project-URL: Documentation, https://grscheller.github.io/pythonic-fp-queues
+Project-URL: Homepage, https://grscheller.github.io/pythonic-fp
+Project-URL: Source, https://github.com/grscheller/pythonic-fp-queues
+
+# Pythonic FP - Queues
+
+Queue-like datastructures.
+
+PyPI project
+[pythonic-fp-queues](https://pypi.org/project/pythonic-fp-queues).
+Part of the
+[pythonic-fp](https://grscheller.github.io/pythonic-fp)
+PyPI projects.
+
+## Documentation
+
+Documentation and other links for this project are hosted on
+[GitHub Pages](https://grscheller.github.io/pythonic-fp-queues).
+
+| module | class | name |
+|:------ |:-----:|:---- |
+| pythonic_fp.queues.fifo | FIFOQueue | First-In-First-Out Queue |
+| pythonic_fp.queues.lifo | LIFOQueue | Last-In-First-Out Queue |
+| pythonic_fp.queues.de | DEQueue | Double-Ended Queue |
+
+## Copyright and License
+
+Copyright (c) 2023-2026 Geoffrey R. Scheller. Licensed under the Apache
+License, Version 2.0. See the LICENSE file for details.
+

pythonic_fp_queues-6.0.0.dist-info/RECORD

@@ -0,0 +1,9 @@
+pythonic_fp/queues/__init__.py,sha256=NOkkXOQaHmiemvY4Ke5ZdFJCl3_P3bmV87Xz5Y-R9cU,1028
+pythonic_fp/queues/de.py,sha256=vSxWcsTB4w3CnZ2ciqT0oMaYGMm1s8i5thADbRzOkAg,8529
+pythonic_fp/queues/fifo.py,sha256=R29zOr8h4d4v6yONvJG2wAq19K85Ydem6TS9pH6S5Cg,6800
+pythonic_fp/queues/lifo.py,sha256=_WFGLh3OYtm2BI7ndQp9wfEjIq3LoxoC0rth7SnnPKE,6468
+pythonic_fp/queues/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pythonic_fp_queues-6.0.0.dist-info/licenses/LICENSE,sha256=IJMkVWQUVy-SonK6SMaMotDQ6Zb-lVi2bUTiGp1GUO8,10774
+pythonic_fp_queues-6.0.0.dist-info/WHEEL,sha256=G2gURzTEtmeR8nrdXUJfNiB3VYVxigPQ-bEQujpNiNs,82
+pythonic_fp_queues-6.0.0.dist-info/METADATA,sha256=GcWgs7qUbudNtnIiukYkDCurXcpF2gh7yB3jFWICYkU,1819
+pythonic_fp_queues-6.0.0.dist-info/RECORD,,

pythonic_fp/queues/de.pyi

@@ -1,31 +0,0 @@
-from collections.abc import Callable, Iterable, Iterator
-from pythonic_fp.fptools.maybe import MayBe
-from typing import overload
-
-__all__ = ['DEQueue', 'de_queue']
-
-class DEQueue[D]:
-    def __init__(self, *dss: Iterable[D]) -> None: ...
-    def __bool__(self) -> bool: ...
-    def __len__(self) -> int: ...
-    def __eq__(self, other: object) -> bool: ...
-    def __iter__(self) -> Iterator[D]: ...
-    def __reversed__(self) -> Iterator[D]: ...
-    def copy(self) -> DEQueue[D]: ...
-    def pushl(self, *ds: D) -> None: ...
-    def pushr(self, *ds: D) -> None: ...
-    def popl(self) -> MayBe[D]: ...
-    def popr(self) -> MayBe[D]: ...
-    def peakl(self) -> MayBe[D]: ...
-    def peakr(self) -> MayBe[D]: ...
-    @overload
-    def foldl[L](self, f: Callable[[D, D], D]) -> MayBe[D]: ...
-    @overload
-    def foldl[L](self, f: Callable[[L, D], L], start: L) -> MayBe[L]: ...
-    @overload
-    def foldr[R](self, f: Callable[[D, D], D]) -> MayBe[D]: ...
-    @overload
-    def foldr[R](self, f: Callable[[D, R], R], start: R) -> MayBe[R]: ...
-    def map[U](self, f: Callable[[D], U]) -> DEQueue[U]: ...
-
-def de_queue[D](*ds: D) -> DEQueue[D]: ...

pythonic_fp/queues/fifo.pyi

@@ -1,24 +0,0 @@
-from collections.abc import Callable, Iterable, Iterator
-from pythonic_fp.fptools.maybe import MayBe
-from typing import overload
-
-__all__ = ['FIFOQueue', 'fifo_queue']
-
-class FIFOQueue[D]:
-    def __init__(self, *dss: Iterable[D]) -> None: ...
-    def __bool__(self) -> bool: ...
-    def __len__(self) -> int: ...
-    def __eq__(self, other: object) -> bool: ...
-    def __iter__(self) -> Iterator[D]: ...
-    def copy(self) -> FIFOQueue[D]: ...
-    def push(self, *ds: D) -> None: ...
-    def pop(self) -> MayBe[D]: ...
-    def peak_last_in(self) -> MayBe[D]: ...
-    def peak_next_out(self) -> MayBe[D]: ...
-    @overload
-    def fold[T](self, f: Callable[[D, D], D]) -> MayBe[D]: ...
-    @overload
-    def fold[T](self, f: Callable[[T, D], T], start: T) -> MayBe[T]: ...
-    def map[U](self, f: Callable[[D], U]) -> FIFOQueue[U]: ...
-
-def fifo_queue[D](*ds: D) -> FIFOQueue[D]: ...

pythonic_fp/queues/lifo.pyi

@@ -1,23 +0,0 @@
-from collections.abc import Callable, Iterable, Iterator
-from pythonic_fp.fptools.maybe import MayBe
-from typing import overload
-
-__all__ = ['LIFOQueue', 'lifo_queue']
-
-class LIFOQueue[D]:
-    def __init__(self, *dss: Iterable[D]) -> None: ...
-    def __bool__(self) -> bool: ...
-    def __len__(self) -> int: ...
-    def __eq__(self, other: object) -> bool: ...
-    def __iter__(self) -> Iterator[D]: ...
-    def copy(self) -> LIFOQueue[D]: ...
-    def push(self, *ds: D) -> None: ...
-    def pop(self) -> MayBe[D]: ...
-    def peak(self) -> MayBe[D]: ...
-    @overload
-    def fold[T](self, f: Callable[[D, D], D]) -> MayBe[D]: ...
-    @overload
-    def fold[T](self, f: Callable[[T, D], T], start: T) -> MayBe[T]: ...
-    def map[U](self, f: Callable[[D], U]) -> LIFOQueue[U]: ...
-
-def lifo_queue[D](*ds: D) -> LIFOQueue[D]: ...

pythonic_fp_queues-5.1.3.dist-info/METADATA

@@ -1,65 +0,0 @@
-Metadata-Version: 2.4
-Name: pythonic-fp-queues
-Version: 5.1.3
-Summary: Queues
-Keywords: queue,fifo,lifo,dqueue
-Author-email: "Geoffrey R. Scheller" <geoffrey@scheller.com>
-Requires-Python: >=3.13
-Description-Content-Type: text/x-rst
-Classifier: Development Status :: 5 - Production/Stable
-Classifier: Framework :: Pytest
-Classifier: Intended Audience :: Developers
-Classifier: License :: OSI Approved :: Apache Software License
-Classifier: Operating System :: OS Independent
-Classifier: Programming Language :: Python :: 3.14
-Classifier: Typing :: Typed
-License-File: LICENSE
-Requires-Dist: pythonic-fp-circulararray>=6.0.4
-Requires-Dist: pythonic-fp-fptools>=5.2.0
-Requires-Dist: pythonic-fp-gadgets>=4.1.0
-Requires-Dist: pytest>=8.4.1 ; extra == "test"
-Project-URL: Changelog, https://github.com/grscheller/pythonic-fp-queues/blob/main/CHANGELOG.rst
-Project-URL: Documentation, https://grscheller.github.io/pythonic-fp/projects/queues.html
-Project-URL: Homepage, https://grscheller.github.io/pythonic-fp/
-Project-URL: Source, https://github.com/grscheller/pythonic-fp-queues
-Provides-Extra: test
-
-Pythonic FP - Queues
-====================
-
-PyPI project
-`pythonic-fp-queues
-<https://pypi.org/project/pythonic-fp-queues>`_.
-
-+-------------------------+-----------+--------------------------+
-| module                  | class     | name                     |
-+=========================+===========+==========================+
-| pythonic_fp.queues.fifo | FIFOQueue | First-In-First-Out Queue |
-+-------------------------+-----------+--------------------------+
-| pythonic_fp.queues.lifo | LIFOQueue | Last-In-First-Out Queue  |
-+-------------------------+-----------+--------------------------+
-| pythonic_fp.queues.de   | DEQueue   | Double-Ended Queue       |
-+-------------------------+-----------+--------------------------+
-
-Part of the
-`pythonic-fp
-<https://grscheller.github.io/pythonic-fp/>`_
-PyPI projects.
-
-Documentation
--------------
-
-Documentation and other links for this project are hosted on
-`GitHub Pages
-<https://grscheller.github.io/pythonic-fp/projects/queues.html>`_.
-
-Documentation for this project is hosted on
-`GitHub Pages
-<https://grscheller.github.io/pythonic-fp-queues/development/html/>`_.
-
-Copyright and License
----------------------
-
-Copyright (c) 2023-2026 Geoffrey R. Scheller. Licensed under the Apache
-License, Version 2.0. See the LICENSE file for details.
-

pythonic_fp_queues-5.1.3.dist-info/RECORD

@@ -1,13 +0,0 @@
-pythonic_fp/queues/__init__.py,sha256=NOkkXOQaHmiemvY4Ke5ZdFJCl3_P3bmV87Xz5Y-R9cU,1028
-pythonic_fp/queues/__init__.pyi,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-pythonic_fp/queues/de.py,sha256=ICPHkGz0JKIk8aLk75ZUSPS6T9jSTynkJ-2A5Sy_iig,8532
-pythonic_fp/queues/de.pyi,sha256=db74UiSLFme25Yhc28Hhw3EKb2GfvU4wNBJtkTlr_e4,1150
-pythonic_fp/queues/fifo.py,sha256=qQhv57VuF2QuaRtGJhCtj5qtGPjoGKlQS9RbZIGsvmY,6803
-pythonic_fp/queues/fifo.pyi,sha256=19TGU3Qg91hCLo5A-5p9vmREcl38EUWhIAvJZtlb1eA,885
-pythonic_fp/queues/lifo.py,sha256=lQAzoCOzQrw3gF2A_GgF_4XkYpNivswPyZS-Qp5bxYw,6471
-pythonic_fp/queues/lifo.pyi,sha256=HdJ-t7R2w3VfCT06raCTXespdUZfpBgMepBlcxDvyuk,832
-pythonic_fp/queues/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-pythonic_fp_queues-5.1.3.dist-info/licenses/LICENSE,sha256=IJMkVWQUVy-SonK6SMaMotDQ6Zb-lVi2bUTiGp1GUO8,10774
-pythonic_fp_queues-5.1.3.dist-info/WHEEL,sha256=G2gURzTEtmeR8nrdXUJfNiB3VYVxigPQ-bEQujpNiNs,82
-pythonic_fp_queues-5.1.3.dist-info/METADATA,sha256=CeQO0Dt1zxfeu94F7ziEET_hegfeZUjlpzzoIzzdQr4,2392
-pythonic_fp_queues-5.1.3.dist-info/RECORD,,