| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/bin_search_tree_/ |
| erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
66 iterator it(p_z);
67 ++it;
68 m_p_head->m_p_left = it.m_p_nd;
72 iterator it(p_z);
73 --it;
74 m_p_head->m_p_right = it.m_p_nd
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pat_trie_/ |
| r_erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
66 iterator it(p_z);
67 ++it;
68 m_p_head->m_p_left = it.m_p_nd;
72 iterator it(p_z);
73 --it;
74 m_p_head->m_p_right = it.m_p_nd
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/bin_search_tree_/ |
| erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
66 iterator it(p_z);
67 ++it;
68 m_p_head->m_p_left = it.m_p_nd;
72 iterator it(p_z);
73 --it;
74 m_p_head->m_p_right = it.m_p_nd
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/pat_trie_/ |
| r_erase_fn_imps.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
66 iterator it(p_z);
67 ++it;
68 m_p_head->m_p_left = it.m_p_nd;
72 iterator it(p_z);
73 --it;
74 m_p_head->m_p_right = it.m_p_nd
[all...] |
| /prebuilts/go/darwin-x86/test/fixedbugs/ |
| bug428.go | 7 // Test that when the compiler expands append inline it does not
8 // overwrite a value before it needs it (issue 3369).
|
| /prebuilts/go/linux-x86/test/fixedbugs/ |
| bug428.go | 7 // Test that when the compiler expands append inline it does not
8 // overwrite a value before it needs it (issue 3369).
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/libcxx/experimental/containers/sequences/dynarray/dynarray.overview/ |
| indexing.pass.cpp | 38 auto it = vals.begin (); local
39 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
41 assert ( *it == dyn[i]);
48 auto it = vals.begin (); local
49 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
51 assert ( *it == dyn[i]);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.foreach/ |
| for_each_n.pass.cpp | 37 Iter it = std::for_each_n(Iter(ia), 0, std::ref(f)); local
38 assert(it == Iter(ia));
44 Iter it = std::for_each_n(Iter(ia), s, std::ref(f)); local
46 assert(it == Iter(ia+s));
54 Iter it = std::for_each_n(Iter(ia), 1, std::ref(f)); local
56 assert(it == Iter(ia+1));
|
| /system/extras/libperfmgr/ |
| RequestGroup.cc | 49 for (auto it = request_map_.begin(); it != request_map_.end();) {
51 it->second - now);
53 it = request_map_.erase(it);
57 ++it;
|
| /system/libufdt/ |
| ufdt_node.c | 48 struct ufdt_node *it = ((struct ufdt_node_fdt_node *)node)->child; local
49 while (it != NULL) {
50 struct ufdt_node *next = it->sibling;
51 ufdt_node_destruct(it, pool);
52 it = next;
87 struct ufdt_node **it = NULL; local
88 for_each_node(it, node) {
89 if (ufdt_node_name_eq(*it, name, len)) return *it;
103 struct ufdt_node **it = NULL local
208 struct ufdt_node *it; local
285 struct ufdt_node **it; local
[all...] |
| /prebuilts/ndk/r16/sources/third_party/shaderc/libshaderc_util/include/libshaderc_util/ |
| string_piece.h | 86 for (auto it = begin_; it != end_; ++it) {
87 if (!callee(*it)) {
88 return it - begin_;
103 for (auto it = begin_ + pos; it != end_; ++it) {
104 if (to_search.find_first_of(*it) == npos) {
105 return it - begin_
150 auto it = begin_ + pos + 1; local
176 auto it = begin_ + pos + 1; local
[all...] |
| /frameworks/compile/mclinker/lib/LD/ |
| GroupReader.cpp | 113 ArchiveListType::iterator it = ar_list.begin(); local
118 for (it = ar_list.begin(); it != end; ++it) {
119 Archive& ar = (*it)->archive;
120 // if --whole-archive is given to this archive, no need to read it again
130 for (it = ar_list.begin(); it != end; ++it) {
131 Archive& ar = (*it)->archive
[all...] |
| /system/bt/packet/avrcp/ |
| get_item_attributes.cc | 88 auto it = begin() + BrowsePacket::kMinSize(); local
89 return static_cast<Scope>(*it);
93 auto it = begin() + BrowsePacket::kMinSize() + static_cast<size_t>(1); local
94 return base::ByteSwap(it.extract<uint64_t>());
98 auto it = begin() + BrowsePacket::kMinSize() + static_cast<size_t>(9); local
99 return base::ByteSwap(it.extract<uint16_t>());
103 auto it = begin() + BrowsePacket::kMinSize() + static_cast<size_t>(11); local
104 return *it;
109 auto it = begin() + BrowsePacket::kMinSize() + static_cast<size_t>(11); local
110 size_t number_of_attributes = it.extract<uint8_t>()
[all...] |
| /frameworks/base/tools/stats_log_api_gen/ |
| Collation.cpp | 168 for (map<int, const FieldDescriptor *>::const_iterator it = fields.begin();
169 it != fields.end(); it++) {
170 const int number = it->first;
171 const FieldDescriptor *field = it->second;
185 for (map<int, const FieldDescriptor *>::const_iterator it = fields.begin();
186 it != fields.end(); it++) {
187 const FieldDescriptor *field = it->second;
209 // Check that if there's an attribution chain, it's at position 1
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/ |
| AST.stg | 52 /* We created the adaptor so we must free it
77 <ruleDescriptor.tokenLabels:{it | <ASTLabelType> <it.label.text>_tree;}; separator="\n">
78 <ruleDescriptor.tokenListLabels:{it | <ASTLabelType> <it.label.text>_tree;}; separator="\n">
80 :{it | pANTLR3_REWRITE_RULE_<rewriteElementType>_STREAM stream_<it>;}; separator="\n">
82 :{it | pANTLR3_REWRITE_RULE_SUBTREE_STREAM stream_<it>;}; separator="\n">
93 <ruleDescriptor.tokenLabels:{it | <it.label.text>_tree = NULL;}; separator="\n"
[all...] |
| /art/profman/ |
| boot_image_profile.cc | 83 ClassDataItemIterator it(*dex_file, class_data);
84 while (it.HasNextStaticField()) {
85 const uint32_t flags = it.GetFieldAccessFlags();
91 it.Next();
93 it.SkipInstanceFields();
94 while (it.HasNextMethod()) {
95 const uint32_t flags = it.GetMethodAccessFlags();
106 it.Next();
113 auto it = inferred_classes.find(std::make_pair(profile.get(), ref.TypeIndex())); local
114 if (it != inferred_classes.end() |
[all...] |
| /device/linaro/hikey/bluetooth/ |
| async_fd_watcher.cc | 120 for (auto& it : watched_fds_) {
121 FD_SET(it.first, &read_fds);
122 max_read_fd = std::max(max_read_fd, it.first);
163 for (auto& it : watched_fds_) {
164 if (FD_ISSET(it.first, &read_fds)) {
165 saved_callbacks.push_back(it);
170 for (auto& it : saved_callbacks) {
171 if (it.second) {
172 it.second(it.first)
[all...] |
| /external/v8/src/ |
| cancelable-task.cc | 81 for (auto it = cancelable_tasks_.begin(); it != cancelable_tasks_.end();) {
82 auto current = it;
84 ++it;
103 for (auto it = cancelable_tasks_.begin(); it != cancelable_tasks_.end();) {
104 if (it->second->Cancel()) {
105 it = cancelable_tasks_.erase(it);
107 ++it;
[all...] |
| /external/webrtc/webrtc/video/ |
| vie_remb.cc | 47 // The module probably doesn't have a remote SSRC yet, so don't add it to the
56 for (RtpModules::iterator it = receive_modules_.begin();
57 it != receive_modules_.end(); ++it) {
58 if ((*it) == rtp_rtcp) {
59 receive_modules_.erase(it);
81 for (RtpModules::iterator it = rtcp_sender_.begin();
82 it != rtcp_sender_.end(); ++it) {
83 if ((*it) == rtp_rtcp)
[all...] |
| /external/webp/src/enc/ |
| vp8i_enc.h | 260 void VP8IteratorInit(VP8Encoder* const enc, VP8EncIterator* const it);
262 void VP8IteratorReset(VP8EncIterator* const it);
264 void VP8IteratorSetRow(VP8EncIterator* const it, int y);
266 void VP8IteratorSetCountDown(VP8EncIterator* const it, int count_down);
268 int VP8IteratorIsDone(const VP8EncIterator* const it);
272 void VP8IteratorImport(VP8EncIterator* const it, uint8_t* tmp_32);
274 void VP8IteratorExport(const VP8EncIterator* const it);
276 int VP8IteratorNext(VP8EncIterator* const it);
278 void VP8IteratorSaveBoundary(VP8EncIterator* const it);
280 int VP8IteratorProgress(const VP8EncIterator* const it,
[all...] |
| /external/boringssl/src/crypto/asn1/ |
| tasn_utl.c | 10 * apply to all code found in this distribution, be it the RC4, RSA,
77 int asn1_get_choice_selector(ASN1_VALUE **pval, const ASN1_ITEM *it) {
78 int *sel = offset2ptr(*pval, it->utype);
84 const ASN1_ITEM *it) {
86 sel = offset2ptr(*pval, it->utype);
93 const ASN1_ITEM *it) {
94 if (it->itype != ASN1_ITYPE_SEQUENCE &&
95 it->itype != ASN1_ITYPE_NDEF_SEQUENCE) {
98 const ASN1_AUX *aux = it->funcs;
105 void asn1_refcount_set_one(ASN1_VALUE **pval, const ASN1_ITEM *it) {
[all...] |
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| RandomSetter.h | 33 * To use it you need to both define EIGEN_UNORDERED_MAP_SUPPORT and include the unordered_map header file
136 * For performance and memory consumption reasons it is highly recommended to use one of
178 * a sparse matrix from scratch, then you must set it to zero first using the
204 for (typename SparseMatrixType::InnerIterator it(*mp_target,j); it; ++it)
205 (*this)(TargetRowMajor?j:it.index(), TargetRowMajor?it.index():j) = it.value();
222 for (typename HashMapType::iterator it = m_hashmaps[k].begin(); it!=end; ++it
[all...] |
| /external/python/cpython3/Lib/test/ |
| test_list.py | 22 # XXX If/when PySequence_Length() returns a ssize_t, it should be
81 it, a = pickle.loads(d)
83 self.assertEqual(type(it), type(itorig))
84 self.assertEqual(list(it), data)
89 it, a = pickle.loads(d)
91 self.assertEqual(type(it), type(itorig))
92 self.assertEqual(list(it), data[1:])
98 it, a = pickle.loads(d)
100 self.assertEqual(type(it), type(itorig))
101 self.assertEqual(list(it), data[len(orig):]
[all...] |
| /external/tensorflow/tensorflow/core/grappler/ |
| graph_view.cc | 51 auto it = nodes_.find(node_name); local
52 if (it == nodes_.end()) {
55 return it->second;
78 auto it = fanouts_.find(port); local
79 if (it == fanouts_.end()) {
82 return it->second;
95 auto it = nodes_.find(fanin_name); local
96 if (it != nodes_.end()) {
97 fanin.node = it->second;
114 auto it = nodes_.find(fanin_name) local
130 auto it = num_regular_outputs_.find(&node); local
135 auto it = fanouts_.find(port); local
155 auto it = nodes_.find(fanin_name); local
[all...] |
| /external/webrtc/webrtc/modules/video_coding/test/ |
| vcm_payload_sink_factory.cc | 136 for (PayloadTypesIterator it = plt.begin(); it != plt.end(); ++it) {
137 if (it->codec_type() != kVideoCodecULPFEC &&
138 it->codec_type() != kVideoCodecRED) {
140 VideoCodingModule::Codec(it->codec_type(), &codec);
141 codec.plType = it->payload_type();
167 for (Sinks::iterator it = sinks_.begin(); it != sinks_.end(); ++it) {
198 Sinks::iterator it = std::find(sinks_.begin(), sinks_.end(), sink); local
[all...] |
