| /external/skia/src/base/ |
| D | SkCubics.cpp | 38 int SkCubics::RootsReal(double A, double B, double C, double D, double solution[3]) { in RootsReal()
40 return SkQuads::RootsReal(B, C, D, solution); in RootsReal()
43 int num = SkQuads::RootsReal(A, B, C, solution); in RootsReal()
45 if (sk_double_nearly_zero(solution[i])) { in RootsReal()
49 solution[num++] = 0; in RootsReal()
53 int num = SkQuads::RootsReal(A, A + B, -D, solution); in RootsReal()
55 if (sk_doubles_nearly_equal_ulps(solution[i], 1)) { in RootsReal()
59 solution[num++] = 1; in RootsReal()
86 double* roots = solution; in RootsReal()
96 if (!nearly_equal(solution[0], r)) { in RootsReal()
[all …]
|
| D | SkQuads.cpp | 15 static int solve_linear(const double M, const double B, double solution[2]) { in solve_linear()
17 solution[0] = 0; in solve_linear()
23 solution[0] = -B / M; in solve_linear()
24 if (!std::isfinite(solution[0])) { in solve_linear()
43 int SkQuads::RootsReal(const double A, const double B, const double C, double solution[2]) { in RootsReal()
45 return solve_linear(B, C, solution); in RootsReal()
62 solution[0] = sqrt_D - p; in RootsReal()
63 solution[1] = -sqrt_D - p; in RootsReal()
65 sk_doubles_nearly_equal_ulps(solution[0], solution[1])) { in RootsReal()
|
| /external/tensorflow/tensorflow/compiler/tests/ |
| D | matrix_diag_ops_test.py | 335 solution, argument
339 """Verifies that matrix_diag produces `solution` when fed `params`.
343 solution: numpy array representing the expected output of matrix_diag.
351 expected = solution.astype(dtype)
414 for diag_index, (vecs, solution) in tests.items():
416 self._assertOpOutputMatchesExpected(params, solution[0])
421 for diag_index, (vecs, solution) in tests.items():
423 self._assertOpOutputMatchesExpected(params, solution)
431 # solution shape is updated.
463 for diag_index, (vecs, solution) in tests.items():
[all …]
|
| /external/tensorflow/tensorflow/python/kernel_tests/array_ops/ |
| D | diag_op_test.py | 390 for diags, (vecs, solution) in tests.items():
392 self.assertEqual(v_diags.get_shape(), solution[0].shape)
393 self.assertAllEqual(v_diags, solution[0])
419 for diags, (vecs, solution) in tests.items():
425 mask = solution == 0
426 solution = (solution + padding_value * mask).astype(dtype)
427 self.assertEqual(v_diags.get_shape(), solution.shape)
428 self.assertAllEqual(v_diags, solution)
453 # solution shape is updated.
483 for diags, (vecs, solution) in tests.items():
[all …]
|
| /external/python/google-api-python-client/docs/dyn/ |
| D | jobs_v3.projects.clientEvents.html | 75 <h1><a href="jobs_v3.html">Cloud Talent Solution API</a> . <a href="jobs_v3.projects.html">projects…
82 …Solution. You may inspect the created events in [self service tools](https://console.cloud.google.…
91 …Solution. You may inspect the created events in [self service tools](https://console.cloud.google.…
99 …Solution. Providing this information improves the quality of search and recommendation for the API…
105 …ements Cloud Talent Solution. # A event issued when a job seeker interacts with the application th…
124 …an end user interacts with the application that implements Cloud Talent Solution. Providing this i…
130 …ements Cloud Talent Solution. # A event issued when a job seeker interacts with the application th…
|
| D | jobs_v3p1beta1.projects.clientEvents.html | 75 <h1><a href="jobs_v3p1beta1.html">Cloud Talent Solution API</a> . <a href="jobs_v3p1beta1.projects.…
82 …Solution. You may inspect the created events in [self service tools](https://console.cloud.google.…
91 …Solution. You may inspect the created events in [self service tools](https://console.cloud.google.…
99 …Solution. Providing this information improves the quality of search and recommendation for the API…
105 …ements Cloud Talent Solution. # A event issued when a job seeker interacts with the application th…
124 …an end user interacts with the application that implements Cloud Talent Solution. Providing this i…
130 …ements Cloud Talent Solution. # A event issued when a job seeker interacts with the application th…
|
| D | jobs_v4.projects.tenants.clientEvents.html | 75 <h1><a href="jobs_v4.html">Cloud Talent Solution API</a> . <a href="jobs_v4.projects.html">projects…
82 …Solution. You may inspect the created events in [self service tools](https://console.cloud.google.…
91 …Solution. You may inspect the created events in [self service tools](https://console.cloud.google.…
98 …an end user interacts with the application that implements Cloud Talent Solution. Providing this i…
102 …ments Cloud Talent Solution. # An event issued when a job seeker interacts with the application th…
119 …an end user interacts with the application that implements Cloud Talent Solution. Providing this i…
123 …ments Cloud Talent Solution. # An event issued when a job seeker interacts with the application th…
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/ |
| D | Solution.h | 1 //===- Solution.h - PBQP Solution -------------------------------*- C++ -*-===//
9 // PBQP Solution class.
23 /// Represents a solution to a PBQP problem.
26 class Solution {
32 /// Initialise an empty solution.
33 Solution() = default;
|
| /external/fonttools/Lib/fontTools/varLib/ |
| D | iup.py | 243 Note that solution always encodes last point explicitly. Higher-level is responsible
320 # solution given the constraint that the last point is always encoded.
341 # Assemble solution.
342 solution = set()
345 solution.add(i)
347 solution.remove(-1)
349 #if not forced <= solution:
353 assert forced <= solution, (forced, solution)
355 deltas = [deltas[i] if i in solution else None for i in range(n)]
360 # circular n-length problem in the solution for new linear case. I cannot prove that
[all …]
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Solution.h | 1 //===-- Solution.h ------- PBQP Solution ------------------------*- C++ -*-===//
10 // PBQP Solution class.
24 /// \brief Represents a solution to a PBQP problem.
27 class Solution {
37 /// \brief Initialise an empty solution.
38 Solution() in Solution() function
|
| /external/vulkan-headers/ |
| D | BUILD.md | 95 - [Git for Windows](http://git-scm.com/download/win) is a popular solution
105 command line or use the Visual Studio IDE to open the generated solution and
106 work with the solution interactively.
169 The above steps create a Windows solution file named `Vulkan-Headers.sln` in
172 At this point, you can build the solution from the command line or open the
173 generated solution with Visual Studio.
175 #### Build the Solution From the Command Line
183 #### Build the Solution With Visual Studio
185 Launch Visual Studio and open the "Vulkan-Headers.sln" solution file in the
186 build directory. Build the `INSTALL` target from the Visual Studio solution
|
| /external/libcxx/docs/DesignDocs/ |
| D | CapturingConfigInfo.rst | 21 * The solution should not INSTALL any additional headers. We don't want an extra
24 * The solution should not unduly affect libc++ developers. The problem is limited
25 to installed versions of libc++ and the solution should be as well.
27 * The solution should not modify any existing headers EXCEPT during installation.
31 * The solution should not make any of the libc++ headers dependent on
35 * The solution should not have ANY effect on users who don't need special
40 The Solution
|
| /external/cronet/third_party/protobuf/cmake/ |
| D | README.md | 92 This generates a Visual Studio solution for the project.
95 …the external tool [Ninja](https://ninja-build.org/) to build. It is the fastest solution available.
133 C:\Path\to\build\protobuf>mkdir solution & cd solution
134 C:\Path\to\build\protobuf\solution>cmake -G "Visual Studio 16 2019" ^
138 It will generate *Visual Studio* solution file *protobuf.sln* in current directory.
163 C:\Path\to\build\protobuf>mkdir solution & cd solution
164 C:\Path\to\build\protobuf\solution>cmake -G "Visual Studio 16 2019" ^
176 C:\Path\to\build\protobuf\solution>cmake -G "Visual Studio 16 2019" ^
189 cmake --build C:\Path\to\build\protobuf\solution --config Release
205 * From the Build menu, choose "Build Solution".
[all …]
|
| /external/protobuf/cmake/ |
| D | README.md | 92 This generates a Visual Studio solution for the project.
95 …the external tool [Ninja](https://ninja-build.org/) to build. It is the fastest solution available.
133 C:\Path\to\build\protobuf>mkdir solution & cd solution
134 C:\Path\to\build\protobuf\solution>cmake -G "Visual Studio 16 2019" ^
138 It will generate *Visual Studio* solution file *protobuf.sln* in current directory.
163 C:\Path\to\build\protobuf>mkdir solution & cd solution
164 C:\Path\to\build\protobuf\solution>cmake -G "Visual Studio 16 2019" ^
176 C:\Path\to\build\protobuf\solution>cmake -G "Visual Studio 16 2019" ^
189 cmake --build C:\Path\to\build\protobuf\solution --config Release
205 * From the Build menu, choose "Build Solution".
[all …]
|
| /external/python/cpython2/PC/VS7.1/ |
| D | python.build | 4 <solution configuration="release">
8 </solution>
11 <solution configuration="release" solutionfile="pcbuild.sln">
19 </solution>
|
| /external/cronet/build/win/ |
| D | gn_meta_sln.py | 7 # a single meta-solution.
56 for solution in solutions:
57 vs_version = GetVSVersion(solution)
58 configs.append((out_dir, os.path.basename(solution),
103 # Create a new solution. We arbitrarily use the first config as the GUID source
108 'Microsoft Visual Studio Solution File, Format Version 12.00\n')
141 # Write solution file
213 print('Wrote meta solution to out/sln/' + name)
|
| /external/angle/build/win/ |
| D | gn_meta_sln.py | 7 # a single meta-solution.
56 for solution in solutions:
57 vs_version = GetVSVersion(solution)
58 configs.append((out_dir, os.path.basename(solution),
103 # Create a new solution. We arbitrarily use the first config as the GUID source
108 'Microsoft Visual Studio Solution File, Format Version 12.00\n')
141 # Write solution file
213 print('Wrote meta solution to out/sln/' + name)
|
| /external/lmfit/demo/ |
| D | nonlin1.c | 6 * Contents: Example for the solution of 2 nonlinear equations in 2 variables.
58 printf("Solution:\n"); in main()
63 /* convergence of lmfit is not enough to ensure validity of the solution */ in main()
65 printf( "not a valid solution, try other starting values\n" ); in main()
67 printf( "valid, though not the only solution: " in main()
|
| /external/tensorflow/tensorflow/core/kernels/ |
| D | isotonic_regression_op.cc | 108 // minima violate the inequality constraint, they are merged. The solution is
115 FloatTensor* solution, IntTensor* segments, int row_index) { in solve_pava() argument
116 const size_t n = solution->dimensions()[1]; in solve_pava()
135 auto* solution_ptr = &(*solution)(row_index, pool.col_start()); in solve_pava()
149 FloatTensor* solution, IntTensor* segments, in solve_pava_batch() argument
151 const int batch_size = solution->dimensions()[0]; in solve_pava_batch()
152 const int problem_size = solution->dimensions()[1]; in solve_pava_batch()
159 [&make_segment, &solution, &segments](int64_t row_start, in solve_pava_batch()
164 solve_pava(make_segment, solution, segments, row_index); in solve_pava_batch()
|
| /external/eigen/doc/ |
| D | WrongStackAlignment.dox | 25 \section sec_sol1 Local solution
27 A local solution is to mark such a function with this attribute:
35 …a macro which you leave empty on other platforms. The advantage of this solution is that you can f…
40 A global solution is to edit your project so that when compiling with GCC on Windows, you pass this…
46 Another global solution is to pass this option to gcc:
|
| /external/libpng/projects/visualc71/ |
| D | README_zlib.txt | 18 1) On the main menu, select "File | Open Solution".
21 2) Display the Solution Explorer view (Ctrl+Alt+L)
34 5) Select "Build | Clean Solution".
36 6) Select "Build | Build Solution (Ctrl-Shift-B)"
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| D | FieldDecompositionSolver.java | 28 * <p>Some solvers like {@link LUDecomposition} can only find the solution for
29 * square matrices and when the solution is an exact linear solution, i.e. when
32 * solution exists it is also the minimal norm solution.</p>
|
| D | DecompositionSolver.java | 27 * <p>Some solvers like {@link LUDecomposition} can only find the solution for
28 * square matrices and when the solution is an exact linear solution, i.e. when
31 * solution exists it is also the minimal norm solution.</p>
|
| /external/libpng/projects/vstudio/ |
| D | README.txt | 11 This directory contains a solution for building libpng under Microsoft
14 using this solution.
19 build with this 'solution'. Please read and edit zlib.props first.
59 This solution includes limited support for debug versions of libpng.
60 You do not need these unless your own solution itself uses debug builds
|
| /external/python/cpython2/PCbuild/ |
| D | readme.txt | 48 Then, to continue development, you can open the solution "pcbuild.sln" in
50 then build with "Build Solution". You can also build from the command
52 details. The solution is configured to build the projects in the correct
57 The solution currently supports two platforms. The Win32 platform is
63 Four configuration options are supported by the solution:
136 are managed by the pcbuild.sln solution file. Each sub-project is
275 as the values of certain properties in order for the build solution to
286 The solution has two configurations for PGO. The PGInstrument
304 The solution has no configuration for static libraries. However it is
315 The PCbuild solution makes use of Visual Studio property files (*.props)
|