| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| CubicLineSegments.h | 10 void hodograph(const Cubic& , Quadratic& hodo);
11 void secondHodograph(const Cubic& , _Line& hodo2);
12 double subDivisions(const Cubic& );
|
| TestUtilities.h | 9 bool controls_inside(const Cubic& );
10 void find_tight_bounds(const Cubic& , _Rect& );
11 void quad_to_cubic(const Quadratic& , Cubic& );
|
| CubicIntersection_TestData.h | 10 extern const Cubic pointDegenerates[];
11 extern const Cubic notPointDegenerates[];
12 extern const Cubic tests[][2];
13 extern Cubic hexTests[][2];
17 extern const Cubic lines[];
18 extern const Cubic notLines[];
19 extern const Cubic modEpsilonLines[];
20 extern const Cubic lessEpsilonLines[];
21 extern const Cubic negEpsilonLines[];
|
| CubicUtilities.h | 13 double calcPrecision(const Cubic& cubic);
15 double calcPrecision(const Cubic& cubic, double t, double scale);
17 void chop_at(const Cubic& src, CubicPair& dst, double t);
18 bool clockwise(const Cubic& c);
20 int cubic_to_quadratics(const Cubic& cubic, double precision,
22 void cubic_to_quadratics(const Cubic& cubic, double precision, SkTDArray<double>& ts)
[all...] |
| CurveIntersection.h | 16 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT);
18 int convex_hull(const Cubic& cubic, char order[4]);
19 bool convex_x_hull(const Cubic& cubic, char connectTo0[2], char connectTo3[2]);
20 bool implicit_matches(const Cubic& cubic1, const Cubic& cubic2);
24 void tangent(const Cubic& cubic, double t, _Point& result)
[all...] |
| CubicUtilities_Test.cpp | 10 const Cubic tests[] = {
21 const Cubic& cubic = tests[index]; local
22 bool result = clockwise(cubic);
|
| Parameterization_Test.h | 10 bool point_on_parameterized_curve(const Cubic& cubic, const _Point& point);
|
| CubicBezierClip_Test.cpp | 13 const Cubic& cubic1 = tests[index][0];
14 const Cubic& cubic2 = tests[index][1];
15 Cubic reduce1, reduce2;
|
| CubicIntersection_TestData.cpp | 10 const Cubic pointDegenerates[] = {
21 const Cubic notPointDegenerates[] = {
29 const Cubic tests[][2] = {
88 Cubic hexTests[][2] = {
119 const Cubic lines[] = {
163 const Cubic notLines[] = {
177 const Cubic modEpsilonLines[] = {
223 const Cubic lessEpsilonLines[] = {
269 const Cubic negEpsilonLines[] = {
|
| CubicLineSegments.cpp | 12 void hodograph(const Cubic& cubic, Quadratic& hodo) {
13 hodo[0].x = 3 * (cubic[1].x - cubic[0].x);
14 hodo[0].y = 3 * (cubic[1].y - cubic[0].y);
15 hodo[1].x = 3 * (cubic[2].x - cubic[1].x);
16 hodo[1].y = 3 * (cubic[2].y - cubic[1].y)
[all...] |
| CubicToQuadratics.cpp | 2 http://stackoverflow.com/questions/2009160/how-do-i-convert-the-2-control-points-of-a-cubic-curve-to-the-single-control-poi
6 Let's call the control points of the cubic Q0..Q3 and the control points of the quadratic P0..P2.
18 If this is a degree-elevated cubic, then both equations will give the same answer for P1. Since
24 Cubic defined by: P1/2 - anchor points, C1/C2 control points
26 mid-point approx of cubic: a quad that shares the same anchors with the cubic and has the
32 Compute the Tdiv as the root of (cubic) equation
34 if Tdiv < 0.5 divide the cubic at Tdiv. First segment [0..Tdiv] can be approximated with by a
37 0.5<=Tdiv<1 - simply divide the cubic in two. The two halves can be approximated by the mid-point
39 Tdiv>=1 - the entire cubic can be approximated by the mid-point approximatio
[all...] |
| LineCubicIntersection_Test.cpp | 14 Cubic cubic; member in struct:lineCubic
26 const Cubic& cubic = lineCubicTests[index].cubic; local
28 Cubic reduce1;
30 int order1 = reduceOrder(cubic, reduce1, kReduceOrder_NoQuadraticsAllowed,
34 printf("[%d] cubic order=%d\n", (int) index, order1);
47 xy_at_t(cubic, tt1, tx1, ty1);
|
| /external/skia/experimental/Intersection/ |
| CubicLineSegments.h | 10 void hodograph(const Cubic& , Quadratic& hodo);
11 void secondHodograph(const Cubic& , _Line& hodo2);
12 double subDivisions(const Cubic& );
|
| TestUtilities.h | 9 bool controls_inside(const Cubic& );
10 void find_tight_bounds(const Cubic& , _Rect& );
11 void quad_to_cubic(const Quadratic& , Cubic& );
|
| CubicIntersection_TestData.h | 10 extern const Cubic pointDegenerates[];
11 extern const Cubic notPointDegenerates[];
12 extern const Cubic tests[][2];
13 extern Cubic hexTests[][2];
17 extern const Cubic lines[];
18 extern const Cubic notLines[];
19 extern const Cubic modEpsilonLines[];
20 extern const Cubic lessEpsilonLines[];
21 extern const Cubic negEpsilonLines[];
|
| CubicUtilities.h | 13 double calcPrecision(const Cubic& cubic);
15 double calcPrecision(const Cubic& cubic, double t, double scale);
17 void chop_at(const Cubic& src, CubicPair& dst, double t);
18 bool clockwise(const Cubic& c);
20 int cubic_to_quadratics(const Cubic& cubic, double precision,
22 void cubic_to_quadratics(const Cubic& cubic, double precision, SkTDArray<double>& ts)
[all...] |
| CurveIntersection.h | 16 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT);
18 int convex_hull(const Cubic& cubic, char order[4]);
19 bool convex_x_hull(const Cubic& cubic, char connectTo0[2], char connectTo3[2]);
20 bool implicit_matches(const Cubic& cubic1, const Cubic& cubic2);
24 void tangent(const Cubic& cubic, double t, _Point& result)
[all...] |
| CubicUtilities_Test.cpp | 10 const Cubic tests[] = {
21 const Cubic& cubic = tests[index]; local
22 bool result = clockwise(cubic);
|
| Parameterization_Test.h | 10 bool point_on_parameterized_curve(const Cubic& cubic, const _Point& point);
|
| CubicBezierClip_Test.cpp | 13 const Cubic& cubic1 = tests[index][0];
14 const Cubic& cubic2 = tests[index][1];
15 Cubic reduce1, reduce2;
|
| CubicIntersection_TestData.cpp | 10 const Cubic pointDegenerates[] = {
21 const Cubic notPointDegenerates[] = {
29 const Cubic tests[][2] = {
88 Cubic hexTests[][2] = {
119 const Cubic lines[] = {
163 const Cubic notLines[] = {
177 const Cubic modEpsilonLines[] = {
223 const Cubic lessEpsilonLines[] = {
269 const Cubic negEpsilonLines[] = {
|
| /external/chromium_org/net/quic/congestion_control/ |
| cubic.h | 5 // Cubic algorithm, helper class to TCP cubic.
22 class NET_EXPORT_PRIVATE Cubic {
24 Cubic(const QuicClock* clock, QuicConnectionStats* stats);
26 // Call after a timeout to reset the cubic state.
37 // follows a cubic function that depends on the time passed since last
73 // Origin point of cubic function.
76 // Time to origin point of cubic function in 2^10 fractions of a second.
79 // Last congestion window in packets computed by cubic function.
85 DISALLOW_COPY_AND_ASSIGN(Cubic);
[all...] |
| cubic.cc | 5 #include "net/quic/congestion_control/cubic.h"
32 const float kBeta = 0.7f; // Default Cubic backoff factor.
33 // Additional backoff factor when loss occurs in the concave part of the Cubic
43 // TCPFriendly alpha is described in Section 3.3 of the CUBIC paper. Note that
44 // kBeta here is a cwnd multiplier, and is equal to 1-beta from the CUBIC paper.
53 Cubic::Cubic(const QuicClock* clock, QuicConnectionStats* stats)
61 void Cubic::Reset() {
73 void Cubic::UpdateCongestionControlStats(
84 // This cwnd increase is due to cubic mode
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkReduceOrder.h | 22 int reduce(const SkDCubic& cubic, Quadratics);
26 static SkPath::Verb Cubic(const SkPoint pts[4], SkPoint* reducePts);
|
| /external/skia/src/pathops/ |
| SkReduceOrder.h | 22 int reduce(const SkDCubic& cubic, Quadratics);
26 static SkPath::Verb Cubic(const SkPoint pts[4], SkPoint* reducePts);
|
