#20246: Use `with strict_equality(True)` to work around hashing of p-adics
-------------------------------+------------------------
Reporter: saraedum | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-7.2
Component: padics | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
-------------------------------+------------------------
Description changed by saraedum:
Old description:
> Here are some timings. In all these examples, `X = toric_varieties.dP8()`
> and we consider `%timeit [X.cohomology_basis(1) for i in range(1000)]`.
>
> The current `cachefunc.pyx` (using `_cache_key` in a try-finally-block):
> {{{
> 1000 loops, best of 3: 419 µs per loop
> }}}
> The old version which does not handle unhashable objects at all:
> {{{
> 1000 loops, best of 3: 387 µs per loop
> }}}
> The proposed implementation:
> {{{
> 1000 loops, best of 3: 395 µs per loop
> }}}
New description:
TODO: Explain what happens here.
Here are some timings. In all these examples, `X = toric_varieties.dP8()`
and we consider `%timeit [X.cohomology_basis(1) for i in range(1000)]`.
The current `cachefunc.pyx` (using `_cache_key` in a try-finally-block):
{{{
1000 loops, best of 3: 419 µs per loop
}}}
The old version which does not handle unhashable objects at all:
{{{
1000 loops, best of 3: 387 µs per loop
}}}
The proposed implementation:
{{{
1000 loops, best of 3: 395 µs per loop
}}}
--
--
Ticket URL: <http://trac.sagemath.org/ticket/20246#comment:2>
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.
