| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.cons/ |
| construct_default.pass.cpp | 10 // <vector>
12 // vector(const Alloc& = Alloc());
14 #include <vector>
55 test0<std::vector<int> >();
56 test0<std::vector<NotConstructible> >();
57 test1<std::vector<int, test_allocator<int> > >(test_allocator<int>(3));
58 test1<std::vector<NotConstructible, test_allocator<NotConstructible> > >
62 std::vector<int, stack_allocator<int, 10> > v;
67 test0<std::vector<int, min_allocator<int>> >();
68 test0<std::vector<NotConstructible, min_allocator<NotConstructible>> >()
[all...] |
| construct_iter_iter.pass.cpp | 10 // <vector>
12 // template <class InputIter> vector(InputIter first, InputIter last);
14 #include <vector>
38 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an));
39 test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an));
40 test<std::vector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an));
41 test<std::vector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an));
42 test<std::vector<int> >(a, an);
44 test<std::vector<int, stack_allocator<int, 63> > >(input_iterator<const int*>(a), input_iterator<const int*>(an));
45 test<std::vector<int, stack_allocator<int, 18> > >(forward_iterator<const int*>(a), forward_iterator<const int*>(an (…)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| copy.pass.cpp | 10 // <vector>
11 // vector<bool>
13 // vector(const vector& v);
15 #include <vector>
36 test(std::vector<bool>(a, an));
39 std::vector<bool, test_allocator<bool> > v(3, 2, test_allocator<bool>(5));
40 std::vector<bool, test_allocator<bool> > v2 = v;
46 std::vector<bool, other_allocator<bool> > v(3, 2, other_allocator<bool>(5));
47 std::vector<bool, other_allocator<bool> > v2 = v
[all...] |
| move.pass.cpp | 10 // <vector>
12 // vector(vector&& c);
14 #include <vector>
23 std::vector<bool, test_allocator<bool> > l(test_allocator<bool>(5));
24 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5));
30 std::vector<bool, test_allocator<bool> > l2 = std::move(l);
36 std::vector<bool, other_allocator<bool> > l(other_allocator<bool>(5));
37 std::vector<bool, other_allocator<bool> > lo(other_allocator<bool>(5));
43 std::vector<bool, other_allocator<bool> > l2 = std::move(l)
[all...] |
| /external/ceres-solver/internal/ceres/ |
| dense_sparse_matrix_test.cc | 56 Vector x = Vector::Zero(num_cols);
59 Vector y_a = Vector::Zero(num_rows);
60 Vector y_b = Vector::Zero(num_rows);
94 // Try with a not entirely zero vector to verify column interactions, which
96 Vector a(num_cols);
100 Vector b1 = Vector::Zero(num_rows)
[all...] |
| /external/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| erase_iter_iter.pass.cpp | 10 // <vector>
14 #include <vector>
23 std::vector<int> l1(a1, a1+3);
24 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
30 std::vector<int> l1(a1, a1+3);
31 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
35 assert(l1 == std::vector<int>(a1+1, a1+3));
38 std::vector<int> l1(a1, a1+3);
39 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
43 assert(l1 == std::vector<int>(a1+2, a1+3))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| erase_iter_iter.pass.cpp | 10 // <vector>
14 #include <vector>
24 std::vector<int> l1(a1, a1+3);
26 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
33 std::vector<int> l1(a1, a1+3);
35 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
39 assert(l1 == std::vector<int>(a1+1, a1+3));
43 std::vector<int> l1(a1, a1+3);
45 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
49 assert(l1 == std::vector<int>(a1+2, a1+3))
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/guile/ |
| std_vector.i | 4 * SWIG typemaps for std::vector
10 // std::vector
12 // The aim of all that follows would be to integrate std::vector with
18 // -- f(std::vector<T>), f(const std::vector<T>&), f(const std::vector<T>*):
20 // previously wrapped std::vector<T> can be passed.
21 // -- f(std::vector<T>&), f(std::vector<T>*):
22 // the parameter must be modified; therefore, only a wrapped std::vector
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/profile/ |
| vector | 1 // Profiling vector implementation -*- C++ -*-
30 /** @file profile/vector
37 #include <vector>
48 class vector
49 : public _GLIBCXX_STD_C::vector<_Tp, _Allocator>
51 typedef _GLIBCXX_STD_C::vector<_Tp, _Allocator> _Base;
57 typedef __iterator_tracker<typename _Base::iterator, vector>
59 typedef __iterator_tracker<typename _Base::const_iterator, vector>
80 vector(const _Allocator& __a = _Allocator())
89 vector(size_type __n
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/profile/ |
| vector | 1 // Profiling vector implementation -*- C++ -*-
30 /** @file profile/vector
37 #include <vector>
48 class vector
49 : public _GLIBCXX_STD_C::vector<_Tp, _Allocator>
51 typedef _GLIBCXX_STD_C::vector<_Tp, _Allocator> _Base;
57 typedef __iterator_tracker<typename _Base::iterator, vector>
59 typedef __iterator_tracker<typename _Base::const_iterator, vector>
80 vector(const _Allocator& __a = _Allocator())
89 vector(size_type __n
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/profile/ |
| vector | 1 // Profiling vector implementation -*- C++ -*-
30 /** @file profile/vector
37 #include <vector>
48 class vector
49 : public _GLIBCXX_STD_C::vector<_Tp, _Allocator>
51 typedef _GLIBCXX_STD_C::vector<_Tp, _Allocator> _Base;
57 typedef __iterator_tracker<typename _Base::iterator, vector>
59 typedef __iterator_tracker<typename _Base::const_iterator, vector>
80 vector(const _Allocator& __a = _Allocator())
89 vector(size_type __n
[all...] |
| /external/pixman/pixman/ |
| pixman-linear-gradient.c | 57 v.vector[0] = image->common.transform->matrix[0][1];
58 v.vector[1] = image->common.transform->matrix[1][1];
59 v.vector[2] = image->common.transform->matrix[2][2];
63 v.vector[0] = 0;
64 v.vector[1] = pixman_fixed_1;
65 v.vector[2] = pixman_fixed_1;
81 (dx * v.vector[0] + dy * v.vector[1]) /
82 (v.vector[2] * (double) l);
112 v.vector[0] = pixman_int_to_fixed (x) + pixman_fixed_1 / 2
[all...] |
| /cts/apps/CtsVerifier/jni/cameraanalyzer/ |
| com_android_cts_verifier_camera_analyzer_MeteringTest.cpp | 22 #include <vector>
56 std::vector<std::vector< Vec2f > >* checkerCenter =
57 (std::vector<std::vector< Vec2f > >*) (long) checkercenterAddress;
58 std::vector<std::vector< float > >* checkerRadius =
59 (std::vector<std::vector< float > >*) (long) checkerradiusAddress;
82 const std::vector<bool>* nativeComparisonResults
[all...] |
| /external/libcxx/test/containers/sequences/vector/ |
| Android.mk | 17 test_makefile := external/libcxx/test/containers/sequences/vector/Android.mk
19 test_name := containers/sequences/vector/db_iterators_7
23 test_name := containers/sequences/vector/db_front
27 test_name := containers/sequences/vector/db_iterators_5
31 test_name := containers/sequences/vector/db_cback
35 test_name := containers/sequences/vector/db_iterators_3
39 test_name := containers/sequences/vector/version
43 test_name := containers/sequences/vector/iterators
47 test_name := containers/sequences/vector/types
51 test_name := containers/sequences/vector/db_iterators_
[all...] |
| /external/libcxx/test/containers/sequences/vector/vector.cons/ |
| construct_iter_iter.pass.cpp | 10 // <vector>
12 // template <class InputIter> vector(InputIter first, InputIter last);
14 #include <vector>
36 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an));
37 test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an));
38 test<std::vector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an));
39 test<std::vector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an));
40 test<std::vector<int> >(a, an);
42 test<std::vector<int, stack_allocator<int, 63> > >(input_iterator<const int*>(a), input_iterator<const int*>(an));
43 test<std::vector<int, stack_allocator<int, 18> > >(forward_iterator<const int*>(a), forward_iterator<const int*>(an (…)
[all...] |
| /external/chromium_org/chrome/common/media_galleries/ |
| picasa_test_util.h | 9 #include <vector>
20 const std::vector<uint32>& category_vector,
21 const std::vector<double>& date_vector,
22 const std::vector<std::string>& filename_vector,
23 const std::vector<std::string>& name_vector,
24 const std::vector<std::string>& token_vector,
25 const std::vector<std::string>& uid_vector);
|
| /external/chromium_org/components/dom_distiller/core/ |
| dom_distiller_test_util.h | 8 #include <vector>
23 const std::vector<DomDistillerObserver::ArticleUpdate>&> {
26 const std::vector<DomDistillerObserver::ArticleUpdate>&);
30 const std::vector<DomDistillerObserver::ArticleUpdate>& actual_updates,
37 const std::vector<DomDistillerObserver::ArticleUpdate>& expected_updates_;
40 testing::Matcher<const std::vector<DomDistillerObserver::ArticleUpdate>&>
41 HasExpectedUpdates(const std::vector<DomDistillerObserver::ArticleUpdate>&);
|
| /external/chromium_org/net/quic/test_tools/ |
| simple_quic_framer.cc | 14 using std::vector;
135 const vector<QuicAckFrame>& ack_frames() const { return ack_frames_; }
136 const vector<QuicConnectionCloseFrame>& connection_close_frames() const {
139 const vector<QuicCongestionFeedbackFrame>& feedback_frames() const {
142 const vector<QuicGoAwayFrame>& goaway_frames() const {
145 const vector<QuicRstStreamFrame>& rst_stream_frames() const {
148 const vector<QuicStreamFrame>& stream_frames() const {
151 const vector<QuicStopWaitingFrame>& stop_waiting_frames() const {
154 const vector<QuicPingFrame>& ping_frames() const {
175 vector<QuicAckFrame> ack_frames_
[all...] |
| /external/chromium_org/third_party/ots/src/ |
| cmap.h | 8 #include <vector>
34 std::vector<OpenTypeCMAPSubtableVSRange> ranges;
35 std::vector<OpenTypeCMAPSubtableVSMapping> mappings;
55 std::vector<OpenTypeCMAPSubtableVSRecord> subtable_0_5_14;
65 std::vector<OpenTypeCMAPSubtableRange> subtable_3_10_12;
67 std::vector<OpenTypeCMAPSubtableRange> subtable_3_10_13;
69 std::vector<uint8_t> subtable_1_0_0;
|
| /external/chromium_org/tools/gn/ |
| ninja_build_writer.h | 9 #include <vector>
25 const std::vector<const Settings*>& all_settings,
26 const std::vector<const Target*>& default_toolchain_targets);
30 const std::vector<const Settings*>& all_settings,
31 const std::vector<const Target*>& default_toolchain_targets,
46 std::vector<const Settings*> all_settings_;
47 std::vector<const Target*> default_toolchain_targets_;
|
| ninja_writer.h | 10 #include <vector>
26 // settings for the files written will be added to the vector.
30 std::vector<const Settings*>* all_settings);
37 std::vector<const Settings*>* all_settings,
38 std::vector<const Target*>* default_targets);
39 bool WriteRootBuildfiles(const std::vector<const Settings*>& all_settings,
40 const std::vector<const Target*>& default_targets);
|
| /external/chromium_org/ui/views/window/ |
| window_button_order_provider.h | 8 #include <vector>
26 const std::vector<views::FrameButton>& leading_buttons() const {
30 const std::vector<views::FrameButton>& trailing_buttons() const {
35 const std::vector<views::FrameButton>& leading_buttons,
36 const std::vector<views::FrameButton>& trailing_buttons);
48 std::vector<views::FrameButton> leading_buttons_;
49 std::vector<views::FrameButton> trailing_buttons_;
|
| /external/eigen/bench/btl/data/ |
| action_settings.txt | 3 atv ; "{/*1.5 matrix^T x vector}" ; "matrix size" ; 4:3000
4 axpby ; "{/*1.5 Y = alpha X + beta Y}" ; "vector size" ; 5:1000000
5 axpy ; "{/*1.5 Y += alpha X}" ; "vector size" ; 5:1000000
7 matrix_vector ; "{/*1.5 matrix vector product}" ; "matrix size" ; 4:3000
9 trisolve_vector ; "{/*1.5 triangular solver - vector (X = inv(L) X)}" ; "size" ; 4:3000
16 symv ; "{/*1.5 symmetric matrix vector product}" ; "matrix size" ; 4:3000
19 rot ; "{/*1.5 apply rotation in the plane}" ; "vector size" ; 4:100000
|
| /external/eigen/blas/ |
| level1_impl.h | 20 if(*incx==1 && *incy==1) vector(y,*n) += alpha * vector(x,*n);
21 else if(*incx>0 && *incy>0) vector(y,*n,*incy) += alpha * vector(x,*n,*incx);
22 else if(*incx>0 && *incy<0) vector(y,*n,-*incy).reverse() += alpha * vector(x,*n,*incx);
23 else if(*incx<0 && *incy>0) vector(y,*n,*incy) += alpha * vector(x,*n,-*incx).reverse();
24 else if(*incx<0 && *incy<0) vector(y,*n,-*incy).reverse() += alpha * vector(x,*n,-*incx).reverse()
[all...] |
| /external/stlport/test/unit/ |
| uninitialized_test.cpp | 2 #include <vector>
92 vector<NotTrivialCopyStruct> src(10);
93 vector<NotTrivialCopyStruct> dst(10);
95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end());
129 vector<NotTrivialCopyStruct> src(10);
146 vector<NotTrivialCopyStruct> dst(10);
148 vector<NotTrivialCopyStruct>::iterator it(dst.begin()), end(dst.end());
165 vector<int> src;
171 //Building a vector result in a uninitialized_copy call internally
172 vector<unsigned int> dst(src.begin(), src.end())
[all...] |
