Home
last modified time | relevance | path

Searched full:roots (Results 1 – 25 of 19391) sorted by relevance

12345678910>>...776

/aosp_15_r20/external/skia/tests/
H A DCubicRootsTest.cpp30 "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 …]
H A DQuadRootsTest.cpp31 "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 …]
/aosp_15_r20/build/make/tools/compliance/
H A Dpolicy_walk_test.go39 roots []string
46 roots: []string{"apacheBin.meta_lic"},
58 roots: []string{"mitBin.meta_lic"},
70 roots: []string{"apacheBin.meta_lic"},
82 roots: []string{"apacheBin.meta_lic"},
93 roots: []string{"apacheBin.meta_lic"},
104 roots: []string{"apacheBin.meta_lic"},
113 roots: []string{"apacheBin.meta_lic"},
125 roots: []string{"apacheBin.meta_lic"},
134 roots: []string{"dependentModule.meta_lic"},
[all …]
H A Dpolicy_resolve_test.go26 roots []string
32 roots: []string{"apacheBin.meta_lic"},
43 roots: []string{"apacheBin.meta_lic"},
54 roots: []string{"apacheContainer.meta_lic"},
67 roots: []string{"apacheContainer.meta_lic"},
80 roots: []string{"apacheBin.meta_lic"},
91 roots: []string{"apacheContainer.meta_lic"},
104 roots: []string{"apacheContainer.meta_lic"},
117 roots: []string{"apacheBin.meta_lic"},
128 roots: []string{"apacheBin.meta_lic"},
[all …]
H A Dpolicy_resolveshare_test.go25 roots []string
31 roots: []string{"apacheBin.meta_lic"},
39 roots: []string{"apacheBin.meta_lic", "gplWithClasspathException.meta_lic"},
47 roots: []string{"apacheBin.meta_lic"},
55 roots: []string{"dependentModule.meta_lic"},
63 roots: []string{"dependentModule.meta_lic", "gplWithClasspathException.meta_lic"},
71 roots: []string{"lgplBin.meta_lic"},
82 roots: []string{"lgplBin.meta_lic"},
92 roots: []string{"lgplBin.meta_lic", "apacheLib.meta_lic"},
102 roots: []string{"gplBin.meta_lic"},
[all …]
H A Dpolicy_resolvenotices_test.go25 roots []string
31 roots: []string{"apacheBin.meta_lic"},
42 roots: []string{"apacheBin.meta_lic"},
52 roots: []string{"apacheBin.meta_lic", "apacheLib.meta_lic"},
63 roots: []string{"apacheBin.meta_lic"},
76 roots: []string{"apacheBin.meta_lic"},
88 roots: []string{"apacheContainer.meta_lic"},
112 roots: []string{"apacheContainer.meta_lic"},
127 roots: []string{"apacheBin.meta_lic"},
139 roots: []string{"apacheBin.meta_lic", "mitLib.meta_lic"},
[all …]
/aosp_15_r20/external/google-smali/third_party/util/src/test/java/com/android/tools/smali/util/
H A DPathUtilTest.java36 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 …]
/aosp_15_r20/prebuilts/go/linux-x86/src/cmd/go/internal/modload/
Dbuildlist.go51 // The roots are always expected to contain an entry for the "go" module,
61 // explicit roots (vs. indirect-only dependencies). However, it should not
98 func mustHaveGoRoot(roots []module.Version) {
99 for _, m := range roots {
108 // The dependencies of the roots will be loaded lazily at the first call to the
151 panic(fmt.Sprintf("newRequirements called with unsorted roots: %v", rootModules))
177 roots := MainModules.Versions()
179 // Use rs.rootModules to pull in the go and toolchain roots
182 roots = rs.rootModules
185 g: mvs.NewGraph(cmpVersion, roots),
[all …]
Dedit.go42 // If pruning is enabled, the roots of the edited requirements include an
43 // explicit entry for each module path in tryUpgrade, mustSelect, and the roots
98 // by the main module may either be explicit roots or implicit transitive
149 // versions of the roots. Now we need to load the actual module graph and
153 // roots until their requirements are internally consistent and then drops out
154 // the old roots. However, here we need to do more: we also need to make sure
158 // roots that lead to those paths. When no conflicts remain, we're done.
161 // older-than-selected roots until the process completes. That might mean that
172 // They join back together at the roots of the graph: if a root r1 with pruned
192 roots []module.Version // the current versions in selectedRoot, in sorted order
[all …]
/aosp_15_r20/external/skia/fuzz/
H A DFuzzCubicRoots.cpp18 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 …]
/aosp_15_r20/prebuilts/go/linux-x86/src/crypto/x509/
Dname_constraints_test.go42 roots []constraintsSpec member
66 roots: make([]constraintsSpec, 1),
75 roots: make([]constraintsSpec, 1),
89 roots: make([]constraintsSpec, 1),
105 roots: []constraintsSpec{
122 roots: make([]constraintsSpec, 1),
137 roots: []constraintsSpec{
155 roots: make([]constraintsSpec, 1),
170 roots: []constraintsSpec{
188 roots: []constraintsSpec{
[all …]
/aosp_15_r20/build/make/tools/compliance/cmd/rtrace/
H A Drtrace_test.go42 roots []string
49 roots: []string{"highest.apex.meta_lic"},
55 roots: []string{"highest.apex.meta_lic"},
65 roots: []string{"container.zip.meta_lic"},
71 roots: []string{"application.meta_lic"},
77 roots: []string{"bin/bin1.meta_lic"},
83 roots: []string{"lib/libd.so.meta_lic"},
89 roots: []string{"highest.apex.meta_lic"},
95 roots: []string{"highest.apex.meta_lic"},
105 roots: []string{"container.zip.meta_lic"},
[all …]
/aosp_15_r20/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/
Ddb_utilities_poly.cpp28 void db_SolveCubic(double *roots,int *nr_roots,double a,double b,double c,double d) in db_SolveCubic() argument
35 /*For nondegenerate cubics with three roots in db_SolveCubic()
40 if(a==0.0) db_SolveQuadratic(roots,nr_roots,b,c,d); in db_SolveCubic()
68 roots[0]= -2.0*srq*cos_theta_through3-bp_through3; in db_SolveCubic()
69 roots[1]=srq*min2_cos_theta_plu-bp_through3; in db_SolveCubic()
70 roots[2]=srq*min2_cos_theta_min-bp_through3; in db_SolveCubic()
77 if(A!=0.0) roots[0]=A+q/A-bp_through3; in db_SolveCubic()
78 else roots[0]= -bp_through3; in db_SolveCubic()
87 roots[0]= -2.0*si_r_srq-bp_through3; in db_SolveCubic()
89 roots[1]=si_r_srq-bp_through3; in db_SolveCubic()
[all …]
/aosp_15_r20/build/make/tools/compliance/cmd/shippedlibs/
H A Dshippedlibs_test.go43 roots []string
49 roots: []string{"highest.apex.meta_lic"},
55 roots: []string{"container.zip.meta_lic"},
61 roots: []string{"application.meta_lic"},
67 roots: []string{"bin/bin1.meta_lic"},
73 roots: []string{"lib/libd.so.meta_lic"},
79 roots: []string{"highest.apex.meta_lic"},
85 roots: []string{"container.zip.meta_lic"},
91 roots: []string{"application.meta_lic"},
97 roots: []string{"bin/bin1.meta_lic"},
[all …]
/aosp_15_r20/build/make/tools/compliance/cmd/listshare/
H A Dlistshare_test.go46 roots []string
52 roots: []string{"highest.apex.meta_lic"},
58 roots: []string{"container.zip.meta_lic"},
64 roots: []string{"application.meta_lic"},
70 roots: []string{"bin/bin1.meta_lic"},
76 roots: []string{"lib/libd.so.meta_lic"},
82 roots: []string{"highest.apex.meta_lic"},
88 roots: []string{"container.zip.meta_lic"},
94 roots: []string{"application.meta_lic"},
100 roots: []string{"bin/bin1.meta_lic"},
[all …]
/aosp_15_r20/build/make/tools/compliance/cmd/checkshare/
H A Dcheckshare_test.go62 roots []string
69 roots: []string{"highest.apex.meta_lic"},
75 roots: []string{"container.zip.meta_lic"},
81 roots: []string{"application.meta_lic"},
87 roots: []string{"bin/bin2.meta_lic"},
93 roots: []string{"lib/libd.so.meta_lic"},
99 roots: []string{"highest.apex.meta_lic"},
105 roots: []string{"container.zip.meta_lic"},
111 roots: []string{"application.meta_lic"},
117 roots: []string{"bin/bin2.meta_lic"},
[all …]
/aosp_15_r20/system/incremental_delivery/incfs/
H A DMountRegistry.cpp78 roots.swap(other.roots); in swap()
83 roots.clear(); in clear()
97 if (index >= int(roots.size()) || roots[index].empty()) { in rootIndex()
113 return roots[index].path; in rootFor()
126 const auto& root = roots[index]; in rootAndSubpathFor()
131 const auto index = roots.size(); in addRoot()
134 roots.push_back({std::move(absolute), path::normalize(backingDir), {it}}); in addRoot()
145 if (index >= int(roots.size())) { in removeRoot()
147 << " out of bounds (total roots count is " << roots.size(); in removeRoot()
151 for (auto bindIt : roots[index].binds) { in removeRoot()
[all …]
/aosp_15_r20/build/make/tools/compliance/cmd/bom/
H A Dbom_test.go43 roots []string
50 roots: []string{"highest.apex.meta_lic"},
63 roots: []string{"container.zip.meta_lic"},
76 roots: []string{"application.meta_lic"},
83 roots: []string{"bin/bin1.meta_lic"},
90 roots: []string{"lib/libd.so.meta_lic"},
97 roots: []string{"highest.apex.meta_lic"},
109 roots: []string{"container.zip.meta_lic"},
121 roots: []string{"application.meta_lic"},
127 roots: []string{"bin/bin1.meta_lic"},
[all …]
/aosp_15_r20/packages/apps/DocumentsUI/src/com/android/documentsui/roots/
DProvidersCache.java17 package com.android.documentsui.roots;
82 * Cache of known storage backends and their roots.
91 // MTP provider commonly returns no roots (if no devices are attached).
93 // ArchivesProvider doesn't support any roots.
180 Log.i(TAG, "Updating roots due to change on user " + mUserId + "at " + uri);
251 * @return {@code true} if cached roots is ready to roll, otherwise
267 * Load roots from authorities that are in stopped state. Normal
280 * Load roots from a stopped authority. Normal {@link MultiProviderUpdateTask} passes
297 * Bring up requested provider and query for all active roots. Will consult cached
298 * roots if not forceRefresh. Will query when cached roots is empty (which should never happen).
[all …]
/aosp_15_r20/external/eigen/unsupported/doc/examples/
H A DPolynomialSolver1.cpp12 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 …]
/aosp_15_r20/build/make/tools/compliance/cmd/dumpgraph/
H A Ddumpgraph_test.go42 roots []string
49 roots: []string{"highest.apex.meta_lic"},
64 roots: []string{"highest.apex.meta_lic"},
80 roots: []string{"highest.apex.meta_lic"},
96 roots: []string{"container.zip.meta_lic"},
111 roots: []string{"application.meta_lic"},
121 roots: []string{"bin/bin1.meta_lic"},
130 roots: []string{"lib/libd.so.meta_lic"},
136 roots: []string{"highest.apex.meta_lic"},
151 roots: []string{"highest.apex.meta_lic"},
[all …]
/aosp_15_r20/build/make/tools/compliance/cmd/dumpresolutions/
H A Ddumpresolutions_test.go42 roots []string
49 roots: []string{"highest.apex.meta_lic"},
68 roots: []string{"highest.apex.meta_lic"},
88 roots: []string{"highest.apex.meta_lic"},
111 roots: []string{"highest.apex.meta_lic"},
121 roots: []string{"highest.apex.meta_lic"},
131 roots: []string{"highest.apex.meta_lic"},
141 roots: []string{"highest.apex.meta_lic"},
161 roots: []string{"container.zip.meta_lic"},
180 roots: []string{"application.meta_lic"},
[all …]
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/complex/
H A DRootsOfUnity.java29 * 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 …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/include/llvm/Support/
DGenericDomTreeConstruction.h59 using RootsT = decltype(DomTreeT::Roots);
331 // For postdominators, nodes with no forward successors are trivial roots that
332 // are always selected as tree roots. Roots with forward successors correspond
344 // Finds all roots without relaying on the set of roots already stored in the
346 // We define roots to be some non-redundant set of the CFG nodes
349 RootsT Roots; in FindRoots() local
353 Roots.push_back(GetEntryNode(DT)); in FindRoots()
354 return Roots; in FindRoots()
363 LLVM_DEBUG(dbgs() << "\t\tLooking for trivial roots\n"); in FindRoots()
365 // Step #1: Find all the trivial roots that are going to will definitely in FindRoots()
[all …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/include/llvm/Support/
DGenericDomTreeConstruction.h59 using RootsT = decltype(DomTreeT::Roots);
331 // For postdominators, nodes with no forward successors are trivial roots that
332 // are always selected as tree roots. Roots with forward successors correspond
344 // Finds all roots without relaying on the set of roots already stored in the
346 // We define roots to be some non-redundant set of the CFG nodes
349 RootsT Roots; in FindRoots() local
353 Roots.push_back(GetEntryNode(DT)); in FindRoots()
354 return Roots; in FindRoots()
363 LLVM_DEBUG(dbgs() << "\t\tLooking for trivial roots\n"); in FindRoots()
365 // Step #1: Find all the trivial roots that are going to will definitely in FindRoots()
[all …]

12345678910>>...776