| /external/clang/test/CXX/except/except.spec/ |
| p9-noexcept.cpp | 16 void reverse() noexcept(false)
|
| /external/clang/test/CodeGen/ |
| 2003-11-20-Bitfields.c | 4 unsigned int reverse :1; member in struct:face_cachel
|
| /external/eigen/doc/snippets/ |
| MatrixBase_reverse.cpp | 3 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;
|
| Vectorwise_reverse.cpp | 3 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/icu4c/layoutex/ |
| LXUtilities.h | 21 static void reverse(le_int32 array[], le_int32 count);
22 static void reverse(float array[], le_int32 count);
|
| /external/eigen/test/ |
| array_reverse.cpp | 16 template<typename MatrixType> void reverse(const MatrixType& m) function
30 MatrixType m1_r = m1.reverse();
31 // Verify that MatrixBase::reverse() works
38 Reverse<MatrixType> m1_rd(m1);
39 // Verify that a Reverse default (in both directions) of an expression works
46 Reverse<MatrixType, BothDirections> m1_rb(m1);
47 // Verify that a Reverse in both directions of an expression works
54 Reverse<MatrixType, Vertical> m1_rv(m1);
55 // Verify that a Reverse in the vertical directions of an expression works
62 Reverse<MatrixType, Horizontal> m1_rh(m1)
[all...] |
| /device/sample/frameworks/PlatformLibrary/java/com/example/android/platform_library/ |
| PlatformLibrary.java | 40 /* reverse a string, for no very good reason */
41 String reverse = reverseString("Android!"); local
43 Log.i("PlatformLibrary", "getInt: " + result + ", '" + reverse + "'");
62 * Native method that returns a new string that is the reverse of
|
| /external/clang/test/SemaTemplate/ |
| example-typelist.cpp | 49 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,
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.reverse/ |
| reverse.pass.cpp | 15 // 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/skia/legacy/include/core/ |
| SkEdgeClipper.h | 38 void appendVLine(SkScalar x, SkScalar y0, SkScalar y1, bool reverse);
39 void appendQuad(const SkPoint pts[3], bool reverse);
40 void appendCubic(const SkPoint pts[4], bool reverse);
|
| /external/skia/src/core/ |
| SkEdgeClipper.h | 38 void appendVLine(SkScalar x, SkScalar y0, SkScalar y1, bool reverse);
39 void appendQuad(const SkPoint pts[3], bool reverse);
40 void appendCubic(const SkPoint pts[4], bool reverse);
|
| SkQuadClipper.h | 57 void appendVLine(SkScalar x, SkScalar y0, SkScalar y1, bool reverse);
58 void appendQuad(const SkPoint pts[3], bool reverse);
59 void appendCubic(const SkPoint pts[4], bool reverse);
|
| SkEdgeClipper.cpp | 30 it to be increasing in Y. If it had to reverse the order of the points,
127 bool reverse = sort_increasing_Y(pts, srcPts, 3); local
139 reverse = !reverse;
147 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
151 this->appendVLine(clip.fRight, pts[0].fY, pts[2].fY, reverse);
162 this->appendVLine(clip.fLeft, tmp[0].fY, tmp[2].fY, reverse);
172 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
185 this->appendQuad(tmp, reverse);
186 this->appendVLine(clip.fRight, tmp[2].fY, tmp[4].fY, reverse);
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| compat.py | 45 l.reverse()
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/ |
| X509Principal.java | 115 * some such, converting it into an ordered set of name attributes. If reverse
121 boolean reverse,
124 super(reverse, dirName);
134 * If reverse is true, create the encoded version of the sequence starting
138 boolean reverse,
142 super(reverse, lookUp, dirName);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.ops/ |
| reverse.pass.cpp | 12 // void reverse();
22 c1.reverse();
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| compatibility-list.h | 48 reverse() throw ();
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| compatibility-list.h | 48 reverse() throw ();
|
| /external/icu4c/layout/ |
| ArabicLayoutEngine.h | 128 * @param reverse - <code>TRUE</code> if the glyphs in the glyph array have been reordered
136 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success);
211 * @param reverse - if <code>TRUE</code>, the output will be in reverse order
219 virtual void mapCharsToGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, le_bool mirror,
230 * @param reverse - <code>TRUE</code> if the glyphs in the glyph array have been reordered
236 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success);
|
| /external/skia/legacy/src/core/ |
| SkQuadClipper.h | 57 void appendVLine(SkScalar x, SkScalar y0, SkScalar y1, bool reverse);
58 void appendQuad(const SkPoint pts[3], bool reverse);
59 void appendCubic(const SkPoint pts[4], bool reverse);
|
| SkEdgeClipper.cpp | 30 it to be increasing in Y. If it had to reverse the order of the points,
123 bool reverse = sort_increasing_Y(pts, srcPts, 3); local
135 reverse = !reverse;
143 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
147 this->appendVLine(clip.fRight, pts[0].fY, pts[2].fY, reverse);
158 this->appendVLine(clip.fLeft, tmp[0].fY, tmp[2].fY, reverse);
166 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
177 this->appendQuad(tmp, reverse);
178 this->appendVLine(clip.fRight, tmp[2].fY, tmp[4].fY, reverse);
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Array/ |
| 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/chromium/chrome/browser/ui/views/tab_contents/ |
| native_tab_contents_container_gtk.cc | 122 bool reverse) {
128 reverse);
131 container_->tab_contents()->FocusThroughTabTraversal(reverse);
|
| /external/chromium/android/ |
| prefix.h | 36 using std::reverse;
|
| /external/eigen/blas/ |
| level1_real_impl.h | 38 else if(*incx<0 && *incy>0) return (vector(x,*n,-*incx).reverse().cwiseProduct(vector(y,*n,*incy))).sum();
39 else if(*incx>0 && *incy<0) return (vector(x,*n,*incx).cwiseProduct(vector(y,*n,-*incy).reverse())).sum();
40 else if(*incx<0 && *incy<0) return (vector(x,*n,-*incx).reverse().cwiseProduct(vector(y,*n,-*incy).reverse())).sum();
70 Reverse<StridedVectorType> rvx(vx);
71 Reverse<StridedVectorType> rvy(vy);
|
