#19141: Poset documentation polishing: Boolean-valued properties
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-6.10
Component: combinatorics | Resolution:
Keywords: poset | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/poset_documentation_polishing__boolean_valued_properties|
39d1e185906821d6fcece65560e1081eb11e1493
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by kdilks):
I know that 'chain' is standard terminology for a totally ordered poset,
but it seems unnecessarily confusing to have {{{is_chain()}}} and
{{{is_chain_of_poset()}}} floating around. Especially since
{{{is_chain_of_poset()}}} is much more likely to be used, and has the
harder to find/guess name.
Why not just have one function called {{{is_chain()}}} that currently does
what {{{is_chain_of_poset()}}} currently does? If you want to want to find
out if you entire poset is a chain, you can run
{{{is_chain(P.elements())}}} . Or even
{{{is_isomorphic(Posets.ChainPoset(len(P.elements()))}}}. There aren't
special aliases for determining isomorphism type with any other family of
posets.
----
New commits:
||[http://git.sagemath.org/sage.git/commit/?id=39d1e185906821d6fcece65560e1081eb11e1493
39d1e18]||{{{Back to is_chain. Was a bad idea.}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/19141#comment:16>
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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
