| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/ |
| ir.py | 136 for node in self.nodes():
275 for node in self.nodes():
646 nodes = decl.deepfilter( TypeSpecifiers )
647 for node in nodes:
655 nodes = decl.deepfilter( TypeSpecifiers )
656 for node in nodes:
810 for node in self.nodes():
857 nodes = tuple( [ repr(node) for node in self ] )
859 return nodes, typedefs
862 nodes, typedefs = stat
[all...] |
| /external/chromium_org/tools/grit/grit/gather/ |
| policy_json.py | 86 all the <message> nodes.
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| 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);
|
| /external/openssl/crypto/x509v3/ |
| 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)
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| DependencyGraph.java | 42 * <li> Quickly determine not just the dependencies on other nodes, but which nodes
63 INode[] nodes = layout.getChildren(); local
80 for (INode child : nodes) {
153 * @param nodes the set of nodes that we want to compute the transitive dependencies
157 * @return the set of nodes that directly or indirectly depend on the given nodes in
160 public Set<INode> dependsOn(Collection<? extends INode> nodes, boolean vertical) {
163 // Traverse the graph of constraints and determine all nodes affected b
[all...] |
| ResizeHandler.java | 73 Set<INode> nodes = Collections.singleton(resized); local
74 mDraggedNodes = nodes;
76 mHorizontalDeps = mDependencyGraph.dependsOn(nodes, false /* vertical */);
77 mVerticalDeps = mDependencyGraph.dependsOn(nodes, true /* vertical */);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/ |
| ExplodedRenderingHelper.java | 127 if (type == Node.ELEMENT_NODE) { // ignore TEXT/CDATA nodes.
350 * Nodes with no id are ignored and not put in the map.
351 * @param nodes the nodes to fill the map with.
354 private Map<String, Node> computeIdNodeMap(Set<Node> nodes) {
356 for (Node node : nodes) {
377 * Returns a list of nodes for which a given attribute contains a reference to a given ID.
379 * @param nodes the list of nodes to search through
382 * @return a newly allocated, non-null, list of nodes. Could be empty
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| 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/ |
| 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/ |
| 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/ |
| 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/ |
| t049treeparser.py | 44 nodes = antlr3.tree.CommonTreeNodeStream(r.tree)
45 nodes.setTokenStream(tStream)
46 walker = walkerCls(nodes)
|
| t055templates.py | 485 nodes = antlr3.tree.CommonTreeNodeStream(tree)
486 nodes.setTokenStream(tStream)
487 walker = walkerCls(nodes)
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| NodeVector.java | 28 * A very simple table that stores a list of Nodes.
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)
399 int nNodes = nodes.size()
[all...] |
| /external/chromium_org/chrome/browser/bookmarks/ |
| chrome_bookmark_client.cc | 124 const NodeSet& nodes,
130 for (NodeSet::const_iterator i = nodes.begin(); i != nodes.end(); ++i) {
|
| /external/chromium_org/chrome/browser/extensions/api/automation_internal/ |
| 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/ |
| 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/ |
| 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/ppapi/generators/ |
| 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/ |
| 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/ |
| 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/ |
| DependencyGraphBuilder.cpp | 219 void TDependencyGraphBuilder::connectMultipleNodesToSingleNode(TParentNodeSet* nodes,
222 for (TParentNodeSet::const_iterator iter = nodes->begin(); iter != nodes->end(); ++iter)
|
| /external/chromium_org/tools/gyp/tools/ |
| 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/ |
| idl_ppapi_parser.py | 283 nodes = []
291 nodes.append(filenode)
293 ast = IDLNode('AST', '__AST__', 0, 0, nodes)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_cpickle.py | 204 nodes = [Node() for i in range(500)]
205 for n in nodes:
206 n.connections = list(nodes)
|
