#19024: Posets: Faster order filter and ideal
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: poset | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/posets__faster_order_filter_and_ideal|
1757b712041aea1b74853d19300222ac91d36824
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by jmantysalo):
* status: needs_work => needs_review
Comment:
Back to needs_review. I somehow think that `[x for x in some_iterator]` is
odd, seems like something has been forgotten. ("Should it be `x+1 for
x...`?)
`interval()` says "The order is that induced by the ordering in
`self.linear_extension`". These functions do not, but the doctests suppose
sorted output.
--
Ticket URL: <http://trac.sagemath.org/ticket/19024#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 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.
For more options, visit https://groups.google.com/d/optout.
