| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDocumentImpl.java | 117 // nodes array: integer array blocks to hold the first level reference of the nodes,
121 ChunkedIntArray nodes = new ChunkedIntArray(4); field in class:DTMDocumentImpl
164 initDocument(documentNumber); // clear nodes and document handle
168 /** Bind a IncrementalSAXSource to this DTM. If we discover we need nodes
209 int slotnumber = nodes.appendSlot(w0, w1, w2, w3);
214 nodes.writeEntry(previousSibling,2,slotnumber);
628 nodes.writeSlot(0,DOCUMENT_NODE,-1,-1,0);
685 // // do document root node creation here on the first element, create nodes for
687 // // name indexes to the nodes array, keep track of the current node and paren
[all...] |
| /developers/samples/android/wearable/wear/Quiz/Wearable/src/main/java/com/example/android/quiz/ |
| QuizReportActionService.java | 59 NodeApi.GetConnectedNodesResult nodes = local
61 for (Node node : nodes.getNodes()) {
|
| /development/samples/wearable/Quiz/Wearable/src/main/java/com/example/android/wearable/quiz/ |
| QuizReportActionService.java | 59 NodeApi.GetConnectedNodesResult nodes = local
61 for (Node node : nodes.getNodes()) {
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRTreeIterator.h | 45 __strong ANTLRFastQueue *nodes; variable
55 @property(retain) ANTLRFastQueue *nodes; variable
|
| /external/chromium_org/chrome/browser/history/android/ |
| bookmark_model_sql_handler.cc | 58 std::vector<const BookmarkNode*> nodes;
59 bookmark_model->GetNodesByURL(url, &nodes);
60 for (std::vector<const BookmarkNode*>::iterator i = nodes.begin();
61 i != nodes.end(); ++i) {
73 std::vector<const BookmarkNode*> nodes;
74 bookmark_model->GetNodesByURL(url, &nodes);
75 for (std::vector<const BookmarkNode*>::iterator i = nodes.begin();
76 i != nodes.end(); ++i) {
|
| /external/chromium_org/components/keyed_service/core/ |
| dependency_graph.cc | 58 // Destroy nodes in reverse order.
65 // Step 1: Build a set of nodes with no incoming edges.
120 // Make a copy of all nodes.
121 std::deque<DependencyNode*> nodes; local
122 std::copy(all_nodes_.begin(), all_nodes_.end(), std::back_inserter(nodes));
126 std::deque<DependencyNode*>::iterator nodes_end(nodes.end());
135 nodes_end = std::remove(nodes.begin(), nodes_end, it->second);
137 nodes.erase(nodes_end, nodes.end());
142 for (std::deque<DependencyNode*>::const_iterator it = nodes.begin()
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLFrameOwnerElement.h | 126 DEFINE_STATIC_LOCAL(HashCountedSet<Node*>, nodes, ());
127 return nodes;
|
| /external/llvm/lib/CodeGen/ |
| SpillPlacement.h | 49 Node *nodes; member in class:llvm::SpillPlacement
51 // Nodes that are active in the current computation. Owned by the prepare()
55 // Nodes with active links. Populated by scanActiveBundles.
58 // Nodes that went positive during the last call to scanActiveBundles or
68 SpillPlacement() : MachineFunctionPass(ID), nodes(nullptr) {}
123 /// Return true is there are any positive nodes.
|
| /packages/apps/Mms/src/com/android/mms/dom/ |
| NodeListImpl.java | 53 * @param nodes The static node list.
55 public NodeListImpl(ArrayList<Node> nodes) {
56 mStaticNodes = nodes;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
| PropertyCallback.java | 41 * @param targetNodes the nodes to apply the property to, or null to use the
42 * nodes pass into the
67 final List<? extends INode> nodes = selectedNodes; local
71 for (INode targetNode : nodes) {
|
| /external/chromium_org/third_party/re2/re2/ |
| onepass.cc | 199 // Basically (OneState*)(nodes + statesize*nodeindex)
201 static inline OneState* IndexToNode(volatile uint8* nodes, int statesize,
204 const_cast<uint8*>(nodes + statesize*nodeindex));
245 volatile uint8* nodes = onepass_nodes_; local
264 state = IndexToNode(nodes, statesize, nextindex);
404 uint8* nodes = new uint8[maxnodes*statesize]; local
405 uint8* nodep = nodes;
415 OneState* node = IndexToNode(nodes, statesize, nodeindex);
576 OneState* node = IndexToNode(nodes, statesize, nodeindex);
594 memmove(nodep, nodes, nalloc*statesize)
[all...] |
| /external/regex-re2/re2/ |
| onepass.cc | 199 // Basically (OneState*)(nodes + statesize*nodeindex)
201 static inline OneState* IndexToNode(volatile uint8* nodes, int statesize,
204 const_cast<uint8*>(nodes + statesize*nodeindex));
245 volatile uint8* nodes = onepass_nodes_; local
264 state = IndexToNode(nodes, statesize, nextindex);
404 uint8* nodes = new uint8[maxnodes*statesize]; local
405 uint8* nodep = nodes;
415 OneState* node = IndexToNode(nodes, statesize, nodeindex);
576 OneState* node = IndexToNode(nodes, statesize, nodeindex);
594 memmove(nodep, nodes, nalloc*statesize)
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/speech_rules/ |
| mathml_store_util.js | 119 * for an mfenced expression starting with the first node in nodes.
147 * @param {Array.<Node>} nodes A node array.
150 * mfenced expression starting with the first node in nodes.
152 cvox.MathmlStoreUtil.mfencedSeparators = function(nodes, context) {
161 * Iterates over the list of content nodes of the parent of the given nodes.
162 * @param {Array.<Node>} nodes A node array.
167 cvox.MathmlStoreUtil.contentIterator = function(nodes, context) {
168 if (nodes.length > 0) {
169 var contentNodes = cvox.XpathUtil.evalXPath('../../content/*', nodes[0])
[all...] |
| /external/chromium_org/chrome/browser/ui/ash/accessibility/ |
| ax_tree_source_ash_unittest.cc | 29 // Helper to count the number of nodes in a tree.
114 ASSERT_EQ(GetSize(ax_tree.GetRoot()), out_update.nodes.size());
130 ASSERT_EQ(2U, out_update2.nodes.size());
132 out_update2.nodes[0].role);
134 ASSERT_EQ(textfield_wrapper->GetID(), out_update2.nodes[1].id);
136 out_update2.nodes[1].role);
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| loop_unroll.cpp | 55 int nodes; member in class:loop_unroll_count
60 nodes = 0;
68 nodes++;
74 nodes++;
117 if (count.fail || count.nodes * iterations > (int)max_iterations * 5)
|
| /external/mesa3d/src/glsl/ |
| loop_unroll.cpp | 55 int nodes; member in class:loop_unroll_count
60 nodes = 0;
68 nodes++;
74 nodes++;
117 if (count.fail || count.nodes * iterations > (int)max_iterations * 5)
|
| /packages/apps/UnifiedEmail/src/com/android/mail/lib/html/parser/ |
| HtmlTree.java | 38 * of the tree, we simply keeps a linear list of nodes (in-order).
40 * nodes:
96 /** Contains html nodes */
97 private final List<HtmlDocument.Node> nodes = new ArrayList<HtmlDocument.Node>(); field in class:HtmlTree
139 * @return the nodes of the tree
142 return Collections.unmodifiableList(nodes);
146 * @return number of nodes
149 return nodes.size();
165 html = getHtml(0, nodes.size(), wrapSize);
180 X.assertTrue(fromNode >= 0 && toNode <= nodes.size())
[all...] |
| HtmlParser.java | 60 // The entire array of nodes
61 private List<HtmlDocument.Node> nodes; field in class:HtmlParser
189 // Use a LinkedList because we don't know the number of nodes ahead of
191 nodes = Lists.newLinkedList();
235 nodes = coalesceTextNodes(nodes);
237 HtmlDocument doc = new HtmlDocument(nodes);
238 nodes = null;
244 * During the course of parsing, we may have multiple adjacent Text nodes,
245 * due to the sanitizer stripping out nodes between Text nodes. It i
[all...] |
| /external/chromium_org/content/browser/accessibility/ |
| browser_accessibility_manager.cc | 27 update.nodes.push_back(node1);
29 update.nodes.push_back(node2);
31 update.nodes.push_back(node3);
33 update.nodes.push_back(node4);
35 update.nodes.push_back(node5);
37 update.nodes.push_back(node6);
39 update.nodes.push_back(node7);
41 update.nodes.push_back(node8);
43 update.nodes.push_back(node9);
114 update.nodes.push_back(empty_document)
[all...] |
| /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
| HtmlParser.java | 60 // The entire array of nodes
61 private List<HtmlDocument.Node> nodes; field in class:HtmlParser
189 // Use a LinkedList because we don't know the number of nodes ahead of
191 nodes = Lists.newLinkedList();
235 nodes = coalesceTextNodes(nodes);
237 HtmlDocument doc = new HtmlDocument(nodes);
238 nodes = null;
244 * During the course of parsing, we may have multiple adjacent Text nodes,
245 * due to the sanitizer stripping out nodes between Text nodes. It i
[all...] |
| /libcore/support/src/test/java/tests/resources/x509/ |
| create.sh | 25 openssl req -config ${DIR}/default.cnf -new -key ${DIR}/privkey.pem -nodes -batch > /tmp/cert-rsa-req.pem
40 openssl req -config ${DIR}/default.cnf -new -key ${DIR}/privkey.pem -nodes -batch | openssl x509 -extfile ${DIR}/default.cnf -extensions keyUsage_extraLong_cert -req -signkey ${DIR}/privkey.pem -outform d > ${DIR}/cert-keyUsage-extraLong.der
42 openssl req -config ${DIR}/default.cnf -new -key ${DIR}/privkey.pem -nodes -batch | openssl x509 -extfile ${DIR}/default.cnf -extensions extendedKeyUsage_cert -req -signkey ${DIR}/privkey.pem -outform d > ${DIR}/cert-extendedKeyUsage.der
44 openssl req -config ${DIR}/default.cnf -new -key ${DIR}/privkey.pem -nodes -batch | openssl x509 -extfile ${DIR}/default.cnf -extensions ca_cert -req -signkey ${DIR}/privkey.pem -outform d > ${DIR}/cert-ca.der
46 openssl req -config ${DIR}/default.cnf -new -key ${DIR}/privkey.pem -nodes -batch | openssl x509 -extfile ${DIR}/default.cnf -extensions userWithPathLen_cert -req -signkey ${DIR}/privkey.pem -outform d > ${DIR}/cert-userWithPathLen.der
48 openssl req -config ${DIR}/default.cnf -new -key ${DIR}/privkey.pem -nodes -batch | openssl x509 -extfile ${DIR}/default.cnf -extensions caWithPathLen_cert -req -signkey ${DIR}/privkey.pem -outform d > ${DIR}/cert-caWithPathLen.der
50 openssl req -config ${DIR}/default.cnf -new -key ${DIR}/privkey.pem -nodes -batch | openssl x509 -extfile ${DIR}/default.cnf -extensions alt_other_cert -req -signkey ${DIR}/privkey.pem -outform d > ${DIR}/cert-alt-other.der
52 openssl req -config ${DIR}/default.cnf -new -key ${DIR}/privkey.pem -nodes -batch | openssl x509 -extfile ${DIR}/default.cnf -extensions alt_email_cert -req -signkey ${DIR}/privkey.pem -outform d > ${DIR}/cert-alt-email.der
54 openssl req -config ${DIR}/default.cnf -new -key ${DIR}/privkey.pem -nodes -batch | openssl x509 -extfile ${DIR}/default.cnf -extensions alt_dns_cert -req -signkey ${DIR}/privkey.pem -outform d > ${DIR}/cert-alt-dns.der
56 openssl req -config ${DIR}/default.cnf -new -key ${DIR}/privkey.pem -nodes -batch | openssl x509 -extfile ${DIR}/default.cnf -extensions alt_dirname_cert -req -signkey ${DIR (…)
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixLogarithm.h | 236 const RealScalar nodes[] = { 0.1127016653792583114820734600217600L, 0.5000000000000000000000000000000000L, local
244 result += weights[k] * (MatrixType::Identity(T.rows(), T.rows()) + nodes[k] * TminusI)
252 const RealScalar nodes[] = { 0.0694318442029737123880267555535953L, 0.3300094782075718675986671204483777L, local
260 result += weights[k] * (MatrixType::Identity(T.rows(), T.rows()) + nodes[k] * TminusI)
268 const RealScalar nodes[] = { 0.0469100770306680036011865608503035L, 0.2307653449471584544818427896498956L, local
278 result += weights[k] * (MatrixType::Identity(T.rows(), T.rows()) + nodes[k] * TminusI)
286 const RealScalar nodes[] = { 0.0337652428984239860938492227530027L, 0.1693953067668677431693002024900473L, local
296 result += weights[k] * (MatrixType::Identity(T.rows(), T.rows()) + nodes[k] * TminusI)
304 const RealScalar nodes[] = { 0.0254460438286207377369051579760744L, 0.1292344072003027800680676133596058L, local
316 result += weights[k] * (MatrixType::Identity(T.rows(), T.rows()) + nodes[k] * TminusI
324 const RealScalar nodes[] = { 0.0198550717512318841582195657152635L, 0.1016667612931866302042230317620848L, local
344 const RealScalar nodes[] = { 0.0159198802461869550822118985481636L, 0.0819844463366821028502851059651326L, local
366 const RealScalar nodes[] = { 0.0130467357414141399610179939577740L, 0.0674683166555077446339516557882535L, local
388 const RealScalar nodes[] = { 0.0108856709269715035980309994385713L, 0.0564687001159523504624211153480364L, local
[all...] |
| /external/fio/t/ |
| genzipf.c | 177 struct node *nodes; local
206 nodes = malloc(nranges * sizeof(struct node));
220 hash_insert(&nodes[j], offset);
227 qsort(nodes, j, sizeof(struct node), node_cmp);
234 printf("%lu, %lu\n", k, nodes[k].hits);
248 struct node *node = &nodes[k];
320 free(nodes);
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
| math_semantic_tree.js | 74 /** Branch nodes can store additional nodes that can be useful.
86 * @return {!Array.<cvox.SemanticTree.Node>} The nodes in the tree for which the
125 * Translates a list of nodes into XML representation.
127 * @param {!Array.<!cvox.SemanticTree.Node>} nodes A list of nodes.
130 var xmlNodeList = function(tag, nodes) {
131 var xmlNodes = nodes.map(function(x) {return x.xml(xml, brief);});
283 * Adds MathML nodes to the node's store of MathML nodes if necessary only, a
[all...] |
| /external/chromium_org/content/renderer/accessibility/ |
| renderer_accessibility_focus_only.cc | 100 event.update.nodes.resize(2);
101 ui::AXNodeData& root = event.update.nodes[0];
102 ui::AXNodeData& child = event.update.nodes[1];
142 << "\n" << event.nodes[0].DebugString(true);
|
