Home
last modified time | relevance | path

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

/libcore/ojluni/src/main/java/sun/security/x509/
DGeneralSubtrees.java81 GeneralSubtree tree = new GeneralSubtree(opt); in GeneralSubtrees() local
82 add(tree); in GeneralSubtrees()
94 public void add(GeneralSubtree tree) { in add() argument
95 if (tree == null) { in add()
98 trees.add(tree); in add()
101 public boolean contains(GeneralSubtree tree) { in contains() argument
102 if (tree == null) { in contains()
105 return trees.contains(tree); in contains()
/libcore/tools/testmapping/
Dgen_smoke_tests.py341 tree = collections.defaultdict(set)
345 tree[parent].add(test)
350 return tree
365 tree = build_test_tree(test_inclusions.keys())
387 if test in tree:
394 if test not in tree:
399 for child in tree[test]:
415 for root in tree[None]:
/libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/
DNodeTest.java52 … nodes.add(tree(Arrays.asList(array), l -> Nodes.node(l.toArray(new Integer[l.size()])))); in createSizes()
53 nodes.add(tree(Arrays.asList(array), l -> Nodes.node(l))); in createSizes()
89 Node<Integer> tree(List<Integer> l, Function<List<Integer>, Node<Integer>> m) { in tree() method in NodeTest
95 tree(l.subList(0, l.size() / 2), m), in tree()
96 tree(l.subList(l.size() / 2, l.size()), m )); in tree()
DLongNodeTest.java52 nodes.add(tree(toList(array), l -> Nodes.node(toLongArray(l)))); in createSizes()
112 private Node.OfLong tree(List<Long> l, Function<List<Long>, Node.OfLong> m) { in tree() method in LongNodeTest
118 tree(l.subList(0, l.size() / 2), m), in tree()
119 tree(l.subList(l.size() / 2, l.size()), m)); in tree()
DIntNodeTest.java52 nodes.add(tree(toList(array), l -> Nodes.node(toIntArray(l)))); in createSizes()
112 private Node.OfInt tree(List<Integer> l, Function<List<Integer>, Node.OfInt> m) { in tree() method in IntNodeTest
118 tree(l.subList(0, l.size() / 2), m), in tree()
119 tree(l.subList(l.size() / 2, l.size()), m)); in tree()
DDoubleNodeTest.java52 nodes.add(tree(toList(array), l -> Nodes.node(toDoubleArray(l)))); in createSizes()
112 private Node.OfDouble tree(List<Double> l, Function<List<Double>, Node.OfDouble> m) { in tree() method in DoubleNodeTest
118 tree(l.subList(0, l.size() / 2), m), in tree()
119 tree(l.subList(l.size() / 2, l.size()), m)); in tree()
/libcore/ojluni/src/main/java/java/util/
DTreeMap.java2702 final TreeMap<K,V> tree; field in TreeMap.TreeMapSpliterator
2709 TreeMapSpliterator(TreeMap<K,V> tree, in TreeMapSpliterator() argument
2712 this.tree = tree; in TreeMapSpliterator()
2723 if ((t = tree) != null) { in getEstimate()
2742 KeySpliterator(TreeMap<K,V> tree, in KeySpliterator() argument
2745 super(tree, origin, fence, side, est, expectedModCount); in KeySpliterator()
2754 (d == 0) ? tree.root : // was top in trySplit()
2759 tree.compare(e.key, s.key) < 0) { // e not already past s in trySplit()
2762 (tree, e, current = s, -1, est >>>= 1, expectedModCount); in trySplit()
2786 if (tree.modCount != expectedModCount) in forEachRemaining()
[all …]
/libcore/ojluni/src/main/java/java/security/cert/
DX509CertSelector.java2496 GeneralSubtree tree = t.next(); in matchExcluded() local
2497 GeneralNameInterface excludedName = tree.getName().getName(); in matchExcluded()
2535 GeneralSubtree tree = t.next(); in matchPermitted() local
2536 GeneralNameInterface permittedName = tree.getName().getName(); in matchPermitted()