passagemath-repl 10.4.17__tar.gz → 10.4.19__tar.gz

{passagemath_repl-10.4.17 → passagemath_repl-10.4.19}/MANIFEST.in

@@ -19,6 +19,15 @@ include sage/misc/pager.py
 include sage/misc/cython.py
 include sage/misc/inline_fortran.py
 
+include sage/misc/benchmark.py
+include sage/misc/classgraph.py
+include sage/misc/copying.py
+include sage/misc/gperftools.py
+include sage/misc/messaging.py
+include sage/misc/python.py
+include sage/misc/remote_file.py
+include sage/misc/sh.py
+
 include VERSION.txt
 
 global-exclude all__*.py

{passagemath_repl-10.4.17/passagemath_repl.egg-info → passagemath_repl-10.4.19}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: passagemath-repl
-Version: 10.4.17
+Version: 10.4.19
 Summary: passagemath: IPython kernel, Sage preparser, doctester
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 License: GNU General Public License (GPL) v2 or later
@@ -25,8 +25,8 @@ Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Mathematics
 Requires-Python: <3.13,>=3.9
 Description-Content-Type: text/x-rst
-Requires-Dist: passagemath-objects~=10.4.17
-Requires-Dist: passagemath-environment~=10.4.17
+Requires-Dist: passagemath-objects~=10.4.19
+Requires-Dist: passagemath-environment~=10.4.19
 Requires-Dist: ipykernel>=5.2.1
 Requires-Dist: ipython>=7.13.0
 Requires-Dist: ipywidgets>=7.5.1

passagemath_repl-10.4.19/VERSION.txt

@@ -0,0 +1 @@
+10.4.19

{passagemath_repl-10.4.17 → passagemath_repl-10.4.19}/bin/sage-update-version

@@ -79,6 +79,7 @@ done
 
 # Update Sage version file for Python in SAGE_SRC/sage
 cat <<EOF > "$SAGE_SRC/sage/version.py"
+# sage_setup: distribution = sagemath-environment
 # Sage version information for Python scripts
 # This file is auto-generated by the sage-update-version script, do not edit!
 version = '$SAGE_VERSION'

{passagemath_repl-10.4.17 → passagemath_repl-10.4.19}/bin/sage-version.sh

@@ -4,6 +4,6 @@
 # which stops "setup.py develop" from rewriting it as a Python file.
 :
 # This file is auto-generated by the sage-update-version script, do not edit!
-SAGE_VERSION='10.4.17'
-SAGE_RELEASE_DATE='2024-10-20'
-SAGE_VERSION_BANNER='passagemath version 10.4.17, Release Date: 2024-10-20'
+SAGE_VERSION='10.4.19'
+SAGE_RELEASE_DATE='2024-10-21'
+SAGE_VERSION_BANNER='passagemath version 10.4.19, Release Date: 2024-10-21'

{passagemath_repl-10.4.17 → passagemath_repl-10.4.19}/known-test-failures.json

@@ -1,7 +1,14 @@
 {
+    "sage.doctest.__main__": {
+        "ntests": 9
+    },
+    "sage.doctest.check_tolerance": {
+        "failed": true,
+        "ntests": 19
+    },
     "sage.doctest.control": {
         "failed": true,
-        "ntests": 229
+        "ntests": 228
     },
     "sage.doctest.external": {
         "ntests": 40
@@ -11,11 +18,15 @@
     },
     "sage.doctest.forker": {
         "failed": true,
-        "ntests": 412
+        "ntests": 413
+    },
+    "sage.doctest.marked_output": {
+        "failed": true,
+        "ntests": 21
     },
     "sage.doctest.parsing": {
         "failed": true,
-        "ntests": 308
+        "ntests": 273
     },
     "sage.doctest.reporting": {
         "ntests": 126
@@ -28,8 +39,7 @@
         "ntests": 23
     },
     "sage.doctest.util": {
-        "failed": true,
-        "ntests": 141
+        "ntests": 137
     },
     "sage.misc.sage_eval": {
         "failed": true,
@@ -50,8 +60,7 @@
         "ntests": 24
     },
     "sage.repl.display.formatter": {
-        "failed": true,
-        "ntests": 47
+        "ntests": 46
     },
     "sage.repl.display.jsmol_iframe": {
         "ntests": 24
@@ -63,10 +72,6 @@
     "sage.repl.display.util": {
         "ntests": 6
     },
-    "sage.repl.image": {
-        "failed": true,
-        "ntests": 42
-    },
     "sage.repl.inputhook": {
         "ntests": 7
     },
@@ -111,7 +116,7 @@
     },
     "sage.repl.preparse": {
         "failed": true,
-        "ntests": 347
+        "ntests": 345
     },
     "sage.repl.rich_output.backend_base": {
         "failed": true,

{passagemath_repl-10.4.17 → passagemath_repl-10.4.19/passagemath_repl.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: passagemath-repl
-Version: 10.4.17
+Version: 10.4.19
 Summary: passagemath: IPython kernel, Sage preparser, doctester
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 License: GNU General Public License (GPL) v2 or later
@@ -25,8 +25,8 @@ Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Mathematics
 Requires-Python: <3.13,>=3.9
 Description-Content-Type: text/x-rst
-Requires-Dist: passagemath-objects~=10.4.17
-Requires-Dist: passagemath-environment~=10.4.17
+Requires-Dist: passagemath-objects~=10.4.19
+Requires-Dist: passagemath-environment~=10.4.19
 Requires-Dist: ipykernel>=5.2.1
 Requires-Dist: ipython>=7.13.0
 Requires-Dist: ipywidgets>=7.5.1

{passagemath_repl-10.4.17 → passagemath_repl-10.4.19}/passagemath_repl.egg-info/SOURCES.txt

@@ -81,16 +81,24 @@ sage/doctest/tests/sleep_and_raise.rst
 sage/doctest/tests/tolerance.rst
 sage/misc/all__sagemath_repl.py
 sage/misc/banner.py
+sage/misc/benchmark.py
+sage/misc/classgraph.py
+sage/misc/copying.py
 sage/misc/cython.py
 sage/misc/dev_tools.py
 sage/misc/edit_module.py
 sage/misc/explain_pickle.py
+sage/misc/gperftools.py
 sage/misc/inline_fortran.py
+sage/misc/messaging.py
 sage/misc/pager.py
 sage/misc/profiler.py
+sage/misc/python.py
+sage/misc/remote_file.py
 sage/misc/sage_eval.py
 sage/misc/sage_input.py
 sage/misc/sagedoc.py
+sage/misc/sh.py
 sage/misc/trace.py
 sage/repl/__init__.py
 sage/repl/all.py

{passagemath_repl-10.4.17 → passagemath_repl-10.4.19}/passagemath_repl.egg-info/requires.txt

@@ -1,5 +1,5 @@
-passagemath-objects~=10.4.17
-passagemath-environment~=10.4.17
+passagemath-objects~=10.4.19
+passagemath-environment~=10.4.19
 ipykernel>=5.2.1
 ipython>=7.13.0
 ipywidgets>=7.5.1

{passagemath_repl-10.4.17 → passagemath_repl-10.4.19}/pyproject.toml

@@ -10,8 +10,8 @@ build-backend = "setuptools.build_meta"
 name = "passagemath-repl"
 description = "passagemath: IPython kernel, Sage preparser, doctester"
 dependencies = [
-    'passagemath-objects ~= 10.4.17',
-    'passagemath-environment ~= 10.4.17',
+    'passagemath-objects ~= 10.4.19',
+    'passagemath-environment ~= 10.4.19',
     'ipykernel >=5.2.1',
     'ipython >=7.13.0',
     'ipywidgets >=7.5.1',
@@ -71,6 +71,14 @@ py-modules = [
     "sage.misc.pager",
     "sage.misc.cython",
     "sage.misc.inline_fortran",
+    "sage.misc.benchmark",
+    "sage.misc.classgraph",
+    "sage.misc.copying",
+    "sage.misc.gperftools",
+    "sage.misc.messaging",
+    "sage.misc.python",
+    "sage.misc.remote_file",
+    "sage.misc.sh",
 ]
 packages = [
     "sage.doctest",

{passagemath_repl-10.4.17 → passagemath_repl-10.4.19}/pyproject.toml.m4

@@ -46,6 +46,14 @@ py-modules = [
     "sage.misc.pager",
     "sage.misc.cython",
     "sage.misc.inline_fortran",
+    "sage.misc.benchmark",
+    "sage.misc.classgraph",
+    "sage.misc.copying",
+    "sage.misc.gperftools",
+    "sage.misc.messaging",
+    "sage.misc.python",
+    "sage.misc.remote_file",
+    "sage.misc.sh",
 ]
 packages = [
     "sage.doctest",

{passagemath_repl-10.4.17 → passagemath_repl-10.4.19}/sage/doctest/rif_tol.py

@@ -1,4 +1,5 @@
 # sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.rings.real_interval_field
 """
 Helpers for tolerance checking in doctests
 """

passagemath_repl-10.4.19/sage/misc/benchmark.py

@@ -0,0 +1,220 @@
+# sage_setup: distribution = sagemath-repl
+"Benchmarks"
+
+from sage.misc.misc import cputime
+
+from sage.all import *
+
+
+def benchmark(n=-1):
+    """
+    Run a well-chosen range of Sage commands and record the time it
+    takes for each to run.
+
+    INPUT:
+
+    - ``n`` -- integer (default: -1); the benchmark number; the default
+      of -1 runs all the benchmarks
+
+    OUTPUT:
+
+        list -- summary of timings for each benchmark.
+        int -- if n == -1, also return the total time
+
+    EXAMPLES::
+
+        sage: from sage.misc.benchmark import *
+        sage: _ = benchmark()
+        Running benchmark 0
+        Benchmark 0: Factor the following polynomial over
+            the rational numbers: (x^97+19*x+1)*(x^103-19*x^97+14)*(x^100-1)
+        Time: ... seconds
+        Running benchmark 1
+        Find the Mordell-Weil group of the elliptic curve 5077A using mwrank
+        Time: ... seconds
+        Running benchmark 2
+        Some basic arithmetic with very large Integer numbers: '3^1000001 * 19^100001
+        Time: ... seconds
+        Running benchmark 3
+        Some basic arithmetic with very large Rational numbers: '(2/3)^100001 * (17/19)^100001
+        Time: ... seconds
+        Running benchmark 4
+        Rational polynomial arithmetic using Sage. Compute (x^29+17*x-5)^200.
+        Time: ... seconds
+        Running benchmark 5
+        Rational polynomial arithmetic using Sage. Compute (x^19 - 18*x + 1)^50 one hundred times.
+        Time: ... seconds
+        Running benchmark 6
+        Compute the p-division polynomials of y^2 = x^3 + 37*x - 997 for primes p < 40.
+        Time: ... seconds
+        Running benchmark 7
+        Compute the Mordell-Weil group of y^2 = x^3 + 37*x - 997.
+        Time: ... seconds
+        Running benchmark 8
+    """
+
+    if isinstance(n, list):
+        t = cputime()
+        v = [benchmark(m) for m in n]
+        return v, cputime(t)
+
+    if n != -1:
+        print("Running benchmark {}".format(n))
+        try:
+            desc, t = eval("bench{}()".format(n))
+        except NameError:
+            raise RuntimeError("no benchmark {}".format(n))
+        print(desc)
+        print("Time: {} seconds".format(t))
+        return (n, t, desc)
+
+    t = cputime()
+    m = 0
+    v = []
+    while True:
+        try:
+            v.append(benchmark(m))
+            m += 1
+        except RuntimeError:
+            break
+    return v, cputime(t)
+
+
+def bench0():
+    """
+    Run a benchmark.
+
+    BENCHMARK::
+
+        sage: from sage.misc.benchmark import *
+        sage: print(bench0()[0])
+        Benchmark 0: Factor the following polynomial over
+            the rational numbers: (x^97+19*x+1)*(x^103-19*x^97+14)*(x^100-1)
+    """
+    desc = """Benchmark 0: Factor the following polynomial over
+    the rational numbers: (x^97+19*x+1)*(x^103-19*x^97+14)*(x^100-1)"""
+    x = polygen(QQ, "x")
+    f = (x**97+19*x+1)*(x**103-19*x**97+14)*(x**100-1)
+    t = cputime()
+    F = f.factor()
+    return (desc, cputime(t))
+
+
+def bench1():
+    """
+    Run a benchmark.
+
+    BENCHMARK::
+
+        sage: from sage.misc.benchmark import *
+        sage: print(bench1()[0])
+        Find the Mordell-Weil group of the elliptic curve 5077A using mwrank
+    """
+    desc = """Find the Mordell-Weil group of the elliptic curve 5077A using mwrank"""
+    E = mwrank_EllipticCurve([0, 0, 1, -7, 6])
+    t = cputime()
+    g = E.gens()
+    return (desc, cputime(t))
+
+
+def bench2():
+    """
+    Run a benchmark.
+
+    BENCHMARK::
+
+        sage: from sage.misc.benchmark import *
+        sage: print(bench2()[0])
+        Some basic arithmetic with very large Integer numbers: '3^1000001 * 19^100001
+    """
+    desc = """Some basic arithmetic with very large Integer numbers: '3^1000001 * 19^100001"""
+    t = cputime()
+    a = ZZ(3)**1000001 * ZZ(19)**100001
+    return (desc, cputime(t))
+
+
+def bench3():
+    """
+    Run a benchmark.
+
+    BENCHMARK::
+
+        sage: from sage.misc.benchmark import *
+        sage: print(bench3()[0])
+        Some basic arithmetic with very large Rational numbers: '(2/3)^100001 * (17/19)^100001
+    """
+    desc = """Some basic arithmetic with very large Rational numbers: '(2/3)^100001 * (17/19)^100001"""
+    t = cputime()
+    a = QQ((2, 3))**100001 * QQ((17, 19))**100001
+    return (desc, cputime(t))
+
+
+def bench4():
+    """
+    Run a benchmark.
+
+    BENCHMARK::
+
+        sage: from sage.misc.benchmark import *
+        sage: print(bench4()[0])
+        Rational polynomial arithmetic using Sage. Compute (x^29+17*x-5)^200.
+    """
+    desc = """Rational polynomial arithmetic using Sage. Compute (x^29+17*x-5)^200."""
+    x = PolynomialRing(QQ, 'x').gen()
+    t = cputime()
+    f = x**29 + 17*x-5
+    a = f**200
+    return (desc, cputime(t))
+
+
+def bench5():
+    """
+    Run a benchmark.
+
+    BENCHMARK::
+
+        sage: from sage.misc.benchmark import *
+        sage: print(bench5()[0])
+        Rational polynomial arithmetic using Sage. Compute (x^19 - 18*x + 1)^50 one hundred times.
+    """
+    desc = """Rational polynomial arithmetic using Sage. Compute (x^19 - 18*x + 1)^50 one hundred times."""
+    x = PolynomialRing(QQ, 'x').gen()
+    t = cputime()
+    f = x**19 - 18*x + 1
+    w = [f**50 for _ in range(100)]
+    return (desc, cputime(t))
+
+
+def bench6():
+    """
+    Run a benchmark.
+
+    BENCHMARK::
+
+        sage: from sage.misc.benchmark import *
+        sage: print(bench6()[0])
+        Compute the p-division polynomials of y^2 = x^3 + 37*x - 997 for primes p < 40.
+    """
+    desc = """Compute the p-division polynomials of y^2 = x^3 + 37*x - 997 for primes p < 40."""
+    E = EllipticCurve([0, 0, 0, 37, -997])
+    t = cputime()
+    for p in [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]:
+        f = E.division_polynomial(p)
+    return (desc, cputime(t))
+
+
+def bench7():
+    """
+    Run a benchmark.
+
+    BENCHMARK::
+
+        sage: from sage.misc.benchmark import *
+        sage: print(bench7()[0])
+        Compute the Mordell-Weil group of y^2 = x^3 + 37*x - 997.
+    """
+    desc = """Compute the Mordell-Weil group of y^2 = x^3 + 37*x - 997."""
+    E = EllipticCurve([0, 0, 0, 37, -997])
+    t = cputime()
+    G = E.gens()
+    return (desc, cputime(t))

passagemath_repl-10.4.19/sage/misc/classgraph.py

@@ -0,0 +1,130 @@
+# sage_setup: distribution = sagemath-repl
+r"""
+Class inheritance graphs
+"""
+# ****************************************************************************
+#  Copyright (C) 2007 William Stein <wstein@math.ucsd.edu>
+#                2011 Nicolas M. Thiery <nthiery at users.sf.net>
+#
+#  Distributed under the terms of the GNU General Public License (GPL)
+#                  https://www.gnu.org/licenses/
+# *****************************************************************************
+
+import inspect
+
+
+def class_graph(top, depth=5, name_filter=None, classes=None, as_graph=True):
+    """
+    Return the class inheritance graph of a module, class, or object.
+
+    INPUT:
+
+    - ``top`` -- the module, class, or object to start with (e.g. ``sage``,
+      ``Integer``, ``3``)
+    - ``depth`` -- maximal recursion depth within submodules (default: 5)
+    - ``name_filter`` -- e.g. 'sage.rings' to only consider classes in
+      :mod:`sage.rings`
+    - ``classes`` -- (optional) dictionary to be filled in (it is also returned)
+    - ``as_graph`` -- boolean (default: ``True``)
+
+    OUTPUT:
+
+    An oriented graph, with class names as vertices, and an edge
+    from each class to each of its bases.
+
+    EXAMPLES:
+
+    We construct the inheritance graph of the classes within a given module::
+
+        sage: from sage.rings.polynomial.padics import polynomial_padic_capped_relative_dense, polynomial_padic_flat
+        sage: G = class_graph(sage.rings.polynomial.padics); G
+        Digraph on 6 vertices
+        sage: G.vertices(sort=True)
+        ['Polynomial',
+         'Polynomial_generic_cdv',
+         'Polynomial_generic_dense',
+         'Polynomial_padic',
+         'Polynomial_padic_capped_relative_dense',
+         'Polynomial_padic_flat']
+        sage: G.edges(sort=True, labels=False)
+        [('Polynomial_padic', 'Polynomial'),
+         ('Polynomial_padic_capped_relative_dense', 'Polynomial_generic_cdv'),
+         ('Polynomial_padic_capped_relative_dense', 'Polynomial_padic'),
+         ('Polynomial_padic_flat', 'Polynomial_generic_dense'),
+         ('Polynomial_padic_flat', 'Polynomial_padic')]
+
+    We construct the inheritance graph of a given class::
+
+        sage: class_graph(Parent).edges(sort=True, labels=False)
+        [('CategoryObject', 'SageObject'), ('Parent', 'CategoryObject'), ('SageObject', 'object')]
+
+    We construct the inheritance graph of the class of an object::
+
+        sage: class_graph([1,2,3]).edges(sort=True, labels=False)
+        [('list', 'object')]
+
+    .. warning:: the output of ``class_graph`` used to be a dictionary
+       mapping each class name to the list of names of its bases. This
+       can be emulated by setting the option ``as_graph`` to ``False``::
+
+        sage: class_graph(sage.rings.polynomial.padics, depth=2, as_graph=False)
+        {'Polynomial_padic': ['Polynomial'],
+         'Polynomial_padic_capped_relative_dense': ['Polynomial_generic_cdv',
+          'Polynomial_padic'],
+         'Polynomial_padic_flat': ['Polynomial_generic_dense', 'Polynomial_padic']}
+
+    .. NOTE:: the ``classes`` and ``as_graph`` options are mostly
+       intended for internal recursive use.
+
+    .. NOTE:: ``class_graph`` does not yet handle nested classes
+
+    TESTS::
+
+        sage: G = class_graph(sage.rings.polynomial.padics, depth=2); G
+        Digraph on 6 vertices
+    """
+    # This function descends recursively down the submodules of the
+    # top module (if ``top`` is a module) and then down the hierarchy
+    # of classes. Along the way, the result is stored in the "global"
+    # dictionary ``classes`` which associates to each class the list
+    # of its bases.
+
+    # Termination
+    if depth < 0:
+        return classes
+
+    # (first recursive call)
+    if classes is None:
+        classes = {}
+
+    # Build the list ``children`` of submodules (resp. base classes)
+    # of ``top`` the function will recurse through
+    if inspect.ismodule(top):
+        if top.__name__.endswith('.all'):  # Ignore sage.rings.all and friends
+            return classes
+        if name_filter is None:
+            name_filter = top.__name__
+        children = [item for item in top.__dict__.values()
+                    if inspect.ismodule(item) or inspect.isclass(item)]
+        depth -= 1
+    elif inspect.isclass(top):
+        if name_filter is None:
+            name_filter = ""
+        if not top.__module__.startswith(name_filter):
+            return classes
+        children = top.__bases__
+        classes[top.__name__] = [e.__name__ for e in children]
+    else:  # top is a plain Python object; inspect its class
+        children = [top.__class__]
+
+    # Recurse
+    for child in children:
+        class_graph(child, depth=depth, name_filter=name_filter,
+                    classes=classes, as_graph=False)
+
+    # (first recursive call): construct the graph
+    if as_graph:
+        from sage.graphs.digraph import DiGraph
+        return DiGraph(classes)
+    else:
+        return classes

passagemath_repl-10.4.19/sage/misc/copying.py

@@ -0,0 +1,22 @@
+# sage_setup: distribution = sagemath-repl
+"License"
+
+import os
+from sage.misc import pager
+
+from sage.env import SAGE_ROOT
+
+
+class License:
+    def __call__(self):
+        pager.pager()(str(self))
+
+    def __repr__(self):
+        return "Type license() to see the full license text."
+
+    def __str__(self):
+        with open(os.path.join(SAGE_ROOT, 'COPYING.txt')) as f:
+            return f.read()
+
+
+license = License()