Changes between Version 20 and Version 21 of Ticket #10950
 Timestamp:
 10/24/17 15:36:54 (2 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Ticket #10950 – Description
v20 v21 6 6 [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] 7 7 }}} 8 9 I stumbled on this when profiling some code using Weyl groups that 10 heavily used caching (the hash of a weyl group element is the hash of the underlying matrix). I gained a speed factor of 10x by just tweaking the hash of matrices. 11 12 Cheers, 13 Nicolas 14 8 15 9 16 After applying this branch: … … 28 35 }}} 29 36 30 I stumbled on this when profiling some code using Weyl groups that 31 heavily used caching (the hash of a weyl group element is the hash of the underlying matrix). I gained a speed factor of 10x by just tweaking the hash of matrices as in the attached patch. Now, I have no idea if in general that would be a good hash for matrices, so please some expert write an appropriate patch. 37 As extra bonus, this branch ensures that scalar matrices have the same hash as the scalar. This means one extra case where `A == B` implies `hash(A) == hash(B)`. 32 38 33 Cheers,34 Nicolas