| /external/webkit/Source/WebCore/dom/ |
| StaticHashSetNodeList.cpp | 37 StaticHashSetNodeList::StaticHashSetNodeList(ListHashSet<RefPtr<Node> >& nodes)
39 m_nodes.swap(nodes);
|
| /system/core/sh/ |
| Android.mk | 20 nodes.c \
45 p4 edit init.c nodes.c nodes.h token.h
51 sh ./mknodes.sh nodetypes nodes.c.pat .
|
| /external/freetype/src/cache/ |
| ftcmru.c | 177 list->nodes = NULL;
187 while ( list->nodes )
188 FTC_MruList_Remove( list, list->nodes );
210 first = list->nodes;
221 FTC_MruNode_Up( &list->nodes, node );
247 node = list->nodes->prev;
253 FTC_MruNode_Up( &list->nodes, node );
260 FTC_MruNode_Remove( &list->nodes, node );
273 FTC_MruNode_Prepend( &list->nodes, node );
311 FTC_MruNode_Remove( &list->nodes, node )
[all...] |
| /external/openssl/crypto/x509v3/ |
| pcy_lib.c | 115 if (level->nodes)
116 n += sk_X509_POLICY_NODE_num(level->nodes);
130 return sk_X509_POLICY_NODE_value(level->nodes, i);
|
| pcy_tree.c | 114 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++)
116 node = sk_X509_POLICY_NODE_value(plev->nodes, i);
316 /* Iterate through all in nodes linking matches */
317 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++)
319 node = sk_X509_POLICY_NODE_value(last->nodes, i);
362 /* Look for matching nodes in previous level */
426 /* Locate unmatched nodes */
451 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++)
453 node = sk_X509_POLICY_NODE_value(last->nodes, i);
461 * nodes
[all...] |
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_node_data.cc | 105 const std::vector<const BookmarkNode*>& nodes) {
106 ReadFromVector(nodes);
113 const std::vector<const BookmarkNode*>& nodes) {
116 if (nodes.empty())
119 for (size_t i = 0; i < nodes.size(); ++i)
120 elements.push_back(Element(nodes[i]));
293 std::vector<const BookmarkNode*> nodes; local
296 return nodes;
302 nodes.clear();
303 return nodes;
311 std::vector<const BookmarkNode*> nodes = GetNodes(profile); local
[all...] |
| bookmark_pasteboard_helper_mac.h | 45 // Copies the bookmark nodes to the dragging pasteboard and initiates a
47 void StartDrag(Profile* profile, const std::vector<const BookmarkNode*>& nodes,
55 // of individual bookmark nodes and/or bookmark folders.
|
| bookmark_node_data.h | 27 // . A set of nodes from the bookmark model.
57 // Children, only used for non-URL nodes.
82 explicit BookmarkNodeData(const std::vector<const BookmarkNode*>& nodes);
87 bool ReadFromVector(const std::vector<const BookmarkNode*>& nodes);
123 // Returns the nodes represented by this DragData. If this DragData was
124 // created from the same profile then the nodes from the model are returned.
125 // If the nodes can't be found (may have been deleted), an empty vector is
130 // match any nodes or there is more than one node.
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| FuncKey.java | 61 XNodeSet nodes = null; local
138 nodes = new XNodeSet(upi);
143 nodes = kmgr.getNodeSetDTMByKey(xctxt, docContext, keyname,
146 nodes.setRoot(xctxt.getCurrentNode(), xctxt);
149 return nodes;
|
| /libcore/dom/src/test/java/org/w3c/domts/level2/core/ |
| documentimportnode21.java | 40 * second element node whose tagName is address and import these nodes into another document.
41 * Verify if the nodes have been imported correctly by checking the nodeNames of the
42 * imported nodes, since they are imported into a new document which doesnot have thes defined,
43 * the imported nodes should not have any children.
44 * Now import the entityRef nodes into the same document and verify if the nodes have been
45 * imported correctly by checking the nodeNames of the imported nodes, and by checking the
46 * value of the replacement text of the imported nodes.
97 NodeList nodes; local
120 nodes = entRefImp2.getChildNodes()
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/tree-parser/ |
| basic.rb | 37 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
38 nodes.token_stream = tokens
39 walker = FlatListWalker::TreeParser.new( nodes )
73 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
74 nodes.token_stream = tokens
75 walker = SimpleTreeWalker::TreeParser.new( nodes )
112 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
113 nodes.token_stream = tokens
114 walker = FlatVsTreeDecisionWalker::TreeParser.new( nodes )
150 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree
[all...] |
| /build/core/ |
| node_fns.mk | 123 # $(call get-inherited-nodes,PREFIX,A B)
130 define get-inherited-nodes
153 $(eval ### "Get the list of nodes that this variable inherits") \
200 $(call get-inherited-nodes,$(1).$(2),$(3)))
201 $(call _import-nodes-inner,$(1),$($(1).$(2).inherited),$(3))
218 # $(2): list of makefiles representing nodes to import
223 define _import-nodes-inner
240 # $(2): list of makefiles representing nodes to import
243 define import-nodes
250 $(call _import-nodes-inner,$(_node_import_context),$(_in),$(3))
[all...] |
| /external/webkit/Source/WebCore/xml/ |
| XPathResult.cpp | 157 const NodeSet& nodes = m_value.toNodeSet(); local
159 return nodes.firstNode();
161 return nodes.anyNode();
212 const NodeSet& nodes = m_value.toNodeSet(); local
213 if (index >= nodes.size())
216 return nodes[index];
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTreeNodeStream.java | 169 // stream has 7 real + 6 nav nodes
200 // stream has 7 real + 6 nav nodes
224 stream.mark(); // keep saving nodes though
245 // stream has 7 real + 6 nav nodes
284 // stream has 7 real + 6 nav nodes
307 // stream has 7 real + 6 nav nodes
328 // stream has 8 real + 10 nav nodes
330 CommonTree[] nodes = new CommonTree[n]; local
332 nodes[i] = new CommonTree(new CommonToken((i+1)*10));
334 Tree g = nodes[0]
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/functions/ |
| FuncId.java | 43 * Fill in a list with nodes that match a space delimited list if ID
47 * @param docContext The document where the nodes are being looked for.
49 * @param usedrefs List of references for which nodes were found.
50 * @param nodeSet Node set where the nodes will be added to.
51 * @param mayBeMore true if there is another set of nodes to be looked for.
118 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager()); local
119 NodeSetDTM nodeSet = nodes.mutableNodeset();
140 return nodes;
149 return nodes;
|
| /external/libsepol/src/ |
| node_internal.h | 5 #include <sepol/nodes.h>
|
| /hardware/ti/omap3/omx/core_plugin/omx_core_plugin/ |
| Android.mk | 19 $(PV_TOP)/nodes/pvmediaoutputnode/include \
20 $(PV_TOP)/nodes/pvdownloadmanagernode/config/opencore \
|
| /external/bluetooth/glib/glib/ |
| ghash.c | 60 GHashNode *nodes; member in struct:_GHashTable
200 node = &hash_table->nodes [node_index];
225 node = &hash_table->nodes [node_index];
275 node = &hash_table->nodes [node_index];
305 node = &hash_table->nodes [node_index];
352 * Removes all nodes from the table. Since this may be a precursor to
366 GHashNode *node = &hash_table->nodes [i];
378 /* We need to set node->key_hash = 0 for all nodes - might as well be GC
380 memset (hash_table->nodes, 0, hash_table->size * sizeof (GHashNode));
391 * nodes currently held. If you call this function then a resize wil
[all...] |
| /external/chromium/chrome/browser/extensions/ |
| extension_bookmark_manager_api.cc | 43 // Gets a vector of bookmark nodes from the argument list of IDs.
46 size_t args_index, std::vector<const BookmarkNode*>* nodes) {
66 nodes->push_back(node);
78 // Add id and parentId so we can associate the data with existing nodes on the
128 std::vector<const BookmarkNode*> nodes = data.GetNodes(profile); local
129 for (size_t i = 0; i < nodes.size(); ++i)
130 AddNodeToList(list, *nodes[i]);
215 std::vector<const BookmarkNode*> nodes; local
217 0, &nodes));
218 bookmark_utils::CopyToClipboard(model, nodes, cut)
364 std::vector<const BookmarkNode*> nodes; local
373 profile(), nodes, web_ui->tab_contents()->GetNativeView()); local
[all...] |
| /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...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRTreeIterator.h | 45 __strong ANTLRFastQueue *nodes; variable
55 @property(retain) ANTLRFastQueue *nodes; variable
|
| /external/chromium/chrome/browser/resources/net_internals/ |
| timelineviewpainter.js | 15 addTextNode(node, 'Selected nodes (' + sourceEntries.length + '):');
|
| /external/clang/include/clang/AST/ |
| Makefile | 24 $(Verb) $(ClangTableGen) -gen-clang-stmt-nodes -o $(call SYSPATH, $@) $<
29 $(Verb) $(ClangTableGen) -gen-clang-decl-nodes -o $(call SYSPATH, $@) $<
|
| /external/skia/third_party/glu/libtess/ |
| priorityq-heap.h | 76 * complicated than an ordinary heap. "nodes" is the heap itself;
77 * active nodes are stored in the range 1..pq->size. When the
79 * The children of node i are nodes 2i and 2i+1.
83 * represents that key (ie. nodes[handles[i].node].handle == i).
94 PQnode *nodes; member in struct:PriorityQ
111 #define __gl_pqHeapMinimum(pq) ((pq)->handles[(pq)->nodes[1].handle].key)
|
| /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;
|
