HomeSort by relevance Sort by last modified time
    Searched defs:n1 (Results 1 - 25 of 446) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/clang/test/SemaCXX/
pr18284-crash-on-invalid.cpp 4 namespace n1 { namespace
13 } // namespace n1
  /external/libutf/
utfutf.c 29 long f, n1, n2; local
32 n1 = chartorune(&r, s2);
38 for(p=s1; (p=utfrune(p, f)) != 0; p+=n1)
  /libcore/ojluni/src/main/java/sun/misc/
ASCIICaseInsensitiveComparator.java 41 int n1=s1.length(), n2=s2.length(); local
42 int minLen = n1 < n2 ? n1 : n2;
55 return n1 - n2;
  /ndk/tests/device/test-gnustl-full/unit/
lexcmp_test.cpp 34 char n1[size] = "shoe"; local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
43 char n1[size] = "shoe"; local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
mismatch_test.cpp 40 int n1[5] = { 1, 2, 3, 4, 5 }; local
44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2);
45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3);
48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5)));
49 CPPUNIT_ASSERT((result.first - n1)==3);
70 char const* n1[size] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local
73 copy(n1, n1 + 5, (char const**)n2)
    [all...]
  /ndk/tests/device/test-stlport/unit/
lexcmp_test.cpp 34 char n1[size] = "shoe"; local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
43 char n1[size] = "shoe"; local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
mismatch_test.cpp 40 int n1[5] = { 1, 2, 3, 4, 5 }; local
44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2);
45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3);
48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5)));
49 CPPUNIT_ASSERT((result.first - n1)==3);
70 char const* n1[size] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local
73 copy(n1, n1 + 5, (char const**)n2)
    [all...]
  /external/clang/test/Sema/
attr-section.c 13 __attribute__((section("NEAR,x"))) int n1; // expected-error {{'section' attribute only applies to functions and global variables}} local
  /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/
splice_after_flist.pass.cpp 31 int n1 = 0; local
32 for (; n1 < p; ++n1, ++i)
33 assert(*i == t1[n1]);
36 for (; n1 < size_t1; ++n1, ++i)
37 assert(*i == t1[n1]);
splice_after_one.pass.cpp 32 int n1 = 0; local
33 for (; n1 < p; ++n1, ++i)
34 assert(*i == t1[n1]);
37 for (; n1 < size_t1; ++n1, ++i)
38 assert(*i == t1[n1]);
splice_after_range.pass.cpp 32 int n1 = 0; local
33 for (; n1 < p; ++n1, ++i)
34 assert(*i == t1[n1]);
37 for (; n1 < size_t1; ++n1, ++i)
38 assert(*i == t1[n1]);
  /external/v8/test/mjsunit/compiler/
osr-infinite.js 25 function n1() { function
72 test(n1);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/
splice_after_flist.pass.cpp 31 int n1 = 0; local
32 for (; n1 < p; ++n1, ++i)
33 assert(*i == t1[n1]);
36 for (; n1 < size_t1; ++n1, ++i)
37 assert(*i == t1[n1]);
splice_after_one.pass.cpp 31 int n1 = 0; local
32 for (; n1 < p; ++n1, ++i)
33 assert(*i == t1[n1]);
36 for (; n1 < size_t1; ++n1, ++i)
37 assert(*i == t1[n1]);
splice_after_range.pass.cpp 32 int n1 = 0; local
33 for (; n1 < p; ++n1, ++i)
34 assert(*i == t1[n1]);
37 for (; n1 < size_t1; ++n1, ++i)
38 assert(*i == t1[n1]);
  /external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/
p5.cpp 3 alignas(1) int n1; // expected-error {{requested alignment is less than minimum alignment of 4 for type 'int'}} variable
  /external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
p3-0x.cpp 43 int n1 = f(i); member in namespace:std_example
  /external/eigen/test/
product_large.cpp 48 std::ptrdiff_t n1 = internal::random<int>(10,100)*16; local
50 internal::computeProductBlockingSizes<float,float>(k1,m1,n1);
  /external/libcxx/test/std/input.output/iostream.format/output.streams/ostream.formatted/ostream.inserters.arithmetic/
pointer.pass.cpp 64 int n1; local
65 os1 << &n1; local
  /external/toybox/toys/other/
xxd.c 98 int n1, n2; local
101 if ((n1 = n2 = dehex(fgetc(fp))) < 0 || (n2 = dehex(fgetc(fp))) < 0) {
103 if (n1 == -2 || n2 == -2) continue;
108 fputc((n1 << 4) | (n2 & 0xf), stdout);
  /external/v8/test/mjsunit/
object-toprimitive.js 34 var n1 = Number(o1); variable
36 assertTrue(typeof n1 == "number");
  /libcore/jsr166-tests/src/test/java/jsr166/
SystemTest.java 40 long n1 = System.nanoTime(); local
46 long nanos = n2 - n1;
58 long n1 = System.nanoTime(); local
66 long nanos = n2 - n1;
  /ndk/sources/host-tools/toolbox/
cmp_win.c 70 int n1, n2, ret = 0; local
72 n1 = fread(buf1, 1, BUFSIZE, f1);
74 ret = (n1 != n2) || memcmp(buf1, buf2, n1) != 0;
75 } while (!ret && n1 == BUFSIZE);
  /prebuilts/go/darwin-x86/test/
const5.go 24 n1 = len(b.a)
23 n1 = len(b.a) const
  /prebuilts/go/darwin-x86/test/ken/
divmod.go 13 n1 = +5
31 if n1/d1 != q1 || n1%d1 != r1 {
32 println("ideal-1", n1, d1, n1/d1, n1%d1)
39 if n1/d2 != q3 || n1%d2 != r3 {
40 println("ideal-3", n1, d2, n1/d2, n1%d2
11 n1 = +5 const
    [all...]

Completed in 2226 milliseconds

1 2 3 4 5 6 7 8 91011>>