| /external/skia/src/core/ |
| SkEdgeClipper.cpp | 75 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
76 int count = SkFindUnitQuadRoots(A, B, C, roots);
78 *t = roots[0];
|
| /external/skia/src/pathops/ |
| SkDConicLineIntersection.cpp | 67 int horizontalIntersect(double axisIntercept, double roots[2]) {
69 return this->validT(conicVals, axisIntercept, roots);
77 double roots[2]; local
78 int count = this->horizontalIntersect(axisIntercept, roots);
80 double conicT = roots[index];
103 int roots = this->intersectRay(rootVals); local
104 for (int index = 0; index < roots; ++index) {
125 int intersectRay(double roots[2]) {
132 return this->validT(r, 0, roots);
135 int validT(double r[3], double axisIntercept, double roots[2])
155 double roots[2]; local
[all...] |
| SkDCubicLineIntersection.cpp | 121 int intersectRay(double roots[3]) {
131 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
133 SkDPoint calcPt = c.ptAtT(roots[index]);
141 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots);
154 int roots = intersectRay(rootVals); local
155 for (int index = 0; index < roots; ++index) {
167 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) {
171 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
173 SkDPoint calcPt = c.ptAtT(roots[index]);
177 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots);
189 double roots[3]; local
252 double roots[3]; local
[all...] |
| SkDQuadLineIntersection.cpp | 139 int intersectRay(double roots[2]) {
141 solve by rotating line+quad so line is horizontal, then finding the roots
166 return SkDQuad::RootsValidT(A, 2 * B, C, roots);
175 int roots = intersectRay(rootVals); local
176 for (int index = 0; index < roots; ++index) {
188 int horizontalIntersect(double axisIntercept, double roots[2]) {
195 return SkDQuad::RootsValidT(D, 2 * E, F, roots);
204 int roots = horizontalIntersect(axisIntercept, rootVals); local
205 for (int index = 0; index < roots; ++index) {
244 int verticalIntersect(double axisIntercept, double roots[2])
260 int roots = verticalIntersect(axisIntercept, rootVals); local
[all...] |
| SkPathOpsWinding.cpp | 131 int roots = (*CurveIntercept[fVerb * 2 + xy_index(dir)])(fPts, fWeight, baseYX, tVals); local
132 for (int index = 0; index < roots; ++index) {
|
| /external/skqp/src/core/ |
| SkEdgeClipper.cpp | 75 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
76 int count = SkFindUnitQuadRoots(A, B, C, roots);
78 *t = roots[0];
|
| /external/skqp/src/pathops/ |
| SkDConicLineIntersection.cpp | 67 int horizontalIntersect(double axisIntercept, double roots[2]) {
69 return this->validT(conicVals, axisIntercept, roots);
77 double roots[2]; local
78 int count = this->horizontalIntersect(axisIntercept, roots);
80 double conicT = roots[index];
103 int roots = this->intersectRay(rootVals); local
104 for (int index = 0; index < roots; ++index) {
125 int intersectRay(double roots[2]) {
132 return this->validT(r, 0, roots);
135 int validT(double r[3], double axisIntercept, double roots[2])
155 double roots[2]; local
[all...] |
| SkDCubicLineIntersection.cpp | 121 int intersectRay(double roots[3]) {
131 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
133 SkDPoint calcPt = c.ptAtT(roots[index]);
141 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots);
154 int roots = intersectRay(rootVals); local
155 for (int index = 0; index < roots; ++index) {
167 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) {
171 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
173 SkDPoint calcPt = c.ptAtT(roots[index]);
177 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots);
189 double roots[3]; local
252 double roots[3]; local
[all...] |
| SkDQuadLineIntersection.cpp | 139 int intersectRay(double roots[2]) {
141 solve by rotating line+quad so line is horizontal, then finding the roots
166 return SkDQuad::RootsValidT(A, 2 * B, C, roots);
175 int roots = intersectRay(rootVals); local
176 for (int index = 0; index < roots; ++index) {
188 int horizontalIntersect(double axisIntercept, double roots[2]) {
195 return SkDQuad::RootsValidT(D, 2 * E, F, roots);
204 int roots = horizontalIntersect(axisIntercept, rootVals); local
205 for (int index = 0; index < roots; ++index) {
244 int verticalIntersect(double axisIntercept, double roots[2])
260 int roots = verticalIntersect(axisIntercept, rootVals); local
[all...] |
| SkPathOpsWinding.cpp | 131 int roots = (*CurveIntercept[fVerb * 2 + xy_index(dir)])(fPts, fWeight, baseYX, tVals); local
132 for (int index = 0; index < roots; ++index) {
|
| /external/speex/libspeex/ |
| lsp.c | 68 The zeros (roots) of P(z) also happen to alternate, which is why we
69 swap coefficients as we find roots. So the process of finding the
70 LSP frequencies is basically finding the roots of 5th order
241 int roots=0; /* DR 8/2/94: number of roots found */ local
355 roots++;
387 return(roots);
|
| sb_celp.c | 307 int i, roots, sub; local
411 roots=lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA1, stack);
412 if (roots!=st->lpcSize)
414 roots = lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA2, stack);
415 if (roots!=st->lpcSize) {
[all...] |
| /external/v8/tools/clang/blink_gc_plugin/ |
| process-graph.py | 18 help='Detect cycles containing GC roots')
51 roots = [] variable
228 roots.append(edge)
256 for root_edge in roots:
318 global roots
322 roots = dump[1]
326 dump = (graph, roots)
454 log("Detecting cycles containg GC roots")
|
| /packages/apps/DocumentsUI/tests/functional/com/android/documentsui/ |
| ActivityTest.java | 79 * By default tests are started with one of the test roots.
97 * Resolves testing roots.
130 bots.roots.closeDrawer();
|
| RenameDocumentUiTest.java | 37 bots.roots.closeDrawer();
|
| SearchViewUiTest.java | 40 bots.roots.closeDrawer();
53 bots.roots.openRoot(ROOT_1_ID); // root 1 doesn't support search
159 bots.roots.openRoot(ROOT_1_ID);
163 bots.roots.openRoot(ROOT_0_ID);
|
| SortDocumentUiTest.java | 65 bots.roots.closeDrawer();
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/newproject/ |
| SampleSelectionPage.java | 179 Object[] roots = (Object[]) mTableViewer.getInput(); local
180 selectSample(((Pair<String, File>) roots[index]).getSecond());
|
| /system/extras/libfec/ |
| fec_private.h | 69 int roots; member in struct:ecc_info
|
| /system/extras/libfec/include/fec/ |
| io.h | 49 uint32_t roots; member in struct:fec_header
65 uint32_t roots; member in struct:fec_ecc_metadata
91 int flags, int roots);
127 int roots = FEC_DEFAULT_ROOTS) : handle_(nullptr, fec_close) {
128 open(fn, mode, flags, roots);
136 int roots = FEC_DEFAULT_ROOTS)
139 int rc = fec_open(&fh, fn.c_str(), mode, flags, roots);
|
| /packages/apps/DocumentsUI/src/com/android/documentsui/ |
| BaseActivity.java | 62 import com.android.documentsui.roots.ProvidersCache;
422 final RootsFragment roots = RootsFragment.get(getFragmentManager()); local
423 if (roots != null) {
424 roots.onCurrentRootChanged();
438 // Exclude roots provided by the calling package.
477 // This also takes care of updating launcher shortcuts (which are roots :)
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/transform/ |
| FastFourierTransformer.java | 53 /** roots of unity */
54 private RootsOfUnity roots = new RootsOfUnity(); field in class:FastFourierTransformer
112 roots.computeOmega(f.length);
170 roots.computeOmega(f.length);
229 roots.computeOmega(-f.length); // pass negative argument
288 roots.computeOmega(-f.length); // pass negative argument
318 roots.computeOmega(isInverse ? -N : N);
322 roots.computeOmega(isInverse ? -2*N : 2*N);
329 //Complex D = roots.getOmega(i).multiply(Complex.I);
330 Complex D = new Complex(-roots.getOmegaImaginary(i)
[all...] |
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_image_homography.cpp | 119 double roots[3]; local
162 db_SolveCubic(roots,&nr_roots,p9[4],p9[3],p9[2],p9[1]);
166 if(roots[i]>0)
168 if((!signed_disambiguation) || (db_PolyEval1(p1,roots[i])*db_PolyEval1(p4,roots[i])>0))
170 fsol[j++]=db_SafeSqrtReciprocal(roots[i]);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/model/ |
| UiPackageAttributeNode.java | 269 IPackageFragmentRoot[] roots = javaProject.getPackageFragmentRoots(); local
270 for (int i = 0; i < roots.length; i++) {
271 IClasspathEntry entry = roots[i].getRawClasspathEntry();
273 result.add(roots[i]);
|
| /prebuilts/tools/common/m2/repository/org/eclipse/tycho/tycho-bundles-external/0.18.1/eclipse/plugins/ |
| org.eclipse.equinox.p2.director.app_1.0.300.v20130327-2119.jar | |
