/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRStreamEnumerator.h | 39 NSMutableArray *nodes; variable
|
H A D | ANTLRTreeIterator.h | 48 ANTLRFastQueue *nodes; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
H A D | ANTLRStreamEnumerator.h | 39 NSMutableArray *nodes; variable
|
H A D | ANTLRTreeIterator.h | 48 ANTLRFastQueue *nodes; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
H A D | ANTLRStreamEnumerator.h | 39 NSMutableArray *nodes; variable
|
H A D | ANTLRTreeIterator.h | 48 ANTLRFastQueue *nodes; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRStreamEnumerator.h | 39 AMutableArray *nodes; variable 47 @property (retain) AMutableArray *nodes; variable
|
H A D | ANTLRTreeIterator.h | 45 __strong ANTLRFastQueue *nodes; variable 55 @property(retain) ANTLRFastQueue *nodes; variable
|
/external/chromium_org/ui/accessibility/ |
H A D | ax_tree_update.h | 44 // or 0 if no nodes should be cleared. Clearing a node means deleting 50 // A vector of nodes to update, according to the rules above. 51 std::vector<AXNodeData> nodes; member in struct:ui::AXTreeUpdate
|
/external/chromium_org/third_party/jinja2/ |
H A D | optimizer.py | 19 from jinja2 import nodes namespace 39 if node.find(nodes.Block) is not None: 43 except nodes.Impossible: 58 return nodes.Const.from_untrusted(node.as_const(), 61 except nodes.Impossible:
|
H A D | meta.py | 12 from jinja2 import nodes namespace 72 for node in ast.find_all((nodes.Extends, nodes.FromImport, nodes.Import, 73 nodes.Include)): 74 if not isinstance(node.template, nodes.Const): 76 if isinstance(node.template, (nodes.Tuple, nodes.List)): 80 if isinstance(template_name, nodes.Const): 96 elif isinstance(node, nodes [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/docs/source/exts/ |
H A D | formatting.py | 6 import docutils.nodes namespace
|
/external/mesa3d/src/gallium/docs/source/exts/ |
H A D | formatting.py | 6 import docutils.nodes namespace
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/ |
H A D | DebugTreeGrammarHelper.cs | 52 public DebugTreeGrammar( CommonTreeNodeStream nodes, List<CommonTree> functionDefinitions ) argument 53 : this( nodes )
|
H A D | ProfileTreeGrammarHelper.cs | 52 public ProfileTreeGrammar( CommonTreeNodeStream nodes, List<CommonTree> functionDefinitions ) argument 53 : this( nodes )
|
/external/chromium_org/chrome/browser/ui/bookmarks/ |
H A D | bookmark_ui_utils_unittest.cc | 23 std::vector<const BookmarkNode*> nodes; local 25 // This tests that |nodes| contains an URL. 30 nodes.push_back(page1); 31 EXPECT_TRUE(chrome::HasBookmarkURLs(nodes)); 33 nodes.clear(); 35 // This tests that |nodes| does not contain any URL. 38 nodes.push_back(folder1); 39 EXPECT_FALSE(chrome::HasBookmarkURLs(nodes)); 43 EXPECT_TRUE(chrome::HasBookmarkURLs(nodes)); 58 EXPECT_FALSE(chrome::HasBookmarkURLs(nodes)); 66 std::vector<const BookmarkNode*> nodes; local [all...] |
/external/chromium_org/content/public/browser/ |
H A D | ax_event_notification_details.cc | 11 const std::vector<ui::AXNodeData>& nodes, 17 nodes(nodes), 9 AXEventNotificationDetails( int node_id_to_clear, const std::vector<ui::AXNodeData>& nodes, ui::AXEvent event_type, int id, int process_id, int routing_id) argument
|
H A D | ax_event_notification_details.h | 21 const std::vector<ui::AXNodeData>& nodes, 30 std::vector<ui::AXNodeData> nodes; member in struct:content::AXEventNotificationDetails
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/resources/ |
H A D | 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/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/ |
H A D | State.java | 10 ArrayList nodes; field in class:State 12 State(@SuppressWarnings("hiding") int state, @SuppressWarnings("hiding") ArrayList nodes) argument 15 this.nodes = nodes;
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | TreeIterator.cs | 36 /** Return a node stream from a doubly-linked tree whose nodes 39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure. 47 // navigation nodes to return during walk and at end 52 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per 55 protected Queue<object> nodes; field in class:Antlr.Runtime.Tree.TreeIterator 65 nodes = new Queue<object>(); 95 nodes.Enqueue(eof); 100 if (nodes != null && nodes [all...] |
/external/chromium_org/chrome/test/chromedriver/chrome/ |
H A D | dom_tracker_unittest.cc | 57 const char nodes[] = local 63 params.Set("nodes", base::JSONReader::Read(nodes));
|
/external/chromium_org/components/bookmarks/browser/ |
H A D | bookmark_client.cc | 28 const NodeSet& nodes, 27 GetTypedCountForNodes( const NodeSet& nodes, NodeTypedCountPairs* node_typed_count_pairs) argument
|
/external/chromium_org/extensions/browser/ |
H A D | content_hash_tree_unittest.cc | 27 std::vector<std::string> nodes; local 29 EXPECT_EQ(std::string(), ComputeTreeHashRoot(nodes, 16)); 33 nodes.push_back(node1); 34 EXPECT_EQ(node1, ComputeTreeHashRoot(nodes, 16)); 36 // Two nodes. 38 nodes.push_back(node2); 45 EXPECT_EQ(expected, ComputeTreeHashRoot(nodes, 16)); 49 std::vector<std::string> nodes; local 52 nodes.push_back(FakeSignatureWithSeed(i)); 61 crypto::SHA256HashString(nodes[ [all...] |
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
H A D | ContentDistribution.h | 63 const WillBeHeapVector<RefPtrWillBeMember<Node> >& nodes() const { return m_nodes; } function in class:blink::FINAL
|