| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| TSet.java | 3 package com.google.clearsilver.jsilver.syntax.node;
|
| TSlash.java | 3 package com.google.clearsilver.jsilver.syntax.node;
|
| TStar.java | 3 package com.google.clearsilver.jsilver.syntax.node;
|
| TUvar.java | 3 package com.google.clearsilver.jsilver.syntax.node;
|
| TVar.java | 3 package com.google.clearsilver.jsilver.syntax.node;
|
| TWith.java | 3 package com.google.clearsilver.jsilver.syntax.node;
|
| /external/libchrome/base/sampling_heap_profiler/ |
| lock_free_address_hash_set.cc | 21 Node* node = reinterpret_cast<Node*>(bucket); local
22 while (node) {
23 Node* next = reinterpret_cast<Node*>(node->next);
24 delete node;
25 node = next;
37 Node* node = reinterpret_cast<Node*>(subtle::NoBarrier_Load(bucket_ptr)) local
[all...] |
| /external/libcxx/test/std/containers/associative/map/map.modifiers/ |
| insert_node_type.pass.cpp | 40 typename Container::node_type node = nf(i, i + 1); local
41 assert(!node.empty());
42 typename Container::insert_return_type irt = c.insert(std::move(node));
43 assert(node.empty());
45 assert(irt.node.empty());
51 { // Insert empty node.
56 assert(irt.node.empty());
60 { // Insert duplicate node.
65 assert(!irt.node.empty());
67 assert(irt.node.key() == 0 && irt.node.mapped() == 42)
[all...] |
| insert_node_type_hint.pass.cpp | 39 typename Container::node_type node = nf(i, i + 1); local
40 assert(!node.empty());
42 auto it = c.insert(c.end(), std::move(node));
43 assert(node.empty());
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| insert_node_type.pass.cpp | 39 typename Container::node_type node = nf(i, i + 1); local
40 assert(!node.empty());
41 typename Container::iterator it = c.insert(std::move(node));
42 assert(node.empty());
48 { // Insert empty node.
55 { // Insert duplicate node.
|
| /external/libcxx/test/std/containers/associative/multiset/ |
| insert_node_type.pass.cpp | 38 typename Container::node_type node = nf(i); local
39 assert(!node.empty());
40 typename Container::iterator it = c.insert(std::move(node));
41 assert(node.empty());
44 assert(node.empty());
49 { // Insert empty node.
56 { // Insert duplicate node.
|
| /external/libcxx/test/std/containers/associative/set/ |
| insert_node_type.pass.cpp | 39 typename Container::node_type node = nf(i); local
40 assert(!node.empty());
41 typename Container::insert_return_type irt = c.insert(std::move(node));
42 assert(node.empty());
44 assert(irt.node.empty());
50 { // Insert empty node.
55 assert(irt.node.empty());
59 { // Insert duplicate node.
64 assert(!irt.node.empty());
66 assert(irt.node.value() == 0)
[all...] |
| insert_node_type_hint.pass.cpp | 38 typename Container::node_type node = nf(i); local
39 assert(!node.empty());
41 auto it = c.insert(c.end(), std::move(node));
42 assert(node.empty());
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
| insert_node_type.pass.cpp | 39 typename Container::node_type node = nf(i, i + 1); local
40 assert(!node.empty());
41 typename Container::insert_return_type irt = c.insert(std::move(node));
42 assert(node.empty());
44 assert(irt.node.empty());
50 { // Insert empty node.
55 assert(irt.node.empty());
59 { // Insert duplicate node.
64 assert(!irt.node.empty());
66 assert(irt.node.key() == 0 && irt.node.mapped() == 42)
[all...] |
| insert_node_type_hint.pass.cpp | 39 typename Container::node_type node = nf(i, i + 1); local
40 assert(!node.empty());
42 auto it = c.insert(c.end(), std::move(node));
43 assert(node.empty());
|
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| insert_node_type.pass.cpp | 38 typename Container::node_type node = nf(i, i + 1); local
39 assert(!node.empty());
40 typename Container::iterator it = c.insert(std::move(node));
41 assert(node.empty());
48 { // Insert empty node.
55 { // Insert duplicate node.
|
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| insert_node_type.pass.cpp | 38 typename Container::node_type node = nf(i); local
39 assert(!node.empty());
40 typename Container::iterator it = c.insert(std::move(node));
41 assert(node.empty());
44 assert(node.empty());
49 { // Insert empty node.
56 { // Insert duplicate node.
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| insert_node_type.pass.cpp | 39 typename Container::node_type node = nf(i); local
40 assert(!node.empty());
41 typename Container::insert_return_type irt = c.insert(std::move(node));
42 assert(node.empty());
44 assert(irt.node.empty());
50 { // Insert empty node.
55 assert(irt.node.empty());
59 { // Insert duplicate node.
64 assert(!irt.node.empty());
66 assert(irt.node.value() == 0)
[all...] |
| insert_node_type_hint.pass.cpp | 38 typename Container::node_type node = nf(i); local
39 assert(!node.empty());
41 auto it = c.insert(c.end(), std::move(node));
42 assert(node.empty());
|
| /external/libnl/lib/ |
| hashtable.c | 61 nl_hash_node_t *node = ht->nodes[i]; local
64 while (node) {
65 saved_node = node;
66 node = node->next;
89 nl_hash_node_t *node; local
93 node = ht->nodes[key_hash];
95 while (node) {
96 if (nl_object_identical(node->obj, obj))
97 return node->obj
119 nl_hash_node_t *node; local
163 nl_hash_node_t *node, *prev; local
[all...] |
| /external/libtextclassifier/utils/sentencepiece/ |
| double_array_trie.h | 30 // A trie node specifies a node in the tree, either an intermediate node or
31 // a leaf node.
32 // A leaf node contains the id as an int of the string match. This id is encoded
34 // An intermediate node has an associated label and an offset to it's children.
37 // We account for endianness when using the node values, as they are serialized
56 // Returns whether a node as a leaf as a child.
59 // Available when a node is a leaf.
64 // Label associated with a node
72 const uint32 node = LittleEndian::ToHost32(nodes_[i]); local
[all...] |
| /external/libxml2/include/libxml/ |
| debugXML.h | 41 xmlNodePtr node,
45 xmlNodePtr node,
49 xmlNodePtr node,
81 xmlLsOneNode (FILE *output, xmlNodePtr node);
83 xmlLsCountNode (xmlNodePtr node);
116 xmlNodePtr node; member in struct:_xmlShellCtxt
127 * @node: a first node
128 * @node2: a second node
136 xmlNodePtr node,
[all...] |
| /external/mesa3d/src/compiler/nir/ |
| nir_control_flow.h | 51 /** puts a control flow node where the cursor is */
52 void nir_cf_node_insert(nir_cursor cursor, nir_cf_node *node);
54 /** puts a control flow node immediately after another control flow node */
56 nir_cf_node_insert_after(nir_cf_node *node, nir_cf_node *after)
58 nir_cf_node_insert(nir_after_cf_node(node), after);
61 /** puts a control flow node immediately before another control flow node */
63 nir_cf_node_insert_before(nir_cf_node *node, nir_cf_node *before)
65 nir_cf_node_insert(nir_before_cf_node(node), before)
72 nir_cf_node_insert(nir_before_cf_list(list), node); local
79 nir_cf_node_insert(nir_after_cf_list(list), node); local
[all...] |
| /external/mesa3d/src/gallium/auxiliary/cso_cache/ |
| cso_hash.h | 69 struct cso_node *node; member in struct:cso_hash_iter
134 if (!iter.node || iter.node == iter.hash->data.e)
142 if (!iter.node || iter.hash->data.e == iter.node)
144 return iter.node->value;
|
| /external/mesa3d/src/gallium/drivers/freedreno/ |
| freedreno_query_acc.h | 82 struct list_head node; /* list-node in ctx->active_acc_queries */ member in struct:fd_acc_query
|
