paroxython 0.6.4__tar.gz → 0.7.1__tar.gz

{paroxython-0.6.4 → paroxython-0.7.1}/PKG-INFO

@@ -1,12 +1,12 @@
 Metadata-Version: 2.1
 Name: paroxython
-Version: 0.6.4
+Version: 0.7.1
 Summary: Search Python code for algorithmic features
 Home-page: https://github.com/laowantong/paroxython/
 License: MIT
 Keywords: education,static-analysis,algorithmic,metaprogramming,python,taxonomic-classification,knowledge-management
 Author: Aristide Grange
-Requires-Python: >=3.6.1,<4.0.0
+Requires-Python: >=3.8,<4.0
 Classifier: Development Status :: 5 - Production/Stable
 Classifier: Environment :: Console
 Classifier: Framework :: IPython
@@ -15,12 +15,10 @@ Classifier: License :: OSI Approved :: MIT License
 Classifier: Natural Language :: English
 Classifier: Operating System :: OS Independent
 Classifier: Programming Language :: Python :: 3
-Classifier: Programming Language :: Python :: 3.7
 Classifier: Programming Language :: Python :: 3.8
 Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
-Classifier: Programming Language :: Python :: 3.6
-Classifier: Programming Language :: Python :: 3.7
+Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.8
 Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: SQL
@@ -29,13 +27,12 @@ Classifier: Topic :: Education
 Classifier: Typing :: Typed
 Requires-Dist: docopt (>=0.6.2,<0.7.0)
 Requires-Dist: regex (>=2022.8.17,<2023.0.0)
-Requires-Dist: typed-ast (>=1.5.4,<2.0.0)
 Requires-Dist: typing-extensions (>=4.3.0,<5.0.0)
 Project-URL: Repository, https://github.com/laowantong/paroxython/
 Project-URL: issues, https://github.com/laowantong/paroxython/issues
 Description-Content-Type: text/markdown
 
-[![Build Status](https://travis-ci.com/laowantong/paroxython.svg?branch=master)](https://travis-ci.com/laowantong/paroxython)
+[![Build Status](https://github.com/laowantong/paroxython/actions/workflows/build.yml/badge.svg)](https://github.com/laowantong/paroxython/actions/workflows/build.yml)
 [![codecov](https://img.shields.io/codecov/c/github/laowantong/paroxython/master)](https://codecov.io/gh/laowantong/paroxython)
 [![Checked with mypy](https://img.shields.io/badge/typing-mypy-brightgreen)](http://mypy-lang.org/)
 [![Codacy Badge](https://api.codacy.com/project/badge/Grade/73432ed4c5294326ba6279bbbb0fe2e6)](https://www.codacy.com/manual/laowantong/paroxython)
@@ -45,7 +42,7 @@ Description-Content-Type: text/markdown
 ![GitHub code size in bytes](https://img.shields.io/github/languages/code-size/laowantong/paroxython)
 [![paroxython SLOC](https://img.shields.io/badge/main%20program-~1850%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/paroxython)
 [![tests SLOC](https://img.shields.io/badge/tests-~2550%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/tests)
-[![helpers SLOC](https://img.shields.io/badge/helpers-~950%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/helpers)
+[![helpers SLOC](https://img.shields.io/badge/helpers-~900%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/helpers)
 [![spec features](https://img.shields.io/badge/spec-173%20features-blue)](https://github.com/laowantong/paroxython/blob/master/paroxython/resources/spec.md)
 [![taxonomy mappings](https://img.shields.io/badge/taxonomy-282%20mappings-blue)](https://github.com/laowantong/paroxython/blob/master/paroxython/resources/taxonomy.tsv)
 ![GitHub commit activity](https://img.shields.io/github/commit-activity/y/laowantong/paroxython.svg?style=flat)
@@ -178,7 +175,7 @@ Et voilà, [your recommendation report](https://github.com/laowantong/paroxython
 Much to no one's surprise:
 
 ```
-pip install paroxython
+python -m pip install paroxython
 ```
 
 The following command should print a help message and exit:
@@ -195,7 +192,7 @@ If you use Jupyter notebook/lab, you've also just installed a so-called magic co
 %load_ext paroxython
 ```
 
-This should print `"paroxython 0.6.3 loaded."`. Run it on a cell of Python code:
+This should print `"paroxython 0.7.0 loaded."`. Run it on a cell of Python code:
 
 ```python
 %%paroxython                          # Lines

{paroxython-0.6.4 → paroxython-0.7.1}/README.md

@@ -1,4 +1,4 @@
-[![Build Status](https://travis-ci.com/laowantong/paroxython.svg?branch=master)](https://travis-ci.com/laowantong/paroxython)
+[![Build Status](https://github.com/laowantong/paroxython/actions/workflows/build.yml/badge.svg)](https://github.com/laowantong/paroxython/actions/workflows/build.yml)
 [![codecov](https://img.shields.io/codecov/c/github/laowantong/paroxython/master)](https://codecov.io/gh/laowantong/paroxython)
 [![Checked with mypy](https://img.shields.io/badge/typing-mypy-brightgreen)](http://mypy-lang.org/)
 [![Codacy Badge](https://api.codacy.com/project/badge/Grade/73432ed4c5294326ba6279bbbb0fe2e6)](https://www.codacy.com/manual/laowantong/paroxython)
@@ -8,7 +8,7 @@
 ![GitHub code size in bytes](https://img.shields.io/github/languages/code-size/laowantong/paroxython)
 [![paroxython SLOC](https://img.shields.io/badge/main%20program-~1850%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/paroxython)
 [![tests SLOC](https://img.shields.io/badge/tests-~2550%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/tests)
-[![helpers SLOC](https://img.shields.io/badge/helpers-~950%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/helpers)
+[![helpers SLOC](https://img.shields.io/badge/helpers-~900%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/helpers)
 [![spec features](https://img.shields.io/badge/spec-173%20features-blue)](https://github.com/laowantong/paroxython/blob/master/paroxython/resources/spec.md)
 [![taxonomy mappings](https://img.shields.io/badge/taxonomy-282%20mappings-blue)](https://github.com/laowantong/paroxython/blob/master/paroxython/resources/taxonomy.tsv)
 ![GitHub commit activity](https://img.shields.io/github/commit-activity/y/laowantong/paroxython.svg?style=flat)
@@ -141,7 +141,7 @@ Et voilà, [your recommendation report](https://github.com/laowantong/paroxython
 Much to no one's surprise:
 
 ```
-pip install paroxython
+python -m pip install paroxython
 ```
 
 The following command should print a help message and exit:
@@ -158,7 +158,7 @@ If you use Jupyter notebook/lab, you've also just installed a so-called magic co
 %load_ext paroxython
 ```
 
-This should print `"paroxython 0.6.3 loaded."`. Run it on a cell of Python code:
+This should print `"paroxython 0.7.0 loaded."`. Run it on a cell of Python code:
 
 ```python
 %%paroxython                          # Lines

{paroxython-0.6.4 → paroxython-0.7.1}/paroxython/cli.py

@@ -27,8 +27,8 @@ from docopt import docopt  # type: ignore
 from . import PAROXYTHON_VERSION
 from .goodies import print_exit
 
-if sys.version < "3.6":  # pragma: no cover
-    print_exit(f"Paroxython requires Python 3.6 or later to run.\nThis version is {sys.version}.")
+if sys.version_info < (3, 8):  # pragma: no cover
+    print_exit(f"Paroxython requires Python 3.8 or later to run.\nThis version is {sys.version}.")
 
 
 def main():

{paroxython-0.6.4 → paroxython-0.7.1}/paroxython/cli_collect.py

@@ -30,7 +30,7 @@ OPTIONS:
     -t --taxonomy=PATH  The path of a TSV file mapping labels onto taxa. If not
                         specified, use the "taxonomy.tsv" present in DIRECTORY's
                         parent. If absent, use the included default taxonomy:
-                        https://github.com/laowantong/paroxython/blob/0.6.3/paroxython/resources/taxonomy.tsv
+                        https://github.com/laowantong/paroxython/blob/0.7.0/paroxython/resources/taxonomy.tsv
     ```
 """
 

{paroxython-0.6.4 → paroxython-0.7.1}/paroxython/cli_tag.py

@@ -12,7 +12,7 @@ OPTIONS:
     -l --labels         Output the labels instead of the taxa.
     -t --taxonomy=PATH  The path of a TSV file mapping labels onto taxa.
                         If not specified, use the included default taxonomy:
-                        https://github.com/laowantong/paroxython/blob/0.6.3/paroxython/resources/taxonomy.tsv
+                        https://github.com/laowantong/paroxython/blob/0.7.0/paroxython/resources/taxonomy.tsv
     ```
 """
 

{paroxython-0.6.4 → paroxython-0.7.1}/paroxython/flatten_ast.py

@@ -11,8 +11,8 @@ tree) of the program to analyze. For instance, when the string:
 'print("hello, world")'
 ```
 
-... is fed to the function `parse()` of the modules [`ast`](https://docs.python.org/3/library/ast.html)
-or [`typed_ast`](https://github.com/python/typed_ast), the following object is returned:
+... is fed to the function `parse()` of the module [`ast`](https://docs.python.org/3/library/ast.html),
+the following object is returned:
 
 ```plain
                            Module()
@@ -90,28 +90,6 @@ of this text to make it more suitable for regular expression parsing.
 
 ## Implementation details
 
-### Libraries used
-
-When Paroxython is launched from Python 3.7 or lower, the parsing of source code into an AST is
-performed by the third-party library [typed-ast](https://github.com/python/typed_ast). To quote the
-README:
-
-> `typed_ast` is a Python 3 package that provides a [...] parser similar to the standard `ast` library.
-> Unlike `ast`, the parsers [...] are independent of the version of Python under which they are run.
-> [...] `typed_ast` runs on CPython 3.5-3.8
-
-So far so good. However:
-
-> `typed_ast` will not be updated to support parsing Python 3.8 and newer.
-
-This means that `typed_ast`, although convenient to parse Python 3.5 and newer, will start choping on
-Python 3.8 specific syntax, as assignment expressions.
-
-This is the reason why, when launched from Python 3.8 or higher, Paroxython switches to the parser of
-the standard library [`ast`](https://docs.python.org/3/library/ast.html). However, the ASTs generated
-by the two libraries are not 100% identical. Wrapping their parsers requires us to erase as much
-differences as possible. Some of the functions presented below are written for this purpose.
-
 ### On the fly: modification of the AST
 
 #### Field reordering
@@ -334,6 +312,7 @@ and classes would incorrectly be marked as starting from the line of their first
 """
 
 
+import ast
 import sys
 from typing import Any, Callable, Match
 
@@ -343,24 +322,24 @@ import regex  # type: ignore
 def select_ast_post_processing():
     """Customize the post-treatment of the AST depending on the parser used to create it."""
 
-    if sys.version_info >= (3, 9):
+    if sys.version_info >= (3, 10):
 
         def post_process(flat_ast):
             flat_ast = suppress_kinds(flat_ast)
+            flat_ast = suppress_alias_pos(flat_ast)
             flat_ast = suppress_posonlyargs(flat_ast)
             flat_ast = backport_all_constants(flat_ast)
             flat_ast = simplify_negative_literals(flat_ast)
             flat_ast = unquote(flat_ast)
             return flat_ast
 
-    elif sys.version_info >= (3, 8):
+    elif sys.version_info >= (3, 9):
 
         def post_process(flat_ast):
             flat_ast = suppress_kinds(flat_ast)
             flat_ast = suppress_posonlyargs(flat_ast)
             flat_ast = backport_all_constants(flat_ast)
             flat_ast = simplify_negative_literals(flat_ast)
-            flat_ast = simplify_indexes(flat_ast)
             flat_ast = unquote(flat_ast)
             return flat_ast
 
@@ -368,22 +347,17 @@ def select_ast_post_processing():
 
         def post_process(flat_ast):
             flat_ast = suppress_kinds(flat_ast)
+            flat_ast = suppress_posonlyargs(flat_ast)
+            flat_ast = backport_all_constants(flat_ast)
             flat_ast = simplify_negative_literals(flat_ast)
             flat_ast = simplify_indexes(flat_ast)
             flat_ast = unquote(flat_ast)
-            flat_ast = correct_all_decorated_callable_starts(flat_ast)
             return flat_ast
 
     return post_process
 
 
-# fmt: off
-if sys.version_info >= (3, 8):
-    import ast
-else:
-    from typed_ast import ast3 as ast # type: ignore
 post_process = select_ast_post_processing()
-# fmt: on
 
 
 def flatten_ast(tree) -> str:
@@ -411,7 +385,7 @@ def flatten_node(
         prefix (str, optional): The prefix of the current line to dump. Defaults to `""`.
         path (str, optional): The path of the current node. Defaults to `""`.
         remove_context (Callable, optional): A function removing the node context encoded in the
-            result of `ast3.dump()`.
+            result of `ast.dump()`.
             [Not to be explicitly provided.](developer_manual/index.html#default-argument-trick)
             Defaults to `regex.compile(r", ctx=.+?\(\)").sub`.
 
@@ -565,11 +539,23 @@ def suppress_kinds(
     return sub("", flat_ast)
 
 
+def suppress_alias_pos(
+    flat_ast: str,
+    sub: Callable = regex.compile(r"(?m)^(.+/_type=alias\n).+_pos=.+\n").sub,
+) -> str:
+    """Suppress the AST line following import aliases. Since Python 3.10, it contains a position,
+    useless in the following.
+
+    Argument `sub` [not to be explicitly provided.](developer_manual/index.html#default-argument-trick)
+    """
+    return sub(r"\1", flat_ast)
+
+
 def suppress_posonlyargs(
     flat_ast: str,
     sub: Callable = regex.compile(r"(?m)^.+/args/posonlyargs/_length=\d+\n").sub,
 ) -> str:
-    """Starting from Python 3.8, suppress positional-only parameters in function definitions.
+    """Suppress positional-only parameters in function definitions.
 
     Argument `sub` [not to be explicitly provided.](developer_manual/index.html#default-argument-trick)
     """

{paroxython-0.6.4 → paroxython-0.7.1}/paroxython/make_db.py

@@ -193,9 +193,8 @@ class TagDatabase:
                         )
                     )
 
-        if db_path.exists():  # pragma: no cover / Python 3.8: use missing_ok=True parameter
-            db_path.unlink()
-        connexion = sqlite3.connect(str(db_path))  # str() for Python 3.6 compatibility
+        db_path.unlink(missing_ok=True)
+        connexion = sqlite3.connect(db_path)
         c = connexion.cursor()
 
         fill = lambda columns: ",".join("?" * len(columns))

{paroxython-0.6.4 → paroxython-0.7.1}/paroxython/resources/spec.md

@@ -5696,6 +5696,7 @@ Match sequential loops, along with their iteration variable(s).
 [⬇️ feature `accumulate_some_elements`](#feature-accumulate_some_elements)  
 [⬇️ feature `find_best_element`](#feature-find_best_element)  
 [⬇️ feature `find_best_element_index`](#feature-find_best_element_index)  
+[⬇️ feature `find_first_good_element`](#feature-find_first_good_element)  
 [⬇️ feature `for_range`](#feature-for_range)  
 [⬇️ feature `nested_for`](#feature-nested_for)  
 [⬇️ feature `universal_quantification|existential_quantification`](#feature-universal_quantificationexistential_quantification)  
@@ -5881,10 +5882,6 @@ GROUP BY path
 
 Iterate over the elements of a (named) collection.
 
-##### Derivations
-
-[⬇️ feature `find_first_good_element`](#feature-find_first_good_element)  
-
 ##### Specification
 
 ```re
@@ -7461,7 +7458,7 @@ Linear search. Return the first element of a sequence satisfying a predicate.
 
 ##### Derivations
 
-[⬆️ feature `for_each`](#feature-for_each)  
+[⬆️ feature `for`](#feature-for)  
 [⬆️ feature `if`](#feature-if)  
 [⬆️ feature `if_test_atom`](#feature-if_test_atom)  
 [⬆️ feature `return`](#feature-return)  
@@ -7473,7 +7470,7 @@ SELECT "find_first_good_element",
        lp.name_suffix,
        lp.span,
        lp.path
-FROM t_for_each lp -- A for each loop...
+FROM t_for lp -- A for each loop...
 JOIN t_if ON (t_if.path GLOB lp.path || "*-")-- enclosing an if statement...
 JOIN t_if_test_atom x ON (x.span_start = t_if.span_start
                           AND x.name_suffix = lp.name_suffix)-- which tests the iteration variable...
@@ -7487,7 +7484,12 @@ JOIN t_return ret ON (ret.path GLOB t_if.path || "*-" -- and returns...
 1   def search_element(iterable):
 2       for element in iterable:
 3           if is_good(element):
-4                return element
+4               return element
+5   def largest_prime_below(n):
+6       for i in range(n - 1, 1, -1):
+7           if is_prime(i):
+8               return i
+9       return None
 ```
 
 ##### Matches
@@ -7495,6 +7497,7 @@ JOIN t_return ret ON (ret.path GLOB t_if.path || "*-" -- and returns...
 | Label | Lines |
 |:--|:--|
 | `find_first_good_element:element` | 2-4 |
+| `find_first_good_element:i` | 6-8 |
 
 --------------------------------------------------------------------------------
 

{paroxython-0.6.4 → paroxython-0.7.1}/pyproject.toml

@@ -1,11 +1,11 @@
 [tool.poetry]
 name = "paroxython"
-version = "0.6.4"
+version = "0.7.1"
 description = "Search Python code for algorithmic features"
 authors = ["Aristide Grange"]
 license = "MIT"
 readme = "README.md"
-homepage = ""
+homepage = "https://github.com/laowantong/paroxython/"
 repository = "https://github.com/laowantong/paroxython/"
 keywords = ["education",
             "static-analysis",
@@ -22,8 +22,6 @@ classifiers = [
     "License :: OSI Approved :: MIT License",
     "Natural Language :: English",
     "Operating System :: OS Independent",
-    "Programming Language :: Python :: 3.6",
-    "Programming Language :: Python :: 3.7",
     "Programming Language :: Python :: 3.8",
     "Programming Language :: Python :: 3.9",
     "Programming Language :: SQL",
@@ -34,15 +32,14 @@ classifiers = [
 
 [tool.poetry.dependencies]
 docopt = "^0.6.2"
-python = "^3.6.1"
+python = "^3.8"
 regex = "^2022.8.17"
-typed-ast = "^1.5.4"
 typing-extensions = "^4.3.0"
 
 [tool.poetry.dev-dependencies]
 mypy = "^0.782"
 pdoc3 = "^0.9.1"
-pre-commit = "^2.6.0"
+pre-commit = "^2.20.0"
 pytest = "^7.1.3"
 pytest-icdiff = "^2.4.7"
 sqlparse = "^0.4.2"

paroxython-0.7.1/setup.py

@@ -0,0 +1,36 @@
+# -*- coding: utf-8 -*-
+from setuptools import setup
+
+packages = \
+['paroxython']
+
+package_data = \
+{'': ['*'], 'paroxython': ['resources/*']}
+
+install_requires = \
+['docopt>=0.6.2,<0.7.0',
+ 'regex>=2022.8.17,<2023.0.0',
+ 'typing-extensions>=4.3.0,<5.0.0']
+
+entry_points = \
+{'console_scripts': ['paroxython = paroxython.cli:main']}
+
+setup_kwargs = {
+    'name': 'paroxython',
+    'version': '0.7.1',
+    'description': 'Search Python code for algorithmic features',
+    'long_description': '[![Build Status](https://github.com/laowantong/paroxython/actions/workflows/build.yml/badge.svg)](https://github.com/laowantong/paroxython/actions/workflows/build.yml)\n[![codecov](https://img.shields.io/codecov/c/github/laowantong/paroxython/master)](https://codecov.io/gh/laowantong/paroxython)\n[![Checked with mypy](https://img.shields.io/badge/typing-mypy-brightgreen)](http://mypy-lang.org/)\n[![Codacy Badge](https://api.codacy.com/project/badge/Grade/73432ed4c5294326ba6279bbbb0fe2e6)](https://www.codacy.com/manual/laowantong/paroxython)\n[![Updates](https://pyup.io/repos/github/laowantong/paroxython/shield.svg)](https://pyup.io/repos/github/laowantong/paroxython/)\n![PyPI - Python Version](https://img.shields.io/pypi/pyversions/paroxython)\n[![GitHub Release](https://img.shields.io/github/release/laowantong/paroxython.svg?style=flat)]()\n![GitHub code size in bytes](https://img.shields.io/github/languages/code-size/laowantong/paroxython)\n[![paroxython SLOC](https://img.shields.io/badge/main%20program-~1850%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/paroxython)\n[![tests SLOC](https://img.shields.io/badge/tests-~2550%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/tests)\n[![helpers SLOC](https://img.shields.io/badge/helpers-~900%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/helpers)\n[![spec features](https://img.shields.io/badge/spec-173%20features-blue)](https://github.com/laowantong/paroxython/blob/master/paroxython/resources/spec.md)\n[![taxonomy mappings](https://img.shields.io/badge/taxonomy-282%20mappings-blue)](https://github.com/laowantong/paroxython/blob/master/paroxython/resources/taxonomy.tsv)\n![GitHub commit activity](https://img.shields.io/github/commit-activity/y/laowantong/paroxython.svg?style=flat)\n[![Downloads](https://pepy.tech/badge/paroxython/week)](https://pepy.tech/project/paroxython/week)\n[![Code style: black](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/psf/black)\n[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)\n[![Band-aid](https://badgen.net/badge/not%C2%A0%C2%A0%F0%9F%85%B3%F0%9F%85%B4%F0%9F%85%B0%F0%9F%85%B3/yet/F3D9C5?labelColor=F3D9C5)](https://youtu.be/QcbR1J_4ICg?t=54)\n\n<p align="center">\n  <a href="https://laowantong.github.io/paroxython/index.html">\n  <img src="docs/resources/logo.png">\n  </a>\n</p>\n\n## Introduction\n\nParoxython is a set of command line tools which **tag** and **filter** by algorithmic features your collection of Python programming exercises.\n\n### Audience\n\nYou are a teacher, in charge of an introductory programming course in an educational institution. Over the years, you have accumulated many—far too many—programs and code snippets that may be of interest to your students.\n\nOr, as a seasoned developer, you would like to share your knowledge by helping a loved one learn how to code. A cursory search for pedagogical material yields an overwhelming amount of websites and repositories stuffed with Python programs of various levels (e.g.,\n[1](https://github.com/TheAlgorithms/Python),\n[2](http://rosettacode.org/wiki/Category:Python),\n[3](https://www.programming-idioms.org/about#about-block-language-coverage),\n[4](https://github.com/codebasics/py),\n[5](https://github.com/keon/algorithms),\n[6](https://github.com/OmkarPathak/Python-Programs),\nand a lot more from [Awesome Python in Education](https://github.com/quobit/awesome-python-in-education)).\n\nIn any case, the Python source codes you have gathered are typically\n**numerous** (hundreds or even thousands),\n**reasonably sized** (anything below 100 lines of code),\nand **educational** in nature (e.g., snippets, examples, quizzes, exercise solutions, classic algorithms).\nThe programming concepts you plan to teach remain relatively **low level** (e.g. assignments, nested loops, accumulation patterns, tail recursive functions, etc.).\n\nIf all that sounds familiar, keep reading me.\n\n### Main goals\n\nParoxython aims to help you select, from your collection, the one program that best suits your needs. For instance, it will gladly answer the following questions:\n\n> - How can this concept be illustrated?\n> - What problems use the same algorithmic and data structures as this one?\n> - What homework assignment should I give my students so they can practice the content of the last lesson?\n\nMoreover, since Paroxython knows what your class knows, it can recommend the right program at the right time:\n\n> - What would make a good review exercise?\n> - Which exercises can I give on this exam?\n> - What is the current learning cost of this example?\n\nIn the long run, Paroxython may guide you and somehow make you rethink your course outline:\n\n> - What are the prerequisites for the concept of assignment?\n> - Do I have enough material to introduce subroutines before I even talk about conditionals and loops?\n> - Among the loops, which must come first: the most powerful (`while`), or the most useful (`for`)?\n> - How to logically structure this bunch of usual iterative patterns?\n> - What are the _basics_, exactly?\n\nAll issues on which the author changed his mind since he started to work on this project!\n\nIn an ideal world, Paroxython could even put an end to the deadliest religious wars, with rational, data-driven arguments:\n\n> - Father, is it a sin to exit early?\n> - Should a real byte use a mask?\n\n### How it works\n\n<p align="center">\n  <a href="https://laowantong.github.io/paroxython/developer_manual/index.html">\n  <img src="docs/resources/waterfall.png">\n  </a>\n</p>\n\nParoxython starts from a given folder of **programs**. Its contents is parsed, and all features that meet the provided **specifications** are labelled and associated with their spans (e.g., `"assignment_lhs_identifier:a": 4, 6, 18` or `"loop_with_late_exit:while": 3-7, 20-29`).\n\nThese **labels** constitute only scattered knowledge. The next step is to map them onto a **taxonomy** designed with basic hierarchical constraints in mind (e.g., the fact that the introduction of the concept of early exit must come after that of loop, which itself requires that of control flow, is expressed by the _taxon_ `"flow/loop/exit/early"`).\n\n<p align="center">\n  <a href="https://laowantong.github.io/paroxython/user_manual/index.html#taxonomy">\n  <img src="docs/resources/tree.png" alt="A taxonomy.">\n  </a>\n  <br>\n  <em>Extract of the taxonomy generated from <a href="https://github.com/TheAlgorithms/Python">The Algorithms - Python</a>.<br>Click to jump to its full dynamic version in the user manual.</em>\n</p>\n\nEverything is then persisted in a tag **database**, which can later be filtered through a **pipeline** of commands, for instance:\n\n- _include_ only the programs which feature a recursive function;\n- _exclude_ this or that program you want to set aside for the exam;\n- “_impart_” all programs studied so far, _i.e_, consider that all the notions they implement are acquired.\n\nThe result is a list of program **recommendations** ordered by increasing learning cost.\n\n### Example\n\nSuppose that the `programs` directory contains [these simple programs](https://wiki.python.org/moin/SimplePrograms).\n\nFirst, build [this tag database](https://github.com/laowantong/paroxython/blob/master/examples/simple/programs_db.json):\n\n```shell\n> paroxython collect programs\nLabelling 21 programs.\nMapping taxonomy on 21 programs.\nWriting programs_db.json.\n```\n\nThen, filter it through [this pipeline](https://github.com/laowantong/paroxython/blob/master/examples/simple/programs_pipe.py):\n\n```shell\n> paroxython recommend programs\nProcessing 5 commands on 21 programs.\n  19 programs remaining after operation 1 (impart).\n  18 programs remaining after operation 2 (exclude).\n  12 programs remaining after operation 3 (exclude).\n  10 programs remaining after operation 4 (include).\n  10 programs remaining after operation 5 (hide).\nDumped: programs_recommendations.md.\n```\n\nEt voilà, [your recommendation report](https://github.com/laowantong/paroxython/blob/master/examples/simple/programs_recommendations.md)!\n\n\n## Installation and test-drive\n\n### Command line\n\nMuch to no one\'s surprise:\n\n```\npython -m pip install paroxython\n```\n\nThe following command should print a help message and exit:\n\n```\nparoxython --help\n```\n\n### IPython magic command\n\nIf you use Jupyter notebook/lab, you\'ve also just installed a so-called magic command. Load it like this:\n\n```python\n%load_ext paroxython\n```\n\nThis should print `"paroxython 0.7.0 loaded."`. Run it on a cell of Python code:\n\n```python\n%%paroxython                          # Lines\ndef fibonacci(n):                     # 2\n    result = []                       # 3\n    (a, b) = (0, 1)                   # 4\n    while a < n:                      # 5\n        result.append(a)              # 6\n        (a, b) = (b, a + b)           # 7\n    return result                     # 8\n```\n\n| Taxon | Lines |\n|:--|:--|\n| `call/subroutine/method/sequence/list/append` | 6 |\n| `condition/inequality` | 5 |\n| `def/subroutine/function/impure` | 2-8 |\n| `def/subroutine/parameter/arg` | 2 |\n| `flow/loop/exit/late` | 5-7 |\n| `flow/loop/while` | 5-7 |\n| `meta/count/program/sloc/8` | 2-8 |\n| `meta/count/subroutine/sloc/7` | 2-8 |\n| `meta/count/variety/3` | 2-8 |\n| `meta/program` | 2-8 |\n| `operator/arithmetic/addition` | 7 |\n| `style/procedural` | 2-8 |\n| `type/number/integer/literal` | 4 |\n| `type/number/integer/literal/zero` | 4 |\n| `type/sequence/list` | 6 |\n| `type/sequence/list/literal/empty` | 3 |\n| `type/sequence/tuple/literal` | 4, 4, 7, 7 |\n| `var/assignment/explicit/parallel` | 4 |\n| `var/assignment/explicit/parallel/slide` | 7 |\n| `var/assignment/explicit/single` | 3 |\n| `var/assignment/implicit/parameter` | 2 |\n| `var/scope/local` | 2-8, 2-8, 2-8, 2-8 |\n\nAs you can see, in this program, Paroxython identifies among others:\n\n- the use of the [procedural paradigm](https://en.wikipedia.org/wiki/Procedural_programming) (`style/procedural`);\n- an im[pure function](https://en.wikipedia.org/wiki/Pure_function) (`def/subroutine/function/impure`);\n- a `while` loop (`flow/loop/while`) with a late exit (`flow/loop/exit/late`);\n- a little bit of voodoo on lists (`type/sequence/list/literal/empty` and `call/subroutine/method/sequence/list/append`);\n- a simple [tuple assignment](https://en.wikibooks.org/wiki/Python_Programming/Tuples#Packing_and_Unpacking) (`var/assignment/explicit/parallel`). Note that we distinguish between explicit (with `=`) and implicit (parameters and iteration variables) assignments;\n- a “sliding” tuple assignment (`var/assignment/explicit/parallel/slide`). If the denomination is unique to us, the pattern itself occurs in a number of programs: implementations of [C-finite sequences](https://en.wikipedia.org/wiki/Constant-recursive_sequence) with C greater than 1, [Greatest Common Divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor), [Quicksort](https://en.wikipedia.org/wiki/Quicksort), etc.\n- four local variables (`var/scope/local`);\n- an estimation of the variety of concepts involved (`meta/count/variety/***`), depending on the number of lines, features and distinct features.\n\nThe magic command `%%paroxython` (corresponding to the subcommand [`tag`](https://laowantong.github.io/paroxython/cli_tag.html)) only scratches the surface of the system. As shown before, to estimate the learning cost of the features and get actionable recommendations, you will need first to construct the tag database with [`collect`](https://laowantong.github.io/paroxython/cli_collect.html), and then call [`recommend`](https://laowantong.github.io/paroxython/cli_recommend.html) on a pipeline of yours.\n\n# Read them\n\nAlthough this is still a work-in-progress, Paroxython should already be fairly well [documented](https://laowantong.github.io/paroxython/index.html):\n\n- [User manual](https://laowantong.github.io/paroxython/user_manual/index.html):\n  - [write a command pipeline to get recommendations](https://laowantong.github.io/paroxython/user_manual/index.html#pipeline-tutorial),\n  - [prepare your program collections for better results](https://laowantong.github.io/paroxython/user_manual/index#preparing-your-program-collection),\n  - [understand and modify the taxonomic classification](https://laowantong.github.io/paroxython/user_manual/index#taxonomy),\n  - and more.\n- [Developer manual](https://laowantong.github.io/paroxython/developer_manual/index.html):\n  - [get a rough idea of the program structure and operations](https://laowantong.github.io/paroxython/developer_manual/index.html#bird-view),\n  - [use the provided helpers to contribute to the code](helper-programs),\n  - and more.\n- [Module reference](https://laowantong.github.io/paroxython/#header-submodules).\n- [Feature specifications](https://github.com/laowantong/paroxython/blob/master/paroxython/resources/spec.md): a document mixing prose, tests, regular expressions and SQL queries to describe which algorithmic features are recognized and how.\n- [User types](https://github.com/laowantong/paroxython/blob/master/paroxython/user_types.py): all objects of interest are precisely typed and checked by [mypy](http://mypy-lang.org).\n\nFinally, a [battery of examples](https://github.com/laowantong/paroxython/tree/master/examples) and [comprehensive test coverage](https://github.com/laowantong/paroxython/tree/master/tests) should help answer any remaining question.\n',
+    'author': 'Aristide Grange',
+    'author_email': 'None',
+    'maintainer': 'None',
+    'maintainer_email': 'None',
+    'url': 'https://github.com/laowantong/paroxython/',
+    'packages': packages,
+    'package_data': package_data,
+    'install_requires': install_requires,
+    'entry_points': entry_points,
+    'python_requires': '>=3.8,<4.0',
+}
+
+
+setup(**setup_kwargs)

paroxython-0.6.4/setup.py

@@ -1,37 +0,0 @@
-# -*- coding: utf-8 -*-
-from setuptools import setup
-
-packages = \
-['paroxython']
-
-package_data = \
-{'': ['*'], 'paroxython': ['resources/*']}
-
-install_requires = \
-['docopt>=0.6.2,<0.7.0',
- 'regex>=2022.8.17,<2023.0.0',
- 'typed-ast>=1.5.4,<2.0.0',
- 'typing-extensions>=4.3.0,<5.0.0']
-
-entry_points = \
-{'console_scripts': ['paroxython = paroxython.cli:main']}
-
-setup_kwargs = {
-    'name': 'paroxython',
-    'version': '0.6.4',
-    'description': 'Search Python code for algorithmic features',
-    'long_description': '[![Build Status](https://travis-ci.com/laowantong/paroxython.svg?branch=master)](https://travis-ci.com/laowantong/paroxython)\n[![codecov](https://img.shields.io/codecov/c/github/laowantong/paroxython/master)](https://codecov.io/gh/laowantong/paroxython)\n[![Checked with mypy](https://img.shields.io/badge/typing-mypy-brightgreen)](http://mypy-lang.org/)\n[![Codacy Badge](https://api.codacy.com/project/badge/Grade/73432ed4c5294326ba6279bbbb0fe2e6)](https://www.codacy.com/manual/laowantong/paroxython)\n[![Updates](https://pyup.io/repos/github/laowantong/paroxython/shield.svg)](https://pyup.io/repos/github/laowantong/paroxython/)\n![PyPI - Python Version](https://img.shields.io/pypi/pyversions/paroxython)\n[![GitHub Release](https://img.shields.io/github/release/laowantong/paroxython.svg?style=flat)]()\n![GitHub code size in bytes](https://img.shields.io/github/languages/code-size/laowantong/paroxython)\n[![paroxython SLOC](https://img.shields.io/badge/main%20program-~1850%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/paroxython)\n[![tests SLOC](https://img.shields.io/badge/tests-~2550%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/tests)\n[![helpers SLOC](https://img.shields.io/badge/helpers-~950%20SLOC-blue)](https://github.com/laowantong/paroxython/blob/master/helpers)\n[![spec features](https://img.shields.io/badge/spec-173%20features-blue)](https://github.com/laowantong/paroxython/blob/master/paroxython/resources/spec.md)\n[![taxonomy mappings](https://img.shields.io/badge/taxonomy-282%20mappings-blue)](https://github.com/laowantong/paroxython/blob/master/paroxython/resources/taxonomy.tsv)\n![GitHub commit activity](https://img.shields.io/github/commit-activity/y/laowantong/paroxython.svg?style=flat)\n[![Downloads](https://pepy.tech/badge/paroxython/week)](https://pepy.tech/project/paroxython/week)\n[![Code style: black](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/psf/black)\n[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)\n[![Band-aid](https://badgen.net/badge/not%C2%A0%C2%A0%F0%9F%85%B3%F0%9F%85%B4%F0%9F%85%B0%F0%9F%85%B3/yet/F3D9C5?labelColor=F3D9C5)](https://youtu.be/QcbR1J_4ICg?t=54)\n\n<p align="center">\n  <a href="https://laowantong.github.io/paroxython/index.html">\n  <img src="docs/resources/logo.png">\n  </a>\n</p>\n\n## Introduction\n\nParoxython is a set of command line tools which **tag** and **filter** by algorithmic features your collection of Python programming exercises.\n\n### Audience\n\nYou are a teacher, in charge of an introductory programming course in an educational institution. Over the years, you have accumulated many—far too many—programs and code snippets that may be of interest to your students.\n\nOr, as a seasoned developer, you would like to share your knowledge by helping a loved one learn how to code. A cursory search for pedagogical material yields an overwhelming amount of websites and repositories stuffed with Python programs of various levels (e.g.,\n[1](https://github.com/TheAlgorithms/Python),\n[2](http://rosettacode.org/wiki/Category:Python),\n[3](https://www.programming-idioms.org/about#about-block-language-coverage),\n[4](https://github.com/codebasics/py),\n[5](https://github.com/keon/algorithms),\n[6](https://github.com/OmkarPathak/Python-Programs),\nand a lot more from [Awesome Python in Education](https://github.com/quobit/awesome-python-in-education)).\n\nIn any case, the Python source codes you have gathered are typically\n**numerous** (hundreds or even thousands),\n**reasonably sized** (anything below 100 lines of code),\nand **educational** in nature (e.g., snippets, examples, quizzes, exercise solutions, classic algorithms).\nThe programming concepts you plan to teach remain relatively **low level** (e.g. assignments, nested loops, accumulation patterns, tail recursive functions, etc.).\n\nIf all that sounds familiar, keep reading me.\n\n### Main goals\n\nParoxython aims to help you select, from your collection, the one program that best suits your needs. For instance, it will gladly answer the following questions:\n\n> - How can this concept be illustrated?\n> - What problems use the same algorithmic and data structures as this one?\n> - What homework assignment should I give my students so they can practice the content of the last lesson?\n\nMoreover, since Paroxython knows what your class knows, it can recommend the right program at the right time:\n\n> - What would make a good review exercise?\n> - Which exercises can I give on this exam?\n> - What is the current learning cost of this example?\n\nIn the long run, Paroxython may guide you and somehow make you rethink your course outline:\n\n> - What are the prerequisites for the concept of assignment?\n> - Do I have enough material to introduce subroutines before I even talk about conditionals and loops?\n> - Among the loops, which must come first: the most powerful (`while`), or the most useful (`for`)?\n> - How to logically structure this bunch of usual iterative patterns?\n> - What are the _basics_, exactly?\n\nAll issues on which the author changed his mind since he started to work on this project!\n\nIn an ideal world, Paroxython could even put an end to the deadliest religious wars, with rational, data-driven arguments:\n\n> - Father, is it a sin to exit early?\n> - Should a real byte use a mask?\n\n### How it works\n\n<p align="center">\n  <a href="https://laowantong.github.io/paroxython/developer_manual/index.html">\n  <img src="docs/resources/waterfall.png">\n  </a>\n</p>\n\nParoxython starts from a given folder of **programs**. Its contents is parsed, and all features that meet the provided **specifications** are labelled and associated with their spans (e.g., `"assignment_lhs_identifier:a": 4, 6, 18` or `"loop_with_late_exit:while": 3-7, 20-29`).\n\nThese **labels** constitute only scattered knowledge. The next step is to map them onto a **taxonomy** designed with basic hierarchical constraints in mind (e.g., the fact that the introduction of the concept of early exit must come after that of loop, which itself requires that of control flow, is expressed by the _taxon_ `"flow/loop/exit/early"`).\n\n<p align="center">\n  <a href="https://laowantong.github.io/paroxython/user_manual/index.html#taxonomy">\n  <img src="docs/resources/tree.png" alt="A taxonomy.">\n  </a>\n  <br>\n  <em>Extract of the taxonomy generated from <a href="https://github.com/TheAlgorithms/Python">The Algorithms - Python</a>.<br>Click to jump to its full dynamic version in the user manual.</em>\n</p>\n\nEverything is then persisted in a tag **database**, which can later be filtered through a **pipeline** of commands, for instance:\n\n- _include_ only the programs which feature a recursive function;\n- _exclude_ this or that program you want to set aside for the exam;\n- “_impart_” all programs studied so far, _i.e_, consider that all the notions they implement are acquired.\n\nThe result is a list of program **recommendations** ordered by increasing learning cost.\n\n### Example\n\nSuppose that the `programs` directory contains [these simple programs](https://wiki.python.org/moin/SimplePrograms).\n\nFirst, build [this tag database](https://github.com/laowantong/paroxython/blob/master/examples/simple/programs_db.json):\n\n```shell\n> paroxython collect programs\nLabelling 21 programs.\nMapping taxonomy on 21 programs.\nWriting programs_db.json.\n```\n\nThen, filter it through [this pipeline](https://github.com/laowantong/paroxython/blob/master/examples/simple/programs_pipe.py):\n\n```shell\n> paroxython recommend programs\nProcessing 5 commands on 21 programs.\n  19 programs remaining after operation 1 (impart).\n  18 programs remaining after operation 2 (exclude).\n  12 programs remaining after operation 3 (exclude).\n  10 programs remaining after operation 4 (include).\n  10 programs remaining after operation 5 (hide).\nDumped: programs_recommendations.md.\n```\n\nEt voilà, [your recommendation report](https://github.com/laowantong/paroxython/blob/master/examples/simple/programs_recommendations.md)!\n\n\n## Installation and test-drive\n\n### Command line\n\nMuch to no one\'s surprise:\n\n```\npip install paroxython\n```\n\nThe following command should print a help message and exit:\n\n```\nparoxython --help\n```\n\n### IPython magic command\n\nIf you use Jupyter notebook/lab, you\'ve also just installed a so-called magic command. Load it like this:\n\n```python\n%load_ext paroxython\n```\n\nThis should print `"paroxython 0.6.3 loaded."`. Run it on a cell of Python code:\n\n```python\n%%paroxython                          # Lines\ndef fibonacci(n):                     # 2\n    result = []                       # 3\n    (a, b) = (0, 1)                   # 4\n    while a < n:                      # 5\n        result.append(a)              # 6\n        (a, b) = (b, a + b)           # 7\n    return result                     # 8\n```\n\n| Taxon | Lines |\n|:--|:--|\n| `call/subroutine/method/sequence/list/append` | 6 |\n| `condition/inequality` | 5 |\n| `def/subroutine/function/impure` | 2-8 |\n| `def/subroutine/parameter/arg` | 2 |\n| `flow/loop/exit/late` | 5-7 |\n| `flow/loop/while` | 5-7 |\n| `meta/count/program/sloc/8` | 2-8 |\n| `meta/count/subroutine/sloc/7` | 2-8 |\n| `meta/count/variety/3` | 2-8 |\n| `meta/program` | 2-8 |\n| `operator/arithmetic/addition` | 7 |\n| `style/procedural` | 2-8 |\n| `type/number/integer/literal` | 4 |\n| `type/number/integer/literal/zero` | 4 |\n| `type/sequence/list` | 6 |\n| `type/sequence/list/literal/empty` | 3 |\n| `type/sequence/tuple/literal` | 4, 4, 7, 7 |\n| `var/assignment/explicit/parallel` | 4 |\n| `var/assignment/explicit/parallel/slide` | 7 |\n| `var/assignment/explicit/single` | 3 |\n| `var/assignment/implicit/parameter` | 2 |\n| `var/scope/local` | 2-8, 2-8, 2-8, 2-8 |\n\nAs you can see, in this program, Paroxython identifies among others:\n\n- the use of the [procedural paradigm](https://en.wikipedia.org/wiki/Procedural_programming) (`style/procedural`);\n- an im[pure function](https://en.wikipedia.org/wiki/Pure_function) (`def/subroutine/function/impure`);\n- a `while` loop (`flow/loop/while`) with a late exit (`flow/loop/exit/late`);\n- a little bit of voodoo on lists (`type/sequence/list/literal/empty` and `call/subroutine/method/sequence/list/append`);\n- a simple [tuple assignment](https://en.wikibooks.org/wiki/Python_Programming/Tuples#Packing_and_Unpacking) (`var/assignment/explicit/parallel`). Note that we distinguish between explicit (with `=`) and implicit (parameters and iteration variables) assignments;\n- a “sliding” tuple assignment (`var/assignment/explicit/parallel/slide`). If the denomination is unique to us, the pattern itself occurs in a number of programs: implementations of [C-finite sequences](https://en.wikipedia.org/wiki/Constant-recursive_sequence) with C greater than 1, [Greatest Common Divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor), [Quicksort](https://en.wikipedia.org/wiki/Quicksort), etc.\n- four local variables (`var/scope/local`);\n- an estimation of the variety of concepts involved (`meta/count/variety/***`), depending on the number of lines, features and distinct features.\n\nThe magic command `%%paroxython` (corresponding to the subcommand [`tag`](https://laowantong.github.io/paroxython/cli_tag.html)) only scratches the surface of the system. As shown before, to estimate the learning cost of the features and get actionable recommendations, you will need first to construct the tag database with [`collect`](https://laowantong.github.io/paroxython/cli_collect.html), and then call [`recommend`](https://laowantong.github.io/paroxython/cli_recommend.html) on a pipeline of yours.\n\n# Read them\n\nAlthough this is still a work-in-progress, Paroxython should already be fairly well [documented](https://laowantong.github.io/paroxython/index.html):\n\n- [User manual](https://laowantong.github.io/paroxython/user_manual/index.html):\n  - [write a command pipeline to get recommendations](https://laowantong.github.io/paroxython/user_manual/index.html#pipeline-tutorial),\n  - [prepare your program collections for better results](https://laowantong.github.io/paroxython/user_manual/index#preparing-your-program-collection),\n  - [understand and modify the taxonomic classification](https://laowantong.github.io/paroxython/user_manual/index#taxonomy),\n  - and more.\n- [Developer manual](https://laowantong.github.io/paroxython/developer_manual/index.html):\n  - [get a rough idea of the program structure and operations](https://laowantong.github.io/paroxython/developer_manual/index.html#bird-view),\n  - [use the provided helpers to contribute to the code](helper-programs),\n  - and more.\n- [Module reference](https://laowantong.github.io/paroxython/#header-submodules).\n- [Feature specifications](https://github.com/laowantong/paroxython/blob/master/paroxython/resources/spec.md): a document mixing prose, tests, regular expressions and SQL queries to describe which algorithmic features are recognized and how.\n- [User types](https://github.com/laowantong/paroxython/blob/master/paroxython/user_types.py): all objects of interest are precisely typed and checked by [mypy](http://mypy-lang.org).\n\nFinally, a [battery of examples](https://github.com/laowantong/paroxython/tree/master/examples) and [comprehensive test coverage](https://github.com/laowantong/paroxython/tree/master/tests) should help answer any remaining question.\n',
-    'author': 'Aristide Grange',
-    'author_email': 'None',
-    'maintainer': 'None',
-    'maintainer_email': 'None',
-    'url': 'https://github.com/laowantong/paroxython/',
-    'packages': packages,
-    'package_data': package_data,
-    'install_requires': install_requires,
-    'entry_points': entry_points,
-    'python_requires': '>=3.6.1,<4.0.0',
-}
-
-
-setup(**setup_kwargs)