AngouriMath
SortKeyCache
Description
Summary
The keys, behind a struct that is equal to every other, for the reason
LazyPropertyA is: an Entity is a record and compares every
field, so a bare array here made two equal trees unequal the moment one had been
sorted -- and the simplifier, which recognises a repeated candidate by equality,
then never recognised one. Measured: 30 GB and 57 s onSimplifyHard .
field, so a bare array here made two equal trees unequal the moment one had been
sorted -- and the simplifier, which recognises a repeated candidate by equality,
then never recognised one. Measured: 30 GB and 57 s on
Members
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online