HomeSort by relevance Sort by last modified time
    Searched refs:Reverse (Results 1 - 13 of 13) sorted by null

  /external/srec/tools/thirdparty/OpenFst/fst/lib/
reverse.h 0 // reverse.h
28 // reverse of A transduces the reverse of x to the reverse of y with
29 // weight a.Reverse().
31 // Typically, a = a.Reverse() and Arc = RevArc (e.g. for
36 void Reverse(const Fst<Arc> &ifst, MutableFst<RevArc> *ofst) {
60 RevArc oarc(0, 0, final.Reverse(), os);
68 RevArc oarc(iarc.ilabel, iarc.olabel, iarc.weight.Reverse(), os);
product-weight.h 84 ReverseWeight Reverse() const {
85 return ReverseWeight(value1_.Reverse(), value2_.Reverse());
float-weight.h 144 TropicalWeight Reverse() const { return *this; }
210 LogWeight Reverse() const { return *this; }
shortest-distance.h 28 #include "fst/lib/reverse.h"
212 // If 'reverse' is false, this computes the shortest distance from the
214 // 'distance' vector. If 'reverse' is true, this computes the shortest
220 // The weights must must be right (left) distributive if reverse is
232 bool reverse = false) {
236 if (!reverse) {
247 Reverse(fst, &rfst);
256 distance->push_back(rdistance[distance->size() + 1].Reverse());
shortest-path.h 255 // Algorithm works on the reverse of 'fst' : 'rfst' 'distance' is
257 // reverse of the tree of n-shortest path in 'rfst'.
262 Reverse(ifst, &rfst);
311 Arc arc(rarc.ilabel, rarc.olabel, rarc.weight.Reverse(), rarc.nextstate);
321 Weight finalw = rfst.Final(p.first).Reverse();
string-weight.h 114 ReverseWeight Reverse() const;
259 StringWeight<L, S>::Reverse() const {
minimize.h 36 #include "fst/lib/reverse.h"
203 Reverse(fst, &Tr_);
280 // reverse transition function
map.h 957 return B(arc.ilabel, arc.olabel, arc.weight.Reverse(), arc.nextstate);
  /external/webkit/JavaScriptCore/tests/mozilla/ecma/Array/
15.4.4.4-1.js 24 ECMA Section: 15.4.4.3-1 Array.prototype.reverse()
27 The elements of the array are rearranged so as to reverse their order.
59 Note that the reverse function is intentionally generic; it does not require
61 kinds of objects for use as a method. Whether the reverse function can be applied
64 Note: Array.prototype.reverse allows some flexibility in implementation
77 writeHeaderToLog( SECTION + " Array.prototype.reverse()");
86 testcases[testcases.length] = new TestCase( SECTION, "Array.prototype.reverse.length", 0, Array.prototype.reverse.length );
87 testcases[testcases.length] = new TestCase( SECTION, "delete Array.prototype.reverse.length", false, delete Array.prototype.reverse.length )
    [all...]
15.4.4.4-2.js 24 ECMA Section: 15.4.4.3-1 Array.prototype.reverse()
27 The elements of the array are rearranged so as to reverse their order.
59 Note that the reverse function is intentionally generic; it does not require
61 kinds of objects for use as a method. Whether the reverse function can be applied
64 Note: Array.prototype.reverse allows some flexibility in implementation
78 writeHeaderToLog( SECTION + " Array.prototype.reverse()");
86 testcases[testcases.length] = new TestCase( SECTION, "Array.prototype.reverse.length", 0, Array.prototype.reverse.length );
87 testcases[testcases.length] = new TestCase( SECTION, "delete Array.prototype.reverse.length", false, delete Array.prototype.reverse.length )
    [all...]
  /external/skia/include/effects/
SkLayerDrawLooper.h 48 static Rec* Reverse(Rec*);
  /external/skia/src/effects/
SkLayerDrawLooper.cpp 57 SkLayerDrawLooper::Rec* SkLayerDrawLooper::Rec::Reverse(Rec* head) {
111 // we're in reverse order, so fix it now
112 fRecs = Rec::Reverse(fRecs);
  /external/srec/tools/grxmlcompile/
grxmlcompile.cpp 822 cout << "info: creating reverse g fst" << endl;
830 fst::Reverse( g_fst, &grev_fst);
843 cout << "info: writing reverse G fst as text " << grevFilename << endl;
    [all...]

Completed in 238 milliseconds