Opened 11 years ago
Last modified 8 years ago
#12518 closed enhancement
Enumerated set from iterator — at Version 3
Reported by: | Vincent Delecroix | Owned by: | Vincent Delecroix |
---|---|---|---|
Priority: | major | Milestone: | sage-5.6 |
Component: | combinatorics | Keywords: | set, iterator |
Cc: | Štěpán Starosta | Merged in: | |
Authors: | vdelecroix | Reviewers: | |
Report Upstream: | N/A | Work issues: | |
Branch: | Commit: | ||
Dependencies: | Stopgaps: |
Description (last modified by )
Implementation of a set (using the category framework) from a function that returns an iterator. Building a set directly from an iterator leads to the impossibility of pickling.
A previous implementation in sage-combinat was CombinatorialClassFromIterator? (in sage.combinat.combinat) which is now deprecated.
Change History (3)
comment:1 Changed 11 years ago by
comment:2 Changed 11 years ago by
Cc: | Štěpán Starosta added |
---|
comment:3 Changed 11 years ago by
Description: | modified (diff) |
---|
Note: See
TracTickets for help on using
tickets.
Hi,
I'm in trouble with two points:
1) What to do with the equality test when the set are both infinite ? (see in the patch the warning printing on stderr)
2) What is the good way to implement the decorator for a method ? The implementation for functions work quite well but in sage.misc.cachefunc the implementation for methods rather than functions seem more tricky.