/external/chromium_org/third_party/openssl/openssl/crypto/x509v3/ |
H A D | pcy_int.h | 132 /* This structure represents the relationship between nodes */ 140 /* Number of child nodes */ 148 /* nodes at this level */ 149 STACK_OF(X509_POLICY_NODE) *nodes; member in struct:X509_POLICY_LEVEL_st 162 /* Extra policy data when additional nodes (not from the certificate)
|
/external/chromium_org/webkit/data/test_shell/sort/ |
H A D | sort.js | 275 var nodes = document.getElementsByTagName("li"); 277 for (i = 0; i < nodes.length; i++) { 278 var name = nodes[i].id; 280 this.bars[j] = nodes[i];
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | BstInOrderPathTest.java | 180 BstInOrderPath<SimpleNode> path, SimpleNode... nodes) { 183 ASSERT.that(pathToList(path)).hasContentsInOrder(nodes); 188 BstInOrderPath<SimpleNode> path, SimpleNode... nodes) { 191 ASSERT.that(pathToList(path)).hasContentsInOrder(nodes); 179 testNextPathIs( BstInOrderPath<SimpleNode> path, SimpleNode... nodes) argument 187 testPrevPathIs( BstInOrderPath<SimpleNode> path, SimpleNode... nodes) argument
|
/external/openssl/crypto/x509v3/ |
H A D | pcy_int.h | 132 /* This structure represents the relationship between nodes */ 140 /* Number of child nodes */ 148 /* nodes at this level */ 149 STACK_OF(X509_POLICY_NODE) *nodes; member in struct:X509_POLICY_LEVEL_st 162 /* Extra policy data when additional nodes (not from the certificate)
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRBufferedTreeNodeStream.h | 48 NSMutableArray *nodes; variable 67 NSMutableArray *nodes; variable 87 @property (retain, getter=getNodes, setter=setNodes:) NSMutableArray *nodes; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
H A D | ANTLRBufferedTreeNodeStream.h | 48 NSMutableArray *nodes; variable 67 NSMutableArray *nodes; variable 87 @property (retain, getter=getNodes, setter=setNodes:) NSMutableArray *nodes; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
H A D | ANTLRBufferedTreeNodeStream.h | 48 NSMutableArray *nodes; variable 67 NSMutableArray *nodes; variable 87 @property (retain, getter=getNodes, setter=setNodes:) NSMutableArray *nodes; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRBufferedTreeNodeStream.h | 49 __strong AMutableArray *nodes; variable 68 AMutableArray *nodes; variable 88 @property (retain, getter=getNodes, setter=setNodes:) AMutableArray *nodes; variable
|
/external/antlr/antlr-3.4/runtime/Python/tests/ |
H A D | t049treeparser.py | 44 nodes = antlr3.tree.CommonTreeNodeStream(r.tree) 45 nodes.setTokenStream(tStream) 46 walker = walkerCls(nodes)
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | NodeVector.java | 42 * Array of nodes this points to. 48 * Number of nodes in this NodeVector. 104 * @return Number of nodes in this NodeVector 237 * Push a pair of nodes into the stack. 272 * Pop a pair of nodes from the tail of the stack. 392 * Append the nodes to the list. 394 * @param nodes NodeVector to append to this list 396 public void appendNodes(NodeVector nodes) argument 399 int nNodes = nodes.size(); 417 System.arraycopy(nodes [all...] |
/external/chromium_org/chrome/browser/bookmarks/ |
H A D | chrome_bookmark_client.cc | 124 const NodeSet& nodes, 130 for (NodeSet::const_iterator i = nodes.begin(); i != nodes.end(); ++i) { 123 GetTypedCountForNodes( const NodeSet& nodes, NodeTypedCountPairs* node_typed_count_pairs) argument
|
/external/chromium_org/chrome/browser/extensions/api/automation_internal/ |
H A D | automation_util.cc | 142 for (size_t i = 0; i < event.nodes.size(); ++i) { 145 PopulateNodeData(event.nodes[i], out_node); 146 ax_tree_update.nodes.push_back(out_node);
|
/external/chromium_org/chrome/browser/ui/bookmarks/ |
H A D | recently_used_folders_combo_model.cc | 56 std::vector<const BookmarkNode*> nodes = local 60 for (size_t i = 0; i < nodes.size(); ++i) 61 items_.push_back(Item(nodes[i], Item::TYPE_NODE)); 79 // And put the bookmark bar and other nodes at the end of the list.
|
/external/chromium_org/native_client_sdk/src/doc/_sphinxext/ |
H A D | chromesite_builder.py | 14 from docutils import nodes namespace 94 if isinstance(node.parent, nodes.section): 121 # nodes. 284 literal = nodes.literal_block(code, code)
|
/external/chromium_org/net/tools/tld_cleanup/ |
H A D | make_dafsa.py | 21 source node and ending at a common sink node. All internal nodes contain 25 The following python represention is used for nodes: 33 one to one linked nodes are replaced by nodes with the labels joined. 234 """Creates reverse nodes. 254 """Generates a new DAFSA where internal nodes are merged if there is a one to 270 """Create new nodes""" 286 """Generates a new DAFSA where nodes that represent the same word lists 304 """Generates list of nodes in topological sort order.""" 324 nodes [all...] |
/external/chromium_org/ppapi/generators/ |
H A D | idl_namespace.py | 10 a symbol as one or more AST nodes given a release or range of releases. 164 # Verify that a FindRage call on the namespace returns a set of expected nodes. 165 def VerifyFindAll(namespace, name, rmin, rmax, nodes): 168 if (out != nodes): 171 ' '.join([str(x) for x in nodes]),
|
/external/chromium_org/third_party/WebKit/Source/core/xml/ |
H A D | XPathPredicate.cpp | 124 // performing the comparison on the string-values of the two nodes 260 HashSet<Node*> nodes; local 262 nodes.add(resultSet[i]); 266 if (nodes.add(node).isNewEntry)
|
/external/chromium_org/third_party/WebKit/Tools/TestResultServer/static-dashboards/ |
H A D | webtreemap.js | 31 // Size of border around nodes. 110 // Given a list of rectangles |nodes|, the 1-d space available 116 function selectSpan(nodes, space, start) { 120 var node = nodes[start]; 125 for (var end = start; node = nodes[end]; ++end) {
|
/external/chromium_org/third_party/angle/src/compiler/translator/depgraph/ |
H A D | DependencyGraphBuilder.cpp | 219 void TDependencyGraphBuilder::connectMultipleNodesToSingleNode(TParentNodeSet* nodes, argument 222 for (TParentNodeSet::const_iterator iter = nodes->begin(); iter != nodes->end(); ++iter)
|
/external/chromium_org/third_party/webtreemap/src/ |
H A D | webtreemap.js | 15 // Size of border around nodes. 99 // Given a list of rectangles |nodes|, the 1-d space available 105 function selectSpan(nodes, space, start) { 109 var node = nodes[start]; 114 for (var end = start; node = nodes[end]; ++end) {
|
/external/chromium_org/tools/gyp/tools/ |
H A D | pretty_vcproj.py | 34 """Compare function between 2 xml nodes.""" 96 """Returns a list of all the node and sub nodes.""" 191 # Insert the nodes in the correct order. 205 nodes = [] 210 nodes.append(sub_node) 212 return nodes 233 # Look through all the nodes to find a match.
|
/external/chromium_org/tools/idl_parser/ |
H A D | idl_ppapi_parser.py | 283 nodes = [] 291 nodes.append(filenode) 293 ast = IDLNode('AST', '__AST__', 0, 0, nodes)
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | TreeWizard.cs | 52 * In order to create nodes and navigate, this class needs a TreeAdaptor. 55 * iterating over the various nodes with a particular type. 133 * nodes such as function definition nodes (you'll want to seek 135 * dynamic searches; i.e., go find me all PLUS nodes. 205 * Walk the entire tree and make a node name to nodes mapping. 242 public FindTreeWizardVisitor(IList nodes) { argument 243 _nodes = nodes; 266 /** <summary>Return a List of tree nodes with token type ttype</summary> */ 268 IList nodes [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
H A D | TreeWizard.cs | 53 * In order to create nodes and navigate, this class needs a TreeAdaptor. 56 * iterating over the various nodes with a particular type. 151 * nodes such as function definition nodes (you'll want to seek 153 * dynamic searches; i.e., go find me all PLUS nodes. 232 * Walk the entire tree and make a node name to nodes mapping. 275 public FindTreeWizardVisitor( IList nodes ) 277 _nodes = nodes; 305 /** <summary>Return a List of tree nodes with token type ttype</summary> */ 308 IList nodes [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/heap_snapshot_worker/ |
H A D | HeapSnapshot.js | 822 this._nodes = profile.nodes; 844 var nodes = this._nodes; 845 var nodesLength = nodes.length; 946 this._progress.updateStatus("Buiding dominated nodes\u2026"); 955 var nodes = this._nodes; 964 edgeIndex += nodes[nodeOrdinal * nodeFieldCount + nodeEdgeCountOffset] * edgeFieldsCount; 1342 throw new Error("BFS failed. Nodes to visit (" + nodesToVisitLength + ") is more than nodes count (" + nodeCount + ")"); 1350 var nodes = this._nodes; 1354 var nodesLength = nodes.length; 1369 var selfSize = nodes[nodeInde [all...] |