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

sage/combinat/words/word.py

@@ -9,7 +9,7 @@ AUTHORS:
 - Sébastien Labbé
 - Franco Saliola
 """
-#*****************************************************************************
+# ***************************************************************************
 #       Copyright (C) 2008 Arnaud Bergeron <abergeron@gmail.com>,
 #                          Amy Glen <amy.glen@gmail.com>,
 #                          Sébastien Labbé <slabqc@gmail.com>,
@@ -19,21 +19,21 @@ AUTHORS:
 # 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.
-#                  http://www.gnu.org/licenses/
-#*****************************************************************************
+#                  https://www.gnu.org/licenses/
+# ***************************************************************************
 from sage.misc.lazy_import import lazy_import
 from sage.combinat.words.word_char import WordDatatype_char
 from sage.combinat.words.abstract_word import Word_class
 from sage.combinat.words.finite_word import FiniteWord_class
 from sage.combinat.words.infinite_word import InfiniteWord_class
 from .word_datatypes import (WordDatatype_str,
-                            WordDatatype_list,
-                            WordDatatype_tuple)
+                             WordDatatype_list,
+                             WordDatatype_tuple)
 from .word_infinite_datatypes import (
-                            WordDatatype_iter_with_caching,
-                            WordDatatype_iter,
-                            WordDatatype_callable_with_caching,
-                            WordDatatype_callable)
+    WordDatatype_iter_with_caching,
+    WordDatatype_iter,
+    WordDatatype_callable_with_caching,
+    WordDatatype_callable)
 from .morphic import WordDatatype_morphic
 
 lazy_import('sage.monoids.free_monoid_element', 'FreeMonoidElement')
@@ -42,7 +42,8 @@ lazy_import('sage.monoids.free_monoid_element', 'FreeMonoidElement')
 # Word_class to Word and imbedding Word as its __call__ method.
 
 
-def Word(data=None, alphabet=None, length=None, datatype=None, caching=True, RSK_data=None):
+def Word(data=None, alphabet=None, length=None, datatype=None,
+         caching=True, RSK_data=None):
     r"""
     Construct a word.
 
@@ -192,18 +193,18 @@ def Word(data=None, alphabet=None, length=None, datatype=None, caching=True, RSK
         return data.to_word(alphabet)
 
     if RSK_data is not None:
-        #if a list of a semistandard and a standard tableau or a pair of lists
+        # if a list of a semistandard and a standard tableau or a pair of lists
         from sage.combinat.tableau import Tableau
         if isinstance(RSK_data, (tuple, list)) and len(RSK_data) == 2 and \
-            all(isinstance(x, Tableau) for x in RSK_data):
+                all(isinstance(x, Tableau) for x in RSK_data):
             from sage.combinat.rsk import RSK_inverse
             return RSK_inverse(*RSK_data, output='word')
         elif isinstance(RSK_data, (tuple, list)) and len(RSK_data) == 2 and \
-            all(isinstance(x, (list, tuple)) for x in RSK_data):
+                all(isinstance(x, (list, tuple)) for x in RSK_data):
             from sage.combinat.rsk import RSK_inverse
-            P,Q = map(Tableau, RSK_data)
+            P, Q = map(Tableau, RSK_data)
             return RSK_inverse(P, Q, 'word')
-        raise ValueError("Invalid input. Must be a pair of tableaux")
+        raise ValueError("input must be a pair of tableaux")
 
     # Create the parent object
     from .words import Words
@@ -217,7 +218,7 @@ def Word(data=None, alphabet=None, length=None, datatype=None, caching=True, RSK
 #                                                                     #
 #######################################################################
 
-##### Finite Words #####
+# #### Finite Words ####
 
 
 class FiniteWord_char(WordDatatype_char, FiniteWord_class):
@@ -486,7 +487,7 @@ class FiniteWord_callable(WordDatatype_callable, FiniteWord_class):
     pass
 
 
-##### Infinite Words #####
+# #### Infinite Words ####
 
 class InfiniteWord_iter_with_caching(WordDatatype_iter_with_caching, InfiniteWord_class):
     r"""
@@ -519,10 +520,16 @@ class InfiniteWord_iter_with_caching(WordDatatype_iter_with_caching, InfiniteWor
 
     Pickle is not supported for infinite word defined by an iterator::
 
-        sage: dumps(w)
-        Traceback (most recent call last):
-        ...
-        TypeError: can...t...pickle...generator...object...
+        sage: try:
+        ....:     dumps(w)
+        ....: except TypeError as e:
+        ....:     if "pickle" in str(e) and "generator" in str(e):
+        ....:         print("TypeError raised in dumps() as expected")
+        ....: except Exception as e:
+        ....:     print("Unexpected exception raised:", e)
+        ....: else:
+        ....:     print("No exception raised, unexpected")
+        TypeError raised in dumps() as expected
     """
     pass
 
@@ -558,10 +565,16 @@ class InfiniteWord_iter(WordDatatype_iter, InfiniteWord_class):
 
     Pickle is not supported for infinite word defined by an iterator::
 
-        sage: dumps(w)
-        Traceback (most recent call last):
-        ...
-        TypeError: can...t...pickle...generator...object...
+        sage: try:
+        ....:     dumps(w)
+        ....: except TypeError as e:
+        ....:     if "pickle" in str(e) and "generator" in str(e):
+        ....:         print("TypeError raised in dumps() as expected")
+        ....: except Exception as e:
+        ....:     print("Unexpected exception raised:", e)
+        ....: else:
+        ....:     print("No exception raised, unexpected")
+        TypeError raised in dumps() as expected
     """
     pass
 
@@ -629,7 +642,7 @@ class InfiniteWord_callable(WordDatatype_callable, InfiniteWord_class):
     pass
 
 
-##### Words of unknown length #####
+# #### Words of unknown length ####
 
 class Word_iter_with_caching(WordDatatype_iter_with_caching, Word_class):
     r"""
@@ -660,10 +673,16 @@ class Word_iter_with_caching(WordDatatype_iter_with_caching, Word_class):
 
     Pickle is not supported for word of unknown length defined by an iterator::
 
-        sage: dumps(w)
-        Traceback (most recent call last):
-        ...
-        TypeError: can...t...pickle...generator...object...
+        sage: try:
+        ....:     dumps(w)
+        ....: except TypeError as e:
+        ....:     if "pickle" in str(e) and "generator" in str(e):
+        ....:         print("TypeError raised in dumps() as expected")
+        ....: except Exception as e:
+        ....:     print("Unexpected exception raised:", e)
+        ....: else:
+        ....:     print("No exception raised, unexpected")
+        TypeError raised in dumps() as expected
     """
     pass
 
@@ -697,15 +716,21 @@ class Word_iter(WordDatatype_iter, Word_class):
 
     Pickle is not supported for word of unknown length defined by an iterator::
 
-        sage: dumps(w)
-        Traceback (most recent call last):
-        ...
-        TypeError: can...t...pickle...generator...object...
+        sage: try:
+        ....:     dumps(w)
+        ....: except TypeError as e:
+        ....:     if "pickle" in str(e) and "generator" in str(e):
+        ....:         print("TypeError raised in dumps() as expected")
+        ....: except Exception as e:
+        ....:     print("Unexpected exception raised:", e)
+        ....: else:
+        ....:     print("No exception raised, unexpected")
+        TypeError raised in dumps() as expected
     """
     pass
 
 
-##### Morphic Words #####
+# #### Morphic Words ####
 
 class FiniteWord_morphic(WordDatatype_morphic, FiniteWord_class):
     r"""

sage/combinat/words/word_char.pyx

@@ -444,22 +444,39 @@ cdef class WordDatatype_char(WordDatatype):
         TESTS:
 
             sage: W = Words(IntegerRange(0,255))
-            sage: W([0,1]) * W([2,0])
+            sage: W([0, 1]) * W([2, 0])
             word: 0120
 
-        The result is automatically converted to a WordDatatype_char. Currently we can
-        even do::
+        The result of a concatenation is always a WordDatatype_char. Currently there is no
+        check on the resulting parent and concatenation might lead to invalid words::
 
-            sage: w = W([0,1,2,3])
-            sage: w * [4,0,4,0]
-            word: 01234040
+            sage: W = Words([0, 1, 2, 3])
+            sage: w = W([0, 1, 2, 3, 2, 1, 0])
+            sage: w * [4, 0, 4, 0]
+            word: 01232104040
+            sage: (w * [4, 0, 4, 0]).parent()
+            Finite words over {0, 1, 2, 3}
+
+        TESTS:
+
+        Tests for :issue:`40690` and :issue:`41289`::
+
+            sage: W = Words([0,1])
+
+            sage: W([0]) + [0]
+            word: 00
+            sage: [0] + W([0])
+            word: 00
+
+            sage: W([0]) + W([1])**oo
+            word: 0111111111111111111111111111111111111111...
         """
         cdef WordDatatype_char w
 
         if isinstance(other, WordDatatype_char):
             return (<WordDatatype_char> self)._concatenate(other)
 
-        elif PySequence_Check(other):
+        elif isinstance(other, (tuple, list)):
             # we convert other to a WordDatatype_char and perform the concatenation
             w = (<WordDatatype_char> self)._new_c(NULL, 0, None)
             w._set_data(other)
@@ -469,6 +486,28 @@ cdef class WordDatatype_char(WordDatatype):
             from sage.combinat.words.finite_word import FiniteWord_class
             return FiniteWord_class.concatenate(self, other)
 
+    def __rmul__(self, other):
+        r"""
+        Return the concatenation ``other * self``.
+
+        TESTS:
+
+            sage: W = Words(IntegerRange(0,255))
+            sage: [1] * W([0])
+            word: 10
+        """
+        cdef WordDatatype_char w
+
+        if isinstance(other, (tuple, list)):
+            # we convert other to a WordDatatype_char and perform the concatenation
+            w = (<WordDatatype_char> self)._new_c(NULL, 0, None)
+            w._set_data(other)
+            return (<WordDatatype_char> w)._concatenate(self)
+
+        else:
+            from sage.combinat.words.finite_word import FiniteWord_class
+            return FiniteWord_class.concatenate(other, self)
+
     def __add__(self, other):
         r"""
         Concatenation (alias for ``*``).

sage/combinat/words/word_generators.py

@@ -224,7 +224,7 @@ class LowerChristoffelWord(FiniteWord_list):
                     v = u * (cf[i]-1) + v
                 w = u + v
         else:
-            raise ValueError('Unknown algorithm (=%s)' % algorithm)
+            raise ValueError(f'unknown algorithm (={algorithm})')
         super().__init__(FiniteWords(alphabet), w)
         self.__p = p
         self.__q = q
@@ -250,11 +250,11 @@ class LowerChristoffelWord(FiniteWord_list):
             True
         """
         from sage.matrix.constructor import matrix
-        eta = {0:matrix(2,[2,1,1,1]), 1:matrix(2,[5,2,2,1])}
-        M = matrix(2,[1,0,0,1])
+        eta = {0: matrix(2, [2, 1, 1, 1]), 1: matrix(2, [5, 2, 2, 1])}
+        M = matrix(2, [1, 0, 0, 1])
         for a in self:
             M *= eta[a]
-        return M.trace()/3
+        return M.trace() / 3
 
     def standard_factorization(self):
         r"""
@@ -299,8 +299,8 @@ class LowerChristoffelWord(FiniteWord_list):
         w11 = w1.number_of_letter_occurrences(1)
         w20 = w2.number_of_letter_occurrences(0)
         w21 = w2.number_of_letter_occurrences(1)
-        return Factorization([LowerChristoffelWord(w11,w10),
-                              LowerChristoffelWord(w21,w20)])
+        return Factorization([LowerChristoffelWord(w11, w10),
+                              LowerChristoffelWord(w21, w20)])
 
     def __reduce__(self):
         r"""
@@ -568,27 +568,28 @@ class WordGenerator:
         alphabet = W.alphabet()
         if alphabet.cardinality() != 2:
             raise TypeError("alphabet does not contain two distinct elements")
-        a,b = alphabet
+        a, b = alphabet
 
         if construction_method == "recursive":
             w = W(self._FibonacciWord_RecursiveConstructionIterator(alphabet),
                   datatype='iter')
             return w
 
-        elif construction_method in ("fixed point", "fixed_point"):
-            d = {b:[a],a:[a,b]}
+        if construction_method in ("fixed point", "fixed_point"):
+            d = {b: [a], a: [a, b]}
             w = self.FixedPointOfMorphism(d, a)
             return w
 
-        elif construction_method == "function":
+        if construction_method == "function":
             from sage.functions.other import floor
             from sage.misc.functional import sqrt
-            phi = (1 + sqrt(5))/2 # the golden ratio
-            f = lambda n:a if floor((n+2)*phi) - floor((n+1)*phi) == 2 else b
+            phi = (1 + sqrt(5))/2  # the golden ratio
+
+            def f(n):
+                return a if floor((n+2)*phi) - floor((n+1)*phi) == 2 else b
             return W(f)
 
-        else:
-            raise NotImplementedError
+        raise NotImplementedError
 
     def _FibonacciWord_RecursiveConstructionIterator(self, alphabet=(0, 1)):
         r"""
@@ -606,7 +607,7 @@ class WordGenerator:
             [0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1]
         """
         Fib0 = [0]
-        Fib1 = [0,1]
+        Fib1 = [0, 1]
         n = 0
         while True:
             it = iter(Fib1[n:])
@@ -691,9 +692,9 @@ class WordGenerator:
         if len(set(alphabet)) != 2:
             raise TypeError("alphabet does not contain two distinct elements")
         from functools import partial
-        f = partial(self._CodingOfRotationWord_function,alpha=alpha,beta=beta,x=x,alphabet=alphabet)
-        w = InfiniteWords(alphabet)(f, datatype='callable')
-        return w
+        f = partial(self._CodingOfRotationWord_function,
+                    alpha=alpha, beta=beta, x=x, alphabet=alphabet)
+        return InfiniteWords(alphabet)(f, datatype='callable')
 
     def _CodingOfRotationWord_function(self, n, alpha, beta, x=0, alphabet=(0, 1)):
         r"""
@@ -897,7 +898,7 @@ class WordGenerator:
         else:
             raise TypeError("slope (=%s) must be a real number" % slope +
                             "or an iterable")
-        w = parent(self._CharacteristicSturmianWord_LetterIterator(cf,alphabet),
+        w = parent(self._CharacteristicSturmianWord_LetterIterator(cf, alphabet),
                    datatype='iter')
         return w
 
@@ -1383,8 +1384,8 @@ class WordGenerator:
         if alphabet is None:
             alphabet = list(range(m))
         if len(set(alphabet)) != m:
-            raise TypeError("alphabet does not contain %s distinct elements" % m)
-        return FiniteWords(alphabet)([alphabet[randint(0,m-1)] for i in range(n)])
+            raise TypeError(f"alphabet does not contain {m} distinct elements")
+        return FiniteWords(alphabet)([alphabet[randint(0, m - 1)] for i in range(n)])
 
     LowerChristoffelWord = LowerChristoffelWord
 
@@ -1482,8 +1483,8 @@ class WordGenerator:
         [BmBGL09]_
         """
         from sage.combinat.words.morphism import WordMorphism
-        W = FiniteWords([0,1,2,3])
-        bar = WordMorphism({0:0,1:3,3:1,2:2},codomain=W)
+        W = FiniteWords([0, 1, 2, 3])
+        bar = WordMorphism({0: 0, 1: 3, 3: 1, 2: 2}, codomain=W)
         if n == 0:
             a = [] if q_0 is None else [q_0]
             return W(a)
@@ -1491,12 +1492,12 @@ class WordGenerator:
             b = [] if q_1 is None else [q_1]
             return W(b)
         elif n % 3 == 2:
-            u = self._fibonacci_tile(n-1,q_0,q_1)
-            v = self._fibonacci_tile(n-2,q_0,q_1)
+            u = self._fibonacci_tile(n - 1, q_0, q_1)
+            v = self._fibonacci_tile(n - 2, q_0, q_1)
             return u * v
         else:
-            u = self._fibonacci_tile(n-1,q_0,q_1)
-            v = bar(self._fibonacci_tile(n-2,q_0,q_1))
+            u = self._fibonacci_tile(n - 1, q_0, q_1)
+            v = bar(self._fibonacci_tile(n - 2, q_0, q_1))
             return u * v
 
     def fibonacci_tile(self, n):
@@ -1513,8 +1514,8 @@ class WordGenerator:
         w = self._fibonacci_tile(3*n+1)
         w = w**4
         from sage.combinat.words.paths import WordPaths
-        P = WordPaths([0,1,2,3])
-        l = list(w.partial_sums(start=3,mod=4))
+        P = WordPaths([0, 1, 2, 3])
+        l = list(w.partial_sums(start=3, mod=4))
         return P(l)[:-1]
 
     def dual_fibonacci_tile(self, n):
@@ -1529,11 +1530,11 @@ class WordGenerator:
             Path: 3212303230103230321232101232123032123210...
             Path: 3212303230103230321232101232123032123210...
         """
-        w = self._fibonacci_tile(3*n+1,3,3)
+        w = self._fibonacci_tile(3*n+1, 3, 3)
         w = w**4
         from sage.combinat.words.paths import WordPaths
-        P = WordPaths([0,1,2,3])
-        l = list(w.partial_sums(start=3,mod=4))
+        P = WordPaths([0, 1, 2, 3])
+        l = list(w.partial_sums(start=3, mod=4))
         return P(l)[:-1]
 
     def _s_adic_iterator(self, sequence, letters):
@@ -1622,17 +1623,17 @@ class WordGenerator:
         - Sébastien Labbé (2009-12-18): initial version
         """
         from itertools import tee
-        sequence_it,sequence = tee(sequence)
+        sequence_it, sequence = tee(sequence)
         m = next(sequence_it)
         codomain = m.codomain()
         p = codomain.identity_morphism()
-        letters_it,letters = tee(letters)
+        letters_it, letters = tee(letters)
         precedent_letter = m(next(letters_it))[0]
 
         yield precedent_letter
-        for (i,(m,a)) in enumerate(zip(sequence, letters)):
+        for (i, (m, a)) in enumerate(zip(sequence, letters)):
             if not precedent_letter == m(a)[0]:
-                raise ValueError("the hypothesis of the algorithm used is not satisfied; the image of the %s-th letter (=%s) under the %s-th morphism (=%s) should start with the %s-th letter (=%s)" % (i+1,a,i+1,m,i,precedent_letter))
+                raise ValueError("the hypothesis of the algorithm used is not satisfied; the image of the %s-th letter (=%s) under the %s-th morphism (=%s) should start with the %s-th letter (=%s)" % (i+1, a, i+1, m, i, precedent_letter))
             w = p(m(a)[1:])
             yield from w
             p = p * m
@@ -1881,7 +1882,7 @@ class WordGenerator:
             raise TypeError("morphisms (=%s) must be None, callable or provide a __getitem__ method" % morphisms)
 
         from sage.combinat.words.word import FiniteWord_class
-        if isinstance(sequence,(tuple,list,str,FiniteWord_class)) \
+        if isinstance(sequence, (tuple, list, str, FiniteWord_class)) \
         and hasattr(letters, "__len__") and len(letters) == 1:
             from sage.misc.misc_c import prod
             return prod(seq)(letters)
@@ -1895,7 +1896,7 @@ class WordGenerator:
         kwds['data'] = self._s_adic_iterator(seq, letters)
         kwds['datatype'] = 'iter'
         kwds['caching'] = True
-        #kwds['check'] = False
+        # kwds['check'] = False
         return W.shift()(**kwds)
 
     def PalindromicDefectWord(self, k=1, alphabet='ab'):