passagemath-objects 10.6.5__cp310-cp310-win_amd64.whl → 10.6.46__cp310-cp310-win_amd64.whl

sage/categories/sets_cat.py

@@ -1826,6 +1826,53 @@ Please use, e.g., S.algebra(QQ, category=Semigroups())""".format(self))
                 raising :exc:`NotImplementedError` could be provided instead.
             """
 
+        def is_bijective(self):
+            r"""
+            Return whether ``self`` is bijective.
+
+            EXAMPLES:
+
+            Two morphisms between vector spaces
+            that are obviously not bijective, simply on
+            considerations of the dimensions.  However, each fulfills
+            half of the requirements to be a bijection.  ::
+
+                sage: # needs sage.modules
+                sage: V1 = QQ^2
+                sage: V2 = QQ^3
+                sage: m = matrix(QQ, [[1, 2, 3], [4, 5, 6]])
+                sage: phi = V1.hom(m, V2)
+                sage: phi.is_injective()
+                True
+                sage: phi.is_bijective()
+                False
+                sage: rho = V2.hom(m.transpose(), V1)
+                sage: rho.is_surjective()
+                True
+                sage: rho.is_bijective()
+                False
+
+            We construct a simple bijection between two one-dimensional
+            vector spaces.  ::
+
+                sage: # needs sage.modules
+                sage: V1 = QQ^3
+                sage: V2 = QQ^2
+                sage: phi = V1.hom(matrix(QQ, [[1, 2], [3, 4], [5, 6]]), V2)
+                sage: x = vector(QQ, [1, -1, 4])
+                sage: y = phi(x); y
+                (18, 22)
+                sage: rho = phi.restrict_domain(V1.span([x]))
+                sage: zeta = rho.restrict_codomain(V2.span([y]))
+                sage: zeta.is_bijective()
+                True
+
+            AUTHOR:
+
+            - Rob Beezer (2011-06-28)
+            """
+            return self.is_injective() and self.is_surjective()
+
         def is_injective(self):
             r"""
             Return whether this map is injective.
@@ -1845,6 +1892,21 @@ Please use, e.g., S.algebra(QQ, category=Semigroups())""".format(self))
                 return False
             raise NotImplementedError
 
+        def is_surjective(self):
+            """
+            Return whether the map is surjective.
+
+            TESTS::
+
+                sage: from sage.categories.map import Map
+                sage: f = Map(Hom(QQ, ZZ, Rings()))
+                sage: f.is_surjective()
+                Traceback (most recent call last):
+                ...
+                NotImplementedError
+            """
+            raise NotImplementedError
+
         def image(self, domain_subset=None):
             r"""
             Return the image of the domain or of ``domain_subset``.

sage/cpython/__init__.py

@@ -1,13 +1,13 @@
 # sage_setup: distribution = sagemath-objects
 # start delvewheel patch
-def _delvewheel_patch_1_11_1():
+def _delvewheel_patch_1_11_2():
     import os
     if os.path.isdir(libs_dir := os.path.abspath(os.path.join(os.path.dirname(__file__), os.pardir, os.pardir, 'passagemath_objects.libs'))):
         os.add_dll_directory(libs_dir)
 
 
-_delvewheel_patch_1_11_1()
-del _delvewheel_patch_1_11_1
+_delvewheel_patch_1_11_2()
+del _delvewheel_patch_1_11_2
 # end delvewheel patch
 # sage.cpython is an ordinary package, not a namespace package.
 

sage/cpython/atexit.pyx

@@ -144,51 +144,104 @@ cdef class restore_atexit:
         _set_exithandlers(self._exithandlers)
 
 from cpython.ref cimport PyObject
+import sys
 
-# Implement "_atexit_callbacks()" for each supported python version
+# Implement a uniform interface for getting atexit callbacks
 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"
-    #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) {
+    
+    // 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 stored in state->callbacks
+    // Note: In Python 3.14 the atexit_state struct changed - callbacks is now a PyObject* (PyList)
+    
+    static PyObject* get_atexit_callbacks_list(PyObject *self) {
+        PyInterpreterState *interp = _PyInterpreterState_GET();
+        // Access the callbacks list directly from the interpreter state
+        // We return a new reference because Cython expects an owned reference
+        PyObject *callbacks = interp->atexit.callbacks;
+        Py_XINCREF(callbacks);
+        return callbacks;
+    }
+    
+    // Dummy function for Python 3.14+ (never called)
+    static atexit_callback_struct** get_atexit_callbacks_array(PyObject *self) {
+        PyErr_SetString(PyExc_RuntimeError, "Python >= 3.14 has no atexit arrays");
+        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;
-        return state.callbacks;
+        // 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) {
+        PyErr_SetString(PyExc_RuntimeError, "Python < 3.14 has no atexit lists");
+        return NULL;
     }
+    #endif
     """
-    ctypedef struct atexit_callback:
+    # Declare both functions - they exist in all Python versions (one is dummy)
+    object get_atexit_callbacks_list(object module)
+    
+    ctypedef struct atexit_callback_struct:
         PyObject* func
         PyObject* args
         PyObject* kwargs
-    atexit_callback** _atexit_callbacks(object module)
+    atexit_callback_struct** get_atexit_callbacks_array(object module) except NULL
 
 
 def _get_exithandlers():
     """Return list of exit handlers registered with the atexit module."""
-    cdef atexit_callback ** callbacks
-    cdef atexit_callback callback
-    cdef list exithandlers
+    cdef list exithandlers = []
+    cdef atexit_callback_struct ** callbacks
+    cdef atexit_callback_struct callback
     cdef int idx
     cdef object 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))
+    
+    # Python 3.14+ uses a PyList directly
+    if sys.version_info >= (3, 14):
+        callbacks_list = 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))
     return exithandlers
 
 
@@ -203,6 +256,9 @@ 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])
 

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

sage/misc/classcall_metaclass.pyx

@@ -439,7 +439,7 @@ cdef class ClasscallMetaclass(NestedClassMetaclass):
             sage: 1 in Bar
             Traceback (most recent call last):
             ...
-            TypeError: argument of type 'type' is not iterable
+            TypeError: argument of type 'type' is not... iterable
         """
         if cls.classcontains:
             return cls.classcontains(cls, x)

sage/misc/constant_function.pyx

@@ -35,10 +35,12 @@ cdef class ConstantFunction(SageObject):
     this is not (currently) picklable::
 
         sage: g = lambda x: 3
-        sage: g == loads(dumps(g))
-        Traceback (most recent call last):
-        ...
-        PicklingError: Can't pickle ...: attribute lookup ... failed
+        sage: try:
+        ....:     loads(dumps(g))
+        ....: except Exception as e:
+        ....:     if 'PicklingError' in str(type(e).__name__):
+        ....:         print('PicklingError Caught')
+        PicklingError Caught
         sage: f == loads(dumps(f))
         True
 

sage/misc/lazy_list.pyx

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

sage/misc/sage_timeit.py

@@ -17,6 +17,8 @@ AUTHOR:
     -- William Stein, based on code by Fernando Perez included in IPython
 """
 
+import os
+
 
 class SageTimeitResult:
     r"""
@@ -232,10 +234,17 @@ def sage_timeit(stmt, globals_dict=None, preparse=None, number=0, repeat=3, prec
     exec(code, globals_dict, ns)
     timer.inner = ns["inner"]
 
+    import sys
+    f = sys.stdout
+
+    try:
+        null = open(os.devnull, 'w')
+    except Exception:
+        null = None
+
     try:
-        import sys
-        f = sys.stdout
-        sys.stdout = open('/dev/null', 'w')
+        if null is not None:
+            sys.stdout = null
 
         if number == 0:
             # determine number so that 0.2 <= total time < 2.0
@@ -249,8 +258,9 @@ def sage_timeit(stmt, globals_dict=None, preparse=None, number=0, repeat=3, prec
         best = min(series)
 
     finally:
-        sys.stdout.close()
-        sys.stdout = f
+        if null is not None:
+            sys.stdout.close()
+            sys.stdout = f
         import gc
         gc.enable()
 

sage/misc/sage_unittest.py

@@ -229,10 +229,9 @@ class TestSuite:
             AssertionError: None
             ------------------------------------------------------------
             Failure in _test_pickling:
-            Traceback (most recent call last):
-              ...
-            ...PicklingError: Can't pickle <class '__main__.Blah'>: attribute
-            lookup ...Blah... failed
+            ...
+            ...PicklingError: Can't pickle <class '__main__.Blah'>: ...
+            ...
             ------------------------------------------------------------
             The following tests failed: _test_b, _test_d, _test_pickling
 
@@ -253,15 +252,13 @@ class TestSuite:
             running ._test_new() . . . pass
             running ._test_not_implemented_methods() . . . pass
             running ._test_pickling() . . . fail
-            Traceback (most recent call last):
-              ...
-            ...PicklingError: Can't pickle <class '__main__.Blah'>: attribute
-            lookup ...Blah... failed
+            ...
+            ...PicklingError: Can't pickle <class '__main__.Blah'>: ...
+            ...
             ------------------------------------------------------------
             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)
+            ...
 
         The ``catch=False`` option prevents ``TestSuite`` from
         catching exceptions::
@@ -637,4 +634,4 @@ class PythonObjectWithTests:
         try:
             cls.__new__(cls)
         except Exception:
-            pass
+            pass

sage/misc/sageinspect.py

@@ -460,8 +460,9 @@ 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]; v
-        <...ast.Assign object at ...>
+        sage: v = ast.parse("jc = ['veni', 'vidi', 'vici']").body[0]
+        sage: isinstance(v, ast.Assign)
+        True
         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
@@ -492,31 +493,6 @@ 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.
@@ -544,51 +520,6 @@ 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.
@@ -820,6 +751,28 @@ 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"""

sage/misc/timing.py

@@ -86,6 +86,14 @@ def cputime(
         CPU time is reported correctly because subprocesses can be
         started and terminated at any given time.
     """
+    try:
+        import resource  # type: ignore
+    except ImportError:
+        # The module 'resource' is removed in Pyodide to browser limitations.
+        if isinstance(t, GlobalCputime):
+            t = float(t)
+        return walltime(t)
+
     if isinstance(t, GlobalCputime):
         subprocesses = True