7) var o2 = O(i: 7) var r1 = R(j: 13) var r2 = R(j: 13) echo o1 == o2 echo r1 == r2 var t1: Table[O, float] t1[o1] = 3.1415 echo t1.hasKey(o2) var t2: Table[R, float] t2[r1] = 2.7 echo t2.hasKey(r2) entries. But to make this work, we have to partition the full range in the first half r1, so that all entries of range r1 are smaller or equal to a median value x, and so that all entries in the second half

7) var o2 = O(i: 7) var r1 = R(j: 13) var r2 = R(j: 13) echo o1 == o2 echo r1 == r2 var t1: Table[O, float] t1[o1] = 3.1415 echo t1.hasKey(o2) var t2: Table[R, float] t2[r1] = 2.7 echo t2.hasKey(r2) entries. But to make this work, we have to partition the full range in the first half r1, so that all entries of range r1 are smaller or equal to a median value x, and so that all entries in the second half

7) var o2 = O(i: 7) var r1 = R(j: 13) var r2 = R(j: 13) echo o1 == o2 echo r1 == r2 var t1: Table[O, float] t1[o1] = 3.1415 echo t1.hasKey(o2) var t2: Table[R, float] t2[r1] = 2.7 echo t2.hasKey(r2) entries. But to make this work, we have to partition the full range in the first half r1, so that all entries of range r1 are smaller or equal to a median value x, and so that all entries in the second half

7) var o2 = O(i: 7) var r1 = R(j: 13) var r2 = R(j: 13) echo o1 == o2 echo r1 == r2 var t1: Table[O, float] t1[o1] = 3.1415 echo t1.hasKey(o2) var t2: Table[R, float] t2[r1] = 2.7 echo t2.hasKey(r2) entries. But to make this work, we have to partition the full range in the first half r1, so that all entries of range r1 are smaller or equal to a median value x, and so that all entries in the second half

7) var o2 = O(i: 7) var r1 = R(j: 13) var r2 = R(j: 13) echo o1 == o2 echo r1 == r2 var t1: Table[O, float] t1[o1] = 3.1415 echo t1.hasKey(o2) var t2: Table[R, float] t2[r1] = 2.7 echo t2.hasKey(r2) entries. But to make this work, we have to partition the full range in the first half r1, so that all entries of range r1 are smaller or equal to a median value x, and so that all entries in the second half

7) var o2 = O(i: 7) var r1 = R(j: 13) var r2 = R(j: 13) echo o1 == o2 echo r1 == r2 var t1: Table[O, float] t1[o1] = 3.1415 echo t1.hasKey(o2) var t2: Table[R, float] t2[r1] = 2.7 echo t2.hasKey(r2) entries. But to make this work, we have to partition the full range in the first half r1, so that all entries of range r1 are smaller or equal to a median value x, and so that all entries in the second half

7) var o2 = O(i: 7) var r1 = R(j: 13) var r2 = R(j: 13) echo o1 == o2 echo r1 == r2 var t1: Table[O, float] t1[o1] = 3.1415 echo t1.hasKey(o2) var t2: Table[R, float] t2[r1] = 2.7 echo t2.hasKey(r2) entries. But to make this work, we have to partition the full range in the first half r1, so that all entries of range r1 are smaller or equal to a median value x, and so that all entries in the second half

7) var o2 = O(i: 7) var r1 = R(j: 13) var r2 = R(j: 13) echo o1 == o2 echo r1 == r2 var t1: Table[O, float] t1[o1] = 3.1415 echo t1.hasKey(o2) var t2: Table[R, float] t2[r1] = 2.7 echo t2.hasKey(r2) entries. But to make this work, we have to partition the full range in the first half r1, so that all entries of range r1 are smaller or equal to a median value x, and so that all entries in the second half

7) var o2 = O(i: 7) var r1 = R(j: 13) var r2 = R(j: 13) echo o1 == o2 echo r1 == r2 var t1: Table[O, float] t1[o1] = 3.1415 echo t1.hasKey(o2) var t2: Table[R, float] t2[r1] = 2.7 echo t2.hasKey(r2) entries. But to make this work, we have to partition the full range in the first half r1, so that all entries of range r1 are smaller or equal to a median value x, and so that all entries in the second half

7) var o2 = O(i: 7) var r1 = R(j: 13) var r2 = R(j: 13) echo o1 == o2 echo r1 == r2 var t1: Table[O, float] t1[o1] = 3.1415 echo t1.hasKey(o2) var t2: Table[R, float] t2[r1] = 2.7 echo t2.hasKey(r2) entries. But to make this work, we have to partition the full range in the first half r1, so that all entries of range r1 are smaller or equal to a median value x, and so that all entries in the second half