| /external/eigen/Eigen/src/Geometry/ |
| EulerAngles.h | 72 // c2 s1.s2 c1.s2 1 0 0
73 // 0 c1 -s1 * M = 0 c3 s3
74 // -s2 s1.c2 c1.c2 0 -s3 c3
76 // Thus: m11.c1 - m21.s1 = c3 & m12.c1 - m22.s1 = s3
79 Scalar c1 = cos(res[0]); local
80 res[2] = atan2(c1*coeff(j,k)-s1*coeff(k,k), c1*coeff(j,j) - s1 * coeff(k,j));
93 Scalar c1 = cos(res[0]); local
94 res[2] = atan2(s1*coeff(k,i)-c1*coeff(j,i), c1*coeff(j,j) - s1 * coeff(k,j))
[all...] |
| /external/fio/crc/ |
| murmur3.c | 23 uint32_t len, const uint32_t c1,
36 k1 *= c1;
50 const uint32_t c1 = 0xcc9e2d51; local
58 k1 *= c1;
67 return murmur3_tail(data, nblocks, len, c1, c2, h1);
|
| /external/fio/lib/ |
| bswap.h | 9 uint32_t c1, c2, c3, c4; local
11 c1 = (val >> 24) & 0xff;
16 return c1 | c2 << 8 | c3 << 16 | c4 << 24;
21 uint64_t c1, c2, c3, c4, c5, c6, c7, c8; local
23 c1 = (val >> 56) & 0xff;
32 return c1 | c2 << 8 | c3 << 16 | c4 << 24 | c5 << 32 | c6 << 40 | c7 << 48 | c8 << 56;
|
| /external/libcxx/test/std/containers/associative/map/map.special/ |
| swap_noexcept.pass.cpp | 99 C c1, c2; local
100 static_assert(noexcept(swap(c1, c2)), "");
104 C c1, c2; local
105 static_assert(noexcept(swap(c1, c2)), "");
109 C c1, c2; local
110 static_assert(noexcept(swap(c1, c2)), "");
114 C c1, c2; local
115 static_assert(!noexcept(swap(c1, c2)), "");
121 C c1, c2; local
122 static_assert(!noexcept(swap(c1, c2)), "")
126 C c1, c2; local
131 C c1, c2; local
136 C c1, c2; local
142 C c1, c2; local
[all...] |
| /external/libcxx/test/std/containers/associative/multimap/multimap.special/ |
| swap_noexcept.pass.cpp | 99 C c1, c2; local
100 static_assert(noexcept(swap(c1, c2)), "");
104 C c1, c2; local
105 static_assert(noexcept(swap(c1, c2)), "");
109 C c1, c2; local
110 static_assert(noexcept(swap(c1, c2)), "");
114 C c1, c2; local
115 static_assert(!noexcept(swap(c1, c2)), "");
121 C c1, c2; local
122 static_assert(!noexcept(swap(c1, c2)), "")
126 C c1, c2; local
131 C c1, c2; local
136 C c1, c2; local
142 C c1, c2; local
[all...] |
| /external/libcxx/test/std/containers/associative/multiset/multiset.special/ |
| swap_noexcept.pass.cpp | 99 C c1, c2; local
100 static_assert(noexcept(swap(c1, c2)), "");
104 C c1, c2; local
105 static_assert(noexcept(swap(c1, c2)), "");
109 C c1, c2; local
110 static_assert(noexcept(swap(c1, c2)), "");
114 C c1, c2; local
115 static_assert(!noexcept(swap(c1, c2)), "");
121 C c1, c2; local
122 static_assert(!noexcept(swap(c1, c2)), "")
126 C c1, c2; local
131 C c1, c2; local
136 C c1, c2; local
142 C c1, c2; local
[all...] |
| /external/libcxx/test/std/containers/associative/set/set.special/ |
| swap_noexcept.pass.cpp | 99 C c1, c2; local
100 static_assert(noexcept(swap(c1, c2)), "");
104 C c1, c2; local
105 static_assert(noexcept(swap(c1, c2)), "");
109 C c1, c2; local
110 static_assert(noexcept(swap(c1, c2)), "");
114 C c1, c2; local
115 static_assert(!noexcept(swap(c1, c2)), "");
121 C c1, c2; local
122 static_assert(!noexcept(swap(c1, c2)), "")
126 C c1, c2; local
131 C c1, c2; local
136 C c1, c2; local
142 C c1, c2; local
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
| resize_size.pass.cpp | 44 test(C& c1, int size)
47 typename C::size_type c1_osize = c1.size();
48 c1.resize(size);
49 assert(c1.size() == size);
50 assert(distance(c1.begin(), c1.end()) == c1.size());
51 CI i = c1.begin();
52 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
54 for (int j = c1_osize; j < c1.size(); ++j, ++i
62 C c1 = make<C>(N, start); local
[all...] |
| resize_size_value.pass.cpp | 44 test(C& c1, int size, int x)
47 typename C::size_type c1_osize = c1.size();
48 c1.resize(size, x);
49 assert(c1.size() == size);
50 assert(distance(c1.begin(), c1.end()) == c1.size());
51 CI i = c1.begin();
52 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
54 for (int j = c1_osize; j < c1.size(); ++j, ++i
62 C c1 = make<C>(N, start); local
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| assign_iter_iter.pass.cpp | 46 test(C& c1, const C& c2)
48 c1.assign(c2.begin(), c2.end());
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 assert(c1 == c2);
57 C c1 = make<C>(N, start); local
59 test(c1, c2);
64 testI(C& c1, const C& c2)
68 c1.assign(ICI(c2.begin()), ICI(c2.end()))
77 C c1 = make<C>(N, start); local
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| emplace.pass.cpp | 47 test(int P, C& c1)
50 std::size_t c1_osize = c1.size();
51 CI i = c1.emplace(c1.begin() + P, Emplaceable(1, 2.5));
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + 1);
54 assert(distance(c1.begin(), c1.end()) == c1.size());
66 C c1 = make<C>(N, start) local
74 C c1 = make<C>(N, start); local
82 C c1 = make<C>(N, start); local
[all...] |
| emplace_back.pass.cpp | 46 test(C& c1)
49 std::size_t c1_osize = c1.size();
50 c1.emplace_back(Emplaceable(1, 2.5));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.end();
61 C c1 = make<C>(N, start); local
62 test(c1);
[all...] |
| emplace_front.pass.cpp | 46 test(C& c1)
49 std::size_t c1_osize = c1.size();
50 c1.emplace_front(Emplaceable(1, 2.5));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.begin();
61 C c1 = make<C>(N, start); local
62 test(c1);
[all...] |
| erase_iter_iter.pass.cpp | 45 test(int P, C& c1, int size)
48 assert(P + size <= c1.size());
49 std::size_t c1_osize = c1.size();
50 I i = c1.erase(c1.cbegin() + P, c1.cbegin() + (P + size));
51 assert(i == c1.begin() + P);
52 assert(c1.size() == c1_osize - size);
53 assert(distance(c1.begin(), c1.end()) == c1.size())
72 C c1 = make<C>(N, start); local
[all...] |
| insert_rvalue.pass.cpp | 47 test(int P, C& c1, int x)
50 std::size_t c1_osize = c1.size();
51 CI i = c1.insert(c1.begin() + P, MoveOnly(x));
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + 1);
54 assert(distance(c1.begin(), c1.end()) == c1.size());
55 i = c1.begin()
72 C c1 = make<C>(N, start); local
80 C c1 = make<C>(N, start); local
88 C c1 = make<C>(N, start); local
[all...] |
| insert_size_value.pass.cpp | 46 test(int P, C& c1, int size, int x)
49 std::size_t c1_osize = c1.size();
50 CI i = c1.insert(c1.begin() + P, size, x);
51 assert(i == c1.begin() + P);
52 assert(c1.size() == c1_osize + size);
53 assert(distance(c1.begin(), c1.end()) == c1.size());
54 i = c1.begin()
71 C c1 = make<C>(N, start); local
79 C c1 = make<C>(N, start); local
87 C c1 = make<C>(N, start); local
95 C c1 = make<C>(N, start); local
103 C c1 = make<C>(N, start); local
[all...] |
| insert_value.pass.cpp | 44 test(int P, C& c1, int x)
47 std::size_t c1_osize = c1.size();
48 CI i = c1.insert(c1.begin() + P, x);
49 assert(i == c1.begin() + P);
50 assert(c1.size() == c1_osize + 1);
51 assert(distance(c1.begin(), c1.end()) == c1.size());
52 i = c1.begin()
69 C c1 = make<C>(N, start); local
77 C c1 = make<C>(N, start); local
85 C c1 = make<C>(N, start); local
[all...] |
| pop_back.pass.cpp | 43 test(C& c1)
46 std::size_t c1_osize = c1.size();
47 c1.pop_back();
48 assert(c1.size() == c1_osize - 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
51 for (int j = 0; j < c1.size(); ++j, ++i)
61 C c1 = make<C>(N, start) local
[all...] |
| pop_front.pass.cpp | 43 test(C& c1)
46 std::size_t c1_osize = c1.size();
47 c1.pop_front();
48 assert(c1.size() == c1_osize - 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
51 for (int j = 1; j < c1.size(); ++j, ++i)
61 C c1 = make<C>(N, start) local
[all...] |
| push_front.pass.cpp | 43 test(C& c1, int x)
46 std::size_t c1_osize = c1.size();
47 c1.push_front(x);
48 assert(c1.size() == c1_osize + 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
61 C c1 = make<C>(N, start); local
62 test(c1, -10)
[all...] |
| push_front_rvalue.pass.cpp | 46 test(C& c1, int x)
49 std::size_t c1_osize = c1.size();
50 c1.push_front(MoveOnly(x));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.begin();
64 C c1 = make<C>(N, start); local
65 test(c1, -10)
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.special/ |
| copy.pass.cpp | 54 C c1 = make<C>(N, start); local
56 assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
57 assert(c1 == c2);
58 assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
59 assert(c1 == c2);
60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
61 assert(c1 == c2)
[all...] |
| copy_backward.pass.cpp | 53 C c1 = make<C>(N, start); local
55 assert(std::copy_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
56 assert(c1 == c2);
57 assert(std::copy_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
58 assert(c1 == c2);
59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
60 assert(c1 == c2)
[all...] |
| move.pass.cpp | 53 C c1 = make<C>(N, start); local
55 assert(std::move(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
56 assert(c1 == c2);
57 assert(std::move(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
58 assert(c1 == c2);
59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
60 assert(c1 == c2)
[all...] |
| move_backward.pass.cpp | 53 C c1 = make<C>(N, start); local
55 assert(std::move_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
56 assert(c1 == c2);
57 assert(std::move_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
58 assert(c1 == c2);
59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
60 assert(c1 == c2)
[all...] |
