| /external/fonttools/Lib/fontTools/pens/ |
| D | pointInsidePen.py | 125 solutions = sorted(solveCubic(ay, by, cy, dy - y))
126 solutions = [t for t in solutions if ZERO_MINUS_EPSILON <= t <= ONE_PLUS_EPSILON]
127 if not solutions:
137 for t in solutions:
180 solutions = sorted(solveQuadratic(a, b, c - y))
181 solutions = [t for t in solutions if ZERO_MINUS_EPSILON <= t <= ONE_PLUS_EPSILON]
182 if not solutions:
|
| /external/fonttools/Lib/fontTools/misc/ |
| D | bezierTools.py | 133 solutions = solveQuadratic(a[isHorizontal], b[isHorizontal],
135 solutions = sorted([t for t in solutions if 0 <= t < 1])
136 if not solutions:
138 return _splitQuadraticAtT(a, b, c, *solutions)
157 solutions = solveCubic(a[isHorizontal], b[isHorizontal], c[isHorizontal],
159 solutions = sorted([t for t in solutions if 0 <= t < 1])
160 if not solutions:
162 return _splitCubicAtT(a, b, c, d, *solutions)
|
| /external/opencv/cvaux/src/ |
| D | cvlmeds.cpp | 1418 icvGaussMxN( double *A, double *B, int M, int N, double **solutions ) in icvGaussMxN() argument
1528 *solutions = (double *) cvAlloc( ((N - M + 1) * N) * sizeof( double )); in icvGaussMxN()
1530 if( *solutions == 0 ) in icvGaussMxN()
1542 (*solutions)[(t - M) * N + variables[j]] = (double) (t == j); in icvGaussMxN()
1550 (*solutions)[(t - M) * N + variables[i]] = 0; in icvGaussMxN()
1554 (*solutions)[(t - M) * N + variables[i]] = B[i] / A[i * N + i]; in icvGaussMxN()
1560 (*solutions)[(t - M) * N + variables[i]] -= in icvGaussMxN()
1561 (*solutions)[(t - M) * N + variables[j]] * A[i * N + j] / A[i * N + i]; in icvGaussMxN()
1570 *solutions = (double *) cvAlloc( (N) * sizeof( double )); in icvGaussMxN()
1572 if( solutions == 0 ) in icvGaussMxN()
[all …]
|
| D | cvscanlines.cpp | 52 double *solutions = 0; in icvGetNormalVector3() local
66 res = icvGaussMxN( M, B, 3, 3, &solutions ); in icvGetNormalVector3()
71 if( res > 0 && solutions ) in icvGetNormalVector3()
73 v[0] = (float) solutions[0]; in icvGetNormalVector3()
74 v[1] = (float) solutions[1]; in icvGetNormalVector3()
75 v[2] = (float) solutions[2]; in icvGetNormalVector3()
81 if( solutions ) in icvGetNormalVector3()
82 cvFree( &solutions ); in icvGetNormalVector3()
|
| D | _cvvm.h | 136 icvGaussMxN( double *A, double *B, int M, int N, double **solutions );
|
| /external/eigen/doc/ |
| D | WrongStackAlignment.dox | 22 …nalignedArrayAssert "assertion on unaligned arrays". So far we found the three following solutions.
35 …as to be done for every such function, so you may prefer one of the following two global solutions.
38 \section sec_sol2 Global solutions
52 These global solutions are easy to use, but note that they may slowdown your program because they l…
|
| D | StructHavingEigenMembers.dox | 131 \section othersolutions Other solutions
133 …_ALIGNED_OPERATOR_NEW macro everywhere is too intrusive, there exists at least two other solutions.
|
| /external/opencv3/modules/calib3d/src/ |
| D | upnp.cpp | 372 double solutions[18][3]; in find_betas_and_focal_approx_2() local
373 generate_all_possible_solutions_for_f_unk(x, solutions); in find_betas_and_focal_approx_2()
380 betas[3] = solutions[i][0]; in find_betas_and_focal_approx_2()
381 betas[2] = solutions[i][1]; in find_betas_and_focal_approx_2()
383 fu = fv = solutions[i][2]; in find_betas_and_focal_approx_2()
395 betas[0] = solutions[min_sol][0]; in find_betas_and_focal_approx_2()
396 betas[1] = solutions[min_sol][1]; in find_betas_and_focal_approx_2()
399 efs[0] = solutions[min_sol][2]; in find_betas_and_focal_approx_2()
531 void upnp::generate_all_possible_solutions_for_f_unk(const double betas[5], double solutions[18][3]) in generate_all_possible_solutions_for_f_unk()
567 solutions[i][0] = S.at<double>(0); in generate_all_possible_solutions_for_f_unk()
[all …]
|
| D | upnp.h | 100 … void generate_all_possible_solutions_for_f_unk(const double betas[5], double solutions[18][3]);
|
| /external/llvm/test/CodeGen/X86/ |
| D | 2009-03-12-CPAlignBug.ll | 10 define void @SolveCubic_bb1(i32* %solutions, double* %x, x86_fp80 %.reload, x86_fp80 %.reload5, x86…
18 store i32 1, i32* %solutions, align 4
|
| D | 2008-01-16-FPStackifierAssert.ll | 3 define void @SolveCubic(double %a, double %b, double %c, double %d, i32* %solutions, double* %x) {
|
| /external/skia/platform_tools/android/ |
| D | gclient.config | 4 solutions = [
|
| /external/libyuv/files/chromium/ |
| D | .gclient | 1 solutions = [{
|
| /external/webrtc/chromium/ |
| D | .gclient | 1 solutions = [{
|
| /external/opencv3/platforms/winrt/ |
| D | readme.txt | 58 … generated solutions in both "Debug" and "Release" configurations. It also builds the predefined "…
|
| /external/libexif/m4m/ |
| D | gp-pkg-config.m4 | 27 *** Possible solutions:
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| D | core.rst | 15 …Graph` class is loosely modeled after the `LEDA <http://www.algorithmic-solutions.com/enleda.htm>`…
|
| /external/llvm/test/CodeGen/ARM/ |
| D | ifcvt10.ll | 7 define void @t(double %a, double %b, double %c, double %d, i32* nocapture %solutions, double* nocap…
|
| /external/ImageMagick/MagickCore/ |
| D | version.h.in | 3 dedicated to making software imaging solutions freely available.
|
| D | version.h_vms | 3 dedicated to making software imaging solutions freely available.
|
| /external/ImageMagick/PerlMagick/default/ |
| D | Magick.pm.in | 4 # dedicated to making software imaging solutions freely available.
|
| /external/libxml2/result/HTML/ |
| D | doc2.htm.sax | 29 SAX.startElement(meta, content='Copernic.com Inc. develops innovative agent technology solutions to…
|
| D | test2.html.sax | 30 …door_linux.gif', border='0', width='468', height='60', alt='Atipa Linux solutions. Your reliable c…
|
| /external/libyuv/files/docs/ |
| D | getting_started.md | 20 solutions = [
40 solutions = [
359 solutions = [
|
| /external/opencv3/doc/py_tutorials/py_ml/py_svm/py_svm_basics/ |
| D | py_svm_basics.markdown | 121 - Large values of C give solutions with less misclassification errors but a smaller margin.
124 - Small values of C give solutions with bigger margin and more classification errors. In this
|