| /external/chromium_org/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);
|
| regress-crbug-178790.js | 31 var r1 = ""; variable
33 r1 += "a?";
35 "test".match(RegExp(r1));
|
| /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/libcxx/test/containers/sequences/vector.bool/ |
| swap.pass.cpp | 57 std::vector<bool>::reference r1 = v[0]; local
59 r1 = true;
61 swap(r1, r2);
89 std::vector<bool, min_allocator<bool>>::reference r1 = v[0]; local
91 r1 = true;
93 swap(r1, r2);
|
| /external/libcxx/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/llvm/unittests/Support/ |
| ProcessTest.cpp | 43 const unsigned r1 = Process::GetRandomNumber(); local
45 // It should be extremely unlikely that both r1 and r2 are 0.
46 EXPECT_NE((r1 | r2), 0u);
|
| /external/chromium_org/components/omnibox/ |
| autocomplete_match_unittest.cc | 12 int r1; member in struct:RelevantCases
30 m1.relevance = cases[i].r1;
|
| /external/clang/test/Misc/ |
| verify.c | 10 struct s r1; // expected-error {{tentative definition has type 'struct s' that is never completed}} variable in typeref:struct:s
|
| /external/libcxx/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);
|
| /external/libcxx/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);
|
| /external/libcxx/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);
|
| /external/libcxx/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);
|
| /external/chromium_org/cc/base/ |
| simple_enclosed_region_unittest.cc | 54 SimpleEnclosedRegion r1; local
55 EXPECT_TRUE(r1.IsEmpty());
56 EXPECT_TRUE(ExpectRegionEq(gfx::Rect(), r1));
|
| /external/chromium_org/third_party/webrtc/common_audio/signal_processing/ |
| vector_scaling_operations_mips.c | 26 int16_t r0 = 0, r1 = 0; local
39 "lh %[r1], 0(%[in2]) \n\t"
41 "madd %[r1], %[in_vector2_scale] \n\t"
48 [in2] "+r" (in2), [r0] "=&r" (r0), [r1] "=&r" (r1)
|
| /external/libcxx/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);
|
| /external/libcxx/test/containers/sequences/array/ |
| at.pass.cpp | 26 C::reference r1 = c.at(0); local
27 assert(r1 == 1);
28 r1 = 5.5;
43 C::const_reference r1 = c.at(0); local
44 assert(r1 == 1);
|
| front_back.pass.cpp | 27 C::reference r1 = c.front(); local
28 assert(r1 == 1);
29 r1 = 5.5;
41 C::const_reference r1 = c.front(); local
42 assert(r1 == 1);
|
| indexing.pass.cpp | 26 C::reference r1 = c[0]; local
27 assert(r1 == 1);
28 r1 = 5.5;
40 C::const_reference r1 = c[0]; local
41 assert(r1 == 1);
|
| /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/chromium_org/third_party/skia/experimental/Intersection/ |
| QuadraticBezierClip.cpp | 70 _Rect r1, r2; local
71 r1.setBounds(q1);
74 if (r1.contains(testPt) && r2.contains(testPt)) {
|
