passagemath-standard-no-symbolics 10.6.4__cp313-cp313-macosx_14_0_arm64.whl → 10.6.6__cp313-cp313-macosx_14_0_arm64.whl

{passagemath_standard_no_symbolics-10.6.4.dist-info → passagemath_standard_no_symbolics-10.6.6.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-standard-no-symbolics
-Version: 10.6.4
+Version: 10.6.6
 Summary: passagemath: Sage library without the symbolics subsystem
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -29,42 +29,42 @@ Classifier: Topic :: Scientific/Engineering :: Mathematics
 Requires-Python: <3.14,>=3.10
 Description-Content-Type: text/x-rst
 Requires-Dist: six>=1.15.0
-Requires-Dist: passagemath-brial~=10.6.4.0
-Requires-Dist: passagemath-categories~=10.6.4.0
-Requires-Dist: passagemath-cddlib~=10.6.4.0
-Requires-Dist: passagemath-combinat~=10.6.4.0
-Requires-Dist: passagemath-eclib~=10.6.4.0
-Requires-Dist: passagemath-environment~=10.6.4.0
-Requires-Dist: passagemath-flint~=10.6.4.0
-Requires-Dist: passagemath-gap~=10.6.4.0
-Requires-Dist: passagemath-gap-pkg-transgrp-data~=10.6.4.0
-Requires-Dist: passagemath-gap-pkg-ctbllib-data~=10.6.4.0
-Requires-Dist: passagemath-gap-pkg-tomlib-data~=10.6.4.0
-Requires-Dist: passagemath-gap-pkg-irredsol-data~=10.6.4.0
-Requires-Dist: passagemath-giac~=10.6.4.0
-Requires-Dist: passagemath-glpk~=10.6.4.0
-Requires-Dist: passagemath-graphs~=10.6.4.0
-Requires-Dist: passagemath-groups~=10.6.4.0
-Requires-Dist: passagemath-homfly~=10.6.4.0
-Requires-Dist: passagemath-lcalc~=10.6.4.0
-Requires-Dist: passagemath-libbraiding~=10.6.4.0
-Requires-Dist: passagemath-libecm~=10.6.4.0
-Requires-Dist: passagemath-linbox~=10.6.4.0
-Requires-Dist: passagemath-modules~=10.6.4.0
-Requires-Dist: passagemath-nauty~=10.6.4.0
-Requires-Dist: passagemath-ntl~=10.6.4.0
-Requires-Dist: passagemath-objects~=10.6.4.0
-Requires-Dist: passagemath-palp~=10.6.4.0
-Requires-Dist: passagemath-pari~=10.6.4.0
-Requires-Dist: passagemath-pari-galdata~=10.6.4.0
-Requires-Dist: passagemath-pari-seadata-small~=10.6.4.0
-Requires-Dist: passagemath-planarity~=10.6.4.0
-Requires-Dist: passagemath-plot~=10.6.4.0
-Requires-Dist: passagemath-polyhedra~=10.6.4.0
-Requires-Dist: passagemath-repl~=10.6.4.0
-Requires-Dist: passagemath-schemes~=10.6.4.0
-Requires-Dist: passagemath-singular~=10.6.4.0
-Requires-Dist: passagemath-tachyon~=10.6.4.0
+Requires-Dist: passagemath-brial~=10.6.6.0
+Requires-Dist: passagemath-categories~=10.6.6.0
+Requires-Dist: passagemath-cddlib~=10.6.6.0
+Requires-Dist: passagemath-combinat~=10.6.6.0
+Requires-Dist: passagemath-eclib~=10.6.6.0
+Requires-Dist: passagemath-environment~=10.6.6.0
+Requires-Dist: passagemath-flint~=10.6.6.0
+Requires-Dist: passagemath-gap~=10.6.6.0
+Requires-Dist: passagemath-gap-pkg-transgrp-data~=10.6.6.0
+Requires-Dist: passagemath-gap-pkg-ctbllib-data~=10.6.6.0
+Requires-Dist: passagemath-gap-pkg-tomlib-data~=10.6.6.0
+Requires-Dist: passagemath-gap-pkg-irredsol-data~=10.6.6.0
+Requires-Dist: passagemath-giac~=10.6.6.0
+Requires-Dist: passagemath-glpk~=10.6.6.0
+Requires-Dist: passagemath-graphs~=10.6.6.0
+Requires-Dist: passagemath-groups~=10.6.6.0
+Requires-Dist: passagemath-homfly~=10.6.6.0
+Requires-Dist: passagemath-lcalc~=10.6.6.0
+Requires-Dist: passagemath-libbraiding~=10.6.6.0
+Requires-Dist: passagemath-libecm~=10.6.6.0
+Requires-Dist: passagemath-linbox~=10.6.6.0
+Requires-Dist: passagemath-modules~=10.6.6.0
+Requires-Dist: passagemath-nauty~=10.6.6.0
+Requires-Dist: passagemath-ntl~=10.6.6.0
+Requires-Dist: passagemath-objects~=10.6.6.0
+Requires-Dist: passagemath-palp~=10.6.6.0
+Requires-Dist: passagemath-pari~=10.6.6.0
+Requires-Dist: passagemath-pari-galdata~=10.6.6.0
+Requires-Dist: passagemath-pari-seadata-small~=10.6.6.0
+Requires-Dist: passagemath-planarity~=10.6.6.0
+Requires-Dist: passagemath-plot~=10.6.6.0
+Requires-Dist: passagemath-polyhedra~=10.6.6.0
+Requires-Dist: passagemath-repl~=10.6.6.0
+Requires-Dist: passagemath-schemes~=10.6.6.0
+Requires-Dist: passagemath-singular~=10.6.6.0
+Requires-Dist: passagemath-tachyon~=10.6.6.0
 Requires-Dist: cysignals<1.12.4; sys_platform == "win32"
 Requires-Dist: cysignals!=1.12.0,>=1.11.2
 Requires-Dist: cython!=3.0.3,<4.0,>=3.0

{passagemath_standard_no_symbolics-10.6.4.dist-info → passagemath_standard_no_symbolics-10.6.6.dist-info}/RECORD

@@ -1,21 +1,16 @@
-passagemath_standard_no_symbolics-10.6.4.dist-info/RECORD,,
-passagemath_standard_no_symbolics-10.6.4.dist-info/WHEEL,sha256=ZQJAUvKl3_G657Vy_VrVH7Krx2Keg1PVu64bdERsotU,136
-passagemath_standard_no_symbolics-10.6.4.dist-info/top_level.txt,sha256=hibFyzQHiLOMK68qL1OWsNKaXOmSXqZjeLTBem6Yy7I,5
-passagemath_standard_no_symbolics-10.6.4.dist-info/METADATA,sha256=qkMr9v_JEduBB0ebWOC1-pqqUWA3Ll1KlX9AsoWh4U4,7098
-passagemath_standard_no_symbolics-10.6.4.data/scripts/sage-grep,sha256=y7No1LTYggkkven17dnoZKnBiZm8TO6iw8KEJkJSRmg,119
-passagemath_standard_no_symbolics-10.6.4.data/scripts/sage-list-packages,sha256=4vwXzr1iKz2NPJwlfd7j0uBExqkxkSyhyyIqPtqVFFM,3650
-passagemath_standard_no_symbolics-10.6.4.data/scripts/sage-grepdoc,sha256=R855yu3m539GvfdhptwsDG3Dgwb8wvHBJQDhBIrv4jA,70
+passagemath_standard_no_symbolics-10.6.6.data/scripts/sage-grep,sha256=y7No1LTYggkkven17dnoZKnBiZm8TO6iw8KEJkJSRmg,119
+passagemath_standard_no_symbolics-10.6.6.data/scripts/sage-list-packages,sha256=4vwXzr1iKz2NPJwlfd7j0uBExqkxkSyhyyIqPtqVFFM,3650
+passagemath_standard_no_symbolics-10.6.6.data/scripts/sage-grepdoc,sha256=R855yu3m539GvfdhptwsDG3Dgwb8wvHBJQDhBIrv4jA,70
+passagemath_standard_no_symbolics-10.6.6.dist-info/RECORD,,
+passagemath_standard_no_symbolics-10.6.6.dist-info/WHEEL,sha256=ZQJAUvKl3_G657Vy_VrVH7Krx2Keg1PVu64bdERsotU,136
+passagemath_standard_no_symbolics-10.6.6.dist-info/top_level.txt,sha256=hibFyzQHiLOMK68qL1OWsNKaXOmSXqZjeLTBem6Yy7I,5
+passagemath_standard_no_symbolics-10.6.6.dist-info/METADATA,sha256=DIhjRmVeuEQgGnhJ8E_HhdTgDQJ0wDzCl2jB1ar12TE,7098
 sage/all_cmdline.py,sha256=CJOAQpBYbSivmPwuVeWH-9G1tPpRuckNlEV7VXOTb7c,1252
 sage/all.py,sha256=_7HnXjnSwDO3HYTZIpkw5-Jpmp45IzzpIoWwAQXXu7Q,6297
 sage/misc/lazy_attribute.pyi,sha256=lEUbITjqow28vc89Nov-k82LDLrYH6D2Q86kiYbBCJ4,425
 sage/misc/all.py,sha256=oIpAlwSBebAtKQxqIcrdHSu97Ea56FIH7CdrzwUBN7g,1372
 sage/databases/cubic_hecke_db.py,sha256=r5L5BdjpoxcnkdtpdCLhj9XfdiU4jZNZnjzqYph_qaE,63703
-sage/databases/db_class_polynomials.py,sha256=PDN4sYjqTUJQJ-ycVBuz8CS6gFTKmKyACMvepuGBfuU,4227
-sage/databases/all.py,sha256=L0rd_zJydUvj8sQrgUQ5FFjF2o3owxd2SQLOWd-AVl0,2268
-sage/databases/odlyzko.py,sha256=T141r1wjJiXsUVYlP-4EybiKLbGTKYxXKKO7vShaA0Y,1840
-sage/databases/cunningham_tables.py,sha256=8Iebzrjx-SXJTBSQcGLvau-hVcuI5Vei7ZfkFeI_5cw,1641
-sage/databases/symbolic_data.py,sha256=QBl9SCFU9gH_ZVLxTZUqcWTbYQLkGBkhS11ZUaIct6s,8703
-sage/databases/jones.py,sha256=0rGati6Pse-KWJc-Mki-ZfoSrUFURdAQqTRz_IQqlpU,10960
+sage/databases/all.py,sha256=MWbEniaWJkw2HGqLu4ruypvPQ10gVWtI8ViogmucJTs,2244
 sage/dynamics/surface_dynamics_deprecation.py,sha256=Dxxnecz3JvFvJkehFqM-TuheZtTTWm1tvW7Ac4D68AA,1749
 sage/dynamics/all.py,sha256=tZTKTXcMirX--xGRQgw4y5j4BA0vd_xPmcDg79_OsQs,854
 sage/ext_data/nodoctest,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
@@ -34,7 +29,7 @@ sage/ext_data/valgrind/sage-additional.supp,sha256=mE2SwaNJmAHDCu4COIF3LusW9RbWD
 sage/ext_data/valgrind/valgrind-python.supp,sha256=ZbOFK7o8_1OSbIChO7nknWmTriikUgM05EHHZbX63Zs,8132
 sage/ext_data/valgrind/pyalloc.supp,sha256=_lVt4GPAW-A2b7jXp2v_OwJzYofKcieW6HNY-ixNsoA,1126
 sage/ext_data/valgrind/sage.supp,sha256=bcM0vUlyAPBVVV1KiEv9oWTGLxgEeLjtA9Ic1vNJ0kQ,820
-sage/interacts/library_cython.cpython-313-darwin.so,sha256=XXt2yVVQosJ-jbKc_eufeMzgYyouqlDcB2AbYuIMnEs,77736
+sage/interacts/library_cython.cpython-313-darwin.so,sha256=W_c9Ow7VKgkk1gWSSYDC6N4Xr5nfN1MXXPgnNjW96_M,77736
 sage/interacts/library.py,sha256=IpuLIpwoxJaEgfWicBgSOlAsmRz-oTxE9rbY4S5dT-8,78244
 sage/interacts/algebra.py,sha256=B7fB9VbvwVLltBke12simyvB_AV6vGFiThg_fO8VAnE,686
 sage/interacts/all.py,sha256=qoGaOfIpY0vwd0qxsYdsE-KytQrn0wM1TirJSwxCWJs,913

sage/databases/all.py

@@ -51,18 +51,13 @@ from sage.databases.all__sagemath_combinat import *
 from sage.databases.all__sagemath_graphs import *
 from sage.databases.all__sagemath_pari import *
 from sage.databases.all__sagemath_schemes import *
+from sage.databases.all__sagemath_database_cunningham import *
+from sage.databases.all__sagemath_database_kohel import *
+from sage.databases.all__sagemath_database_jones_numfield import *
+from sage.databases.all__sagemath_database_symbolic_data import *
 
 from sage.misc.lazy_import import lazy_import
 
-lazy_import('sage.databases.jones', 'JonesDatabase')
-
-lazy_import('sage.databases.symbolic_data', 'SymbolicData')
-
 lazy_import('sage.databases.odlyzko', 'zeta_zeros')
 
-from sage.databases.db_class_polynomials import \
-    HilbertClassPolynomialDatabase
-
-lazy_import('sage.databases.cunningham_tables', 'cunningham_prime_factors')
-
 del lazy_import

sage/databases/cunningham_tables.py

@@ -1,53 +0,0 @@
-r"""
-Cunningham tables
-
-This module provides :func:`cunningham_prime_factors`, which lists the prime
-numbers occurring in the factorization of numbers of type `b^n+1` or `b^n-1`
-with `b \in \{2,3,5,6,7,10,11,12\}`. For an introduction to Cunningham prime
-factors, see :wikipedia:`Cunningham_Project`. The data becomes available if you
-install the optional :ref:`cunningham_tables <spkg_cunningham_tables>` package by
-the command ::
-
-    sage -i cunningham_tables
-
-AUTHORS:
-
-- Yann Laigle-Chapuy (2009-10-18): initial version
-"""
-
-import os
-from sage.misc.cachefunc import cached_function
-from sage.rings.integer import Integer
-from sage.misc.persist import load
-from sage.env import SAGE_SHARE
-
-
-@cached_function
-def cunningham_prime_factors():
-    r"""
-    List of all the prime numbers occurring in the so called Cunningham table.
-
-    They occur in the factorization of numbers of type `b^n+1` or `b^n-1` with `b \in \{2,3,5,6,7,10,11,12\}`.
-
-    EXAMPLES::
-
-        sage: # optional - cunningham_tables
-        sage: from sage.databases.cunningham_tables import cunningham_prime_factors
-        sage: cunningham_prime_factors()
-        [2,
-         3,
-         5,
-         7,
-         11,
-         13,
-         17,
-         ...
-    """
-    file = os.path.join(SAGE_SHARE,'cunningham_tables','cunningham_prime_factors.sobj')
-    if os.path.exists(file):
-        return [Integer(_) for _ in load(file)]
-    else:
-        from warnings import warn
-        warn("You might consider installing the optional package for factoring Cunningham numbers"
-             " with the following command: ``sage -i cunningham_tables``")
-        return []

sage/databases/db_class_polynomials.py

@@ -1,135 +0,0 @@
-"""
-Database of Hilbert polynomials
-
-This module gives access to the database of Hilbert class polynomials. To use
-the database, you need to install the optional :ref:`database_kohel
-<spkg_database_kohel>` package by the Sage command ::
-
-    sage -i database_kohel
-
-EXAMPLES::
-
-    sage: # optional - database_kohel
-    sage: db = HilbertClassPolynomialDatabase()
-    sage: db[32]
-    x^2 - 52250000*x + 12167000000
-
-AUTHORS:
-
-- David Kohel (2006-08-04): initial version
-"""
-# ****************************************************************************
-#       Copyright (C) 2006 David Kohel <kohel@maths.usyd.edu.au>
-#       Copyright (C) 2016 Vincent Delecroix <vincent.delecroix@labri.fr>
-#
-#  Distributed under the terms of the GNU General Public License (GPL)
-#  as published by the Free Software Foundation; either version 2 of
-#  the License, or (at your option) any later version.
-#                  https://www.gnu.org/licenses/
-# ****************************************************************************
-
-from .db_modular_polynomials import _dbz_to_integers
-
-disc_format = "%07d"   # disc_length = 7
-level_format = "%03d"  # level_length = 3
-
-
-class ClassPolynomialDatabase:
-    def _dbpath(self, disc, level=1):
-        """
-        TESTS::
-
-            sage: db = HilbertClassPolynomialDatabase()
-            sage: db._dbpath(5, 1)
-            'PolHeeg/Cls/0000001-0005000/pol.0000005.dbz'
-            sage: db._dbpath(15000, 1)
-            'PolHeeg/Cls/0010001-0015000/pol.0015000.dbz'
-            sage: db._dbpath(3, 2)
-            Traceback (most recent call last):
-            ...
-            NotImplementedError: Level (= 2) > 1 not yet implemented
-        """
-        if level != 1:
-            raise NotImplementedError("Level (= %s) > 1 not yet implemented" % level)
-        n1 = 5000*((abs(disc)-1)//5000)
-        s1 = disc_format % (n1+1)  # _pad_int(n1+1, disc_length)
-        s2 = disc_format % (n1+5000)
-        subdir = "%s-%s" % (s1, s2)
-        discstr = disc_format % abs(disc)
-        return "PolHeeg/%s/%s/pol.%s.dbz" % (self.model, subdir, discstr)
-
-    def __getitem__(self, disc):
-        r"""
-        TESTS::
-
-            sage: # optional - database_kohel
-            sage: db = HilbertClassPolynomialDatabase()
-            sage: db[32]
-            x^2 - 52250000*x + 12167000000
-            sage: db[123913912]
-            Traceback (most recent call last):
-            ...
-            ValueError: file not found in the Kohel database
-        """
-        from sage.rings.integer_ring import ZZ
-        from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
-        classpol = self._dbpath(disc)
-        coeff_list = _dbz_to_integers(classpol)
-        return PolynomialRing(ZZ, 'x')(coeff_list)
-
-
-class HilbertClassPolynomialDatabase(ClassPolynomialDatabase):
-    """
-    The database of Hilbert class polynomials.
-
-    EXAMPLES::
-
-        sage: # optional - database_kohel
-        sage: db = HilbertClassPolynomialDatabase()
-        sage: db[-4]
-        x - 1728
-        sage: db[-7]
-        x + 3375
-        sage: f = db[-23]; f
-        x^3 + 3491750*x^2 - 5151296875*x + 12771880859375
-        sage: f.discriminant().factor()
-        -1 * 5^18 * 7^12 * 11^4 * 17^2 * 19^2 * 23
-        sage: db[-23]
-        x^3 + 3491750*x^2 - 5151296875*x + 12771880859375
-    """
-    model = "Cls"
-
-    def __repr__(self):
-        return "Hilbert class polynomial database"
-
-######################################################
-# None of the following are implemented yet.
-######################################################
-
-
-class AtkinClassPolynomialDatabase(ClassPolynomialDatabase):
-    """
-    The database of Atkin class polynomials.
-    """
-    model = "Atk"
-
-    def __repr__(self):
-        return "Atkin class polynomial database"
-
-
-class WeberClassPolynomialDatabase(ClassPolynomialDatabase):
-    """
-    The database of Weber class polynomials.
-    """
-    def __repr__(self):
-        return "Weber class polynomial database"
-
-
-class DedekindEtaClassPolynomialDatabase(ClassPolynomialDatabase):
-    """
-    The database of Dedekind eta class polynomials.
-    """
-    model = "Eta"
-
-    def __repr__(self):
-        return "Dedekind eta class polynomial database"

sage/databases/jones.py

@@ -1,281 +0,0 @@
-r"""
-John Jones's tables of number fields
-
-In order to use the Jones database, the optional :ref:`database_jones_numfield
-<spkg_database_jones_numfield>` package must be installed using the Sage command ::
-
-    sage -i database_jones_numfield
-
-This is a table of number fields with bounded ramification and
-degree `\leq 6`. You can query the database for all number
-fields in Jones's tables with bounded ramification and degree.
-
-EXAMPLES: First load the database::
-
-    sage: J = JonesDatabase()
-    sage: J
-    John Jones's table of number fields with bounded ramification and degree <= 6
-
-List the degree and discriminant of all fields in the database that
-have ramification at most at 2::
-
-    sage: [(k.degree(), k.disc()) for k in J.unramified_outside([2])]    # optional - database_jones_numfield
-    [(1, 1), (2, -4), (2, -8), (2, 8), (4, 256), (4, 512), (4, -1024), (4, -2048), (4, 2048), (4, 2048), (4, 2048)]
-
-List the discriminants of the fields of degree exactly 2 unramified
-outside 2::
-
-    sage: [k.disc() for k in J.unramified_outside([2],2)]                # optional - database_jones_numfield
-    [-4, -8, 8]
-
-List the discriminants of cubic field in the database ramified
-exactly at 3 and 5::
-
-    sage: [k.disc() for k in J.ramified_at([3,5],3)]                     # optional - database_jones_numfield
-    [-135, -675, -6075, -6075]
-    sage: factor(6075)
-    3^5 * 5^2
-    sage: factor(675)
-    3^3 * 5^2
-    sage: factor(135)
-    3^3 * 5
-
-List all fields in the database ramified at 101::
-
-    sage: J.ramified_at(101)                                             # optional - database_jones_numfield
-    [Number Field in a with defining polynomial x^2 - 101,
-     Number Field in a with defining polynomial x^4 - x^3 + 13*x^2 - 19*x + 361,
-     Number Field in a with defining polynomial x^5 + x^4 - 6*x^3 - x^2 + 18*x + 4,
-     Number Field in a with defining polynomial x^5 + 2*x^4 + 7*x^3 + 4*x^2 + 11*x - 6,
-     Number Field in a with defining polynomial x^5 - x^4 - 40*x^3 - 93*x^2 - 21*x + 17]
-"""
-
-# ****************************************************************************
-#       Sage: Open Source Mathematical Software
-#
-#       Copyright (C) 2005 William Stein <wstein@gmail.com>
-#
-#  Distributed under the terms of the GNU General Public License (GPL)
-#
-#    This code is distributed in the hope that it will be useful,
-#    but WITHOUT ANY WARRANTY; without even the implied warranty of
-#    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-#    General Public License for more details.
-#
-#  The full text of the GPL is available at:
-#
-#                  https://www.gnu.org/licenses/
-# ****************************************************************************
-
-import os
-
-from sage.rings.number_field.number_field import NumberField
-from sage.rings.rational_field import RationalField
-from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
-from sage.combinat.subset import powerset
-from sage.env import SAGE_SHARE
-
-from sage.misc.persist import load, save
-
-from sage.features.databases import DatabaseJones
-
-
-def sortkey(K):
-    """
-    A completely deterministic sorting key for number fields.
-
-    EXAMPLES::
-
-        sage: from sage.databases.jones import sortkey
-        sage: sortkey(QuadraticField(-3))
-        (2, 3, False, x^2 + 3)
-    """
-    return K.degree(), abs(K.discriminant()), K.discriminant() > 0, K.polynomial()
-
-
-class JonesDatabase:
-    def __init__(self):
-        self.root = None
-
-    def __repr__(self):
-        return "John Jones's table of number fields with bounded ramification and degree <= 6"
-
-    def _load(self, path, filename):
-        print(filename)
-        i = 0
-        while filename[i].isalpha():
-            i += 1
-        j = len(filename) - 1
-        while filename[j].isalpha() or filename[j] in [".", "_"]:
-            j -= 1
-        S = sorted([eval(z) for z in filename[i:j + 1].split("-")])
-        with open(path + "/" + filename) as f:
-            data = f.read()
-        data = data.replace("^", "**")
-        x = PolynomialRing(RationalField(), 'x').gen()  # used next line
-        v = eval(data)
-        s = tuple(S)
-        if s in self.root:
-            self.root[s] += v
-            self.root[s].sort()
-        else:
-            self.root[s] = v
-
-    def _init(self, path):
-        """
-        Create the database from scratch from the PARI files on John Jones's
-        web page, downloaded (e.g., via wget) to a local directory, which
-        is specified as path above.
-
-        INPUT:
-
-        - ``path`` -- (default: works on William Stein install)
-          path must be the path to Jones's Number_Fields directory
-          (http://hobbes.la.asu.edu/Number_Fields); these files should have
-          been downloaded using wget
-
-        EXAMPLES: This is how to create the database from scratch, assuming
-        that the number fields are in the default directory above: From a
-        cold start of Sage::
-
-                sage: J = JonesDatabase()
-                sage: J._init()   # not tested
-                ...
-
-        This takes about 5 seconds.
-        """
-        x = PolynomialRing(RationalField(), 'x').gen()
-        self.root = {}
-        self.root[tuple()] = [x - 1]
-        if not os.path.exists(path):
-            raise OSError("Path %s does not exist." % path)
-        for X in os.listdir(path):
-            if X[-4:] == "solo":
-                Z = path + "/" + X
-                print(X)
-                for Y in os.listdir(Z):
-                    if Y[-3:] == ".gp":
-                        self._load(Z, Y)
-
-        data_dir = os.path.dirname(DatabaseJones().absolute_filename())
-        os.makedirs(data_dir, exist_ok=True)
-        save(self.root, os.path.join(data_dir, "jones.sobj"))
-
-    def unramified_outside(self, S, d=None, var='a'):
-        """
-        Return all fields in the database of degree d unramified
-        outside S. If d is omitted, return fields of any degree up to 6.
-        The fields are ordered by degree and discriminant.
-
-        INPUT:
-
-        - ``S`` -- list or set of primes, or a single prime
-
-        - ``d`` -- ``None`` (default, in which case all fields of degree <= 6 are returned)
-          or a positive integer giving the degree of the number fields returned
-
-        - ``var`` -- the name used for the generator of the number fields (default: ``'a'``)
-
-        EXAMPLES::
-
-            sage: J = JonesDatabase()             # optional - database_jones_numfield
-            sage: J.unramified_outside([101,109]) # optional - database_jones_numfield
-            [Number Field in a with defining polynomial x - 1,
-             Number Field in a with defining polynomial x^2 - 101,
-             Number Field in a with defining polynomial x^2 - 109,
-             Number Field in a with defining polynomial x^3 - x^2 - 36*x + 4,
-             Number Field in a with defining polynomial x^4 - x^3 + 13*x^2 - 19*x + 361,
-             Number Field in a with defining polynomial x^4 - x^3 + 14*x^2 + 34*x + 393,
-             Number Field in a with defining polynomial x^5 + x^4 - 6*x^3 - x^2 + 18*x + 4,
-             Number Field in a with defining polynomial x^5 + 2*x^4 + 7*x^3 + 4*x^2 + 11*x - 6,
-             Number Field in a with defining polynomial x^5 - x^4 - 40*x^3 - 93*x^2 - 21*x + 17]
-        """
-        try:
-            S = list(S)
-        except TypeError:
-            S = [S]
-        Z = []
-        for X in powerset(S):
-            Z += self.ramified_at(X, d=d, var=var)
-        return sorted(Z, key=sortkey)
-
-    def __getitem__(self, S):
-        return self.get(S)
-
-    def get(self, S, var='a'):
-        """
-        Return all fields in the database ramified exactly at
-        the primes in S.
-
-        INPUT:
-
-        - ``S`` -- list or set of primes, or a single prime
-
-        - ``var`` -- the name used for the generator of the number fields (default: ``'a'``)
-
-        EXAMPLES::
-
-            sage: J = JonesDatabase()              # optional - database_jones_numfield
-            sage: J.get(163, var='z')              # optional - database_jones_numfield
-            [Number Field in z with defining polynomial x^2 + 163,
-             Number Field in z with defining polynomial x^3 - x^2 - 54*x + 169,
-             Number Field in z with defining polynomial x^4 - x^3 - 7*x^2 + 2*x + 9]
-            sage: J.get([3, 4])                    # optional - database_jones_numfield
-            Traceback (most recent call last):
-            ...
-            ValueError: S must be a list of primes
-        """
-        if self.root is None:
-            self.root = load(DatabaseJones().absolute_filename())
-        try:
-            S = list(S)
-        except TypeError:
-            S = [S]
-        if not all(p.is_prime() for p in S):
-            raise ValueError("S must be a list of primes")
-        S.sort()
-        s = tuple(S)
-        if s not in self.root:
-            return []
-        return [NumberField(f, var, check=False) for f in self.root[s]]
-
-    def ramified_at(self, S, d=None, var='a'):
-        """
-        Return all fields in the database of degree d ramified exactly at
-        the primes in S.  The fields are ordered by degree and discriminant.
-
-        INPUT:
-
-        - ``S`` -- list or set of primes
-
-        - ``d`` -- ``None`` (default, in which case all fields of degree <= 6 are returned)
-          or a positive integer giving the degree of the number fields returned
-
-        - ``var`` -- the name used for the generator of the number fields (default: ``'a'``)
-
-        EXAMPLES::
-
-            sage: # optional - database_jones_numfield
-            sage: J = JonesDatabase()
-            sage: J.ramified_at([101,109])
-            []
-            sage: J.ramified_at([109])
-            [Number Field in a with defining polynomial x^2 - 109,
-             Number Field in a with defining polynomial x^3 - x^2 - 36*x + 4,
-             Number Field in a with defining polynomial x^4 - x^3 + 14*x^2 + 34*x + 393]
-            sage: J.ramified_at(101)
-            [Number Field in a with defining polynomial x^2 - 101,
-             Number Field in a with defining polynomial x^4 - x^3 + 13*x^2 - 19*x + 361,
-             Number Field in a with defining polynomial x^5 + x^4 - 6*x^3 - x^2 + 18*x + 4,
-             Number Field in a with defining polynomial x^5 + 2*x^4 + 7*x^3 + 4*x^2 + 11*x - 6,
-             Number Field in a with defining polynomial x^5 - x^4 - 40*x^3 - 93*x^2 - 21*x + 17]
-            sage: J.ramified_at((2, 5, 29), 3, 'c')
-            [Number Field in c with defining polynomial x^3 - x^2 - 8*x - 28,
-             Number Field in c with defining polynomial x^3 - x^2 + 10*x + 102,
-             Number Field in c with defining polynomial x^3 - x^2 - 48*x - 188,
-             Number Field in c with defining polynomial x^3 - x^2 + 97*x - 333]
-        """
-        Z = self.get(S, var=var)
-        if d is not None:
-            Z = [k for k in Z if k.degree() == d]
-        return sorted(Z, key=sortkey)

sage/databases/odlyzko.py

@@ -1,59 +0,0 @@
-"""
-Database of the zeros of the Riemann zeta function
-
-The main access function to the database of the zeros of the Riemann zeta
-function is :func:`zeta_zeros`. In order to use ``zeta_zeros()``, you need to
-install the optional :ref:`database_odlyzko_zeta <spkg_database_odlyzko_zeta>`
-package::
-
-    sage -i database_odlyzko_zeta
-
-AUTHORS:
-
-- William Stein: initial version
-- Jeroen Demeyer (2015-01-20): converted ``database_odlyzko_zeta`` to new-style
-  package
-"""
-
-# ****************************************************************************
-#       Copyright (C) 2004 William Stein <wstein@gmail.com>
-#       Copyright (C) 2015 Jeroen Demeyer <jdemeyer@cage.ugent.be>
-#
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 2 of the License, or
-# (at your option) any later version.
-#                  https://www.gnu.org/licenses/
-# ****************************************************************************
-
-import os
-
-from sage.misc.persist import load
-from sage.env import SAGE_SHARE
-
-
-def zeta_zeros():
-    r"""
-    List of the imaginary parts of the first 2,001,052 zeros of the
-    Riemann zeta function, accurate to within 4e-9.
-
-    REFERENCES:
-
-    - http://www.dtc.umn.edu/~odlyzko/zeta_tables/index.html
-
-    EXAMPLES:
-
-    The following example shows the imaginary part of the 13th
-    nontrivial zero of the Riemann zeta function::
-
-        sage: # optional - database_odlyzko_zeta
-        sage: zz = zeta_zeros()
-        sage: zz[12]
-        59.347044003
-        sage: len(zz)
-        2001052
-    """
-    from sage.misc.verbose import verbose
-    sobj = os.path.join(SAGE_SHARE, 'odlyzko', 'zeros.sobj')
-    verbose("Loading Odlyzko database from " + sobj)
-    return load(sobj)

sage/databases/symbolic_data.py

@@ -1,221 +0,0 @@
-"""
-Ideals from the Symbolic Data project
-
-This module implements a thin wrapper for the optional symbolic dataset of
-ideals as published on http://www.symbolicdata.org. From the project website:
-
-    For different purposes, algorithms and implementations are tested
-    on certified and reliable data. The development of tools and data
-    for such tests is usually 'orthogonal' to the main
-    implementation efforts, it requires different skills and
-    technologies and is not loved by programmers. On the other hand,
-    in many cases, tools and data could easily be reused - with slight
-    modifications - across similar projects. The SymbolicData Project
-    is set out to coordinate such efforts within the Computer Algebra
-    Community.  Commonly collected certified and reliable data can
-    also be used to compare otherwise incomparable approaches,
-    algorithms, and implementations. Benchmark suites and Challenges
-    for symbolic computations are not as well established as in other
-    areas of computer science. This is probably due to the fact that
-    there are not yet well agreed aims of such a
-    benchmarking. Nevertheless various (often high quality) special
-    benchmarks are scattered through the literature.  During the last
-    years, efforts toward collection of test data for symbolic
-    computations were intensified. They focused mainly on the creation
-    of general benchmarks for different areas of symbolic computation
-    and the collection of such activities on different Web site.  For
-    further qualification of these efforts, it would be of great
-    benefit to create a commonly available digital archive of these
-    special benchmark data scattered through the literature. This
-    would provide the community with an electronic repository of
-    certified data that could be addressed and extended during further
-    development.
-
-In order to use this dataset, you need to install the optional
-:ref:`database_symbolic_data <spkg_database_symbolic_data>` package by the Sage
-command ::
-
-    sage -i database_symbolic_data
-
-EXAMPLES::
-
-    sage: # optional - database_symbolic_data
-    sage: sd = SymbolicData(); sd
-    SymbolicData with 372 ideals
-    sage: sd.ZeroDim__example_1
-    Ideal (x1^2 + x2^2 - 10, x1^2 + x1*x2 + 2*x2^2 - 16) of Multivariate Polynomial Ring in x1, x2 over Rational Field
-    sage: sd.Katsura_3
-    Ideal (u0 + 2*u1 + 2*u2 + 2*u3 - 1,
-           u1^2 + 2*u0*u2 + 2*u1*u3 - u2,
-           2*u0*u1 + 2*u1*u2 + 2*u2*u3 - u1,
-           u0^2 + 2*u1^2 + 2*u2^2 + 2*u3^2 - u0) of Multivariate Polynomial Ring in u0, u1, u2, u3 over Rational Field
-    sage: sd.get_ideal('Katsura_3', GF(127), 'degrevlex')
-    Ideal (u0 + 2*u1 + 2*u2 + 2*u3 - 1,
-           u1^2 + 2*u0*u2 + 2*u1*u3 - u2,
-           2*u0*u1 + 2*u1*u2 + 2*u2*u3 - u1,
-           u0^2 + 2*u1^2 + 2*u2^2 + 2*u3^2 - u0) of Multivariate Polynomial Ring in u0, u1, u2, u3 over Finite Field of size 127
-
-AUTHORS:
-
-- Martin Albrecht (2007-02-19): initial version
-"""
-
-# ****************************************************************************
-#       Copyright (C) 2007 Martin Albrecht <martinralbrecht@googlemail.com>
-#
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 2 of the License, or
-# (at your option) any later version.
-#                  https://www.gnu.org/licenses/
-# ****************************************************************************
-
-import os
-from xml.dom.minidom import parse
-from sage.rings.rational_field import QQ
-from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
-
-
-class SymbolicData:
-    """
-    Database of ideals as distributed by The SymbolicData Project
-    (http://symbolicdata.org).
-
-    This class needs the optional ``database_symbolic_data`` package to be
-    installed.
-    """
-    def __init__(self):
-        """
-        EXAMPLES::
-
-            sage: sd = SymbolicData(); sd # optional - database_symbolic_data
-            SymbolicData with 372 ideals
-        """
-        from sage.env import SAGE_SHARE
-        path = os.path.join(SAGE_SHARE, 'symbolic_data')
-        self.__intpath = path + "/Data/XMLResources/INTPS/"
-        self.__genpath = path + "/Data/XMLResources/GenPS/"
-
-    def get_ideal(self, name, base_ring=QQ, term_order='degrevlex'):
-        """
-        Return the ideal given by 'name' over the base ring given by
-        'base_ring' in a polynomial ring with the term order given by
-        'term_order'.
-
-        INPUT:
-
-        - ``name`` -- name as on the symbolic data website
-        - ``base_ring`` -- base ring for the polynomial ring (default: ``QQ``)
-        - ``term_order`` -- term order for the polynomial ring (default: ``degrevlex``)
-
-        OUTPUT: ideal as given by ``name`` in ``PolynomialRing(base_ring,vars,term_order)``
-
-        EXAMPLES::
-
-            sage: sd = SymbolicData() # optional - database_symbolic_data
-            sage: sd.get_ideal('Katsura_3',GF(127),'degrevlex') # optional - database_symbolic_data
-            Ideal (u0 + 2*u1 + 2*u2 + 2*u3 - 1,
-                   u1^2 + 2*u0*u2 + 2*u1*u3 - u2,
-                   2*u0*u1 + 2*u1*u2 + 2*u2*u3 - u1,
-                   u0^2 + 2*u1^2 + 2*u2^2 + 2*u3^2 - u0) of Multivariate Polynomial Ring in u0, u1, u2, u3 over Finite Field of size 127
-        """
-
-        def _getTextFromNode(node):
-            t = ""
-            for n in node.childNodes:
-                if n.nodeType == n.TEXT_NODE:
-                    t += str(n.nodeValue)
-                else:
-                    raise TypeError('not a text node')
-            return t
-
-        def _dom2ideal(node):
-            l = []
-
-            if str(node.nodeName) in ['vars', 'poly']:
-                l.append(_getTextFromNode(node))
-
-            for c in node.childNodes:
-                l += _dom2ideal(c)
-
-            return l
-
-        orig_name = name
-        name = name.replace('__', '.')
-
-        try:
-            name = self.__intpath + name + ".xml"
-            open(name)
-        except OSError:
-            try:
-                name = self.__genpath + name + ".xml"
-                open(name)
-            except OSError:
-                raise AttributeError(f"no ideal matching '{orig_name}' found in database")
-
-        dom = parse(name)
-        res = _dom2ideal(dom)
-        variables, polys = res[0].replace("_", ""), [p.replace("_", "") for p in res[1:]]
-
-        P = PolynomialRing(base_ring, len(variables.split(",")), variables)
-        I = P.ideal([P(f) for f in polys])
-        return I
-
-    def __repr__(self):
-        """
-        EXAMPLES::
-
-            sage: sd = SymbolicData(); sd # optional - database_symbolic_data
-            SymbolicData with 372 ideals
-        """
-        try:
-            l = len(self.__dir__())
-        except AttributeError:
-            l = 0
-        return "SymbolicData with %d ideals" % l
-
-    def __getattr__(self, name):
-        """
-        EXAMPLES::
-
-           sage: sd = SymbolicData() # optional - database_symbolic_data
-           sage: sd.Cyclic5 # optional - database_symbolic_data
-           Traceback (most recent call last):
-           ...
-           AttributeError: no ideal matching 'Cyclic5' found in database...
-
-           sage: sd.Cyclic_5 # optional - database_symbolic_data
-           Ideal (v + w + x + y + z,
-                  v*w + w*x + x*y + v*z + y*z,
-                  v*w*x + w*x*y + v*w*z + v*y*z + x*y*z,
-                  v*w*x*y + v*w*x*z + v*w*y*z + v*x*y*z + w*x*y*z,
-                  v*w*x*y*z - 1) of Multivariate Polynomial Ring in v, w, x, y, z over Rational Field
-        """
-        return self.get_ideal(name)
-
-    def __dir__(self):
-        """
-        EXAMPLES::
-
-            sage: sd = SymbolicData() # optional - database_symbolic_data
-            sage: sorted(sd.__dir__())[:10] # optional - database_symbolic_data
-            ['Bjoerk_8',
-             'Bronstein-86',
-             'Buchberger-87',
-             'Butcher',
-             'Caprasse',
-             'Cassou',
-             'Cohn_2',
-             'Curves__curve10_20',
-             'Curves__curve10_20',
-             'Curves__curve10_30']
-        """
-        if hasattr(self, "__ideals"):
-            return self.__ideals
-        try:
-            __ideals = [s.replace('.xml', '') for s in os.listdir(self.__intpath)]
-            __ideals += [s.replace('.xml', '') for s in os.listdir(self.__genpath)]
-            self.__ideals = [s.replace('.', '__') for s in __ideals]
-            return self.__ideals
-        except OSError:
-            raise AttributeError("Could not find symbolic data, you should perhaps install the optional package")