| /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()
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()
40 SkASSERT_RELEASE(roots[i] >= 0.0); in fuzz_cubic_roots_valid_t()
[all …]
|
| D | FuzzQuadRoots.cpp | 18 double roots[2]; in fuzz_quad_real_roots() local
19 const int numSolutions = SkQuads::RootsReal(A, B, C, roots); in fuzz_quad_real_roots()
22 SkASSERT_RELEASE(std::isfinite(roots[i])); in fuzz_quad_real_roots()
32 SkASSERT_RELEASE(!sk_doubles_nearly_equal_ulps(roots[0], roots[1])); in fuzz_quad_real_roots()
|
| /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/tests/ |
| D | CubicRootsTest.cpp | 51 double roots[3] = {0, 0, 0}; in testCubicRootsReal() local
52 int rootCount = SkDCubic::RootsReal(A, B, C, D, roots); 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()
67 "%.16f != %.16f at index %d", expectedRoots[i], roots[i], i); in testCubicRootsReal()
73 double roots[3] = {0, 0, 0}; in testCubicRootsReal() local
74 int rootCount = SkCubics::RootsReal(A, B, C, D, roots); in testCubicRootsReal()
81 std::sort(std::begin(roots), std::begin(roots) + rootCount); in testCubicRootsReal()
[all …]
|
| D | QuadRootsTest.cpp | 48 double roots[2] = {0, 0}; in testQuadRootsReal() local
49 int rootCount = SkDQuad::RootsReal(A, B, C, roots); 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()
64 "%.16f != %.16f at index %d", expectedRoots[i], roots[i], i); in testQuadRootsReal()
70 double roots[2] = {0, 0}; in testQuadRootsReal() local
71 int rootCount = SkQuads::RootsReal(A, B, C, roots); in testQuadRootsReal()
78 std::sort(std::begin(roots), std::begin(roots) + rootCount); in testQuadRootsReal()
[all …]
|
| /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 | 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 …]
|
| D | SkDQuadLineIntersection.cpp | 147 int intersectRay(double roots[2]) { in intersectRay()
174 return SkDQuad::RootsValidT(A, 2 * B, C, roots); in intersectRay()
183 int roots = intersectRay(rootVals); in intersect() local
184 for (int index = 0; index < roots; ++index) { in intersect()
196 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect()
203 return SkDQuad::RootsValidT(D, 2 * E, F, roots); in horizontalIntersect()
212 int roots = horizontalIntersect(axisIntercept, rootVals); in horizontalIntersect() local
213 for (int index = 0; index < roots; ++index) { in horizontalIntersect()
252 int verticalIntersect(double axisIntercept, double roots[2]) { in verticalIntersect()
259 return SkDQuad::RootsValidT(D, 2 * E, F, roots); in verticalIntersect()
[all …]
|
| D | SkDConicLineIntersection.cpp | 79 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect()
81 return this->validT(conicVals, axisIntercept, roots); in horizontalIntersect()
89 double roots[2]; in horizontalIntersect() local
90 int count = this->horizontalIntersect(axisIntercept, roots); in horizontalIntersect()
92 double conicT = roots[index]; in horizontalIntersect()
115 int roots = this->intersectRay(rootVals); in intersect() local
116 for (int index = 0; index < roots; ++index) { in intersect()
137 int intersectRay(double roots[2]) { in intersectRay()
144 return this->validT(r, 0, roots); in intersectRay()
147 int validT(double r[3], double axisIntercept, double roots[2]) { in validT()
[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 …]
|
| /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()
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()
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()
50 …cout << "The last root in float then in double: " << psolvef.roots()[5] << "\t" << psolve6d.roots(… in main()
51 std::complex<float> castedRoot( psolve6d.roots()[5].real(), psolve6d.roots()[5].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()
|
| /external/tensorflow/tensorflow/core/profiler/internal/ |
| D | tfprof_scope.cc | 62 std::vector<ScopeNode*> roots; in Build() local
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()
120 std::vector<ScopeNode*> roots, const std::vector<string>& regexes) { in SearchRoot() argument
[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/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/perfetto/src/trace_processor/perfetto_sql/stdlib/intervals/ |
| D | overlap.sql | 203 _roots AS (
226 FROM _roots
233 _roots.root_id,
234 _roots.root_ts,
235 _roots.root_dur,
241 JOIN _roots
254 JOIN _roots
277 _roots AS (
300 _roots.id AS root_id,
301 _roots.ts AS root_ts,
[all …]
|
| /external/eigen/unsupported/test/ |
| 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()
|
| 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()
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()
113 void evalSolverSugarFunction( const POLYNOMIAL& pols, const ROOTS& roots, const REAL_ROOTS& real_ro… in evalSolverSugarFunction() argument
147 VERIFY( internal::isApprox( roots.array().abs().maxCoeff(), in evalSolverSugarFunction()
[all …]
|
| /external/rust/android-crates-io/crates/tonic/src/transport/service/ |
| D | tls.rs | 42 let mut roots = RootCertStore::empty(); in new() localVariable
45 roots.add_parsable_certificates(rustls_native_certs::load_native_certs()?); 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()
114 WebPkiClientVerifier::builder(roots.into()) in new()
176 roots: &mut RootCertStore, in add_certs_from_pem()
[all …]
|
| /external/skia/src/base/ |
| D | SkCubics.cpp | 84 double* roots = solution; in RootsReal() local
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()
122 return static_cast<int>(roots - solution); in RootsReal()
162 double roots[2] = {0, 0}; in find_extrema_valid_t() local
163 int numRoots = SkQuads::RootsReal(3*A, 2*B, C, roots); in find_extrema_valid_t()
[all …]
|
| /external/skia/src/gpu/tessellate/ |
| D | Tessellation.cpp | 320 float2 roots = float2{q,c} / float2{a,q}; in FindCubicConvex180Chops()
322 auto inside = (roots > kEpsilon) & (roots < (1 - kEpsilon)); in FindCubicConvex180Chops()
324 if (inside[1] && roots[0] != roots[1]) { in FindCubicConvex180Chops()
325 if (roots[0] > roots[1]) { in FindCubicConvex180Chops()
326 roots = skvx::shuffle<1,0>(roots); // Sort. in FindCubicConvex180Chops()
328 roots.store(T); in FindCubicConvex180Chops()
331 T[0] = roots[0]; in FindCubicConvex180Chops()
335 T[0] = roots[1]; in FindCubicConvex180Chops()
|
| /external/cronet/tot/third_party/boringssl/src/pki/ |
| D | verify_unittest.cc | 53 std::unique_ptr<VerifyTrustStore> roots = MozillaRootStore(); in TEST() local
54 opts.trust_store = roots.get(); in TEST()
83 std::unique_ptr<VerifyTrustStore> roots = MozillaRootStore(); in TEST() local
84 opts.trust_store = roots.get(); in TEST()
106 std::unique_ptr<VerifyTrustStore> roots = MozillaRootStore(); in TEST() local
107 opts.trust_store = roots.get(); in TEST()
127 std::unique_ptr<VerifyTrustStore> roots = MozillaRootStore(); in TEST() local
128 opts.trust_store = roots.get(); in TEST()
|
| /external/cronet/stable/third_party/boringssl/src/pki/ |
| D | verify_unittest.cc | 53 std::unique_ptr<VerifyTrustStore> roots = MozillaRootStore(); in TEST() local
54 opts.trust_store = roots.get(); in TEST()
83 std::unique_ptr<VerifyTrustStore> roots = MozillaRootStore(); in TEST() local
84 opts.trust_store = roots.get(); in TEST()
106 std::unique_ptr<VerifyTrustStore> roots = MozillaRootStore(); in TEST() local
107 opts.trust_store = roots.get(); in TEST()
127 std::unique_ptr<VerifyTrustStore> roots = MozillaRootStore(); in TEST() local
128 opts.trust_store = roots.get(); in TEST()
|
| /external/perfetto/src/trace_processor/importers/memory_tracker/ |
| D | graph.cc | 60 std::vector<Node*> roots; in VisitInDepthFirstPreOrder() local
63 roots.push_back(it->second->root()); in VisitInDepthFirstPreOrder()
65 roots.push_back(shared_memory_graph_->root()); in VisitInDepthFirstPreOrder()
66 return PreOrderIterator{std::move(roots)}; in VisitInDepthFirstPreOrder()
70 std::vector<Node*> roots; in VisitInDepthFirstPostOrder() local
73 roots.push_back(it->second->root()); in VisitInDepthFirstPostOrder()
75 roots.push_back(shared_memory_graph_->root()); in VisitInDepthFirstPostOrder()
76 return PostOrderIterator(std::move(roots)); in VisitInDepthFirstPostOrder()
189 PreOrderIterator::PreOrderIterator(std::vector<Node*>&& roots) in PreOrderIterator() argument
190 : to_visit_(std::move(roots)) {} in PreOrderIterator()
[all …]
|
| /external/webrtc/tools_webrtc/sslroots/ |
| D | README.md | 4 [rtc_base/ssl_roots.h][ssl-roots-header], to update the SSL roots shipped
7 1. Download roots.pem from [pki.goog][pki-goog] or [curl.se][mozilla-cacert]
19 [ssl-roots-header]: https://cs.chromium.org/chromium/src/third_party/webrtc/rtc_base/ssl_roots.h
20 [pki-goog]: https://www.google.com/url?q=https://pki.google.com/roots.pem
|