| /external/libcxx/test/containers/sequences/vector/ |
| db_iterators_5.pass.cpp | 10 // <vector>
18 #include <vector>
30 typedef std::vector<T> C;
42 typedef std::vector<T, min_allocator<T>> C;
|
| db_iterators_6.pass.cpp | 10 // <vector>
18 #include <vector>
30 typedef std::vector<T> C;
41 typedef std::vector<T, min_allocator<T>> C;
|
| db_iterators_7.pass.cpp | 10 // <vector>
18 #include <vector>
30 typedef std::vector<T> C;
41 typedef std::vector<T, min_allocator<T>> C;
|
| db_iterators_8.pass.cpp | 10 // <vector>
18 #include <vector>
30 typedef std::vector<T> C;
39 typedef std::vector<T, min_allocator<T>> C;
|
| /external/libcxx/test/containers/sequences/vector/vector.cons/ |
| assign_initializer_list.pass.cpp | 10 // <vector>
14 #include <vector>
23 std::vector<int> d;
33 std::vector<int, min_allocator<int>> d;
|
| /external/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| pop_back.pass.cpp | 10 // <vector>
18 #include <vector>
32 std::vector<int> c;
44 std::vector<int, min_allocator<int>> c;
|
| /external/libcxx/test/containers/sequences/vector.bool/ |
| assign_initializer_list.pass.cpp | 10 // <vector>
14 #include <vector>
23 std::vector<bool> d;
33 std::vector<bool, min_allocator<bool>> d;
|
| /external/libopus/silk/fixed/ |
| solve_LS_FIX.c | 50 inv_D_t *inv_D /* I/O Pointer to vector holding inverted diagonal elements of D */
57 const opus_int32 *b, /* I b Vector */
58 opus_int32 *x_Q16 /* O x Vector */
65 const opus_int32 *b, /* I b Vector */
66 opus_int32 *x_Q16 /* O x Vector */
70 opus_int32 T[], /* I/O Numenator vector */
71 inv_D_t *inv_D, /* I 1 / D vector */
79 const opus_int32 *b, /* I Pointer to b vector */
80 opus_int32 *x_Q16 /* O Pointer to x solution vector */
120 inv_D_t *inv_D /* I/O Pointer to vector holding inverted diagonal elements of D *
[all...] |
| /external/libopus/silk/ |
| interpolate.c | 36 opus_int16 xi[ MAX_LPC_ORDER ], /* O interpolated vector */
37 const opus_int16 x0[ MAX_LPC_ORDER ], /* I first vector */
38 const opus_int16 x1[ MAX_LPC_ORDER ], /* I second vector */
39 const opus_int ifact_Q2, /* I interp. factor, weight on 2nd vector */
|
| /external/llvm/test/Assembler/ |
| getelementptr_vec_idx3.ll | 3 ; Test that vector indices have the same number of elements as the pointer.
|
| getelementptr_vec_struct.ll | 3 ; Test that a vector struct index with non-equal elements is rejected.
|
| /external/llvm/test/CodeGen/AArch64/ |
| regress-bitcast-formals.ll | 3 ; CallingConv.td requires a bitcast for vector arguments. Make sure we're
|
| /external/llvm/test/CodeGen/X86/ |
| vshift_scalar.ll | 3 ; Legalization test that requires scalarizing a vector.
|
| /external/llvm/test/Transforms/GVN/ |
| 2009-03-10-PREOnVoid.ll | 13 %"struct.std::_Rb_tree<void*,std::pair<void* const, std::vector<ShadowInfo, std::allocator<ShadowInfo> > >,std::_Select1st<std::pair<void* const, std::vector<ShadowInfo, std::allocator<ShadowInfo> > > >,std::less<void*>,std::allocator<std::pair<void* const, std::vector<ShadowInfo, std::allocator<ShadowInfo> > > > >" = type { %"struct.std::_Rb_tree<void*,std::pair<void* const, std::vector<ShadowInfo, std::allocator<ShadowInfo> > >,std::_Select1st<std::pair<void* const, std::vector<ShadowInfo, std::allocator<ShadowInfo> > > >,std::less<void*>,std::allocator<std::pair<void* const, std::vector<ShadowInfo, std::allocator<ShadowInfo> > > > >::_Rb_tree_impl<std::less<void*>,false>" }
14 %"struct.std::_Rb_tree<void*,std::pair<void* const, std::vector<ShadowInfo, std::allocator<ShadowInfo> > >,std::_Select1st<std::pair<void* const, std::vector<ShadowInfo, std::allocator<ShadowInfo> > > >,std::less<void*>,std::allocator<std::pair<void* const, std::vector<ShadowInfo, std::allocator<ShadowInfo> > > > >::_Rb_tree_impl<std::less<void*>,false>" = type { %"struct.__gnu_cxx::hash<void*>", %"struct.std::_Rb_tree_node_base", i32 }
15 %"struct.std::_Rb_tree_iterator<std::pair<void* const, std::vector<ShadowInfo, std::allocator<ShadowInfo> > > >" = type { %"struct.std::_Rb_tree_node_base"*
[all...] |
| /external/llvm/test/Transforms/LoopVectorize/XCore/ |
| no-vector-registers.ll | 1 ; RUN: opt < %s -loop-vectorize -force-vector-width=4 -force-vector-unroll=2 -S -mtriple=xcore | FileCheck %s
5 ; The xcore target has no vector registers, so loop should not be vectorized.
8 ;CHECK-NOT: vector.body
|
| /external/qemu/android/base/containers/ |
| StringVector.h | 22 // A StringVector is a vector of strings. This implementation is optimized
23 // to use less memory and be more efficient than std::vector<std::string>
27 // Default constructor. The vector will be empty.
52 // std::vector<> compatibility.
|
| /external/qemu/tcg/ |
| TODO | 14 - Add float and vector support.
|
| /external/regex-re2/re2/ |
| set.h | 9 #include <vector>
14 using std::vector;
40 bool Match(const StringPiece& text, vector<int>* v) const;
45 vector<re2::Regexp*> re_;
|
| /external/stlport/test/unit/ |
| generator_test.cpp | 1 #include <vector>
51 vector <int> v1(10);
72 vector <int> v1(10);
78 vector <int> v1(10);
|
| setinter_test.cpp | 4 #include <vector>
53 vector <int> v1(10);
55 vector <int> v2(10);
58 vector<int> inter;
|
| setunion_test.cpp | 4 #include <vector>
56 vector <int> v1(10);
58 vector <int> v2(10);
61 vector<int> diff;
|
| /external/valgrind/main/memcheck/tests/amd64/ |
| sh-mem-vec128.c | 3 // required vector-copy function, and then including the
|
| /external/valgrind/main/memcheck/tests/x86/ |
| sh-mem-vec128.c | 3 // required vector-copy function, and then including the
|
| /frameworks/av/drm/mediadrm/plugins/clearkey/ |
| SessionLibrary.cpp | 30 using android::Vector;
51 Vector<uint8_t> sessionId;
61 const Vector<uint8_t>& sessionId) {
68 Vector<uint8_t> sessionId;
|
| /frameworks/av/services/camera/libcameraservice/api1/client2/ |
| JpegCompressor.h | 30 #include "utils/Vector.h"
50 // ownership of the Buffers vector.
51 status_t start(Vector<CpuConsumer::LockedBuffer*> buffers,
71 Vector<CpuConsumer::LockedBuffer*> mBuffers;
|
