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 mess
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) == has
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 conf
> 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
"
On Tue, Jun 25, 2013 at 09:30:37PM +0200, Christian Stump wrote:
> > 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?
The h
