id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
12518,Enumerated set from iterator,Vincent Delecroix,Vincent Delecroix,"Implementation of a set (using the category framework) from a function that returns an iterator as in
{{{
sage: from sage.sets.set_from_iterator import EnumeratedSetFromIterator
sage: E = EnumeratedSetFromIterator(graphs)
{Graph on 0 vertices, Graph on 1 vertex, Graph on 2 vertices, Graph on 2 vertices, Graph on 3 vertices, Graph on 3 vertices, ...}
}}}
Note that in order to be able to pickle, we do not build directly a set from an iterator.
A previous implementation in sage-combinat was CombinatorialClassFromIterator (in sage.combinat.combinat) which is now deprecated.
The patch depends on #12653 which allows to initialize a graph from a dictionnary of iterables.
'''Apply''': [attachment:trac_12518-enumerated_set_from_iterator-final.patch] and [attachment:trac_12518-enumerated_set_from_iterator-final_fix.patch]",enhancement,closed,major,sage-5.6,combinatorics,fixed,"set, iterator",Štěpán Starosta,sage-5.6.beta2,Vincent Delecroix,Travis Scrimshaw,N/A,,,,"#12653, #11795, #13778",