| /external/libcxx/test/std/experimental/filesystem/class.rec.dir.itr/rec.dir.itr.members/ |
| copy_assign.pass.cpp | 33 // in a non-default state. The returned 'it' is in a
35 // it.options() == directory_options::skip_permission_denied
36 // it.depth() == 1
37 // it.recursion_pending() == true
41 recursive_directory_iterator it(testDir,
43 TEST_ASSERT(it != endIt);
44 while (it.depth() != 1) {
45 ++it;
46 TEST_ASSERT(it != endIt);
48 TEST_ASSERT(it.depth() == 1)
111 const recursive_directory_iterator it = createInterestingIterator(); local
131 const recursive_directory_iterator it; local
140 recursive_directory_iterator it = createInterestingIterator(); local
[all...] |
| move_assign.pass.cpp | 28 // the directory iterators. Turn off this warning so we can test it.
39 // in a non-default state. The returned 'it' is in a
41 // it.options() == directory_options::skip_permission_denied
42 // it.depth() == 1
43 // it.recursion_pending() == true
47 recursive_directory_iterator it(testDir,
49 TEST_ASSERT(it != endIt);
50 while (it.depth() != 1) {
51 ++it;
52 TEST_ASSERT(it != endIt)
121 recursive_directory_iterator it = createInterestingIterator(); local
144 recursive_directory_iterator it; local
153 recursive_directory_iterator it = createInterestingIterator(); local
[all...] |
| /external/libcxx/test/std/utilities/memory/specialized.algorithms/specialized.destroy/ |
| destroy_n.pass.cpp | 36 using It = forward_iterator<Counted*>;
46 It it = std::destroy_n(It(p), 4); local
47 assert(it == It(p+4));
|
| /external/libcxx/utils/google-benchmark/src/ |
| csv_reporter.cc | 139 auto it = run.counters.find(ucn); local
140 if(it == run.counters.end()) {
143 Out << "," << it->second;
|
| /external/libese/esed/ |
| utils.h | 49 auto it = first; local
50 ret = *it++ << 24;
51 ret |= *it++ << 16;
52 ret |= *it++ << 8;
53 ret |= *it++;
54 return {ret, it};
65 auto it = first; local
66 *it++ = 0xff & (value >> 24);
67 *it++ = 0xff & (value >> 16);
68 *it++ = 0xff & (value >> 8)
[all...] |
| /external/libese/libapdu/ |
| apdu.cpp | 40 auto it = mCommand.begin(); local
41 *it++ = cla;
42 *it++ = ins;
43 *it++ = p1;
44 *it++ = p2;
49 *it++ = 0;
50 *it++ = 0xff & (lc >> 8);
52 *it++ = 0xff & lc;
53 mDataBegin = it;
54 it += lc
[all...] |
| /external/libmojo/mojo/common/ |
| data_pipe_utils.cc | 68 auto it = source.begin(); local
78 while (it != source.end() && byte_index < buffer_num_bytes) {
79 char_buffer[byte_index++] = *it++;
82 if (it == source.end())
|
| /external/libmojo/mojo/public/cpp/bindings/tests/ |
| map_unittest.cc | 184 auto it = stl_map.find(kStringIntData[i].string_data); local
185 ASSERT_TRUE(it != stl_map.end());
186 EXPECT_EQ(kStringIntData[i].int_data, it->second);
|
| /external/libtextclassifier/ |
| strip-unpaired-brackets.cc | 42 auto it = context_unicode.begin(); local
43 std::advance(it, span.first);
44 return *it;
50 auto it = context_unicode.begin(); local
51 std::advance(it, span.second - 1);
52 return *it;
|
| tokenizer.cc | 43 auto it = std::lower_bound( local
49 // std::lower_bound it needs to return true when range < codepoint;
50 // the first time it will return false the lower bound is found and
53 // It might seem weird that the condition is range.end <= codepoint
54 // here but when codepoint == range.end it means it's actually just
58 if (it != codepoint_ranges_.end() && (*it)->start <= codepoint &&
59 (*it)->end > codepoint) {
60 return it->get()
[all...] |
| /external/llvm/lib/Option/ |
| Arg.cpp | 73 it = ASL.begin(), ie = ASL.end(); it != ie; ++it) {
74 if (it != ASL.begin())
76 OS << *it; local
|
| /external/llvm/unittests/ADT/ |
| DeltaAlgorithmTest.cpp | 21 for (std::set<unsigned>::const_iterator it = S.begin(),
22 ie = S.end(); it != ie; ++it) {
23 if (it != S.begin())
25 OS << *it; local
|
| /external/llvm/utils/unittest/googletest/src/ |
| gtest-typed-test.cc | 71 for (DefinedTestIter it = defined_test_names_.begin();
72 it != defined_test_names_.end();
73 ++it) {
74 if (name == *it) {
88 for (DefinedTestIter it = defined_test_names_.begin();
89 it != defined_test_names_.end();
90 ++it) {
91 if (tests.count(*it) == 0) {
92 errors << "You forgot to list test " << *it << ".\n"; local
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/fork/ |
| 18-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
73 struct itimerspec it; local
93 it.it_interval.tv_nsec = 0;
95 it.it_interval.tv_sec = 0;
97 it.it_value.tv_sec = 0;
99 it.it_value.tv_nsec = 500000000; /* 0.5 sec */
101 ret = timer_settime(tmr, 0, &it, NULL);
|
| /external/mesa3d/src/gtest/src/ |
| gtest-typed-test.cc | 71 for (DefinedTestIter it = defined_test_names_.begin();
72 it != defined_test_names_.end();
73 ++it) {
74 if (name == *it) {
88 for (DefinedTestIter it = defined_test_names_.begin();
89 it != defined_test_names_.end();
90 ++it) {
91 if (tests.count(*it) == 0) {
92 errors << "You forgot to list test " << *it << ".\n"; local
|
| /external/nist-sip/java/gov/nist/javax/sip/header/ |
| ExtensionHeaderList.java | 64 ListIterator<ExtensionHeaderImpl> it = this.listIterator(); local
65 while(it.hasNext()) {
66 ExtensionHeaderImpl eh = (ExtensionHeaderImpl) it.next();
|
| /external/pdfium/core/fpdfapi/font/ |
| cpdf_cmapmanager.cpp | 21 auto it = m_CMaps.find(name); local
22 if (it != m_CMaps.end())
23 return it->second;
|
| /external/pdfium/core/fpdfapi/parser/ |
| cpdf_indirect_object_holder.cpp | 34 auto it = m_IndirectObjs.find(objnum); local
35 return (it != m_IndirectObjs.end()) ? FilterInvalidObjNum(it->second.get())
101 auto it = m_IndirectObjs.find(objnum); local
102 if (it == m_IndirectObjs.end() || !FilterInvalidObjNum(it->second.get()))
105 m_IndirectObjs.erase(it);
|
| /external/pdfium/core/fxcrt/css/ |
| cfx_cssrulecollection.cpp | 32 auto it = m_TagRules.find(FX_HashCode_GetW(tagname.c_str(), true)); local
33 return it != m_TagRules.end() ? &it->second : nullptr;
|
| /external/pdfium/core/fxge/apple/ |
| fx_mac_imp.cpp | 89 auto it = m_FontList.find(new_face); local
90 if (it != m_FontList.end())
91 return it->second.get();
94 auto it = m_FontList.find(face); local
95 if (it != m_FontList.end())
96 return it->second.get();
117 it = m_FontList.find(face);
118 return it != m_FontList.end() ? it->second.get() : nullptr;
|
| /external/pdfium/core/fxge/ |
| cfx_fontcache.cpp | 32 auto it = map.find(face); local
33 if (it != map.end()) {
34 CountedFaceCache* counted_face_cache = it->second.get();
60 auto it = map.find(face); local
61 if (it == map.end())
64 CountedFaceCache* counted_face_cache = it->second.get();
68 map.erase(it);
|
| /external/pdfium/testing/ |
| range_set.cpp | 19 auto it = ranges().upper_bound(fixed_range); local
21 if (it == ranges().begin())
24 --it; // Now it starts equal or before range.first.
25 return it->second >= fixed_range.second;
43 ++start; // start element is entirely before current range, skip it.
63 for (const auto& it : range_set.ranges())
64 Union(it);
|
| /external/perf_data_converter/src/quipper/ |
| perf_option_parser.cc | 77 * ... So just ban it until the new option is universal on ChromeOS perf.
174 const auto& it = options.find(*args_iter); local
175 if (it == options.end()) {
178 if (it->second == OptionType::Value) {
|
| /external/perfetto/src/traced/probes/filesystem/ |
| prefix_finder.cc | 41 auto it = children_.find(search_node); local
42 if (it == children_.end())
45 return const_cast<Node*>(&(*it));
52 for (auto it = state_.cbegin() + 1;
53 it != state_.cbegin() + static_cast<ssize_t>(len + 1); it++) {
54 Node* next = cur->MaybeChild(it->first);
56 next = cur->AddChild(it->first);
|
| /external/protobuf/gtest/src/ |
| gtest-typed-test.cc | 71 for (DefinedTestIter it = defined_test_names_.begin();
72 it != defined_test_names_.end();
73 ++it) {
74 if (name == *it) {
88 for (DefinedTestIter it = defined_test_names_.begin();
89 it != defined_test_names_.end();
90 ++it) {
91 if (tests.count(*it) == 0) {
92 errors << "You forgot to list test " << *it << ".\n"; local
|
