| /ndk/tests/device/test-stlport/unit/ |
| slist_test.cpp | 78 for(i = str.begin(); i != str.end(); i++)
87 for(i = str.begin(); i != str.end(); i++)
97 for(i = str.begin(); i != str.end(); i++)
106 for(i = str.begin(); i != str.end(); i++)
130 slit = sl.erase(sl.begin());
134 slit = sl.erase(sl.begin(), slit);
139 slit = sl.erase_after(sl.begin());
142 slit = sl.begin(); ++slit; ++slit;
143 slit = sl.erase_after(sl.begin(), slit);
160 sl.insert(sl.begin(), 5)
[all...] |
| mvctor_test.cpp | 58 v_v_ints.erase(v_v_ints.begin() + 1);
90 vec_strs.erase(vec_strs.begin() + 1);
118 unsigned int *punit = v_v_bits.front().begin()._M_iterator._M_p;
120 unsigned int *punit = v_v_bits.front().begin()._M_p;
132 CPPUNIT_ASSERT( punit == v_v_bits.front().begin()._M_iterator._M_p );
134 CPPUNIT_ASSERT( punit == v_v_bits.front().begin()._M_p );
190 vect_deque.insert(vect_deque.begin() + pos, vect_vect.begin(), vect_vect.end());
191 bufs.insert(bufs.begin() + pos, &vect_deque[pos].front());
192 bufs.insert(bufs.begin() + pos + 1, &vect_deque[pos + 1].front())
[all...] |
| uninitialized_test.cpp | 94 uninitialized_copy(src.begin(), src.end(), dst.begin());
95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end());
132 list<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
137 uninitialized_copy(src.begin(), src.end(), dst.begin());
139 for (it = dst.begin(); it != end; ++it) {
148 vector<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
153 uninitialized_copy(src.begin(), src.end(), dst.begin());
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| numeric | 56 accumulate(InputIterator begin, InputIterator end, T init,
58 { return _GLIBCXX_STD_P::accumulate(begin, end, init); }
62 accumulate(InputIterator begin, InputIterator end, T init,
64 { return _GLIBCXX_STD_P::accumulate(begin, end, init, binary_op); }
69 accumulate_switch(InputIterator begin, InputIterator end,
71 { return accumulate(begin, end, init, __gnu_parallel::sequential_tag()); }
76 accumulate_switch(InputIterator begin, InputIterator end, T init,
78 { return accumulate(begin, end, init, binary_op,
85 accumulate_switch(_RandomAccessIterator begin, _RandomAccessIterator end,
92 static_cast<__gnu_parallel::sequence_index_t>(end - begin)
[all...] |
| quicksort.h | 41 * @param begin Begin iterator of subsequence.
51 parallel_sort_qs_divide(RandomAccessIterator begin,
63 difference_type n = end - begin;
75 ::new(&(samples[s])) value_type(begin[index]);
85 parallel_partition(begin, end, pred, num_threads);
93 * @param begin Begin iterator of subsequence.
101 parallel_sort_qs_conquer(RandomAccessIterator begin,
112 __gnu_sequential::sort(begin, end, comp)
[all...] |
| partition.h | 48 * @param begin Begin iterator of input sequence to split.
55 parallel_partition(RandomAccessIterator begin, RandomAccessIterator end,
62 difference_type n = end - begin;
160 while (pred(begin[thread_left])
163 while (!pred(begin[thread_right])
172 std::swap(begin[thread_left], begin[thread_right]);
235 std::swap_ranges(begin + thread_left_border
237 begin + thread_left_border + 1
[all...] |
| balanced_quicksort.h | 92 * @param begin Begin iterator of subsequence.
97 * @pre @c (end-begin)>=1 */
100 qsb_divide(RandomAccessIterator begin, RandomAccessIterator end,
110 median_of_three_iterators(begin, begin + (end - begin) / 2,
115 difference_type n = end - begin;
118 (!comp(*pivot_pos, *begin) && !comp(*(begin + n / 2), *pivot_pos)
268 RandomAccessIterator begin = current.first, end = current.second; local
[all...] |
| /external/lzma/CPP/7zip/UI/Client7z/ |
| Client7z.dsp | 24 # Begin Project
80 # Begin Target
84 # Begin Group "Spec"
87 # Begin Source File
92 # Begin Source File
97 # Begin Group "Windows"
100 # Begin Source File
104 # Begin Source File
108 # Begin Source File
112 # Begin Source File
[all...] |
| /external/tinyxml/ |
| tinyxml_lib.dsp | 24 # Begin Project
81 # Begin Target
85 # Begin Group "Source Files"
88 # Begin Source File
92 # Begin Source File
96 # Begin Source File
100 # Begin Source File
105 # Begin Group "Header Files"
108 # Begin Source File
112 # Begin Source File
[all...] |
| /external/stlport/test/unit/ |
| mvctor_test.cpp | 58 v_v_ints.erase(v_v_ints.begin() + 1);
90 vec_strs.erase(vec_strs.begin() + 1);
118 unsigned int *punit = v_v_bits.front().begin()._M_iterator._M_p;
120 unsigned int *punit = v_v_bits.front().begin()._M_p;
132 CPPUNIT_ASSERT( punit == v_v_bits.front().begin()._M_iterator._M_p );
134 CPPUNIT_ASSERT( punit == v_v_bits.front().begin()._M_p );
190 vect_deque.insert(vect_deque.begin() + pos, vect_vect.begin(), vect_vect.end());
191 bufs.insert(bufs.begin() + pos, &vect_deque[pos].front());
192 bufs.insert(bufs.begin() + pos + 1, &vect_deque[pos + 1].front())
[all...] |
| uninitialized_test.cpp | 94 uninitialized_copy(src.begin(), src.end(), dst.begin());
95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end());
132 list<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
137 uninitialized_copy(src.begin(), src.end(), dst.begin());
139 for (it = dst.begin(); it != end; ++it) {
148 vector<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
153 uninitialized_copy(src.begin(), src.end(), dst.begin());
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/ |
| begin_end_impl.hpp | 34 typedef typename Sequence::begin type;
46 // 'begin/end' templates
81 // a sequence with nested 'begin/end' typedefs; just query them
82 AUX778076_IMPL_SPEC(begin, nested_begin_end_tag, typename Sequence::begin)
85 // if a type 'T' does not contain 'begin/end' or 'tag' members
86 // and doesn't specialize either 'begin/end' or 'begin_impl/end_impl'
88 AUX778076_IMPL_SPEC(begin, non_sequence_tag, void_)
90 AUX778076_IMPL_SPEC(begin, na, void_)
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| mvctor_test.cpp | 58 v_v_ints.erase(v_v_ints.begin() + 1);
90 vec_strs.erase(vec_strs.begin() + 1);
118 unsigned int *punit = v_v_bits.front().begin()._M_iterator._M_p;
120 unsigned int *punit = v_v_bits.front().begin()._M_p;
132 CPPUNIT_ASSERT( punit == v_v_bits.front().begin()._M_iterator._M_p );
134 CPPUNIT_ASSERT( punit == v_v_bits.front().begin()._M_p );
190 vect_deque.insert(vect_deque.begin() + pos, vect_vect.begin(), vect_vect.end());
191 bufs.insert(bufs.begin() + pos, &vect_deque[pos].front());
192 bufs.insert(bufs.begin() + pos + 1, &vect_deque[pos + 1].front())
[all...] |
| uninitialized_test.cpp | 94 uninitialized_copy(src.begin(), src.end(), dst.begin());
95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end());
132 list<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
137 uninitialized_copy(src.begin(), src.end(), dst.begin());
139 for (it = dst.begin(); it != end; ++it) {
148 vector<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
153 uninitialized_copy(src.begin(), src.end(), dst.begin());
[all...] |
| /external/chromium_org/android_webview/browser/ |
| gl_view_renderer_manager.cc | 20 std::find(mru_list_.begin(), mru_list_.end(), view));
22 return mru_list_.begin();
25 mru_list_.splice(mru_list_.begin(), mru_list_, key);
36 if (mru_list_.begin() == mru_list_.end())
38 return *mru_list_.begin();
|
| /external/chromium_org/content/renderer/android/ |
| address_detector.cc | 42 std::replace(address_16.begin(), address_16.end(),
48 const base::string16::const_iterator& begin,
53 if (address_parser::FindAddress(begin, end, start_pos, end_pos)) {
55 GetContentText(base::string16(begin + *start_pos, begin + *end_pos)));
|
| /external/chromium_org/net/tools/quic/test_tools/ |
| mock_epoll_server.cc | 34 event_queue_.begin()->first <= NowInUsec() &&
36 (event_queue_.begin()->first < until_in_usec_))
38 int64 event_time_in_usec = event_queue_.begin()->first;
39 events[num_events] = event_queue_.begin()->second;
43 event_queue_.erase(event_queue_.begin());
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| busy.test | 35 db2 eval {BEGIN EXCLUSIVE}
36 catchsql {BEGIN IMMEDIATE}
43 catchsql {BEGIN IMMEDIATE}
49 db eval {BEGIN; INSERT INTO t1 VALUES(5)}
50 db2 eval {BEGIN; SELECT * FROM t1}
|
| /external/llvm/utils/ |
| lldbDataFormatters.py | 15 begin = self.begin.GetValueAsUnsigned(0)
17 return (end - begin)/self.type_size
33 return self.begin.CreateChildAtOffset('['+str(index)+']',
37 self.begin = self.valobj.GetChildMemberWithName('BeginX')
|
| /libcore/luni/src/main/java/java/util/regex/ |
| Splitter.java | 69 int begin = 0; local
71 while (separatorCount + 1 != limit && (end = input.indexOf(ch, begin)) != -1) {
73 begin = end + 1;
76 if (limit == 0 && begin == lastPartEnd) {
84 --begin;
85 } while (input.charAt(begin - 1) == ch);
87 separatorCount -= input.length() - begin;
88 lastPartEnd = begin;
93 begin = 0;
95 end = input.indexOf(ch, begin);
119 int begin = 0; local
[all...] |
| /ndk/tests/device/test-gnustl-copy_vector_into_a_set/jni/ |
| copy_vector_into_a_set.cpp | 46 SetOfForms set1(vector1.begin(), vector1.end());
49 std::copy(vector1.begin(), vector1.end(), std::inserter(set1, set1.begin()));
51 for(std::vector<PasswordForm*>::iterator iter = vector1.begin(); iter != vector1.end(); ++iter) {
56 for(SetOfForms::iterator iter = set1.begin(); iter != set1.end(); ++iter) {
|
| /ndk/tests/device/test-stlport-copy_vector_into_a_set/jni/ |
| copy_vector_into_a_set.cpp | 46 SetOfForms set1(vector1.begin(), vector1.end());
49 std::copy(vector1.begin(), vector1.end(), std::inserter(set1, set1.begin()));
51 for(std::vector<PasswordForm*>::iterator iter = vector1.begin(); iter != vector1.end(); ++iter) {
56 for(SetOfForms::iterator iter = set1.begin(); iter != set1.end(); ++iter) {
|
| /external/chromium_org/base/ |
| stl_util.h | 40 void STLDeleteContainerPointers(ForwardIterator begin, ForwardIterator end) {
41 while (begin != end) {
42 ForwardIterator temp = begin;
43 ++begin;
56 void STLDeleteContainerPairPointers(ForwardIterator begin,
58 while (begin != end) {
59 ForwardIterator temp = begin;
60 ++begin;
70 void STLDeleteContainerPairFirstPointers(ForwardIterator begin,
72 while (begin != end)
[all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Collections.pas | 169 begin
177 begin
185 begin
192 begin
197 begin
202 begin
207 begin
210 begin
215 begin
223 begin
[all...] |
| /external/stlport/test/eh/ |
| test_algo.cpp | 41 SortClass* begin() { return items; } function in struct:SortBuffer
42 const SortClass* begin() const { return items; } function in struct:SortBuffer
50 EH_STD::sort( begin(), begin() + ( end() - begin() )/2 );
51 EH_STD::sort( begin() + ( end() - begin() )/2, end() );
52 for ( SortClass* p = begin(); p != end(); p++ )
63 SortClass* q = begin();
64 for ( const SortClass* p = rhs.begin() ; p != rhs.end(); p++,q++
[all...] |
