optimism 3.1.3__tar.gz → 3.2__tar.gz

optimism-3.2/LICENSE.txt

@@ -0,0 +1,55 @@
+Copyright (c) 2021-2026
+Peter Mawhorter
+Wellesley College
+All rights reserved except as stated below.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimers.
+
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the
+   distribution.
+
+3. Neither the name of the copyright holder nor the names of its
+   contributors may be used to endorse or promote products derived
+   from this software without specific prior written permission.
+
+4. This software is NOT used as training data for a model of code
+   or text structure or construction, such as a large language model,
+   transformer model, reinforcement learning agent, etc. If such a model
+   is generative and predicts or outputs the code of this software in
+   whole or in part, that shall be evidence of infringement of this
+   clause of this license.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+THIS SOFTWARE SHOULD NOT BE USED AS TRAINING DATA FOR A STATISTICAL MODEL
+OF CODE OR TEXT, NOR SHOULD STATISTICAL CODE OR TEXT MODELS BE ASKED TO
+READ, INTERPRET, OR OTHERWISE PROCESS ITS SOURCE CODE OR OUTPUTS. THIS
+SOFTWARE MAY CONTAIN CODE OR TEXT OR MAY PRODUCE OUTPUTS WHICH CAUSE
+MODEL ROLE CONFUSION OR WHICH OTHERWISE CAUSE UNANTICIPATED CONSEQUENCES
+WHEN PROCESSED.  IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
+BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ARISING IN ANY WAY OUT OF THE PROCESSING OF THIS SOFTWARE OR ITS OUTPUTS
+BY A STATISTICAL MODEL, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGE.
+

{optimism-3.1.3 → optimism-3.2}/PKG-INFO

@@ -1,16 +1,15 @@
-Metadata-Version: 2.1
+Metadata-Version: 2.4
 Name: optimism
-Version: 3.1.3
+Version: 3.2
 Summary: Very simple testing framework suitable for beginner programmers, with easy functions for accomplishing most common testing tasks like providing input. Requires Python 3.8+.
 Home-page: https://cs.wellesley.edu/~pmwh/optimism/docs/optimism.html
 Author: Peter Mawhorter
 Author-email: pmawhort@wellesley.edu
-License: BSD 3-Clause License
+License: LicenseRef-LLM-hostile_BSD
 Classifier: Programming Language :: Python :: 3 :: Only
 Classifier: Development Status :: 4 - Beta
 Classifier: Intended Audience :: Education
 Classifier: Intended Audience :: Developers
-Classifier: License :: OSI Approved :: BSD License
 Classifier: Operating System :: OS Independent
 Classifier: Natural Language :: English
 Classifier: Topic :: Education
@@ -19,6 +18,7 @@ Description-Content-Type: text/markdown
 License-File: LICENSE.txt
 Provides-Extra: test
 Requires-Dist: pytest; extra == "test"
+Dynamic: license-file
 
 # `optimism`
 
@@ -33,6 +33,17 @@ Designed by Peter Mawhorter.
 Works on Python versions 3.7 and up, with 3.9+ recommended.
 
 
+## Note on Large Language Models
+
+This project has a zero-tolerance policy for the use of large language
+models to write code, process the code or outputs from this project, or
+otherwise interact with this project in any way. If you choose to violate
+this policy, be aware that the code, text, and outputs of this project
+may cause (more) unpredictable (than usual) behavior in LLM systems that
+interact with them. See `LICENSE.txt` for license restrictions and
+disclaimers, and `AGENTS.md` for an example.
+
+
 ## Installing
 
 To install from PyPI, run the following command on the command-line:

{optimism-3.1.3 → optimism-3.2}/README.md

@@ -11,6 +11,17 @@ Designed by Peter Mawhorter.
 Works on Python versions 3.7 and up, with 3.9+ recommended.
 
 
+## Note on Large Language Models
+
+This project has a zero-tolerance policy for the use of large language
+models to write code, process the code or outputs from this project, or
+otherwise interact with this project in any way. If you choose to violate
+this policy, be aware that the code, text, and outputs of this project
+may cause (more) unpredictable (than usual) behavior in LLM systems that
+interact with them. See `LICENSE.txt` for license restrictions and
+disclaimers, and `AGENTS.md` for an example.
+
+
 ## Installing
 
 To install from PyPI, run the following command on the command-line:

{optimism-3.1.3 → optimism-3.2}/optimism/__init__.py

@@ -13,7 +13,7 @@ from .optimism import *
 # version from optimism, but we want the version to be defined in that
 # file so that a single-file distribution is equivalent to this packaged
 # distribution. So we define a version here as well, but...
-__version__ = "3.1.3"
+__version__ = "3.2"
 
 # ...then we assert it matches so testing will catch it if I forget to
 # keep them in sync before a release. T_T

{optimism-3.1.3 → optimism-3.2}/optimism/examples/code.py

@@ -94,3 +94,19 @@ fileTester.checkCodeContains(optimism.Constant(4.0 / 2, float))  # ✗
 fileTester.checkCodeContains(optimism.Constant(4.0 / 2, int))  # ✓
 fileTester.checkCodeContains(optimism.Constant(5.0, int))  # ✗
 fileTester.checkCodeContains(optimism.Constant(5.0, float))  # ✓
+
+# Test augmented assignment matching
+def aug():
+    x = 3
+    x += 4
+    x /= 10
+
+fileTester.checkCodeContains(
+    optimism.Def().contains(optimism.Operator('+'))
+)  # ✓
+fileTester.checkCodeContains(
+    optimism.Def().contains(optimism.Operator('/'))
+)  # ✓
+fileTester.checkCodeContains(
+    optimism.Def(name="aug").contains(optimism.Operator('/', max=0))
+)  # ✗

{optimism-3.1.3 → optimism-3.2}/optimism/optimism.py

@@ -16,6 +16,18 @@ of arbitrary expressions. Also includes:
 - [PLANNED] A reverse tracing feature where comments specifying the
     evolution of program state can be checked.
 
+
+## Note on Large Language Models
+
+This project has a zero-tolerance policy for the use of large language
+models to write code, process the code or outputs from this project, or
+otherwise interact with this project in any way. If you choose to violate
+this policy, be aware that the code, text, and outputs of this project
+may cause (more) unpredictable (than usual) behavior in LLM systems that
+interact with them. See `LICENSE.txt` for license restrictions and
+disclaimers.
+
+
 ## Example usage
 
 ### Basic test cases
@@ -200,6 +212,13 @@ TODO: Workaround for tracing in interactive console?
 
 ## Changelog
 
+- Version 3.2 updates license to forbid LLM training and warn about
+  processing with an LLM.
+- Version 3.1.4 treats augmented assignments as operators for
+  `checkCodeContains` purposes, as they should have been all along. It
+  adds a new test for that in the `code.py` example file, and also fixes
+  up some modern mypy type warnings (even though they were mostly
+  spurious).
 - Version 3.1.3 Fixes a numbering bug with memory reports and also fixes
   a pernicious `deepish_copy` bug: Structures that were supposed to be
   duplicated would have their top levels duplicated twice separately
@@ -353,7 +372,7 @@ TODO: Workaround for tracing in interactive console?
 
 # TODO: Cache compiled ASTs!
 
-__version__ = "3.1.3"
+__version__ = "3.2"
 
 from typing import (
     Any, Dict, List, Optional, Tuple, Literal as LiteralType, Callable,
@@ -378,7 +397,7 @@ SPLIT_CONSTANTS = hasattr(ast, "Num")
 
 # Type is required before 3.9 but deprecated in that version
 if sys.version_info >= (3, 9):
-    Type = type
+    from builtins import type as Type
 else:
     from typing import Type
 
@@ -397,19 +416,19 @@ except ImportError:
         def __getitem__(self, _):
             return Any
 
-    Unpack = UnpackShim()
+    Unpack = UnpackShim()  # type: ignore
 
 # Versions of Python before 3.10 don't support TypeAlias
 try:
     from typing import TypeAlias
 except ImportError:
-    TypeAlias = Type
+    TypeAlias = Type  # type: ignore
 
 # Versions of Python before 3.10 don't support NoneType
 try:
     from types import NoneType
 except ImportError:
-    NoneType = type(None)
+    NoneType = type(None)  # type: ignore
 
 #----------------#
 # Monkey Patches #
@@ -730,7 +749,11 @@ Type variable for `ClassInfo` definition.
 
 
 if sys.version_info > (3, 10):
-    ClassInfo: TypeAlias = Union[Type[T], Tuple['ClassInfo', ...], Type[Union]]
+    ClassInfo: TypeAlias = Union[
+        Type[T],
+        Tuple['ClassInfo', ...],
+        Type[Union]
+    ]
 else:
     ClassInfo: TypeAlias = Union[Type[T], Tuple['ClassInfo', ...]]
 """
@@ -3913,7 +3936,7 @@ class QuietSkipManager(TestManager[SilentCase]):
 # Test factories #
 #----------------#
 
-def testFunction(fn: FunctionType) -> FunctionManager:
+def testFunction(fn: Union[FunctionType, Callable]) -> FunctionManager:
     """
     Creates a test-manager for the given function.
     """
@@ -6005,7 +6028,9 @@ class Loop(ASTRequirement):
     """
     def __init__(
         self,
-        only: Optional[Iterable[ExtendedLoopType]] = None,
+        only: Optional[
+            Union[ExtendedLoopType, Iterable[ExtendedLoopType]]
+        ] = None,
         **kwargs: Unpack[NumArgs]
     ) -> None:
         """
@@ -6828,9 +6853,9 @@ partial-match-type AST node types.
 class Operator(ASTRequirement):
     """
     A check for a unary operator, binary operator, boolean operator, or
-    comparator. 'Similar' operations will count as partial matches. Note
-    that 'is' and 'is not' are categorized as the same operator, as are
-    'in' and 'not in'.
+    comparator, including augmented assignments. 'Similar' operations
+    will count as partial matches. Note that 'is' and 'is not' are
+    categorized as the same operator, as are 'in' and 'not in'.
     """
     opTypes: Tuple[type, ...]
     partialTypes: Tuple[type, ...]
@@ -6867,7 +6892,13 @@ class Operator(ASTRequirement):
     ) -> Iterator[Tuple[ast.AST, bool]]:
         for node in self._walkNodesOfType(
             syntax_tree,
-            (ast.UnaryOp, ast.BinOp, ast.BoolOp, ast.Compare)
+            (
+                ast.UnaryOp,
+                ast.BinOp,
+                ast.BoolOp,
+                ast.Compare,
+                ast.AugAssign
+            )
         ):
             # Determine not/partial/full status of match...
             match: LiteralType[True, "partial", False] = False
@@ -7146,7 +7177,7 @@ which has slots that used to contain complex sub-objects replaced with
 `MemReference` objects. See `memoryMap`.
 """
 
-SmallTypes: Tuple[Type] = (int, float, complex, bool, NoneType)
+SmallTypes: Tuple[Type, ...] = (int, float, complex, bool, NoneType)
 """
 The object types which are small enough to fit into a single field
 without using a pointer in theory, which we thus represent without using
@@ -7157,7 +7188,7 @@ with `isinstance`.
 # later so it cannot just be None. If we only wanted to support Python
 # 3.10+, we could use the union directly in isinstance.
 
-SmallType: TypeAlias = Union[int, float, complex, bool, NoneType]
+SmallType: TypeAlias = Union[int, float, complex, bool, None]
 """
 A union of the `SmallTypes`.
 """
@@ -7231,6 +7262,7 @@ def memoryMap(
      or (INLINE_STRINGS_IN_MEMORY_REPORTS and isinstance(obj, str))
     ):
         # Simple values are used as-is:
+        obj = cast(SmallType, obj)
         return None, obj
     elif isinstance(obj, (tuple, list, set)):
         # Structures are made shallow and referenced
@@ -9881,6 +9913,11 @@ def get_ref_src(src: str, node: ast.AST) -> str:
 
     # We're going to have to do this ourself: find the start of the
     # expression and state-machine to find its end
+    if not hasattr(node, "lineno") or not hasattr(node, "col_offset"):
+        raise TypeError(
+            f"Node {node!r} is missing lineno and/or col_offset"
+            f" attribute(s)."
+        )
     start = get_src_index(src, node.lineno, node.col_offset)
 
     # Figure out the end point

{optimism-3.1.3 → optimism-3.2}/optimism/test_examples.py

@@ -518,8 +518,9 @@ All 4 expectation(s) were met.
   Code does not contain the expected structure:
     at least 1 definition(s) of functionName
   Although it does partially satisfy the requirement:
-    Requirement partially satisfied via 0 full and 1 partial match(es):
+    Requirement partially satisfied via 0 full and 2 partial match(es):
       Partial match: FunctionDef on line 10
+      Partial match: FunctionDef on line 99
   checked code in file '{full_file}'""",
         "✓ {file}:44",
         """\
@@ -528,8 +529,9 @@ All 4 expectation(s) were met.
     at least 1 function definition(s) that also contain(s):
       at least 1 loop(s) or generator expression(s)
   Although it does partially satisfy the requirement:
-    Requirement partially satisfied via 0 full and 1 partial match(es):
+    Requirement partially satisfied via 0 full and 2 partial match(es):
       Partial match: FunctionDef on line 10
+      Partial match: FunctionDef on line 99
   checked code in file '{full_file}'""",
         """\
 ✗ {file}:46
@@ -601,24 +603,36 @@ All 4 expectation(s) were met.
   Code does not contain the expected structure:
     at least 1 constant 2.0
   Although it does partially satisfy the requirement:
-    Requirement partially satisfied via 0 full and 52 partial match(es):
+    Requirement partially satisfied via 0 full and 60 partial match(es):
 """ + ("""\
       Partial match: Constant on line 1
       Partial match: Constant on line 7""" if better_line_numbers else """\
       Partial match: Str on line 3
-      Partial match: NameConstant on line 7"""),  # not listing all 52...
+      Partial match: NameConstant on line 7"""),  # not listing all 60...
         "✓ {file}:94",
         """\
 ✗ {file}:95
   Code does not contain the expected structure:
     at least 1 constant 5.0
   Although it does partially satisfy the requirement:
-    Requirement partially satisfied via 0 full and 52 partial match(es):
+    Requirement partially satisfied via 0 full and 60 partial match(es):
 """ + ("""\
       Partial match: Constant on line 1
       Partial match: Constant on line 7""" if better_line_numbers else """\
       Partial match: Str on line 3
-      Partial match: NameConstant on line 7"""),  # not listing all 52...
+      Partial match: NameConstant on line 7"""),  # not listing all 60...
+        "✓ {file}:104",
+        "✓ {file}:107",
+        """\
+✗ {file}:110
+  Code does not contain the expected structure:
+    at least 1 definition(s) of aug that also contain(s):
+      no operator '/'
+  Although it does partially satisfy the requirement:
+    Requirement partially satisfied via 0 full and 2 partial match(es):
+      Partial match: FunctionDef on line 99
+      Partial match: FunctionDef on line 10
+"""
     ],
 
     "reverse_tracing": [
@@ -1360,63 +1374,72 @@ def test_all():
     Tests each example file. The `examples` directory must be in the
     same place that this `test_examples.py` file lives.
     """
-    os.chdir(os.path.join(os.path.dirname(__file__), "examples"))
-    sys.path.insert(0, '.')
-    for (mname, inputs) in EXAMPLES:
-        optimism.detailLevel(0)
-        optimism.deleteAllTestSuites()
-        optimism.colors(False)
-        module, output, stdout = run_example(mname, inputs)
-        # Replace tracebacks with generic forms so we can match on
-        # specific errors being reported while ignoring the files & lines
-        # where they are reported.
-        stdout = re.sub(
-            r"Traceback \(most recent call last\):.*?^([ a-zA-Z]*Error:)",
-            "Traceback omitted\n\\1",
-            stdout,
-            flags=re.MULTILINE | re.DOTALL
-        )
-        output = re.sub(
-            r"Traceback \(most recent call last\):.*?^([ a-zA-Z]*Error:)",
-            "Traceback omitted\n\\1",
-            output,
-            flags=re.MULTILINE | re.DOTALL
-        )
-        #output = re.sub(r"Traceback \(most recent call last\).*?NameError:", "HAHAHA", output, flags=re.MULTILINE | re.DOTALL)
-        # Scrub line numbers from tracebacks so our expectations don't
-        # become hopelessly fragile
-        stdout = re.sub(r", line \d+,", ", line X,", stdout)
-        output = re.sub(r", line \d+,", ", line X,", output)
-        for ex in EXPECTATIONS[mname]:
-            exp = ex.format(
-                file=os.path.basename(module.__file__),
-                dir=(
-                    os.path.split(module.__file__)[0] + '/'
-                    if better_line_numbers
-                    else ''
-                ),
-                full_file=module.__file__,
-                opt_file=optimism.__file__,
+    olddir = os.getcwd()
+    try:
+        os.chdir(os.path.join(os.path.dirname(__file__), "examples"))
+        sys.path.insert(0, '.')
+        for (mname, inputs) in EXAMPLES:
+            optimism.detailLevel(0)
+            optimism.deleteAllTestSuites()
+            optimism.colors(False)
+            module, output, stdout = run_example(mname, inputs)
+            # Replace tracebacks with generic forms so we can match on
+            # specific errors being reported while ignoring the files & lines
+            # where they are reported.
+            stdout = re.sub(
+                r"Traceback \(most recent call last\):.*?^([ a-zA-Z]*Error:)",
+                "Traceback omitted\n\\1",
+                stdout,
+                flags=re.MULTILINE | re.DOTALL
             )
-            # Redundant, but makes issues easier to diagnose
-            for line in exp.splitlines():
-                if line not in output:
-                    print("\n\nLINE:\n" + line)
-                    print("\n\nOUTPUT:\n" + output)
-                assert (line in output), (line, output)
-            if exp not in output:
-                print("\n\nEXP:\n" + exp)
-                print("\n\nOUTPUT:\n" + output)
-            assert (exp in output), (exp, output)
-        if mname in STDOUT_EXPECT:
-            for ex in STDOUT_EXPECT[mname]:
+            output = re.sub(
+                r"Traceback \(most recent call last\):.*?^([ a-zA-Z]*Error:)",
+                "Traceback omitted\n\\1",
+                output,
+                flags=re.MULTILINE | re.DOTALL
+            )
+            #output = re.sub(r"Traceback \(most recent call last\).*?NameError:", "HAHAHA", output, flags=re.MULTILINE | re.DOTALL)
+            # Scrub line numbers from tracebacks so our expectations don't
+            # become hopelessly fragile
+            stdout = re.sub(r", line \d+,", ", line X,", stdout)
+            output = re.sub(r", line \d+,", ", line X,", output)
+            for ex in EXPECTATIONS[mname]:
                 exp = ex.format(
                     file=os.path.basename(module.__file__),
-                    dir=os.path.split(module.__file__)[0],
+                    dir=(
+                        os.path.split(module.__file__)[0] + '/'
+                        if better_line_numbers
+                        else ''
+                    ),
                     full_file=module.__file__,
                     opt_file=optimism.__file__,
                 )
+                # Redundant, but makes issues easier to diagnose
                 for line in exp.splitlines():
-                    assert (line in stdout), stdout
-                assert (exp in stdout), stdout
-    os.chdir("..")
+                    if line not in output:
+                        print("\n\nLINE:\n" + line)
+                        print("\n\nOUTPUT:\n" + output)
+                    assert (line in output), (line, output)
+                if exp not in output:
+                    print("\n\nEXP:\n" + exp)
+                    print("\n\nOUTPUT:\n" + output)
+                assert (exp in output), (exp, output)
+            if mname in STDOUT_EXPECT:
+                for ex in STDOUT_EXPECT[mname]:
+                    exp = ex.format(
+                        file=os.path.basename(module.__file__),
+                        dir=os.path.split(module.__file__)[0],
+                        full_file=module.__file__,
+                        opt_file=optimism.__file__,
+                    )
+                    for line in exp.splitlines():
+                        assert (line in stdout), stdout
+                    assert (exp in stdout), stdout
+    finally:
+        os.chdir(olddir)
+
+
+if __name__ == "__main__":
+    print('Testing example files...')
+    test_all()
+    print('...all tests passed.')

{optimism-3.1.3 → optimism-3.2}/optimism.egg-info/PKG-INFO

@@ -1,16 +1,15 @@
-Metadata-Version: 2.1
+Metadata-Version: 2.4
 Name: optimism
-Version: 3.1.3
+Version: 3.2
 Summary: Very simple testing framework suitable for beginner programmers, with easy functions for accomplishing most common testing tasks like providing input. Requires Python 3.8+.
 Home-page: https://cs.wellesley.edu/~pmwh/optimism/docs/optimism.html
 Author: Peter Mawhorter
 Author-email: pmawhort@wellesley.edu
-License: BSD 3-Clause License
+License: LicenseRef-LLM-hostile_BSD
 Classifier: Programming Language :: Python :: 3 :: Only
 Classifier: Development Status :: 4 - Beta
 Classifier: Intended Audience :: Education
 Classifier: Intended Audience :: Developers
-Classifier: License :: OSI Approved :: BSD License
 Classifier: Operating System :: OS Independent
 Classifier: Natural Language :: English
 Classifier: Topic :: Education
@@ -19,6 +18,7 @@ Description-Content-Type: text/markdown
 License-File: LICENSE.txt
 Provides-Extra: test
 Requires-Dist: pytest; extra == "test"
+Dynamic: license-file
 
 # `optimism`
 
@@ -33,6 +33,17 @@ Designed by Peter Mawhorter.
 Works on Python versions 3.7 and up, with 3.9+ recommended.
 
 
+## Note on Large Language Models
+
+This project has a zero-tolerance policy for the use of large language
+models to write code, process the code or outputs from this project, or
+otherwise interact with this project in any way. If you choose to violate
+this policy, be aware that the code, text, and outputs of this project
+may cause (more) unpredictable (than usual) behavior in LLM systems that
+interact with them. See `LICENSE.txt` for license restrictions and
+disclaimers, and `AGENTS.md` for an example.
+
+
 ## Installing
 
 To install from PyPI, run the following command on the command-line:

{optimism-3.1.3 → optimism-3.2}/setup.cfg

@@ -7,13 +7,12 @@ long_description_content_type = text/markdown
 url = https://cs.wellesley.edu/~pmwh/optimism/docs/optimism.html
 author = Peter Mawhorter
 author_email = pmawhort@wellesley.edu
-license = BSD 3-Clause License
+license = LicenseRef-LLM-hostile_BSD
 classifiers = 
 	Programming Language :: Python :: 3 :: Only
 	Development Status :: 4 - Beta
 	Intended Audience :: Education
 	Intended Audience :: Developers
-	License :: OSI Approved :: BSD License
 	Operating System :: OS Independent
 	Natural Language :: English
 	Topic :: Education

optimism-3.1.3/LICENSE.txt

@@ -1,32 +0,0 @@
-Copyright (c) 2021-2022
-Peter Mawhorter
-Wellesley College
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are
-met:
-
-1. Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-
-2. Redistributions in binary form must reproduce the above copyright
-   notice, this list of conditions and the following disclaimer in the
-   documentation and/or other materials provided with the
-   distribution.
-
-3. Neither the name of the copyright holder nor the names of its
-   contributors may be used to endorse or promote products derived
-   from this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.