#19562 is probably the best fix, but really that makes FiniteEnumeratedSet not really any different than our (finite) Sequence class. I'm thinking we need some sort of unification long-term.
> Also, instead of Subsets(L), I would also use subsets(L) (or powerset(L)) > > as you don't need the set of all subsets to be a parent. > > I see now that those functions don't support an argument for which size > subsets you need (which is critical in my application). > > Then use itertools: sage: import itertools sage: list(itertools.combinations(range(3), 2)) [(0, 1), (0, 2), (1, 2)] Best, Travis -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
