Ticket #14319: trac_14319-from_list_to_domain.patch

sage/graphs/generic_graph.py

@@ -15919 +15919 @@
 
         Relabeling using a Sage permutation::
 
+            sage: G = graphs.PathGraph(3)
             sage: from sage.groups.perm_gps.permgroup_named import SymmetricGroup
             sage: S = SymmetricGroup(3)
             sage: gamma = S('(1,2)')
@@ -16051 +16052 @@
         elif isinstance(perm, PermutationGroupElement):
             n = self.order()
             ddict = {}
-            llist = perm.list()
             for i in xrange(1,n):
-                ddict[i] = llist[i-1]%n
+                ddict[i] = perm(i)%n
             if n > 0:
-                ddict[0] = llist[n-1]%n
+                ddict[0] = perm(n)%n
             perm = ddict
 
         elif callable(perm):

sage/groups/perm_gps/partn_ref/automorphism_group_canonical_label.pyx

@@ -224 +224 @@
         sage: gens = [[1,2,3,0]]
         sage: reps = []
         sage: for p in SymmetricGroup(4):
-        ...     p = [a-1 for a in p.list()]
+        ...     p = [p(i)-1 for i in range(1,5)]
         ...     r = coset_rep(p, gens)
         ...     if r not in reps:
         ...         reps.append(r)
@@ -233 +233 @@
         sage: gens = [[1,0,2,3],[0,1,3,2]]
         sage: reps = []
         sage: for p in SymmetricGroup(4):
-        ...     p = [a-1 for a in p.list()]
+        ...     p = [p(i)-1 for i in range(1,5)]
         ...     r = coset_rep(p, gens)
         ...     if r not in reps:
         ...         reps.append(r)
@@ -242 +242 @@
         sage: gens = [[1,2,0,3]]
         sage: reps = []
         sage: for p in SymmetricGroup(4):
-        ...     p = [a-1 for a in p.list()]
+        ...     p = [p(i)-1 for i in range(1,5)]
         ...     r = coset_rep(p, gens)
         ...     if r not in reps:
         ...         reps.append(r)

sage/groups/perm_gps/partn_ref/data_structures_pyx.pxi

@@ -1803 +1803 @@
                 raise AssertionError
             if test_contains:
                 for i from 0 <= i < 3:
-                    permy = G.random_element().list()
+                    permy = G.random_element()
                     for j from 0 <= j < n:
-                        perm[j] = permy[j]-1
+                        perm[j] = permy(j+1)-1
                     if not SC_contains(SC, 0, perm, 0):
                         print "FAIL", L
                         print 'element', permy

sage/groups/perm_gps/partn_ref/double_coset.pyx

@@ -128 +128 @@
         sage: gens = [[1,2,3,0]]
         sage: reps = [[0,1,2,3]]
         sage: for p in SymmetricGroup(4):
-        ...     p = [a-1 for a in p.list()]
+        ...     p = [p(i)-1 for i in range(1,5)]
         ...     found = False
         ...     for r in reps:
         ...         if coset_eq(p, r, gens):
@@ -141 +141 @@
         sage: gens = [[1,0,2,3],[0,1,3,2]]
         sage: reps = [[0,1,2,3]]
         sage: for p in SymmetricGroup(4):
-        ...     p = [a-1 for a in p.list()]
+        ...     p = [p(i)-1 for i in range(1,5)]
         ...     found = False
         ...     for r in reps:
         ...         if coset_eq(p, r, gens):
@@ -154 +154 @@
         sage: gens = [[1,2,0,3]]
         sage: reps = [[0,1,2,3]]
         sage: for p in SymmetricGroup(4):
-        ...     p = [a-1 for a in p.list()]
+        ...     p = [p(i)-1 for i in range(1,5)]
         ...     found = False
         ...     for r in reps:
         ...         if coset_eq(p, r, gens):

sage/groups/perm_gps/partn_ref/refinement_graphs.pyx

@@ -901 +901 @@
                 seen[i] = 1
         return partition
     else:
-        n = len(gamma.list())
+        n = len(gamma.domain())
         l = []
         for i in range(1,n+1):
             orb = gamma.orbit(i)

sage/groups/perm_gps/permgroup_element.pxd

@@ -10 +10 @@
     cdef __tuple
     cdef PermutationGroupElement _new_c(self)
     cpdef _gap_list(self)
-    cpdef list(self)
+    cpdef domain(self)
     cdef public __custom_name
     cpdef list _act_on_list_on_position(self, list x)
     cpdef ClonableIntArray _act_on_array_on_position(self, ClonableIntArray x)

sage/groups/perm_gps/permgroup_element.pyx

@@ -67 +67 @@
 from sage.interfaces.all import gap, is_GapElement, is_ExpectElement
 from sage.sets.finite_enumerated_set import FiniteEnumeratedSet
 import sage.structure.coerce as coerce
+from sage.misc.superseded import deprecated_function_alias
 
 import operator
 
@@ -497 +498 @@
            sage: func(*args)
            (1,2,3)(4,5)
         """
-        return make_permgroup_element_v2, (self._parent, self.list(), self._parent.domain())
+        return make_permgroup_element_v2, (self._parent, self.domain(), self._parent.domain())
         
     cdef PermutationGroupElement _new_c(self):
         cdef PermutationGroupElement other = PY_NEW_SAME_TYPE(self)
@@ -917 +918 @@
         from sage.combinat.permutation import Permutation
         return Permutation(self._gap_list()).cycle_string()
 
-    cpdef list(self):
+    list = deprecated_function_alias(14319, domain)
+
+    cpdef domain(self):
         """
-        Returns list of the images of the integers from 1 to n under this
-        permutation as a list of Python ints.
-        
+        Returns the domain of self.
+
         EXAMPLES::
-        
+
             sage: G = SymmetricGroup(4)
             sage: x = G([2,1,4,3]); x
             (1,2)(3,4)
-            sage: v = x.list(); v
+            sage: v = x.domain(); v
             [2, 1, 4, 3]
             sage: type(v[0])
             <type 'int'>
             sage: x = G([2,1]); x
             (1,2)
-            sage: x.list()
+            sage: x.domain()
             [2, 1, 3, 4]
 
         TESTS::
@@ -941 +943 @@
             sage: S = SymmetricGroup(0)
             sage: x = S.one(); x
             ()
-            sage: x.list()
+            sage: x.domain()
             []
         """
         cdef int i
@@ -991 +993 @@
             ('b', 'a')
         """
         if self.__tuple is None:
-            self.__tuple = tuple(self.list())
+            self.__tuple = tuple(self.domain())
         return self.__tuple
 
     def dict(self):