| /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)
|
| /external/chromium_org/crypto/ |
| D | ghash.cc | 43 int Reverse(int i) { in Reverse() function
62 product_table_[Reverse(1)] = x; in GaloisHash()
65 product_table_[Reverse(i)] = Double(product_table_[Reverse(i/2)]); in GaloisHash()
66 product_table_[Reverse(i+1)] = Add(product_table_[Reverse(i)], x); in GaloisHash()
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| D | reverse.h | 36 void Reverse(const Fst<Arc> &ifst, MutableFst<RevArc> *ofst) { in Reverse() function
60 RevArc oarc(0, 0, final.Reverse(), os); in Reverse()
68 RevArc oarc(iarc.ilabel, iarc.olabel, iarc.weight.Reverse(), os); in Reverse()
|
| D | product-weight.h | 84 ReverseWeight Reverse() const { in Reverse() function
85 return ReverseWeight(value1_.Reverse(), value2_.Reverse()); in Reverse()
|
| D | float-weight.h | 144 TropicalWeight Reverse() const { return *this; } in Reverse() function
210 LogWeight Reverse() const { return *this; } in Reverse() function
|
| D | shortest-distance.h | 247 Reverse(fst, &rfst);
256 distance->push_back(rdistance[distance->size() + 1].Reverse());
|
| D | shortest-path.h | 262 Reverse(ifst, &rfst); in ShortestPath()
311 Arc arc(rarc.ilabel, rarc.olabel, rarc.weight.Reverse(), rarc.nextstate); in ShortestPath()
321 Weight finalw = rfst.Final(p.first).Reverse(); in ShortestPath()
|
| /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/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
|
| /external/pdfium/core/src/fxcodec/lcms2/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/chromium_org/third_party/brotli/src/brotli/enc/ |
| D | entropy_encode.cc | 161 void Reverse(uint8_t* v, int start, int end) { in Reverse() function
207 Reverse(tree, start, *tree_size); in WriteHuffmanTreeRepetitions()
208 Reverse(extra_bits, start, *tree_size); in WriteHuffmanTreeRepetitions()
239 Reverse(tree, start, *tree_size); in WriteHuffmanTreeRepetitionsZeros()
240 Reverse(extra_bits, start, *tree_size); in WriteHuffmanTreeRepetitionsZeros()
|
| /external/chromium_org/third_party/leveldatabase/src/table/ |
| D | table_test.cc | 27 static std::string Reverse(const Slice& key) { in Reverse() function
45 return BytewiseComparator()->Compare(Reverse(a), Reverse(b)); in Compare()
51 std::string s = Reverse(*start); in FindShortestSeparator()
52 std::string l = Reverse(limit); in FindShortestSeparator()
54 *start = Reverse(s); in FindShortestSeparator()
58 std::string s = Reverse(*key); in FindShortSuccessor()
60 *key = Reverse(s); in FindShortSuccessor()
71 std::string rev = Reverse(*key); in Increment()
73 *key = Reverse(rev); in Increment()
|
| /external/chromium_org/native_client_sdk/src/examples/tutorial/dlopen/ |
| D | reverse.h | 10 extern "C" char* Reverse(const char*);
|
| D | reverse.cc | 9 extern "C" char* Reverse(const char* s) { in Reverse() function
|
| /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/chromium_org/content/renderer/compositor_bindings/ |
| D | web_animation_impl.cc | 113 case cc::Animation::Reverse: in direction()
131 animation_->set_direction(cc::Animation::Reverse); in setDirection()
|
| /external/pdfium/core/src/fpdfapi/fpdf_cmaps/ |
| D | cmap_int.h | 10 typedef enum { None, Single, Range, Reverse } MapType; enumerator
|
| /external/chromium_org/cc/animation/ |
| D | animation_unittest.cc | 61 anim->set_direction(Animation::Reverse); in TEST()
155 anim->set_direction(Animation::Reverse); in TEST()
177 anim->set_direction(Animation::Reverse); in TEST()
197 anim->set_direction(Animation::Reverse); in TEST()
219 anim->set_direction(Animation::Reverse); in TEST()
244 anim->set_direction(Animation::Reverse); in TEST()
|
| D | animation.h | 52 enum Direction { Normal, Reverse, Alternate, AlternateReverse }; enumerator
|
| /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/llvm/include/llvm/ADT/ |
| D | PostOrderIterator.h | 206 ipo_iterator<T> ipo_begin(T G, bool Reverse = false) {
207 return ipo_iterator<T>::begin(G, Reverse);
|
| /external/ceres-solver/include/ceres/ |
| D | ordered_groups.h | 123 void Reverse() { in Reverse() function
|
| /external/qemu/target-mips/ |
| D | TODO | 18 - Reverse endianness bit not implemented
|
| /external/llvm/test/Analysis/CostModel/ARM/ |
| D | shuffle.ll | 9 ;; Reverse shuffles should be lowered to vrev and possibly a vext (for
|