/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicLineSegments.h | 10 void hodograph(const Cubic& , Quadratic& hodo); 11 void secondHodograph(const Cubic& , _Line& hodo2); 12 double subDivisions(const Cubic& );
|
H A D | TestUtilities.h | 9 bool controls_inside(const Cubic& ); 10 void find_tight_bounds(const Cubic& , _Rect& ); 11 void quad_to_cubic(const Quadratic& , Cubic& );
|
H A D | 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[];
|
H A D | 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); 24 bool controls_contained_by_ends(const Cubic& c); 27 void demote_cubic_to_quad(const Cubic& cubic, Quadratic& quad); 28 double dx_at_t(const Cubic& , double t); 29 double dy_at_t(const Cubic [all...] |
H A D | 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); 37 int reduceOrder(const Cubic& cubic, Cubic& reduction, ReduceOrder_Quadratics , 41 int horizontalIntersect(const Cubic [all...] |
H A D | CubicUtilities_Test.cpp | 10 const Cubic tests[] = { 21 const Cubic& cubic = tests[index];
|
H A D | Parameterization_Test.h | 10 bool point_on_parameterized_curve(const Cubic& cubic, const _Point& point);
|
H A D | CubicBezierClip_Test.cpp | 13 const Cubic& cubic1 = tests[index][0]; 14 const Cubic& cubic2 = tests[index][1]; 15 Cubic reduce1, reduce2;
|
H A D | 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[] = {
|
H A D | CubicLineSegments.cpp | 12 void hodograph(const Cubic& cubic, Quadratic& hodo) { 22 void secondHodograph(const Cubic& cubic, _Line& hodo2) { 30 double subDivisions(const Cubic& cubic) {
|
H A D | CubicToQuadratics.cpp | 24 Cubic defined by: P1/2 - anchor points, C1/C2 control points 57 static double calcTDiv(const Cubic& cubic, double precision, double start) { 59 Cubic sub; 60 const Cubic* cPtr; 68 const Cubic& c = *cPtr; 80 void demote_cubic_to_quad(const Cubic& cubic, Quadratic& quad) { 93 int cubic_to_quadratics(const Cubic& cubic, double precision, SkTDArray<Quadratic>& quadratics) { 101 Cubic part; 116 static bool addSimpleTs(const Cubic& cubic, double precision, SkTDArray<double>& ts) { 128 static void addTs(const Cubic [all...] |
H A D | LineCubicIntersection_Test.cpp | 14 Cubic cubic; 26 const Cubic& cubic = lineCubicTests[index].cubic; 28 Cubic reduce1;
|
/external/skia/experimental/Intersection/ |
H A D | CubicLineSegments.h | 10 void hodograph(const Cubic& , Quadratic& hodo); 11 void secondHodograph(const Cubic& , _Line& hodo2); 12 double subDivisions(const Cubic& );
|
H A D | TestUtilities.h | 9 bool controls_inside(const Cubic& ); 10 void find_tight_bounds(const Cubic& , _Rect& ); 11 void quad_to_cubic(const Quadratic& , Cubic& );
|
H A D | 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[];
|
H A D | 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); 24 bool controls_contained_by_ends(const Cubic& c); 27 void demote_cubic_to_quad(const Cubic& cubic, Quadratic& quad); 28 double dx_at_t(const Cubic& , double t); 29 double dy_at_t(const Cubic [all...] |
H A D | 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); 37 int reduceOrder(const Cubic& cubic, Cubic& reduction, ReduceOrder_Quadratics , 41 int horizontalIntersect(const Cubic [all...] |
H A D | CubicUtilities_Test.cpp | 10 const Cubic tests[] = { 21 const Cubic& cubic = tests[index];
|
H A D | Parameterization_Test.h | 10 bool point_on_parameterized_curve(const Cubic& cubic, const _Point& point);
|
H A D | CubicBezierClip_Test.cpp | 13 const Cubic& cubic1 = tests[index][0]; 14 const Cubic& cubic2 = tests[index][1]; 15 Cubic reduce1, reduce2;
|
H A D | 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/ |
H A D | cubic.h | 5 // Cubic algorithm, helper class to TCP cubic. 22 class NET_EXPORT_PRIVATE Cubic { class in namespace:net 24 Cubic(const QuicClock* clock, QuicConnectionStats* stats); 85 DISALLOW_COPY_AND_ASSIGN(Cubic);
|
H A D | cubic.cc | 32 const float kBeta = 0.7f; // Default Cubic backoff factor. 33 // Additional backoff factor when loss occurs in the concave part of the Cubic 53 Cubic::Cubic(const QuicClock* clock, QuicConnectionStats* stats) function in class:net::Cubic 61 void Cubic::Reset() { 73 void Cubic::UpdateCongestionControlStats( 91 QuicTcpCongestionWindow Cubic::CongestionWindowAfterPacketLoss( 105 QuicTcpCongestionWindow Cubic::CongestionWindowAfterAck( 111 // Cubic is "independent" of RTT, the update is limited by the time elapsed.
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkReduceOrder.h | 26 static SkPath::Verb Cubic(const SkPoint pts[4], SkPoint* reducePts);
|
/external/skia/src/pathops/ |
H A D | SkReduceOrder.h | 26 static SkPath::Verb Cubic(const SkPoint pts[4], SkPoint* reducePts);
|