| /external/chromium_org/chrome/browser/extensions/api/bookmarks/ |
| bookmark_api_helpers.h | 27 // Add a JSON representation of |node| to the JSON |nodes|.
29 std::vector<linked_ptr<api::bookmarks::BookmarkTreeNode> >* nodes,
34 api::bookmarks::BookmarkTreeNode> >* nodes,
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| StaticNodeList.h | 43 static PassRefPtr<StaticNodeList> adopt(Vector<RefPtr<Node> >& nodes)
46 nodeList->m_nodes.swap(nodes);
|
| /external/chromium_org/third_party/WebKit/Source/core/inspector/ |
| InspectorMemoryAgent.cpp | 43 void InspectorMemoryAgent::getDOMCounters(ErrorString*, int* documents, int* nodes, int* jsEventListeners)
46 *nodes = InspectorCounters::counterValue(InspectorCounters::NodeCounter);
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| CommonTreeNodeStream.js | 1 /** A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.
3 * This node stream sucks all nodes out of the tree specified in
6 * includes pointers to DOWN and UP and EOF nodes.
30 /** Reuse same DOWN, UP navigation nodes unless this is true */
33 /** The index into the nodes list of the current node (next node
34 * to consume). If -1, nodes array not filled yet.
41 this.nodes = []; //new ArrayList(initialBufferSize);
57 nodes = this.nodes,
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| BufferedTreeNodeStream.java | 35 /** A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.
37 * This node stream sucks all nodes out of the tree specified in
40 * includes pointers to DOWN and UP and EOF nodes.
64 return i<nodes.size();
70 if ( current < nodes.size() ) {
71 return nodes.get(current);
77 throw new RuntimeException("cannot remove nodes from stream");
81 // all these navigation nodes are shared and hence they
89 * This buffer includes pointers to DOWN, UP, and EOF nodes
97 protected List nodes; field in class:BufferedTreeNodeStream
[all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| CommonTreeNodeStream.as | 34 /** A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.
36 * This node stream sucks all nodes out of the tree specified in
39 * includes pointers to DOWN and UP and EOF nodes.
54 // all these navigation nodes are shared and hence they
62 * This buffer includes pointers to DOWN, UP, and EOF nodes.
70 protected var nodes:Array;
72 /** Pull nodes from which tree? */
81 /** Reuse same DOWN, UP navigation nodes unless this is true */
84 /** The index into the nodes list of the current node (next nod
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRStreamEnumerator.h | 39 NSMutableArray *nodes; variable
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRStreamEnumerator.h | 39 NSMutableArray *nodes; variable
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRStreamEnumerator.h | 39 NSMutableArray *nodes; variable
|
| /external/chromium/chrome/browser/ui/webui/ |
| cookies_tree_model_util.h | 24 // Append the children nodes of |parent| in specified range to |nodes| list.
26 ListValue* nodes);
|
| /external/chromium_org/chrome/browser/ui/bookmarks/ |
| bookmark_drag_drop.h | 20 const std::vector<const BookmarkNode*>& nodes,
23 // Drops the bookmark nodes that are in |data| onto |parent_node| at |index|.
|
| /packages/apps/Mms/src/com/android/mms/dom/smil/ |
| ElementSequentialTimeContainerImpl.java | 47 ArrayList<Node> nodes = new ArrayList<Node>(); local
51 nodes.add(allChildren.item(i));
52 return new NodeListImpl(nodes);
55 return new NodeListImpl(nodes);
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
| RecognitionException.as | 93 * imaginary nodes w/o line/col info. We now search backwards looking
124 var nodes:TreeNodeStream = TreeNodeStream(input);
125 this.node = nodes.LT(1);
126 var adaptor:TreeAdaptor = nodes.treeAdaptor;
133 var priorNode:Object = nodes.LT(i);
144 priorNode = nodes.LT(i);
172 var nodes:TreeNodeStream = TreeNodeStream(input);
173 var adaptor:TreeAdaptor = nodes.treeAdaptor;
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| RecognitionException.java | 92 * imaginary nodes w/o line/col info. We now search backwards looking
124 TreeNodeStream nodes = (TreeNodeStream)input; local
125 this.node = nodes.LT(1);
126 TreeAdaptor adaptor = nodes.getTreeAdaptor();
133 Object priorNode = nodes.LT(i);
144 priorNode = nodes.LT(i);
172 TreeNodeStream nodes = (TreeNodeStream)input; local
173 TreeAdaptor adaptor = nodes.getTreeAdaptor();
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
| RecognitionException.js | 106 * imaginary nodes w/o line/col info. We now search backwards looking
117 var nodes = input,
124 this.node = nodes.LT(1);
125 var adaptor = nodes.getTreeAdaptor(),
132 priorNode = nodes.LT(i);
143 priorNode = nodes.LT(i);
173 var nodes = this.input;
174 var adaptor = nodes.getTreeAdaptor();
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 40 List<Node> edges; // points at which nodes?
53 protected Map<Object,Node> nodes = new HashMap<Object,Node>(); field in class:Graph
63 Node existing = nodes.get(a);
66 nodes.put(a, n);
84 while ( visited.size() < nodes.size() ) {
87 for (Iterator it = nodes.values().iterator(); it.hasNext();) {
|
| /external/chromium_org/content/renderer/accessibility/ |
| renderer_accessibility_browsertest.cc | 88 return event.nodes.size();
130 EXPECT_EQ(event.nodes.size(), 2U);
131 EXPECT_EQ(event.nodes[0].id, 1);
132 EXPECT_EQ(event.nodes[0].role,
134 EXPECT_EQ(event.nodes[0].state,
138 EXPECT_EQ(event.nodes[0].child_ids.size(), 1U);
151 EXPECT_EQ(event.nodes[0].id, 1);
152 EXPECT_EQ(event.nodes[0].role,
154 EXPECT_EQ(event.nodes[0].state,
157 EXPECT_EQ(event.nodes[0].child_ids.size(), 1U)
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| LintTooltipManager.java | 75 List<UiViewElementNode> nodes = computeNodes(event); local
76 if (nodes != null && !nodes.isEmpty()) {
77 if (nodes.equals(mShowingNodes)) {
80 show(nodes);
112 List<UiViewElementNode> nodes = computeNodes(event); local
113 if (nodes != null && !nodes.isEmpty()) {
114 show(nodes);
118 /** Show a tooltip listing the lint errors for the given nodes */
161 List<UiViewElementNode> nodes = new ArrayList<UiViewElementNode>(); local
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| BufferedTreeNodeStream.cs | 41 /** <summary>A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.</summary>
43 * This node stream sucks all nodes out of the tree specified in
46 * includes pointers to DOWN and UP and EOF nodes.
80 if (_index < _outer.nodes.Count)
81 return _outer.nodes[_index];
99 if (_index < _outer.nodes.Count)
102 return _index < _outer.nodes.Count;
112 // all these navigation nodes are shared and hence they
120 * This buffer includes pointers to DOWN, UP, and EOF nodes
128 protected IList nodes; field in class:Antlr.Runtime.Tree.BufferedTreeNodeStream
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| BufferedTreeNodeStream.cs | 42 /** <summary>A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.</summary>
44 * This node stream sucks all nodes out of the tree specified in
47 * includes pointers to DOWN and UP and EOF nodes.
86 if ( _index < _outer.nodes.Count )
87 return _outer.nodes[_index];
107 if ( _index < _outer.nodes.Count )
110 return _index < _outer.nodes.Count;
121 // all these navigation nodes are shared and hence they
129 * This buffer includes pointers to DOWN, UP, and EOF nodes
137 protected IList nodes; field in class:Antlr.Runtime.Tree.BufferedTreeNodeStream
[all...] |
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_utils.cc | 119 // Implementation of OpenAll. Opens all nodes of type URL and any children of
160 const std::vector<const BookmarkNode*>& nodes) {
162 for (size_t i = 0; i < nodes.size(); ++i)
163 child_count += ChildURLCount(nodes[i]);
174 // Comparison function that compares based on date modified of the two nodes.
266 // Drag from same profile. Move nodes.
293 std::vector<const BookmarkNode*> nodes = data.GetNodes(profile); local
294 for (size_t i = 0; i < nodes.size(); ++i) {
296 // nodes being dragged.
297 const BookmarkNode* node = nodes[i]
395 std::vector<const BookmarkNode*> nodes; local
450 std::vector<const BookmarkNode*> nodes; local
[all...] |
| /external/opencv/cv/src/ |
| _cvkdtree.hpp | 69 int dim; // split dimension; >=0 for nodes, -1 for leaves
78 node_array nodes; // node storage member in class:CvKDTree
173 int i = nodes.size();
174 node & n = *nodes.insert(nodes.end(), node());
184 int i = nodes.size();
186 node & n = *nodes.insert(nodes.end(), node());
192 nodes[i].left = left;
194 nodes[i].right = right
[all...] |
| /external/chromium_org/content/browser/accessibility/ |
| browser_accessibility_manager.cc | 60 std::vector<AccessibilityNodeData> nodes; local
61 nodes.push_back(src);
62 if (!UpdateNodes(nodes))
134 if (!UpdateNodes(param.nodes))
246 std::vector<AccessibilityNodeData> nodes; local
247 nodes.push_back(node1);
249 nodes.push_back(node2);
251 nodes.push_back(node3);
253 nodes.push_back(node4);
255 nodes.push_back(node5)
[all...] |
| /external/chromium_org/third_party/jinja2/ |
| ext.py | 13 from jinja2 import nodes namespace
103 list of multiple nodes.
115 return nodes.ExtensionAttribute(self.identifier, name, lineno=lineno)
120 :meth:`attr` + :class:`jinja2.nodes.Call`.
126 return nodes.Call(self.attr(name, lineno=lineno), args, kwargs,
245 variables[name.value] = var = nodes.Name(name.value, 'load')
248 if isinstance(var, nodes.Call):
249 plural_expr = nodes.Name('_trans', 'load')
251 plural_expr_assignment = nodes.Assign(
252 nodes.Name('_trans', 'store'), var
[all...] |
| /build/core/ |
| node_fns.mk | 121 # $(call get-inherited-nodes,PREFIX,A B)
128 define get-inherited-nodes
151 $(eval ### "Get the list of nodes that this variable inherits") \
198 $(call get-inherited-nodes,$(1).$(2),$(3)))
199 $(call _import-nodes-inner,$(1),$($(1).$(2).inherited),$(3))
216 # $(2): list of makefiles representing nodes to import
221 define _import-nodes-inner
238 # $(2): list of makefiles representing nodes to import
241 define import-nodes
248 $(call _import-nodes-inner,$(_node_import_context),$(_in),$(3))
[all...] |
