| /external/bouncycastle/src/main/java/org/bouncycastle/asn1/x509/ |
| NameConstraints.java | 44 * Permitted subtrees
46 * Excludes subtrees
|
| GeneralSubtree.java | 15 * Class for containing a restriction object subtrees in NameConstraints. See
|
| /external/apache-harmony/security/src/test/impl/java.injected/java/security/cert/ |
| X509CertSelectorTest.java | 1789 GeneralSubtrees subtrees = new GeneralSubtrees(); local
1941 GeneralSubtrees subtrees = new GeneralSubtrees(); local
2332 GeneralSubtrees subtrees; local
2448 GeneralSubtrees subtrees; local
2565 GeneralSubtrees subtrees; local
[all...] |
| /external/dbus/dbus/ |
| dbus-object-tree.c | 77 DBusObjectSubtree **subtrees; /**< Child nodes */ member in struct:DBusObjectSubtree
79 int max_subtrees; /**< Number of allocated entries in subtrees */
199 v = strcmp (path[0], subtree->subtrees[k]->name);
203 path[0], subtree->subtrees[k]->name,
221 next = find_subtree_recurse (subtree->subtrees[k],
239 return find_subtree_recurse (subtree->subtrees[k],
280 new_subtrees = dbus_realloc (subtree->subtrees,
287 subtree->subtrees = new_subtrees;
298 memmove (&subtree->subtrees[child_pos+1],
299 &subtree->subtrees[child_pos],
[all...] |
| /external/antlr/src/org/antlr/runtime/tree/ |
| RewriteEmptyStreamException.java | 30 /** Ref to ID or expr but no tokens in ID stream or subtrees in expr stream */
|
| TreeWizard.java | 51 * match subtrees against it.
210 /** Return a List of subtrees matching pattern. */
212 final List subtrees = new ArrayList(); local
229 subtrees.add(t);
233 return subtrees;
268 /** For all subtrees that match the pattern, execute the visit action.
|
| TreeFilter.java | 67 we need to reduce multiply-by-zero subtrees on the way up (postorder).
|
| RewriteRuleElementStream.java | 55 /** The list of tokens or subtrees we are tracking */
|
| /external/mesa3d/src/glsl/ |
| opt_if_simplification.cpp | 59 * FINISHME: in a constant before processing both of the other subtrees.
|
| /libcore/luni/src/main/java/org/apache/harmony/security/x509/ |
| GeneralSubtrees.java | 59 * Returns the list of values of subtrees.
|
| /external/v8/test/mjsunit/compiler/ |
| expression-trees.js | 41 // Split the leaves into left and right subtrees in all possible
42 // ways. For each split recursively compute all possible subtrees.
|
| /external/openssl/crypto/x509v3/ |
| v3_ncons.c | 300 /* Permitted subtrees: if any subtrees exist of matching the type
326 /* Excluded subtrees: must not match any of these */
|
| /libcore/luni/src/test/java/tests/security/cert/ |
| X509CertSelectorTest.java | 514 // GeneralSubtrees subtrees = new GeneralSubtrees();
515 // subtrees.addSubtree(subtree);
516 // NameConstraints constraints = new NameConstraints(subtrees,
517 // subtrees);
[all...] |
| /external/chromium/base/files/ |
| file_path_watcher_win.cc | 183 false, // Don't watch subtrees
|
| /external/chromium/chrome/browser/ui/gtk/ |
| browser_titlebar.h | 101 // subtrees. We do this lazily because in most situations, only one of them
|
| /external/skia/gpu/src/ |
| GrRedBlackTree.h | 475 // black. This leaves the black-height of both of p's new subtrees
730 // to make both subtrees of p have the same black-height.
757 // two subtrees and keep the same black-height as it was
810 // red nodes always have two black children. Then the two subtrees
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| TreeMap.java | 380 * To remove a node with both left and right subtrees, move an
381 * adjacent node from one of those subtrees into this node's place.
383 * Removing the adjacent node may change this node's subtrees. This
384 * node may no longer have two subtrees once the adjacent node is
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTMdefaultNamespaceDeclarationNode.java | 226 * @param deep If <code>true</code>, recursively compare the subtrees; if
229 * @return If the nodes, and possibly subtrees are equal,
|
| /external/clang/lib/AST/ |
| StmtDumper.cpp | 698 /// dumpAll - This does a dump of the specified AST fragment and all subtrees.
705 /// dumpAll - This does a dump of the specified AST fragment and all subtrees.
|
| /external/bouncycastle/src/main/java/org/bouncycastle/jce/provider/ |
| RFC3280CertPathUtilities.java | [all...] |
| /external/icu4c/data/ |
| cldr-icu-readme.txt | 14 # and tools (tools.zip) directory subtrees from the Data column in
|
| /external/llvm/include/llvm/ADT/ |
| ImmutableSet.h | 64 /// getHeight - Returns the height of the tree. A tree with no subtrees
257 /// method returns false for an instance of ImutAVLTree, all subtrees
272 // bit set may have children (subtrees) that are themselves
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| UnImplNode.java | 1291 * @param deep If <code>true</code>, recursively compare the subtrees; if
1294 * @return If the nodes, and possibly subtrees are equal,
[all...] |
| /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/java/security/cert/ |
| TrustAnchor_ImplTest.java | 333 (byte)0xa1,(byte)0x0a, // excluded subtrees, tag, len
|
| /external/clang/lib/Rewrite/ |
| DeltaTree.cpp | 294 /// into two subtrees each with "WidthFactor-1" values and a pivot value.
|
