| /sdk/find_java2/WinLauncher2/ |
| WinLauncher2.rc | 32 BEGIN
37 BEGIN
47 BEGIN
84 BEGIN
86 BEGIN
88 BEGIN
100 BEGIN
116 BEGIN
141 BEGIN
143 BEGIN
[all...] |
| /prebuilts/gcc/darwin-x86/host/i686-apple-darwin-4.2.1/lib/gcc/i686-apple-darwin10/4.2.1/include/ |
| xmmintrin.h | 43 /* APPLE LOCAL begin xmmintrin.h for kernel 4123064 */
157 /* APPLE LOCAL begin nodebug inline 4152603 */
161 /* APPLE LOCAL begin radar 5618945 */
171 /* APPLE LOCAL begin radar 4152603 */
172 /* APPLE LOCAL begin radar 5618945 */
184 /* APPLE LOCAL begin radar 5618945 */
192 /* APPLE LOCAL begin radar 5618945 */
200 /* APPLE LOCAL begin radar 5618945 */
208 /* APPLE LOCAL begin radar 5618945 */
216 /* APPLE LOCAL begin radar 5618945 *
[all...] |
| /prebuilts/gcc/darwin-x86/host/i686-apple-darwin-4.2.1/lib/gcc/i686-apple-darwin11/4.2.1/include/ |
| xmmintrin.h | 43 /* APPLE LOCAL begin xmmintrin.h for kernel 4123064 */
157 /* APPLE LOCAL begin nodebug inline 4152603 */
161 /* APPLE LOCAL begin radar 5618945 */
171 /* APPLE LOCAL begin radar 4152603 */
172 /* APPLE LOCAL begin radar 5618945 */
184 /* APPLE LOCAL begin radar 5618945 */
192 /* APPLE LOCAL begin radar 5618945 */
200 /* APPLE LOCAL begin radar 5618945 */
208 /* APPLE LOCAL begin radar 5618945 */
216 /* APPLE LOCAL begin radar 5618945 *
[all...] |
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| remove_if.pass.cpp | 35 C c1(std::begin(t1), std::end(t1));
36 C c2(std::begin(t2), std::end(t2));
40 assert(cp.count() == std::distance(std::begin(t1), std::end(t1)));
47 C c1(std::begin(t1), std::end(t1));
52 assert(cp.count() == std::distance(std::begin(t1), std::end(t1)));
60 C c1(std::begin(t1), std::end(t1));
61 C c2(std::begin(t2), std::end(t2));
65 assert(cp.count() == std::distance(std::begin(t1), std::end(t1)));
84 C c1(std::begin(t1), std::end(t1));
85 C c2(std::begin(t2), std::end(t2))
[all...] |
| /external/lzma/CPP/7zip/UI/Client7z/ |
| Client7z.dsp | 24 # Begin Project
81 # Begin Target
85 # Begin Group "Spec"
88 # Begin Source File
92 # Begin Source File
97 # Begin Source File
102 # Begin Group "Windows"
105 # Begin Source File
109 # Begin Source File
113 # Begin Source File
[all...] |
| /external/clang/test/SemaCXX/ |
| for-range-dereference.cpp | 4 Data *begin();
13 Data *begin();
19 int* begin(DeletedADLBegin) = delete; //expected-note {{candidate function has been explicitly deleted}} \
23 Data *begin();
30 Data * begin(ADLNoEnd); // expected-note 6 {{candidate function not viable: no known conversion}}
48 for (auto i : NB) { }// expected-error{{range type 'NoBegin' has 'end' member but no 'begin' member}}
50 for (auto i : pNB) { }// expected-error{{invalid range expression of type 'NoBegin *'; no viable 'begin' function available}}
52 for (auto i : ppNB) { }// expected-error{{invalid range expression of type 'NoBegin **'; no viable 'begin' function available}}
54 for (auto i : pppppNB) { }// expected-error{{invalid range expression of type 'NoBegin *****'; no viable 'begin' function available}}
59 for (auto i : pANE) { } // expected-error{{invalid range expression of type 'ADLNoEnd *'; no viable 'begin' function available}
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| is_partitioned.pass.cpp | 32 assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
35 assert(pred.count() <= std::distance(std::begin(ia), std::end(ia)));
40 assert( std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
43 assert(pred.count() <= std::distance(std::begin(ia), std::end(ia)));
48 assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
51 assert(pred.count() <= std::distance(std::begin(ia), std::end(ia)));
56 assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
59 assert(pred.count() <= std::distance(std::begin(ia), std::end(ia)));
64 assert( std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
65 input_iterator<const int*>(std::begin(ia))
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| iter_test.cpp | 50 for (vec::iterator i = v.begin(); i != v.end(); ++i, ++counter) {
114 __iota(v1.begin(), v1.end(), 0);
115 iter_swap( v1.begin(), v1.begin() + 3 );
131 vector<bool>::iterator i1 = boolVector.begin();
132 vector<bool>::iterator i2 = boolVector.begin();
152 iter_swap(vvints.begin(), lvints.begin());
157 //iter_swap(cvvints.begin(), lvints.begin());
[all...] |
| rotate_test.cpp | 51 __iota(v1.begin(), v1.end(), 0);
53 rotate(v1.begin(), v1.begin()+1, v1.end());
65 rotate(v1.begin(), v1.begin()+2, v1.end());
77 rotate(v1.begin(), v1.begin()+7, v1.end());
107 __iota(v1.begin(), v1.end(), 0);
110 rotate_copy(v1.begin(), v1.begin()+1, v1.end(), v2.begin())
[all...] |
| 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...] |
| /ndk/tests/device/test-stlport/unit/ |
| iter_test.cpp | 50 for (vec::iterator i = v.begin(); i != v.end(); ++i, ++counter) {
114 __iota(v1.begin(), v1.end(), 0);
115 iter_swap( v1.begin(), v1.begin() + 3 );
131 vector<bool>::iterator i1 = boolVector.begin();
132 vector<bool>::iterator i2 = boolVector.begin();
152 iter_swap(vvints.begin(), lvints.begin());
157 //iter_swap(cvvints.begin(), lvints.begin());
[all...] |
| rotate_test.cpp | 51 __iota(v1.begin(), v1.end(), 0);
53 rotate(v1.begin(), v1.begin()+1, v1.end());
65 rotate(v1.begin(), v1.begin()+2, v1.end());
77 rotate(v1.begin(), v1.begin()+7, v1.end());
107 __iota(v1.begin(), v1.end(), 0);
110 rotate_copy(v1.begin(), v1.begin()+1, v1.end(), v2.begin())
[all...] |
| 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...] |
| /development/host/windows/usb/api/ |
| AdbWinApi.rc | 41 BEGIN
46 BEGIN
71 BEGIN
73 BEGIN
75 BEGIN
88 BEGIN
101 BEGIN
|
| /development/host/windows/usb/winusb/ |
| AdbWinUsbApi.rc | 41 BEGIN
46 BEGIN
71 BEGIN
73 BEGIN
75 BEGIN
88 BEGIN
101 BEGIN
|
| /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...] |
| /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_)
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.cons/ |
| assign_copy.pass.cpp | 29 C c0(std::begin(t0), std::end(t0), A(10));
30 C c1(std::begin(t1), std::end(t1), A(10));
41 C c0(std::begin(t0), std::end(t0), A(10));
42 C c1(std::begin(t1), std::end(t1), A(11));
53 C c0(std::begin(t0), std::end(t0), A(10));
54 C c1(std::begin(t1), std::end(t1), A(10));
65 C c0(std::begin(t0), std::end(t0), A(10));
66 C c1(std::begin(t1), std::end(t1), A(11));
78 C c0(std::begin(t0), std::end(t0), A(10));
79 C c1(std::begin(t1), std::end(t1), A(10))
[all...] |
| /external/v8/src/base/ |
| iterator.h | 32 iterator_range(ForwardIterator2 const& begin, ForwardIterator2 const& end)
33 : begin_(begin), end_(end) {}
35 iterator begin() { return begin_; } function in class:v8::base::iterator_range
37 const_iterator begin() const { return begin_; } function in class:v8::base::iterator_range
45 reference operator[](difference_type n) { return begin()[n]; }
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.cons/ |
| assign_copy.pass.cpp | 29 C c0(std::begin(t0), std::end(t0), A(10));
30 C c1(std::begin(t1), std::end(t1), A(10));
41 C c0(std::begin(t0), std::end(t0), A(10));
42 C c1(std::begin(t1), std::end(t1), A(11));
53 C c0(std::begin(t0), std::end(t0), A(10));
54 C c1(std::begin(t1), std::end(t1), A(10));
65 C c0(std::begin(t0), std::end(t0), A(10));
66 C c1(std::begin(t1), std::end(t1), A(11));
78 C c0(std::begin(t0), std::end(t0), A(10));
79 C c1(std::begin(t1), std::end(t1), A(10))
[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) {
|
