passagemath-objects 10.6.31__tar.gz → 10.6.31rc2__tar.gz

{passagemath_objects-10.6.31 → passagemath_objects-10.6.31rc2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-objects
-Version: 10.6.31
+Version: 10.6.31rc2
 Summary: passagemath: Sage objects, elements, parents, categories, coercion, metaclasses
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -27,7 +27,7 @@ Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Mathematics
-Requires-Python: <3.15,>=3.10
+Requires-Python: <3.14,>=3.10
 Description-Content-Type: text/x-rst
 Requires-Dist: gmpy2~=2.1.b999
 Requires-Dist: cysignals<1.12.4; sys_platform == "win32"

passagemath_objects-10.6.31rc2/VERSION.txt

@@ -0,0 +1 @@
+10.6.31.rc2

{passagemath_objects-10.6.31 → passagemath_objects-10.6.31rc2}/passagemath_objects.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: passagemath-objects
-Version: 10.6.31
+Version: 10.6.31rc2
 Summary: passagemath: Sage objects, elements, parents, categories, coercion, metaclasses
 Author-email: The Sage Developers <sage-support@googlegroups.com>
 Maintainer: Matthias Köppe, passagemath contributors
@@ -27,7 +27,7 @@ Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Topic :: Scientific/Engineering :: Mathematics
-Requires-Python: <3.15,>=3.10
+Requires-Python: <3.14,>=3.10
 Description-Content-Type: text/x-rst
 Requires-Dist: gmpy2~=2.1.b999
 Requires-Dist: cysignals<1.12.4; sys_platform == "win32"

{passagemath_objects-10.6.31 → passagemath_objects-10.6.31rc2}/pyproject.toml

@@ -2,9 +2,9 @@
 # Minimum requirements for the build system to execute.
 requires = [
     'setuptools >= 77.0.0',
-    'passagemath-conf ~= 10.6.31.0 ; sys_platform != "win32"',
-    'passagemath-setup ~= 10.6.31.0',
-    'passagemath-environment ~= 10.6.31.0',
+    'passagemath-conf == 10.6.31rc2 ; sys_platform != "win32"',
+    'passagemath-setup == 10.6.31rc2',
+    'passagemath-environment == 10.6.31rc2',
     'cython >=3.0.8, <3.2.0', 'cython >=3.0.8,<3.2.0',
     'gmpy2 ~=2.1.b999',
     'cysignals <1.12.4; sys_platform == "win32"', 'cysignals >=1.11.2, != 1.12.0',
@@ -43,7 +43,7 @@ classifiers = [
     "Programming Language :: Python :: Implementation :: CPython",
     "Topic :: Scientific/Engineering :: Mathematics",
 ]
-requires-python = ">=3.10, <3.15"
+requires-python = ">=3.10, <3.14"
 
 [project.urls]
 "release notes" = "https://github.com/passagemath/passagemath/releases"

{passagemath_objects-10.6.31 → passagemath_objects-10.6.31rc2}/sage/cpython/atexit.pyx

@@ -144,97 +144,51 @@ cdef class restore_atexit:
         _set_exithandlers(self._exithandlers)
 
 from cpython.ref cimport PyObject
-import sys
 
-# Implement a uniform interface for getting atexit callbacks
+# Implement "_atexit_callbacks()" for each supported python version
 cdef extern from *:
     """
-    #ifndef Py_BUILD_CORE
     #define Py_BUILD_CORE
-    #endif
     #undef _PyGC_FINALIZED
     #include "internal/pycore_interp.h"
     #include "internal/pycore_pystate.h"
-    
-    // Always define this struct for Cython's use
-    typedef struct {
-        PyObject *func;
-        PyObject *args;
-        PyObject *kwargs;
-    } atexit_callback_struct;
-    
-    #if PY_VERSION_HEX >= 0x030e0000
-    // Python 3.14+: atexit uses a PyList
-    static PyObject* get_atexit_callbacks_list(PyObject *self) {
+    #if PY_VERSION_HEX >= 0x030c0000
+    // struct atexit_callback was renamed in 3.12 to atexit_py_callback
+    #define atexit_callback atexit_py_callback
+    #endif
+    static atexit_callback ** _atexit_callbacks(PyObject *self) {
         PyInterpreterState *interp = _PyInterpreterState_GET();
         struct atexit_state state = interp->atexit;
         return state.callbacks;
     }
-    
-    // Dummy function for Python 3.14+ (never called)
-    static atexit_callback_struct** get_atexit_callbacks_array(PyObject *self) {
-        return NULL;
-    }
-    #else
-    // Python < 3.14: atexit uses C array
-    static atexit_callback_struct** get_atexit_callbacks_array(PyObject *self) {
-        PyInterpreterState *interp = _PyInterpreterState_GET();
-        struct atexit_state state = interp->atexit;
-        // Cast from atexit_callback** to our struct type
-        return (atexit_callback_struct**)state.callbacks;
-    }
-    
-    // Dummy function for Python < 3.14 (never called)
-    static PyObject* get_atexit_callbacks_list(PyObject *self) {
-        return NULL;
-    }
-    #endif
     """
-    # Declare both functions - they exist in all Python versions (one is dummy)
-    PyObject* get_atexit_callbacks_list(object module)
-    
-    ctypedef struct atexit_callback_struct:
+    ctypedef struct atexit_callback:
         PyObject* func
         PyObject* args
         PyObject* kwargs
-    atexit_callback_struct** get_atexit_callbacks_array(object module)
+    atexit_callback** _atexit_callbacks(object module)
 
 
 def _get_exithandlers():
     """Return list of exit handlers registered with the atexit module."""
-    cdef list exithandlers = []
-    cdef atexit_callback_struct ** callbacks
-    cdef atexit_callback_struct callback
+    cdef atexit_callback ** callbacks
+    cdef atexit_callback callback
+    cdef list exithandlers
     cdef int idx
     cdef object kwargs
-    
-    # Python 3.14+ uses a PyList directly
-    if sys.version_info >= (3, 14):
-        callbacks_list = <object>get_atexit_callbacks_list(atexit)
-        if callbacks_list is None:
-            return exithandlers
-        # callbacks is a list of tuples: [(func, args, kwargs), ...]
-        # Normalize kwargs to ensure it's always a dict (not None)
-        # Note: In Python 3.14+, atexit stores callbacks in LIFO order
-        # (most recently registered first), but we return them in FIFO
-        # order (registration order) for consistency with earlier versions
-        for item in reversed(callbacks_list):
-            func, args, kwargs = item
-            if kwargs is None:
-                kwargs = {}
-            exithandlers.append((func, args, kwargs))
-    else:
-        # Python < 3.14 uses C array
-        callbacks = get_atexit_callbacks_array(atexit)
-        for idx in range(atexit._ncallbacks()):
-            callback = callbacks[idx][0]
-            if callback.kwargs:
-                kwargs = <object>callback.kwargs
-            else:
-                kwargs = {}
-            exithandlers.append((<object>callback.func,
-                                 <object>callback.args,
-                                 kwargs))
+
+    exithandlers = []
+    callbacks = _atexit_callbacks(atexit)
+
+    for idx in range(atexit._ncallbacks()):
+        callback = callbacks[idx][0]
+        if callback.kwargs:
+            kwargs = <object>callback.kwargs
+        else:
+            kwargs = {}
+        exithandlers.append((<object>callback.func,
+                             <object>callback.args,
+                             kwargs))
     return exithandlers
 
 
@@ -249,9 +203,6 @@ def _set_exithandlers(exithandlers):
 
     # We could do this more efficiently by directly rebuilding the array
     # of atexit_callbacks, but this is much simpler
-    # Note: exithandlers is in registration order (FIFO).
-    # In Python 3.14+, atexit.register prepends to the list (LIFO),
-    # so registering in forward order gives us the correct execution order.
     for callback in exithandlers:
         atexit.register(callback[0], *callback[1], **callback[2])
 

{passagemath_objects-10.6.31 → passagemath_objects-10.6.31rc2}/sage/misc/cachefunc.pyx

@@ -379,7 +379,7 @@ in caches. This can be achieved by defining an appropriate method
     sage: hash(b)
     Traceback (most recent call last):
     ...
-    TypeError: ...unhashable type: 'sage.rings.padics.qadic_flint_CR.qAdicCappedRelativeElement'...
+    TypeError: unhashable type: 'sage.rings.padics.qadic_flint_CR.qAdicCappedRelativeElement'
     sage: from sage.misc.cachefunc import cached_method
     sage: @cached_method
     ....: def f(x): return x == a

{passagemath_objects-10.6.31 → passagemath_objects-10.6.31rc2}/sage/misc/lazy_list.pyx

@@ -535,15 +535,16 @@ cdef class lazy_list_generic():
 
         EXAMPLES::
 
+            sage: from itertools import count
             sage: from sage.misc.lazy_list import lazy_list
-            sage: m = lazy_list(iter([0, 1, 4, 9, 16, 25, 36, 49, 64, 81]))
+            sage: m = lazy_list(count())
             sage: x = loads(dumps(m))
             sage: y = iter(x)
             sage: print("{} {} {}".format(next(y), next(y), next(y)))
-            0 1 4
+            0 1 2
             sage: m2 = m[3::2]
             sage: loads(dumps(m2))
-            lazy list [9, 25, 49, ...]
+            lazy list [3, 5, 7, ...]
         """
         if self.master is None:
             raise NotImplementedError
@@ -916,9 +917,8 @@ cdef class lazy_list_from_iterator(lazy_list_generic):
         [0, 1, 2]
         sage: [next(x), next(y)]
         [3, 3]
-        sage: m2 = lazy_list(iter([0, 1, 4, 9, 16]))
-        sage: loads(dumps(m2))
-        lazy list [0, 1, 4, ...]
+        sage: loads(dumps(m))
+        lazy list [0, 1, 2, ...]
     """
 
     def __init__(self, iterator, cache=None, stop=None):
@@ -987,9 +987,10 @@ cdef class lazy_list_from_iterator(lazy_list_generic):
         TESTS::
 
             sage: from sage.misc.lazy_list import lazy_list_from_iterator
-            sage: loads(dumps(lazy_list_from_iterator(iter([0, 1, 4, 9, 16]))))
-            lazy list [0, 1, 4, ...]
-            sage: loads(dumps(lazy_list_from_iterator(iter([0, 1, 4, 9, 16]), ['a'])))
+            sage: from itertools import count
+            sage: loads(dumps(lazy_list_from_iterator(count())))
+            lazy list [0, 1, 2, ...]
+            sage: loads(dumps(lazy_list_from_iterator(count(), ['a'])))
             lazy list ['a', 0, 1, ...]
         """
         return lazy_list_from_iterator, (self.iterator, self.cache, self.stop)

{passagemath_objects-10.6.31 → passagemath_objects-10.6.31rc2}/sage/misc/sage_unittest.py

@@ -216,14 +216,6 @@ class TestSuite:
             ....:     def _test_b(self, tester): tester.fail()
             ....:     def _test_c(self, tester): pass
             ....:     def _test_d(self, tester): tester.fail()
-            ....:     def _test_pickling(self, tester):
-            ....:         from _pickle import PicklingError
-            ....:         from sage.misc.persist import dumps
-            ....:         try:
-            ....:             dumps(self)
-            ....:             tester.fail("Expected PicklingError")
-            ....:         except PicklingError:
-            ....:             pass
 
             sage: TestSuite(Blah()).run()
             Failure in _test_b:
@@ -236,7 +228,13 @@ class TestSuite:
               ...
             AssertionError: None
             ------------------------------------------------------------
-            The following tests failed: _test_b, _test_d
+            Failure in _test_pickling:
+            Traceback (most recent call last):
+              ...
+            ...PicklingError: Can't pickle <class '__main__.Blah'>: attribute
+            lookup ...Blah... failed
+            ------------------------------------------------------------
+            The following tests failed: _test_b, _test_d, _test_pickling
 
             sage: TestSuite(Blah()).run(verbose = True)
             running ._test_a() . . . pass
@@ -254,8 +252,13 @@ class TestSuite:
             ------------------------------------------------------------
             running ._test_new() . . . pass
             running ._test_not_implemented_methods() . . . pass
-            running ._test_pickling() . . . pass
-            The following tests failed: _test_b, _test_d
+            running ._test_pickling() . . . fail
+            Traceback (most recent call last):
+              ...
+            ...PicklingError: Can't pickle <class '__main__.Blah'>: attribute
+            lookup ...Blah... failed
+            ------------------------------------------------------------
+            The following tests failed: _test_b, _test_d, _test_pickling
 
             File "/opt/sage/local/lib/python/site-packages/sage/misc/sage_unittest.py", line 183, in run
             test_method(tester = tester)

{passagemath_objects-10.6.31 → passagemath_objects-10.6.31rc2}/sage/misc/sageinspect.py

@@ -460,9 +460,8 @@ class SageArgSpecVisitor(ast.NodeVisitor):
         sage: v = visitor.visit(ast.parse("{'a':('e',2,[None,({False:True},'pi')]), 37.0:'temp'}").body[0].value)
         sage: sorted(v.items(), key=lambda x: str(x[0]))
         [(37.0, 'temp'), ('a', ('e', 2, [None, ({False: True}, 'pi')]))]
-        sage: v = ast.parse("jc = ['veni', 'vidi', 'vici']").body[0]
-        sage: isinstance(v, ast.Assign)
-        True
+        sage: v = ast.parse("jc = ['veni', 'vidi', 'vici']").body[0]; v
+        <...ast.Assign object at ...>
         sage: attrs = [x for x in dir(v) if not x.startswith('__')]
         sage: '_attributes' in attrs and '_fields' in attrs and 'col_offset' in attrs
         True
@@ -493,6 +492,31 @@ class SageArgSpecVisitor(ast.NodeVisitor):
         """
         return node.id
 
+    def visit_NameConstant(self, node):
+        """
+        Visit a Python AST :class:`ast.NameConstant` node.
+
+        This is an optimization added in Python 3.4 for the special cases
+        of True, False, and None.
+
+        INPUT:
+
+        - ``node`` -- the node instance to visit
+
+        OUTPUT: ``None``, ``True``, ``False``
+
+        EXAMPLES::
+
+            sage: import ast, sage.misc.sageinspect as sms
+            sage: visitor = sms.SageArgSpecVisitor()
+            sage: vis = lambda x: visitor.visit_NameConstant(ast.parse(x).body[0].value)
+            sage: [vis(n) for n in ['True', 'False', 'None']]
+            [True, False, None]
+            sage: [type(vis(n)) for n in ['True', 'False', 'None']]
+            [<class 'bool'>, <class 'bool'>, <class 'NoneType'>]
+        """
+        return node.value
+
     def visit_arg(self, node):
         r"""
         Visit a Python AST :class:`ast.arg` node.
@@ -520,6 +544,51 @@ class SageArgSpecVisitor(ast.NodeVisitor):
         """
         return node.arg
 
+    def visit_Num(self, node):
+        """
+        Visit a Python AST :class:`ast.Num` node.
+
+        INPUT:
+
+        - ``node`` -- the node instance to visit
+
+        OUTPUT: the number the ``node`` represents
+
+        EXAMPLES::
+
+            sage: import ast, sage.misc.sageinspect as sms
+            sage: visitor = sms.SageArgSpecVisitor()
+            sage: vis = lambda x: visitor.visit_Num(ast.parse(x).body[0].value)
+            sage: [vis(n) for n in ['123', '0.0']]
+            [123, 0.0]
+
+        .. NOTE::
+
+            On Python 3 negative numbers are parsed first, for some reason, as
+            a UnaryOp node.
+        """
+        return node.value
+
+    def visit_Str(self, node):
+        r"""
+        Visit a Python AST :class:`ast.Str` node.
+
+        INPUT:
+
+        - ``node`` -- the node instance to visit
+
+        OUTPUT: the string the ``node`` represents
+
+        EXAMPLES::
+
+            sage: import ast, sage.misc.sageinspect as sms
+            sage: visitor = sms.SageArgSpecVisitor()
+            sage: vis = lambda x: visitor.visit_Str(ast.parse(x).body[0].value)
+            sage: [vis(s) for s in ['"abstract"', "'syntax'", r'''r"tr\ee"''']]
+            ['abstract', 'syntax', 'tr\\ee']
+        """
+        return node.value
+
     def visit_List(self, node):
         """
         Visit a Python AST :class:`ast.List` node.
@@ -751,28 +820,6 @@ class SageArgSpecVisitor(ast.NodeVisitor):
         if op == 'USub':
             return -self.visit(node.operand)
 
-    def visit_Constant(self, node):
-        """
-        Visit a Python AST :class:`ast.Constant` node.
-
-        INPUT:
-
-        - ``node`` -- the node instance to visit
-
-        OUTPUT: the constant value the ``node`` represents
-
-        EXAMPLES::
-
-            sage: import ast, sage.misc.sageinspect as sms
-            sage: visitor = sms.SageArgSpecVisitor()
-            sage: vis = lambda x: visitor.visit_Constant(ast.parse(x).body[0].value)
-            sage: [vis(n) for n in ['123', '0', '3.14', '"hello"', 'True', 'False', 'None']]
-            [123, 0, 3.14, 'hello', True, False, None]
-            sage: [type(vis(n)) for n in ['123', '0', '3.14', '"hello"', 'True', 'False', 'None']]
-            [<class 'int'>, <class 'int'>, <class 'float'>, <class 'str'>, <class 'bool'>, <class 'bool'>, <class 'NoneType'>]
-        """
-        return node.value
-
 
 def _grep_first_pair_of_parentheses(s):
     r"""

{passagemath_objects-10.6.31 → passagemath_objects-10.6.31rc2}/sage/misc/weak_dict.pyx

@@ -466,7 +466,7 @@ cdef class WeakValueDictionary(dict):
             sage: D.setdefault(matrix([]), ZZ)                                          # needs sage.modules
             Traceback (most recent call last):
             ...
-            TypeError: ...mutable matrices are unhashable...
+            TypeError: mutable matrices are unhashable
         """
         cdef PyObject* wr = PyDict_GetItemWithError(self, k)
         if wr != NULL:
@@ -540,7 +540,7 @@ cdef class WeakValueDictionary(dict):
             sage: D[matrix([])] = ZZ                                                    # needs sage.modules
             Traceback (most recent call last):
             ...
-            TypeError: ...mutable matrices are unhashable...
+            TypeError: mutable matrices are unhashable
         """
         self._set_item(k, v)
 
@@ -586,7 +586,7 @@ cdef class WeakValueDictionary(dict):
             sage: D.pop(matrix([]))                                                     # needs sage.modules
             Traceback (most recent call last):
             ...
-            TypeError: ...mutable matrices are unhashable...
+            TypeError: mutable matrices are unhashable
         """
         cdef PyObject* wr = PyDict_GetItemWithError(self, k)
         if wr == NULL:
@@ -663,7 +663,7 @@ cdef class WeakValueDictionary(dict):
             sage: D.get(matrix([]))                                                     # needs sage.modules
             Traceback (most recent call last):
             ...
-            TypeError: ...mutable matrices are unhashable...
+            TypeError: mutable matrices are unhashable
         """
         cdef PyObject * wr = PyDict_GetItemWithError(self, k)
         if wr == NULL:
@@ -702,7 +702,7 @@ cdef class WeakValueDictionary(dict):
             sage: D[matrix([])]                                                         # needs sage.modules
             Traceback (most recent call last):
             ...
-            TypeError: ...mutable matrices are unhashable...
+            TypeError: mutable matrices are unhashable
         """
         cdef PyObject* wr = PyDict_GetItemWithError(self, k)
         if wr == NULL:
@@ -745,7 +745,7 @@ cdef class WeakValueDictionary(dict):
             sage: matrix([]) in D                                                       # needs sage.modules
             Traceback (most recent call last):
             ...
-            TypeError: ...mutable matrices are unhashable...
+            TypeError: mutable matrices are unhashable
         """
         cdef PyObject* wr = PyDict_GetItemWithError(self, k)
         return (wr != NULL) and (PyWeakref_GetObject(wr) != Py_None)

{passagemath_objects-10.6.31 → passagemath_objects-10.6.31rc2}/sage/structure/list_clone.pyx

@@ -774,7 +774,7 @@ cdef class ClonableArray(ClonableElement):
             sage: c.index(5)
             Traceback (most recent call last):
             ...
-            ValueError: ...not in list
+            ValueError: 5 is not in list
         """
         if start is None:
             return self._list.index(x)

{passagemath_objects-10.6.31 → passagemath_objects-10.6.31rc2}/sage/structure/sage_object.pyx

@@ -410,7 +410,7 @@ cdef class SageObject:
             sage: hash(b)
             Traceback (most recent call last):
             ...
-            TypeError: ...unhashable type: 'sage.rings.padics.qadic_flint_CR.qAdicCappedRelativeElement'...
+            TypeError: unhashable type: 'sage.rings.padics.qadic_flint_CR.qAdicCappedRelativeElement'
             sage: @cached_method
             ....: def f(x): return x==a
             sage: f(b)
@@ -665,12 +665,11 @@ cdef class SageObject:
         TESTS::
 
             sage: class Bla(SageObject): pass
-            sage: from _pickle import PicklingError
-            sage: try:
-            ....:     Bla()._test_pickling()
-            ....: except PicklingError as e:
-            ....:     print("PicklingError caught")
-            PicklingError caught
+            sage: Bla()._test_pickling()
+            Traceback (most recent call last):
+            ...
+            PicklingError: Can't pickle <class '__main__.Bla'>: attribute
+            lookup ... failed
 
         TODO: for a stronger test, this could send the object to a
         remote Sage session, and get it back.

{passagemath_objects-10.6.31 → passagemath_objects-10.6.31rc2}/sage/structure/unique_representation.py

@@ -83,7 +83,7 @@ must be hashable, i.e., must be valid as dictionary keys::
     sage: C([1,2])
     Traceback (most recent call last):
     ...
-    TypeError: ...unhashable type: 'list'...
+    TypeError: unhashable type: 'list'
 
 In addition, equivalent ways of providing the arguments are *not*
 automatically normalised when forming the cache key, and hence different but
@@ -733,7 +733,7 @@ class CachedRepresentation(WithPicklingByInitArgs):
         sage: MyClass(value = [1,2,3])
         Traceback (most recent call last):
         ...
-        TypeError: ...unhashable type: 'list'...
+        TypeError: unhashable type: 'list'
 
     .. rubric:: Argument preprocessing
 

passagemath_objects-10.6.31/VERSION.txt

@@ -1 +0,0 @@
-10.6.31