| /third_party/flutter/skia/src/pathops/ |
| D | SkPathOpsRect.cpp | 17 int roots = 0; in setBounds() local
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); in setBounds()
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
24 for (int index = 0; index < roots; ++index) { in setBounds()
34 int roots = 0; in setBounds() local
36 roots = SkDConic::FindExtrema(&sub[0].fX, sub.fWeight, tValues); in setBounds()
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); in setBounds()
41 for (int index = 0; index < roots; ++index) { in setBounds()
51 int roots = 0; in setBounds() local
53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues); in setBounds()
[all …]
|
| D | SkDCubicLineIntersection.cpp | 121 int intersectRay(double roots[3]) { in intersectRay()
131 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in intersectRay()
133 SkDPoint calcPt = c.ptAtT(roots[index]); in intersectRay()
141 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots); in intersectRay()
154 int roots = intersectRay(rootVals); in intersect() local
155 for (int index = 0; index < roots; ++index) { in intersect()
167 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { in HorizontalIntersect()
171 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in HorizontalIntersect()
173 SkDPoint calcPt = c.ptAtT(roots[index]); in HorizontalIntersect()
177 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots); in HorizontalIntersect()
[all …]
|
| D | SkDQuadLineIntersection.cpp | 139 int intersectRay(double roots[2]) { in intersectRay()
166 return SkDQuad::RootsValidT(A, 2 * B, C, roots); in intersectRay()
175 int roots = intersectRay(rootVals); in intersect() local
176 for (int index = 0; index < roots; ++index) { in intersect()
188 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect()
195 return SkDQuad::RootsValidT(D, 2 * E, F, roots); in horizontalIntersect()
204 int roots = horizontalIntersect(axisIntercept, rootVals); in horizontalIntersect() local
205 for (int index = 0; index < roots; ++index) { in horizontalIntersect()
244 int verticalIntersect(double axisIntercept, double roots[2]) { in verticalIntersect()
251 return SkDQuad::RootsValidT(D, 2 * E, F, roots); in verticalIntersect()
[all …]
|
| D | SkDConicLineIntersection.cpp | 67 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect()
69 return this->validT(conicVals, axisIntercept, roots); in horizontalIntersect()
77 double roots[2]; in horizontalIntersect() local
78 int count = this->horizontalIntersect(axisIntercept, roots); in horizontalIntersect()
80 double conicT = roots[index]; in horizontalIntersect()
103 int roots = this->intersectRay(rootVals); in intersect() local
104 for (int index = 0; index < roots; ++index) { in intersect()
125 int intersectRay(double roots[2]) { in intersectRay()
132 return this->validT(r, 0, roots); in intersectRay()
135 int validT(double r[3], double axisIntercept, double roots[2]) { in validT()
[all …]
|
| D | SkPathOpsCurve.h | 360 static int line_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { in line_intercept_h() argument
365 roots[0] = SkIntersections::HorizontalIntercept(line.set(a), y); in line_intercept_h()
366 return between(0, roots[0], 1); in line_intercept_h()
369 static int line_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { in line_intercept_v() argument
374 roots[0] = SkIntersections::VerticalIntercept(line.set(a), x); in line_intercept_v()
375 return between(0, roots[0], 1); in line_intercept_v()
378 static int quad_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { in quad_intercept_h() argument
380 return SkIntersections::HorizontalIntercept(quad.set(a), y, roots); in quad_intercept_h()
383 static int quad_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { in quad_intercept_v() argument
385 return SkIntersections::VerticalIntercept(quad.set(a), x, roots); in quad_intercept_v()
[all …]
|
| D | SkPathOpsAsWinding.cpp | 109 int roots = 0; in left_edge() local
117 roots = SkDQuad::FindExtrema(&quad[0].fX, &t); in left_edge()
119 if (roots) { in left_edge()
130 roots = SkDConic::FindExtrema(&conic[0].fX, weight, &t); in left_edge()
132 if (roots) { in left_edge()
145 roots = SkDCubic::FindExtrema(&cubic[0].fX, tValues); in left_edge()
146 SkASSERT(roots <= 2); in left_edge()
147 for (int index = 0; index < roots; ++index) { in left_edge()
155 if (roots) { in left_edge()
|
| /third_party/skia/src/pathops/ |
| D | SkPathOpsRect.cpp | 17 int roots = 0; in setBounds() local
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); in setBounds()
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
24 for (int index = 0; index < roots; ++index) { in setBounds()
34 int roots = 0; in setBounds() local
36 roots = SkDConic::FindExtrema(&sub[0].fX, sub.fWeight, tValues); in setBounds()
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); in setBounds()
41 for (int index = 0; index < roots; ++index) { in setBounds()
51 int roots = 0; in setBounds() local
53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues); in setBounds()
[all …]
|
| D | SkDCubicLineIntersection.cpp | 121 int intersectRay(double roots[3]) { in intersectRay()
131 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in intersectRay()
133 SkDPoint calcPt = c.ptAtT(roots[index]); in intersectRay()
141 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots); in intersectRay()
154 int roots = intersectRay(rootVals); in intersect() local
155 for (int index = 0; index < roots; ++index) { in intersect()
167 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { in HorizontalIntersect()
171 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in HorizontalIntersect()
173 SkDPoint calcPt = c.ptAtT(roots[index]); in HorizontalIntersect()
177 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots); in HorizontalIntersect()
[all …]
|
| D | SkDQuadLineIntersection.cpp | 139 int intersectRay(double roots[2]) { in intersectRay()
166 return SkDQuad::RootsValidT(A, 2 * B, C, roots); in intersectRay()
175 int roots = intersectRay(rootVals); in intersect() local
176 for (int index = 0; index < roots; ++index) { in intersect()
188 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect()
195 return SkDQuad::RootsValidT(D, 2 * E, F, roots); in horizontalIntersect()
204 int roots = horizontalIntersect(axisIntercept, rootVals); in horizontalIntersect() local
205 for (int index = 0; index < roots; ++index) { in horizontalIntersect()
244 int verticalIntersect(double axisIntercept, double roots[2]) { in verticalIntersect()
251 return SkDQuad::RootsValidT(D, 2 * E, F, roots); in verticalIntersect()
[all …]
|
| D | SkDConicLineIntersection.cpp | 67 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect()
69 return this->validT(conicVals, axisIntercept, roots); in horizontalIntersect()
77 double roots[2]; in horizontalIntersect() local
78 int count = this->horizontalIntersect(axisIntercept, roots); in horizontalIntersect()
80 double conicT = roots[index]; in horizontalIntersect()
103 int roots = this->intersectRay(rootVals); in intersect() local
104 for (int index = 0; index < roots; ++index) { in intersect()
125 int intersectRay(double roots[2]) { in intersectRay()
132 return this->validT(r, 0, roots); in intersectRay()
135 int validT(double r[3], double axisIntercept, double roots[2]) { in validT()
[all …]
|
| D | SkPathOpsCurve.h | 360 static int line_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { in line_intercept_h() argument
365 roots[0] = SkIntersections::HorizontalIntercept(line.set(a), y); in line_intercept_h()
366 return between(0, roots[0], 1); in line_intercept_h()
369 static int line_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { in line_intercept_v() argument
374 roots[0] = SkIntersections::VerticalIntercept(line.set(a), x); in line_intercept_v()
375 return between(0, roots[0], 1); in line_intercept_v()
378 static int quad_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { in quad_intercept_h() argument
380 return SkIntersections::HorizontalIntercept(quad.set(a), y, roots); in quad_intercept_h()
383 static int quad_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { in quad_intercept_v() argument
385 return SkIntersections::VerticalIntercept(quad.set(a), x, roots); in quad_intercept_v()
[all …]
|
| D | SkPathOpsAsWinding.cpp | 110 int roots = 0; in left_edge() local
118 roots = SkDQuad::FindExtrema(&quad[0].fX, &t); in left_edge()
120 if (roots) { in left_edge()
131 roots = SkDConic::FindExtrema(&conic[0].fX, weight, &t); in left_edge()
133 if (roots) { in left_edge()
146 roots = SkDCubic::FindExtrema(&cubic[0].fX, tValues); in left_edge()
147 SkASSERT(roots <= 2); in left_edge()
148 for (int index = 0; index < roots; ++index) { in left_edge()
156 if (roots) { in left_edge()
|
| /third_party/boost/boost/heap/ |
| D | fibonacci_heap.hpp | 243 roots.splice(roots.begin(), rhs.roots); in fibonacci_heap()
253 roots.splice(roots.begin(), rhs.roots); in operator =()
285 return roots.empty(); in empty()
297 return detail::count_list_nodes<node, node_list_type>(roots); in size()
311 roots.clear_and_dispose(disposer(*this)); in clear()
328 roots.swap(rhs.roots); in swap()
355 roots.push_front(*n); in push()
379 roots.push_front(*n); in emplace()
398 roots.erase(node_list_type::s_iterator_to(*element)); in pop()
453 roots.splice(roots.begin(), parent->children, node_list_type::s_iterator_to(*n)); in update_lazy()
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | typeFromPropertyAssignmentOutOfOrder.symbols | 4 >First : Symbol(First, Decl(index.js, 0, 0), Decl(roots.js, 0, 3))
10 >Common : Symbol(Common, Decl(index.js, 0, 23), Decl(roots.js, 1, 3))
13 >First : Symbol(First, Decl(index.js, 0, 0), Decl(roots.js, 0, 3))
18 >Workspace : Symbol(Workspace, Decl(index.js, 1, 43), Decl(roots.js, 2, 3))
21 >Common : Symbol(Common, Decl(index.js, 0, 23), Decl(roots.js, 1, 3))
28 === tests/cases/conformance/salsa/roots.js ===
30 >First : Symbol(First, Decl(index.js, 0, 0), Decl(roots.js, 0, 3))
33 >Common : Symbol(Common, Decl(index.js, 0, 23), Decl(roots.js, 1, 3))
36 >Workspace : Symbol(Workspace, Decl(index.js, 1, 43), Decl(roots.js, 2, 3))
|
| /third_party/boost/boost/graph/distributed/ |
| D | connected_components.hpp | 176 std::vector<meta_vertex_descriptor> roots(num_comp, graph_traits<metaGraph>::null_vertex()); in build_local_metagraph() local
180 if (roots[component] == graph_traits<metaGraph>::null_vertex() || in build_local_metagraph()
181 get(meta_index, v) < get(meta_index, roots[component])) in build_local_metagraph()
182 roots[component] = v; in build_local_metagraph()
188 put(p, get(metaVertexMap, v), get(metaVertexMap, roots[get(mg_component, v)])); in build_local_metagraph()
347 roots(num_comp, graph_traits<DistributedGraph>::null_vertex()); in parallel_connected_components() local
351 if (roots[component] == graph_traits<DistributedGraph>::null_vertex() || in parallel_connected_components()
352 get(local_index, v) < get(local_index, roots[component])) in parallel_connected_components()
353 roots[component] = v; in parallel_connected_components()
358 put(p, v, roots[get(ls_component, v)]); in parallel_connected_components()
[all …]
|
| /third_party/flutter/skia/src/core/ |
| D | SkGeometry.cpp | 74 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]) { in SkFindUnitQuadRoots()
75 SkASSERT(roots); in SkFindUnitQuadRoots()
78 return return_check_zero(valid_unit_divide(-C, B, roots)); in SkFindUnitQuadRoots()
81 SkScalar* r = roots; in SkFindUnitQuadRoots()
97 if (r - roots == 2) { in SkFindUnitQuadRoots()
98 if (roots[0] > roots[1]) { in SkFindUnitQuadRoots()
100 swap(roots[0], roots[1]); in SkFindUnitQuadRoots()
101 } else if (roots[0] == roots[1]) { // nearly-equal? in SkFindUnitQuadRoots()
105 return return_check_zero((int)(r - roots)); in SkFindUnitQuadRoots()
427 const SkScalar tValues[], int roots) { in SkChopCubicAt() argument
[all …]
|
| /third_party/mesa3d/src/mapi/new/ |
| D | genCommon.py | 63 roots = [ etree.parse(xmlFile).getroot() for xmlFile in xmlFiles ]
64 return getFunctionsFromRoots(roots)
66 def getFunctionsFromRoots(roots): argument
68 for root in roots:
97 def getExportNamesFromRoots(target, roots): argument
107 return set(func.name for func in getFunctionsFromRoots(roots))
110 for root in roots:
|
| /third_party/boost/libs/math/example/ |
| D | airy_zeros_example.cpp | 100 std::vector<double> roots; in main() local
101 boost::math::airy_ai_zero<double>(1U, n_roots, std::back_inserter(roots)); in main()
103 std::copy(roots.begin(), in main()
104 roots.end(), in main()
|
| D | bessel_zeros_example_1.cpp | 153 std::vector<double> roots; in main() local
154 boost::math::cyl_bessel_j_zero(2.0, 1, n_roots, std::back_inserter(roots)); in main()
155 std::copy(roots.begin(), in main()
156 roots.end(), in main()
|
| D | daubechies_coefficients.cpp | 57 …std::vector<Complex> roots(p-1, {std::numeric_limits<Real>::quiet_NaN(),std::numeric_limits<Real>:… in find_roots() local
106 BOOST_ASSERT(i < roots.size()); in find_roots()
107 roots[i] = r; in find_roots()
143 Complex y = roots[i]; in find_roots()
213 auto roots = find_roots<Complex>(p); in main() local
214 auto h = daubechies_coefficients(roots); in main()
|
| /third_party/skia/src/core/ |
| D | SkGeometry.cpp | 78 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]) { in SkFindUnitQuadRoots()
79 SkASSERT(roots); in SkFindUnitQuadRoots()
82 return return_check_zero(valid_unit_divide(-C, B, roots)); in SkFindUnitQuadRoots()
85 SkScalar* r = roots; in SkFindUnitQuadRoots()
101 if (r - roots == 2) { in SkFindUnitQuadRoots()
102 if (roots[0] > roots[1]) { in SkFindUnitQuadRoots()
104 swap(roots[0], roots[1]); in SkFindUnitQuadRoots()
105 } else if (roots[0] == roots[1]) { // nearly-equal? in SkFindUnitQuadRoots()
109 return return_check_zero((int)(r - roots)); in SkFindUnitQuadRoots()
686 int roots = SkFindCubicExtrema(src[0].fY, src[1].fY, src[2].fY, in SkChopCubicAtYExtrema() local
[all …]
|
| /third_party/ltp/lib/ |
| D | tst_cgroup.c | 142 static struct cgroup_root roots[ROOTS_MAX + 1]; variable
211 (roots[0].ver ? roots : roots + 1)
215 for ((r) = roots + 1; (r)->ver; (r)++)
247 return !!roots[0].ver; in cgroup_v2_mounted()
252 return !!roots[1].ver; in cgroup_v1_mounted()
360 struct cgroup_root *root = roots; in cgroup_root_scan()
414 if (root >= roots + ROOTS_MAX) { in cgroup_root_scan()
472 roots[0].mnt_dir.we_created_it = 1; in cgroup_mount_v2()
493 roots[0].we_mounted_it = 1; in cgroup_mount_v2()
499 if (roots[0].mnt_dir.we_created_it) { in cgroup_mount_v2()
[all …]
|
| /third_party/openssl/test/ |
| D | crltest.c | 238 STACK_OF(X509) *roots = sk_X509_new_null(); in verify()
244 || !TEST_ptr(roots)) in verify()
249 if (!TEST_true(sk_X509_push(roots, root)) in verify()
252 X509_STORE_CTX_set0_trusted_stack(ctx, roots); in verify()
267 sk_X509_pop_free(roots, X509_free); in verify()
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| D | hb-repacker.hh | 348 hb_set_t roots; in assign_32bit_spaces() local
355 roots.add (l.objidx); in assign_32bit_spaces()
365 if (!roots) return false; in assign_32bit_spaces()
367 while (roots) in assign_32bit_spaces()
370 if (!roots.next (&next)) break; in assign_32bit_spaces()
373 find_connected_nodes (next, roots, visited, connected_roots); in assign_32bit_spaces()
401 bool isolate_subgraph (hb_set_t& roots) in isolate_subgraph()
409 for (unsigned root_idx : roots) in isolate_subgraph()
455 while (roots.next (&next)) in isolate_subgraph()
459 roots.del (next); in isolate_subgraph()
[all …]
|
| /third_party/boost/libs/math/example/daubechies_wavelets/ |
| D | daubechies_coefficients.cpp | 65 …std::vector<Complex> roots(p-1, {std::numeric_limits<Real>::quiet_NaN(),std::numeric_limits<Real>:… in find_roots() local
114 BOOST_ASSERT(i < roots.size()); in find_roots()
115 roots[i] = r; in find_roots()
151 Complex y = roots[i]; in find_roots()
240 auto roots = find_roots<Complex>(p); in main() local
241 auto h = daubechies_coefficients(roots); in main()
|