> - For #7922: understanding why in your example the hash function gets
>called sooo often. For this, we should look at a smallest possible
>example where hash is obviously called too often.
I have discovered that making _weight_multiplicities a cached method
seems to fix the timing prob
> - For #7922: understanding why in your example the hash function gets
>called sooo often. For this, we should look at a smallest possible
>example where hash is obviously called too often.
>
> - Independently on #7922: creating a new ticket for optimizing hash
>and equality tests
On Sun, Feb 27, 2011 at 07:00:22AM -0800, bump wrote:
> Something is wrong, however. Before the patches, the following takes
> about 32 seconds:
>
> A2=WeylCharacterRing("A2",style="coroots")
> A7=WeylCharacterRing("A7",style="coroots")
> s = A7.fundamental_weights()[1]
> ad=A2(1,1)
> time A7(5*s
> On this example, it's 20% faster; I guess the gain would increase on
> larger elements. Besides it does not depend on the basis index to be
> sortable.
I applied the two patches trac_7922-reviewer-nt.patch and trac_7922-
hash-nt.patch.
Something is wrong, however. Before the patches, the follo
