| /external/libcxx/test/std/utilities/function.objects/arithmetic.operations/ |
| D | divides.pass.cpp | 20 typedef std::divides<int> F; in main()
27 typedef std::divides<> F2; in main()
33 constexpr int foo = std::divides<int> () (3, 2); in main()
36 constexpr int 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/docs/ |
| D | CompileCudaWithLLVM.rst | 164 * **Bypassing 64-bit divides**. `An existing optimization
166 enabled in the NVPTX backend. 64-bit integer divides are much slower than
168 divides in our benchmarks have a divisor and dividend which fit in 32-bits at
|
| D | Passes.rst | 43 The table below divides the passes that LLVM provides into three categories.
|
| /external/opencv3/modules/core/include/opencv2/core/cuda/ |
| D | functional.hpp | 98 template <typename T> struct divides : binary_function<T, T, T> struct
105 __host__ __device__ __forceinline__ divides() {} in divides() argument
106 __host__ __device__ __forceinline__ divides(const divides&) {} in divides() argument
|
| /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/v8/test/unittests/compiler/ |
| D | typer-unittest.cc | 268 std::divides<double>()); in TEST_F()
270 std::divides<double>()); in TEST_F()
|
| /external/mesa3d/src/gallium/state_trackers/clover/api/ |
| D | kernel.cpp | 254 std::divides<size_t>(), grid_size.begin(), grid_size.end(), in kernel_op()
|
| /external/opencv3/modules/cudev/include/opencv2/cudev/expr/ |
| D | binary_op.hpp | 215 CV_CUDEV_EXPR_BINOP_INST(/, divides)
|
| /external/opencv3/doc/py_tutorials/py_ml/py_svm/py_svm_basics/ |
| D | py_svm_basics.markdown | 22 Consider another idea. We find a line, \f$f(x)=ax_1+bx_2+c\f$ which divides both the data to two
|
| /external/libcxx/include/ |
| D | valarray | 3684 __val_expr<_BinaryOp<divides<typename _Expr1::value_type>, _Expr1, _Expr2> >
3689 typedef _BinaryOp<divides<value_type>, _Expr1, _Expr2> _Op;
3690 return __val_expr<_Op>(_Op(divides<value_type>(), __x, __y));
3698 __val_expr<_BinaryOp<divides<typename _Expr::value_type>,
3704 typedef _BinaryOp<divides<value_type>, _Expr, __scalar_expr<value_type> > _Op;
3705 return __val_expr<_Op>(_Op(divides<value_type>(),
3714 __val_expr<_BinaryOp<divides<typename _Expr::value_type>,
3720 typedef _BinaryOp<divides<value_type>, __scalar_expr<value_type>, _Expr> _Op;
3721 return __val_expr<_Op>(_Op(divides<value_type>(),
|
| D | functional | 90 struct divides : binary_function<T, T, T>
574 struct _LIBCPP_TYPE_VIS_ONLY divides : binary_function<_Tp, _Tp, _Tp>
583 struct _LIBCPP_TYPE_VIS_ONLY divides<void>
|
| /external/opencv3/modules/cudev/include/opencv2/cudev/functional/ |
| D | functional.hpp | 104 template <typename T> struct divides : binary_function<T, T, T> struct
|
| /external/compiler-rt/lib/builtins/ |
| D | README.txt | 251 // divides two 128-bit double-double precision values ( x / y )
|
| /external/eigen/Eigen/src/Core/ |
| D | Functors.h | 921 struct functor_traits<std::divides<T> >
|
| /external/llvm/docs/CommandGuide/ |
| D | FileCheck.rst | 327 other unique identifiers. Conceptually, the presence of ``CHECK-LABEL`` divides
|
| /external/libogg/doc/ |
| D | rfc3533.txt | 329 several pages. To simplify that process, Ogg divides each packet
|
| /external/mesa3d/docs/ |
| D | VERSIONS | 1261 - frag prog TEX instruction no longer incorrectly divides s,t,r by q
|
| /external/avahi/specs/ |
| D | draft-cheshire-dnsext-multicastdns-06.txt | 2112 answers to fit into a single packet, it divides the known answer list
|
| /external/libxml2/ |
| D | ChangeLog | 16048 This fixes a bug reported by Stephan Kulow and nearly divides
|
| /external/tpm2/ |
| D | part4.txt | 30903 179 // Let a be the largest integer such that 2^a divides w1.
|