/external/eigen/test/eigen2/ |
H A D | eigen2_linearstructure.cpp | 31 Scalar s1 = ei_random<Scalar>(); local 32 while (ei_abs(s1)<1e-3) s1 = ei_random<Scalar>(); 41 VERIFY_IS_APPROX(m1*s1, s1*m1); 42 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); 43 VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m [all...] |
/external/eigen/test/ |
H A D | linearstructure.cpp | 30 Scalar s1 = internal::random<Scalar>(); local 31 while (abs(s1)<1e-3) s1 = internal::random<Scalar>(); 40 VERIFY_IS_APPROX(m1*s1, s1*m1); 41 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); 42 VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m [all...] |
H A D | product_syrk.cpp | 33 Scalar s1 = internal::random<Scalar>(); local 38 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), 39 ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); 41 VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpression()), 42 ((s1 * rhs2 * rhs22.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); 46 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), 47 (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); 49 VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpression(), 50 (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); 54 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1) [all...] |
H A D | product_extra.cpp | 37 Scalar s1 = internal::random<Scalar>(), local 44 VERIFY_IS_APPROX(m3.noalias() = (s1 * m1.adjoint()) * m2, (s1 * m1.adjoint()).eval() * m2); 45 VERIFY_IS_APPROX(m3.noalias() = ((s1 * m1).adjoint()) * m2, (numext::conj(s1) * m1.adjoint()).eval() * m2); 46 VERIFY_IS_APPROX(m3.noalias() = (- m1.adjoint() * s1) * (s3 * m2), (- m1.adjoint() * s1).eval() * (s3 * m2).eval()); 47 VERIFY_IS_APPROX(m3.noalias() = (s2 * m1.adjoint() * s1) * m2, (s2 * m1.adjoint() * s1).eval() * m2); 48 VERIFY_IS_APPROX(m3.noalias() = (-m1*s2) * s1*m [all...] |
/external/robolectric/src/test/java/com/xtremelabs/robolectric/shadows/ |
H A D | SpannableStringTest.java | 38 URLSpan s1 = new URLSpan("http://www.foobar.com"); 40 spanStr.setSpan(s1, 12, 33, 0); 43 assertBothSpans(s1, s2); 48 URLSpan s1 = new URLSpan("http://www.foobar.com"); 50 spanStr.setSpan(s1, 12, 33, 0); 52 spanStr.removeSpan(s1); 62 URLSpan s1 = new URLSpan("http://www.foobar.com"); 64 spanStr.setSpan(s1, 1, 10, 0); 70 assertBothSpans(s1, s2); 75 assertThat((URLSpan) spans[0], sameInstance(s1)); 123 assertBothSpans(URLSpan s1, UnderlineSpan s2) argument [all...] |
/external/bluetooth/bluedroid/embdrv/sbc/decoder/include/ |
H A D | oi_string.h | 61 #define OI_MemCmp(s1, s2, n) memcmp((s1), (s2), (n)) 65 #define OI_Strcmp(s1, s2) strcmp((s1), (s2)) 66 #define OI_Strncmp(s1, s2, n) strncmp((s1), (s2), (n)) 102 * 0, if s1 == s2 103 * < 0, if s1 < s2 106 OI_INT OI_MemCmp(void const *s1, void const *s2, OI_UINT32 n); 142 * 0, if s1 [all...] |
/external/chromium_org/base/strings/ |
H A D | string16.cc | 22 int c16memcmp(const char16* s1, const char16* s2, size_t n) { argument 25 if (*s1 != *s2) { 26 // We cannot use (*s1 - *s2) because char16 is unsigned. 27 return ((*s1 < *s2) ? -1 : 1); 29 ++s1; 53 char16* c16memmove(char16* s1, const char16* s2, size_t n) { argument 54 return static_cast<char16*>(memmove(s1, s2, n * sizeof(char16))); 57 char16* c16memcpy(char16* s1, const char16* s2, size_t n) { argument 58 return static_cast<char16*>(memcpy(s1, s2, n * sizeof(char16)));
|
/external/chromium_org/crypto/ |
H A D | secure_util.cc | 9 bool SecureMemEqual(const void* s1, const void* s2, size_t n) { argument 10 const unsigned char* s1_ptr = reinterpret_cast<const unsigned char*>(s1);
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | string-compare-alignment.js | 35 var s1 = base.substring(0, 64); 39 o[s1] = 1;
|
/external/clang/test/CXX/dcl.decl/dcl.init/ |
H A D | p6.cpp | 20 struct s1 { static const s0 foo; }; struct 21 const struct s0 s1::foo; // expected-error{{default initialization of an object of const type 'const struct s0' requires a user-provided default constructor}}
|
/external/clang/test/CodeGen/ |
H A D | no-opt-volatile-memcpy.c | 27 struct s1 { struct 31 struct s1 s; 38 // CHECK: call void @llvm.memcpy.{{.*}}(i8* getelementptr inbounds (%struct.s1* @s, i32 0, i32 0, i32 0, i32 0), i8* getelementptr inbounds (%struct.s1* @s, i32 0, i32 0, i32 0, i32 0), i64 132, i32 4, i1 true) 39 // CHECK-NEXT: call void @llvm.memcpy.{{.*}}(i8* getelementptr inbounds (%struct.s1* @s, i32 0, i32 0, i32 0, i32 0), i8* getelementptr inbounds (%struct.s* @gs, i32 0, i32 0, i32 0), i64 132, i32 4, i1 true)
|
H A D | packed-structure.c | 37 struct s1 { struct 45 int s1_align_x = __alignof(((struct s1*)0)->x); 46 int s1_align_y = __alignof(((struct s1*)0)->y); 47 int s1_align = __alignof(struct s1); 52 int s1_load_x(struct s1 *a) { return a->x; } 56 int s1_load_y(struct s1 *a) { return a->y; } 59 void s1_copy(struct s1 *a, struct s1 *b) { *b = *a; }
|
/external/clang/test/Index/Inputs/ |
H A D | t1.c | 20 struct S1 s1; local 21 s1.x = 0;
|
/external/deqp/framework/delibs/decpp/ |
H A D | deSTLUtil.cpp | 49 set<int> s1; local 50 s1.insert(2); 51 s1.insert(3); 52 DE_TEST_ASSERT(contains(s1, 2)); 53 DE_TEST_ASSERT(contains(s1, 3)); 54 DE_TEST_ASSERT(!contains(s1, 5)); 63 set<int> si = intersection(s1, s2); 68 set<int> su = set_union(s1, s2);
|
/external/libcxx/test/strings/basic.string/string.cons/ |
H A D | pointer_assignment.pass.cpp | 22 test(S s1, const typename S::value_type* s2) argument 25 s1 = s2; 26 assert(s1.__invariants()); 27 assert(s1.size() == T::length(s2)); 28 assert(T::compare(s1.data(), s2, s1.size()) == 0); 29 assert(s1.capacity() >= s1.size());
|
/external/libcxx/test/strings/char.traits/char.traits.specializations/char.traits.specializations.char16_t/ |
H A D | copy.pass.cpp | 14 // static char_type* copy(char_type* s1, const char_type* s2, size_t n); 22 char16_t s1[] = {1, 2, 3}; local 24 assert(std::char_traits<char16_t>::copy(s2, s1, 3) == s2);
|
/external/libcxx/test/strings/char.traits/char.traits.specializations/char.traits.specializations.char32_t/ |
H A D | copy.pass.cpp | 14 // static char_type* copy(char_type* s1, const char_type* s2, size_t n); 22 char32_t s1[] = {1, 2, 3}; local 24 assert(std::char_traits<char32_t>::copy(s2, s1, 3) == s2);
|
/external/libcxx/test/utilities/memory/unique.ptr/unique.ptr.single/unique.ptr.single.modifiers/ |
H A D | swap.pass.cpp | 40 std::unique_ptr<A, Deleter<A> > s1(p1, Deleter<A>(1)); 43 assert(s1.get() == p1); 44 assert(*s1 == A(1)); 45 assert(s1.get_deleter().state() == 1); 49 s1.swap(s2); 50 assert(s1.get() == p2); 51 assert(*s1 == A(2)); 52 assert(s1.get_deleter().state() == 2);
|
/external/libcxx/test/utilities/time/time.duration/time.duration.nonmember/ |
H A D | op_divide_duration.pass.cpp | 35 std::chrono::duration<int, std::ratio<2, 3> > s1(30); 37 assert(s1 / s2 == 6); 40 std::chrono::duration<int, std::ratio<2, 3> > s1(30); 42 assert(s1 / s2 == 20./3); 56 constexpr std::chrono::duration<int, std::ratio<2, 3> > s1(30); 58 static_assert(s1 / s2 == 6, ""); 61 constexpr std::chrono::duration<int, std::ratio<2, 3> > s1(30); 63 static_assert(s1 / s2 == 20./3, "");
|
/external/libutf/ |
H A D | runestrcmp.c | 20 runestrcmp(const Rune *s1, const Rune *s2) argument 25 c1 = *s1++;
|
H A D | runestrncmp.c | 20 runestrncmp(const Rune *s1, const Rune *s2, long n) argument 25 c1 = *s1++;
|
/external/libcxx/test/utilities/memory/unique.ptr/unique.ptr.special/ |
H A D | swap.pass.cpp | 41 std::unique_ptr<A, Deleter<A> > s1(p1, Deleter<A>(1)); 44 assert(s1.get() == p1); 45 assert(*s1 == A(1)); 46 assert(s1.get_deleter().state() == 1); 50 swap(s1, s2); 51 assert(s1.get() == p2); 52 assert(*s1 == A(2)); 53 assert(s1.get_deleter().state() == 2); 62 std::unique_ptr<A[], Deleter<A[]> > s1(p1, Deleter<A[]>(1)); 65 assert(s1 [all...] |
/external/openfst/src/include/fst/ |
H A D | equal.h | 48 StateId s1 = siter1.Value(); local 50 if (s1 != s2) { 52 << ", state1 = " << s1 56 Weight final1 = fst1.Final(s1); 60 << " state = " << s1 65 ArcIterator< Fst<Arc> > aiter1(fst1, s1); 70 << " state = " << s1; 77 << " state = " << s1 84 << " state = " << s1 91 << " state = " << s1 [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | equal.h | 45 StateId s1 = siter1.Value(); local 47 if (s1 != s2) { 49 << ", state1 = " << s1 53 Weight final1 = fst1.Final(s1); 57 << " state = " << s1 62 ArcIterator< Fst<Arc> > aiter1(fst1, s1); 67 << " state = " << s1; 74 << " state = " << s1 81 << " state = " << s1 88 << " state = " << s1 [all...] |
/external/chromium_org/third_party/libphonenumber/src/phonenumbers/utf/ |
H A D | utf.h | 141 // s2 as a UTF substring of s1, or 0 if there is none. If s2 is the 142 // null string, utfutf returns s1. (cf. strstr) 144 const char* utfutf(const char* s1, const char* s2); 149 // s1 is terminated by a null sequence, and a pointer to that sequence 150 // is returned. Otherwise, the original s1 is returned. (cf. strecpy) 152 char* utfecpy(char *s1, char *es1, const char *s2); 167 Rune* runestrcat(Rune* s1, const Rune* s2); 168 Rune* runestrncat(Rune* s1, const Rune* s2, long n); 172 int runestrcmp(const Rune* s1, const Rune* s2); 173 int runestrncmp(const Rune* s1, cons [all...] |