AngouriMath
CompareTo(AngouriMath.Core.Transformations.ENode)
Method (no overloads)
Summary
A total order on e-nodes, so that the members of one e-class can be visited in a
defined sequence. HashSet`1 enumeration order is an unspecified
implementation detail and a string's hash code is randomised per process, so a cost
tie between two members would otherwise be settled differently from one run to the
next -- against the premise that a bounded computation is reproducible given a defined
algorithm order. Ordinal on Op, so it does not move with the culture
either.
defined sequence. HashSet`1 enumeration order is an unspecified
implementation detail and a string's hash code is randomised per process, so a cost
tie between two members would otherwise be settled differently from one run to the
next -- against the premise that a bounded computation is reproducible given a defined
algorithm order. Ordinal on Op, so it does not move with the culture
either.
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online