Searched defs:p0 (Results 1 - 25 of 248) sorted by relevance

12345678910

/external/eigen/doc/snippets/
H A DMatrixBase_all.cpp2 Vector3f p0 = Vector3f::Random(), p1 = Vector3f::Random().cwiseAbs(); variable
3 // let's check if p0 and p1 are inside the axis aligned box defined by the corners boxMin,boxMax:
4 cout << "Is (" << p0.transpose() << ") inside the box: "
5 << ((boxMin.array()<p0.array()).all() && (boxMax.array()>p0.array()).all()) << endl;
/external/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.discrete/
H A Dctor_iterator.pass.cpp25 double p0[] = {1}; local
26 D d(p0, p0);
33 double p0[] = {10}; local
34 D d(p0, p0+1);
41 double p0[] = {10, 30}; local
42 D d(p0, p0+2);
50 double p0[] local
59 double p0[] = {30, 0, 10}; local
69 double p0[] = {0, 30, 10}; local
79 double p0[] = {0, 0, 10}; local
[all...]
H A Dget_param.pass.cpp25 double p0[] = {.3, .1, .6}; local
26 P p(p0, p0+3);
H A Dmax.pass.cpp24 double p0[] = {.3, .1, .6}; local
25 D d(p0, p0+3);
30 double p0[] = {.3, .1, .6, .2}; local
31 D d(p0, p0+4);
H A Dmin.pass.cpp24 double p0[] = {.3, .1, .6}; local
25 D d(p0, p0+3);
H A Dctor_param.pass.cpp25 double p0[] = {10, 30}; local
26 P pa(p0, p0+2);
H A Deq.pass.cpp33 double p0[] = {1}; local
34 D d1(p0, p0+1);
40 double p0[] = {10, 30}; local
41 D d1(p0, p0+2);
H A Dparam_ctor_iterator.pass.cpp26 double p0[] = {1}; local
27 P pa(p0, p0);
35 double p0[] = {10}; local
36 P pa(p0, p0+1);
44 double p0[] = {10, 30}; local
45 P pa(p0, p0+2);
54 double p0[] local
64 double p0[] = {30, 0, 10}; local
75 double p0[] = {0, 30, 10}; local
86 double p0[] = {0, 0, 10}; local
[all...]
H A Dparam_eq.pass.cpp26 double p0[] = {30, 10}; local
27 param_type p1(p0, p0+2);
28 param_type p2(p0, p0+2);
34 double p0[] = {30, 10}; local
35 param_type p1(p0, p0+2);
H A Dio.pass.cpp33 double p0[] = {.3, .1, .6}; local
34 D d1(p0, p0+3);
H A Deval.pass.cpp44 double p0[] = {.3}; local
45 D d(p0, p0+1);
62 double p0[] = {.75, .25}; local
63 D d(p0, p0+2);
80 double p0[] = {0, 1};
81 D d(p0, p0+2);
98 double p0[]
[all...]
H A Deval_param.pass.cpp29 double p0[] = {.3, .1, .6}; local
30 P p(p0, p0+3);
/external/libcxx/test/thread/futures/futures.promise/
H A Dget_future.pass.cpp42 std::promise<double> p0 = std::move(p); local
/external/libcxx/test/thread/futures/futures.tas/futures.task.members/
H A Dassign_copy.fail.cpp32 std::packaged_task<double(int, char)> p0(A(5));
34 p = p0;
35 assert(!p0.valid());
42 std::packaged_task<double(int, char)> p0; local
44 p = p0;
45 assert(!p0.valid());
H A Dassign_move.pass.cpp32 std::packaged_task<double(int, char)> p0(A(5));
34 p = std::move(p0);
35 assert(!p0.valid());
42 std::packaged_task<double(int, char)> p0; local
44 p = std::move(p0);
45 assert(!p0.valid());
H A Dctor_copy.fail.cpp32 std::packaged_task<double(int, char)> p0(A(5));
33 std::packaged_task<double(int, char)> p(p0);
34 assert(!p0.valid());
41 std::packaged_task<double(int, char)> p0; local
42 std::packaged_task<double(int, char)> p(p0);
43 assert(!p0.valid());
H A Dctor_move.pass.cpp32 std::packaged_task<double(int, char)> p0(A(5));
33 std::packaged_task<double(int, char)> p = std::move(p0);
34 assert(!p0.valid());
41 std::packaged_task<double(int, char)> p0; local
42 std::packaged_task<double(int, char)> p = std::move(p0);
43 assert(!p0.valid());
H A Dswap.pass.cpp32 std::packaged_task<double(int, char)> p0(A(5));
34 p.swap(p0);
35 assert(!p0.valid());
42 std::packaged_task<double(int, char)> p0; local
44 p.swap(p0);
45 assert(!p0.valid());
/external/libcxx/test/thread/futures/futures.tas/futures.task.nonmembers/
H A Dswap.pass.cpp34 std::packaged_task<double(int, char)> p0(A(5));
36 swap(p, p0);
37 assert(!p0.valid());
44 std::packaged_task<double(int, char)> p0; local
46 swap(p, p0);
47 assert(!p0.valid());
/external/chromium_org/sandbox/linux/seccomp-bpf/
H A Dsyscall.h53 Call(int nr, T0 p0, T1 p1, T2 p2, T3 p3, T4 p4, T5 p5, T6 p6, T7 p7) { argument
55 (intptr_t)p0,
73 Call(int nr, T0 p0, T1 p1, T2 p2, T3 p3, T4 p4, T5 p5, T6 p6) { argument
75 (intptr_t)p0,
87 Call(int nr, T0 p0, T1 p1, T2 p2, T3 p3, T4 p4, T5 p5) { argument
89 (intptr_t)p0,
100 static inline intptr_t Call(int nr, T0 p0, T1 p1, T2 p2, T3 p3, T4 p4) { argument
101 return Call(nr, p0, p1, p2, p3, p4, 0, 0, 0);
105 static inline intptr_t Call(int nr, T0 p0, T1 p1, T2 p2, T3 p3) { argument
106 return Call(nr, p0, p
110 Call(int nr, T0 p0, T1 p1, T2 p2) argument
115 Call(int nr, T0 p0, T1 p1) argument
120 Call(int nr, T0 p0) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/core/html/canvas/
H A DCanvasGradient.cpp37 CanvasGradient::CanvasGradient(const FloatPoint& p0, const FloatPoint& p1) argument
38 : m_gradient(Gradient::create(p0, p1))
42 CanvasGradient::CanvasGradient(const FloatPoint& p0, float r0, const FloatPoint& p1, float r1) argument
43 : m_gradient(Gradient::create(p0, r0, p1, r1))
H A DCanvasGradient.h44 static PassRefPtrWillBeRawPtr<CanvasGradient> create(const FloatPoint& p0, const FloatPoint& p1) argument
46 return adoptRefWillBeNoop(new CanvasGradient(p0, p1));
48 static PassRefPtrWillBeRawPtr<CanvasGradient> create(const FloatPoint& p0, float r0, const FloatPoint& p1, float r1) argument
50 return adoptRefWillBeNoop(new CanvasGradient(p0, r0, p1, r1));
60 CanvasGradient(const FloatPoint& p0, const FloatPoint& p1);
61 CanvasGradient(const FloatPoint& p0, float r0, const FloatPoint& p1, float r1);
/external/chromium_org/third_party/skia/samplecode/
H A DSamplePoints.cpp51 SkPaint p0, p1, p2, p3; local
54 p0.setColor(SK_ColorRED);
59 p0.setStrokeWidth(SkIntToScalar(4));
66 canvas->drawPoints(SkCanvas::kPolygon_PointMode, n, pts, p0);
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-branch-combine.cc29 Node* p0 = m.Parameter(0); local
32 m.Branch(m.Word32Equal(p0, m.Int32Constant(0)), &blocka, &blockb);
53 Node* p0 = m.Parameter(0); local
55 Node* cond = p0;
80 Node* p0 = m.Parameter(0); local
83 m.Branch(m.Int32LessThan(p0, m.Int32Constant(0)), &blocka, &blockb);
102 Node* p0 = m.Parameter(0);
105 m.Branch(m.Uint32LessThan(p0, m.Int32Constant(100)), &blocka, &blockb);
124 Node* p0 = m.Parameter(0);
127 m.Branch(m.Uint32LessThanOrEqual(p0,
[all...]
/external/eigen/test/eigen2/
H A Deigen2_alignedbox.cpp26 VectorType p0 = VectorType::Random(dim); local
34 b0.extend(p0);
36 VERIFY(b0.contains(p0*s1+(Scalar(1)-s1)*p1));
37 VERIFY(!b0.contains(p0 + (1+s1)*(p1-p0)));

Completed in 3262 milliseconds

12345678910