/external/webkit/Tools/Scripts/webkitperl/VCSUtils_unittest/ |
parseSvnPropertyValue.pl | 70 diffName => "'Reverse-merged' change", 72 Reverse-merged /trunk/Makefile:r33020 175 diffName => "'Reverse-merged' change followed by 'Merge' change", 177 Reverse-merged /trunk/Makefile:r33020 195 diffName => "'Reverse-merged' change followed by 'Reverse-merged' change", 197 Reverse-merged /trunk/Makefile:r33020 198 Reverse-merged /trunk/Makefile.shared:r58350 200 expectedReturn => ["/trunk/Makefile:r33020", " Reverse-merged /trunk/Makefile.shared:r58350\n"], 205 diffName => "'Reverse-merged' change followed by 'Reverse-merged' change followed by 'Merged' change" [all...] |
parseSvnProperty.pl | 97 Reverse-merged /trunk/Makefile:r33020 113 Reverse-merged /trunk/Makefile:r33020 133 Reverse-merged /trunk/Makefile:r33020 547 diffName => "'Reverse-merged' change followed by 'Reverse-merged' change", 550 Reverse-merged /trunk/Makefile:r33020 551 Reverse-merged /trunk/Makefile.shared:r58350
|
parseSvnDiffFooter.pl | 84 Reverse-merged /trunk/Makefile:r33020 100 Reverse-merged /trunk/Makefile:r33020
|
/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
|
/external/webkit/Source/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...] |
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/ |
trie_policy.hpp | 59 template<typename String, typename String::value_type Min_E_Val, typename String::value_type Max_E_Val, bool Reverse, typename Allocator> 62 string_trie_e_access_traits<String, Min_E_Val,Max_E_Val,Reverse,Allocator> 68 bool Reverse = false, 80 reverse = Reverse enumerator in enum:__gnu_pbds::string_trie_e_access_traits::__anon19993 84 typedef typename detail::__conditional_type<Reverse, typename String::const_reverse_iterator, typename String::const_iterator>::__type const_iterator; 125 static detail::integral_constant<int, Reverse> s_rev_ind;
|
/prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
trie_policy.hpp | 59 template<typename String, typename String::value_type Min_E_Val, typename String::value_type Max_E_Val, bool Reverse, typename Allocator> 62 string_trie_e_access_traits<String, Min_E_Val,Max_E_Val,Reverse,Allocator> 68 bool Reverse = false, 80 reverse = Reverse enumerator in enum:__gnu_pbds::string_trie_e_access_traits::__anon24378 84 typedef typename detail::__conditional_type<Reverse, typename String::const_reverse_iterator, typename String::const_iterator>::__type const_iterator; 125 static detail::integral_constant<int, Reverse> s_rev_ind;
|
/prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
trie_policy.hpp | 59 template<typename String, typename String::value_type Min_E_Val, typename String::value_type Max_E_Val, bool Reverse, typename Allocator> 62 string_trie_e_access_traits<String, Min_E_Val,Max_E_Val,Reverse,Allocator> 68 bool Reverse = false, 80 reverse = Reverse enumerator in enum:__gnu_pbds::string_trie_e_access_traits::__anon25476 84 typedef typename detail::__conditional_type<Reverse, typename String::const_reverse_iterator, typename String::const_iterator>::__type const_iterator; 125 static detail::integral_constant<int, Reverse> s_rev_ind;
|
/prebuilt/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
trie_policy.hpp | 59 template<typename String, typename String::value_type Min_E_Val, typename String::value_type Max_E_Val, bool Reverse, typename Allocator> 62 string_trie_e_access_traits<String, Min_E_Val,Max_E_Val,Reverse,Allocator> 68 bool Reverse = false, 80 reverse = Reverse enumerator in enum:__gnu_pbds::string_trie_e_access_traits::__anon30148 84 typedef typename detail::__conditional_type<Reverse, typename String::const_reverse_iterator, typename String::const_iterator>::__type const_iterator; 125 static detail::integral_constant<int, Reverse> s_rev_ind;
|
/external/skia/include/effects/ |
SkLayerDrawLooper.h | 106 static Rec* Reverse(Rec*);
|
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/trie_policy/ |
string_trie_e_access_traits_imp.hpp | 43 detail::integral_constant<int, Reverse> PB_DS_CLASS_C_DEC::s_rev_ind;
|
/prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/ |
string_trie_e_access_traits_imp.hpp | 43 detail::integral_constant<int, Reverse> PB_DS_CLASS_C_DEC::s_rev_ind;
|
/prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/ |
string_trie_e_access_traits_imp.hpp | 43 detail::integral_constant<int, Reverse> PB_DS_CLASS_C_DEC::s_rev_ind;
|
/prebuilt/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/ |
string_trie_e_access_traits_imp.hpp | 43 detail::integral_constant<int, Reverse> PB_DS_CLASS_C_DEC::s_rev_ind;
|
/external/llvm/utils/TableGen/ |
SetTheory.cpp | 109 const bool Reverse; 111 RotOp(bool Rev) : Reverse(Rev) {} 116 if (Reverse)
|
/external/llvm/include/llvm/ADT/ |
PostOrderIterator.h | 167 ipo_iterator<T> ipo_begin(T G, bool Reverse = false) { 168 return ipo_iterator<T>::begin(G, Reverse); 197 // Reverse Post Order CFG iterator code 200 // This is used to visit basic blocks in a method in reverse post order. This 233 // Because we want a reverse post order, use reverse iterators from the vector
|
/external/skia/src/effects/ |
SkLayerDrawLooper.cpp | 163 SkLayerDrawLooper::Rec* SkLayerDrawLooper::Rec::Reverse(Rec* head) { 226 // we're in reverse order, so fix it now 227 fRecs = Rec::Reverse(fRecs);
|
/external/pcre/ |
pcre_internal.h | [all...] |