HomeSort by relevance Sort by last modified time
    Searched defs:roots (Results 1 - 25 of 562) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /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...]
  /external/skqp/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...]
  /external/eigen/unsupported/doc/examples/
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();
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...]
  /packages/apps/DocumentsUI/src/com/android/documentsui/roots/
BootReceiver.java 17 package com.android.documentsui.roots;
32 // kicked off a task to load roots, so this broadcast is finished once
GetRootDocumentTask.java 17 package com.android.documentsui.roots;
LoadRootTask.java 17 package com.android.documentsui.roots;
RootsLoader.java 17 package com.android.documentsui.roots;
  /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)
  /packages/apps/DocumentsUI/tests/common/com/android/documentsui/testing/
TestProvidersAccess.java 24 import com.android.documentsui.roots.ProvidersAccess;
90 public final Map<String, Collection<RootInfo>> roots = new HashMap<>(); field in class:TestProvidersAccess
101 if (!roots.containsKey(root.authority)) {
102 roots.put(root.authority, new ArrayList<>());
104 roots.get(root.authority).add(root);
116 if (roots.containsKey(authority)) {
117 for (RootInfo root : roots.get(authority)) {
129 for (String authority : roots.keySet()) {
130 allRoots.addAll(roots.get(authority));
137 return roots.get(authority)
    [all...]
  /packages/apps/DocumentsUI/tests/functional/com/android/documentsui/
KeyboardNavigationUiTest.java 44 // Tests that pressing tab switches focus between the roots and directory listings.
48 bots.roots.assertHasFocus();
68 bots.roots.closeDrawer();
80 // Tests that arrow keys do not switch focus away from the roots list.
84 bots.roots.openDrawer();
90 bots.roots.assertHasFocus();
94 bots.roots.assertHasFocus();
  /external/skia/src/core/
SkQuadClipper.cpp 32 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];
SkCubicMap.cpp 53 double roots[3]; local
54 SkDEBUGCODE(int count =) SkDCubic::RootsValidT(A, B, C, -x, roots);
56 return (float)roots[0];
  /external/skqp/src/core/
SkQuadClipper.cpp 32 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];
SkCubicMap.cpp 53 double roots[3]; local
54 SkDEBUGCODE(int count =) SkDCubic::RootsValidT(A, B, C, -x, roots);
56 return (float)roots[0];
  /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;
  /art/runtime/
class_table_test.cc 113 // Test adding / clearing strong roots.
119 // Collect all the roots and make sure there is nothing missing.
120 CollectRootVisitor roots; local
121 table.VisitRoots(roots);
122 EXPECT_TRUE(roots.roots_.find(h_X.Get()) != roots.roots_.end());
123 EXPECT_TRUE(roots.roots_.find(h_Y.Get()) != roots.roots_.end());
124 EXPECT_TRUE(roots.roots_.find(obj_X.Get()) != roots.roots_.end())
    [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...]
  /external/skia/tests/
PathOpsConicQuadIntersectionTest.cpp 49 int roots = i.intersect(conic, quad); local
50 for (int pt = 0; pt < roots; ++pt) {
PathOpsCubicConicIntersectionTest.cpp 53 int roots = i.intersect(cubic, conic); local
54 for (int pt = 0; pt < roots; ++pt) {
PathOpsCubicQuadIntersectionTest.cpp 77 int roots = i.intersect(cubic, quad); local
78 for (int pt = 0; pt < roots; ++pt) {
  /external/skqp/tests/
PathOpsConicQuadIntersectionTest.cpp 49 int roots = i.intersect(conic, quad); local
50 for (int pt = 0; pt < roots; ++pt) {
PathOpsCubicConicIntersectionTest.cpp 53 int roots = i.intersect(cubic, conic); local
54 for (int pt = 0; pt < roots; ++pt) {
PathOpsCubicQuadIntersectionTest.cpp 77 int roots = i.intersect(cubic, quad); local
78 for (int pt = 0; pt < roots; ++pt) {
  /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();

Completed in 1529 milliseconds

1 2 3 4 5 6 7 8 91011>>