Lines Matching defs:fence
1485 int fence; // one past last index
1490 int fence, int est,
1494 this.fence = fence;
1499 final int getFence() { // initialize fence and size on first use
1501 if ((hi = fence) < 0) {
1506 hi = fence = (tab == null) ? 0 : tab.length;
1520 KeySpliterator(HashMap<K,V> m, int origin, int fence, int est,
1522 super(m, origin, fence, est, expectedModCount);
1538 if ((hi = fence) < 0) {
1540 hi = fence = (tab == null) ? 0 : tab.length;
1584 return (fence < 0 || est == map.size ? Spliterator.SIZED : 0) |
1592 ValueSpliterator(HashMap<K,V> m, int origin, int fence, int est,
1594 super(m, origin, fence, est, expectedModCount);
1610 if ((hi = fence) < 0) {
1612 hi = fence = (tab == null) ? 0 : tab.length;
1656 return (fence < 0 || est == map.size ? Spliterator.SIZED : 0);
1663 EntrySpliterator(HashMap<K,V> m, int origin, int fence, int est,
1665 super(m, origin, fence, est, expectedModCount);
1681 if ((hi = fence) < 0) {
1683 hi = fence = (tab == null) ? 0 : tab.length;
1727 return (fence < 0 || est == map.size ? Spliterator.SIZED : 0) |