Searched refs:_Line (Results 1 - 25 of 55) sorted by path

123

/external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/lib/
H A Ddojo-1.6.1.js10666 dojo._Line = function(/*int*/ start, /*int*/ end){
10668 // dojo._Line is the object used to generate values from a start value
10678 dojo._Line.prototype.getValue = function(/*float*/ n){
10701 this.curve = new d._Line(this.curve[0], this.curve[1]);
10715 // curve: dojo._Line|Array
10716 // A two element array of start and end values, or a `dojo._Line` instance to be
10722 // across a dojo._Line
11108 // such as the properties of dojo._Line with an additional 'units' property
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DCubicConvexHull.cpp62 const _Line& smallLine = (const _Line&) smallResult;
63 const _Line& largeLine = (const _Line&) largeResult;
H A DCubicIntersection.cpp64 intersect((const _Line&) simple1, (const _Line&) simple2, i);
66 intersect(simple1, (const _Line&) simple2, i);
69 intersect(simple2, (const _Line&) simple1, i);
317 _Line line;
H A DCubicLineSegments.cpp22 void secondHodograph(const Cubic& cubic, _Line& hodo2) {
31 _Line hodo2;
H A DCubicLineSegments.h11 void secondHodograph(const Cubic& , _Line& hodo2);
H A DCubicToQuadratics.cpp88 lineIntersect((const _Line&) cubic[0], (const _Line&) cubic[2], quad[1]);
H A DCubicUtilities.cpp61 _Line startEdge = {c[0], c[0]};
64 _Line endEdge = {c[3], c[3]};
H A DCurveIntersection.h21 bool implicit_matches(const _Line& line1, const _Line& line2);
22 bool implicit_matches_ulps(const _Line& one, const _Line& two, int ulps);
25 void tangent(const _Line& line, _Point& result);
39 int reduceOrder(const _Line& line, _Line& reduction);
46 int horizontalIntersect(const _Line& line, double left, double right,
59 int intersect(const Cubic& cubic, const _Line& line, Intersections& );
60 int intersectRay(const Cubic& quad, const _Line
[all...]
H A DDataTypes.h338 typedef _Point _Line[2]; typedef
383 void setBounds(const _Line& line) {
H A DEdgeWalker.cpp65 const _Line aLine = {{a[0].fX, a[0].fY}, {a[1].fX, a[1].fY}};
66 const _Line bLine = {{b[0].fX, b[0].fY}, {b[1].fX, b[1].fY}};
73 const _Line bLine = {{b[0].fX, b[0].fY}, {b[1].fX, b[1].fY}};
82 const _Line bLine = {{b[0].fX, b[0].fY}, {b[1].fX, b[1].fY}};
106 const _Line aLine = {{a[0].fX, a[0].fY}, {a[1].fX, a[1].fY}};
124 const _Line line = {{a[0].fX, a[0].fY}, {a[1].fX, a[1].fY}};
149 const _Line aLine = {{a[0].fX, a[0].fY}, {a[1].fX, a[1].fY}};
172 const _Line aLine = {{a[0].fX, a[0].fY}, {a[1].fX, a[1].fY}};
173 _Line dst;
267 const _Line aLin
[all...]
H A DLineCubicIntersection.cpp83 LineCubicIntersections(const Cubic& c, const _Line& l, Intersections& i)
255 const _Line& line;
261 LineCubicIntersections c(cubic, *((_Line*) 0), *((Intersections*) 0));
278 LineCubicIntersections c(cubic, *((_Line*) 0), intersections);
284 LineCubicIntersections c(cubic, *((_Line*) 0), intersections);
288 int intersect(const Cubic& cubic, const _Line& line, Intersections& i) {
293 int intersectRay(const Cubic& cubic, const _Line& line, Intersections& i) {
H A DLineCubicIntersection_Test.cpp15 _Line line;
27 const _Line& line = lineCubicTests[index].line;
29 _Line reduce2;
H A DLineIntersection.cpp16 void lineIntersect(const _Line& a, const _Line& b, _Point& p) {
29 static int computePoints(const _Line& a, int used, Intersections& i) {
43 int intersect(const _Line& a, const _Line& b, Intersections& i) {
128 int horizontalIntersect(const _Line& line, double y, double tRange[2]) {
154 int horizontalLineIntersect(const _Line& line, double left, double right,
168 int horizontalIntersect(const _Line& line, double left, double right,
239 static int verticalIntersect(const _Line& line, double x, double tRange[2]) {
257 int verticalIntersect(const _Line
[all...]
H A DLineIntersection.h12 int horizontalIntersect(const _Line& line, double y, double tRange[2]);
13 int horizontalLineIntersect(const _Line& line, double left, double right,
15 void lineIntersect(const _Line& a, const _Line& b, _Point& p);
16 int intersect(const _Line& a, const _Line& b, Intersections&);
17 bool testIntersect(const _Line& a, const _Line& b);
18 int verticalLineIntersect(const _Line& line, double top, double bottom,
H A DLineIntersection_Test.cpp12 const _Line tests[][2] = {
24 const _Line noIntersect[][2] = {
40 const _Line& line1 = tests[index][0];
41 const _Line& line2 = tests[index][1];
64 const _Line& line1 = noIntersect[index][0];
65 const _Line& line2 = noIntersect[index][1];
H A DLineParameterization.cpp13 bool implicit_matches(const _Line& one, const _Line& two) {
37 bool implicit_matches_ulps(const _Line& one, const _Line& two, int ulps) {
60 void tangent(const _Line& line, _Point& result) {
H A DLineParameters.h34 void lineEndPoints(const _Line& pts) {
H A DLineQuadraticIntersection.cpp94 LineQuadraticIntersections(const Quadratic& q, const _Line& l, Intersections& i)
290 const _Line& line;
296 LineQuadraticIntersections q(quad, *((_Line*) 0), *((Intersections*) 0));
311 LineQuadraticIntersections q(quad, *((_Line*) 0), *((Intersections*) 0));
334 LineQuadraticIntersections q(quad, *((_Line*) 0), *((Intersections*) 0));
351 LineQuadraticIntersections q(quad, *((_Line*) 0), intersections);
357 LineQuadraticIntersections q(quad, *((_Line*) 0), intersections);
361 int intersect(const Quadratic& quad, const _Line& line, Intersections& i) {
366 int intersectRay(const Quadratic& quad, const _Line& line, Intersections& i) {
H A DLineQuadraticIntersection_Test.cpp16 _Line line;
32 static int doIntersect(Intersections& intersections, const Quadratic& quad, const _Line& line, bool& flipped) {
60 _Line line;
74 const _Line& line = oneOffs[index].line;
95 const _Line& line = lineQuadTests[index].line;
97 _Line reduce2;
143 static void testLineIntersect(State4& state, const Quadratic& quad, const _Line& line,
204 _Line line = {{x - h, y - v}, {x, y}};
206 _Line line2 = {{x, y}, {x + h, y + v}};
208 _Line line
[all...]
H A DLineUtilities.cpp10 bool implicitLine(const _Line& line, double& slope, double& axisIntercept) {
24 int reduceOrder(const _Line& line, _Line& reduced) {
31 void sub_divide(const _Line& line, double t1, double t2, _Line& dst) {
61 double is_left(const _Line& line, const _Point& pt) {
67 double t_at(const _Line& line, const _Point& pt) {
119 void xy_at_t(const _Line& line, double t, double& x, double& y) {
129 _Point xy_at_t(const _Line& line, double t) {
H A DLineUtilities.h9 bool implicitLine(const _Line& line, double& slope, double& axisIntercept);
10 int reduceOrder(const _Line& line, _Line& reduced);
11 double is_left(const _Line& line, const _Point& pt);
12 void sub_divide(const _Line& src, double t1, double t2, _Line& dst);
13 double t_at(const _Line&, const _Point& );
14 void xy_at_t(const _Line& , double t, double& x, double& y);
15 _Point xy_at_t(const _Line& , double t);
H A DParameterization_Test.h11 bool point_on_parameterized_line(const _Line& line, const _Point& point);
H A DQuadraticImplicit.cpp131 _Line line;
160 _Line line = {hull[2], hull[0]};
161 const _Line* testLines[] = { &line, (const _Line*) &hull[0], (const _Line*) &hull[1] };
305 _Line perp;
H A DQuadraticIntersection.cpp128 _Line line1, line2;
285 _Line ends;
331 _Line ends1;
340 _Line ends2;
H A DQuadraticIntersection_Test.cpp305 left[0] = is_left((const _Line&) q1[0], q2[index]);
306 left[1] = is_left((const _Line&) q1[1], q2[index]);
307 _Line diag = {q1[0], q1[2]};
320 _Line l1 = {q1[i1], q1[(i1 + 1) % 3]};
322 _Line l2 = {q2[i2], q2[(i2 + 1) % 3]};

Completed in 2824 milliseconds

123