| /external/libcxx/test/std/utilities/function.objects/arithmetic.operations/ |
| D | divides.pass.cpp | 22 typedef std::divides<int> F; in main()
29 typedef std::divides<> F2; in main()
35 constexpr int foo = std::divides<int> () (3, 2); in main()
38 constexpr double bar = std::divides<> () (3.0, 2); in main()
|
| D | transparent.pass.cpp | 43 static_assert ( !is_transparent<std::divides<int>>::value, "" ); in main()
44 static_assert ( !is_transparent<std::divides<std::string>>::value, "" ); in main()
45 static_assert ( is_transparent<std::divides<void>>::value, "" ); in main()
46 static_assert ( is_transparent<std::divides<>>::value, "" ); in main()
|
| /external/llvm-project/libcxx/test/std/utilities/function.objects/arithmetic.operations/ |
| D | divides.pass.cpp | 21 typedef std::divides<int> F; in main()
28 typedef std::divides<> F2; in main()
34 constexpr int foo = std::divides<int> () (3, 2); in main()
37 constexpr double bar = std::divides<> () (3.0, 2); in main()
|
| D | transparent.pass.cpp | 44 static_assert ( !is_transparent<std::divides<int>>::value, "" ); in main()
45 static_assert ( !is_transparent<std::divides<std::string>>::value, "" ); in main()
46 static_assert ( is_transparent<std::divides<void>>::value, "" ); in main()
47 static_assert ( is_transparent<std::divides<>>::value, "" ); in main()
|
| /external/tensorflow/tensorflow/lite/kernels/internal/reference/ |
| D | floor_div.h | 28 return std::floor(std::divides<double>()(static_cast<double>(input1), in FloorDiv()
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_SpaceToBatchND.pbtxt | 22 `block_shape[i]` divides `input_shape[i + 1] + pad_start + pad_end`.
131 This operation divides "spatial" dimensions `[1, ..., M]` of the input into a
|
| D | api_def_SparseDenseCwiseDiv.pbtxt | 34 summary: "Component-wise divides a SparseTensor by a dense Tensor."
|
| /external/llvm-project/llvm/test/Transforms/LoopUnroll/ |
| D | convergent.ll | 29 ; unrolled. The unroll count is the largest power of 2 that divides the
84 ; count 2 divides trip count 4. The loop unroll should respect the pragma.
105 ; count 2 divides trip multiple 2. The loop unroll should respect the pragma.
|
| /external/grpc-grpc/src/proto/math/ |
| D | math.proto | 43 // Div divides DivArgs.dividend by DivArgs.divisor and returns the quotient
|
| /external/rust/crates/grpcio-sys/grpc/src/proto/math/ |
| D | math.proto | 43 // Div divides DivArgs.dividend by DivArgs.divisor and returns the quotient
|
| /external/llvm-project/llvm/test/CodeGen/NVPTX/ |
| D | bypass-div.ll | 3 ; 64-bit divides and rems should be split into a fast and slow path where
|
| /external/llvm/test/CodeGen/NVPTX/ |
| D | bypass-div.ll | 3 ; 64-bit divides and rems should be split into a fast and slow path where
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| D | convergent.ll | 29 ; unrolled. The unroll count is the largest power of 2 that divides the
|
| /external/eigen/Eigen/src/Core/functors/ |
| D | StlFunctors.h | 24 struct functor_traits<std::divides<T> >
|
| /external/llvm/docs/ |
| D | CompileCudaWithLLVM.rst | 236 * **Bypassing 64-bit divides**. `An existing optimization
238 enabled in the NVPTX backend. 64-bit integer divides are much slower than
240 divides in our benchmarks have a divisor and dividend which fit in 32-bits at
|
| /external/llvm/test/Transforms/ConstantHoisting/ARM/ |
| D | bad-cases.ll | 49 ; We don't want to convert constant divides because the benefit from converting
|
| /external/rust/crates/num-integer/src/ |
| D | lib.rs | 212 fn divides(&self, other: &Self) -> bool; in divides() method
539 fn divides(&self, other: &Self) -> bool {
880 fn divides(&self, other: &Self) -> bool {
|
| /external/mesa3d/src/gallium/frontends/clover/util/ |
| D | functional.hpp | 69 struct divides { struct
|
| /external/llvm-project/llvm/test/Transforms/ConstantHoisting/X86/ |
| D | bad-cases.ll | 5 ; We don't want to convert constant divides because the benefit from converting
|
| /external/llvm-project/llvm/test/Transforms/IndVarSimplify/X86/ |
| D | pr45360.ll | 6 ; The remainder operation is originally guarded, it never divides by zero.
|
| /external/llvm-project/llvm/test/Transforms/ConstantHoisting/ARM/ |
| D | bad-cases.ll | 49 ; We don't want to convert constant divides because the benefit from converting
|
| /external/llvm-project/llvm/test/Transforms/LoopVectorize/ |
| D | memdep-fold-tail.ll | 12 ; Tiny trip count of 15 divides 3, but any (even) VF will have a tail.
|
| /external/python/cpython2/Doc/library/ |
| D | fractions.rst | 133 largest integer that divides both *a* and *b*. ``gcd(a,b)`` has the same
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/RISCV/ |
| D | RISCVSchedRocket32.td | 60 // 32-bit divides have worse case latency of 34 cycle
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/time/ |
| D | duration.cc | 468 return *this = ScaleFixed<std::divides>(*this, r); in operator /=()
476 return *this = ScaleDouble<std::divides>(*this, r); in operator /=()
|