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

sage/databases/findstat.py

@@ -200,6 +200,7 @@ AUTHORS:
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
 from sage.misc.lazy_list import lazy_list
+from sage.misc.lazy_attribute import lazy_attribute
 from sage.misc.inherit_comparison import InheritComparisonClasscallMetaclass
 from sage.structure.element import Element
 from sage.structure.parent import Parent
@@ -633,7 +634,7 @@ def _data_from_iterable(iterable, mapping=False, domain=None,
             pre_data = [(elts, vals)]
 
     # pre_data is a list of all elements of the iterator accessed so
-    # far, for each of its elements and also the remainder ot the
+    # far, for each of its elements and also the remainder of the
     # iterator, each element is either a pair ``(object, value)`` or
     # a pair ``(objects, values)``
     elts, vals = pre_data[0]
@@ -732,16 +733,15 @@ def _data_from_data(data, max_values):
           [0, 0, 1, 1, 2, 2, 1, 0, 0, 0, 1, 1, 1, 2, 3])]
     """
     query = []
-    total = min(max_values, FINDSTAT_MAX_VALUES)
     iterator = iter(data)
-    while total > 0:
+    while max_values > 0:
         try:
             elts, vals = next(iterator)
         except StopIteration:
             break
-        if total >= len(elts):
+        if max_values >= len(elts):
             query.append((elts, vals))
-            total -= len(elts)
+            max_values -= len(elts)
         else:
             break # assuming that the next pair is even larger
 
@@ -1019,12 +1019,12 @@ def findstat(query=None, values=None, distribution=None, domain=None,
         sage: findstat("Permutations", lambda x: 1, depth='x')                  # optional -- internet
         Traceback (most recent call last):
         ...
-        ValueError: E021: Depth should be a nonnegative integer at most 9, but is x.
+        ValueError: E021: Depth should be a non-negative integer at most 9, but is x.
 
         sage: findstat("Permutations", lambda x: 1, depth=100)                  # optional -- internet
         Traceback (most recent call last):
         ...
-        ValueError: E021: Depth should be a nonnegative integer at most 9, but is 100.
+        ValueError: E021: Depth should be a non-negative integer at most 9, but is 100.
 
         sage: S = Permutation
         sage: findstat([(S([1,2]), 1), ([S([1,3,2]), S([1,2])], [2,3])])        # optional -- internet
@@ -1788,10 +1788,10 @@ class FindStatFunction(SageObject):
         EXAMPLES::
 
             sage: q = findstat([(d, randint(1,1000)) for d in DyckWords(4)])              # optional -- internet
-            sage: q.set_sage_code("def statistic(x):\n    return randint(1, 1000)")        # optional -- internet
+            sage: q.set_sage_code("def statistic(x):\n    return randint(1, 1000)")       # optional -- internet
             sage: print(q.sage_code())                                                    # optional -- internet
             def statistic(x):
-                return randint(1,1000)
+                return randint(1, 1000)
         """
         if value != self.sage_code():
             self._modified = True
@@ -1820,9 +1820,22 @@ class FindStatCombinatorialStatistic(SageObject):
             sage: FindStatCombinatorialStatistic()
             <sage.databases.findstat.FindStatCombinatorialStatistic object at 0x...>
         """
-        self._first_terms_cache = None
         self._first_terms_raw_cache = None
 
+    @lazy_attribute
+    def _first_terms_cache(self):
+        """
+        Return the first terms of the (compound) statistic as a
+        dictionary.
+
+        EXAMPLES::
+
+            sage: findstat(41)._first_terms_cache[PerfectMatching([(1,6),(2,5),(3,4)])]   # optional -- internet
+            3
+        """
+        # this indirectly initializes self._first_terms_raw_cache
+        return dict(self._fetch_first_terms())
+
     def first_terms(self):
         r"""
         Return the first terms of the (compound) statistic as a
@@ -1840,10 +1853,6 @@ class FindStatCombinatorialStatistic(SageObject):
             sage: findstat(41).first_terms()[PerfectMatching([(1,6),(2,5),(3,4)])]        # optional -- internet
             3
         """
-        # initialize self._first_terms_cache and
-        # self._first_terms_raw_cache on first call
-        if self._first_terms_cache is None:
-            self._first_terms_cache = self._fetch_first_terms()
         # a shallow copy suffices - tuples are immutable
         return dict(self._first_terms_cache)
 
@@ -1946,7 +1955,7 @@ class FindStatCombinatorialStatistic(SageObject):
         domain = self.domain()
         levels_with_sizes = domain.levels_with_sizes()
         total = 0
-        for elt, val in self.first_terms().items():
+        for elt, val in self._first_terms_cache.items():
             if total == max_values:
                 break
             lvl = domain.element_level(elt)
@@ -2155,7 +2164,7 @@ class FindStatStatistic(Element,
             sage: q(graphs.PetersenGraph().copy(immutable=True))                # optional -- internet
             2
         """
-        val = self.first_terms().get(elt, None)
+        val = self._first_terms_cache.get(elt, None)
         if val is None:
             return FindStatFunction.__call__(self, elt)
         return val
@@ -2269,12 +2278,22 @@ class FindStatStatistic(Element,
             [(1, 4), (2, 3)] => 3
             sage: s.reset()                                                     # optional -- internet
         """
-        to_str = self.domain().to_string()
+        domain = self.domain()
+        from_str = domain.from_string()
+        to_str = domain.to_string()
+
+        def to_domain(elt):
+            if domain.is_element(elt):
+                return elt
+            if not isinstance(elt, str):
+                elt = str(elt)
+            return from_str(elt)
+
         new = [(to_str(obj), value) for obj, value in values]
         if sorted(new) != sorted(self.first_terms_str()):
             self._modified = True
             self._first_terms_raw_cache = new
-            self._first_terms_cache = values
+            self._first_terms_cache = {to_domain(elt): v for elt, v in values}
 
     def code(self):
         r"""
@@ -2586,6 +2605,7 @@ class FindStatStatisticQuery(FindStatStatistic):
             self._known_terms = data
         else:
             self._known_terms = known_terms
+        self._known_terms_number = 0
         self._values_of = None
         self._distribution_of = None
         self._depth = depth
@@ -2649,9 +2669,26 @@ class FindStatStatisticQuery(FindStatStatistic):
                                   function=function)
         Element.__init__(self, FindStatStatistics()) # this is not completely correct, but it works
 
+    @lazy_attribute
+    def _first_terms_cache(self):
+        """
+        Return the pairs of the known terms which contain
+        singletons, as a dictionary.
+
+        EXAMPLES::
+
+             sage: PM = PerfectMatchings
+             sage: l = [(PM(2*n), [m.number_of_nestings() for m in PM(2*n)]) for n in range(5)]
+             sage: r = findstat(l, depth=0)                                     # optional -- internet
+             sage: r._first_terms_cache                                         # optional -- internet
+             {}
+        """
+        return dict()
+
     def first_terms(self, max_values=FINDSTAT_MAX_SUBMISSION_VALUES):
         """
-        Return the pairs of the known terms which contain singletons as a dictionary.
+        Return the pairs of the known terms which contain
+        singletons, as a dictionary.
 
         EXAMPLES::
 
@@ -2662,10 +2699,14 @@ class FindStatStatisticQuery(FindStatStatistic):
              1: St000042 (quality [99, 100])
              sage: r.first_terms()                                              # optional -- internet
              {[]: 0, [(1, 2)]: 0}
+
         """
-        return dict(itertools.islice(((objs[0], vals[0])
-                                      for objs, vals in self._known_terms
-                                      if len(vals) == 1), max_values))
+        new_terms = self._known_terms[self._known_terms_number:max_values]
+        self._first_terms_cache.update((objs[0], vals[0])
+                                       for objs, vals in new_terms
+                                       if len(vals) == 1)
+        self._known_terms_number = max(max_values, self._known_terms_number)
+        return dict(self._first_terms_cache)
 
     def _first_terms_raw(self, max_values):
         """
@@ -2804,7 +2845,7 @@ class FindStatCompoundStatistic(Element, FindStatCombinatorialStatistic):
         FindStatCombinatorialStatistic.__init__(self)
         Element.__init__(self, FindStatStatistics()) # this is not completely correct, but it works
 
-    def _fetch_first_terms_raw(self):
+    def _fetch_first_terms_raw(self) -> list:
         r"""
         Return the first terms of the compound statistic, as ``(string,
         value)`` pairs, fetched from FindStat.
@@ -2819,7 +2860,7 @@ class FindStatCompoundStatistic(Element, FindStatCombinatorialStatistic):
         """
         fields = "Values"
         url = FINDSTAT_API_STATISTICS + self.id_str() + "?fields=" + fields
-        if len(self._maps):
+        if self._maps:
             values = _get_json(url)["included"]["CompoundStatistics"][self.id_str()]["Values"]
         else:
             values = _get_json(url)["included"]["Statistics"][self.id_str()]["Values"]
@@ -2853,7 +2894,7 @@ class FindStatCompoundStatistic(Element, FindStatCombinatorialStatistic):
         """
         return self.statistic()(self.compound_map()(elt))
 
-    def id_str(self):
+    def id_str(self) -> str:
         """
         Return the padded identifier of the compound statistic.
 
@@ -2864,7 +2905,7 @@ class FindStatCompoundStatistic(Element, FindStatCombinatorialStatistic):
         """
         return self._id
 
-    def _repr_(self):
+    def _repr_(self) -> str:
         """
         Return a string representation of the compound statistic.
 
@@ -3823,7 +3864,7 @@ class FindStatCompoundMap(Element, FindStatCombinatorialMap):
                 Mp00099: bounce path: Dyck paths -> Dyck paths
         """
         for mp in self:
-                mp.info()
+            mp.info()
 
 
 class FindStatMatchingMap(FindStatCompoundMap):
@@ -4524,7 +4565,7 @@ _SupportedFindStatCollections = {
     _SupportedFindStatCollection(lambda x: BinaryTree(str(x)),
                                  str,
                                  BinaryTrees,
-                                 lambda x: x.node_number(),
+                                 lambda x: x.number_of_nodes(),
                                  lambda x: isinstance(x, BinaryTree)),
     "Cores":
     _SupportedFindStatCollection(lambda x: Core(*literal_eval(x)),
@@ -4557,9 +4598,9 @@ _SupportedFindStatCollections = {
     _SupportedFindStatCollection(lambda x: (lambda E, V: Graph([list(range(V)),
                                                                 lambda i,j: (i,j) in E or (j,i) in E],
                                                                immutable=True))(*literal_eval(x)),
-                                 lambda X: str((X.edges(labels=False, sort=True), X.num_verts())),
+                                 lambda X: str((X.edges(labels=False, sort=True), X.n_vertices())),
                                  lambda x: (g.copy(immutable=True) for g in graphs(x, copy=False)),
-                                 lambda x: x.num_verts(),
+                                 lambda x: x.n_vertices(),
                                  lambda x: isinstance(x, Graph)),
     "IntegerPartitions":
     _SupportedFindStatCollection(lambda x: Partition(literal_eval(x)),
@@ -4577,7 +4618,7 @@ _SupportedFindStatCollections = {
     _SupportedFindStatCollection(lambda x: OrderedTree(literal_eval(x)),
                                  str,
                                  OrderedTrees,
-                                 lambda x: x.node_number(),
+                                 lambda x: x.number_of_nodes(),
                                  lambda x: isinstance(x, OrderedTree)),
     "ParkingFunctions":
     _SupportedFindStatCollection(lambda x: ParkingFunction(literal_eval(x)),

sage/databases/oeis.py

@@ -134,7 +134,6 @@ AUTHORS:
 
 import re
 from collections import defaultdict
-from ssl import create_default_context as default_context
 from urllib.parse import urlencode
 # ****************************************************************************
 #       Copyright (C) 2012 Thierry Monteil <sage!lma.metelu.net>
@@ -148,7 +147,6 @@ from urllib.request import urlopen, Request
 
 from sage.version import version
 from sage.cpython.string import bytes_to_str
-from sage.misc.cachefunc import cached_method
 from sage.misc.flatten import flatten
 from sage.misc.html import HtmlFragment
 from sage.misc.temporary_file import tmp_filename
@@ -156,13 +154,16 @@ from sage.misc.unknown import Unknown
 from sage.misc.verbose import verbose
 from sage.repl.preparse import preparse
 from sage.rings.integer import Integer
+from sage.rings.integer_ring import ZZ
+from sage.rings.infinity import infinity
+from sage.structure.global_options import GlobalOptions
 from sage.structure.sage_object import SageObject
 from sage.structure.unique_representation import UniqueRepresentation
 
 oeis_url = 'https://oeis.org/'
 
 
-def _fetch(url):
+def _fetch(url) -> str:
     r"""
     Fetch the given ``url``.
 
@@ -186,7 +187,7 @@ def _fetch(url):
         raise OSError("%s\nerror fetching %s" % (msg, url))
 
 
-def _urls(html_string):
+def _urls(html_string) -> list[str]:
     r"""
     Return the list of URLs contained in ``html_string``.
 
@@ -219,7 +220,7 @@ def _urls(html_string):
     return urls
 
 
-def to_tuple(string):
+def to_tuple(string: str) -> tuple:
     """
     Convert a string to a tuple of integers.
 
@@ -247,15 +248,17 @@ class OEIS:
       - a list representing a sequence of integers.
       - a string, representing a text search.
 
-    - ``max_results`` -- (integer, default: 30) the maximum number of
+    - ``max_results`` -- integer (default: 3); the maximum number of
       results to return, they are sorted according to their relevance. In
       any cases, the OEIS website will never provide more than 100 results.
 
-    - ``first_result`` -- (integer, default: 0) allow to skip the
+    - ``first_result`` -- integer (default: 0); allow to skip the
       ``first_result`` first results in the search, to go further.
       This is useful if you are looking for a sequence that may appear
       after the 100 first found sequences.
 
+    ``max_results`` can also be set using :meth:`options`.
+
     OUTPUT:
 
     - if ``query`` is an integer or an OEIS ID (e.g. 'A000045'), returns
@@ -362,8 +365,7 @@ class OEIS:
         sage: oeis('A000045')  # optional -- internet
         A000045: Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1.
     """
-
-    def __call__(self, query, max_results=3, first_result=0):
+    def __call__(self, query, max_results=None, first_result=0):
         r"""
         See the documentation of :class:`OEIS`.
 
@@ -384,6 +386,46 @@ class OEIS:
         elif isinstance(query, (list, tuple)):
             return self.find_by_subsequence(query, max_results, first_result)
 
+    class options(GlobalOptions):
+        r"""
+        Set and display the options for the OEIS.
+
+        If no parameters are set, then the function returns a copy of
+        the options dictionary.
+
+        The ``options`` can be accessed as using
+        :class:`oeis.options`.
+
+        @OPTIONS@
+
+        EXAMPLES::
+
+            sage: oeis.options
+            Current options for OEIS
+              - fetch_b_file: False
+              - max_results:  3
+
+            sage: oeis.options.max_results = 5
+            sage: oeis('beaver')                        # optional -- internet
+            0: A...: ...eaver...
+            1: A...: ...eaver...
+            2: A...: ...eaver...
+            3: A...: ...eaver...
+            4: A...: ...eaver...
+
+            sage: oeis.options._reset()
+            sage: oeis.options.max_results
+            3
+        """
+        NAME = 'OEIS'
+        module = 'sage.databases.oeis'
+        max_results = dict(default=3,
+                           description='the maximum number of results to return',
+                           checker=lambda x: x in ZZ and x > 0)
+        fetch_b_file = dict(default=False,
+                            description='whether to fetch terms from the b-file by default',
+                            checker=lambda x: isinstance(x, bool))
+
     def __repr__(self) -> str:
         r"""
         Return the representation of ``self``.
@@ -441,7 +483,7 @@ class OEIS:
         sequence._raw = entry
         return sequence
 
-    def find_by_description(self, description, max_results=3, first_result=0):
+    def find_by_description(self, description, max_results=None, first_result=0):
         r"""
         Search for OEIS sequences corresponding to the description.
 
@@ -449,11 +491,11 @@ class OEIS:
 
         - ``description`` -- string; the description the searched sequences
 
-        - ``max_results`` -- (integer, default: 3) the maximum number of results
+        - ``max_results`` -- integer (default: 3); the maximum number of results
           we want. In any case, the on-line encyclopedia will not return more
           than 100 results.
 
-        - ``first_result`` -- (integer, default: 0) allow to skip the
+        - ``first_result`` -- integer (default: 0); allow to skip the
           ``first_result`` first results in the search, to go further.
           This is useful if you are looking for a sequence that may appear
           after the 100 first found sequences.
@@ -484,7 +526,19 @@ class OEIS:
             1: A...: ...eaver...
             2: A...: ...eaver...
             3: A...: ...eaver...
+
+        Alternatively, we can also set the global option `max_results`::
+
+            sage: oeis.options.max_results = 5
+            sage: oeis('beaver')                        # optional -- internet
+            0: A...: ...eaver...
+            1: A...: ...eaver...
+            2: A...: ...eaver...
+            3: A...: ...eaver...
+            4: A...: ...eaver...
         """
+        if max_results is None:
+            max_results = self.options['max_results']
         options = {'q': description,
                    'n': str(max_results),
                    'fmt': 'text',
@@ -494,7 +548,7 @@ class OEIS:
         T = [self.find_by_entry(entry=s) for s in sequence_list]
         return FancyTuple([s for s in T if not s.is_dead()])
 
-    def find_by_subsequence(self, subsequence, max_results=3, first_result=0):
+    def find_by_subsequence(self, subsequence, max_results=None, first_result=0):
         r"""
         Search for OEIS sequences containing the given subsequence.
 
@@ -690,7 +744,7 @@ class OEISSequence(SageObject, UniqueRepresentation):
 
     def online_update(self):
         r"""
-        Fetch the online OEIS to update the informations about this sequence.
+        Fetch the sequence from the OEIS.
 
         TESTS::
 
@@ -1206,15 +1260,17 @@ class OEISSequence(SageObject, UniqueRepresentation):
         else:
             return Unknown
 
-    @cached_method
     def first_terms(self, number=None):
         r"""
+        Return the first few terms of the sequence.
 
         INPUT:
 
-        - ``number`` -- integer or ``None`` (default); the number of
-          terms returned (if less than the number of available terms). When set
-          to ``None``, returns all the known terms.
+        - ``number`` -- integer, ``infinity`` or ``None`` (default);
+          the number of terms returned.  When set to ``None``,
+          returns all the known terms.  When set to an integer larger
+          than the number of terms in the internal format, or to
+          ``infinity``, the b-file is fetched.
 
         OUTPUT: tuple of integers
 
@@ -1238,9 +1294,54 @@ class OEISSequence(SageObject, UniqueRepresentation):
             (1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1)
             sage: s.first_terms(5)
             (1, 1, 1, 1, 2)
+
+            sage: len(oeis(45).first_terms())          # optional -- internet
+            41
+            sage: len(oeis(45).first_terms(oo))        # optional -- internet
+            2001
+
+            sage: len(oeis(1).first_terms())           # optional -- internet
+            94
+
+            sage: oeis.options.fetch_b_file = True
+            sage: len(oeis(1).first_terms())           # optional -- internet
+            2048
+            sage: oeis.options._reset()
         """
-        fields = ['S', 'T', 'U']
-        return to_tuple(" ".join(flatten([self._field(a) for a in fields])))[:number]
+        def fetch_b_file():
+            url = oeis_url + f"b{self.id(format='int')}.txt"
+            terms = _fetch(url)
+            first_terms = tuple()
+            check = None
+            for term in terms.split('\n'):
+                if not term or term[0] == '#':
+                    continue
+                k, v = (Integer(e) for e in term.strip().split())
+                if check is not None and k != check + 1:
+                    raise ValueError(f"malformed b-file {url}: key {check} followed by {k}")
+                check = k
+                first_terms += (v,)
+            self._first_terms = True, first_terms
+
+        if ((number is infinity or oeis.options['fetch_b_file'])
+            and self is not oeis._imaginary_sequence()):  # all other sequences have a b-file
+            # self._first_terms is a pair (all?, first_terms)
+            if not hasattr(self, "_first_terms") or not self._first_terms[0]:
+                fetch_b_file()
+            return self._first_terms[1]
+
+        if not hasattr(self, "_first_terms"):
+            fields = ['S', 'T', 'U']
+            first_terms = to_tuple(" ".join(flatten([self._field(a) for a in fields])))
+            self._first_terms = (False, first_terms)
+
+        if number is None:
+            return self._first_terms[1]
+
+        if number > len(self._first_terms[1]) and not self._first_terms[0]:
+            fetch_b_file()
+
+        return self._first_terms[1][:number]
 
     def _repr_(self):
         r"""
@@ -1756,8 +1857,7 @@ class OEISSequence(SageObject, UniqueRepresentation):
             https://oeis.org/A012345
             <BLANKLINE>
             AUTHOR
-            Patrick Demichel (patrick.demichel(AT)hp.com)
-            <BLANKLINE>
+            ...
 
         TESTS::
 
@@ -1931,7 +2031,7 @@ class OEISSequence(SageObject, UniqueRepresentation):
             return sorted(table)
         return sorted(prog for la, prog in table if la == language)
 
-    def test_compile_sage_code(self):
+    def check_compile_sage_code(self):
         """
         Try to compile the extracted sage code, if there is any.
 
@@ -1947,13 +2047,13 @@ class OEISSequence(SageObject, UniqueRepresentation):
         One correct sequence::
 
             sage: s = oeis.find_by_id('A027642')        # optional -- internet
-            sage: s.test_compile_sage_code()            # optional -- internet
+            sage: s.check_compile_sage_code()            # optional -- internet
             True
 
         One dead sequence::
 
             sage: s = oeis.find_by_id('A000154')        # optional -- internet
-            sage: s.test_compile_sage_code()            # optional -- internet
+            sage: s.check_compile_sage_code()            # optional -- internet
             True
         """
         if self.is_dead():

sage/databases/sloane.py

@@ -1,4 +1,5 @@
 # sage_setup: distribution = sagemath-combinat
+# sage.doctest: needs sloane_database
 """
 Local copy of the On-Line Encyclopedia of Integer Sequences
 
@@ -12,21 +13,21 @@ To look up a sequence, type
 
 ::
 
-    sage: SloaneEncyclopedia[60843]  # optional - sloane_database
+    sage: SloaneEncyclopedia[60843]
     [1, 6, 21, 107, 47176870]
 
 To get the name of a sequence, type
 
 ::
 
-    sage: SloaneEncyclopedia.sequence_name(1)  # optional - sloane_database
+    sage: SloaneEncyclopedia.sequence_name(1)
     'Number of groups of order n.'
 
 To search locally for a particular subsequence, type
 
 ::
 
-    sage: SloaneEncyclopedia.find([1,2,3,4,5], 1)    # optional - sloane_database
+    sage: SloaneEncyclopedia.find([1,2,3,4,5], 1)
     [(15, [1, 2, 3, 4, 5, 7, 7, 8, 9, 11, 11, 13, 13, 16, 16, 16, 17, 19, 19, 23, 23, 23, 23, 25, 25, 27, 27, 29, 29, 31, 31, 32, 37, 37, 37, 37, 37, 41, 41, 41, 41, 43, 43, 47, 47, 47, 47, 49, 49, 53, 53, 53, 53, 59, 59, 59, 59, 59, 59, 61, 61, 64, 64, 64, 67, 67, 67, 71, 71, 71, 71, 73])]
 
 The default maximum number of results is 30, but to return up to
@@ -34,7 +35,7 @@ The default maximum number of results is 30, but to return up to
 
 ::
 
-    sage: SloaneEncyclopedia.find([1,2,3,4,5], 100)  # optional - sloane_database
+    sage: SloaneEncyclopedia.find([1,2,3,4,5], 100)
     [(15, [1, 2, 3, 4, 5, 7, 7, 8, 9, 11, 11, ...
 
 Results in either case are of the form [ (number, list) ].
@@ -88,7 +89,7 @@ from urllib.request import urlretrieve
 import ssl
 
 from sage.misc.verbose import verbose
-from sage.env import SAGE_SHARE
+from sage.env import DOT_SAGE, sage_data_paths
 from sage.rings.integer_ring import ZZ
 
 
@@ -102,7 +103,12 @@ class SloaneEncyclopediaClass:
         """
         Initialize the database but do not load any of the data.
         """
-        self.__path__ = os.path.join(SAGE_SHARE, 'sloane')
+        self.__path__ = os.path.join(DOT_SAGE, 'db', 'sloane')
+        for path in sage_data_paths('sloane'):
+            file_oeis = os.path.join(path, 'sloane-oeis.bz2')
+            file_names = os.path.join(path, 'sloane-names.bz2')
+            if os.path.exists(file_oeis) and os.path.exists(file_names):
+                self.__path__ = path
         self.__file__ = os.path.join(self.__path__, 'sloane-oeis.bz2')
         self.__file_names__ = os.path.join(self.__path__, 'sloane-names.bz2')
         self.__loaded__ = False
@@ -156,7 +162,7 @@ class SloaneEncyclopediaClass:
 
         EXAMPLES::
 
-            sage: SloaneEncyclopedia.is_installed()  # optional - sloane_database
+            sage: SloaneEncyclopedia.is_installed()
             True
         """
         return os.path.exists(self.__file__) and os.path.exists(self.__file_names__)
@@ -334,7 +340,7 @@ class SloaneEncyclopediaClass:
 
         EXAMPLES::
 
-            sage: SloaneEncyclopedia.sequence_name(1) # optional - sloane_database
+            sage: SloaneEncyclopedia.sequence_name(1)
             'Number of groups of order n.'
         """
         self.load()

sage/groups/indexed_free_group.py

@@ -281,7 +281,7 @@ class IndexedFreeGroup(IndexedGroup, Group):
             return self.__class__(self.parent(),
                    tuple((x[0], -x[1]) for x in reversed(self._monomial)))
 
-        def to_word_list(self):
+        def to_word_list(self) -> list[tuple]:
             """
             Return ``self`` as a word represented as a list whose entries
             are the pairs ``(i, s)`` where ``i`` is the index and ``s`` is
@@ -295,9 +295,8 @@ class IndexedFreeGroup(IndexedGroup, Group):
                 sage: x.to_word_list()
                 [(0, 1), (1, 1), (1, 1), (4, 1), (0, -1)]
             """
-            sign = lambda x: 1 if x > 0 else -1 # It is never 0
-            return [ (k, sign(e)) for k,e in self._sorted_items()
-                     for dummy in range(abs(e))]
+            return [(k, 1 if e > 0 else -1) for k, e in self._sorted_items()
+                    for dummy in range(abs(e))]
 
 
 class IndexedFreeAbelianGroup(IndexedGroup, AbelianGroup):

sage/libs/symmetrica/symmetrica.pxi

@@ -527,6 +527,7 @@ def test_integer(object x):
 
     EXAMPLES::
 
+        sage: import sage.libs.symmetrica.all
         sage: from sage.libs.symmetrica.symmetrica import test_integer
         sage: test_integer(1)
         1