/external/llvm-project/flang/lib/Evaluate/ |
D | int-power.h | 32 REAL squares{base}; 37 result.value = result.value.Divide(squares, rounding) 40 result.value = result.value.Multiply(squares, rounding) 44 squares = 45 squares.Multiply(squares, rounding).AccumulateFlags(result.flags);
|
/external/skia/gm/ |
D | thinrects.cpp | 122 constexpr SkRect squares[] = { in drawSquares() local 133 for (size_t j = 0; j < SK_ARRAY_COUNT(squares); ++j) { in drawSquares() 135 rrect.setRectXY(squares[j], 1/32.f, 2/32.f); in drawSquares() 138 canvas->drawRect(squares[j], p); in drawSquares()
|
/external/eigen/doc/ |
D | LeastSquares.dox | 3 /** \eigenManualPage LeastSquares Solving linear least squares systems 5 This page describes how to solve linear least squares systems using %Eigen. An overdetermined system 20 solve linear squares systems. It is not enough to compute only the singular values (the default for 22 computing least squares solutions: 37 The solve() method in QR decomposition classes also computes the least squares solution. There are 53 Finding the least squares solution of \a Ax = \a b is equivalent to solving the normal equation
|
D | TutorialLinearAlgebra.dox | 184 \section TutorialLinAlgLeastsquares Least squares solving 186 The most accurate method to do least squares solving is with a SVD decomposition. Eigen provides one 187 as the JacobiSVD class, and its solve() is doing least-squares solving. 199 normal matrix or a QR decomposition. Our page on \link LeastSquares least squares solving \endlink
|
/external/skqp/gm/ |
D | thinrects.cpp | 100 constexpr SkRect squares[] = { in DrawSquares() local 110 for (size_t j = 0; j < SK_ARRAY_COUNT(squares); ++j) { in DrawSquares() 111 canvas->drawRect(squares[j], p); in DrawSquares()
|
/external/pigweed/pw_containers/ |
D | docs.rst | 77 pw::IntrusiveList<Square> squares; 83 // `IntrusiveList<Square> squares`. 84 squares.push_back(small); 85 squares.push_back(large); 90 squares.push_back(&different_scope); 93 for (auto& square : squares) {
|
/external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/test/guide/ |
D | example-channel-03.kt | 16 val squares = produceSquares() in <lambda>() constant 17 squares.consumeEach { println(it) } in <lambda>()
|
D | example-channel-04.kt | 13 val squares = square(numbers) // squares integers in <lambda>() constant 15 println(squares.receive()) // print first five in <lambda>()
|
/external/rust/crates/rayon/tests/ |
D | issue671-unzip.rs | 8 let (indexes, (squares, cubes)): (Vec<_>, (Vec<_>, Vec<_>)) = input in type_length_limit() 15 drop(squares); in type_length_limit()
|
/external/python/cpython2/Lib/test/ |
D | test_generators.py | 1127 squares = [" " for j in range(n)] 1128 squares[row2col[i]] = "Q" 1129 print "|" + "|".join(squares) + "|" 1314 squares = [[None] * n for i in range(m)] 1318 squares[i1][j1] = format % k 1324 row = squares[i]
|
/external/ImageMagick/MagickCore/ |
D | segment.c | 259 if (squares != (double *) NULL) \ in Classify() 261 squares-=255; \ in Classify() 262 free_squares=squares; \ in Classify() 295 *squares; in Classify() local 309 squares=(double *) NULL; in Classify() 518 squares=(double *) AcquireQuantumMemory(513UL,sizeof(*squares)); in Classify() 519 if (squares == (double *) NULL) in Classify() 522 squares+=255; in Classify() 524 squares[i]=(double) i*(double) i; in Classify() 619 squares[(ssize_t) (pixel.red-ScaleQuantumToChar(p->red))]+ in Classify() [all …]
|
/external/tensorflow/tensorflow/core/api_def/base_api/ |
D | api_def_MatrixSolveLs.pbtxt | 31 summary: "Solves one or more linear least-squares problems." 39 in the least squares sense. 51 \\(X = (A^H A + \lambda I)^{-1} A^H B\\), which solves the least-squares 64 least-squares solution, even when \\(A\\) is rank deficient. This path is
|
/external/tensorflow/tensorflow/core/graph/ |
D | graph_partition_test.cc | 575 std::vector<ops::Square> squares; in TEST() local 577 squares.emplace_back(root.WithOpName(strings::StrCat("s", i)), in TEST() 579 squares.back().node()->AddAttr("_start_time", 50 - (i + 1)); in TEST() 584 for (const auto& s : squares) inputs.push_back(s); in TEST() 598 ASSERT_EQ(1 + squares.size() + placeholders.size(), nodes.size()); in TEST() 605 for (int i = 0; i < squares.size(); ++i) { in TEST() 670 std::vector<Square> squares; in TEST() local 671 squares.reserve(indexes.size()); in TEST() 673 squares.emplace_back(root.WithOpName(strings::StrCat("s", i)), in TEST() 675 squares.back().node()->AddAttr("_start_time", 500 - (i + 1)); in TEST() [all …]
|
/external/tensorflow/tensorflow/tools/android/test/jni/object_tracking/ |
D | object_detector.h | 59 std::vector<BoundingSquare>* const squares) { in FillWithSquares() argument 68 squares->push_back(descriptor_area); in FillWithSquares() 74 squares->size(), starting_square_size, smallest_square_size, in FillWithSquares()
|
/external/deqp/external/vulkancts/modules/vulkan/ray_query/ |
D | vktRayQueryCullRayFlagsTests.cpp | 672 std::vector<std::vector<tcu::UVec2>> squares = in verifyImage() local 714 for (deUint32 squareNdx = 0; squareNdx < squares.size(); ++squareNdx) in verifyImage() 717 for (deUint32 y = squares[squareNdx][0].y(); y < squares[squareNdx][1].y(); ++y) in verifyImage() 718 for (deUint32 x = squares[squareNdx][0].x(); x < squares[squareNdx][1].x(); ++x) in verifyImage() 866 std::vector<std::vector<tcu::UVec2>> squares = in verifyImage() local 877 for (deUint32 squareNdx = 0; squareNdx < squares.size(); ++squareNdx) in verifyImage() 880 for (deUint32 y = squares[squareNdx][0].y(); y < squares[squareNdx][1].y(); ++y) in verifyImage() 881 for (deUint32 x = squares[squareNdx][0].x(); x < squares[squareNdx][1].x(); ++x) in verifyImage() 1125 std::vector<std::vector<tcu::UVec2>> squares = in verifyImage() local 1136 for (deUint32 squareNdx = 0; squareNdx < squares.size(); ++squareNdx) in verifyImage() [all …]
|
/external/lmfit/man/ |
D | lmfit.pod | 11 lmfit - Levenberg-Marquardt least-squares minimization 16 B<lmfit> is a C library for Levenberg-Marquardt least-squares minimization and curve fitting. It is…
|
/external/fec/ |
D | sumsq_mmx_assist.s | 7 # Evaluate sum of squares of signed 16-bit input samples 49 # Evaluate sum of squares of signed 16-bit input samples
|
D | sumsq_sse2_assist.s | 6 # Evaluate sum of squares of signed 16-bit input samples
|
/external/python/cpython3/Lib/test/ |
D | test_generators.py | 1570 squares = [" " for j in range(n)] 1571 squares[row2col[i]] = "Q" 1572 print("|" + "|".join(squares) + "|") 1757 squares = [[None] * n for i in range(m)] 1761 squares[i1][j1] = format % k 1767 row = squares[i]
|
/external/lmfit/ |
D | lmfit.pc.in | 7 Description: Levenberg-Marquardt mean-squares minimization and curve fitting
|
D | configure.ac | 2 # Levenberg-Marquardt least squares fitting
|
/external/tensorflow/tensorflow/core/lib/gif/testdata/ |
D | BUILD | 17 "squares.gif",
|
/external/libvpx/libvpx/vp9/encoder/x86/ |
D | vp9_error_sse2.asm | 36 ; individual errors are max. 15bit+sign, so squares are 30bit, and 92 ; individual errors are max. 15bit+sign, so squares are 30bit, and
|
/external/python/cpython3/Doc/tutorial/ |
D | introduction.rst | 382 >>> squares = [1, 4, 9, 16, 25] 383 >>> squares 389 >>> squares[0] # indexing returns the item 391 >>> squares[-1] 393 >>> squares[-3:] # slicing returns a new list 400 >>> squares[:] 405 >>> squares + [36, 49, 64, 81, 100]
|
/external/python/cpython2/Doc/tutorial/ |
D | introduction.rst | 476 >>> squares = [1, 4, 9, 16, 25] 477 >>> squares 483 >>> squares[0] # indexing returns the item 485 >>> squares[-1] 487 >>> squares[-3:] # slicing returns a new list 493 >>> squares[:] 498 >>> squares + [36, 49, 64, 81, 100]
|