| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/ |
| trie_policy.hpp | 60 template<typename String, typename String::value_type Min_E_Val, typename String::value_type Max_E_Val, bool Reverse, typename Allocator>
63 string_trie_e_access_traits<String, Min_E_Val,Max_E_Val,Reverse,Allocator>
69 bool Reverse = false,
81 reverse = Reverse enumerator in enum:__gnu_pbds::string_trie_e_access_traits::__anon30175
85 typedef typename detail::__conditional_type<Reverse, typename String::const_reverse_iterator, typename String::const_iterator>::__type const_iterator;
126 static detail::integral_constant<int, Reverse> s_rev_ind;
|
| /prebuilts/ndk/5/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::__anon33088
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;
|
| /prebuilts/ndk/6/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::__anon34186
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;
|
| /prebuilts/ndk/7/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::__anon38858
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;
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/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::__anon43065
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;
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/ |
| trie_policy.hpp | 60 template<typename String, typename String::value_type Min_E_Val, typename String::value_type Max_E_Val, bool Reverse, typename Allocator>
63 string_trie_e_access_traits<String, Min_E_Val,Max_E_Val,Reverse,Allocator>
69 bool Reverse = false,
81 reverse = Reverse enumerator in enum:__gnu_pbds::string_trie_e_access_traits::__anon43193
85 typedef typename detail::__conditional_type<Reverse, typename String::const_reverse_iterator, typename String::const_iterator>::__type const_iterator;
126 static detail::integral_constant<int, Reverse> s_rev_ind;
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x500/style/ |
| RFC4519Style.java | 222 boolean reverse = false;
226 reverse = !rdns1[0].getFirst().getType().equals(rdns2[0].getFirst().getType()); // guess forward
231 if (!foundMatch(reverse, rdns1[i], rdns2))
240 private boolean foundMatch(boolean reverse, RDN rdn, RDN[] possRDNs)
242 if (reverse)
324 // convert in reverse
|
| /external/chromium/crypto/ |
| rsa_private_key.cc | 187 // Reverse input if little-endian.
191 reverse(tmp.begin(), tmp.end());
247 // Reverse output if little-endian.
249 reverse(out->begin(), out->end());
272 // Reverse output if little-endian.
274 reverse(out->begin(), out->end());
|
| /external/elfutils/lib/ |
| dynamicsizehash.c | 63 REVERSE iterate in reverse order of insert
111 # ifdef REVERSE
136 # ifndef REVERSE
165 # ifdef REVERSE
319 # ifdef REVERSE
|
| /external/elfutils/libebl/ |
| eblstrtab.c | 80 char reverse[0]; member in struct:Ebl_Strent
197 newstr->reverse[i] = str[len - 2 - i];
198 newstr->reverse[len - 1] = '\0';
220 int cmpres = memcmp ((*sep)->reverse, newstr->reverse,
272 /* We have a new substring. This means we don't need the reverse
|
| eblwstrtab.c | 81 wchar_t reverse[0]; member in struct:Ebl_WStrent
203 newstr->reverse[i] = str[len - 2 - i];
204 newstr->reverse[len - 1] = L'\0';
228 cmpres = wmemcmp ((*sep)->reverse, newstr->reverse,
284 /* We have a new substring. This means we don't need the reverse
|
| /external/llvm/include/llvm/ADT/ |
| PostOrderIterator.h | 206 ipo_iterator<T> ipo_begin(T G, bool Reverse = false) {
207 return ipo_iterator<T>::begin(G, Reverse);
236 // Reverse Post Order CFG iterator code
239 // This is used to visit basic blocks in a method in reverse post order. This
272 // Because we want a reverse post order, use reverse iterators from the vector
|
| /external/skia/src/gpu/ |
| GrDefaultPathRenderer.cpp | 360 bool reverse = false; local
385 reverse = true;
395 if (reverse) {
405 reverse = true;
435 if (reverse) {
462 if (reverse) {
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
| X509Name.java | 611 * some such, converting it into an ordered set of name attributes. If reverse
616 boolean reverse,
619 this(reverse, DefaultLookUp, dirName);
626 * in converter. If reverse is true the ASN.1 sequence representing the DN will
630 boolean reverse,
634 this(reverse, DefaultLookUp, dirName, converter);
644 * If reverse is true, create the encoded version of the sequence
646 * @param reverse true if we should start scanning from the end (RFC 2553).
651 boolean reverse,
655 this(reverse, lookUp, dirName, new X509DefaultEntryConverter())
[all...] |
| /cts/tests/tests/animation/src/android/animation/cts/ |
| AnimatorSetTest.java | 138 xAnimator.setRepeatMode(ValueAnimator.REVERSE);
150 yAnimator.setRepeatMode(ValueAnimator.REVERSE);
|
| /development/samples/devbytes/animation/Bouncer/src/com/example/android/bouncer/ |
| Bouncer2.java | 110 anim.setRepeatMode(ValueAnimator.REVERSE);
113 // when the animation reverses, the interpolator acts in reverse, decelerating
|
| /development/samples/devbytes/animation/SquashAndStretch/src/com/example/squashandstretch/ |
| SquashAndStretch.java | 91 // Stretch in X, squash in Y, then reverse
97 stretchAnim.setRepeatMode(ValueAnimator.REVERSE);
|
| /external/chromium/chrome/browser/ui/views/tab_contents/ |
| native_tab_contents_container_win.cc | 129 bool reverse) {
130 container_->tab_contents()->FocusThroughTabTraversal(reverse);
|
| /external/eigen/blas/ |
| common.h | 122 if(incx<0) vector(ret,n) = vector(x,n,-incx).reverse();
133 if(incx<0) vector(x,n,-incx).reverse() = vector(x_cpy,n);
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| ListGenerators.java | 71 Collections.reverse(list);
72 return ImmutableList.copyOf(list).reverse();
|
| /external/icu4c/layout/ |
| LEFontInstance.cpp | 50 le_bool reverse, const LECharMapper *mapper, le_bool filterZeroWidth, LEGlyphStorage &glyphStorage) const
54 if (reverse) {
|
| ThaiLayoutEngine.h | 131 * @param reverse - <code>TRUE</code> if the glyphs in the glyph array have been reordered
138 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success);
|
| /external/icu4c/samples/break/ |
| break.cpp | 55 /* Print each element in reverse order: */
102 //print each sentence in forward and reverse order
|
| ubreak.c | 43 /* Print each element in reverse order: */
93 /*print each sentence in forward and reverse order*/
|
| /external/openfst/src/include/fst/ |
| shortest-distance.h | 32 #include <fst/reverse.h>
261 // If 'reverse' is false, this computes the shortest distance from the
263 // 'distance' vector. If 'reverse' is true, this computes the shortest
271 // The weights must must be right (left) distributive if reverse is
283 bool reverse = false,
288 if (!reverse) {
300 Reverse(fst, &rfst);
314 distance->push_back(rdistance[distance->size() + 1].Reverse());
|
