Home
last modified time | relevance | path

Searched full:solutions (Results 1 – 25 of 1685) sorted by relevance

12345678910>>...68

/aosp_15_r20/external/pytorch/aten/src/ATen/cuda/tunable/
H A DGemmRocblas.h177 // Get the number of available solutions in GetRocBlasGemmTypeStringAndOps()
185 std::vector<int> solutions(solution_size); in GetRocBlasGemmTypeStringAndOps()
186 // Get the list of available solutions in GetRocBlasGemmTypeStringAndOps()
192 solutions.data(), in GetRocBlasGemmTypeStringAndOps()
194 // Sort the solutions in ascending order to make the solution vector deterministic across runs in GetRocBlasGemmTypeStringAndOps()
195 std::sort(solutions.begin(), solutions.end()); in GetRocBlasGemmTypeStringAndOps()
198 for (size_t i = 0; i < solutions.size(); ++i) { in GetRocBlasGemmTypeStringAndOps()
199 auto callable = std::make_unique<RocblasGemmOp<T>>(solutions[i]); in GetRocBlasGemmTypeStringAndOps()
200 ret.emplace_back(std::make_pair(c10::str("Gemm_Rocblas_", solutions[i]), std::move(callable))); in GetRocBlasGemmTypeStringAndOps()
247 // Get the number of available solutions in GetRocBlasGemmStridedBatchedTypeStringAndOps()
[all …]
/aosp_15_r20/packages/modules/Bluetooth/framework/java/android/bluetooth/
DBluetoothHealth.java54 * Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
66 * use Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
76 * use Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
86 * use Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
96 * use Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
139 * use Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
161 * use Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
185 * use Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
210 * use Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
235 * use Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
[all …]
DBluetoothHealthAppConfiguration.java30 * Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
54 * use Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
68 * use Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
82 * use Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
93 * use Bluetooth Low Energy based solutions such as {@link BluetoothGatt}, {@link
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/analysis/solvers/
H A DAllowedSolution.java21 /** The kinds of solutions that a {@link BracketedUnivariateSolver
22 * (bracketed univariate real) root-finding algorithm} may accept as solutions.
26 * <p>If all solutions are accepted ({@link #ANY_SIDE}), then the solution
41 /** There are no additional side restriction on the solutions for
49 /** Only solutions that are less than or equal to the actual root are
50 * acceptable as solutions for root-finding. In other words,
56 /** Only solutions that are greater than or equal to the actual root are
57 * acceptable as solutions for root-finding. In other words,
63 /** Only solutions for which values are less than or equal to zero are
64 * acceptable as solutions for root-finding. So, if a function f(x) has
[all …]
H A DBracketedRealFieldUnivariateSolver.java34 * {@link AllowedSolution allowed solutions}. Other root-finding
41 * solutions.</p>
67 * Get the absolute accuracy of the solver. Solutions returned by the
109 * @param allowedSolution The kind of solutions that the root-finding algorithm may
110 * accept as solutions.
131 * @param allowedSolution The kind of solutions that the root-finding algorithm may
132 * accept as solutions.
H A DBracketedUnivariateSolver.java33 * {@link AllowedSolution allowed solutions}. Other root-finding
40 * solutions.</p>
59 * @param allowedSolution The kind of solutions that the root-finding algorithm may
60 * accept as solutions.
81 * @param allowedSolution The kind of solutions that the root-finding algorithm may
82 * accept as solutions.
/aosp_15_r20/external/mesa3d/src/panfrost/compiler/
H A Dbi_ra.c48 /* Before solving, forced registers; after solving, solutions. */
49 unsigned *solutions; member
69 l->solutions = calloc(sizeof(l->solutions[0]), node_count); in lcra_alloc_equations()
72 memset(l->solutions, ~0, sizeof(l->solutions[0]) * node_count); in lcra_alloc_equations()
85 free(l->solutions); in lcra_free()
121 lcra_test_linear(struct lcra_state *l, unsigned *solutions, unsigned i) in lcra_test_linear() argument
123 signed constant = solutions[i]; in lcra_test_linear()
130 if (solutions[j] == ~0) in lcra_test_linear()
133 signed lhs = constant - solutions[j]; in lcra_test_linear()
148 if (solutions[j] == ~0) in lcra_test_linear()
[all …]
/aosp_15_r20/external/mesa3d/src/panfrost/util/
H A Dlcra.c59 l->solutions = calloc(sizeof(l->solutions[0]), node_count); in lcra_alloc_equations()
61 memset(l->solutions, ~0, sizeof(l->solutions[0]) * node_count); in lcra_alloc_equations()
80 free(l->solutions); in lcra_free()
140 lcra_test_linear(struct lcra_state *l, unsigned *solutions, unsigned i) in lcra_test_linear() argument
143 signed constant = solutions[i]; in lcra_test_linear()
146 if (solutions[j] == ~0) in lcra_test_linear()
149 signed lhs = solutions[j] - constant; in lcra_test_linear()
165 if (l->solutions[step] != ~0) in lcra_solve()
186 l->solutions[step] = ((m * P + n) << shift) + class_start; in lcra_solve()
187 succ = lcra_test_linear(l, l->solutions, step); in lcra_solve()
/aosp_15_r20/external/python/bumble/bumble/
Dcompany_ids.py124 0x0066: "9Solutions Oy",
165 0x008F: "Telit Wireless Solutions GmbH",
284 0x0106: "Innovative Yachtter Solutions",
299 0x0115: "e.solutions",
317 0x0127: "Salutica Allied Solutions",
465 0x01BB: "Cochlear Bone Anchored Solutions AB",
508 0x01E6: "Technology Solutions (UK) Ltd",
584 0x0232: "x-Senso Solutions Kft",
611 0x024D: "M-Way Solutions GmbH",
645 0x026F: "Aptcode Solutions",
[all …]
/aosp_15_r20/external/fonttools/Lib/fontTools/pens/
H A DpointInsidePen.py120 solutions = sorted(solveCubic(ay, by, cy, dy - y))
121 solutions = [t for t in solutions if -0.0 <= t <= 1.0]
122 if not solutions:
132 for t in solutions:
176 solutions = sorted(solveQuadratic(a, b, c - y))
177 solutions = [
178 t for t in solutions if ZERO_MINUS_EPSILON <= t <= ONE_PLUS_EPSILON
180 if not solutions:
/aosp_15_r20/external/pytorch/aten/src/ATen/native/miopen/
H A DConv_miopen.cpp390 miopenConvSolution_t solutions[AT_MIOPEN_MAX_SOLUTIONS]; in getSolution() local
409 solutions)); in getSolution()
414 if (solutions[i].algorithm == (miopenConvAlgorithm_t)DEFAULT_ALGO) { in getSolution()
415 return solutions[i]; in getSolution()
420 if (solutions[i].workspace_size == 0) { in getSolution()
421 return solutions[i]; in getSolution()
427 return solutions[0]; in getSolution()
463 miopenConvSolution_t solutions[AT_MIOPEN_MAX_SOLUTIONS]; in getSolution() local
482 solutions)); in getSolution()
487 if (solutions[i].algorithm == (miopenConvAlgorithm_t)DEFAULT_ALGO) { in getSolution()
[all …]
/aosp_15_r20/external/libconfig/debian/
H A Dchangelog7 -- Jose Luis Tallon <jltallon@adv-solutions.net> Thu, 31 Dec 2015 17:01:20 +0100
126 -- Jose Luis Tallon <jltallon@adv-solutions.net> Sun, 13 Sep 2009 04:25:14 +0200
134 -- Jose Luis Tallon <jltallon@adv-solutions.net> Tue, 07 Apr 2009 21:13:16 +0200
152 -- Jose Luis Tallon <jltallon@adv-solutions.net> Fri, 31 Oct 2008 22:13:47 +0100
161 -- Jose Luis Tallon <jltallon@adv-solutions.net> Mon, 20 Jul 2008 19:55:23 +0200
167 -- Jose Luis Tallon <jltallon@adv-solutions.net> Mon, 2 Jul 2007 02:01:40 +0200
173 -- Jose Luis Tallon <jltallon@adv-solutions.net> Tue, 10 Oct 2006 01:42:09 +0200
/aosp_15_r20/external/python/bumble/rust/src/wrapper/assigned_numbers/
Dcompany_ids.rs126 (102_u16, r#"9Solutions Oy"#),
167 (143_u16, r#"Telit Wireless Solutions GmbH"#),
286 (262_u16, r#"Innovative Yachtter Solutions"#),
301 (277_u16, r#"e.solutions"#),
319 (295_u16, r#"Salutica Allied Solutions"#),
467 (443_u16, r#"Cochlear Bone Anchored Solutions AB"#),
510 (486_u16, r#"Technology Solutions (UK) Ltd"#),
586 (562_u16, r#"x-Senso Solutions Kft"#),
613 (589_u16, r#"M-Way Solutions GmbH"#),
647 (623_u16, r#"Aptcode Solutions"#),
[all …]
/aosp_15_r20/external/google-cloud-java/java-gsuite-addons/proto-google-apps-script-type-protos/src/main/java/com/google/apps/script/type/calendar/
H A DCalendarAddOnManifest.java361 * Defines conference solutions provided by this add-on.
376 * Defines conference solutions provided by this add-on.
391 * Defines conference solutions provided by this add-on.
405 * Defines conference solutions provided by this add-on.
419 * Defines conference solutions provided by this add-on.
1427 * Defines conference solutions provided by this add-on.
1445 * Defines conference solutions provided by this add-on.
1462 * Defines conference solutions provided by this add-on.
1480 * Defines conference solutions provided by this add-on.
1504 * Defines conference solutions provided by this add-on.
[all …]
H A DCalendarAddOnManifestOrBuilder.java80 * Defines conference solutions provided by this add-on.
92 * Defines conference solutions provided by this add-on.
103 * Defines conference solutions provided by this add-on.
114 * Defines conference solutions provided by this add-on.
126 * Defines conference solutions provided by this add-on.
/aosp_15_r20/external/skia/site/docs/dev/design/conical/
H A D_index.md42 _positive_). If there are multiple (at most 2) solutions of $t$, choose the
64 that with multiple solutions of $t_s$, we shall choose the smaller one (so $t$
76 we're only interested in positive solutions for $x_t$. Again, if there are
77 multiple $x_t$ solutions, we may want to find the bigger one if $1 - f > 0$, and
96 $(x_t - x)^2 + y^2 = (x_t r_1)^2$ and eliminating negative $x_t$ solutions gets
224 **Corollary 1.** By lemma 1. and 2., we conclude that the number of solutions
237 - when $r_1 < 1$, there may be $0, 1$, or $2$ solutions; this was also
244 **Lemma 3.** When solutions exists, one such solution is
343 2. otherwise, the solutions are
/aosp_15_r20/external/skia/tests/
H A DCubicRootsTest.cpp47 // The old pathops implementation sometimes gives incorrect solutions. We can opt in testCubicRootsReal()
58 // For determinism, we will sort them (and ensure the provided solutions are also sorted). in testCubicRootsReal()
80 // For determinism, we will sort them (and ensure the provided solutions are also sorted). in testCubicRootsReal()
162 // Otherwise, floating point error mangles the solutions near +- 1 in DEF_TEST()
244 testCubicRootsReal(reporter, "Infinite solutions y = 0", in DEF_TEST()
323 // For determinism, we will sort them (and ensure the provided solutions are also sorted). in testCubicValidT()
345 // For determinism, we will sort them (and ensure the provided solutions are also sorted). in testCubicValidT()
367 // For determinism, we will sort them (and ensure the provided solutions are also sorted). in testCubicValidT()
/aosp_15_r20/external/pytorch/torch/distributed/tensor/
H A DREADME.md28 …solutions have been built independently (i.e. PyTorch DDP, FSDP, ShardedTensor, PiPPy, etc.). When…
30 …out worrying about how to do distributed training in a cluster, and our solutions could help them …
147 …solutions for cases like Tensor Parallelism. But when using the DTensor's replication in a data pa…
153 …“distributed tensor” concept for both replication and sharding, and the solutions could enable use…
/aosp_15_r20/external/google-cloud-java/java-recaptchaenterprise/proto-google-cloud-recaptchaenterprise-v1/src/main/java/com/google/recaptchaenterprise/v1/
H A DChallengeMetrics.java111 * Count of submitted challenge solutions that were incorrect or otherwise
131 * submitted challenge solutions that were correct and resulted in
664 * Count of submitted challenge solutions that were incorrect or otherwise
680 * Count of submitted challenge solutions that were incorrect or otherwise
700 * Count of submitted challenge solutions that were incorrect or otherwise
721 * submitted challenge solutions that were correct and resulted in
738 * submitted challenge solutions that were correct and resulted in
759 * submitted challenge solutions that were correct and resulted in
/aosp_15_r20/external/python/google-api-python-client/docs/dyn/
Dcalendar_v3.calendars.html134 …&quot;allowedConferenceSolutionTypes&quot;: [ # The types of conference solutions that are support…
162 …&quot;allowedConferenceSolutionTypes&quot;: [ # The types of conference solutions that are support…
185 …&quot;allowedConferenceSolutionTypes&quot;: [ # The types of conference solutions that are support…
214 …&quot;allowedConferenceSolutionTypes&quot;: [ # The types of conference solutions that are support…
237 …&quot;allowedConferenceSolutionTypes&quot;: [ # The types of conference solutions that are support…
266 …&quot;allowedConferenceSolutionTypes&quot;: [ # The types of conference solutions that are support…
289 …&quot;allowedConferenceSolutionTypes&quot;: [ # The types of conference solutions that are support…
/aosp_15_r20/external/eigen/doc/
H A DWrongStackAlignment.dox22 …nalignedArrayAssert "assertion on unaligned arrays". So far we found the three following solutions.
35 …as to be done for every such function, so you may prefer one of the following two global solutions.
38 \section sec_sol2 Global solutions
52 These global solutions are easy to use, but note that they may slowdown your program because they l…
/aosp_15_r20/external/mesa3d/src/panfrost/midgard/
H A Dmidgard_ra.c96 .reg = l->solutions[reg] / 16, in index_to_reg()
97 .offset = l->solutions[reg] & 0xF, in index_to_reg()
714 l->solutions[ins->src[0]] = 0; in allocate_registers()
717 l->solutions[ins->src[2]] = (16 * 1) + COMPONENT_X * 4; in allocate_registers()
720 l->solutions[ins->src[3]] = (16 * 1) + COMPONENT_Y * 4; in allocate_registers()
723 l->solutions[ins->src[1]] = (16 * 1) + COMPONENT_Z * 4; in allocate_registers()
726 l->solutions[ins->dest] = (16 * 1) + COMPONENT_W * 4; in allocate_registers()
743 l->solutions[ctx->temp_count + i] = (16 * i); in allocate_registers()
784 l->solutions[ctx->blend_input] = 0; in allocate_registers()
792 l->solutions[ctx->blend_src1] = (16 * 2); in allocate_registers()
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/linear/
H A DDecompositionSolver.java29 * solvers can also find solutions with non-square matrix A and with non-null minimal norm. If an
80 * \( A x = b \) may have no solutions, or many. If it has no solutions, then the pseudo-inverse
82 * \|_2 \) is minimized. If there are many solutions, then \( z = A^+ b \) is the smallest
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/dfp/
H A DBracketingNthOrderBrentSolverDFP.java104 * @param allowedSolution The kind of solutions that the root-finding algorithm may accept as
105 * solutions.
130 * @param allowedSolution The kind of solutions that the root-finding algorithm may accept as
131 * solutions.
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
H A DEigenDecompositionImpl.java275 * This method only find exact linear solutions, i.e. solutions for
317 * This method only find exact linear solutions, i.e. solutions for
359 * This method only find exact linear solutions, i.e. solutions for

12345678910>>...68