#16320: Handle finite slices for infinite enumerate sets
-------------------------------------+-------------------------------------
Reporter: tscrim | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.3
Component: categories | Resolution:
Keywords: infinite | Merged in:
enumerated set slices | Reviewers: Nathann Cohen
Authors: Travis Scrimshaw | Work issues:
Report Upstream: N/A | Commit:
Branch: | 1998e42335312510b53cea35d9aeabd1b52a9cdf
public/infinite_enum_set_slices-16320| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by nthiery):
> The `__getitem__` I have for finite enumerated sets should be faster
than calling through unrank().
It seems to just duplicate the code of `unrank_range` for finite
enumerated sets (which you made fast), and the `__getitem__` of enumerated
sets will call that `unrank_range` anyway.
> I can't add crosslinks because there is no explicitly defined function
unrank (at least that I could find).
Too bad, we really should have an optional abstract method for `unrank`
...
--
Ticket URL: <http://trac.sagemath.org/ticket/16320#comment:19>
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.
