| /external/eigen/Eigen/src/Core/ |
| D | Reverse.h | 34 struct traits<Reverse<MatrixType, Direction> >
70 template<typename MatrixType, int Direction> class Reverse
71 : public internal::dense_xpr_base< Reverse<MatrixType, Direction> >::type
75 typedef typename internal::dense_xpr_base<Reverse>::type Base;
76 EIGEN_DENSE_PUBLIC_INTERFACE(Reverse)
98 inline Reverse(const MatrixType& matrix) : m_matrix(matrix) { }
100 EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Reverse)
|
| D | VectorwiseOp.h | 409 const Reverse<ExpressionType, Direction> reverse() const
410 { return Reverse<ExpressionType, Direction>( _expression() ); }
|
| D | DenseBase.h | 472 typedef Reverse<Derived, BothDirections> ReverseReturnType;
473 typedef const Reverse<const Derived, BothDirections> ConstReverseReturnType;
|
| /external/eigen/test/ |
| D | array_reverse.cpp | 38 Reverse<MatrixType> m1_rd(m1); in reverse()
46 Reverse<MatrixType, BothDirections> m1_rb(m1); in reverse()
54 Reverse<MatrixType, Vertical> m1_rv(m1); in reverse()
62 Reverse<MatrixType, Horizontal> m1_rh(m1); in reverse()
|
| /external/pdfium/third_party/lcms2-2.6/src/ |
| D | cmspack.c | 101 int Reverse = T_FLAVOR(info ->InputFormat); in UnrollChunkyBytes() local
116 v = Reverse ? REVERSE_FLAVOR_16(v) : v; in UnrollChunkyBytes()
149 int Reverse = T_FLAVOR(info ->InputFormat); in UnrollPlanarBytes() local
162 wIn[index] = Reverse ? REVERSE_FLAVOR_16(v) : v; in UnrollPlanarBytes()
479 int Reverse = T_FLAVOR(info ->InputFormat); in UnrollAnyWords() local
497 wIn[index] = Reverse ? REVERSE_FLAVOR_16(v) : v; in UnrollAnyWords()
527 int Reverse= T_FLAVOR(info ->InputFormat); in UnrollPlanarWords() local
544 wIn[index] = Reverse ? REVERSE_FLAVOR_16(v) : v; in UnrollPlanarWords()
925 int Reverse = T_FLAVOR(info ->InputFormat); in UnrollDoubleTo16() local
950 if (Reverse) in UnrollDoubleTo16()
[all …]
|
| /external/icu/icu4c/source/data/brkitr/ |
| D | title.txt | 27 # Reverse Rules
42 # Safe Reverse: the exact forward rule must not start in the middle
50 # Safe Forward, nothing needs to be done, the exact Reverse rules will
|
| D | sent_el.txt | 93 # Reverse rules.
|
| D | sent.txt | 93 # Reverse rules.
|
| /external/eigen/blas/ |
| D | level1_real_impl.h | 70 Reverse<StridedVectorType> rvx(vx); in EIGEN_BLAS_FUNC()
71 Reverse<StridedVectorType> rvy(vy); in EIGEN_BLAS_FUNC()
|
| D | level1_cplx_impl.h | 102 Reverse<StridedVectorType> rvx(vx);
103 Reverse<StridedVectorType> rvy(vy);
|
| /external/pdfium/core/src/fpdfapi/fpdf_cmaps/ |
| D | cmap_int.h | 13 enum MapType { None, Single, Range, Reverse }; enumerator
|
| /external/pdfium/xfa/src/fxbarcode/common/ |
| D | BC_CommonBitArray.h | 24 void Reverse();
|
| D | BC_CommonBitArray.cpp | 100 void CBC_CommonBitArray::Reverse() { in Reverse() function in CBC_CommonBitArray
|
| /external/llvm/lib/TableGen/ |
| D | SetTheory.cpp | 115 const bool Reverse; member
117 RotOp(bool Rev) : Reverse(Rev) {} in RotOp()
121 if (Reverse) in apply2()
|
| /external/ceres-solver/include/ceres/ |
| D | ordered_groups.h | 123 void Reverse() { in Reverse() function
|
| /external/llvm/test/Analysis/CostModel/ARM/ |
| D | shuffle.ll | 9 ;; Reverse shuffles should be lowered to vrev and possibly a vext (for
|
| /external/pdfium/xfa/src/fxbarcode/oned/ |
| D | BC_OneDReader.cpp | 80 row->Reverse(); in DeDecode()
|
| /external/ceres-solver/internal/ceres/ |
| D | coordinate_descent_minimizer.cc | 265 ordering->Reverse(); in CreateOrdering()
|
| D | ordered_groups_test.cc | 151 ordering.Reverse(); in TEST()
|
| /external/llvm/test/CodeGen/SystemZ/ |
| D | int-cmp-45.ll | 35 ; Reverse the select order and test with LOCR.
|
| /external/icu/icu4c/source/data/mappings/ |
| D | gsm-03.38-2000.ucm | 29 # (Reverse fallbacks to U+00A0 would result in Unicode text that cannot be
|
| /external/libavc/common/arm/ |
| D | ih264_iquant_itrans_recon_a9.s | 179 vswp d6, d7 @Reverse positions of x2 and x3
204 vswp d16, d17 @Reverse positions of x2 and x3
353 vswp d6, d7 @Reverse positions of x2 and x3
379 vswp d16, d17 @Reverse positions of x2 and x3
|
| /external/llvm/lib/Transforms/Vectorize/ |
| D | LoopVectorize.cpp | 688 Reverse = Stride < 0; in InterleaveGroup()
692 bool isReverse() const { return Reverse; } in isReverse()
757 bool Reverse; member in __anon63bf7e8f0111::InterleaveGroup
2385 bool Reverse = ConsecutiveStride < 0; in vectorizeMemoryInstruction() local
2462 if (Reverse) { in vectorizeMemoryInstruction()
2495 if (Reverse) { in vectorizeMemoryInstruction()
2513 Entry[Part] = Reverse ? reverseVector(NewLI) : NewLI; in vectorizeMemoryInstruction()
5484 bool Reverse = ConsecutiveStride < 0; in getInstructionCost() local
5520 if (Reverse) in getInstructionCost()
|
| /external/lzma/DOC/ |
| D | lzma-specification.txt | 799 "Reverse" scheme. It uses separated binary tree for each posSlot from 4 to 13.
802 tree with "Reverse" scheme, where one common binary tree "AlignDecoder"
811 (one separated bit tree decoder per one posSlot value) and "Reverse" scheme.
817 decoder "AlignDecoder" with "Reverse" scheme.
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | ThreadSafetyCommon.h | 385 CallingContext *Ctx, bool Reverse = false);
|