/libcore/benchmarks/src/benchmarks/ |
H A D | GetInstancesOfClassesBenchmark.java | 35 private static ObjectTree tree = new ObjectTree(19); field in class:GetInstancesOfClassesBenchmark
|
/libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/ |
H A D | DoubleNodeTest.java | 52 nodes.add(tree(toList(array), l -> Nodes.node(toDoubleArray(l)))); 112 private Node.OfDouble tree(List<Double> l, Function<List<Double>, Node.OfDouble> m) { method in class:DoubleNodeTest 118 tree(l.subList(0, l.size() / 2), m), 119 tree(l.subList(l.size() / 2, l.size()), m));
|
H A D | IntNodeTest.java | 52 nodes.add(tree(toList(array), l -> Nodes.node(toIntArray(l)))); 112 private Node.OfInt tree(List<Integer> l, Function<List<Integer>, Node.OfInt> m) { method in class:IntNodeTest 118 tree(l.subList(0, l.size() / 2), m), 119 tree(l.subList(l.size() / 2, l.size()), m));
|
H A D | LongNodeTest.java | 52 nodes.add(tree(toList(array), l -> Nodes.node(toLongArray(l)))); 112 private Node.OfLong tree(List<Long> l, Function<List<Long>, Node.OfLong> m) { method in class:LongNodeTest 118 tree(l.subList(0, l.size() / 2), m), 119 tree(l.subList(l.size() / 2, l.size()), m));
|
H A D | NodeTest.java | 52 nodes.add(tree(Arrays.asList(array), l -> Nodes.node(l.toArray(new Integer[l.size()])))); 53 nodes.add(tree(Arrays.asList(array), l -> Nodes.node(l))); 89 Node<Integer> tree(List<Integer> l, Function<List<Integer>, Node<Integer>> m) { method in class:NodeTest 95 tree(l.subList(0, l.size() / 2), m), 96 tree(l.subList(l.size() / 2, l.size()), m ));
|
/libcore/ojluni/src/main/java/sun/security/x509/ |
H A D | GeneralSubtrees.java | 81 GeneralSubtree tree = new GeneralSubtree(opt); 82 add(tree); 94 public void add(GeneralSubtree tree) { argument 95 if (tree == null) { 98 trees.add(tree); 101 public boolean contains(GeneralSubtree tree) { argument 102 if (tree == null) { 105 return trees.contains(tree);
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | TreeMap.java | 35 * A Red-Black tree based {@link NavigableMap} implementation. 45 * <p>Note that the ordering maintained by a tree map, like any sorted map, and 117 * The comparator used to maintain order in this tree map, or 127 * The number of entries in the tree 132 * The number of structural modifications to the tree. 137 * Constructs a new, empty tree map, using the natural ordering of its 153 * Constructs a new, empty tree map, ordered according to the given 171 * Constructs a new tree map containing the same mappings as the given 190 * Constructs a new tree map containing the same mappings and 802 * the tree ma 2702 final TreeMap<K,V> tree; field in class:TreeMap.TreeMapSpliterator 2709 TreeMapSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument 2742 KeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument 2820 DescendingKeySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument 2893 ValueSpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument 2965 EntrySpliterator(TreeMap<K,V> tree, TreeMapEntry<K,V> origin, TreeMapEntry<K,V> fence, int side, int est, int expectedModCount) argument [all...] |