/libcore/ojluni/src/main/java/java/util/function/ |
D | DoubleBinaryOperator.java | 48 double applyAsDouble(double left, double right); in applyAsDouble()
|
D | IntBinaryOperator.java | 49 int applyAsInt(int left, int right); in applyAsInt()
|
D | LongBinaryOperator.java | 49 long applyAsLong(long left, long right); in applyAsLong()
|
/libcore/ojluni/src/main/java/java/util/ |
D | DualPivotQuicksort.java | 107 static void sort(int[] a, int left, int right, in sort() 214 private static void sort(int[] a, int left, int right, boolean leftmost) { in sort() 555 static void sort(long[] a, int left, int right, in sort() 662 private static void sort(long[] a, int left, int right, boolean leftmost) { in sort() 1003 static void sort(short[] a, int left, int right, in sort() 1039 private static void doSort(short[] a, int left, int right, in doSort() 1146 private static void sort(short[] a, int left, int right, boolean leftmost) { in sort() 1487 static void sort(char[] a, int left, int right, in sort() 1523 private static void doSort(char[] a, int left, int right, in doSort() 1630 private static void sort(char[] a, int left, int right, boolean leftmost) { in sort() [all …]
|
D | ComparableTimSort.java | 252 int left = lo; in binarySort() local 254 assert left <= right; in binarySort() local
|
D | TimSort.java | 286 int left = lo; in binarySort() local 288 assert left <= right; in binarySort() local
|
D | ArrayPrefixHelpers.java | 108 CumulateTask<T> left, right; field in ArrayPrefixHelpers.CumulateTask 260 LongCumulateTask left, right; field in ArrayPrefixHelpers.LongCumulateTask 410 DoubleCumulateTask left, right; field in ArrayPrefixHelpers.DoubleCumulateTask 560 IntCumulateTask left, right; field in ArrayPrefixHelpers.IntCumulateTask
|
D | TreeMap.java | 2112 TreeMapEntry<K,V> left; field in TreeMap.TreeMapEntry 2605 TreeMapEntry<K,V> left = null; in buildFromSorted() local
|
D | HashMap.java | 1805 TreeNode<K,V> left; field in HashMap.TreeNode
|
/libcore/ojluni/src/main/java/java/util/stream/ |
D | Nodes.java | 113 static <T> Node<T> conc(StreamShape shape, Node<T> left, Node<T> right) { in conc() 746 protected final T_NODE left; field in Nodes.AbstractConcNode 750 AbstractConcNode(T_NODE left, T_NODE right) { in AbstractConcNode() 782 ConcNode(Node<T> left, Node<T> right) { in ConcNode() 846 OfPrimitive(T_NODE left, T_NODE right) { in OfPrimitive() 887 OfInt(Node.OfInt left, Node.OfInt right) { in OfInt() 901 OfLong(Node.OfLong left, Node.OfLong right) { in OfLong() 915 OfDouble(Node.OfDouble left, Node.OfDouble right) { in OfDouble()
|
/libcore/ojluni/src/main/java/sun/security/util/ |
D | Debug.java | 253 StringBuffer left = new StringBuffer(); in marshal() local
|
/libcore/ojluni/src/main/java/sun/nio/ch/ |
D | IOUtil.java | 151 long left = bytesWritten; in write() local 281 long left = bytesRead; in read() local
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
D | ConcurrentHashMap.java | 2720 TreeNode<K,V> left; field in ConcurrentHashMap.TreeNode
|
/libcore/benchmarks/src/benchmarks/regression/ |
D | R.java | 1848 public static final int left = 0; field in R
|