| /external/chromium/chrome/browser/ui/views/tab_contents/ |
| tab_contents_view_views.h | 75 virtual void TakeFocus(bool reverse) OVERRIDE;
|
| /external/guava/guava/src/com/google/common/collect/ |
| EmptyImmutableList.java | 123 @Override public ImmutableList<Object> reverse() { method in class:EmptyImmutableList
|
| ReverseNaturalOrdering.java | 26 /** An ordering that uses the reverse of the natural order of the values. */
42 @Override public <S extends Comparable> Ordering<S> reverse() { method in class:ReverseNaturalOrdering
86 return "Ordering.natural().reverse()";
|
| ReverseOrdering.java | 28 /** An ordering that uses the reverse of a given order. */
42 @Override public <S extends T> Ordering<S> reverse() { method in class:ReverseOrdering
96 return forwardOrder + ".reverse()";
|
| SingletonImmutableList.java | 112 @Override public ImmutableList<E> reverse() { method
|
| RegularImmutableSortedMultiset.java | 94 return new RegularImmutableSortedSet<E>(elementList().reverse(), reverseComparator());
106 return (UnmodifiableIterator) entries.reverse().iterator();
|
| /external/icu4c/common/unicode/ |
| rbbi.h | 741 * if goind in reverse, startPos is the normal Unicode break result
744 * @param reverse The call is for the reverse direction
747 int32_t checkDictionary(int32_t startPos, int32_t endPos, UBool reverse);
|
| /external/icu4c/layout/ |
| OpenTypeLayoutEngine.cpp | 341 void OpenTypeLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse,
383 fGPOSTable->process(glyphStorage, adjustments, reverse, fScriptTagV2, fLangSysTag, fGDEFTable, success, fFontInstance,
387 fGPOSTable->process(glyphStorage, adjustments, reverse, fScriptTag, fLangSysTag, fGDEFTable, success, fFontInstance,
430 LayoutEngine::adjustGlyphPositions(chars, offset, count, reverse, glyphStorage, success);
|
| /external/junit/src/org/junit/internal/runners/ |
| TestClass.java | 52 Collections.reverse(results);
|
| /external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/ |
| SampleToChunkBox.java | 98 Collections.reverse(sampleToChunkEntries);
|
| /external/openfst/src/script/ |
| fst-class.cc | 25 #include <fst/reverse.h>
|
| /external/webkit/Source/WebCore/inspector/front-end/ |
| TextPrompt.js | 191 complete: function(auto, reverse)
209 this.completions(wordPrefixRange, auto, this._completionsReady.bind(this, selection, auto, wordPrefixRange, reverse));
212 _completionsReady: function(selection, auto, originalWordPrefixRange, reverse, completions)
259 var nextIndex = foundIndex + (reverse ? -1 : 1);
|
| /external/webkit/Source/WebKit/chromium/public/ |
| WebView.h | 163 // Focus the first (last if reverse is true) focusable node.
164 virtual void setInitialFocus(bool reverse) = 0;
|
| /external/webkit/Tools/Scripts/ |
| print-vse-failure-logs | 63 order.reverse()
|
| /external/webkit/Tools/iExploder/iexploder-1.7.2/src/ |
| scanner.rb | 53 # Reverse the order from fastest to slowest
71 new_offsets.reverse!
|
| /system/media/camera/docs/ |
| metadata_helpers.py | 111 path.reverse()
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| OrderingTest.java | 294 Ordering<Number> reverseOrder = numberOrdering.reverse();
299 .addEqualityGroup(reverseOrder, numberOrdering.reverse())
300 .addEqualityGroup(Ordering.natural().reverse())
308 assertSame(numberOrdering, numberOrdering.reverse().reverse());
321 = Ordering.natural().reverse();
357 assertEquals("Ordering.natural().reverse().onResultOf(StringLength)",
548 * If greatestOf() promised to be implemented as reverse().leastOf(), this
753 REVERSE {
756 Collections.reverse(newList)
[all...] |
| /external/icu4c/common/ |
| brkeng.cpp | 81 UBool reverse,
86 if (reverse) {
|
| /external/icu4c/data/brkitr/ |
| sent.txt | 85 !!reverse;
93 # Reverse rules.
94 # For now, use the old style inexact reverse rules, which are easier
96 # TODO: exact reverse rules. It appears that exact reverse rules
|
| sent_el.txt | 85 !!reverse;
93 # Reverse rules.
94 # For now, use the old style inexact reverse rules, which are easier
96 # TODO: exact reverse rules. It appears that exact reverse rules
|
| /external/openfst/src/include/fst/ |
| push.h | 41 // initial state when 'reverse == false' and to the final states when
42 // 'reverse == true'.
47 bool reverse) {
48 if (reverse)
92 // final state, the same property holds on the reverse machine.
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| 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());
|
| /system/bluetooth/data/ |
| auto_pairing.conf | 23 // Note the reverse logic in this case compared to other's in this file
|
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/analysis/ |
| ReversedDepthFirstAdapter.java | 55 Collections.reverse(copy);
519 Collections.reverse(copy);
527 Collections.reverse(copy);
556 Collections.reverse(copy);
564 Collections.reverse(copy);
948 Collections.reverse(copy);
977 Collections.reverse(copy);
[all...] |
| /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());
|
