#18941: Poset documentation polishing: chains and antichains
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.9
Component: documentation | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers: Kevin Dilks
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/poset_polishing_chains| ecb16e648cdff2cb22bc88c7fd01f114af8006a5
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
Replying to [comment:25 ncohen]:
> > Duh. So there is no way at all in Python to check if a given container
item has fixed order?
>
> What is a 'fixed order' from the point of view of the computer? What you
want to know is if the order given is the one *intended* by the user.
By fixed order I meant deterministic output. After `x=['a',1]` we always
have `x[1]==1` in every implementation of Python. After `y={'a', 1}` we
always get error from `y[1]`. After `z=Set(x)` we don't know the output of
`z[1]`. (Which sounds odd... "second item of a set"?)
But anyway, thanks. I will change the code. As all kinds of iterables were
accepted before, I guess that is the way to continue. And it makes no
sense to pick out most common "wrong" types, as it would give false
impression of security to the user.
--
Ticket URL: <http://trac.sagemath.org/ticket/18941#comment:26>
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.
