#11529: Rooted trees
-------------------------------------+-------------------------------------
Reporter: hivert | Owner: hivert
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-6.7
Component: combinatorics | Resolution:
Keywords: rooted trees | Merged in:
Authors: Florent Hivert | Reviewers: Frédéric Chapoton,
Report Upstream: N/A | Darij Grinberg, Travis Scrimshaw
Branch: | Work issues:
public/combinat/11529 | Commit:
Dependencies: | dc8120fd74f1d65a812e96c33afc9a8ca9a0bc8e
| Stopgaps:
-------------------------------------+-------------------------------------
Comment (by hivert):
Replying to [comment:93 tscrim]:
> The easier test to make sure the hash is working is to do something like
`hash(x) == hash(x)` (unless of course you're expecting a specific value,
like `hash(1) == 1`), and it doesn't cause trivial doctest failures for
changes to the hash function, but it probably doesn't really matter here.
If you use the same `x` then you are not testing anything serious. A good
test would be `hash(x) == hash(y)` with `x` and `y` two distinct but
equal objects.
Florent which is coming back to Sage after a long absence.
--
Ticket URL: <http://trac.sagemath.org/ticket/11529#comment:94>
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.
