#16351: Move SearchForest code to sage/sets/recursively_enumerated_set.pyx
-------------------------------------+-------------------------------------
Reporter: slabbe | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-7.0
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/hivert/move_searchforest_code_to_sage_sets_recursively_enumerated_set_pyx|
1bf8c97ef9e6479ede07b339b11d413819508307
Dependencies: #13580 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by tscrim):
Something else that we should do while-we-are-at-it, we should consider
using `collections.deque` since it supports fast popping from both ends
(`list` can become really slow when popping at the front, but `deque` is
still twice as slow popping at the front).
--
Ticket URL: <http://trac.sagemath.org/ticket/16351#comment:8>
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.
