Hi,
Sorry no I can't do that... it was a fix because of the indentation in the
file graphics.py. I don't know what is the problem (my patch comments the
some line normally). You are allow to remove or what ever do with that.
(I won't touch my Sage because of the FPSAC software demo this
Hi all,
I am sure some of you have been thinking about that before:
sage: a = Permutation([3,2,1])
sage: b = Partition([3,2,1])
sage: c = Composition([3,2,1])
sage: a == b == c
True
sage: hash(a) == hash(b) == hash(c)
True
Is this desired behaviour?
Thanks, Christian
--
You received this
Hi Christian,
On Tue, Jun 25, 2013 at 03:03:51PM +0200, Christian Stump wrote:
I am sure some of you have been thinking about that before:
sage: a = Permutation([3,2,1])
sage: b = Partition([3,2,1])
sage: c = Composition([3,2,1])
sage: a == b == c
True
sage: hash(a) == hash(b) ==
Hi Nicolas,
to use the Cythonized class
ClonableList instead of CombinatorialObject: I just checked and
ClonableList._hash_ takes the parent into account.
Thanks Nicolas! Is this still planned to happen in the not too far future?
--
You received this message because you are subscribed to
On Tue, Jun 25, 2013 at 03:26:43PM +0200, Christian Stump wrote:
Thanks Nicolas! Is this still planned to happen in the not too far future?
It should be a one-day project, if there is a volunteer. It does not
have to be done all at once and the changes should be reasonably
localized and not
That is, if we postpone the optimization of the various methods to take
better advantage of clonable lists, but that's ok.
would this eventually also improve the speed to check dict containment
of such elements?
--
You received this message because you are subscribed to the Google Groups
