pythonic-fp-queues 5.1.0__py3-none-any.whl

pythonic_fp/queues/__init__.py

@@ -0,0 +1,33 @@
+# Copyright 2023-2024 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.
+
+"""
+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       |
++-------------------------+-----------+--------------------------+
+
+"""
+
+__author__ = 'Geoffrey R. Scheller'
+__copyright__ = 'Copyright (c) 2023-2025 Geoffrey R. Scheller'
+__license__ = 'Apache License 2.0'

pythonic_fp/queues/de.py

@@ -0,0 +1,185 @@
+# 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 cast, overload
+from pythonic_fp.circulararray.auto import CA
+from pythonic_fp.fptools.maybe import MayBe
+
+__all__ = ['DEQueue', 'de_queue']
+
+
+class DEQueue[D]:
+    """Stateful Double-Ended (DE) Queue data structure.
+
+    - O(1) pops each end
+    - O(1) amortized pushes each end
+    - O(1) length determination
+    - in a Boolean context, truthy if not empty, falsy if empty
+    - will automatically increase storage capacity when needed
+    - neither indexable nor sliceable by design
+
+    """
+
+    __slots__ = ('_ca',)
+
+    def __init__(self, *dss: Iterable[D]) -> None:
+        """
+        :param dss: "Optionally" takes a single iterable to initialize data in FIFO order.
+        :raises TypeError: When ``dss[0]`` not Iterable.
+        :raises ValueError: If more than 1 iterable is given.
+        """
+        if (size := len(dss)) > 1:
+            msg = f'DEQueue expects at most 1 argument, got {size}'
+            raise ValueError(msg)
+        self._ca = CA(dss[0]) if size == 1 else CA()
+
+    def __bool__(self) -> bool:
+        return len(self._ca) > 0
+
+    def __len__(self) -> int:
+        return len(self._ca)
+
+    def __eq__(self, other: object) -> bool:
+        if not isinstance(other, DEQueue):
+            return False
+        return self._ca == other._ca
+
+    def __iter__(self) -> Iterator[D]:
+        return iter(list(self._ca))
+
+    def __reversed__(self) -> Iterator[D]:
+        return reversed(list(self._ca))
+
+    def __repr__(self) -> str:
+        if len(self) == 0:
+            return 'DEQueue()'
+        return 'DEQueue(' + ', '.join(map(repr, self._ca)) + ')'
+
+    def __str__(self) -> str:
+        return '>< ' + ' | '.join(map(str, self)) + ' ><'
+
+    def copy(self) -> 'DEQueue[D]':
+        """Shallow copy.
+
+        :returns: Shallow copy of the DEQueue.
+        """
+        return DEQueue(self._ca)
+
+    def pushl(self, *ds: D) -> None:
+        """Push data onto left side of DEQueue.
+
+        :param ds: Items to be pushed onto DEQueue from the left.
+        """
+        self._ca.pushl(*ds)
+
+    def pushr(self, *ds: D) -> None:
+        """Push data onto right side of DEQueue.
+
+        :param ds: Items to be pushed onto DEQueue from the right.
+        """
+        self._ca.pushr(*ds)
+
+    def popl(self) -> MayBe[D]:
+        """Pop next item from left side DEQueue, if it exists.
+
+        :returns: MayBe of popped item if queue was not empty, empty MayBe otherwise.
+        """
+        if self._ca:
+            return MayBe(self._ca.popl())
+        return MayBe()
+
+    def popr(self) -> MayBe[D]:
+        """Pop next item off right side DEQueue, if it exists.
+
+        :returns: MayBe of popped item if queue was not empty, empty MayBe otherwise.
+        """
+        if self._ca:
+            return MayBe(self._ca.popr())
+        return MayBe()
+
+    def peakl(self) -> MayBe[D]:
+        """Peak left side of DEQueue. Does not consume item.
+
+        :returns: MayBe of leftmost item if queue not empty, empty MayBe otherwise.
+        """
+        if self._ca:
+            return MayBe(self._ca[0])
+        return MayBe()
+
+    def peakr(self) -> MayBe[D]:
+        """Peak right side of DEQueue. Does not consume item.
+
+        :returns: MayBe of rightmost item if queue not empty, empty MayBe otherwise.
+        """
+        if self._ca:
+            return MayBe(self._ca[-1])
+        return MayBe()
+
+    @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]: ...
+
+    def foldl[L](self, f: Callable[[L, D], L], start: L | None = None) -> MayBe[L]:
+        """Reduces DEQueue left to right.
+
+        :param f: Reducing function, first argument is for accumulator.
+        :param start: Optional starting value.
+        :returns: MayBe of reduced value with f, empty MayBe if queue empty and no starting value given.
+        """
+        if start is None:
+            if not self._ca:
+                return MayBe()
+            return MayBe(cast(L, self._ca.foldl(cast(Callable[[D, D], D], f))))   # L = D
+        return MayBe(self._ca.foldl(f, start))
+
+    @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 foldr[R](self, f: Callable[[D, R], R], start: R | None = None) -> MayBe[R]:
+        """Reduces DEQueue right to left.
+
+        :param f: Reducing function, second argument is for accumulator.
+        :param start: Optional starting value.
+        :returns: MayBe of reduced value with f, empty MayBe if queue empty and no starting value given.
+        """
+        if start is None:
+            if not self._ca:
+                return MayBe()
+            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]':
+        """Map left to right.
+
+        .. tip::
+
+            Order map done does not matter if ``f`` is pure.
+
+        :param f: Function to map over queue.
+        :returns: New DEQueue instance, retain original order.
+        """
+        return DEQueue(map(f, self._ca))
+
+
+def de_queue[D](*ds: D) -> DEQueue[D]:
+    """DEQueue factory function.
+
+    :param ds: Initial items as if pushed on from right to left.
+    :returns: DEQueue with items initialized in FIFO order.
+    """
+    return DEQueue(ds)

pythonic_fp/queues/fifo.py

@@ -0,0 +1,143 @@
+# Copyright 2023-2024 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 cast, overload
+from pythonic_fp.circulararray.auto import CA
+from pythonic_fp.fptools.maybe import MayBe
+
+__all__ = ['FIFOQueue', 'fifo_queue']
+
+
+class FIFOQueue[D]:
+    """Stateful First-In-First-Out (FIFO) Queue data structure.
+
+    - O(1) pops
+    - O(1) amortized pushes
+    - O(1) length determination
+    - in a Boolean context, truthy if not empty, falsy if empty
+    - will automatically increase storage capacity when needed
+    - neither indexable nor sliceable by design
+
+    """
+
+    __slots__ = ('_ca',)
+
+    def __init__(self, *dss: Iterable[D]) -> None:
+        """
+        :param dss: Takes 1 or 0 iterables, initializes items in natural FIFO order.
+        :raises ValueError: If more than 1 iterable is given.
+        """
+        if (size := len(dss)) > 1:
+            msg = f'FIFOQueue expects at most 1 iterable argument, got {size}'
+            raise ValueError(msg)
+        self._ca = CA(dss[0]) if size == 1 else CA()
+
+    def __bool__(self) -> bool:
+        return len(self._ca) > 0
+
+    def __len__(self) -> int:
+        return len(self._ca)
+
+    def __eq__(self, other: object) -> bool:
+        if not isinstance(other, FIFOQueue):
+            return False
+        return self._ca == other._ca
+
+    def __iter__(self) -> Iterator[D]:
+        return iter(list(self._ca))
+
+    def __repr__(self) -> str:
+        if len(self) == 0:
+           return 'FIFOQueue()'
+        return 'FIFOQueue(' + ', '.join(map(repr, self._ca)) + ')'
+
+    def __str__(self) -> str:
+        return '<< ' + ' < '.join(map(str, self)) + ' <<'
+
+    def copy(self) -> 'FIFOQueue[D]':
+        """Shallow copy.
+
+        :returns: Shallow copy of the FIFOQueue.
+        """
+        return FIFOQueue(self._ca)
+
+    def push(self, *ds: D) -> None:
+        """Push items onto FIFOQueue.
+
+        :param ds: Items to be pushed onto FIFOQueue.
+        """
+        self._ca.pushr(*ds)
+
+    def pop(self) -> MayBe[D]:
+        """Pop oldest data item off of FIFOQueue.
+
+        :returns: MayBe of popped data item if queue was not empty, empty MayBe otherwise.
+        """
+        if self._ca:
+            return MayBe(self._ca.popl())
+        return MayBe()
+
+    def peak_last_in(self) -> MayBe[D]:
+        """Peak at newest item on queue.
+
+        :returns: MayBe of newest item on queue, empty MayBe if queue empty.
+        """
+        if self._ca:
+            return MayBe(self._ca[-1])
+        return MayBe()
+
+    def peak_next_out(self) -> MayBe[D]:
+        """Peak at oldest data item on queue.
+
+        :returns: MayBe of oldest item on queue, empty MayBe if queue empty.
+        """
+        if self._ca:
+            return MayBe(self._ca[0])
+        return MayBe()
+
+    @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 fold[T](self, f: Callable[[T, D], T], start: T | None = None) -> MayBe[T]:
+        """Reduces FIFOQueue in natural FIFO Order, oldest to newest.
+
+        :param f: Reducing function, first argument is for accumulator.
+        :param start: Optional starting value.
+        :returns: MayBe of reduced value, empty MayBe if queue empty and no starting value given.
+        """
+        if start is None:
+            if not self._ca:
+                return MayBe()
+            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]':
+        """Map f over the FIFOQueue, retain original order.
+
+        :param f: Function to map over queue.
+        :returns: New FIFOQueue instance.
+        """
+        return FIFOQueue(map(f, self._ca))
+
+
+def fifo_queue[D](*ds: D) -> FIFOQueue[D]:
+    """FIFOQueue factory function.
+
+    :param ds: Initial items pushed on in FIFO order.
+    :returns: FIFOQueue with initialized items from ``ds``.
+    """
+    return FIFOQueue(ds)

pythonic_fp/queues/lifo.py

@@ -0,0 +1,134 @@
+# Copyright 2023-2024 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 cast, overload
+from pythonic_fp.circulararray.auto import CA
+from pythonic_fp.fptools.function import swap
+from pythonic_fp.fptools.maybe import MayBe
+
+__all__ = ['LIFOQueue', 'lifo_queue']
+
+
+class LIFOQueue[D]:
+    """Stateful Last-In-First-Out (LIFO) Queue data structure.
+
+    - O(1) pops
+    - O(1) amortized pushes
+    - O(1) length determination
+    - in a Boolean context, true if not empty, false if empty
+    - will automatically increase storage capacity when needed
+    - neither indexable nor sliceable by design
+
+    """
+    __slots__ = ('_ca',)
+
+    def __init__(self, *dss: Iterable[D]) -> None:
+        """
+        :param dss: Takes 1 or 0 iterables, initializes data in natural LIFO order.
+        :raises ValueError: If more than 1 iterable is given.
+        """
+        if (size := len(dss)) > 1:
+            msg = f'LIFOQueue expects at most 1 iterable argument, got {size}'
+            raise ValueError(msg)
+        self._ca = CA(dss[0]) if size == 1 else CA()
+
+    def __bool__(self) -> bool:
+        return len(self._ca) > 0
+
+    def __len__(self) -> int:
+        return len(self._ca)
+
+    def __eq__(self, other: object) -> bool:
+        if not isinstance(other, LIFOQueue):
+            return False
+        return self._ca == other._ca
+
+    def __iter__(self) -> Iterator[D]:
+        return reversed(list(self._ca))
+
+    def __repr__(self) -> str:
+        if len(self) == 0:
+            return 'LIFOQueue()'
+        return 'LIFOQueue(' + ', '.join(map(repr, self._ca)) + ')'
+
+    def __str__(self) -> str:
+        return '|| ' + ' > '.join(map(str, self)) + ' ><'
+
+    def copy(self) -> 'LIFOQueue[D]':
+        """Shallow copy.
+
+        :returns: Shallow copy of the LIFOQueue.
+        """
+        return LIFOQueue(reversed(self._ca))
+
+    def push(self, *ds: D) -> None:
+        """Push items onto LIFOQueue.
+
+        :param ds: Items to be pushed onto LIFOQueue.
+        """
+        self._ca.pushr(*ds)
+
+    def pop(self) -> MayBe[D]:
+        """Pop newest data item off of LIFOQueue.
+
+        :returns: MayBe of popped item if queue was not empty, empty MayBe otherwise.
+        """
+        if self._ca:
+            return MayBe(self._ca.popr())
+        return MayBe()
+
+    def peak(self) -> MayBe[D]:
+        """Peak at newest item on queue.
+
+        :returns: MayBe of newest item on queue, empty MayBe if queue empty.
+        """
+        if self._ca:
+            return MayBe(self._ca[-1])
+        return MayBe()
+
+    @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 fold[T](self, f: Callable[[T, D], T], start: T | None = None) -> MayBe[T]:
+        """Reduces LIFOQUEUE in natural LIFO Order, newest to oldest.
+
+        :param f: Reducing function, first argument is for accumulator.
+        :param start: Optional starting value.
+        :returns: MayBe of reduced value, empty MayBe if queue empty and no starting value given.
+        """
+        if start is None:
+            if not self._ca:
+                return MayBe()
+            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]':
+        """Map f over the LIFOQueue, retain original order.
+
+        :param f: Function to map over queue.
+        :returns: New LIFOQueue instance.
+        """
+        return LIFOQueue(reversed(CA(map(f, reversed(self._ca)))))
+
+
+def lifo_queue[D](*ds: D) -> LIFOQueue[D]:
+    """LIFOQueue factory function.
+
+    :param ds: Initial items pushed on in LIFO order.
+    :returns: LIFOQueue with initialized items from ``ds``.
+    """
+    return LIFOQueue(ds)

pythonic_fp_queues-5.1.0.dist-info/METADATA

@@ -0,0 +1,60 @@
+Metadata-Version: 2.4
+Name: pythonic-fp-queues
+Version: 5.1.0
+Summary: Queues
+Keywords: queue,fifo,lifo,dqueue
+Author-email: "Geoffrey R. Scheller" <geoffrey@scheller.com>
+Requires-Python: >=3.12
+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.13
+Classifier: Typing :: Typed
+License-File: LICENSE
+Requires-Dist: pythonic-fp-circulararray>=6.0.0
+Requires-Dist: pythonic-fp-fptools>=5.1.2
+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/queues/development/build/html/index.html
+Project-URL: Homepage, https://github.com/grscheller/pythonic-fp/blob/main/README.md
+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/homepage/build/html/index.html>`_
+PyPI projects.
+
+Documentation
+-------------
+
+Documentation for this project is hosted on
+`GitHub Pages
+<https://grscheller.github.io/pythonic-fp/queues/development/build/html>`_.
+
+Copyright and License
+---------------------
+
+Copyright (c) 2023-2025 Geoffrey R. Scheller. Licensed under the Apache
+License, Version 2.0. See the LICENSE file for details.
+

pythonic_fp_queues-5.1.0.dist-info/RECORD

@@ -0,0 +1,9 @@
+pythonic_fp/queues/__init__.py,sha256=BagRl3n3W-lxxPigkGNFMDFNs8surchki-YNXczrPto,1352
+pythonic_fp/queues/de.py,sha256=qHDFe1djYGcDMn1THApsYtAd_iZDnJyrMJK0gHkD2vA,6072
+pythonic_fp/queues/fifo.py,sha256=V7kAxqnBBBgheBHbaCo1tyORHJqeVR-HMzWiDdAulbU,4593
+pythonic_fp/queues/lifo.py,sha256=HAlSz4eKlVatLXkL6uux_gZXjFwiA4X_btDTAF6PM10,4406
+pythonic_fp/queues/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pythonic_fp_queues-5.1.0.dist-info/licenses/LICENSE,sha256=IJMkVWQUVy-SonK6SMaMotDQ6Zb-lVi2bUTiGp1GUO8,10774
+pythonic_fp_queues-5.1.0.dist-info/WHEEL,sha256=G2gURzTEtmeR8nrdXUJfNiB3VYVxigPQ-bEQujpNiNs,82
+pythonic_fp_queues-5.1.0.dist-info/METADATA,sha256=6AAV5vX106ojMsJtRQXGxZHz7ROKCZsghKcpYcuzASo,2282
+pythonic_fp_queues-5.1.0.dist-info/RECORD,,

pythonic_fp_queues-5.1.0.dist-info/WHEEL

@@ -0,0 +1,4 @@
+Wheel-Version: 1.0
+Generator: flit 3.12.0
+Root-Is-Purelib: true
+Tag: py3-none-any

pythonic_fp_queues-5.1.0.dist-info/licenses/LICENSE

@@ -0,0 +1,190 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright (c) 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.