HomeSort by relevance Sort by last modified time
    Searched defs:adjacent (Results 1 - 2 of 2) sorted by null

  /external/llvm/include/llvm/ADT/
IntervalMap.h 116 // Adjacent intervals that map to the same value are coalesced.
119 // in an interval, and if two intervals are adjacent so they can be coalesced.
146 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
148 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo
524 // The intervals are kept sorted and fully coalesced so there are no adjacent
533 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
614 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) {
617 if (i != Size && value(i) == y && Traits::adjacent(b, start(i))) {
639 if (value(i) == y && Traits::adjacent(b, start(i))) {
    [all...]
  /libcore/luni/src/main/java/java/util/
TreeMap.java 247 * Returns the node at or adjacent to the given key, creating it if requested.
381 * adjacent node from one of those subtrees into this node's place.
383 * Removing the adjacent node may change this node's subtrees. This
384 * node may no longer have two subtrees once the adjacent node is
388 Node<K, V> adjacent = (left.height > right.height) ? left.last() : right.first(); local
389 removeInternal(adjacent); // takes care of rebalance and size--
395 adjacent.left = left;
396 left.parent = adjacent;
403 adjacent.right = right;
404 right.parent = adjacent;
    [all...]

Completed in 217 milliseconds