pythonic-fp.iterables 3.0.0__py3-none-any.whl

pythonic_fp/iterables.py

@@ -0,0 +1,455 @@
+# 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.
+
+"""Module fp.iterables - Iterator related tools
+
+Library of iterator related functions and enumerations.
+
+- Concatenating and merging iterables
+- Dropping and taking values from iterables
+- Reducing and accumulating iterables
+- Assumptions
+
+  - iterables are not necessarily iterators
+  - at all times iterator protocol is assumed to be followed
+
+    - all iterators are assumed to be iterable
+    - for all iterators ``foo`` we assume ``iter(foo) is foo``
+"""
+
+from __future__ import annotations
+
+__author__ = 'Geoffrey R. Scheller'
+__copyright__ = 'Copyright (c) 2023-2025 Geoffrey R. Scheller'
+__license__ = 'Apache License 2.0'
+
+from collections.abc import Callable, Iterable, Iterator
+from enum import auto, Enum
+from typing import cast, Never, TypeVar
+from pythonic_fp.containers.box import Box
+from pythonic_fp.containers.maybe import MayBe as MB
+from pythonic_fp.fptools.function import negate, swap
+from pythonic_fp.fptools.singletons import NoValue
+
+__all__ = [
+    'FM',
+    'concat',
+    'merge',
+    'exhaust',
+    'drop',
+    'drop_while',
+    'take',
+    'take_while',
+    'take_split',
+    'take_while_split',
+    'accumulate',
+    'foldl',
+    'mb_fold_left',
+    'reduce_left',
+    'sc_reduce_left',
+    'sc_reduce_right',
+]
+
+D = TypeVar('D')  # Needed only for pdoc documentation generation.
+L = TypeVar('L')  # Otherwise, ignored by both MyPy and Python.
+
+# Iterate over multiple iterables
+
+
+class FM(Enum):
+    """Types of iterable blending,
+
+    - **CONCAT:** Concatenate first to last
+    - **MERGE:** Merge until one is exhausted
+    - **EXHAUST:** Merge until all are exhausted
+    """
+
+    CONCAT = auto()
+    MERGE = auto()
+    EXHAUST = auto()
+
+
+def concat[D](*iterables: Iterable[D]) -> Iterator[D]:
+    """Sequentially concatenate multiple iterables together.
+
+    - pure Python version of standard library's ``itertools.chain``
+    - iterator sequentially yields each iterable until all are exhausted
+    - an infinite iterable will prevent subsequent iterables from yielding any values
+    - performant to ``itertools.chain``
+    """
+    for iterator in map(lambda x: iter(x), iterables):
+        while True:
+            try:
+                value = next(iterator)
+                yield value
+            except StopIteration:
+                break
+
+
+def exhaust[D](*iterables: Iterable[D]) -> Iterator[D]:
+    """Shuffle together multiple iterables until all are exhausted.
+    Iterator yields until all iterables are exhausted.
+    """
+    iter_list = list(map(lambda x: iter(x), iterables))
+    if (num_iters := len(iter_list)) > 0:
+        ii = 0
+        values = []
+        while True:
+            try:
+                while ii < num_iters:
+                    values.append(next(iter_list[ii]))
+                    ii += 1
+                yield from values
+                ii = 0
+                values.clear()
+            except StopIteration:
+                num_iters -= 1
+                if num_iters < 1:
+                    break
+                del iter_list[ii]
+
+        yield from values
+
+
+def merge[D](*iterables: Iterable[D], yield_partials: bool = False) -> Iterator[D]:
+    """Shuffle together the ``iterables`` until one is exhausted.
+
+    - iterator yields until one of the iterables is exhausted
+    - if ``yield_partials`` is true,
+
+      - yield any unmatched yielded values from other iterables
+      - prevents data lose
+
+        - if any of the iterables are iterators with external references
+    """
+    iter_list = list(map(lambda x: iter(x), iterables))
+    values = []
+    if (num_iters := len(iter_list)) > 0:
+        while True:
+            try:
+                for ii in range(num_iters):
+                    values.append(next(iter_list[ii]))
+                yield from values
+                values.clear()
+            except StopIteration:
+                break
+        if yield_partials:
+            yield from values
+
+
+## dropping and taking
+
+
+def drop[D](iterable: Iterable[D], n: int, /) -> Iterator[D]:
+    """Drop the next ``n`` values from ``iterable``."""
+    it = iter(iterable)
+    for _ in range(n):
+        try:
+            next(it)
+        except StopIteration:
+            break
+    return it
+
+
+def drop_while[D](iterable: Iterable[D], pred: Callable[[D], bool], /) -> Iterator[D]:
+    """Drop initial values from ``iterable`` while predicate is true."""
+    it = iter(iterable)
+    while True:
+        try:
+            value = next(it)
+            if not pred(value):
+                it = concat((value,), it)
+                break
+        except StopIteration:
+            break
+    return it
+
+
+def take[D](iterable: Iterable[D], n: int, /) -> Iterator[D]:
+    """Return an iterator of up to ``n`` initial values of an iterable"""
+    it = iter(iterable)
+    for _ in range(n):
+        try:
+            value = next(it)
+            yield value
+        except StopIteration:
+            break
+
+
+def take_split[D](iterable: Iterable[D], n: int, /) -> tuple[Iterator[D], Iterator[D]]:
+    """Same as take except also return an iterator of the remaining values.
+
+    - return a tuple of
+
+      - an iterator of up to ``n`` initial values
+      - an iterator of the remaining vales of the ``iterable``
+
+    - Contract: do not access second iterator until first is exhausted
+    """
+    it = iter(iterable)
+    itn = take(it, n)
+
+    return itn, it
+
+
+def take_while[D](iterable: Iterable[D], pred: Callable[[D], bool], /) -> Iterator[D]:
+    """Yield values from ``iterable`` while predicate is true.
+
+    .. warning::
+        Risk of value loss if iterable is multiple referenced iterator.
+    """
+    it = iter(iterable)
+    while True:
+        try:
+            value = next(it)
+            if pred(value):
+                yield value
+            else:
+                break
+        except StopIteration:
+            break
+
+
+def take_while_split[D](
+    iterable: Iterable[D], pred: Callable[[D], bool], /
+) -> tuple[Iterator[D], Iterator[D]]:
+    """Yield values from ``iterable`` while ``predicate`` is true.
+
+    - return a tuple of two iterators
+
+      - first of initial values where predicate is true, followed by first to fail
+      - second of the remaining values of the iterable after first failed value
+
+    - **Contract:** do not access second iterator until first is exhausted
+    """
+
+    def _take_while(
+        it: Iterator[D], pred: Callable[[D], bool], val: Box[D]
+    ) -> Iterator[D]:
+        while True:
+            try:
+                val.put(next(it))
+                if pred(val.get()):
+                    yield val.pop()
+                else:
+                    break
+            except StopIteration:
+                break
+
+    it = iter(iterable)
+    value: Box[D] = Box()
+    it_pred = _take_while(it, pred, value)
+
+    return (it_pred, concat(value, it))
+
+
+## reducing and accumulating
+
+
+def accumulate[D, L](
+    iterable: Iterable[D], f: Callable[[L, D], L], initial: L | NoValue = NoValue(), /
+) -> Iterator[L]:
+    """Returns an iterator of accumulated values.
+
+    - pure Python version of standard library's ``itertools.accumulate``
+    - function ``f`` does not default to addition (for typing flexibility)
+    - begins accumulation with an optional ``initial`` value
+    """
+    it = iter(iterable)
+    try:
+        it0 = next(it)
+    except StopIteration:
+        if initial is NoValue():
+            return
+        yield cast(L, initial)
+    else:
+        if initial is not NoValue():
+            init = cast(L, initial)
+            yield init
+            acc = f(init, it0)
+            for ii in it:
+                yield acc
+                acc = f(acc, ii)
+            yield acc
+        else:
+            acc = cast(L, it0)  # in this case L = D
+            for ii in it:
+                yield acc
+                acc = f(acc, ii)
+            yield acc
+
+
+def reduce_left[D](iterable: Iterable[D], f: Callable[[D, D], D], /) -> D | Never:
+    """Fold an iterable left with a function.
+
+    - traditional FP type order given for function ``f``
+    - if iterable empty, ``StopIteration`` exception raised
+    - does not catch any exceptions ``f`` may raise
+    - never returns if ``iterable`` generates an infinite iterator
+    """
+    it = iter(iterable)
+    try:
+        acc = next(it)
+    except StopIteration as exc:
+        msg = 'Attemped to reduce an empty iterable.'
+        raise StopIteration(msg) from exc
+
+    for v in it:
+        acc = f(acc, v)
+
+    return acc
+
+
+def foldl[D, L](
+    iterable: Iterable[D], f: Callable[[L, D], L], initial: L, /
+) -> L | Never:
+    """Folds an iterable left with a function and initial value.
+
+    - traditional FP type order given for function ``f``
+    - does not catch any exceptions ``f`` may raise
+    - like builtin ``sum`` for Python >=3.8 except
+
+      - not restricted to ``__add__`` for the folding function
+      - initial value required, does not default to ``0`` for initial value
+      - handles non-numeric data just find
+
+    - never returns if ``iterable`` generates an infinite iterator
+    """
+    acc = initial
+    for v in iterable:
+        acc = f(acc, v)
+    return acc
+
+
+def mb_fold_left[L, D](
+    iterable: Iterable[D], f: Callable[[L, D], L], initial: L | NoValue = NoValue()
+) -> MB[L]:
+    """Folds an iterable left with optional initial value.
+
+    - traditional FP type order given for function ``f``
+    - when an initial value is not given then ``~L = ~D``
+    - if iterable empty and no ``initial`` value given, return ``MB()``
+    - never returns if iterable generates an infinite iterator
+    """
+    acc: L
+    it = iter(iterable)
+    if initial is NoValue():
+        try:
+            acc = cast(L, next(it))  # in this case L = D
+        except StopIteration:
+            return MB()
+    else:
+        acc = cast(L, initial)
+
+    for v in it:
+        try:
+            acc = f(acc, v)
+        except Exception:
+            return MB()
+
+    return MB(acc)
+
+
+def sc_reduce_left[D](
+    iterable: Iterable[D],
+    f: Callable[[D, D], D],
+    /,
+    start: Callable[[D], bool] = (lambda d: True),
+    stop: Callable[[D], bool] = (lambda d: False),
+    include_start: bool = True,
+    include_stop: bool = True,
+) -> tuple[MB[D], Iterator[D]]:
+    """Short circuit version of a left reduce. Useful for infinite or iterables.
+
+    - Behavior for default arguments will
+
+      - left reduce finite iterable
+      - start folding immediately
+      - continue folding until end (of a possibly infinite iterable)
+
+    - Callable ``start`` delays starting the left reduce
+    - Callable ``stop`` prematurely stop the left reduce
+    """
+    it_start = drop_while(iterable, negate(start))
+    if not include_start:
+        try:
+            next(it_start)
+        except StopIteration:
+            pass
+    it_reduce, it_rest = take_while_split(it_start, negate(stop))
+    mb_reduced = mb_fold_left(it_reduce, f)
+    if include_stop:
+        if mb_reduced:
+            try:
+                last = next(it_rest)
+                mb_reduced = MB(f(mb_reduced.get(), last))
+            except StopIteration:
+                pass
+        else:
+            try:
+                last = next(it_rest)
+                mb_reduced = MB(last)
+            except StopIteration:
+                pass
+
+    return (mb_reduced, it_rest)
+
+
+def sc_reduce_right[D](
+    iterable: Iterable[D],
+    f: Callable[[D, D], D],
+    /,
+    start: Callable[[D], bool] = (lambda d: False),
+    stop: Callable[[D], bool] = (lambda d: False),
+    include_start: bool = True,
+    include_stop: bool = True,
+) -> tuple[MB[D], Iterator[D]]:
+    """Short circuit version of a right reduce. Useful for infinite or
+    non-reversible iterables.
+
+    - Behavior for default arguments will
+
+      - right reduce finite iterable
+      - start reducing at end (of a possibly infinite iterable)
+      - continue reducing right until beginning
+
+    - Callable ``start`` prematurely starts the right reduce
+    - Callable ``stop`` prematurely stops the right reduce
+    """
+    it_start, it_rest = take_while_split(iterable, negate(start))
+    l1 = list(it_start)
+    if include_start:
+        try:
+            begin = next(it_rest)
+        except StopIteration:
+            pass
+        else:
+            l1.append(begin)
+
+    l1.reverse()
+    it_reduce, it_stop = take_while_split(l1, negate(stop))
+
+    mb_reduced = mb_fold_left(it_reduce, swap(f))
+    if include_stop:
+        try:
+            end = next(it_stop)
+        except StopIteration:
+            pass
+        else:
+            if mb_reduced:
+                mb_reduced = MB(f(end, mb_reduced.get()))
+            else:
+                mb_reduced = MB(end)
+
+    return (mb_reduced, it_rest)

pythonic_fp_iterables-3.0.0.dist-info/METADATA

@@ -0,0 +1,52 @@
+Metadata-Version: 2.4
+Name: pythonic-fp.iterables
+Version: 3.0.0
+Summary: Module fp.iterables - Iterator related tools
+Keywords: iterables,iterators
+Author-email: "Geoffrey R. Scheller" <geoffrey@scheller.com>
+Requires-Python: >=3.12
+Description-Content-Type: text/markdown
+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>=5.0.0
+Requires-Dist: pythonic-fp.containers >=2.0.0
+Requires-Dist: pythonic-fp.fptools >=3.0.0
+Project-URL: Changelog, https://grscheller.github.io/pythonic-fp-iterables/html/changelog.html
+Project-URL: Documentation, https://grscheller.github.io/pythonic-fp-iterables/html/
+Project-URL: Homepage, https://github.com/grscheller/pythonic-fp/blob/main/README.md
+Project-URL: Source, https://github.com/grscheller/pythonic-fp-iterables
+
+# Pythonic FP - Tools for iterables
+
+PyPI project
+[pythonic-fp.iterators](https://pypi.org/project/pythonic-fp.iterables/)
+implementing a Python package of tools for iterables and iterators.
+
+- Concatenating and merging iterables
+- Dropping and taking values from iterables
+- Reducing and accumulating iterables
+- Assumptions
+  - iterables are not necessarily iterators
+  - at all times iterator protocol is assumed to be followed
+    - all iterators are assumed to be iterable
+    - for all iterators `my_iter` we assume `iter(my_iter) is my_iter`
+
+This PyPI project is part of of the grscheller
+[pythonic-fp namespace projects](https://github.com/grscheller/pythonic-fp/blob/main/README.md).
+
+## Documentation
+
+Documentation hosted on
+[GitHub Pages](https://grscheller.github.io/pythonic-fp-iterables/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_iterables-3.0.0.dist-info/RECORD

@@ -0,0 +1,5 @@
+pythonic_fp/iterables.py,sha256=Si4a4JcJhrStvpxqe8msaqiskcgrb3D8xJP2oN-6VG8,13194
+pythonic_fp_iterables-3.0.0.dist-info/licenses/LICENSE,sha256=IJMkVWQUVy-SonK6SMaMotDQ6Zb-lVi2bUTiGp1GUO8,10774
+pythonic_fp_iterables-3.0.0.dist-info/WHEEL,sha256=G2gURzTEtmeR8nrdXUJfNiB3VYVxigPQ-bEQujpNiNs,82
+pythonic_fp_iterables-3.0.0.dist-info/METADATA,sha256=9vZd4-jSvYbAXdXXSo6UwZHcLgrSEprn2J6cgyqUkeA,2059
+pythonic_fp_iterables-3.0.0.dist-info/RECORD,,

pythonic_fp_iterables-3.0.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_iterables-3.0.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.