Home
last modified time | relevance | path

Searched refs:Reverse (Results 1 – 25 of 99) sorted by relevance

1234

/external/openfst/src/script/
Dreverse.cc24 void Reverse(const FstClass &fst1, MutableFstClass *fst2) { in Reverse() function
32 REGISTER_FST_OPERATION(Reverse, StdArc, ReverseArgs);
33 REGISTER_FST_OPERATION(Reverse, LogArc, ReverseArgs);
34 REGISTER_FST_OPERATION(Reverse, Log64Arc, ReverseArgs);
/external/eigen/Eigen/src/Core/
DReverse.h34 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/openfst/src/include/fst/script/
Dreverse.h30 void Reverse(ReverseArgs *args) { in Reverse() function
34 Reverse(fst1, fst2); in Reverse()
37 void Reverse(const FstClass &fst1, MutableFstClass *fst2);
Drmepsilon.h143 Reverse(ifst, &rfst); in RmEpsilon()
145 Reverse(rfst, ofst); in RmEpsilon()
/external/eigen/test/
Darray_reverse.cpp38 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/openfst/src/include/fst/
Dreverse.h43 void Reverse(const Fst<Arc> &ifst, MutableFst<RevArc> *ofst) { in Reverse() function
69 RevArc oarc(0, 0, final.Reverse(), os); in Reverse()
77 RevArc oarc(iarc.ilabel, iarc.olabel, iarc.weight.Reverse(), os); in Reverse()
Dproduct-weight.h41 using PairWeight<W1, W2>::Reverse;
84 ReverseWeight Reverse() const { in Reverse() function
85 return PairWeight<W1, W2>::Reverse(); in Reverse()
Dexpectation-weight.h54 using PairWeight<X1, X2>::Reverse;
100 ReverseWeight Reverse() const { in Reverse() function
101 return PairWeight<X1, X2>::Reverse(); in Reverse()
Dlexicographic-weight.h50 using PairWeight<W1, W2>::Reverse;
108 ReverseWeight Reverse() const { in Reverse() function
109 return PairWeight<W1, W2>::Reverse(); in Reverse()
Dpower-weight.h45 using TupleWeight<W, n>::Reverse;
91 ReverseWeight Reverse() const { in Reverse() function
92 return TupleWeight<W, n>::Reverse(); in Reverse()
Dsparse-power-weight.h86 using SparseTupleWeight<W, K>::Reverse;
143 ReverseWeight Reverse() const { in Reverse() function
144 return SparseTupleWeight<W, K>::Reverse(); in Reverse()
Dpair-weight.h102 ReverseWeight Reverse() const { in Reverse() function
103 return ReverseWeight(value1_.Reverse(), value2_.Reverse()); in Reverse()
Dshortest-path.h359 Arc arc(rarc.ilabel, rarc.olabel, rarc.weight.Reverse(), rarc.nextstate);
369 Weight finalw = ifst.Final(p.first).Reverse();
444 Reverse(ifst, &rfst); in ShortestPath()
451 d = Plus(d, Times(arc.weight.Reverse(), (*distance)[s])); in ShortestPath()
Dsigned-log-weight.h40 using PairWeight<X1, X2>::Reverse;
81 ReverseWeight Reverse() const { in Reverse() function
82 return PairWeight<X1, X2>::Reverse(); in Reverse()
/external/openfst/src/test/
Dweight-tester.h159 ReverseWeight rw1 = w1.Reverse(); in TestReverse()
160 ReverseWeight rw2 = w2.Reverse(); in TestReverse()
162 CHECK(rw1.Reverse() == w1); in TestReverse()
163 CHECK(Plus(w1, w2).Reverse() == Plus(rw1, rw2)); in TestReverse()
164 CHECK(Times(w1, w2).Reverse() == Times(rw2, rw1)); in TestReverse()
Dalgo_test.h575 Reverse(T, &R1); in TestSort()
576 Reverse(R1, &R2); in TestSort()
663 Reverse(A, &R); in TestOptimize()
667 Reverse(DR, &RD); in TestOptimize()
741 Reverse(T, &R); in TestOptimize()
742 Prune(&R, thresold.Reverse()); in TestOptimize()
743 Reverse(R, &P2); in TestOptimize()
1058 Reverse(A, &R); in TestOptimize()
1062 Reverse(DR, &RD); in TestOptimize()
/external/icu/icu4c/source/data/brkitr/
Dtitle.txt27 # 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/openfst/src/bin/
Dfstreverse.cc34 using fst::script::Reverse; in main()
55 Reverse(*ifst, out); in main()
/external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/
Dcmspack.c101 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/openfst/src/include/fst/extensions/pdt/
Dreverse.h38 void Reverse(const Fst<Arc> &ifst, in Reverse() function
45 Reverse(ifst, ofst); in Reverse()
/external/llvm/include/llvm/ADT/
DPostOrderIterator.h218 ipo_iterator<T> ipo_begin(const T &G, bool Reverse = false) {
219 return ipo_iterator<T>::begin(G, Reverse);
228 iterator_range<ipo_iterator<T>> inverse_post_order(const T &G, bool Reverse = false) {
229 return make_range(ipo_begin(G, Reverse), ipo_end(G));
/external/eigen/blas/
Dlevel1_real_impl.h70 Reverse<StridedVectorType> rvx(vx); in EIGEN_BLAS_FUNC()
71 Reverse<StridedVectorType> rvy(vy); in EIGEN_BLAS_FUNC()
Dlevel1_cplx_impl.h102 Reverse<StridedVectorType> rvx(vx);
103 Reverse<StridedVectorType> rvy(vy);
/external/pdfium/core/src/fpdfapi/fpdf_cmaps/
Dcmap_int.h11 typedef enum { None, Single, Range, Reverse } MapType; enumerator
/external/llvm/lib/TableGen/
DSetTheory.cpp115 const bool Reverse; member
117 RotOp(bool Rev) : Reverse(Rev) {} in RotOp()
121 if (Reverse) in apply2()

1234