passagemath-combinat 10.6.1__cp312-cp312-musllinux_1_2_aarch64.whl → 10.8.1a1__cp312-cp312-musllinux_1_2_aarch64.whl

sage/monoids/automatic_semigroup.py

@@ -687,13 +687,11 @@ class AutomaticSemigroup(UniqueRepresentation, Parent):
             sage: M._constructed
             True
         """
-        i = 0
         # self._elements is never empty; so we are sure
-        for x in self._elements:
+        for i, x in enumerate(self._elements, 1):
             yield x
             # some other iterator/ method of the semigroup may have
             # been called before we move on to the next line
-            i += 1
             if i == len(self._elements) and not self._constructed:
                 try:
                     next(self._iter)

sage/monoids/free_abelian_monoid.py

@@ -55,15 +55,14 @@ lists of integer exponents.
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
 
-from sage.misc.cachefunc import cached_method
-from sage.structure.category_object import normalize_names
-from sage.structure.parent import Parent
 from sage.categories.monoids import Monoids
-from .free_abelian_monoid_element import FreeAbelianMonoidElement
+from sage.misc.cachefunc import cached_method
+from sage.monoids.free_abelian_monoid_element import FreeAbelianMonoidElement
 from sage.rings.integer import Integer
 from sage.rings.integer_ring import ZZ
-
+from sage.structure.category_object import normalize_names
 from sage.structure.factory import UniqueFactory
+from sage.structure.parent import Parent
 
 
 class FreeAbelianMonoidFactory(UniqueFactory):
@@ -158,38 +157,13 @@ def FreeAbelianMonoid(index_set=None, names=None, **kwds):
     return FreeAbelianMonoid_factory(index_set, names)
 
 
-def is_FreeAbelianMonoid(x):
-    """
-    Return ``True`` if `x` is a free abelian monoid.
-
-    EXAMPLES::
-
-        sage: from sage.monoids.free_abelian_monoid import is_FreeAbelianMonoid
-        sage: is_FreeAbelianMonoid(5)
-        doctest:warning...
-        DeprecationWarning: the function is_FreeAbelianMonoid is deprecated;
-        use 'isinstance(..., FreeAbelianMonoid_class)' instead
-        See https://github.com/sagemath/sage/issues/37897 for details.
-        False
-        sage: is_FreeAbelianMonoid(FreeAbelianMonoid(7,'a'))
-        True
-        sage: is_FreeAbelianMonoid(FreeMonoid(7,'a'))
-        False
-        sage: is_FreeAbelianMonoid(FreeMonoid(0,''))
-        False
-    """
-    from sage.misc.superseded import deprecation
-    deprecation(37897, "the function is_FreeAbelianMonoid is deprecated; use 'isinstance(..., FreeAbelianMonoid_class)' instead")
-    return isinstance(x, FreeAbelianMonoid_class)
-
-
 class FreeAbelianMonoid_class(Parent):
     """
     Free abelian monoid on `n` generators.
     """
     Element = FreeAbelianMonoidElement
 
-    def __init__(self, n, names):
+    def __init__(self, n, names) -> None:
         """
         Initialize ``self``.
 
@@ -206,7 +180,7 @@ class FreeAbelianMonoid_class(Parent):
         assert names is not None
         Parent.__init__(self, names=names, category=Monoids().Commutative())
 
-    def __repr__(self):
+    def __repr__(self) -> str:
         n = self.__ngens
         return f"Free abelian monoid on {n} generators {self.gens()}"
 
@@ -226,7 +200,7 @@ class FreeAbelianMonoid_class(Parent):
             return x
         return self.element_class(self, x)
 
-    def __contains__(self, x):
+    def __contains__(self, x) -> bool:
         """
         Return ``True`` if `x` is an element of this abelian monoid.
 

sage/monoids/free_monoid.py

@@ -25,48 +25,15 @@ the optional ``names`` argument to the
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
 
-from sage.rings.integer import Integer
-from sage.structure.category_object import normalize_names
 from .free_monoid_element import FreeMonoidElement
-
 from .monoid import Monoid_class
 
+from sage.categories.monoids import Monoids
 from sage.combinat.words.finite_word import FiniteWord_class
-
-from sage.structure.unique_representation import UniqueRepresentation
+from sage.rings.integer import Integer
 from sage.rings.integer_ring import ZZ
-
-
-def is_FreeMonoid(x):
-    """
-    Return ``True`` if `x` is a free monoid.
-
-    EXAMPLES::
-
-        sage: from sage.monoids.free_monoid import is_FreeMonoid
-        sage: is_FreeMonoid(5)
-        doctest:warning...
-        DeprecationWarning: the function is_FreeMonoid is deprecated;
-        use 'isinstance(..., (FreeMonoid, IndexedFreeMonoid))' instead
-        See https://github.com/sagemath/sage/issues/37897 for details.
-        False
-        sage: is_FreeMonoid(FreeMonoid(7,'a'))
-        True
-        sage: is_FreeMonoid(FreeAbelianMonoid(7,'a'))
-        False
-        sage: is_FreeMonoid(FreeAbelianMonoid(0,''))
-        False
-        sage: is_FreeMonoid(FreeMonoid(index_set=ZZ))
-        True
-        sage: is_FreeMonoid(FreeAbelianMonoid(index_set=ZZ))
-        False
-    """
-    from sage.misc.superseded import deprecation
-    deprecation(37897, "the function is_FreeMonoid is deprecated; use 'isinstance(..., (FreeMonoid, IndexedFreeMonoid))' instead")
-    if isinstance(x, FreeMonoid):
-        return True
-    from sage.monoids.indexed_free_monoid import IndexedFreeMonoid
-    return isinstance(x, IndexedFreeMonoid)
+from sage.structure.category_object import normalize_names
+from sage.structure.unique_representation import UniqueRepresentation
 
 
 class FreeMonoid(Monoid_class, UniqueRepresentation):
@@ -198,7 +165,8 @@ class FreeMonoid(Monoid_class, UniqueRepresentation):
         if n < 0:
             raise ValueError("n (=%s) must be nonnegative" % n)
         self.__ngens = int(n)
-        Monoid_class.__init__(self, names)
+        cat = Monoids().Infinite() if names else None
+        Monoid_class.__init__(self, names, category=cat)
 
     def _repr_(self):
         return f"Free monoid on {self.__ngens} generators {self.gens()}"
@@ -272,7 +240,7 @@ class FreeMonoid(Monoid_class, UniqueRepresentation):
 
         raise TypeError("argument x (= %s) is of the wrong type" % x)
 
-    def __contains__(self, x):
+    def __contains__(self, x) -> bool:
         return isinstance(x, FreeMonoidElement) and x.parent() == self
 
     def gen(self, i=0):
@@ -330,6 +298,6 @@ class FreeMonoid(Monoid_class, UniqueRepresentation):
             1
         """
         if self.__ngens == 0:
-            return Integer(1)
+            return ZZ.one()
         from sage.rings.infinity import infinity
         return infinity

sage/monoids/free_monoid_element.py

@@ -31,14 +31,6 @@ from sage.structure.richcmp import richcmp, richcmp_not_equal
 from sage.rings.semirings.non_negative_integer_semiring import NN
 
 
-def is_FreeMonoidElement(x):
-    from sage.misc.superseded import deprecation
-    deprecation(38184,
-                "The function is_FreeMonoidElement is deprecated; "
-                "use 'isinstance(..., FreeMonoidElement)' instead.")
-    return isinstance(x, FreeMonoidElement)
-
-
 class FreeMonoidElement(MonoidElement):
     """
     Element of a free monoid.
@@ -56,7 +48,7 @@ class FreeMonoidElement(MonoidElement):
         ...
         NotImplementedError
     """
-    def __init__(self, F, x, check=True):
+    def __init__(self, F, x, check=True) -> None:
         """
         Create the element `x` of the FreeMonoid `F`.
 

sage/monoids/string_monoid.py

@@ -55,10 +55,10 @@ class StringMonoid_class(FreeMonoid):
         FreeMonoid.__init__(self, n)
         self._alphabet = alphabet
 
-    def __contains__(self, x):
+    def __contains__(self, x) -> bool:
         return isinstance(x, StringMonoidElement) and x.parent() == self
 
-    def alphabet(self):
+    def alphabet(self) -> tuple:
         return tuple(self._alphabet)
 
     def one(self):
@@ -692,6 +692,7 @@ class AlphabeticStringMonoid(StringMonoid_class):
         The characteristic frequency probability distribution table
         of Lewand [Lew2000]_::
 
+            sage: # needs sage.rings.real_mpfr
             sage: table = A.characteristic_frequency(table_name='lewand')
             sage: sorted(table.items())
             <BLANKLINE>
@@ -725,6 +726,7 @@ class AlphabeticStringMonoid(StringMonoid_class):
         Illustrating the difference between :func:`characteristic_frequency`
         and :func:`frequency_distribution() <sage.monoids.string_monoid_element.StringMonoidElement.frequency_distribution>`::
 
+            sage: # needs sage.rings.real_mpfr
             sage: A = AlphabeticStrings()
             sage: M = A.encoding("abcd")
             sage: FD = M.frequency_distribution().function()
@@ -768,6 +770,7 @@ class AlphabeticStringMonoid(StringMonoid_class):
 
         The table name must be either "beker_piper" or "lewand"::
 
+            sage: # needs sage.rings.real_mpfr
             sage: table = A.characteristic_frequency(table_name="")
             Traceback (most recent call last):
             ...

sage/monoids/string_monoid_element.py

@@ -30,70 +30,12 @@ lazy_import('sage.rings.real_mpfr', 'RealField')
 from .free_monoid_element import FreeMonoidElement
 
 
-def is_StringMonoidElement(x):
-    from sage.misc.superseded import deprecation
-    deprecation(38280,
-                "The function is_StringMonoidElement is deprecated; "
-                "use 'isinstance(..., StringMonoidElement)' instead.")
-    return isinstance(x, StringMonoidElement)
-
-
-def is_AlphabeticStringMonoidElement(x):
-    from sage.misc.superseded import deprecation
-    deprecation(38280,
-                "The function is_AlphabeticStringMonoidElement is deprecated; "
-                "use 'isinstance(..., StringMonoidElement) and isinstance(x.parent(), AlphabeticStringMonoid)' instead.")
-    from .string_monoid import AlphabeticStringMonoid
-    return isinstance(x, StringMonoidElement) and \
-        isinstance(x.parent(), AlphabeticStringMonoid)
-
-
-def is_BinaryStringMonoidElement(x):
-    from sage.misc.superseded import deprecation
-    deprecation(38280,
-                "The function is_BinaryStringMonoidElement is deprecated; "
-                "use 'isinstance(..., StringMonoidElement) and isinstance(x.parent(), BinaryStringMonoid)' instead.")
-    from .string_monoid import BinaryStringMonoid
-    return isinstance(x, StringMonoidElement) and \
-        isinstance(x.parent(), BinaryStringMonoid)
-
-
-def is_OctalStringMonoidElement(x):
-    from sage.misc.superseded import deprecation
-    deprecation(38280,
-                "The function is_OctalStringMonoidElement is deprecated; "
-                "use 'isinstance(..., StringMonoidElement) and isinstance(x.parent(), OctalStringMonoid)' instead.")
-    from .string_monoid import OctalStringMonoid
-    return isinstance(x, StringMonoidElement) and \
-        isinstance(x.parent(), OctalStringMonoid)
-
-
-def is_HexadecimalStringMonoidElement(x):
-    from sage.misc.superseded import deprecation
-    deprecation(38280,
-                "The function is_HexadecimalStringMonoidElement is deprecated; "
-                "use 'isinstance(..., StringMonoidElement) and isinstance(x.parent(), HexadecimalStringMonoid)' instead.")
-    from .string_monoid import HexadecimalStringMonoid
-    return isinstance(x, StringMonoidElement) and \
-        isinstance(x.parent(), HexadecimalStringMonoid)
-
-
-def is_Radix64StringMonoidElement(x):
-    from sage.misc.superseded import deprecation
-    deprecation(38280,
-                "The function is_Radix64StringMonoidElement is deprecated; "
-                "use 'isinstance(..., StringMonoidElement) and isinstance(x.parent(), Radix64StringMonoid)' instead.")
-    from .string_monoid import Radix64StringMonoid
-    return isinstance(x, StringMonoidElement) and \
-        isinstance(x.parent(), Radix64StringMonoid)
-
-
 class StringMonoidElement(FreeMonoidElement):
     """
     Element of a free string monoid.
     """
 
-    def __init__(self, S, x, check=True):
+    def __init__(self, S, x, check=True) -> None:
         """
         Create the element ``x`` of the StringMonoid ``S``.
 
@@ -130,7 +72,7 @@ class StringMonoidElement(FreeMonoidElement):
         EXAMPLES::
 
             sage: S = BinaryStrings()
-            sage: (x,y) = S.gens()
+            sage: x, y = S.gens()
             sage: x * y < y * x
             True
             sage: S("01") < S("10")
@@ -171,7 +113,7 @@ class StringMonoidElement(FreeMonoidElement):
         EXAMPLES::
 
             sage: S = BinaryStrings()
-            sage: (x,y) = S.gens()
+            sage: x, y = S.gens()
             sage: x*y
             01
         """
@@ -190,7 +132,7 @@ class StringMonoidElement(FreeMonoidElement):
 
         EXAMPLES::
 
-            sage: (x,y) = BinaryStrings().gens()
+            sage: x, y = BinaryStrings().gens()
             sage: x**3 * y**5 * x**7
             000111110000000
             sage: x**0
@@ -221,6 +163,7 @@ class StringMonoidElement(FreeMonoidElement):
     def __len__(self):
         """
         Return the number of products that occur in this monoid element.
+
         For example, the length of the identity is 0, and the length
         of the monoid `x_0^2x_1` is three.
 
@@ -230,7 +173,7 @@ class StringMonoidElement(FreeMonoidElement):
             sage: z = S('')
             sage: len(z)
             0
-            sage: (x,y) = S.gens()
+            sage: x, y = S.gens()
             sage: len(x**2 * y**3)
             5
         """
@@ -413,8 +356,8 @@ class StringMonoidElement(FreeMonoidElement):
 
         Empty strings return no counts of character frequency::
 
-            sage: M = AlphabeticStrings().encoding("")
-            sage: M.character_count()
+            sage: M = AlphabeticStrings().encoding("")                                  # needs sage.rings.real_mpfr
+            sage: M.character_count()                                                   # needs sage.rings.real_mpfr
             {}
             sage: M = BinaryStrings().encoding("")
             sage: M.character_count()
@@ -479,7 +422,7 @@ class StringMonoidElement(FreeMonoidElement):
 
         Capital letters of the English alphabet::
 
-            sage: # needs sage.rings.real_mpfr
+            sage: # needs sage.modules sage.rings.real_mpfr
             sage: M = AlphabeticStrings().encoding("abcd")
             sage: L = M.frequency_distribution().function()
             sage: sorted(L.items())
@@ -491,6 +434,7 @@ class StringMonoidElement(FreeMonoidElement):
 
         The binary number system::
 
+            sage: # needs sage.modules
             sage: M = BinaryStrings().encoding("abcd")
             sage: L = M.frequency_distribution().function()
             sage: sorted(L.items())
@@ -498,6 +442,7 @@ class StringMonoidElement(FreeMonoidElement):
 
         The hexadecimal number system::
 
+            sage: # needs sage.modules
             sage: M = HexadecimalStrings().encoding("abcd")
             sage: L = M.frequency_distribution().function()
             sage: sorted(L.items())
@@ -513,6 +458,7 @@ class StringMonoidElement(FreeMonoidElement):
         "BC", and "CD". Now find out the frequency probability of each of
         these digrams as they occur in the string "ABCD"::
 
+            sage: # needs sage.modules sage.rings.real_mpfr
             sage: M = AlphabeticStrings().encoding("abcd")
             sage: D = M.frequency_distribution(length=2).function()
             sage: sorted(D.items())

sage/rings/all__sagemath_combinat.py

@@ -1,2 +1,9 @@
 # sage_setup: distribution = sagemath-combinat
 from sage.rings.all__sagemath_categories import *
+
+from sage.misc.lazy_import import lazy_import
+
+# Lazy combinatorial species
+lazy_import('sage.rings.lazy_species', 'LazyCombinatorialSpecies')
+
+del lazy_import

sage/sat/solvers/__init__.py

@@ -1,5 +1,4 @@
 # sage_setup: distribution = sagemath-combinat
-from .satsolver import SatSolver
-from .cryptominisat import CryptoMiniSat
-
-from .dimacs import Glucose, GlucoseSyrup, RSat, Kissat
+from sage.sat.solvers.cryptominisat import CryptoMiniSat
+from sage.sat.solvers.dimacs import Glucose, GlucoseSyrup, Kissat, RSat
+from sage.sat.solvers.satsolver import SatSolver

sage/sat/solvers/cryptominisat.py

@@ -20,10 +20,9 @@ AUTHORS:
 #  the License, or (at your option) any later version.
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
-from .satsolver import SatSolver
-
-from sage.misc.lazy_import import lazy_import
 from sage.features.sat import Pycryptosat
+from sage.misc.lazy_import import lazy_import
+from sage.sat.solvers.satsolver import SatSolver
 
 lazy_import('pycryptosat', ['Solver'], feature=Pycryptosat())
 

sage/sat/solvers/picosat.py

@@ -19,10 +19,9 @@ AUTHORS:
 #  the License, or (at your option) any later version.
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
-from .satsolver import SatSolver
-
-from sage.misc.lazy_import import lazy_import
 from sage.features.sat import Pycosat
+from sage.misc.lazy_import import lazy_import
+from sage.sat.solvers.satsolver import SatSolver
 
 lazy_import('pycosat', ['solve'], feature=Pycosat())
 

sage/sat/solvers/sat_lp.py

@@ -8,8 +8,8 @@ solves its instance using :class:`MixedIntegerLinearProgram`. Its performance
 can be expected to be slower than when using
 :class:`~sage.sat.solvers.cryptominisat.cryptominisat.CryptoMiniSat`.
 """
-from .satsolver import SatSolver
-from sage.numerical.mip import MixedIntegerLinearProgram, MIPSolverException
+from sage.numerical.mip import MIPSolverException, MixedIntegerLinearProgram
+from sage.sat.solvers.satsolver import SatSolver
 
 
 class SatLP(SatSolver):

passagemath_combinat-10.6.1.dist-info/top_level.txt

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