| /external/androidplot/AndroidPlot-Core/src/test/java/com/androidplot/ui/ |
| FixedTableModelTest.java | 49 Iterator<RectF> it = model.getIterator(tableRect, 5);
local
51 assertTrue(it.hasNext());
52 RectF cellRect = it.next();
54 assertTrue(it.hasNext());
55 cellRect = it.next();
57 assertTrue(it.hasNext());
58 cellRect = it.next();
60 assertTrue(it.hasNext());
61 cellRect = it.next();
63 assertTrue(it.hasNext());
82 Iterator<RectF> it = model.getIterator(tableRect, 5); local
217 Iterator<RectF> it = model.getIterator(tableRect, 5); local
[all...] |
| /external/tensorflow/tensorflow/stream_executor/ |
| temporary_memory_manager.cc | 31 for (auto it = records_.begin(); it != records_.end(); ++it) {
32 DeviceMemoryBase device_memory = it->first;
40 auto it = records_.find(device_memory); local
41 if (it == records_.end()) {
48 it->second.finalized = true;
54 for (auto it = records_.begin(); it != records_.end();) {
55 if (it->second.finalized)
70 auto it = records_.find(device_memory); local
86 auto it = records_.find(device_memory); local
[all...] |
| /external/xmlrpcpp/src/ |
| XmlRpcDispatch.cpp | 48 for (SourceList::iterator it=_sources.begin(); it!=_sources.end(); ++it)
49 if (it->getSource() == source)
51 _sources.erase(it);
61 for (SourceList::iterator it=_sources.begin(); it!=_sources.end(); ++it)
62 if (it->getSource() == source)
64 it->getMask() = eventMask
90 SourceList::iterator it; local
[all...] |
| /external/tensorflow/tensorflow/contrib/lite/toco/graph_transformations/ |
| remove_tensorflow_assert.cc | 36 auto it = op->inputs.begin(); local
37 while (it != op->inputs.end()) {
38 if (*it == assert_op->outputs[0]) {
39 op->inputs.erase(it);
42 ++it;
51 "on it",
55 // That's it. We can stop here, no need to duplicate the work that
|
| /external/vulkan-validation-layers/demos/smoke/ |
| Game.h | 118 for (auto it = args.begin(); it != args.end(); ++it) {
119 if (*it == "--b") {
121 } else if (*it == "--w") {
122 ++it;
123 settings_.initial_width = std::stoi(*it);
124 } else if (*it == "--h") {
125 ++it;
126 settings_.initial_height = std::stoi(*it);
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/cc_hash_table_map_/ |
| cmp_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
58 for (typename Other_Map_Type::const_iterator it = other.begin();
59 it != other.end(); ++it)
61 key_const_reference r_key = key_const_reference(PB_DS_V2F(*it));
71 if (p_mapped_value->second != it->second)
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/cc_hash_table_map_/ |
| cmp_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
58 for (typename Other_Map_Type::const_iterator it = other.begin();
59 it != other.end(); ++it)
61 key_const_reference r_key = key_const_reference(PB_DS_V2F(*it));
71 if (p_mapped_value->second != it->second)
|
| /system/core/logd/ |
| LogWhiteBlackList.cpp | 58 PruneCollection::iterator it; local
59 for (it = mNice.begin(); it != mNice.end();) {
60 it = mNice.erase(it);
62 for (it = mNaughty.begin(); it != mNaughty.end();) {
63 it = mNaughty.erase(it);
70 PruneCollection::iterator it; local
185 PruneCollection::iterator it = list->begin(); local
232 PruneCollection::iterator it; local
254 PruneCollection::iterator it; local
264 PruneCollection::iterator it; local
[all...] |
| /external/tensorflow/tensorflow/core/kernels/batching_util/ |
| fake_clock_env.cc | 30 for (auto it = sleeping_threads_.begin(); it != sleeping_threads_.end();) {
31 if (current_time_ >= it->wake_time) {
32 it->wake_notification->Notify();
33 it = sleeping_threads_.erase(it);
35 ++it;
45 for (auto it = sleeping_threads_.begin(); it != sleeping_threads_.end();
46 ++it) {
[all...] |
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 27 // well formed predicates, this doesn't happen, but it commonly occurs in
128 for (changeset_ty::const_iterator it = S.begin(),
129 ie = S.end(); it != ie; ++it)
130 for (succ_iterator_ty it2 = succ_begin(*it),
131 ie2 = succ_end(*it); it2 != ie2; ++it2)
184 for (changeset_ty::const_iterator it = Changes.begin(),
185 ie = Changes.end(); it != ie; ++it) {
186 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>()))
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 27 // well formed predicates, this doesn't happen, but it commonly occurs in
129 for (changeset_ty::const_iterator it = S.begin(),
130 ie = S.end(); it != ie; ++it)
131 for (succ_iterator_ty it2 = succ_begin(*it),
132 ie2 = succ_end(*it); it2 != ie2; ++it2)
190 for (changeset_ty::const_iterator it = Changes.begin(),
191 ie = Changes.end(); it != ie; ++it) {
192 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>()))
[all...] |
| /external/v8/tools/clang/rewrite_scoped_refptr/tests/ |
| test12-expected.cc | 22 explicit MyIter(MyMap::const_iterator it) : it_(it) {}
41 for (MyIter it = my_begin; it != my_end; ++it) {
43 if (it->get())
44 item = it->get();
|
| test12-original.cc | 22 explicit MyIter(MyMap::const_iterator it) : it_(it) {}
41 for (MyIter it = my_begin; it != my_end; ++it) {
43 if (*it)
44 item = *it;
|
| /external/clang/lib/Analysis/ |
| CocoaConventions.cpp | 98 StringRef::iterator it = functionName.begin(); local
99 StringRef::iterator start = it;
104 for ( ; it != endI ; ++it) {
105 // Search for the first character. It can either be 'C' or 'c'.
106 char ch = *it;
109 if (ch == 'c' && it != start && isLetter(*(it - 1)))
112 ++it;
118 if (it == endI
[all...] |
| /external/clang/tools/diagtool/ |
| DiagTool.cpp | 34 ToolMap::iterator it = getTools(tools)->find(toolCmd); local
35 return (it == getTools(tools)->end()) ? nullptr : it->getValue();
45 for (ToolMap::iterator it = getTools(tools)->begin(),
46 ei = getTools(tools)->end(); it != ei; ++it) {
47 toolNames.push_back(it->getKey());
48 unsigned len = it->getKey().size();
54 for (std::vector<llvm::StringRef>::iterator it = toolNames.begin(),
55 ei = toolNames.end(); it != ei; ++it)
[all...] |
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/fork/ |
| 13-1.c | 5 * This program is free software; you can redistribute it and/or modify it
9 * This program is distributed in the hope that it would be useful, but
64 struct itimerval it; local
69 it.it_interval.tv_sec = 15;
70 it.it_interval.tv_usec = 0;
71 it.it_value.tv_sec = 10;
72 it.it_value.tv_usec = 0;
74 ret = setitimer(ITIMER_REAL, &it, NULL);
81 ret = setitimer(ITIMER_VIRTUAL, &it, NULL)
[all...] |
| /external/webrtc/talk/app/webrtc/ |
| streamcollection.h | 63 for (StreamVector::iterator it = media_streams_.begin();
64 it != media_streams_.end(); ++it) {
65 if ((*it)->label().compare(label) == 0) {
66 return (*it);
95 for (StreamVector::iterator it = media_streams_.begin();
96 it != media_streams_.end(); ++it) {
97 if ((*it)->label().compare(stream->label()) == 0)
104 for (StreamVector::iterator it = media_streams_.begin()
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/splay_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
46 point_iterator it = find(r_key); local
47 if (it == base_type::end())
49 erase(it);
56 erase(iterator it)
59 if (it == base_type::end())
60 return it;
91 iterator it = base_type::begin(); local
[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/splay_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
46 point_iterator it = find(r_key); local
47 if (it == base_type::end())
49 erase(it);
56 erase(iterator it)
59 if (it == base_type::end())
60 return it;
91 iterator it = base_type::begin(); local
[all...] |
| /hardware/interfaces/broadcastradio/common/tests/ |
| IdentifierIterator_test.cpp | 36 auto it = V2_0::begin(sel); local
39 ASSERT_NE(end, it);
40 EXPECT_EQ(sel.primaryId, *it);
41 ASSERT_NE(end, ++it);
42 EXPECT_EQ(sel.secondaryIds[0], *it);
43 ASSERT_EQ(end, ++it);
49 auto it = V2_0::begin(sel); local
52 ASSERT_NE(end, it++); // primary id is always present
53 ASSERT_EQ(end, it);
69 auto it = V2_0::begin(sel) local
106 auto it = std::find_if(V2_0::begin(sel), end, isRdsPi); local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_iterlen.py | 8 The desired invariant is: len(it)==len(list(it)).
13 but it=iter(xrange(10)) starts at ten, and then goes to nine after it.next().
29 the new items. If it shrinks to a point before the most recent iteration,
58 # don't rely on it in your own programs
66 it = self.it
68 self.assertEqual(len(it), i)
69 it.next()
[all...] |
| /external/python/cpython2/Lib/test/ |
| test_iterlen.py | 8 The desired invariant is: len(it)==len(list(it)).
13 but it=iter(xrange(10)) starts at ten, and then goes to nine after it.next().
29 the new items. If it shrinks to a point before the most recent iteration,
58 # don't rely on it in your own programs
66 it = self.it
68 self.assertEqual(len(it), i)
69 it.next(
[all...] |
| /external/python/cpython3/Lib/test/ |
| test_iterlen.py | 8 The desired invariant is: len(it)==len(list(it)).
13 but it=iter(range(10)) starts at ten, and then goes to nine after next(it).
29 the new items. If it shrinks to a point before the most recent iteration,
55 it = self.it
57 self.assertEqual(length_hint(it), i)
58 next(it)
59 self.assertEqual(length_hint(it), 0
[all...] |
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| rtp_header_extension.cc | 28 std::map<uint8_t, HeaderExtension*>::iterator it = local
30 delete it->second;
31 extensionMap_.erase(it);
51 std::map<uint8_t, HeaderExtension*>::iterator it = local
53 if (it != extensionMap_.end()) {
54 if (it->second->type != type) {
61 it->second->active = active;
84 std::map<uint8_t, HeaderExtension*>::iterator it = local
86 assert(it != extensionMap_.end());
87 delete it->second
93 std::map<uint8_t, HeaderExtension*>::const_iterator it = local
105 std::map<uint8_t, HeaderExtension*>::const_iterator it = local
118 std::map<uint8_t, HeaderExtension*>::const_iterator it = local
135 std::map<uint8_t, HeaderExtension*>::const_iterator it = local
163 std::map<uint8_t, HeaderExtension*>::const_iterator it = local
205 std::map<uint8_t, HeaderExtension*>::const_iterator it = local
221 std::map<uint8_t, HeaderExtension*>::const_iterator it = local
[all...] |
| /frameworks/minikin/tests/unittest/ |
| StringPieceTest.cpp | 122 SplitIterator it(s, ',');
123 EXPECT_FALSE(it.hasNext());
127 SplitIterator it(s, ',');
128 EXPECT_TRUE(it.hasNext());
129 EXPECT_EQ("abcde", it.next());
130 EXPECT_FALSE(it.hasNext());
134 SplitIterator it(s, ',');
135 EXPECT_TRUE(it.hasNext());
136 EXPECT_EQ("a", it.next());
137 EXPECT_TRUE(it.hasNext())
[all...] |
