| /external/clang/test/Lexer/ |
| ms-compatibility.c | 7 void *v2 = F; variable
9 // CHECK-MS-COMPAT: void *v2 = L "aaa";
11 // CHECK-NO-MS-COMPAT: void *v2 = L "aaa";
|
| /external/clang/test/Modules/Inputs/ |
| linkage-merge-sub.h | 8 static int v2; variable
|
| /external/clang/test/Parser/ |
| pragma-visibility2.c | 13 int v2; variable
14 // CHECK: @v2 = common global i32 0, align 4
|
| /external/libcxx/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/ |
| shift_left.pass.cpp | 24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
25 v1[std::slice(1, 5, 3)] <<= v2; local
|
| shift_right.pass.cpp | 24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
25 v1[std::slice(1, 5, 3)] >>= v2; local
|
| /external/libcxx/test/std/numerics/numarray/template.valarray/valarray.sub/ |
| slice_const.pass.cpp | 23 std::valarray<int> v2 = v1[std::slice(1, 5, 3)]; local
24 assert(v2.size() == 5);
25 assert(v2[0] == 1);
26 assert(v2[1] == 4);
27 assert(v2[2] == 7);
28 assert(v2[3] == 10);
29 assert(v2[4] == 13);
|
| /external/v8/test/mjsunit/regress/ |
| regress-crbug-523213.js | 8 var v2 = []; variable
9 v1.__proto__ = v2;
15 a = v2;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.slice.array/slice.arr.comp.assign/ |
| shift_left.pass.cpp | 24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
25 v1[std::slice(1, 5, 3)] <<= v2; local
|
| shift_right.pass.cpp | 24 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
25 v1[std::slice(1, 5, 3)] >>= v2; local
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.sub/ |
| slice_const.pass.cpp | 23 std::valarray<int> v2 = v1[std::slice(1, 5, 3)]; local
24 assert(v2.size() == 5);
25 assert(v2[0] == 1);
26 assert(v2[1] == 4);
27 assert(v2[2] == 7);
28 assert(v2[3] == 10);
29 assert(v2[4] == 13);
|
| /prebuilts/go/darwin-x86/misc/cgo/testgodefs/ |
| main.go | 9 var v2 = v1.L var
|
| /prebuilts/go/linux-x86/misc/cgo/testgodefs/ |
| main.go | 9 var v2 = v1.L var
|
| /external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| copy.pass.cpp | 36 std::deque<int, test_allocator<int> > v2 = v; local
37 assert(v2 == v);
38 assert(v2.get_allocator() == v.get_allocator());
43 std::deque<int, other_allocator<int> > v2 = v; local
44 assert(v2 == v);
45 assert(v2.get_allocator() == other_allocator<int>(-2));
56 std::deque<int, min_allocator<int> > v2 = v; local
57 assert(v2 == v);
58 assert(v2.get_allocator() == v.get_allocator());
|
| /external/libcxx/test/std/numerics/numarray/template.valarray/valarray.assign/ |
| copy_assign.pass.cpp | 26 std::valarray<T> v2; local
27 v2 = v;
28 assert(v2.size() == v.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == v[i]);
37 std::valarray<T> v2; local
38 v2 = v;
39 assert(v2.size() == v.size());
40 for (int i = 0; i < v2.size(); ++i)
41 assert(v2[i] == v[i])
[all...] |
| initializer_list_assign.pass.cpp | 26 std::valarray<T> v2; local
27 v2 = {1, 2, 3, 4, 5};
28 assert(v2.size() == N);
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a[i]);
36 std::valarray<T> v2; local
37 v2 = {1, 2.5, 3, 4.25, 5};
38 assert(v2.size() == N);
39 for (int i = 0; i < v2.size(); ++i)
40 assert(v2[i] == a[i])
[all...] |
| move_assign.pass.cpp | 27 std::valarray<T> v2; local
28 v2 = std::move(v);
29 assert(v2.size() == N);
31 for (int i = 0; i < v2.size(); ++i)
32 assert(v2[i] == a[i]);
39 std::valarray<T> v2; local
40 v2 = std::move(v);
41 assert(v2.size() == N);
43 for (int i = 0; i < v2.size(); ++i)
44 assert(v2[i] == a[i])
[all...] |
| /external/libcxx/test/std/numerics/numarray/template.valarray/valarray.cons/ |
| copy.pass.cpp | 26 std::valarray<T> v2 = v; local
27 assert(v2.size() == v.size());
28 for (int i = 0; i < v2.size(); ++i)
29 assert(v2[i] == v[i]);
36 std::valarray<T> v2 = v; local
37 assert(v2.size() == v.size());
38 for (int i = 0; i < v2.size(); ++i)
39 assert(v2[i] == v[i]);
46 std::valarray<T> v2 = v; local
47 assert(v2.size() == v.size())
[all...] |
| move.pass.cpp | 28 std::valarray<T> v2 = std::move(v); local
29 assert(v2.size() == N);
31 for (int i = 0; i < v2.size(); ++i)
32 assert(v2[i] == a[i]);
39 std::valarray<T> v2 = std::move(v); local
40 assert(v2.size() == N);
42 for (int i = 0; i < v2.size(); ++i)
43 assert(v2[i] == a[i]);
50 std::valarray<T> v2 = std::move(v); local
51 assert(v2.size() == N)
[all...] |
| /external/libcxx/test/std/numerics/numarray/template.valarray/valarray.unary/ |
| bit_not.pass.cpp | 26 std::valarray<T> v2 = ~v; local
27 assert(v2.size() == v.size());
28 for (int i = 0; i < v2.size(); ++i)
29 assert(v2[i] == ~v[i]);
36 std::valarray<T> v2 = ~v; local
37 assert(v2.size() == v.size());
40 assert(v2[i].size() == v[i].size());
42 assert(v2[i][j] == ~v[i][j]);
50 std::valarray<T> v2 = ~(v + v); local
51 assert(v2.size() == v.size())
[all...] |
| negate.pass.cpp | 26 std::valarray<T> v2 = -v; local
27 assert(v2.size() == v.size());
28 for (int i = 0; i < v2.size(); ++i)
29 assert(v2[i] == -v[i]);
36 std::valarray<T> v2 = -v; local
37 assert(v2.size() == v.size());
38 for (int i = 0; i < v2.size(); ++i)
39 assert(v2[i] == -v[i]);
46 std::valarray<T> v2 = -v; local
47 assert(v2.size() == v.size())
60 std::valarray<T> v2 = -(v + v); local
[all...] |
| not.pass.cpp | 26 std::valarray<bool> v2 = !v; local
27 assert(v2.size() == v.size());
28 for (int i = 0; i < v2.size(); ++i)
29 assert(v2[i] == !v[i]);
36 std::valarray<bool> v2 = !(v + v); local
37 assert(v2.size() == v.size());
38 for (int i = 0; i < v2.size(); ++i)
39 assert(v2[i] == !2*v[i]);
|
| plus.pass.cpp | 26 std::valarray<T> v2 = +v; local
27 assert(v2.size() == v.size());
28 for (int i = 0; i < v2.size(); ++i)
29 assert(v2[i] == +v[i]);
36 std::valarray<T> v2 = +v; local
37 assert(v2.size() == v.size());
38 for (int i = 0; i < v2.size(); ++i)
39 assert(v2[i] == +v[i]);
46 std::valarray<T> v2 = +v; local
47 assert(v2.size() == v.size())
60 std::valarray<T> v2 = +(v + v); local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| copy.pass.cpp | 36 std::deque<int, test_allocator<int> > v2 = v; local
37 assert(v2 == v);
38 assert(v2.get_allocator() == v.get_allocator());
43 std::deque<int, other_allocator<int> > v2 = v; local
44 assert(v2 == v);
45 assert(v2.get_allocator() == other_allocator<int>(-2));
56 std::deque<int, min_allocator<int> > v2 = v; local
57 assert(v2 == v);
58 assert(v2.get_allocator() == v.get_allocator());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.assign/ |
| copy_assign.pass.cpp | 26 std::valarray<T> v2; local
27 v2 = v;
28 assert(v2.size() == v.size());
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == v[i]);
37 std::valarray<T> v2; local
38 v2 = v;
39 assert(v2.size() == v.size());
40 for (int i = 0; i < v2.size(); ++i)
41 assert(v2[i] == v[i])
[all...] |
| initializer_list_assign.pass.cpp | 26 std::valarray<T> v2; local
27 v2 = {1, 2, 3, 4, 5};
28 assert(v2.size() == N);
29 for (int i = 0; i < v2.size(); ++i)
30 assert(v2[i] == a[i]);
36 std::valarray<T> v2; local
37 v2 = {1, 2.5, 3, 4.25, 5};
38 assert(v2.size() == N);
39 for (int i = 0; i < v2.size(); ++i)
40 assert(v2[i] == a[i])
[all...] |
