-
-
Notifications
You must be signed in to change notification settings - Fork 481
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Combinatorial Rooted Ordered and Binary Trees #8703
Comments
comment:1
This is an experiment to see if user chapoton is receiving e-mail from trac... |
comment:2
Updated a new patch after modification in #8702. Close to but not ready for review. |
comment:3
Added Frédéric as an author to make sure not to forget him. He contributed several functions. |
Changed author from Florent Hivert to Florent Hivert, Frédéric Chapoton |
Changed keywords from none to trees |
Dependencies: #8702 |
This comment has been minimized.
This comment has been minimized.
comment:5
I just uploaded a new patch wich speedup element creation and remove some unnecessary imports. |
comment:6
There seems to be a problem with attributes insert, contains, get, get_min, get_max and contains. Please see the report of the buildbot. |
comment:7
Replying to @fchapoton:
Yes ! There is already something in sage which is called |
Work Issues: Backward incompat change decision |
Changed work issues from Backward incompat change decision to none |
This comment has been minimized.
This comment has been minimized.
comment:10
Fixed 'labeled' vs 'labelled' |
comment:11
Addressed Frederic Chaponton's remark (private email) about labelled/unlabelled. |
comment:12
Fixed doctests. |
Changed keywords from trees to trees, Cernay2012 |
comment:14
Hellooooooo Florent ! Here is a patch with some more documentation for the class. We discussed it a lot already, and there were two more things I had stored in a file while beginning the review. Some notes before we forget :
Nathann P.S. : I updated the combinat queue -- how unusual for me ! |
comment:58
Thanks Frédéric for the review patches. I have had a quick look and it seems alright. Anyway, Florent should look at the state of things now to see if he's happy and maybe we can go for a positive review! |
Reviewer: Florent Hivert, Frédéric Chapoton, Viviane Pons |
comment:61
Attachment: trac_8703-trees-folded.patch.gz I folded the patches for the release manager. Florent |
This comment has been minimized.
This comment has been minimized.
comment:62
This shouldn't be in the commit message:
|
comment:63
And this patch should be rebased to sage-5.9.beta5. |
comment:65
Attachment: trac_8703-trees-rebased.patch.gz Rebased patch. For patchbot: Apply: trac_8703-trees-rebased.patch |
This comment has been minimized.
This comment has been minimized.
comment:66
Please review #14433, otherwise this patch cannot be merged. |
Merged: sage-5.10.beta0 |
The patch defines several new classes for dealing with
rooted recursive ordered trees (labelled and not)
binary trees (labelled and not)
It also add the computation of the binary search tree and the decreasing or increasing tree for a permutation
It finally defines the bijection to Dyck words
Apply:
Depends on #8702
Depends on #14433
Dependencies: #8702, merge with #14433
CC: @fchapoton @sagetrac-sage-combinat @VivianePons @darijgr
Component: combinatorics
Keywords: trees, Cernay2012
Author: Florent Hivert, Frédéric Chapoton
Reviewer: Florent Hivert, Frédéric Chapoton, Viviane Pons
Merged: sage-5.10.beta0
Issue created by migration from https://trac.sagemath.org/ticket/8703
The text was updated successfully, but these errors were encountered: