#5308: [with patch, needs review] Removing __len__ for combinatorial classes
(depend on #5200,#4549)
---------------------------+------------------------------------------------
Reporter: hivert | Owner: hivert
Type: enhancement | Status: assigned
Priority: major | Milestone: sage-combinat
Component: combinatorics | Keywords: __len__, count, combinatorial class
---------------------------+------------------------------------------------
Comment(by nthiery):
In CartesianProduct, shouldn't we test first if it.cardinality works, and
resort to len if this raised an AttributeError?
Line 3 of the doc of InfiniteAbstractCombinatorialClass:
- inerit -> inherit, wich -> which, count -> cardinality, ...
The log of the patch should advertise this new class
In CyclicPermutations: leave at least a note that this deviates from the
standard (__iter__/list take no argument), and should be cleaned up
further at some point
In the examples (like in SemistandardTableaux), do we want to use: {{{[t
for t in iterable]}}} or {{{list(iterable)}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5308#comment:6>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
