Trac #17693: mutable poset: a data structure for asymptotic expressions

The aim of this ticket is to implement a data structure which is to be used within an asymptotic expression (see Meta-Ticket #17601). This mutable poset stores elements together with its successors and predecessors. Those data is updated when a new element is inserted or an element is removed. It offers a couple of efficient routines for manipulations (all of which will be needed for the asymptotic expression). URL: http://trac.sagemath.org/17693 Reported by: dkrenn Ticket author(s): Daniel Krenn Reviewer(s): Benjamin Hackl, Clemens Heuberger
sagemath · Oct 11, 2015 · dbd82f3 · dbd82f3
2 parents 34f358b + a0b3d7b
commit dbd82f3
Show file tree

Hide file tree

Showing 2 changed files with 3,524 additions and 0 deletions.
diff --git a/src/doc/en/reference/data_structures/index.rst b/src/doc/en/reference/data_structures/index.rst
@@ -7,5 +7,6 @@ Data Structures
    sage/misc/binary_tree
    sage/data_structures/bitset
    sage/data_structures/bounded_integer_sequences
+   sage/data_structures/mutable_poset
 
 .. include:: ../footer.txt