| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| tree.py | 100 @brief Abstract baseclass for tree nodes.
343 """Is tree considered a nil node used to make lists of child nodes?"""
386 constructing these nodes so we should have this control for
415 How to identify nodes so we can say "add node to a prior node"?
492 all children? Each rule that creates AST nodes will call this
820 # if same number of nodes, do direct replace
977 If you specify your own kind of tree nodes, you will likely have to
1062 constructing these nodes so we should have this control for
[all...] |
| /external/libxml2/ |
| xmlwriter.c | 89 xmlListPtr nodes; /* element name stack */ member in struct:_xmlTextWriter
189 ret->nodes = xmlListCreate((xmlListDeallocator)
193 if (ret->nodes == NULL) {
207 xmlListDelete(ret->nodes);
217 xmlListDelete(ret->nodes);
487 if (writer->nodes != NULL)
488 xmlListDelete(writer->nodes);
535 lk = xmlListFront(writer->nodes);
655 while ((lk = xmlListFront(writer->nodes)) != NULL) {
741 lk = xmlListFront(writer->nodes);
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| LinkedListMultimap.java | 263 /** Removes all nodes for the specified key. */
278 /** An {@code Iterator} over all nodes. */
718 final Iterator<Node<K, V>> nodes = new NodeIterator();
722 return nodes.hasNext();
726 return nodes.next().key;
730 nodes.remove();
852 final NodeIterator nodes = new NodeIterator(index);
856 return nodes.hasNext();
860 return nodes.next().value;
864 return nodes.hasPrevious()
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| LinkedListMultimap.java | 259 /** Removes all nodes for the specified key. */
274 /** An {@code Iterator} over all nodes. */
714 final Iterator<Node<K, V>> nodes = new NodeIterator();
718 return nodes.hasNext();
722 return nodes.next().key;
726 nodes.remove();
848 final NodeIterator nodes = new NodeIterator(index);
852 return nodes.hasNext();
856 return nodes.next().value;
860 return nodes.hasPrevious()
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| triedict.cpp | 251 UStack fNodeStack; // Stack of nodes to process
379 // for terminal nodes directly in offsets[]
389 // version 2: uses new header (more than 2^16 nodes), no values
399 uint32_t offsets[1]; // Offsets to nodes from start of data
408 uint32_t offsets[1]; // Offsets to nodes from start of data
417 uint32_t *offsets; // Offsets to nodes from start of data
760 UVector32 fNodeStack; // Stack of nodes to process
922 UStack &nodes, UErrorCode &status, uint16_t value = 0) {
927 fNodeID = nodes.size();
929 nodes.push(this, status)
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| RecognitionException.cs | 115 * imaginary nodes w/o line/col info. We now search backwards looking
290 ITreeNodeStream nodes = (ITreeNodeStream)input;
291 this._node = nodes.LT(1);
292 ITreeAdaptor adaptor = nodes.TreeAdaptor;
299 object priorNode = nodes.LT(i);
310 priorNode = nodes.LT(i);
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeParser.java | 35 /** A parser for a stream of tree nodes. "tree grammars" result in a subclass
126 /** We have DOWN/UP nodes in the stream that have no line info; override.
147 /** Tree parsers parse nodes they usually have a token object as
163 * of nodes towards root of tree. For example, you might say context
166 * You can use "..." to mean zero-or-more nodes. "METHOD ... VARDEF"
194 String[] nodes = context.split("\\s+"); local
195 int ni = nodes.length-1;
198 if ( nodes[ni].equals("...") ) {
199 // walk upwards until we see nodes[ni-1] then continue walking
201 String goal = nodes[ni-1]
[all...] |
| /external/chromium_org/chrome/browser/extensions/api/bookmark_manager_private/ |
| bookmark_manager_private_api.cc | 77 // Gets a vector of bookmark nodes from the argument list of IDs.
81 std::vector<const BookmarkNode*>* nodes) {
90 nodes->push_back(node);
104 // Add id and parentId so we can associate the data with existing nodes on the
152 std::vector<const BookmarkNode*> nodes = data.GetNodes( local
154 for (size_t i = 0; i < nodes.size(); ++i) {
156 CreateNodeDataElementFromBookmarkNode(*nodes[i]));
357 std::vector<const BookmarkNode*> nodes; local
358 EXTENSION_FUNCTION_VALIDATE(GetNodesFromVector(model, id_list, &nodes));
359 if (cut && client->HasDescendantsOfManagedNode(nodes)) {
534 std::vector<const BookmarkNode*> nodes; local
551 GetProfile(), nodes, web_contents->GetNativeView(), source); local
624 std::vector<linked_ptr<api::bookmarks::BookmarkTreeNode> > nodes; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/resources/ |
| DOMStorageItemsView.js | 187 var nodes = []; variable
196 nodes.push(node);
202 length = nodes.length;
204 dataGrid.rootNode().appendChild(nodes[i]);
207 nodes[0].selected = true;
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
| vp9_context_tree.c | 97 int nodes; local
113 // Sets up all the leaf nodes in the tree.
123 // Each node has 4 leaf nodes, fill each block_size level of the tree
125 for (nodes = 16; nodes > 0; nodes >>= 2) {
126 for (i = 0; i < nodes; ++i) {
148 // Sets up all the leaf nodes in the tree.
|
| /external/chromium_org/ui/accessibility/ |
| ax_tree.cc | 29 // During an update, this keeps track of all nodes that have been
31 // updated yet. It's an error if there are any pending nodes at the
35 // Keeps track of new nodes created during this update.
52 initial_state.nodes.push_back(root);
102 for (size_t i = 0; i < update.nodes.size(); ++i) {
103 if (!UpdateNode(update.nodes[i], &update_state))
108 error_ = "Nodes left pending by the update:";
117 for (size_t i = 0; i < update.nodes.size(); ++i) {
118 AXNode* node = GetFromId(update.nodes[i].id);
175 // First, delete nodes that used to be children of this node but aren'
[all...] |
| /external/smack/src/org/jivesoftware/smackx/ |
| OfflineMessageManager.java | 129 * @param nodes the list of stamps that uniquely identifies offline message.
135 public Iterator<Message> getMessages(final List<String> nodes) throws XMPPException {
138 for (String node : nodes) {
151 return nodes.contains(info.getNode());
231 * @param nodes the list of stamps that uniquely identifies offline message.
235 public void deleteMessages(List<String> nodes) throws XMPPException {
237 for (String node : nodes) {
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/injected/ |
| node_breadcrumb.js | 6 * @fileoverview Responsible for tagging nodes used by ChromeVox.
16 * Responsible for tagging nodes and tracking those nodes.
30 * The attribute to mark nodes that have been touched, and in what order.
38 * The attribute to mark nodes needed to replicate results with.
115 * The nodes must have been marked first by calling smartStart_.
|
| /external/chromium_org/mojo/services/public/cpp/view_manager/lib/ |
| view_manager_client_impl.h | 70 // Start/stop tracking nodes & views. While tracked, they can be retrieved via
100 Array<NodeDataPtr> nodes) OVERRIDE;
101 virtual void OnRootsAdded(Array<NodeDataPtr> nodes) OVERRIDE;
110 Array<NodeDataPtr> nodes) OVERRIDE;
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/heap_snapshot_worker/ |
| JSHeapSnapshot.js | 262 var nodes = this._nodes;
306 var nodes = this._nodes;
360 var nodes = this._nodes;
361 var nodesLength = nodes.length;
375 var nodeType = nodes[nodeIndex + nodeTypeOffset];
376 var nodeSize = nodes[nodeIndex + nodeSizeOffset];
500 var nodes = snapshot._nodes;
507 if (nodes[nodeIndex + nodeTypeOffset] !== consStringType) {
508 name += strings[nodes[nodeIndex + nodeNameOffset]];
557 var nodes = snapshot._nodes
[all...] |
| /external/clang/include/clang/AST/ |
| Makefile | 42 $(Verb) $(ClangTableGen) -gen-clang-stmt-nodes -o $(call SYSPATH, $@) $<
47 $(Verb) $(ClangTableGen) -gen-clang-decl-nodes -o $(call SYSPATH, $@) $<
52 $(Verb) $(ClangTableGen) -gen-clang-comment-nodes -o $(call SYSPATH, $@) $<
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/distutils/command/ |
| check.py | 16 from docutils import nodes namespace
29 return nodes.system_message(message, level=level,
141 document = nodes.document(settings, reporter, source=source_path)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/command/ |
| check.py | 16 from docutils import nodes namespace
29 return nodes.system_message(message, level=level,
141 document = nodes.document(settings, reporter, source=source_path)
|
| /external/chromium_org/chrome/browser/bookmarks/ |
| chrome_bookmark_client_unittest.cc | 169 // These two nodes should just be swapped.
198 // Put all the nodes inside another folder.
203 // The remaining nodes have been pushed to positions 1 and 2; they'll both be
278 std::vector<const BookmarkNode*> nodes; local
279 EXPECT_FALSE(client_->HasDescendantsOfManagedNode(nodes));
280 nodes.push_back(user_node);
281 EXPECT_FALSE(client_->HasDescendantsOfManagedNode(nodes));
282 nodes.push_back(managed_node);
283 EXPECT_TRUE(client_->HasDescendantsOfManagedNode(nodes));
|
| /external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
| MethodNode.java | 362 * label nodes.
375 LabelNode[] nodes = new LabelNode[l.length];
377 nodes[i] = getLabelNode(l[i]);
379 return nodes;
383 Object[] nodes = new Object[objs.length];
389 nodes[i] = o;
391 return nodes;
|
| /external/wpa_supplicant_8/hs20/server/ca/ |
| setup.sh | 60 $OPENSSL req -config $PWD/openssl.cnf.tmp -batch -new -newkey rsa:2048 -nodes -out ocsp.csr -keyout ocsp.key -extensions v3_OCSP
68 $OPENSSL req -config $PWD/openssl.cnf.tmp -batch -new -newkey rsa:2048 -nodes -out server-revoked.csr -keyout server-revoked.key
77 $OPENSSL req -config $PWD/openssl.cnf.tmp -batch -new -newkey rsa:2048 -nodes -out server-client.csr -keyout server-client.key
85 $OPENSSL req -config $PWD/openssl.cnf.tmp -batch -new -newkey rsa:2048 -nodes -out user.csr -keyout user.key
102 echo $OPENSSL req -config $PWD/openssl.cnf.tmp -batch -sha256 -new -newkey rsa:2048 -nodes -out server.csr -keyout server.key -reqexts v3_osu_server
103 $OPENSSL req -config $PWD/openssl.cnf.tmp -batch -sha256 -new -newkey rsa:2048 -nodes -out server.csr -keyout server.key -reqexts v3_osu_server || fail "Failed to generate server request"
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| RewriteRuleNodeStream.as | 4 /** Queues up nodes matched on left side of -> in a tree parser. This is
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3commontreenodestream.c | 234 stream->nodes = antlr3VectorNew(DEFAULT_INITIAL_BUFFER_SIZE);
237 // Install the navigation nodes
240 // Install the navigation nodes
380 stream->nodes = antlr3VectorNew(hint);
383 // Install the navigation nodes
442 if (ctns->nodes != NULL)
444 ctns->nodes ->free (ctns->nodes);
469 /// Walk tree with depth-first-search and fill nodes buffer.
470 /// Don't add in DOWN, UP nodes if the supplied tree is a list (t is isNilNode
[all...] |
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| RewriteRuleTokenStream.js | 19 * This way we can do hetero tree nodes in rewrite.
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
| math_semantic_util.js | 117 * Removes elements from a list of MathML nodes that are either to be ignored or
121 * @param {Array.<Element>} nodes The node list to be cleaned.
124 cvox.SemanticUtil.purgeNodes = function(nodes) {
126 for (var i = 0, node; node = nodes[i]; i++) {
|
