Searched refs:reverse (Results 1 - 25 of 626) sorted by relevance

1234567891011>>

/external/clang/test/CXX/except/except.spec/
H A Dp9-noexcept.cpp16 void reverse() noexcept(false)
/external/clang/test/CodeGen/
H A D2003-11-20-Bitfields.c4 unsigned int reverse :1; member in struct:face_cachel
/external/ltp/testcases/kernel/fs/fs_bind/bin/
H A Dcheck_prop21 reverse=0
25 n) reverse=1
31 if [ $reverse -eq 1 ]
50 if [ $reverse -eq 1 ]
64 if [ $reverse -eq 1 ]
/external/eigen/doc/snippets/
H A DMatrixBase_reverse.cpp3 cout << "Here is the reverse of m:" << endl << m.reverse() << endl;
4 cout << "Here is the coefficient (1,0) in the reverse of m:" << endl
5 << m.reverse()(1,0) << endl;
7 m.reverse()(1,0) = 4;
H A DVectorwise_reverse.cpp3 cout << "Here is the rowwise reverse of m:" << endl << m.rowwise().reverse() << endl;
4 cout << "Here is the colwise reverse of m:" << endl << m.colwise().reverse() << endl;
6 cout << "Here is the coefficient (1,0) in the rowise reverse of m:" << endl
7 << m.rowwise().reverse()(1,0) << endl;
9 //m.colwise().reverse()(1,0) = 4;
/external/icu/icu4c/source/layoutex/
H A DLXUtilities.h23 static void reverse(le_int32 array[], le_int32 count);
24 static void reverse(float array[], le_int32 count);
/external/clang/test/SemaTemplate/
H A Dexample-typelist.cpp49 class reverse { class
50 typedef typename reverse<typename T::tail>::type reversed_tail;
52 typedef typename reverse<typename reversed_tail::tail>::type most_of_tail;
56 typename reverse<cons<typename T::head, most_of_tail> >::type> type;
60 class reverse<cons<Head> > { class
66 class reverse<nil> { class
71 int reverse0[is_same<reverse<unsigned_inttypes>::type,
/external/jacoco/org.jacoco.core/src/org/jacoco/core/analysis/
H A DCounterComparator.java59 private final boolean reverse; field in class:CounterComparator
65 private CounterComparator(final CounterValue value, final boolean reverse) { argument
67 this.reverse = reverse;
72 return reverse ? -cmp : cmp;
76 * Creates a new version of this comparator that sorts in reverse order.
78 * @return reverse comparator
80 public CounterComparator reverse() { method in class:CounterComparator
81 return new CounterComparator(value, !reverse);
/external/antlr/antlr-3.4/runtime/Python/antlr3/
H A Dcompat.py45 l.reverse()
/external/icu/android_icu4j/src/main/java/android/icu/text/
H A DLanguageBreakEngine.java33 * @param reverse true iff we are iterating backwards (in a call to
41 boolean reverse, int breakType, DictionaryBreakEngine.DequeI foundBreaks);
40 findBreaks(CharacterIterator text, int startPos, int endPos, boolean reverse, int breakType, DictionaryBreakEngine.DequeI foundBreaks) argument
/external/droiddriver/src/io/appium/droiddriver/scroll/
H A DDirection.java31 public LogicalDirection reverse() {
37 public LogicalDirection reverse() {
41 public abstract LogicalDirection reverse(); method in class:Direction.LogicalDirection
48 public PhysicalDirection reverse() {
59 public PhysicalDirection reverse() {
70 public PhysicalDirection reverse() {
81 public PhysicalDirection reverse() {
90 public abstract PhysicalDirection reverse(); method in class:Direction.PhysicalDirection
153 return horizontalForwardDirection().reverse();
157 return verticalForwardDirection().reverse();
[all...]
/external/eigen/test/
H A Darray_reverse.cpp16 template<typename MatrixType> void reverse(const MatrixType& m) function
30 MatrixType m1_r = m1.reverse();
31 // Verify that MatrixBase::reverse() works
70 VectorType v1_r = v1.reverse();
71 // Verify that a VectorType::reverse() of an expression works
76 MatrixType m1_cr = m1.colwise().reverse();
77 // Verify that PartialRedux::reverse() works (for colwise())
84 MatrixType m1_rr = m1.rowwise().reverse();
85 // Verify that PartialRedux::reverse() works (for rowwise())
97 m1.reverse()(
[all...]
/external/guava/guava-tests/test/com/google/common/base/
H A DConverterTest.java62 assertEquals(STR_VAL, STR_TO_LONG.reverse().convert(LONG_VAL));
80 Converter<Long, String> reverseConverter = STR_TO_LONG.reverse();
83 assertEquals(LONG_VAL, reverseConverter.reverse().convert(STR_VAL));
88 assertSame(STR_TO_LONG, reverseConverter.reverse());
90 assertEquals("string2long.reverse()", reverseConverter.toString());
93 .addEqualityGroup(STR_TO_LONG, STR_TO_LONG.reverse().reverse())
94 .addEqualityGroup(STR_TO_LONG.reverse(), STR_TO_LONG.reverse())
100 assertEquals(converter, converter.reverse()
[all...]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/
H A Dreverse.pass.cpp15 // reverse(Iter first, Iter last);
28 std::reverse(Iter(ia), Iter(ia));
30 std::reverse(Iter(ia), Iter(ia+sa));
35 std::reverse(Iter(ib), Iter(ib+sb));
41 std::reverse(Iter(ic), Iter(ic+sc));
48 std::reverse(Iter(id), Iter(id+sd));
/external/libnl/src/
H A Dnl-classid-lookup.c22 " -r, --reverse Do a reverse lookup, i.e. classid to name.\n"
37 int err, reverse = 0, raw = 0; local
47 { "reverse", 0, 0, 'r' },
59 case 'r': reverse = 1; break;
70 * We use rtnl_tc_str2handle() even while doing a reverse lookup. This
78 if (reverse) {
/external/toybox/scripts/
H A Dmkstatus.py31 # Create reverse mappings: reverse["command"] gives list of categories it's in
33 reverse={} variable
36 try: reverse[j].append(i)
37 except: reverse[j]=[i]
38 print "all commands=%s" % len(reverse)
47 if not i in reverse: unknowns.append(i)
61 def categorize(reverse, i, skippy=""):
65 if skippy: types = filter(lambda a: a != skippy, reverse[i])
66 else: types = reverse[
[all...]
/external/libcxx/test/std/containers/sequences/list/list.ops/
H A Dreverse.pass.cpp12 // void reverse();
25 c1.reverse();
33 c1.reverse();
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/
H A DX509Principal.java116 * some such, converting it into an ordered set of name attributes. If reverse
122 boolean reverse,
125 super(reverse, dirName);
135 * If reverse is true, create the encoded version of the sequence starting
139 boolean reverse,
143 super(reverse, lookUp, dirName);
121 X509Principal( boolean reverse, String dirName) argument
138 X509Principal( boolean reverse, Hashtable lookUp, String dirName) argument
/external/eigen/blas/
H A Ddouble.cpp28 else if(*incx<0 && *incy>0) return (make_vector(x,*n,-*incx).reverse().cast<double>().cwiseProduct(make_vector(y,*n,*incy).cast<double>())).sum();
29 else if(*incx>0 && *incy<0) return (make_vector(x,*n,*incx).cast<double>().cwiseProduct(make_vector(y,*n,-*incy).reverse().cast<double>())).sum();
30 else if(*incx<0 && *incy<0) return (make_vector(x,*n,-*incx).reverse().cast<double>().cwiseProduct(make_vector(y,*n,-*incy).reverse().cast<double>())).sum();
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DLanguageBreakEngine.java32 * @param reverse true iff we are iterating backwards (in a call to
40 boolean reverse, int breakType, DictionaryBreakEngine.DequeI foundBreaks);
39 findBreaks(CharacterIterator text, int startPos, int endPos, boolean reverse, int breakType, DictionaryBreakEngine.DequeI foundBreaks) argument
/external/mesa3d/bin/
H A Dget-pick-list.sh6 git log --reverse --grep="cherry picked from commit" origin/master..HEAD |\
11 git log --reverse --pretty=%H -i --grep='^[[:space:]]*NOTE: This is a candidate' HEAD..origin/master |\
/external/guava/guava-tests/test/com/google/common/collect/
H A DSortedIterablesTest.java37 assertTrue(SortedIterables.hasSameComparator(Ordering.natural().reverse(),
38 Sets.newTreeSet(Ordering.natural().reverse())));
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.h79 EdgeIterator(Graph::Edge *first, int dir, bool reverse) argument
80 : d(dir), rev(reverse)
115 inline EdgeIterator outgoing(bool reverse = false) const;
116 inline EdgeIterator incident(bool reverse = false) const;
207 Graph::EdgeIterator Graph::Node::outgoing(bool reverse) const
209 return EdgeIterator(out, 0, reverse);
212 Graph::EdgeIterator Graph::Node::incident(bool reverse) const
214 return EdgeIterator(in, 1, reverse);
/external/chromium-trace/catapult/telemetry/telemetry/util/
H A Dmatching.py27 return [x[0] for x in sorted(result, key=lambda r: r[1], reverse=True)]
/external/skia/src/core/
H A DSkQuadClipper.cpp52 bool reverse; local
59 reverse = true;
62 reverse = false;
110 if (reverse) {

Completed in 5601 milliseconds

1234567891011>>