#8703: Combinatorial Rooted Ordered and Binary Trees
-------------------------------------------------+--------------------------
Reporter: hivert | Owner: hivert
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-4.7.1
Component: combinatorics | Keywords: trees
Work_issues: Backward incompat change decision | Upstream: N/A
Reviewer: | Author: Florent
Hivert, Frédéric Chapoton
Merged: | Dependencies: #8702
-------------------------------------------------+--------------------------
Changes (by hivert):
* status: needs_review => needs_info
* work_issues: => Backward incompat change decision
Comment:
Replying to [comment:6 chapoton]:
> There seems to be a problem with attributes insert, contains, get,
get_min, get_max and contains. Please see the report of the buildbot.
Yes ! There is already something in sage which is called {{{BinaryTree}}}.
I
just asked for an incompatible change on
[https://groups.google.com/group/sage-
devel/browse_thread/thread/1856db31a5cc54f2?hl=fr sage-devel] and
[http://groups.google.com/group/sage-combinat-
devel/browse_thread/thread/1856db31a5cc54f2 sage-combinat-devel]
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8703#comment:7>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.