| /external/google-smali/third_party/util/src/test/java/com/android/tools/smali/util/ |
| D | PathUtilTest.java | 36 File[] roots = File.listRoots(); in pathUtilTest1() local
38 if (roots.length > 1) { in pathUtilTest1()
39 …File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "te… in pathUtilTest1()
40 …File relativePath = new File(roots[1] + "some" + File.separatorChar + "dir" + File.separatorChar +… in pathUtilTest1()
50 File[] roots = File.listRoots(); in pathUtilTest2() local
52 …File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "te… in pathUtilTest2()
53 …File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar +… in pathUtilTest2()
65 File[] roots = File.listRoots(); in pathUtilTest3() local
67 … File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar); in pathUtilTest3()
68 … File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar); in pathUtilTest3()
[all …]
|
| /external/skia/fuzz/ |
| D | FuzzCubicRoots.cpp | 18 double roots[3]; in fuzz_cubic_real_roots() local
19 const int numSolutions = SkCubics::RootsReal(A, B, C, D, roots); in fuzz_cubic_real_roots()
22 SkASSERT_RELEASE(std::isfinite(roots[i])); in fuzz_cubic_real_roots()
24 // Roots should not be duplicated in fuzz_cubic_real_roots()
26 SkASSERT_RELEASE(!sk_doubles_nearly_equal_ulps(roots[0], roots[1])); in fuzz_cubic_real_roots()
29 SkASSERT_RELEASE(!sk_doubles_nearly_equal_ulps(roots[1], roots[2])); in fuzz_cubic_real_roots()
30 SkASSERT_RELEASE(!sk_doubles_nearly_equal_ulps(roots[0], roots[2])); in fuzz_cubic_real_roots()
35 double roots[3]; in fuzz_cubic_roots_valid_t() local
36 const int numSolutions = SkCubics::RootsValidT(A, B, C, D, roots); in fuzz_cubic_roots_valid_t()
39 SkASSERT_RELEASE(std::isfinite(roots[i])); in fuzz_cubic_roots_valid_t()
[all …]
|
| /external/skia/tests/ |
| D | CubicRootsTest.cpp | 30 "Invalid test case, up to 3 roots allowed"); in testCubicRootsReal()
43 "Invalid test case root %zu. Roots should be sorted in ascending order", i); in testCubicRootsReal()
51 double roots[3] = {0, 0, 0}; in testCubicRootsReal() local
52 int rootCount = SkDCubic::RootsReal(A, B, C, D, roots); in testCubicRootsReal()
54 "Wrong number of roots returned %zu != %d", expectedRoots.size(), in testCubicRootsReal()
57 // We don't care which order the roots are returned from the algorithm. in testCubicRootsReal()
59 std::sort(std::begin(roots), std::begin(roots) + rootCount); in testCubicRootsReal()
62 REPORTER_ASSERT(reporter, sk_double_nearly_zero(roots[i]), in testCubicRootsReal()
63 "0 != %.16f at index %d", roots[i], i); in testCubicRootsReal()
66 sk_doubles_nearly_equal_ulps(expectedRoots[i], roots[i], 64), in testCubicRootsReal()
[all …]
|
| D | QuadRootsTest.cpp | 31 "Invalid test case, up to 2 roots allowed"); in testQuadRootsReal()
42 "Invalid test case root %zu. Roots should be sorted in ascending order", i); in testQuadRootsReal()
48 double roots[2] = {0, 0}; in testQuadRootsReal() local
49 int rootCount = SkDQuad::RootsReal(A, B, C, roots); in testQuadRootsReal()
51 "Wrong number of roots returned %zu != %d", expectedRoots.size(), in testQuadRootsReal()
54 // We don't care which order the roots are returned from the algorithm. in testQuadRootsReal()
56 std::sort(std::begin(roots), std::begin(roots) + rootCount); in testQuadRootsReal()
59 REPORTER_ASSERT(reporter, sk_double_nearly_zero(roots[i]), in testQuadRootsReal()
60 "0 != %.16f at index %d", roots[i], i); in testQuadRootsReal()
63 sk_doubles_nearly_equal_ulps(expectedRoots[i], roots[i], 64), in testQuadRootsReal()
[all …]
|
| /external/eigen/unsupported/doc/examples/ |
| D | PolynomialSolver1.cpp | 12 Vector5d roots = Vector5d::Random(); in main() local
13 cout << "Roots: " << roots.transpose() << endl; in main()
15 roots_to_monicPolynomial( roots, polynomial ); in main()
18 cout << "Complex roots: " << psolve.roots().transpose() << endl; in main()
23 cout << "Real roots: " << mapRR.transpose() << endl; in main()
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl; in main()
35 …for( int i=0; i<6; ++i ){ evals[i] = std::abs( poly_eval( hardCase_polynomial, psolvef.roots()[i] … in main()
36 …cout << "Norms of the evaluations of the polynomial at the roots: " << evals.transpose() << endl <… in main()
41 cout << "Complex roots: " << psolve6d.roots().transpose() << endl; in main()
44 std::complex<float> castedRoot( psolve6d.roots()[i].real(), psolve6d.roots()[i].imag() ); in main()
[all …]
|
| D | PolynomialUtils1.cpp | 9 Vector4d roots = Vector4d::Random(); in main() local
10 cout << "Roots: " << roots.transpose() << endl; in main()
12 roots_to_monicPolynomial( roots, polynomial ); in main()
18 evaluation[i] = poly_eval( polynomial, roots[i] ); } in main()
19 cout << "Evaluation of the polynomial at the roots: " << evaluation.transpose(); in main()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsRect.cpp | 18 int roots = 0; in setBounds() local
20 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); in setBounds()
23 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
25 for (int index = 0; index < roots; ++index) { in setBounds()
35 int roots = 0; in setBounds() local
37 roots = SkDConic::FindExtrema(&sub[0].fX, sub.fWeight, tValues); in setBounds()
40 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); in setBounds()
42 for (int index = 0; index < roots; ++index) { in setBounds()
52 int roots = 0; in setBounds() local
54 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues); in setBounds()
[all …]
|
| D | SkPathOpsCurve.h | 366 static int line_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { in line_intercept_h() argument
371 roots[0] = SkIntersections::HorizontalIntercept(line.set(a), y); in line_intercept_h()
372 return between(0, roots[0], 1); in line_intercept_h()
375 static int line_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { in line_intercept_v() argument
380 roots[0] = SkIntersections::VerticalIntercept(line.set(a), x); in line_intercept_v()
381 return between(0, roots[0], 1); in line_intercept_v()
384 static int quad_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { in quad_intercept_h() argument
386 return SkIntersections::HorizontalIntercept(quad.set(a), y, roots); in quad_intercept_h()
389 static int quad_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { in quad_intercept_v() argument
391 return SkIntersections::VerticalIntercept(quad.set(a), x, roots); in quad_intercept_v()
[all …]
|
| D | SkDCubicLineIntersection.cpp | 130 int intersectRay(double roots[3]) { in intersectRay()
140 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in intersectRay()
142 SkDPoint calcPt = c.ptAtT(roots[index]); in intersectRay()
150 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots); in intersectRay()
163 int roots = intersectRay(rootVals); in intersect() local
164 for (int index = 0; index < roots; ++index) { in intersect()
176 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { in HorizontalIntersect()
180 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in HorizontalIntersect()
182 SkDPoint calcPt = c.ptAtT(roots[index]); in HorizontalIntersect()
186 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots); in HorizontalIntersect()
[all …]
|
| /external/dagger2/java/dagger/hilt/processor/internal/root/ir/ |
| D | AggregatedRootIrValidator.kt | 21 // Validates roots being processed.
30 val processedRootNames = processedRoots.flatMap { it.roots }.toSet() in rootsToProcess()
40 "Cannot process multiple app roots in the same compilation unit: " + in rootsToProcess()
47 Cannot process test roots and app roots in the same compilation unit: in rootsToProcess()
49 Test roots in this compilation unit: ${testRootsToProcess.rootsToString()} in rootsToProcess()
53 // Perform validation across roots previous compilation units. in rootsToProcess()
63 Cannot process new roots when there are test roots from a previous compilation unit: in rootsToProcess()
64 Test roots from previous compilation unit: ${alreadyProcessedTestRoots.rootsToString()} in rootsToProcess()
65 All roots from this compilation unit: ${rootsToProcess.rootsToString()} in rootsToProcess()
77 Cannot process new app roots when there are app roots from a previous compilation unit: in rootsToProcess()
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math3/complex/ |
| D | RootsOfUnity.java | 29 * A helper class for the computation and caching of the {@code n}-th roots of unity.
38 /** Number of roots of unity. */
41 /** Real part of the roots. */
45 * Imaginary part of the {@code n}-th roots of unity, for positive values of {@code n}. In this
46 * array, the roots are stored in counter-clockwise order.
51 * Imaginary part of the {@code n}-th roots of unity, for negative values of {@code n}. In this
52 * array, the roots are stored in clockwise order.
58 * {@code n}. In this case, counter-clockwise ordering of the roots of unity should be used.
62 /** Build an engine for computing the {@code n}-th roots of unity. */
74 * argument {@code n}. If {@code true}, then counter-clockwise ordering of the roots of unity
[all …]
|
| /external/tensorflow/tensorflow/core/profiler/internal/ |
| D | tfprof_scope.cc | 62 std::vector<ScopeNode*> roots; in Build() local
63 // Found roots, which are nodes without "/". in Build()
68 roots.push_back(node); in Build()
76 root_->children.assign(roots.begin(), roots.end()); in Build()
86 std::vector<ScopeNode*> roots = Account(root_->children, opts); in ShowInternal() local
88 for (ScopeNode* n : roots) { in ShowInternal()
94 roots = SearchRoot(roots, opts.start_name_regexes); in ShowInternal()
97 root_->show_children.assign(roots.begin(), roots.end()); in ShowInternal()
109 void TFScope::Format(const std::vector<ScopeNode*> roots, string* display_str, in Format() argument
111 for (ScopeNode* node : roots) { in Format()
[all …]
|
| D | tfprof_graph.cc | 62 std::vector<GraphNode*> roots; in Build() local
65 roots.push_back(it->second.get()); in Build()
69 root_->children.insert(root_->children.end(), roots.begin(), roots.end()); in Build()
90 std::vector<GraphNode*> roots = Account(root_->children, opts, &visits); in ShowInternal() local
91 for (GraphNode* n : roots) { in ShowInternal()
99 roots = SearchRoot(roots, opts.start_name_regexes, &visits); in ShowInternal()
105 root_->show_children.assign(roots.begin(), roots.end()); in ShowInternal()
119 const std::vector<GraphNode*>& roots, const std::vector<string>& regexes, in SearchRoot() argument
122 if (roots.empty()) { in SearchRoot()
125 for (GraphNode* root : roots) { in SearchRoot()
[all …]
|
| /external/skia/src/base/ |
| D | SkQuads.h | 39 * Calculate the roots of a quadratic.
42 * calculate the roots.
45 * roots are the same. It returns the discriminant and the two roots.
49 * Roots(A, -0.5*B, C)
50 * to find the roots of A*x^2 + B*x + C.
52 * The method used to calculate the roots is from
56 * If the roots are imaginary then nan is returned.
57 * If the roots can't be represented as double then inf is returned.
59 static RootResult Roots(double A, double B, double C);
|
| D | SkCubics.cpp | 27 // precise about the smaller 2 roots, so we have this arbitrary cutoff for when A is
78 // In either case, we have no finite roots. in RootsReal()
84 double* roots = solution; in RootsReal() local
85 if (R2MinusQ3 < 0) { // we have 3 real roots in RootsReal()
91 *roots++ = r; in RootsReal()
95 *roots++ = r; in RootsReal()
99 (roots - solution == 1 || !nearly_equal(solution[1], r))) { in RootsReal()
100 *roots++ = r; in RootsReal()
113 *roots++ = r; in RootsReal()
118 *roots++ = r; in RootsReal()
[all …]
|
| /external/eigen/unsupported/test/ |
| D | polynomialsolver.cpp | 55 const RootsType& roots( psolve.roots() ); in aux_evalSolver() local
59 for( int i=0; i<roots.size(); ++i ){ in aux_evalSolver()
60 evr[i] = std::abs( poly_eval( pols, roots[i] ) ); in aux_evalSolver()
61 der[i] = numext::maxi(RealScalar(1.), std::abs( poly_eval( pols_der, roots[i] ) )); in aux_evalSolver()
72 cerr << "Roots found: " << roots.transpose() << endl; in aux_evalSolver()
73 cerr << "Abs value of the polynomial at the roots: " << evr.transpose() << endl; in aux_evalSolver()
77 std::vector<RealScalar> rootModuli( roots.size() ); in aux_evalSolver()
78 Map< EvalRootsType > aux( &rootModuli[0], roots.size() ); in aux_evalSolver()
79 aux = roots.array().abs(); in aux_evalSolver()
112 template< int Deg, typename POLYNOMIAL, typename ROOTS, typename REAL_ROOTS >
[all …]
|
| D | polynomialutils.cpp | 36 EvalRootsType roots = EvalRootsType::Random(deg); in realRoots_to_monicPolynomial_test() local
37 roots_to_monicPolynomial( roots, pols ); in realRoots_to_monicPolynomial_test()
40 for( int i=0; i<roots.size(); ++i ){ in realRoots_to_monicPolynomial_test()
41 evr[i] = std::abs( poly_eval( pols, roots[i] ) ); } in realRoots_to_monicPolynomial_test()
74 EvalRootsType roots = EvalRootsType::Random(deg); in CauchyBounds() local
75 roots_to_monicPolynomial( roots, pols ); in CauchyBounds()
78 _Scalar Max = roots.array().abs().maxCoeff(); in CauchyBounds()
79 _Scalar min = roots.array().abs().minCoeff(); in CauchyBounds()
83 cerr << "Roots: " << roots << endl; in CauchyBounds()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | ShadowStackGCLowering.cpp | 53 /// roots.
60 /// Roots - GC roots in the current function. Each is a pair of the
62 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in __anon43a8607b0111::ShadowStackGCLowering
109 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap()
110 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); in GetFrameMap()
120 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap()
160 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType()
161 EltTys.push_back(Roots[I].second->getAllocatedType()); in GetConcreteStackEntryType()
180 // int32_t NumRoots; // Number of roots in stack frame. in doInitialization()
182 // void *Meta[]; // May be absent for roots without metadata. in doInitialization()
[all …]
|
| /external/rust/android-crates-io/crates/tonic/src/transport/service/ |
| D | tls.rs | 42 let mut roots = RootCertStore::empty(); in new() localVariable
44 #[cfg(feature = "tls-roots")] in new()
45 roots.add_parsable_certificates(rustls_native_certs::load_native_certs()?); in new()
47 #[cfg(feature = "tls-webpki-roots")] in new()
48 roots.extend(webpki_roots::TLS_SERVER_ROOTS.iter().cloned()); in new()
51 add_certs_from_pem(&mut Cursor::new(cert), &mut roots)?; in new()
54 let builder = builder.with_root_certificates(roots); in new()
109 let mut roots = RootCertStore::empty(); in new() localVariable
110 add_certs_from_pem(&mut Cursor::new(cert), &mut roots)?; in new()
112 WebPkiClientVerifier::builder(roots.into()).allow_unauthenticated() in new()
[all …]
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| D | PolynomialSolver.h | 20 * - real roots,
21 * - greatest, smallest complex roots,
22 * - real roots with greatest, smallest absolute real value,
23 * - greatest, smallest real roots.
25 * It stores the set of roots as a vector of complexes.
54 /** \returns the complex roots of the polynomial */
55 inline const RootsType& roots() const { return m_roots; } in roots() function
58 /** Clear and fills the back insertion sequence with the real roots of the polynomial
59 * i.e. the real part of the complex roots that have an imaginary part which
307 * Computes the complex roots of a real polynomial.
[all …]
|
| /external/swiftshader/third_party/llvm-16.0/llvm/lib/CodeGen/ |
| D | ShadowStackGCLowering.cpp | 55 /// roots.
62 /// Roots - GC roots in the current function. Each is a pair of the
64 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in __anon1f6f52410111::ShadowStackGCLowering
114 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap()
115 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); in GetFrameMap()
125 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap()
165 for (const std::pair<CallInst *, AllocaInst *> &Root : Roots) in GetConcreteStackEntryType()
185 // int32_t NumRoots; // Number of roots in stack frame. in doInitialization()
187 // void *Meta[]; // May be absent for roots without metadata. in doInitialization()
200 // void *Roots[]; // Stack roots (in-place array, so we pretend). in doInitialization()
[all …]
|
| /external/stg/ |
| D | stgdiff.cc | 55 std::vector<stg::Id> roots; in Read() local
57 roots.push_back(stg::Read(runtime, graph, format, filename, options, in Read()
60 return roots; in Read()
64 const std::vector<stg::Id>& roots) { in RunFidelity() argument
67 stg::GetFidelityTransitions(graph, roots[0], roots[1]); in RunFidelity()
78 const std::vector<stg::Id>& roots) { in RunExact() argument
96 return stg::Equals<PairCache>(graph, equalities)(roots[0], roots[1]) in RunExact()
102 const std::vector<stg::Id>& roots, const Outputs& outputs, in Run() argument
110 runtime, ignore, graph, roots[0], roots[1], outcomes); in Run()
135 status |= RunFidelity(*fidelity, graph, roots); in Run()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | ShadowStackGCLowering.cpp | 35 /// roots.
43 /// Roots - GC roots in the current function. Each is a pair of the
45 std::vector<std::pair<CallInst *, AllocaInst *>> Roots; member in __anon1f7a0e990111::ShadowStackGCLowering
206 for (unsigned I = 0; I != Roots.size(); ++I) { in GetFrameMap()
207 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1)); in GetFrameMap()
217 ConstantInt::get(Int32Ty, Roots.size(), false), in GetFrameMap()
257 for (size_t I = 0; I != Roots.size(); I++) in GetConcreteStackEntryType()
258 EltTys.push_back(Roots[I].second->getAllocatedType()); in GetConcreteStackEntryType()
277 // int32_t NumRoots; // Number of roots in stack frame. in doInitialization()
279 // void *Meta[]; // May be absent for roots without metadata. in doInitialization()
[all …]
|
| /external/rust/android-crates-io/crates/num-integer/src/ |
| D | roots.rs | 7 pub trait Roots: Integer { trait
20 /// # use num_integer::Roots;
27 /// # use num_integer::Roots;
34 /// use num_integer::Roots;
65 /// # use num_integer::Roots;
72 /// use num_integer::Roots;
94 /// use num_integer::Roots;
112 /// see [Roots::sqrt](trait.Roots.html#method.sqrt).
114 pub fn sqrt<T: Roots>(x: T) -> T { in sqrt()
119 /// see [Roots::cbrt](trait.Roots.html#method.cbrt).
[all …]
|
| /external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/Support/ |
| D | GenericDomTreeConstruction.h | 60 using RootsT = decltype(DomTreeT::Roots);
335 // For postdominators, nodes with no forward successors are trivial roots that
336 // are always selected as tree roots. Roots with forward successors correspond
348 // Finds all roots without relaying on the set of roots already stored in the
350 // We define roots to be some non-redundant set of the CFG nodes
353 RootsT Roots; in FindRoots() local
357 Roots.push_back(GetEntryNode(DT)); in FindRoots()
358 return Roots; in FindRoots()
367 LLVM_DEBUG(dbgs() << "\t\tLooking for trivial roots\n"); in FindRoots()
369 // Step #1: Find all the trivial roots that are going to will definitely in FindRoots()
[all …]
|