#21110: Py3 : Handle the changes to "next()" again
-------------------------+-------------------------------------------------
Reporter: | Owner:
chapoton |
Type: | Status: positive_review
enhancement |
Priority: major | Milestone: sage-7.3
Component: | Resolution:
python3 |
Keywords: | Merged in:
Authors: | Reviewers: Travis Scrimshaw
Frédéric Chapoton |
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/21110 | bed8d73c8630aa1f9a12d75e66e509c8495be83c
Dependencies: | Stopgaps:
-------------------------+-------------------------------------------------
Comment (by jhpalmieri):
If I search the source for `'\.next('`, I find lots of matches. Do some of
these need to be changed, also? (Some may depend on #18802, I guess.)
{{{
./arith/srange.pyx: first = more.next()
./categories/enumerated_sets.py: - ``S.next(e)``: the object of the
set which follows ``e``; It is
./categories/enumerated_sets.py: # Check if .first() and
.next(x) are overridden in the subclass
./categories/enumerated_sets.py: ``self.next(e)`` returns the
element of the set ``self`` which
./categories/enumerated_sets.py: f = self.next(f)
./categories/examples/infinite_enumerated_sets.py: sage:
NN.next(3)
./categories/examples/sets_cat.py: sage: x =
P.next(P.an_element()); x
./categories/examples/sets_cat.py: x = self.next(x)
./categories/examples/sets_cat.py: sage: p.next()
./categories/examples/sets_cat.py: return
self.parent().next(self)
./categories/examples/sets_cat.py: sage: z = P.next(x); z
./categories/examples/sets_cat.py: sage: z = P.next(x); z
./categories/examples/sets_cat.py: sage: z = P.next(x); z
./categories/examples/sets_cat.py: sage: pf.next()
./categories/examples/sets_cat.py: sage: pw.next()
./categories/examples/sets_cat.py: sage: pi.next()
./coding/punctured_code.py: values = I.next()
./coding/punctured_code.py: values = I.next()
./coding/reed_muller_code.py: xcoordinate = iterator.next()
./combinat/combinat.py: An iterator to use when the .first() and
.next(x) methods are provided.
./combinat/combinat.py: f = self.next(f)
./combinat/combinat.py: # Check whether .first() and .next(x) are
overridden in the subclass
./combinat/combinat.py: sage: C.next(2) # indirect doctest
./combinat/composition.py: sage: Compositions(4).next([1,1,2])
./combinat/integer_vector.py: sage:
IntegerVectors(2,3,min_slope=0).next(a)
./combinat/misc.py: sage: dll.next(1)
./combinat/misc.py: sage: dll.next(1)
./combinat/necklace.py: j = dll.next(j)
./combinat/necklace.py: j = dll.next(j)
./combinat/partition.py:Using the method ``.next(p)``, we can calculate
the 'next' partition
./combinat/partition.py: sage: Partitions(4).next([4])
./combinat/partition.py: sage: Partitions(4).next([1,1,1,1]) is None
./combinat/partition.py: sage: Partitions(4).next([4])
./combinat/partition.py: sage: Partitions(4).next([1,1,1,1]) is
None
./combinat/partition.py: sage: Partitions(3,
starting=[2,1]).next(Partition([2,1]))
./combinat/partition.py: sage: Partitions(4,
ending=[1,1,1,1]).next(Partition([4]))
./combinat/partition.py: sage: Partitions(4,
ending=[1,1,1,1]).next(Partition([1,1,1,1])) is None
./combinat/partition_algebra.py: sage: y = A2p5.next(x); y
./combinat/posets/hasse_diagram.py: sage: it.next()
./combinat/posets/hasse_diagram.py: sage: it.next()
./data_structures/bitset.pyx: a.next(n) 4
./data_structures/bitset.pyx: a.next(n) 2
./data_structures/bitset.pyx: a.next(n) -1
./data_structures/bitset.pyx: a.next(n) 71
./data_structures/bitset.pyx: print("a.next(n) ",
bitset_next(a, n))
./graphs/strongly_regular_db.pyx: return
twograph_descendant(g, g.vertex_iterator().next(), name=True)
./groups/perm_gps/partn_ref/canonical_augmentation.pyx: aug =
cur_iter.next( cur_iter.data, &cgd.degree_stack[cgd.level], &cgd.mem_err )
./groups/perm_gps/partn_ref/refinement_graphs.pyx: edge_candidate =
<subset *> degd.edge_iterator.next(degd.edge_iterator.data, NULL,
&mem_err_sub)
./groups/perm_gps/partn_ref/refinement_graphs.pyx: thing =
graph_iterator.next(graph_iterator.data, NULL, &mem_err)
./groups/perm_gps/partn_ref/refinement_graphs.pyx: thing =
graph_iterator.next(graph_iterator.data, NULL, &mem_err)
./groups/perm_gps/partn_ref/refinement_graphs.pyx: thing =
graph_iterator.next(graph_iterator.data, NULL, &mem_err)
./groups/perm_gps/partn_ref/refinement_graphs.pyx: thing =
graph_iterator.next(graph_iterator.data, NULL, &mem_err)
./groups/perm_gps/partn_ref/refinement_sets.pyx: thing = <subset *>
subset_iterator.next(subset_iterator.data, NULL, &mem_err)
./homology/simplicial_complex.py: F = it[-1].next()
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: cdef int token = self.next()
./misc/parser.pyx: token = self.next()
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: sage: token_to_str(t.next())
./misc/parser.pyx: tokens.next()
./misc/parser.pyx: if tokens.next() != EOS:
./misc/parser.pyx: if tokens.next() != EOS:
./misc/parser.pyx: if tokens.next() != EOS:
./misc/parser.pyx: if tokens.next() == '(':
./misc/parser.pyx: token = tokens.next()
./misc/parser.pyx: tokens.next()
./misc/parser.pyx: tokens.next()
./misc/parser.pyx: token = tokens.next()
./misc/parser.pyx: cdef int token = tokens.next()
./misc/parser.pyx: token = tokens.next()
./misc/parser.pyx: cdef int token = tokens.next()
./misc/parser.pyx: token = tokens.next()
./misc/parser.pyx: cdef int op = tokens.next()
./misc/parser.pyx: op = tokens.next()
./misc/parser.pyx: op = tokens.next()
./misc/parser.pyx: op = tokens.next()
./misc/parser.pyx: op = tokens.next()
./misc/parser.pyx: cdef int token = tokens.next()
./misc/parser.pyx: cdef int token = tokens.next()
./misc/parser.pyx: tokens.next()
./misc/parser.pyx: cdef int token = tokens.next()
./misc/parser.pyx: token = tokens.next()
./misc/parser.pyx: token = tokens.next()
./misc/parser.pyx: token = tokens.next()
./misc/parser.pyx: token = tokens.next()
./misc/parser.pyx: cdef int token = tokens.next()
./misc/parser.pyx: tokens.next()
./parallel/map_reduce.py: sage: it.next()
./parallel/map_reduce.py: node = newnodes.next()
./parallel/map_reduce.py: sage: it.next() # random
./parallel/map_reduce.py: sage: it.next() # random
./rings/fraction_field_FpT.pyx: ....: a = a.next()
./rings/polynomial/pbori.pyx: self._iter.next()
./rings/polynomial/pbori.pyx: self._iter.next()
./rings/polynomial/pbori.pyx: d = iter(M).next().degree()
./rings/polynomial/pbori.pyx: self._iter.next()
./rings/polynomial/pbori.pyx: self._iter.next()
./rings/polynomial/pbori.pyx: self._iter.next()
./rings/polynomial/pbori.pyx: start = start.next()
./rings/polynomial/pbori.pyx: it = it.next()
./schemes/projective/endPN_automorphism_group.py: p =
primes.next(ZZ(prime_lower_bound))
./schemes/projective/endPN_automorphism_group.py: p =
primes.next(p)
./sets/integer_range.py: sage: (I.next(0), I.next(10),
I.next(-10), I.next(20), I.next(-100))
./sets/integer_range.py: sage: (I.next(0), I.next(10),
I.next(-10), I.next(20), I.next(-100))
./sets/integer_range.py: sage: I.next(1)
./sets/integer_range.py: n = self.next(n)
./sets/non_negative_integers.py: sage: NN.next(3)
./sets/primes.py: sage: P.next(5)
}}}
--
Ticket URL: <https://trac.sagemath.org/ticket/21110#comment:3>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
