#19659: Poset: inverse function of ordinal_sum()
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.0
Component: combinatorics | Resolution:
Keywords: poset | Merged in:
Authors: Jori Mäntysalo, | Reviewers: Nathann Cohen, Jori
Nathann Cohen | Mäntysalo
Report Upstream: N/A | Work issues:
Branch: public/19659 | Commit:
Dependencies: | 1385d69b99c5060821463ef513b0478a062db942
| Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
Hello,
I slowly used more and more booleans for these things as it reduces the
risk of typoes. Any typo in the argument's name raises an automatic
exception (that's Python), and the same goes for !True/False (if you make
a typo, that's an undefined variable). The code is also simpler as you
don't have to do `if x==A/elif x==B/else ValueError`.
You will find many boolean functions with such a boolean argument:
!IncidenceStructure.is_t_design, Graph.is_strongly_regular,
Graph.automorphism_group, Graph.is_isomorphic.
The use of a string argument is, in the graph library at least, more often
used to select an algorithm/method to perform the requested computation
(e.g. Graph.maximum_clique).
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19659#comment:55>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
