HomeSort by relevance Sort by last modified time
    Searched refs:s2 (Results 101 - 125 of 1922) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/clang/test/SemaCXX/
attr-sentinel.cpp 20 S* s2 = new (1,2,3) S(1, __null); // expected-warning {{missing sentinel in function call}} local
21 s2->a(1,2,3); // expected-warning {{missing sentinel in function call}}
alignof.cpp 16 struct S2 {
17 S2();
25 const int test6 = __alignof__(S2::x);
26 const int test7 = __alignof__(S2::s); // expected-error {{invalid application of 'alignof' to an incomplete type 'S1'}}
29 // 's2.x' should depend on the alignment of both x-within-S2 and
30 // s2-within-S3 and thus require 'S3' to be complete. If we start
34 S2 s2; member in struct:S3
36 static const int test8 = __alignof__(s2.x)
    [all...]
  /external/embunit/inc/
stdImpl.h 46 char* stdimpl_strcpy(char *s1, const char *s2);
50 int stdimpl_strcmp(const char *s1, const char *s2);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/unique.ptr/unique.ptr.runtime/
move01.fail.cpp 35 std::unique_ptr<A> s2; local
36 s2 = s;
move02.fail.cpp 35 std::unique_ptr<A[]> s2; local
36 s2 = s;
move01.pass.cpp 40 std::unique_ptr<A[]> s2(new A[2]);
42 s2 = std::move(s1);
44 assert(s2.get() == p);
52 std::unique_ptr<A[], Deleter<A[]> > s2(new A[5]);
54 s2 = std::move(s1);
55 assert(s2.get() == p);
58 assert(s2.get_deleter().state() == 5);
68 std::unique_ptr<A[], CDeleter<A[]>&> s2(new A[3], d2);
70 s2 = std::move(s1);
72 assert(s2.get() == p)
    [all...]
move03.fail.cpp 49 std::unique_ptr<A, Deleter> s2; local
50 s2 = s;
51 assert(s2.get() == p);
move04.fail.cpp 49 std::unique_ptr<A, Deleter> s2; local
50 s2 = s;
51 assert(s2.get() == p);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/unique.ptr/unique.ptr.single/unique.ptr.single.asgn/
move01.fail.cpp 35 std::unique_ptr<A> s2; local
36 s2 = s;
move02.fail.cpp 35 std::unique_ptr<A> s2; local
36 s2 = s;
move01.pass.cpp 39 std::unique_ptr<A> s2(new A);
41 s2 = std::move(s1);
43 assert(s2.get() == p);
50 std::unique_ptr<A, Deleter<A> > s2(new A);
52 s2 = std::move(s1);
53 assert(s2.get() == p);
56 assert(s2.get_deleter().state() == 5);
65 std::unique_ptr<A, CDeleter<A>&> s2(new A, d2);
66 s2 = std::move(s1);
67 assert(s2.get() == p)
    [all...]
move03.fail.cpp 49 std::unique_ptr<A, Deleter> s2; local
50 s2 = s;
51 assert(s2.get() == p);
move04.fail.cpp 49 std::unique_ptr<A, Deleter> s2; local
50 s2 = s;
51 assert(s2.get() == p);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/unique.ptr/unique.ptr.single/unique.ptr.single.modifiers/
swap.pass.cpp 42 std::unique_ptr<A, Deleter<A> > s2(p2, Deleter<A>(2));
46 assert(s2.get() == p2);
47 assert(*s2 == A(2));
48 assert(s2.get_deleter().state() == 2);
49 s1.swap(s2);
53 assert(s2.get() == p1);
54 assert(*s2 == A(1));
55 assert(s2.get_deleter().state() == 1);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/time/time.duration/time.duration.nonmember/
op_divide_duration.pass.cpp 36 std::chrono::duration<int, std::ratio<3, 5> > s2(5);
37 assert(s1 / s2 == 6);
41 std::chrono::duration<double, std::ratio<3, 5> > s2(5);
42 assert(s1 / s2 == 20./3);
57 constexpr std::chrono::duration<int, std::ratio<3, 5> > s2(5);
58 static_assert(s1 / s2 == 6, "");
62 constexpr std::chrono::duration<double, std::ratio<3, 5> > s2(5);
63 static_assert(s1 / s2 == 20./3, "");
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/unique.ptr/unique.ptr.special/
swap.pass.cpp 43 std::unique_ptr<A, Deleter<A> > s2(p2, Deleter<A>(2));
47 assert(s2.get() == p2);
48 assert(*s2 == A(2));
49 assert(s2.get_deleter().state() == 2);
50 swap(s1, s2);
54 assert(s2.get() == p1);
55 assert(*s2 == A(1));
56 assert(s2.get_deleter().state() == 1);
64 std::unique_ptr<A[], Deleter<A[]> > s2(p2, Deleter<A[]>(2));
67 assert(s2.get() == p2)
    [all...]
  /external/valgrind/main/VEX/test/
test-i386-shift.h 10 #define EXECSHIFT(size, res, s1, s2, flags) \
19 #define EXECSHIFT(size, res, s1, s2, flags) \
29 void exec_opl(int s2, int s0, int s1, int iflags)
34 EXECSHIFT("", res, s1, s2, flags);
42 void exec_opw(int s2, int s0, int s1, int iflags)
47 EXECSHIFT("w", res, s1, s2, flags);
56 #define EXECSHIFT(size, res, s1, s2, flags) \
63 : "c" (s1), "0" (res), "1" (flags), "r" (s2));
65 void exec_opl(int s2, int s0, int s1, int iflags)
70 EXECSHIFT("", res, s1, s2, flags)
    [all...]
  /external/chromium_org/third_party/libjingle/source/talk/base/
stringutils.h 95 inline int strcmp(const wchar_t* s1, const wchar_t* s2) {
96 return wcscmp(s1, s2);
98 inline int stricmp(const wchar_t* s1, const wchar_t* s2) {
99 return _wcsicmp(s1, s2);
101 inline int strncmp(const wchar_t* s1, const wchar_t* s2, size_t n) {
102 return wcsncmp(s1, s2, n);
104 inline int strnicmp(const wchar_t* s1, const wchar_t* s2, size_t n) {
105 return _wcsnicmp(s1, s2, n);
129 inline int _stricmp(const char* s1, const char* s2) {
130 return strcasecmp(s1, s2);
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/
Stats.cs 70 double s2 = 0.0;
72 s2 += (X[i] - xbar) * (X[i] - xbar);
74 s2 = s2 / (m - 1);
75 return Math.Sqrt(s2);
83 double s2 = 0.0;
85 s2 += (X[i] - xbar) * (X[i] - xbar);
87 s2 = s2 / (m - 1);
88 return Math.Sqrt(s2);
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/Misc/
Stats.cs 77 double s2 = 0.0;
80 s2 += ( X[i] - xbar ) * ( X[i] - xbar );
82 s2 = s2 / ( m - 1 );
83 return Math.Sqrt( s2 );
93 double s2 = 0.0;
96 s2 += ( X[i] - xbar ) * ( X[i] - xbar );
98 s2 = s2 / ( m - 1 );
99 return Math.Sqrt( s2 );
    [all...]
  /external/chromium_org/third_party/libphonenumber/src/phonenumbers/utf/
utf.h 141 // s2 as a UTF substring of s1, or 0 if there is none. If s2 is the
144 const char* utfutf(const char* s1, const char* s2);
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, const Rune* s2, long n);
175 Rune* runestrcpy(Rune* s1, const Rune* s2);
176 Rune* runestrncpy(Rune* s1, const Rune* s2, long n)
    [all...]
  /external/clang/test/Sema/
arm-layout.c 21 struct s2 { struct
27 check(s2_size, sizeof(struct s2) == 8);
28 check(s2_offset_0, __builtin_offsetof(struct s2, field0) == 0);
29 check(s2_offset_1, __builtin_offsetof(struct s2, field2) == 7);
31 check(s2_size, sizeof(struct s2) == 6);
32 check(s2_offset_0, __builtin_offsetof(struct s2, field0) == 0);
33 check(s2_offset_1, __builtin_offsetof(struct s2, field2) == 5);
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
statesort.h 54 StateId s1 = siter.Value(), s2; local
63 for (; !done[s1]; s1 = s2, final1 = final2, swap(arcs1, arcs2)) {
64 s2 = order[s1];
65 if (!done[s2]) {
66 final2 = fst->Final(s2);
68 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s2);
73 fst->SetFinal(s2, final1);
74 fst->DeleteArcs(s2);
78 fst->AddArc(s2, arc);
  /external/clang/test/CodeGen/
le32-arguments.c 18 } s2; typedef in typeref:struct:__anon16498
20 // CHECK: define void @f2(%struct.s2* noalias sret %agg.result)
21 s2 f2() {
22 s2 foo;
  /external/arduino/hardware/arduino/cores/arduino/
WString.cpp 110 int String::compareTo( const String &s2 ) const
112 return strcmp( _buffer, s2._buffer );
115 const String & String::concat( const String &s2 )
117 return (*this) += s2;
213 boolean String::endsWith( const String &s2 ) const
215 if ( _length < s2._length )
218 return strcmp( &_buffer[ _length - s2._length], s2._buffer ) == 0;
221 boolean String::equals( const String &s2 ) const
223 return ( _length == s2._length && strcmp( _buffer,s2._buffer ) == 0 )
    [all...]

Completed in 1245 milliseconds

1 2 3 45 6 7 8 91011>>