#16748: FinitePoset argument parsing is not robust enough
-----------------------------+----------------------------
Reporter: tscrim | Owner: tscrim
Type: defect | Status: new
Priority: major | Milestone: sage-6.3
Component: combinatorics | Keywords:
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+----------------------------
Currently we have
{{{
sage: P = Poset([[],[[0,1]]])
sage: Q = Poset([[],[[0,2]]])
sage: R = Q.canonical_label()
sage: P.hasse_diagram() == R.hasse_diagram()
True
sage: list(P) == list(R)
True
sage: P.cover_relations() == R.cover_relations()
True
sage: P is R
False
sage: P == R
False
}}}
The issue is that `FinitePoset` doesn't parse the arguments to a standard
form as much as it should.
--
Ticket URL: <http://trac.sagemath.org/ticket/16748>
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.
