| /external/skia/src/pathops/ |
| SkPathOpsRect.cpp | 17 int roots = 0; local
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues);
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]);
24 for (int index = 0; index < roots; ++index) {
34 int roots = 0; local
36 roots = SkDConic::FindExtrema(&sub[0].fX, sub.fWeight, tValues);
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]);
41 for (int index = 0; index < roots; ++index)
51 int roots = 0; local
[all...] |
| SkDCubicLineIntersection.cpp | 120 int intersectRay(double roots[3]) {
129 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
131 SkDPoint calcPt = c.ptAtT(roots[index]);
139 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots);
152 int roots = intersectRay(rootVals); local
153 for (int index = 0; index < roots; ++index) {
165 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) {
169 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
171 SkDPoint calcPt = c.ptAtT(roots[index]);
175 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots);
187 double roots[3]; local
250 double roots[3]; local
[all...] |
| SkDConicLineIntersection.cpp | 66 int horizontalIntersect(double axisIntercept, double roots[2]) {
68 return this->validT(conicVals, axisIntercept, roots);
76 double roots[2]; local
77 int count = this->horizontalIntersect(axisIntercept, roots);
79 double conicT = roots[index];
102 int roots = this->intersectRay(rootVals); local
103 for (int index = 0; index < roots; ++index) {
119 int intersectRay(double roots[2]) {
126 return this->validT(r, 0, roots);
129 int validT(double r[3], double axisIntercept, double roots[2])
149 double roots[2]; local
[all...] |
| SkDQuadLineIntersection.cpp | 138 int intersectRay(double roots[2]) {
140 solve by rotating line+quad so line is horizontal, then finding the roots
165 return SkDQuad::RootsValidT(A, 2 * B, C, roots);
174 int roots = intersectRay(rootVals); local
175 for (int index = 0; index < roots; ++index) {
187 int horizontalIntersect(double axisIntercept, double roots[2]) {
194 return SkDQuad::RootsValidT(D, 2 * E, F, roots);
203 int roots = horizontalIntersect(axisIntercept, rootVals); local
204 for (int index = 0; index < roots; ++index) {
243 int verticalIntersect(double axisIntercept, double roots[2])
259 int roots = verticalIntersect(axisIntercept, rootVals); local
[all...] |
| /external/smali/util/src/test/java/org/jf/util/ |
| PathUtilTest.java | 39 File[] roots = File.listRoots(); local
41 if (roots.length > 1) {
42 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt");
43 File relativePath = new File(roots[1] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt");
53 File[] roots = File.listRoots(); local
55 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt");
56 File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt");
68 File[] roots = File.listRoots(); local
70 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar);
71 File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar)
80 File[] roots = File.listRoots(); local
92 File[] roots = File.listRoots(); local
104 File[] roots = File.listRoots(); local
116 File[] roots = File.listRoots(); local
128 File[] roots = File.listRoots(); local
140 File[] roots = File.listRoots(); local
152 File[] roots = File.listRoots(); local
164 File[] roots = File.listRoots(); local
176 File[] roots = File.listRoots(); local
188 File[] roots = File.listRoots(); local
200 File[] roots = File.listRoots(); local
212 File[] roots = File.listRoots(); local
224 File[] roots = File.listRoots(); local
236 File[] roots = File.listRoots(); local
248 File[] roots = File.listRoots(); local
260 File[] roots = File.listRoots(); local
[all...] |
| /external/eigen/unsupported/doc/examples/ |
| PolynomialSolver1.cpp | 12 Vector5d roots = Vector5d::Random(); local
13 cout << "Roots: " << roots.transpose() << endl;
15 roots_to_monicPolynomial( roots, polynomial );
18 cout << "Complex roots: " << psolve.roots().transpose() << endl;
23 cout << "Real roots: " << mapRR.transpose() << endl;
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl;
35 for( int i=0; i<6; ++i ){ evals[i] = std::abs( poly_eval( hardCase_polynomial, psolvef.roots()[i] ) );
[all...] |
| PolynomialUtils1.cpp | 9 Vector4d roots = Vector4d::Random(); local
10 cout << "Roots: " << roots.transpose() << endl;
12 roots_to_monicPolynomial( roots, polynomial );
18 evaluation[i] = poly_eval( polynomial, roots[i] ); }
19 cout << "Evaluation of the polynomial at the roots: " << evaluation.transpose();
|
| /build/kati/ |
| exec.h | 25 void Exec(const vector<DepNode*>& roots, Evaluator* ev);
|
| /system/extras/libfec/include/fec/ |
| ecc.h | 30 #define FEC_PARAMS(roots) \
34 1, /* primitive element to generate polynomial roots */ \
35 (roots), /* polynomial degree (number of roots) */ \
56 /* returns the size of ecc data given a file size and the number of roots */
57 inline uint64_t fec_ecc_get_size(uint64_t file_size, int roots)
60 FEC_RSM - roots)
61 * roots * FEC_BLOCKSIZE
|
| io.h | 48 uint32_t roots; member in struct:fec_header
64 uint32_t roots; member in struct:fec_ecc_metadata
90 int flags, int roots);
126 int roots = FEC_DEFAULT_ROOTS) : handle_(nullptr, fec_close) {
127 open(fn, mode, flags, roots);
135 int roots = FEC_DEFAULT_ROOTS)
138 int rc = fec_open(&fh, fn.c_str(), mode, flags, roots);
|
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_utilities_poly.cpp | 28 void db_SolveCubic(double *roots,int *nr_roots,double a,double b,double c,double d)
35 /*For nondegenerate cubics with three roots
40 if(a==0.0) db_SolveQuadratic(roots,nr_roots,b,c,d);
68 roots[0]= -2.0*srq*cos_theta_through3-bp_through3;
69 roots[1]=srq*min2_cos_theta_plu-bp_through3;
70 roots[2]=srq*min2_cos_theta_min-bp_through3;
77 if(A!=0.0) roots[0]=A+q/A-bp_through3;
78 else roots[0]= -bp_through3;
87 roots[0]= -2.0*si_r_srq-bp_through3;
89 roots[1]=si_r_srq-bp_through3
[all...] |
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_utilities_poly.cpp | 28 void db_SolveCubic(double *roots,int *nr_roots,double a,double b,double c,double d)
35 /*For nondegenerate cubics with three roots
40 if(a==0.0) db_SolveQuadratic(roots,nr_roots,b,c,d);
68 roots[0]= -2.0*srq*cos_theta_through3-bp_through3;
69 roots[1]=srq*min2_cos_theta_plu-bp_through3;
70 roots[2]=srq*min2_cos_theta_min-bp_through3;
77 if(A!=0.0) roots[0]=A+q/A-bp_through3;
78 else roots[0]= -bp_through3;
87 roots[0]= -2.0*si_r_srq-bp_through3;
89 roots[1]=si_r_srq-bp_through3
[all...] |
| /external/eigen/unsupported/test/ |
| polynomialutils.cpp | 36 EvalRootsType roots = EvalRootsType::Random(deg); local
37 roots_to_monicPolynomial( roots, pols );
40 for( int i=0; i<roots.size(); ++i ){
41 evr[i] = std::abs( poly_eval( pols, roots[i] ) ); }
74 EvalRootsType roots = EvalRootsType::Random(deg); local
75 roots_to_monicPolynomial( roots, pols );
78 _Scalar Max = roots.array().abs().maxCoeff();
79 _Scalar min = roots.array().abs().minCoeff();
83 cerr << "Roots: " << roots << endl
[all...] |
| polynomialsolver.cpp | 42 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()
[all...] |
| /system/extras/verity/fec/tests/ |
| fec.py | 24 roots = 2 variable
33 def corruptmax(image, roots):
37 rounds = int(math.ceil(float(blocks) / (255 - roots)))
39 max_errors = int(math.floor(rounds * roots / 2)) * blocksize
44 def encode(image, fec, roots):
45 if subprocess.call([ "fec", "--roots= " + str(roots), image, fec ]) != 0:
70 encode(image, temp_fec.name, roots)
71 corruptmax(temp_cor.name, roots)
|
| /prebuilts/go/darwin-x86/test/bench/shootout/ |
| k-nucleotide.c | 47 GHashTable *ht, GTrashStack **ts, GPtrArray *roots, GStringChunk *sc)
74 g_ptr_array_add(roots, stat);
121 write_frequencies (int fl, char *buffer, long buflen, GTrashStack **ts, GPtrArray *roots)
132 total = generate_frequencies (fl, buffer, buflen, ht, ts, roots, sc);
146 write_count (char *searchFor, char *buffer, long buflen, GTrashStack **ts, GPtrArray *roots)
162 total = generate_frequencies (fl, buffer, buflen, ht, ts, roots, sc);
180 GPtrArray *roots; local
185 roots = g_ptr_array_new();
212 write_frequencies(1, s, len, &ts, roots);
214 write_frequencies(2, s, len, &ts, roots);
[all...] |
| /prebuilts/go/linux-x86/test/bench/shootout/ |
| k-nucleotide.c | 47 GHashTable *ht, GTrashStack **ts, GPtrArray *roots, GStringChunk *sc)
74 g_ptr_array_add(roots, stat);
121 write_frequencies (int fl, char *buffer, long buflen, GTrashStack **ts, GPtrArray *roots)
132 total = generate_frequencies (fl, buffer, buflen, ht, ts, roots, sc);
146 write_count (char *searchFor, char *buffer, long buflen, GTrashStack **ts, GPtrArray *roots)
162 total = generate_frequencies (fl, buffer, buflen, ht, ts, roots, sc);
180 GPtrArray *roots; local
185 roots = g_ptr_array_new();
212 write_frequencies(1, s, len, &ts, roots);
214 write_frequencies(2, s, len, &ts, roots);
[all...] |
| /external/eigen/bench/ |
| eig33.cpp | 48 template<typename Matrix, typename Roots>
49 inline void computeRoots(const Matrix& m, Roots& roots)
56 // eigenvalues are the roots to this equation, all guaranteed to be
62 // Construct the parameters used in classifying the roots of the equation
63 // and in solving the equation for the roots in closed form.
75 // Compute the eigenvalues by solving for the roots of the polynomial.
80 roots(0) = c2_over_3 + Scalar(2)*rho*cos_theta;
81 roots(1) = c2_over_3 - rho*(cos_theta + s_sqrt3*sin_theta);
82 roots(2) = c2_over_3 - rho*(cos_theta - s_sqrt3*sin_theta)
[all...] |
| /frameworks/base/packages/MtpDocumentsProvider/src/com/android/mtp/ |
| MtpDeviceRecord.java | 27 public final MtpRoot[] roots; field in class:MtpDeviceRecord
32 MtpRoot[] roots, @Nullable int[] operationsSupported,
37 this.roots = roots;
|
| /external/ceres-solver/internal/ceres/ |
| polynomial_test.cc | 78 // Needed because the roots are not returned in sorted order.
85 // Run a test with the polynomial defined by the N real roots in roots_real.
141 const double roots[1] = { 42.42 }; local
142 RunPolynomialTestRealRoots(roots, true, true, kEpsilon);
146 const double roots[1] = { -42.42 }; local
147 RunPolynomialTestRealRoots(roots, true, true, kEpsilon);
151 const double roots[2] = { 1.0, 42.42 }; local
152 RunPolynomialTestRealRoots(roots, true, true, kEpsilon);
156 const double roots[2] = { -42.42, 1.0 }; local
157 RunPolynomialTestRealRoots(roots, true, true, kEpsilon)
161 const double roots[2] = { -42.42, -1.0 }; local
166 const double roots[2] = { 42.42, 42.43 }; local
189 const double roots[4] = { 1.23e-4, 1.23e-1, 1.23e+2, 1.23e+5 }; local
194 const double roots[4] = { 1.23e-1, 2.46e-1, 1.23e+5, 2.46e+5 }; local
199 const double roots[4] = { -42.42, 0.0, 0.0, 42.42 }; local
204 const double roots[4] = { 0.0, 0.0, 0.0, 0.0 }; local
209 const double roots[4] = { 1.23e-4, 1.23e-1, 1.23e+2, 1.23e+5 }; local
214 const double roots[4] = { 1.23e-4, 1.23e-1, 1.23e+2, 1.23e+5 }; local
219 const double roots[4] = { 1.23e-4, 1.23e-1, 1.23e+2, 1.23e+5 }; local
[all...] |
| /frameworks/base/packages/DocumentsUI/tests/src/com/android/documentsui/ |
| FilesActivityUiTest.java | 65 bots.roots.assertRootsPresent(
75 bots.roots.assertRootsPresent("Documents");
77 bots.roots.assertRootsAbsent("Documents");
84 bots.roots.openRoot(ROOT_0_ID);
98 bots.roots.openRoot("Downloads");
105 bots.roots.openRoot(ROOT_0_ID);
116 bots.roots.openRoot(ROOT_0_ID);
130 bots.roots.openRoot(ROOT_0_ID);
144 bots.roots.openRoot(ROOT_0_ID);
155 // Tests that pressing tab switches focus between the roots and directory listings
[all...] |
| RootsUiTest.java | 43 bots.roots.openRoot(ROOT_0_ID);
53 bots.roots.openRoot(ROOT_1_ID);
|
| RootsCacheTest.java | 133 final List<RootInfo> roots = newArrayList(); local
135 // Set up some roots
139 roots.add(root);
143 roots.get(0), roots.get(2), roots.get(4));
145 for (RootInfo root: roots) {
154 getMatchingRoots(roots, mState));
|
| /build/tools/ |
| fileslist.py | 26 roots = argv[1:]
27 for root in roots:
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ui/tree/ |
| UiModelTreeContentProvider.java | 92 ArrayList<UiElementNode> roots = new ArrayList<UiElementNode>(); local
96 roots.add(ui_node);
100 roots.add(ui_node);
107 return roots.toArray();
|
