Cross Reference: /libcore/ojluni/src/main/java/java/util/TreeMap.java

Lines Matching defs:fence
1336      * Dummy value serving as unmatchable fence key for unbounded
1474         /** Returns the absolute high fence for ascending traversal */
1481         /** Return the absolute low fence for descending traversal  */
1693                            TreeMapEntry<K,V> fence) {
1697                 fenceKey = fence == null ? UNBOUNDED : fence.key;
1753                                 TreeMapEntry<K,V> fence) {
1754                 super(first, fence);
1766                                           TreeMapEntry<K,V> fence) {
1767                 super(last, fence);
1782                               TreeMapEntry<K,V> fence) {
1783                 super(first, fence);
1820                                         TreeMapEntry<K,V> fence) {
1821                 super(last, fence);
2678      * origin and continues up to but not including a given fence (or
2680      * split uses the root as left-fence/right-origin. From there,
2681      * right-hand splits replace the current fence with its left
2704         TreeMapEntry<K,V> fence;   // one past last, or null
2710                            TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence,
2714             this.fence = fence;
2743                        TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence,
2745             super(tree, origin, fence, side, est, expectedModCount);
2752             TreeMapEntry<K,V> e = current, f = fence,
2772             TreeMapEntry<K,V> f = fence, e, p, pl;
2797             if ((e = current) == null || e == fence)
2821                                  TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence,
2823             super(tree, origin, fence, side, est, expectedModCount);
2830             TreeMapEntry<K,V> e = current, f = fence,
2850             TreeMapEntry<K,V> f = fence, e, p, pr;
2875             if ((e = current) == null || e == fence)
2894                          TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence,
2896             super(tree, origin, fence, side, est, expectedModCount);
2903             TreeMapEntry<K,V> e = current, f = fence,
2923             TreeMapEntry<K,V> f = fence, e, p, pl;
2948             if ((e = current) == null || e == fence)
2966                          TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence,
2968             super(tree, origin, fence, side, est, expectedModCount);
2975             TreeMapEntry<K,V> e = current, f = fence,
2995             TreeMapEntry<K,V> f = fence, e, p, pl;
3020             if ((e = current) == null || e == fence)