/external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.ref/ |
p3.cpp | 2 int& r1; // expected-error{{declaration of reference variable 'r1' requires an initializer}} variable
|
/external/v8/test/mjsunit/regress/ |
regress-1472.js | 30 var r1 = /(?:a(?:b(?:c(?:d(?:e(?:f(?:g(?:h(?:i(?:j(?:k(?:l(?:m(?:n(?:o(?:p(?:q(?:r(?:s(?:t(?:u(?:v(?:w(?:x(?:y(?:z(?:FooBar)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)/; variable 31 "xxx".match(r1);
|
/ndk/sources/cxx-stl/llvm-libc++/test/utilities/function.objects/refwrap/refwrap.helpers/ |
cref_2.pass.cpp | 22 std::reference_wrapper<const int> r1 = std::cref(i); local 23 std::reference_wrapper<const int> r2 = std::cref(r1);
|
ref_2.pass.cpp | 22 std::reference_wrapper<int> r1 = std::ref(i); local 23 std::reference_wrapper<int> r2 = std::ref(r1);
|
/external/clang/test/Misc/ |
verify.c | 10 struct s r1; // expected-error-re {{tentative definition has type 'struct s' that is never completed}} variable in typeref:struct:s
|
/ndk/sources/cxx-stl/llvm-libc++/test/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.const/ |
convert.fail.cpp | 27 std::move_iterator<It> r1 = r2; local
|
convert.pass.cpp | 28 std::move_iterator<It> r1 = r2; local 29 assert(r1.base() == u);
|
/ndk/sources/cxx-stl/llvm-libc++/test/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op=/ |
move_iterator.fail.cpp | 28 std::move_iterator<It> r1; local 29 r1 = r2;
|
move_iterator.pass.cpp | 29 std::move_iterator<It> r1; local 30 std::move_iterator<It>& rr = r1 = r2; 31 assert(r1.base() == u); 32 assert(&rr == &r1);
|
/ndk/sources/cxx-stl/llvm-libc++/test/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.cons/ |
reverse_iterator.fail.cpp | 27 std::reverse_iterator<It> r1 = r2; local
|
reverse_iterator.pass.cpp | 28 std::reverse_iterator<It> r1 = r2; local 29 assert(r1.base() == u);
|
/ndk/sources/cxx-stl/llvm-libc++/test/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.op=/ |
reverse_iterator.fail.cpp | 28 std::reverse_iterator<It> r1; local 29 r1 = r2;
|
reverse_iterator.pass.cpp | 29 std::reverse_iterator<It> r1; local 30 std::reverse_iterator<It>& rr = r1 = r2; 31 assert(r1.base() == u); 32 assert(&rr == &r1);
|
/libcore/luni/src/test/java/libcore/java/util/ |
RandomTest.java | 35 MyRandom r1 = new MyRandom(); local 36 r1.nextInt(); 37 assertNotNull(r1.state);
|
/external/stlport/test/unit/ |
reference_wrapper_test.cpp | 37 rr_type r1 = std::tr1::ref(i); local 39 CPPUNIT_CHECK( r1.get() == 1 ); 41 r1 = std::tr1::ref(j); 43 CPPUNIT_CHECK( r1.get() == 2 ); 47 CPPUNIT_CHECK( r1.get() == 2 ); 51 CPPUNIT_CHECK( r1.get() == 4 ); 53 r1.get() = 5; 68 crr_type r1 = std::tr1::cref(i); local 70 CPPUNIT_CHECK( r1.get() == 1 ); 72 r1 = std::tr1::cref(j) [all...] |
includes_test.cpp | 43 bool r1=includes(numbers1, numbers1 + 5, numbers3, numbers3 + 2); local 44 CPPUNIT_ASSERT(!r1); 55 bool r1=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); local 56 CPPUNIT_ASSERT(!r1); 80 bool r1 = includes(v1.begin(), v1.end(), v2.begin(), v2.end(), compare_strings); local 81 CPPUNIT_ASSERT(!r1);
|
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.partitions/ |
partition_copy.pass.cpp | 33 int r1[10] = {0}; local 38 output_iterator<int*>(r1), r2, is_odd()); 39 assert(p.first.base() == r1 + 4); 40 assert(r1[0] == 1); 41 assert(r1[1] == 3); 42 assert(r1[2] == 5); 43 assert(r1[3] == 7);
|
/ndk/tests/device/test-gnustl-full/unit/ |
reference_wrapper_test.cpp | 37 rr_type r1 = std::tr1::ref(i); local 39 CPPUNIT_CHECK( r1.get() == 1 ); 41 r1 = std::tr1::ref(j); 43 CPPUNIT_CHECK( r1.get() == 2 ); 47 CPPUNIT_CHECK( r1.get() == 2 ); 51 CPPUNIT_CHECK( r1.get() == 4 ); 53 r1.get() = 5; 68 crr_type r1 = std::tr1::cref(i); local 70 CPPUNIT_CHECK( r1.get() == 1 ); 72 r1 = std::tr1::cref(j) [all...] |
/ndk/tests/device/test-stlport/unit/ |
reference_wrapper_test.cpp | 37 rr_type r1 = std::tr1::ref(i); local 39 CPPUNIT_CHECK( r1.get() == 1 ); 41 r1 = std::tr1::ref(j); 43 CPPUNIT_CHECK( r1.get() == 2 ); 47 CPPUNIT_CHECK( r1.get() == 2 ); 51 CPPUNIT_CHECK( r1.get() == 4 ); 53 r1.get() = 5; 68 crr_type r1 = std::tr1::cref(i); local 70 CPPUNIT_CHECK( r1.get() == 1 ); 72 r1 = std::tr1::cref(j) [all...] |
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
TestBufferedTreeNodeStream.java | 53 Tree r1 = new CommonTree(new CommonToken(102)); local 54 r0.addChild(r1); 55 r1.addChild(new CommonTree(new CommonToken(103))); 58 r1.addChild(r2);
|
/external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.ref/ |
p6-0x.cpp | 22 typedef LRI& r1; CHECK_EQUAL_TYPES(r1, int&); typedef
|
/external/clang/test/Sema/ |
vector-cast.c | 25 long long r1 = (long long)v1; local
|
/external/eigen/test/ |
product_large.cpp | 57 MatrixXf r1 = mat1.row(2)*mat2.transpose(); local 58 VERIFY_IS_APPROX(r1, (mat1.row(2)*mat2.transpose()).eval());
|
/external/opencv/cv/src/ |
_cvgeom.h | 77 double r1; /* The ratio of the height of triangle to the base of the triangle */ member in struct:_CvTrianAttr
|
/external/skia/tests/ |
SrcOverTest.cpp | 57 unsigned r1 = test_srcover1(dst, i); local 64 REPORTER_ASSERT(reporter, r1 <= 255 && r1 >= max); 68 // this shows where r1 (faster) differs from r2 (more exact) 69 if (r1 != r2) { 70 SkDebugf("--- dst=%d i=%d r1=%d r2=%d exact=%g\n", 71 dst, i, r1, r2, i + dst - dst*i/255.0f);
|