Home
last modified time | relevance | path

Searched refs:ph (Results 1 – 8 of 8) sorted by relevance

/libcore/ojluni/src/main/java/java/util/stream/
DStreamSpliterators.java72 final PipelineHelper<P_OUT> ph; field in StreamSpliterators.AbstractWrappingSpliterator
115 AbstractWrappingSpliterator(PipelineHelper<P_OUT> ph, in AbstractWrappingSpliterator() argument
118 this.ph = ph; in AbstractWrappingSpliterator()
128 AbstractWrappingSpliterator(PipelineHelper<P_OUT> ph, in AbstractWrappingSpliterator() argument
131 this.ph = ph; in AbstractWrappingSpliterator()
230 return ph.exactOutputSizeIfKnown(spliterator);
238 … int c = StreamOpFlag.toCharacteristics(StreamOpFlag.toStreamFlags(ph.getStreamAndOpFlags()));
270 WrappingSpliterator(PipelineHelper<P_OUT> ph,
273 super(ph, supplier, parallel);
276 WrappingSpliterator(PipelineHelper<P_OUT> ph,
[all …]
DIntPipeline.java151 public final <P_IN> Spliterator<Integer> wrap(PipelineHelper<Integer> ph, in wrap() argument
154 return new StreamSpliterators.IntWrappingSpliterator<>(ph, supplier, isParallel); in wrap()
DLongPipeline.java149 public final <P_IN> Spliterator<Long> wrap(PipelineHelper<Long> ph, in wrap() argument
152 return new StreamSpliterators.LongWrappingSpliterator<>(ph, supplier, isParallel); in wrap()
DDoublePipeline.java148 public final <P_IN> Spliterator<Double> wrap(PipelineHelper<Double> ph, in wrap() argument
151 return new StreamSpliterators.DoubleWrappingSpliterator<>(ph, supplier, isParallel); in wrap()
DReferencePipeline.java122 public final <P_IN> Spliterator<P_OUT> wrap(PipelineHelper<P_OUT> ph, in wrap() argument
125 return new StreamSpliterators.WrappingSpliterator<>(ph, supplier, isParallel); in wrap()
DAbstractPipeline.java626 public abstract <P_IN> Spliterator<E_OUT> wrap(PipelineHelper<E_OUT> ph, in wrap() argument
/libcore/ojluni/src/main/java/java/util/
DHashMap.java2018 int ph, dir; K pk; in find() local
2020 if ((ph = p.hash) > h) in find()
2022 else if (ph < h) in find()
2084 int dir, ph; in treeify() local
2086 if ((ph = p.hash) > h) in treeify()
2088 else if (ph < h) in treeify()
2137 int dir, ph; K pk; in putTreeVal() local
2138 if ((ph = p.hash) > h) in putTreeVal()
2140 else if (ph < h) in putTreeVal()
/libcore/ojluni/src/main/java/java/util/concurrent/
DConcurrentHashMap.java2510 int ph = p.hash; K pk = p.key; V pv = p.val; in transfer() local
2511 if ((ph & n) == 0) in transfer()
2512 ln = new Node<K,V>(ph, pk, pv, ln); in transfer()
2514 hn = new Node<K,V>(ph, pk, pv, hn); in transfer()
2743 int ph, dir; K pk; TreeNode<K,V> q; in findTreeNode() local
2745 if ((ph = p.hash) > h) in findTreeNode()
2747 else if (ph < h) in findTreeNode()
2825 int dir, ph; in TreeBin() local
2827 if ((ph = p.hash) > h) in TreeBin()
2829 else if (ph < h) in TreeBin()
[all …]