Searched refs:roots (Results 26 - 50 of 139) sorted by relevance

123456

/external/chromium_org/third_party/skia/src/pathops/
H A DSkDCubicLineIntersection.cpp97 int intersectRay(double roots[3]) { argument
106 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
108 SkDPoint calcPt = c.ptAtT(roots[index]);
116 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots);
129 int roots = intersectRay(rootVals); local
130 for (int index = 0; index < roots; ++index) {
163 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { argument
167 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
169 SkDPoint calcPt = c.ptAtT(roots[index]);
173 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots);
185 double roots[3]; local
203 VerticalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) argument
225 double roots[3]; local
[all...]
H A DSkDQuadLineIntersection.cpp108 int intersectRay(double roots[2]) { argument
110 solve by rotating line+quad so line is horizontal, then finding the roots
135 return SkDQuad::RootsValidT(A, 2 * B, C, roots);
147 int roots = intersectRay(rootVals); local
148 for (int index = 0; index < roots; ++index) {
160 int horizontalIntersect(double axisIntercept, double roots[2]) { argument
167 return SkDQuad::RootsValidT(D, 2 * E, F, roots);
176 int roots = horizontalIntersect(axisIntercept, rootVals); local
177 for (int index = 0; index < roots; ++index) {
191 int verticalIntersect(double axisIntercept, double roots[ argument
207 int roots = verticalIntersect(axisIntercept, rootVals); local
[all...]
/external/skia/src/pathops/
H A DSkDCubicLineIntersection.cpp97 int intersectRay(double roots[3]) { argument
106 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
108 SkDPoint calcPt = c.ptAtT(roots[index]);
116 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots);
129 int roots = intersectRay(rootVals); local
130 for (int index = 0; index < roots; ++index) {
163 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { argument
167 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
169 SkDPoint calcPt = c.ptAtT(roots[index]);
173 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots);
185 double roots[3]; local
203 VerticalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) argument
225 double roots[3]; local
[all...]
H A DSkDQuadLineIntersection.cpp108 int intersectRay(double roots[2]) { argument
110 solve by rotating line+quad so line is horizontal, then finding the roots
135 return SkDQuad::RootsValidT(A, 2 * B, C, roots);
147 int roots = intersectRay(rootVals); local
148 for (int index = 0; index < roots; ++index) {
160 int horizontalIntersect(double axisIntercept, double roots[2]) { argument
167 return SkDQuad::RootsValidT(D, 2 * E, F, roots);
176 int roots = horizontalIntersect(axisIntercept, rootVals); local
177 for (int index = 0; index < roots; ++index) {
191 int verticalIntersect(double axisIntercept, double roots[ argument
207 int roots = verticalIntersect(axisIntercept, rootVals); local
[all...]
/external/eigen/unsupported/test/
H A Dpolynomialsolver.cpp42 const RootsType& roots( psolve.roots() );
44 for( int i=0; i<roots.size(); ++i ){
45 evr[i] = std::abs( poly_eval( pols, roots[i] ) ); }
52 cerr << "Roots found: " << roots.transpose() << endl;
53 cerr << "Abs value of the polynomial at the roots: " << evr.transpose() << endl;
57 std::vector<Scalar> rootModuli( roots.size() );
58 Map< EvalRootsType > aux( &rootModuli[0], roots.size() );
59 aux = roots.array().abs();
93 void evalSolverSugarFunction( const POLYNOMIAL& pols, const ROOTS& roots, cons argument
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkQuadClipper.cpp32 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
33 int count = SkFindUnitQuadRoots(A, B, C, roots);
35 *t = roots[0];
H A DSkGeometry.cpp119 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]) { argument
120 SkASSERT(roots);
123 return valid_unit_divide(-C, B, roots);
126 SkScalar* r = roots;
129 if (R < 0 || SkScalarIsNaN(R)) { // complex roots
137 if (r - roots == 2) {
138 if (roots[0] > roots[1])
139 SkTSwap<SkScalar>(roots[0], roots[
509 SkChopCubicAt(const SkPoint src[4], SkPoint dst[], const SkScalar tValues[], int roots) argument
[all...]
/external/skia/src/core/
H A DSkQuadClipper.cpp32 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
33 int count = SkFindUnitQuadRoots(A, B, C, roots);
35 *t = roots[0];
H A DSkGeometry.cpp119 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]) { argument
120 SkASSERT(roots);
123 return valid_unit_divide(-C, B, roots);
126 SkScalar* r = roots;
129 if (R < 0 || SkScalarIsNaN(R)) { // complex roots
137 if (r - roots == 2) {
138 if (roots[0] > roots[1])
139 SkTSwap<SkScalar>(roots[0], roots[
509 SkChopCubicAt(const SkPoint src[4], SkPoint dst[], const SkScalar tValues[], int roots) argument
[all...]
/external/chromium_org/chrome/browser/media_galleries/
H A Dmedia_folder_finder.h65 void SetRootsForTesting(const std::vector<base::FilePath>& roots);
67 void OnInitialized(const std::vector<base::FilePath>& roots);
87 // Set of roots to scan for testing.
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DLineCubicIntersection_Test.cpp43 int roots = intersect(reduce1, reduce2, i); local
44 for (int pt = 0; pt < roots; ++pt) {
H A DCubicUtilities.cpp102 // cubic roots
125 double* roots = t;
128 if (R2MinusQ3 < 0) // we have 3 real roots
135 *roots++ = r;
139 *roots++ = r;
143 *roots++ = r;
157 *roots++ = r;
159 return (int)(roots - t);
224 double* roots = s; local
228 *roots
389 int roots = findExtrema(sub[0].y, sub[1].y, sub[2].y, sub[3].y, extremeTs); local
[all...]
H A DCubicReduceOrder.cpp36 int roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues); local
37 for (int index = 0; index < roots; ++index) {
59 int roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); local
60 for (int index = 0; index < roots; ++index) {
128 int roots; local
130 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues);
132 roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues);
134 for (int index = 0; index < roots; ++index) {
/external/skia/experimental/Intersection/
H A DLineCubicIntersection_Test.cpp43 int roots = intersect(reduce1, reduce2, i); local
44 for (int pt = 0; pt < roots; ++pt) {
H A DCubicUtilities.cpp102 // cubic roots
125 double* roots = t;
128 if (R2MinusQ3 < 0) // we have 3 real roots
135 *roots++ = r;
139 *roots++ = r;
143 *roots++ = r;
157 *roots++ = r;
159 return (int)(roots - t);
224 double* roots = s; local
228 *roots
389 int roots = findExtrema(sub[0].y, sub[1].y, sub[2].y, sub[3].y, extremeTs); local
[all...]
H A DCubicReduceOrder.cpp36 int roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues); local
37 for (int index = 0; index < roots; ++index) {
59 int roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); local
60 for (int index = 0; index < roots; ++index) {
128 int roots; local
130 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues);
132 roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues);
134 for (int index = 0; index < roots; ++index) {
/external/eigen/Eigen/src/Eigenvalues/
H A DSelfAdjointEigenSolver.h494 static inline void computeRoots(const MatrixType& m, VectorType& roots) argument
504 // eigenvalues are the roots to this equation, all guaranteed to be
510 // Construct the parameters used in classifying the roots of the equation
511 // and in solving the equation for the roots in closed form.
523 // Compute the eigenvalues by solving for the roots of the polynomial.
528 roots(0) = c2_over_3 + Scalar(2)*rho*cos_theta;
529 roots(1) = c2_over_3 - rho*(cos_theta + s_sqrt3*sin_theta);
530 roots(2) = c2_over_3 - rho*(cos_theta - s_sqrt3*sin_theta);
533 if (roots(0) >= roots(
669 computeRoots(const MatrixType& m, VectorType& roots) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/platform/fonts/
H A DGlyphPageTreeNode.cpp45 HashMap<int, GlyphPageTreeNode*>* GlyphPageTreeNode::roots = 0;
53 roots = new HashMap<int, GlyphPageTreeNode*>;
60 if (GlyphPageTreeNode* foundNode = roots->get(pageNumber))
67 roots->set(pageNumber, node);
74 if (roots) {
75 HashMap<int, GlyphPageTreeNode*>::iterator end = roots->end();
76 for (HashMap<int, GlyphPageTreeNode*>::iterator it = roots->begin(); it != end; ++it)
98 // Enumerate all the roots and prune any tree that contains our custom font data.
99 if (roots) {
100 HashMap<int, GlyphPageTreeNode*>::iterator end = roots
[all...]
/external/jarjar/src/main/com/tonicsystems/jarjar/
H A DKeepProcessor.java31 private final List<String> roots = new ArrayList<String>(); field in class:KeepProcessor
44 closureHelper(closure, roots);
68 roots.add(name);
/external/skia/src/effects/gradients/
H A DSkTwoPointConicalGradient.cpp32 // Return the number of distinct real roots, and write them into roots[] in
34 static int find_quad_roots(float A, float B, float C, float roots[2], bool descendingOrder = false) { argument
35 SkASSERT(roots);
38 return valid_divide(-C, B, roots);
60 roots[0] = 0;
66 roots[0] = r0 < r1 ? r0 : r1;
67 roots[1] = r0 > r1 ? r0 : r1;
69 SkTSwap(roots[0], roots[
108 float roots[2]; local
[all...]
/external/chromium_org/tools/gyp/pylib/gyp/generator/
H A Danalyzer.py296 roots = set()
305 roots.add(target)
344 roots.discard(dep_target)
349 return targets, matching_targets, roots & build_file_targets
397 def _AddBuildTargets(target, roots, add_if_no_ancestor, result):
399 that need to be built (and are in |roots|) to |result|.
400 roots: set of root targets.
402 |target| to |result|. |target| must still be in |roots|.
408 target.in_roots = not target.back_deps and target in roots
411 _AddBuildTargets(back_dep_target, roots, Fals
[all...]
/external/fonttools/Lib/fontTools/misc/
H A DbezierTools.py36 roots = []
38 roots.append(-bx/ax2)
40 roots.append(-by/ay2)
41 points = [(ax*t*t + bx*t + cx, ay*t*t + by*t + cy) for t in roots if 0 <= t < 1] + [pt1, pt3]
64 roots = xRoots + yRoots
66 points = [(ax*t*t*t + bx*t*t + cx * t + dx, ay*t*t*t + by*t*t + cy * t + dy) for t in roots] + [pt1, pt4]
260 This function returns a list of roots. Note that the returned list
266 roots = []
269 roots = [-c/b]
271 # We have a true quadratic equation. Apply the quadratic formula to find two roots
[all...]
/external/fonttools/Tools/fontTools/misc/
H A DbezierTools.py36 roots = []
38 roots.append(-bx/ax2)
40 roots.append(-by/ay2)
41 points = [(ax*t*t + bx*t + cx, ay*t*t + by*t + cy) for t in roots if 0 <= t < 1] + [pt1, pt3]
64 roots = xRoots + yRoots
66 points = [(ax*t*t*t + bx*t*t + cx * t + dx, ay*t*t*t + by*t*t + cy * t + dy) for t in roots] + [pt1, pt4]
260 This function returns a list of roots. Note that the returned list
266 roots = []
269 roots = [-c/b]
271 # We have a true quadratic equation. Apply the quadratic formula to find two roots
[all...]
/external/compiler-rt/test/BlocksRuntime/
H A Dmakefile55 ditto $(RootsDirectory)/libclosure.roots/libclosure~dst/usr/local/lib/system $(ALTUSRLOCALLIBSYSTEM)
67 LibsystemRootPath ?= $(RootsDirectory)/Libsystem-$(LibsystemVersion).roots/Libsystem-$(LibsystemVersion)~dst/usr/lib/
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.equinox.p2.director.app_1.0.201.R36x_v20100823.jar ... .eclipse.equinox.p2.query.IQueryResult roots boolean install org.eclipse.equinox.internal.

Completed in 9268 milliseconds

123456