| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/speech_rules/ |
| store_util.js | 13 * Count list of nodes and concatenate this with the context string.
15 * @param {Array.<Node>} nodes A node array.
19 cvox.StoreUtil.nodeCounter = function(nodes, context) {
21 var localLength = nodes.length;
|
| /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/pdfium/core/src/fxcodec/fx_libopenjpeg/libopenjpeg20/ |
| tgt.c | 89 tree->nodes = (opj_tgt_node_t*) opj_calloc(tree->numnodes, sizeof(opj_tgt_node_t));
90 if(!tree->nodes) {
95 memset(tree->nodes,0,tree->numnodes * sizeof(opj_tgt_node_t));
98 node = tree->nodes;
99 l_parent_node = &tree->nodes[tree->numleafsh * tree->numleafsv];
178 opj_tgt_node_t* new_nodes = (opj_tgt_node_t*) opj_realloc(p_tree->nodes, l_node_size);
184 p_tree->nodes = new_nodes;
185 memset(((char *) p_tree->nodes) + p_tree->nodes_size, 0 , l_node_size - p_tree->nodes_size);
188 l_node = p_tree->nodes;
189 l_parent_node = &p_tree->nodes[p_tree->numleafsh * p_tree->numleafsv]
[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/chromium_org/content/renderer/accessibility/ |
| renderer_accessibility_browsertest.cc | 69 return event.update.nodes.size();
112 EXPECT_EQ(event.update.nodes.size(), 2U);
113 EXPECT_EQ(event.update.nodes[0].id, 1);
114 EXPECT_EQ(event.update.nodes[0].role,
116 EXPECT_EQ(event.update.nodes[0].state,
120 EXPECT_EQ(event.update.nodes[0].child_ids.size(), 1U);
133 EXPECT_EQ(event.update.nodes[0].id, 1);
134 EXPECT_EQ(event.update.nodes[0].role,
136 EXPECT_EQ(event.update.nodes[0].state,
139 EXPECT_EQ(event.update.nodes[0].child_ids.size(), 1U)
[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_org/chrome/browser/ui/bookmarks/ |
| bookmark_drag_drop.h | 21 const std::vector<const BookmarkNode*>& nodes,
25 // Drops the bookmark nodes that are in |data| onto |parent_node| at |index|.
|
| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_client.cc | 27 const NodeSet& nodes,
|
| /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();) {
|
| /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/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/third_party/libaddressinput/src/java/src/com/android/i18n/addressinput/ |
| LookupKey.java | 111 this.mNodes = builder.nodes;
137 if (newKeyBuilder.nodes.containsKey(hierarchyField)) {
138 newKeyBuilder.nodes.remove(hierarchyField);
142 if (!newKeyBuilder.nodes.containsKey(hierarchyField)) {
202 parentKeyBuilder.nodes.remove(mostGranularField);
286 private Map<AddressField, String> nodes = new EnumMap<AddressField, String>( field in class:LookupKey.Builder
309 this.nodes.put(field, oldKey.mNodes.get(field));
317 * node in the hierarchy is empty, all the descendant nodes' values will be neglected. For
349 this.nodes.put(HIERARCHY[0], substr);
359 this.nodes.put(HIERARCHY[i - 1], substr)
[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...] |
| /external/antlr/antlr-3.4/runtime/Python/tests/ |
| t047treeparser.py | 64 nodes = antlr3.tree.CommonTreeNodeStream(r.tree)
65 nodes.setTokenStream(tStream)
66 walker = self.getWalker(nodes)
113 nodes = antlr3.tree.CommonTreeNodeStream(r.tree)
114 nodes.setTokenStream(tStream)
115 walker = self.getWalker(nodes)
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| KeyTable.java | 113 * @return a set of nodes referenced by the key named <CODE>name</CODE> and the reference <CODE>ref</CODE>. If no node is referenced by this key, an empty node set is returned.
241 XNodeSet nodes = (XNodeSet) m_refsTable.get(ref); local
242 if (nodes == null)
244 nodes = new XNodeSet(node, xctxt.getDTMManager());
245 nodes.nextNode();
246 m_refsTable.put(ref, nodes);
250 // Nodes are passed to this method in document order. Since we need to
252 // in each nodeset. We use nodes.nextNode after each entry so we can
254 if (nodes.getCurrentNode() != node) {
255 nodes.mutableNodeset().addNode(node)
[all...] |
