Searched refs:v2 (Results 1 - 25 of 1044) sorted by relevance

1234567891011>>

/external/chromium_org/ui/v2/src/
H A Devent.cc5 #include "ui/v2/public/event.h"
7 namespace v2 { namespace
9 } // namespace v2
H A Devent_dispatcher.cc5 #include "ui/v2/public/event_dispatcher.h"
7 namespace v2 { namespace
9 } // namespace v2
H A Devent_processor.cc5 #include "ui/v2/src/event_processor.h"
7 namespace v2 { namespace
9 } // namespace v2
H A Dpaint_processor.cc5 #include "ui/v2/src/paint_processor.h"
7 namespace v2 { namespace
9 } // namespace v2
H A Devent_processor.h8 namespace v2 { namespace
10 } // namespace v2
H A Dpaint_processor.h8 namespace v2 { namespace
10 } // namespace v2
H A Dwindow.cc5 #include "ui/v2/public/window.h"
7 namespace v2 { namespace
18 } // namespace v2
/external/libcxx/test/numerics/numarray/template.valarray/valarray.sub/
H A Dslice_const.pass.cpp23 std::valarray<int> v2 = v1[std::slice(1, 5, 3)]; local
24 assert(v2.size() == 5);
25 assert(v2[0] == 1);
26 assert(v2[1] == 4);
27 assert(v2[2] == 7);
28 assert(v2[3] == 10);
29 assert(v2[4] == 13);
H A Dvalarray_bool_non_const.pass.cpp27 std::valarray<int> v2(5);
28 v2 = v1[vb];
29 assert(v2.size() == 5);
30 assert(v2[ 0] == 0);
31 assert(v2[ 1] == 3);
32 assert(v2[ 2] == 4);
33 assert(v2[ 3] == 7);
34 assert(v2[ 4] == 11);
H A Dvalarray_bool_const.pass.cpp27 std::valarray<int> v2(v1[vb]);
28 assert(v2.size() == 5);
29 assert(v2[ 0] == 0);
30 assert(v2[ 1] == 3);
31 assert(v2[ 2] == 4);
32 assert(v2[ 3] == 7);
33 assert(v2[ 4] == 11);
/external/chromium_org/ui/v2/public/
H A Devent_dispatcher.h8 #include "ui/v2/public/v2_export.h"
10 namespace v2 { namespace
12 } // namespace v2
H A Devent_handler.h8 #include "ui/v2/public/v2_export.h"
10 namespace v2 { namespace
12 } // namespace v2
H A Devent_target.h8 #include "ui/v2/public/v2_export.h"
10 namespace v2 { namespace
12 } // namespace v2
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-347543.js13 var v2 = new Array(10);
15 f(v2);
16 f(v2);
18 f(v2);
H A Dregress-force-representation.js16 var v2 = -0;
17 var t = v2++;
18 v2++;
19 return Math.max(v2++, v1++);
H A Dregress-crbug-352058.js8 var v2 = this;
10 v2 = [1.2, 2.3];
/external/chromium_org/v8/test/webkit/
H A Dsort-non-numbers.js27 test.sort(function (v1, v2) {
28 return v1 - v2;
/external/libcxx/test/numerics/numarray/template.valarray/valarray.assign/
H A Dmask_array_assign.pass.cpp27 std::valarray<int> v2(5);
28 v2 = v1[vb];
29 assert(v2.size() == 5);
30 assert(v2[ 0] == 0);
31 assert(v2[ 1] == 3);
32 assert(v2[ 2] == 4);
33 assert(v2[ 3] == 7);
34 assert(v2[ 4] == 11);
/external/libcxx/test/numerics/numarray/template.valarray/valarray.cons/
H A Dmask_array.pass.cpp27 std::valarray<int> v2(v1[vb]);
28 assert(v2.size() == 5);
29 assert(v2[ 0] == 0);
30 assert(v2[ 1] == 3);
31 assert(v2[ 2] == 4);
32 assert(v2[ 3] == 7);
33 assert(v2[ 4] == 11);
/external/valgrind/main/none/tests/s390x/
H A Dspechelper-clr.c22 int wrong, ok, v1, v2; local
26 v1 = v2 = 42;
29 if (branch(0, v1, v2)) ++wrong; else ++ok;
30 if (branch(1, v1, v2)) ++wrong; else ++ok;
31 if (branch(2, v1, v2)) ++wrong; else ++ok;
32 if (branch(3, v1, v2)) ++wrong; else ++ok;
33 if (branch(4, v1, v2)) ++wrong; else ++ok;
34 if (branch(5, v1, v2)) ++wrong; else ++ok;
35 if (branch(6, v1, v2)) ++wrong; else ++ok;
36 if (branch(7, v1, v2))
55 int wrong, ok, v1, v2; local
88 int wrong, ok, v1, v2; local
[all...]
H A Dspechelper-cr.c22 int wrong, ok, v1, v2; local
26 v1 = v2 = 42;
29 if (branch(0, v1, v2)) ++wrong; else ++ok;
30 if (branch(1, v1, v2)) ++wrong; else ++ok;
31 if (branch(2, v1, v2)) ++wrong; else ++ok;
32 if (branch(3, v1, v2)) ++wrong; else ++ok;
33 if (branch(4, v1, v2)) ++wrong; else ++ok;
34 if (branch(5, v1, v2)) ++wrong; else ++ok;
35 if (branch(6, v1, v2)) ++wrong; else ++ok;
36 if (branch(7, v1, v2))
55 int wrong, ok, v1, v2; local
88 int wrong, ok, v1, v2; local
[all...]
H A Dspechelper-slgr.c28 unsigned long v1, v2; local
33 v1 = v2 = 42;
36 if (branch(0, v1, v2)) ++wrong; else ++ok;
37 if (branch(1, v1, v2)) ++wrong; else ++ok;
38 if (branch(2, v1, v2)) ++ok; else ++wrong;
39 if (branch(3, v1, v2)) ++ok; else ++wrong;
40 if (branch(4, v1, v2)) ++wrong; else ++ok;
41 if (branch(5, v1, v2)) ++wrong; else ++ok;
42 if (branch(6, v1, v2)) ++ok; else ++wrong;
43 if (branch(7, v1, v2))
62 unsigned long v1, v2; local
98 unsigned long v1, v2; local
[all...]
H A Dspechelper-slr.c26 unsigned int v1, v2; local
31 v1 = v2 = 0xffffffff;
34 if (branch(0, v1, v2)) ++wrong; else ++ok;
35 if (branch(1, v1, v2)) ++wrong; else ++ok;
36 if (branch(2, v1, v2)) ++ok; else ++wrong;
37 if (branch(3, v1, v2)) ++ok; else ++wrong;
38 if (branch(4, v1, v2)) ++wrong; else ++ok;
39 if (branch(5, v1, v2)) ++wrong; else ++ok;
40 if (branch(6, v1, v2)) ++ok; else ++wrong;
41 if (branch(7, v1, v2))
60 unsigned int v1, v2; local
96 unsigned int v1, v2; local
[all...]
H A Dspechelper-or.c22 int wrong, ok, v1, v2; local
26 v1 = v2 = 0;
28 if (branch(0, v1, v2)) ++wrong; else ++ok;
29 if (branch(1, v1, v2)) ++wrong; else ++ok;
30 if (branch(2, v1, v2)) ++wrong; else ++ok;
31 if (branch(3, v1, v2)) ++wrong; else ++ok;
32 if (branch(4, v1, v2)) ++wrong; else ++ok;
33 if (branch(5, v1, v2)) ++wrong; else ++ok;
34 if (branch(6, v1, v2)) ++wrong; else ++ok;
35 if (branch(7, v1, v2))
54 int wrong, ok, v1, v2; local
[all...]
/external/stlport/test/unit/
H A Dfib.h6 Fibonacci() : v1(0), v2(1) {}
10 int v2; member in class:Fibonacci
16 int r = v1 + v2;
17 v1 = v2;
18 v2 = r;

Completed in 228 milliseconds

1234567891011>>