#18347: implement the shard intersection order on permutations
-------------------------------------------------+-------------------------
Reporter: chapoton | Owner:
Type: enhancement | Status: closed
Priority: minor | Milestone: sage-6.8
Component: combinatorics | Resolution: fixed
Keywords: poset | Merged in:
Authors: Frédéric Chapoton | Reviewers: Vincent
Report Upstream: N/A | Delecroix
Branch: | Work issues:
854de651af7850b6e6c7387c7b54a7544eec7b4f | Commit:
Dependencies: | Stopgaps:
-------------------------------------------------+-------------------------
Comment (by vdelecroix):
The problem is that this error will not be solved by inheriting from
`SageObject` since we need to initialize the content of the tuple... The
inheritance from `tuple` is here for speed (the methods use `__hash__` and
`__eq__`).
Does the same warning show up with the following?
{{{
sage: class A(tuple):
....: def __init__(self, a):
....: tuple.__init__(a)
sage: a = A([1,2,3])
}}}
It works without any warning in IPython console...
--
Ticket URL: <http://trac.sagemath.org/ticket/18347#comment:33>
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.
