Lines Matching defs:fence
1386 int fence; // -1 until first use; then one past last index
1388 int expectedModCount; // initialized when fence set
1391 int fence, int est, int expectedModCount) {
1394 this.fence = fence;
1399 final int getFence() { // initialize fence and size on first use
1401 if ((hi = fence) < 0) {
1404 hi = fence = map.table.length;
1418 KeySpliterator(IdentityHashMap<K,V> map, int origin, int fence, int est,
1420 super(map, origin, fence, est, expectedModCount);
1468 return (fence < 0 || est == map.size ? SIZED : 0) | Spliterator.DISTINCT;
1475 ValueSpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est,
1477 super(m, origin, fence, est, expectedModCount);
1526 return (fence < 0 || est == map.size ? SIZED : 0);
1534 EntrySpliterator(IdentityHashMap<K,V> m, int origin, int fence, int est,
1536 super(m, origin, fence, est, expectedModCount);
1593 return (fence < 0 || est == map.size ? SIZED : 0) | Spliterator.DISTINCT;