passagemath-schemes 10.5.44__cp313-cp313-musllinux_1_2_aarch64.whl → 10.6.42__cp313-cp313-musllinux_1_2_aarch64.whl

sage_wheels/share/ellcurves/rank4

@@ -0,0 +1,10 @@
+234446 a 1 [1,-1,0,-79,289] 4 1
+545723 a 1 [0,0,1,-7,36] 4 1
+842596 a 1 [0,0,0,-169,841] 4 1
+926584 a 1 [0,0,0,-127,610] 4 1
+1099496 a 1 [0,0,0,-172,820] 4 1
+1109716 a 1 [0,0,0,-64,169] 4 1
+1129211 a 1 [0,0,1,-19,60] 4 1
+1142158 a 1 [1,-1,0,-1,73] 4 1
+1162928 a 1 [0,0,0,-259,2194] 4 1
+1175648 a 1 [0,0,0,-316,2080] 4 1

sage_wheels/share/ellcurves/rank5

@@ -0,0 +1,5 @@
+19047851 a 1 [0,0,1,-79,342] 5 1
+20384311 a 1 [1,0,0,-22,219] 5 1
+22966597 a 1 [0,0,1,-247,1476] 5 1
+34672310 a 1 [1,-1,0,-415,3481] 5 1
+37396136 a 1 [0,0,0,-532,4420] 5 1

sage_wheels/share/ellcurves/rank6

@@ -0,0 +1,5 @@
+5187563742 a 1 [1,1,0,-2582,48720] 6 1
+5258110041 a 1 [0,0,1,-7077,235516] 6 1
+5739520802 a 1 [1,-1,0,-2326,43456] 6 1
+6601024978 a 1 [1,-1,0,-16249,799549] 6 1
+6663562874 a 1 [1,-1,1,-63147,6081915] 6 1

sage_wheels/share/ellcurves/rank7

@@ -0,0 +1,5 @@
+382623908456 a 1 [0,0,0,-10012,346900] 7 1
+536670340706 a 1 [1,0,1,-14733,694232] 7 1
+814434447535 a 1 [0,0,1,-36673,2704878] 7 1
+858426129202 a 1 [1,-1,0,-92656,10865908] 7 1
+896913586322 a 1 [1,-1,0,-18664,958204] 7 1

sage_wheels/share/ellcurves/rank8

@@ -0,0 +1,6 @@
+249649566346838 a 1 [1,-1,0,-106384,13075804] 8 1
+292246301470558 a 1 [1,-1,0,-222751,40537273] 8 1
+314214346667560 a 1 [0,0,0,-481663,128212738] 8 1
+314658846776578 a 1 [1,-1,0,-71899,5522449] 8 1
+315734078239402 a 1 [1,-1,0,-124294,14418784] 8 1
+457532830151317 a 1 [0,0,1,-23737,960366] 8 1

sage_wheels/share/ellcurves/rank9

@@ -0,0 +1,7 @@
+32107342006814614 a 1 [1,-1,0,-135004,97151644] 9 1
+43537345103385386 a 1 [1,-1,0,-613069,98885089] 9 1
+62986816173592807 a 1 [0,0,1,-3835819,2889890730] 9 1
+72070075910145406 a 1 [1,0,1,-1493028,701820182] 9 1
+77211251506212554 a 1 [1,0,1,-1076185,496031340] 9 1
+484154179417645171 a 1 [0,1,1,-3529920,2567473020] 9 1
+9612838979769443646330 a 1 [1,-1,1,-1608154463,25555312501831] 9 1

passagemath_schemes-10.5.44.dist-info/top_level.txt

@@ -1,2 +0,0 @@
-
-sage

sage/databases/db_modular_polynomials.py

@@ -1,250 +0,0 @@
-# sage_setup: distribution = sagemath-schemes
-"""
-Database of modular polynomials
-
-This module gives access to the database of modular 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: DBMP = ClassicalModularPolynomialDatabase()
-    sage: f = DBMP[29]
-    sage: f.degree()
-    58
-    sage: f.coefficient([28,28])
-    400152899204646997840260839128
-
-AUTHORS:
-
-- David Kohel (2006-08-04): initial version
-"""
-# ****************************************************************************
-#       Copyright (C) 2006 William Stein <wstein@gmail.com>
-#       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/
-# ****************************************************************************
-import bz2
-import os
-from sage.cpython.string import bytes_to_str
-
-
-def _dbz_to_string(name):
-    r"""
-    TESTS::
-
-        sage: # optional - database_kohel
-        sage: from sage.databases.db_modular_polynomials import _dbz_to_string
-        sage: _dbz_to_string('PolMod/Atk/pol.002.dbz')
-        '3 0 1 \n2 1 -1 \n2 0 744 \n1 1 -1 \n1 0 184512 \n0 2 1 \n0 1 7256 \n0 0 15252992 \n'
-        sage: _dbz_to_string('PolMod/Cls/pol.001.dbz')
-        '1 0 1 \n'
-        sage: _dbz_to_string('PolMod/Eta/pol.002.dbz')
-        '3 0 1 \n2 0 48 \n1 1 -1 \n1 0 768 \n0 0 4096 \n'
-        sage: _dbz_to_string('PolMod/EtaCrr/crr.02.002.dbz')
-        '2 1 1 \n2 0 -48 \n1 1 2304 \n0 2 -4096 \n0 1 196608 \n'
-        sage: _dbz_to_string('PolHeeg/Cls/0000001-0005000/pol.0000003.dbz')
-        '0\n1\n'
-    """
-    from sage.env import SAGE_SHARE
-    dblocation = os.path.join(SAGE_SHARE, 'kohel')
-    filename = os.path.join(dblocation, name)
-    try:
-        with open(filename, 'rb') as f:
-            data = bz2.decompress(f.read())
-    except OSError:
-        raise ValueError('file not found in the Kohel database')
-    return bytes_to_str(data)
-
-
-def _dbz_to_integer_list(name):
-    r"""
-    TESTS::
-
-        sage: # optional - database_kohel
-        sage: from sage.databases.db_modular_polynomials import _dbz_to_integer_list
-        sage: _dbz_to_integer_list('PolMod/Atk/pol.002.dbz')
-        [[3, 0, 1],
-         [2, 1, -1],
-         [2, 0, 744],
-         [1, 1, -1],
-         [1, 0, 184512],
-         [0, 2, 1],
-         [0, 1, 7256],
-         [0, 0, 15252992]]
-        sage: _dbz_to_integer_list('PolMod/Cls/pol.001.dbz')
-        [[1, 0, 1]]
-        sage: _dbz_to_integer_list('PolMod/Eta/pol.002.dbz')
-        [[3, 0, 1], [2, 0, 48], [1, 1, -1], [1, 0, 768], [0, 0, 4096]]
-    """
-    from sage.rings.integer import Integer
-    data = _dbz_to_string(name)
-    return [[Integer(v) for v in row.strip().split(" ")]
-            for row in data.split("\n")[:-1]]
-
-
-def _dbz_to_integers(name):
-    r"""
-    TESTS::
-
-        sage: from sage.databases.db_modular_polynomials import _dbz_to_integers
-        sage: _dbz_to_integers('PolHeeg/Cls/0000001-0005000/pol.0000003.dbz') # optional - database_kohel
-        [0, 1]
-    """
-    from sage.rings.integer import Integer
-    return [Integer(i) for i in _dbz_to_string(name).split()]
-
-
-class ModularPolynomialDatabase:
-    def _dbpath(self, level):
-        r"""
-        TESTS::
-
-            sage: C = ClassicalModularPolynomialDatabase()
-            sage: C._dbpath(3)
-            'PolMod/Cls/pol.003.dbz'
-            sage: C._dbpath(8)
-            'PolMod/Cls/pol.008.dbz'
-        """
-        return "PolMod/%s/pol.%03d.dbz" % (self.model, level)
-
-    def __repr__(self):
-        r"""
-        EXAMPLES::
-
-            sage: ClassicalModularPolynomialDatabase()
-            Classical modular polynomial database
-
-            sage: DedekindEtaModularPolynomialDatabase()
-            Dedekind eta modular polynomial database
-            sage: DedekindEtaModularPolynomialDatabase()
-            Dedekind eta modular polynomial database
-
-            sage: AtkinModularPolynomialDatabase()
-            Atkin modular polynomial database
-        """
-        if self.model.startswith("Cls"):
-            head = "Classical"
-        elif self.model.startswith("Atk"):
-            head = "Atkin"
-        elif self.model.startswith("Eta"):
-            head = "Dedekind eta"
-
-        if self.model.endswith("Crr"):
-            poly = "correspondence"
-        else:
-            poly = "polynomial"
-
-        return "%s modular %s database" % (head, poly)
-
-    def __getitem__(self, level):
-        """
-        Return the modular polynomial of given level, or an error if
-        there is no such polynomial in the database.
-
-        EXAMPLES::
-
-            sage: # optional - database_kohel
-            sage: DBMP = ClassicalModularPolynomialDatabase()
-            sage: f = DBMP[29]
-            sage: f.degree()
-            58
-            sage: f.coefficient([28,28])
-            400152899204646997840260839128
-            sage: DBMP[50]
-            Traceback (most recent call last):
-            ...
-            ValueError: file not found in the Kohel database
-        """
-        from sage.rings.integer import Integer
-        from sage.rings.integer_ring import IntegerRing
-        from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
-
-        if self.model in ("Atk", "Eta"):
-            level = Integer(level)
-            if not level.is_prime():
-                raise TypeError("Argument level (= %s) must be prime." % level)
-        elif self.model in ("AtkCrr", "EtaCrr"):
-            N = Integer(level[0])
-            if N not in (2, 3, 5, 7, 13):
-                raise TypeError("Argument level (= %s) must be prime." % N)
-        modpol = self._dbpath(level)
-        coeff_list = _dbz_to_integer_list(modpol)
-        if self.model == "Cls":
-            P = PolynomialRing(IntegerRing(), 2, "j")
-        else:
-            P = PolynomialRing(IntegerRing(), 2, "x,j")
-        poly = {}
-        if self.model == "Cls":
-            if level == 1:
-                return P({(1, 0): 1, (0, 1): -1})
-            for cff in coeff_list:
-                i = cff[0]
-                j = cff[1]
-                poly[(i, j)] = Integer(cff[2])
-                if i != j:
-                    poly[(j, i)] = Integer(cff[2])
-        else:
-            for cff in coeff_list:
-                poly[(cff[0], cff[1])] = Integer(cff[2])
-        return P(poly)
-
-
-class ModularCorrespondenceDatabase(ModularPolynomialDatabase):
-    def _dbpath(self, level):
-        r"""
-        TESTS::
-
-            sage: DB = DedekindEtaModularCorrespondenceDatabase()
-            sage: DB._dbpath((2,4))
-            'PolMod/EtaCrr/crr.02.004.dbz'
-        """
-        (Nlevel, crrlevel) = level
-        return "PolMod/%s/crr.%02d.%03d.dbz" % (self.model, Nlevel, crrlevel)
-
-
-class ClassicalModularPolynomialDatabase(ModularPolynomialDatabase):
-    """
-    The database of classical modular polynomials, i.e. the polynomials
-    Phi_N(X,Y) relating the j-functions j(q) and j(q^N).
-    """
-    model = "Cls"
-
-
-class DedekindEtaModularPolynomialDatabase(ModularPolynomialDatabase):
-    """
-    The database of modular polynomials Phi_N(X,Y) relating a quotient
-    of Dedekind eta functions, well-defined on X_0(N), relating x(q) and
-    the j-function j(q).
-    """
-    model = "Eta"
-
-
-class DedekindEtaModularCorrespondenceDatabase(ModularCorrespondenceDatabase):
-    r"""
-    The database of modular correspondences in `X_0(p) \times X_0(p)`, where
-    the model of the curves `X_0(p) = \Bold{P}^1` are specified by quotients of
-    Dedekind's eta function.
-    """
-    model = "EtaCrr"
-
-
-class AtkinModularPolynomialDatabase(ModularPolynomialDatabase):
-    """
-    The database of modular polynomials Phi(x,j) for `X_0(p)`, where
-    x is a function on invariant under the Atkin-Lehner invariant,
-    with pole of minimal order at infinity.
-    """
-    model = "Atk"
-
-
-class AtkinModularCorrespondenceDatabase(ModularCorrespondenceDatabase):
-    model = "AtkCrr"

sage/databases/stein_watkins.py

@@ -1,363 +0,0 @@
-# sage_setup: distribution = sagemath-schemes
-r"""
-The Stein-Watkins table of elliptic curves
-
-Sage gives access to the Stein-Watkins table of elliptic curves, via the
-optional :ref:`database_stein_watkins <spkg_database_stein_watkins>` package
-that you must install. This is a huge database of elliptic curves. You can
-install the database (a 2.6GB package) with the command ::
-
-    sage -i database_stein_watkins
-
-You can also automatically download a small version, which takes much less
-time, via the optional :ref:`database_stein_watkins_mini <spkg_database_stein_watkins_mini>`
-package using the command ::
-
-    sage -i database_stein_watkins_mini
-
-This database covers a wide range of conductors, but unlike the
-:mod:`Cremona database <sage.databases.cremona>`, this database need not list
-all curves of a given conductor. It lists the curves whose coefficients are not
-"too large" (see [SW2002]_).
-
-
--  The command ``SteinWatkinsAllData(n)`` returns an iterator over the curves
-   in the `n`-th Stein-Watkins table, which contains elliptic curves of
-   conductor between `n10^5` and `(n+1)10^5`. Here `n` can be between 0 and
-   999, inclusive.
-
--  The command ``SteinWatkinsPrimeData(n)`` returns an iterator over the curves
-   in the `n`-th Stein-Watkins prime table, which contains prime conductor
-   elliptic curves of conductor between `n10^8` and `(n+1)10^8`. Here `n`
-   varies between 0 and 99, inclusive.
-
-EXAMPLES: We obtain the first table of elliptic curves.
-
-::
-
-    sage: d = SteinWatkinsAllData(0)
-    sage: d
-    Stein-Watkins Database a.0 Iterator
-
-We type ``next(d)`` to get each isogeny class of
-curves from ``d``::
-
-    sage: # optional - database_stein_watkins
-    sage: C = next(d)
-    sage: C
-    Stein-Watkins isogeny class of conductor 11
-    sage: next(d)
-    Stein-Watkins isogeny class of conductor 14
-    sage: next(d)
-    Stein-Watkins isogeny class of conductor 15
-
-An isogeny class has a number of attributes that give data about
-the isogeny class, such as the rank, equations of curves,
-conductor, leading coefficient of `L`-function, etc.
-
-::
-
-    sage: # optional - database_stein_watkins
-    sage: C.data
-    ['11', '[11]', '0', '0.253842', '25', '+*1']
-    sage: C.curves
-    [[[0, -1, 1, 0, 0], '(1)', '1', '5'],
-     [[0, -1, 1, -10, -20], '(5)', '1', '5'],
-     [[0, -1, 1, -7820, -263580], '(1)', '1', '1']]
-    sage: C.conductor
-    11
-    sage: C.leading_coefficient
-    '0.253842'
-    sage: C.modular_degree
-    '+*1'
-    sage: C.rank
-    0
-    sage: C.isogeny_number
-    '25'
-
-If we were to continue typing ``next(d)`` we would
-iterate over all curves in the Stein-Watkins database up to
-conductor `10^5`. We could also type ``for C in d:
-...``
-
-To access the data file starting at `10^5` do the
-following::
-
-    sage: d = SteinWatkinsAllData(1)
-    sage: C = next(d)                                  # optional - database_stein_watkins
-    sage: C                                            # optional - database_stein_watkins
-    Stein-Watkins isogeny class of conductor 100002
-    sage: C.curves                                     # optional - database_stein_watkins
-    [[[1, 1, 0, 112, 0], '(8,1,2,1)', 'X', '2'],
-     [[1, 1, 0, -448, -560], '[4,2,1,2]', 'X', '2']]
-
-Next we access the prime-conductor data::
-
-    sage: d = SteinWatkinsPrimeData(0)
-    sage: C = next(d)                                  # optional - database_stein_watkins
-    sage: C                                            # optional - database_stein_watkins
-    Stein-Watkins isogeny class of conductor 11
-
-Each call ``next(d)`` gives another elliptic curve of
-prime conductor::
-
-    sage: # optional - database_stein_watkins
-    sage: C = next(d)
-    sage: C
-    Stein-Watkins isogeny class of conductor 17
-    sage: C.curves
-    [[[1, -1, 1, -1, 0], '[1]', '1', '4'],
-     [[1, -1, 1, -6, -4], '[2]', '1', '2x'],
-     [[1, -1, 1, -1, -14], '(4)', '1', '4'],
-     [[1, -1, 1, -91, -310], '[1]', '1', '2']]
-    sage: C = next(d)
-    sage: C
-    Stein-Watkins isogeny class of conductor 19
-
-REFERENCE:
-
-- [SW2002]_
-"""
-
-# ****************************************************************************
-#
-#       Sage: 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:
-#
-#                  http://www.gnu.org/licenses/
-# ****************************************************************************
-
-import bz2
-import os
-
-from sage.env import SAGE_SHARE
-
-
-class SteinWatkinsIsogenyClass:
-    def __init__(self, conductor):
-        self.conductor = conductor
-
-    def __repr__(self):
-        return "Stein-Watkins isogeny class of conductor %s" % self.conductor
-
-    def __len__(self):
-        try:
-            return len(self.curves)
-        except AttributeError:
-            return 0
-
-    def __iter__(self):
-        try:
-            yield from self.curves
-        except AttributeError:
-            return
-
-
-def _lines(s):
-    while True:
-        i = s.find("\n")
-        if i == -1:
-            yield ""
-            return
-        line = s[:i]
-        s = s[i + 1:]
-        yield line
-
-
-class SteinWatkinsAllData:
-    """
-    Class for iterating through one of the Stein-Watkins database files
-    for all conductors.
-    """
-    def __init__(self, num):
-        num = int(num)
-        self.num = num
-        if num < 0:
-            raise RuntimeError("num (=%s) must be a nonnegative integer" % num)
-        name = str(num)
-        name = '0' * (3 - len(name)) + name
-        self._file = os.path.join(SAGE_SHARE, 'stein_watkins', 'a.%s.bz2' % name)
-        self._iter = iter(self)
-
-    def __repr__(self):
-        """
-        EXAMPLES::
-
-            sage: d = SteinWatkinsAllData(1)
-            sage: d
-            Stein-Watkins Database a.1 Iterator
-        """
-        return "Stein-Watkins Database a.%s Iterator" % self.num
-
-    def __iter__(self):
-        """
-        EXAMPLES::
-
-            sage: d = SteinWatkinsAllData(0)
-            sage: d = d[10:20]                         # optional - database_stein_watkins; long time
-            sage: for C in d:                          # optional - database_stein_watkins; long time
-            ....:     print(C)
-            Stein-Watkins isogeny class of conductor 11
-            Stein-Watkins isogeny class of conductor 14
-            Stein-Watkins isogeny class of conductor 15
-            Stein-Watkins isogeny class of conductor 17
-            Stein-Watkins isogeny class of conductor 19
-            Stein-Watkins isogeny class of conductor 20
-        """
-        try:
-            file = bz2.open(self._file, 'rt', encoding='utf-8')
-        except OSError:
-            raise OSError("The Stein-Watkins data file %s must be installed." % self._file)
-        C = None
-        for L in file:
-            if len(L) == 0:
-                continue
-            if L[0] != '[':  # new curve
-                if C is not None:
-                    yield C
-                x = L.split()
-                N = int(x[0])
-                C = SteinWatkinsIsogenyClass(N)
-                C.rank = int(x[2])
-                C.leading_coefficient = x[3]
-                C.isogeny_number = x[4]
-                C.modular_degree = x[5]
-                C.curves = []
-                C.data = x
-            else:
-                w = L.split()
-                C.curves.append([eval(w[0]), w[1], w[2], w[3]])
-        yield C
-
-    def __next__(self):
-        return next(self._iter)
-
-    next = __next__
-
-    def __getitem__(self, N):
-        """
-        Return the curves of conductor N in this table. (Very slow!)
-        Return all data about curves between the given levels in this
-        database file.
-
-        EXAMPLES::
-
-            sage: d = SteinWatkinsAllData(0)
-            sage: d[15:18]                             # optional - database_stein_watkins; long time
-            [Stein-Watkins isogeny class of conductor 15, Stein-Watkins isogeny
-             class of conductor 17]
-        """
-        X = []
-        if isinstance(N, slice):
-            min_level, max_level, step = N.indices(len(list(self)))
-            for C in self:
-                M = C.conductor
-                if M >= min_level and M <= max_level:
-                    X.append(C)
-                elif M > max_level:
-                    return X
-        else:
-            for C in self:
-                M = C.conductor
-                if M == N:
-                    X.append(C)
-                elif M > N:
-                    return X
-            return X
-
-    def iter_levels(self):
-        """
-        Iterate through the curve classes, but grouped into lists by
-        level.
-
-        EXAMPLES::
-
-            sage: d = SteinWatkinsAllData(1)
-            sage: E = d.iter_levels()
-            sage: next(E)                             # optional - database_stein_watkins
-            [Stein-Watkins isogeny class of conductor 100002]
-            sage: next(E)                             # optional - database_stein_watkins
-            [Stein-Watkins isogeny class of conductor 100005,
-            Stein-Watkins isogeny class of conductor 100005]
-            sage: next(E)                             # optional - database_stein_watkins
-            [Stein-Watkins isogeny class of conductor 100007]
-        """
-        it = iter(self)
-        C = []
-        N = 0
-        while True:
-            try:
-                E = next(it)
-            except StopIteration:
-                if C:
-                    yield C
-                return
-            if E.conductor != N:
-                if C:
-                    yield C
-                C = [E]
-                N = E.conductor
-            else:
-                C.append(E)
-        yield C
-
-
-class SteinWatkinsPrimeData(SteinWatkinsAllData):
-    def __init__(self, num):
-        num = int(num)
-        self.num = num
-        if num < 0:
-            raise RuntimeError("num (=%s) must be a nonnegative integer" % num)
-        name = str(num)
-        name = '0' * (2 - len(name)) + name
-        self._file = os.path.join(SAGE_SHARE, 'stein_watkins', 'p.%s.bz2' % name)
-        self._iter = iter(self)
-
-    def __repr__(self):
-        """
-        EXAMPLES::
-
-            sage: d = SteinWatkinsPrimeData(1)
-            sage: d
-            Stein-Watkins Prime Conductor Database p.1 Iterator
-        """
-        return "Stein-Watkins Prime Conductor Database p.%s Iterator" % self.num
-
-
-def ecdb_num_curves(max_level=200000):
-    r"""
-    Return a list whose `N`-th entry, for ``0 <= N <= max_level``, is the
-    number of elliptic curves of conductor `N` in the database.
-
-    EXAMPLES::
-
-        sage: sage.databases.stein_watkins.ecdb_num_curves(100) # optional - database_stein_watkins
-        [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 6, 8, 0, 4, 0, 3, 4, 6, 0, 0,
-         6, 0, 5, 4, 0, 0, 8, 0, 4, 4, 4, 3, 4, 4, 5, 4, 4, 0, 6, 1, 2, 8, 2, 0,
-         6, 4, 8, 2, 2, 1, 6, 4, 6, 7, 3, 0, 0, 1, 4, 6, 4, 2, 12, 1, 0, 2, 4, 0,
-         6, 2, 0, 12, 1, 6, 4, 1, 8, 0, 2, 1, 6, 2, 0, 0, 1, 3, 16, 4, 3, 0, 2,
-         0, 8, 0, 6, 11, 4]
-    """
-    i = 0
-    d = SteinWatkinsAllData(i)
-    v = [0 for _ in range(max_level + 1)]
-    while True:
-        try:
-            C = next(d)
-        except StopIteration:
-            i += 1
-            d = SteinWatkinsAllData(i)
-            continue
-        N = C.conductor
-        if N > max_level:
-            break
-        v[N] += len(C.curves)
-    return v

sage/modular/modsym/p1list.pxd

@@ -1,29 +0,0 @@
-# sage_setup: distribution = sagemath-schemes
-
-
-cdef class export:
-    cdef int c_p1_normalize_int(self, int N, int u, int v,
-                                int* uu, int* vv, int* ss,
-                                int compute_s) except -1
-
-    cdef int c_p1_normalize_llong(self, int N, int u, int v,
-                                  int* uu, int* vv, int* ss,
-                                  int compute_s) except -1
-
-
-cdef class P1List:
-    cdef int __N
-    cdef object __list, __end_hash
-
-    cdef int *g
-    cdef int *s
-    cdef int *t   # xgcd with N table.
-
-    # Here we use a pointer to a function, so the if logic
-    # for normalizing an element does not need to be used
-    # every time the user calls the normalize function.
-    cdef int (*_normalize)(int N, int u, int v,
-                           int* uu, int* vv, int* ss,
-                           int compute_s) except -1
-    cpdef index(self, int u, int v)
-    cdef index_and_scalar(self, int u, int v, int* i, int* s)