#6637: standardize the interface to TransitiveIdeal and friends
-----------------------------------------------------------------+----------
Reporter: nthiery |
Owner: mhansen
Type: enhancement |
Status: new
Priority: major |
Milestone: sage-5.7
Component: combinatorics |
Resolution:
Keywords: backtrack, enumerated set, transitive closure | Work
issues:
Report Upstream: N/A |
Reviewers:
Authors: | Merged
in:
Dependencies: |
Stopgaps:
-----------------------------------------------------------------+----------
Comment (by slabbe):
I just added a patch. It implements the `RecursiveSet_symmetric` class and
creates factory called `RecursiveSet`. For now, `RecursiveSet` returns
either an instance of `TransitiveIdeal`, `SearchForest` or
`RecursiveSet_symmetric`. I started an empty class `RecursiveSet_graded`.
See examples inside the docstring of the class `RecursiveSet`.
It is not ready for review, but comments are welcome to help me continue
this work.
Actually, my questions are :
- How should I merge `RecursiveSet` with `TransitiveIdeal` and
`SearchForest`?
- Do we like this interface?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6637#comment:9>
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 http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
