| /external/chromium_org/ui/accessibility/ |
| 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/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRStreamEnumerator.h | 39 AMutableArray *nodes; variable
47 @property (retain) AMutableArray *nodes; variable
|
| /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/clang/test/CodeGenCXX/ |
| constructor-template.cpp | 17 A nodes; member in struct:B
39 List<BinomialNode<T>*> nodes; member in class:BinomialNode
|
| /frameworks/base/core/java/android/view/accessibility/ |
| AccessibilityCache.java | 31 * It is updated when windows change or nodes change.
68 * the cache will either refresh some nodes or evict some nodes.
119 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId); local
120 if (nodes == null) {
123 AccessibilityNodeInfo cachedInfo = nodes.get(sourceId);
146 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId); local
147 if (nodes == null) {
150 AccessibilityNodeInfo info = nodes.get(accessibilityNodeId);
211 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId) local
277 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId); local
302 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.get(windowId); local
375 LongSparseArray<AccessibilityNodeInfo> nodes = mNodeCache.valueAt(i); local
[all...] |
| /external/doclava/src/com/google/doclava/ |
| Hierarchy.java | 27 HashMap<String, TreeSet<String>> nodes = new HashMap<String, TreeSet<String>>(); local
32 TreeSet<String> me = nodes.get(name);
35 nodes.put(name, me);
41 TreeSet<String> s = nodes.get(sname);
44 nodes.put(sname, s);
51 * Set<String> keys = nodes.keySet(); for (String n: keys) { System.out.println("class: " + n);
53 * TreeSet<String> values = nodes.get(n); for (String v: values) {
57 int depth = depth(nodes, "java.lang.Object");
62 recurse(nodes, "java.lang.Object", hdf.getChild("classes.0"), depth, depth);
65 Set<String> keys = nodes.keySet()
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| register_allocate.c | 34 * edges in the graph between nodes that interfere (can't be allocated
41 * That likely causes other nodes to become trivially colorable as well.
43 * Then during the "select" process, nodes are popped off of that
118 * List of which nodes this node interferes with. This should be
150 struct ra_node *nodes; member in struct:ra_graph
151 unsigned int count; /**< count of nodes. */
298 g->nodes[n1].adjacency[n2] = GL_TRUE;
299 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2;
300 g->nodes[n1].adjacency_count++
[all...] |
| /external/mesa3d/src/mesa/program/ |
| register_allocate.c | 34 * edges in the graph between nodes that interfere (can't be allocated
41 * That likely causes other nodes to become trivially colorable as well.
43 * Then during the "select" process, nodes are popped off of that
118 * List of which nodes this node interferes with. This should be
150 struct ra_node *nodes; member in struct:ra_graph
151 unsigned int count; /**< count of nodes. */
298 g->nodes[n1].adjacency[n2] = GL_TRUE;
299 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2;
300 g->nodes[n1].adjacency_count++
[all...] |
| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_utils.cc | 63 // Comparison function that compares based on date modified of the two nodes.
167 const std::vector<const BookmarkNode*>& nodes,
169 if (nodes.empty())
172 // Create array of selected nodes with descendants filtered out.
174 for (size_t i = 0; i < nodes.size(); ++i)
175 if (!HasSelectedAncestor(model, nodes, nodes[i]->parent()))
176 filtered_nodes.push_back(nodes[i]);
216 std::vector<const BookmarkNode*> nodes; local
226 nodes.push_back(parent)
432 std::vector<const BookmarkNode*> nodes; local
[all...] |
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/parser/ |
| JJTAddressListParserState.java | 6 private java.util.Stack<Node> nodes; field in class:JJTAddressListParserState
9 private int sp; // number of nodes on stack
14 nodes = new java.util.Stack<Node>();
30 nodes.removeAllElements();
39 return nodes.elementAt(0);
44 nodes.push(n);
54 return nodes.pop();
59 return nodes.peek();
85 children. That number of nodes are popped from the stack and
102 the nodes that have been pushed since the node was opened ar
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/x509v3/ |
| pcy_node.c | 76 X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes,
86 idx = sk_X509_POLICY_NODE_find(nodes, &l);
90 return sk_X509_POLICY_NODE_value(nodes, idx);
100 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++)
102 node = sk_X509_POLICY_NODE_value(level->nodes, i);
135 if (!level->nodes)
136 level->nodes = policy_node_cmp_new();
137 if (!level->nodes)
139 if (!sk_X509_POLICY_NODE_push(level->nodes, node))
|
| /external/openssl/crypto/x509v3/ |
| pcy_node.c | 76 X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes,
86 idx = sk_X509_POLICY_NODE_find(nodes, &l);
90 return sk_X509_POLICY_NODE_value(nodes, idx);
100 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++)
102 node = sk_X509_POLICY_NODE_value(level->nodes, i);
135 if (!level->nodes)
136 level->nodes = policy_node_cmp_new();
137 if (!level->nodes)
139 if (!sk_X509_POLICY_NODE_push(level->nodes, node))
|
| /external/chromium_org/third_party/WebKit/Source/core/events/ |
| TreeScopeEventContext.cpp | 42 WillBeHeapVector<RefPtrWillBeMember<Node> > nodes;
43 nodes.reserveInitialCapacity(path.size());
47 nodes.append(path[i].node());
49 nodes.append(path[i].node());
51 m_eventPath = StaticNodeList::adopt(nodes);
|
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathPath.cpp | 63 NodeSet& nodes = v.modifiableNodeSet(); local
64 nodes.sort();
69 evaluationContext.size = nodes.size();
72 for (unsigned j = 0; j < nodes.size(); j++) {
73 Node* node = nodes[j];
81 nodes.swap(*newNodes);
128 OwnPtrWillBeRawPtr<NodeSet> nodes(NodeSet::create());
129 nodes->append(context);
130 evaluate(*nodes);
133 return Value(nodes.release(), Value::adopt)
233 NodeSet& nodes = v.modifiableNodeSet(); local
[all...] |
| XPathStep.cpp | 70 // E.g., there is no need to build a set of all "foo" nodes to evaluate
129 void Step::evaluate(Node* context, NodeSet& nodes) const
134 nodesInAxis(context, nodes);
141 if (!nodes.isSorted())
144 for (unsigned j = 0; j < nodes.size(); j++) {
145 Node* node = nodes[j];
148 evaluationContext.size = nodes.size();
154 nodes.swap(*newNodes);
193 // In XPath land, namespace nodes are not accessible on the
225 // nodes (because HTML5 says so)
[all...] |
| /external/chromium_org/third_party/jinja2/ |
| 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:
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
| patcomp.py | 101 nodes = node.children
102 if len(nodes) >= 3 and nodes[1].type == token.EQUAL:
103 name = nodes[0].value
104 nodes = nodes[2:]
106 if len(nodes) >= 2 and nodes[-1].type == self.syms.Repeater:
107 repeat = nodes[-1]
108 nodes = nodes[:-1
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
| patcomp.py | 101 nodes = node.children
102 if len(nodes) >= 3 and nodes[1].type == token.EQUAL:
103 name = nodes[0].value
104 nodes = nodes[2:]
106 if len(nodes) >= 2 and nodes[-1].type == self.syms.Repeater:
107 repeat = nodes[-1]
108 nodes = nodes[:-1
[all...] |
| /external/chromium_org/chrome/browser/history/android/ |
| bookmark_model_sql_handler_unittest.cc | 89 std::vector<const BookmarkNode*> nodes; local
90 bookmark_model_->GetNodesByURL(row.url(), &nodes);
91 ASSERT_EQ(1u, nodes.size());
92 EXPECT_EQ(row.title(), nodes[0]->GetTitle());
93 const BookmarkNode* parent = nodes[0]->parent();
110 std::vector<const BookmarkNode*> nodes; local
111 bookmark_model_->GetNodesByURL(row.url(), &nodes);
112 ASSERT_EQ(1u, nodes.size());
113 EXPECT_EQ(row.title(), nodes[0]->GetTitle());
114 const BookmarkNode* parent = nodes[0]->parent()
148 std::vector<const BookmarkNode*> nodes; local
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| DomFront.java | 35 private final ArrayList<SsaBasicBlock> nodes; field in class:DomFront
60 nodes = meth.getBlocks();
62 int szNodes = nodes.size();
76 int szNodes = nodes.size();
80 SsaBasicBlock node = nodes.get(i);
120 int szNodes = nodes.size();
123 SsaBasicBlock node = nodes.get(i);
148 int szNodes = nodes.size();
155 SsaBasicBlock domParent = nodes.get(info.idom);
156 domParent.addDomChild(nodes.get(i))
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/ |
| Main.java | 15 CommonTreeNodeStream nodes = new CommonTreeNodeStream(r0); local
16 nodes.setTokenStream(tokens);
17 LangDumpDecl walker = new LangDumpDecl(nodes);
|
| /external/chromium_org/third_party/libxml/src/include/libxml/ |
| c14n.h | 38 * a) default attributes (if any) are added to all nodes
69 xmlNodeSetPtr nodes,
77 xmlNodeSetPtr nodes,
85 xmlNodeSetPtr nodes,
102 * Signature for a C14N callback on visible nodes
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| DomFront.java | 39 private final ArrayList<SsaBasicBlock> nodes; field in class:DomFront
64 nodes = meth.getBlocks();
66 int szNodes = nodes.size();
80 int szNodes = nodes.size();
84 SsaBasicBlock node = nodes.get(i);
124 int szNodes = nodes.size();
127 SsaBasicBlock node = nodes.get(i);
152 int szNodes = nodes.size();
159 SsaBasicBlock domParent = nodes.get(info.idom);
160 domParent.addDomChild(nodes.get(i))
[all...] |
| /external/libxml2/include/libxml/ |
| c14n.h | 38 * a) default attributes (if any) are added to all nodes
69 xmlNodeSetPtr nodes,
77 xmlNodeSetPtr nodes,
85 xmlNodeSetPtr nodes,
102 * Signature for a C14N callback on visible nodes
|
| /external/chromium_org/chrome/test/chromedriver/chrome/ |
| dom_tracker.cc | 40 const base::Value* nodes; local
41 if (!params.Get("nodes", &nodes))
42 return Status(kUnknownError, "DOM.setChildNodes missing 'nodes'");
44 if (!ProcessNodeList(nodes)) {
46 base::JSONWriter::Write(nodes, &json);
48 "DOM.setChildNodes has invalid 'nodes': " + json);
69 bool DomTracker::ProcessNodeList(const base::Value* nodes) {
71 if (!nodes->GetAsList(&nodes_list))
|
