TreeNode.tieBreakOrder

Tie-breaking utility for ordering insertions when equal hashCodes and non-comparable. We don't require a total order, just a consistent insertion rule to maintain equivalence across rebalancings. Tie-breaking further than necessary simplifies testing a bit.

  1. int tieBreakOrder(T a, T b)
    class TreeNode(K, V)
    static
    int
    tieBreakOrder
    (
    T
    )
    (
    T a
    ,
    T b
    )
    if (
    isBasicType!(T) ||
    isSomeString!T
    ||
    isByteArray!T
    )
  2. int tieBreakOrder(T a, T b)
  3. int tieBreakOrder(T a, T b)

Meta