/external/clang/test/CXX/except/except.spec/ |
H A D | p9-noexcept.cpp | 16 void reverse() noexcept(false)
|
/external/clang/test/CodeGen/ |
H A D | 2003-11-20-Bitfields.c | 4 unsigned int reverse :1; member in struct:face_cachel
|
/external/eigen/doc/snippets/ |
H A D | 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;
|
H A D | 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/v8/test/mjsunit/regress/ |
H A D | regress-685.js | 40 a.reverse();
|
/external/icu4c/layoutex/ |
H A D | LXUtilities.h | 21 static void reverse(le_int32 array[], le_int32 count); 22 static void reverse(float array[], le_int32 count);
|
/external/clang/test/SemaTemplate/ |
H A D | 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,
|
/external/eigen/test/ |
H A D | 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 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/antlr/antlr-3.4/runtime/Python/antlr3/ |
H A D | compat.py | 45 l.reverse()
|
/external/skia/legacy/include/core/ |
H A D | 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/ |
H A D | 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);
|
H A D | 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);
|
H A D | 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/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/ |
H A D | 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); 120 X509Principal( boolean reverse, String dirName) argument 137 X509Principal( boolean reverse, Hashtable lookUp, String dirName) argument
|
/external/skia/legacy/src/core/ |
H A D | 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);
|
H A D | 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...] |
H A D | SkQuadClipper.cpp | 64 bool reverse; local 71 reverse = true; 74 reverse = false; 122 if (reverse) {
|
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Array/ |
H A D | 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 [all...] |
/external/chromium/chrome/browser/ui/views/tab_contents/ |
H A D | native_tab_contents_container_gtk.cc | 122 bool reverse) { 128 reverse); 131 container_->tab_contents()->FocusThroughTabTraversal(reverse); 121 AboutToRequestFocusFromTabTraversal( bool reverse) argument
|
/external/icu4c/layout/ |
H A D | 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/protobuf/python/ |
H A D | stubout.py | 73 mro.reverse() 102 self.stubs.reverse() 134 # Undo calls to Set() in reverse order, in case Set() was called on the 136 self.cache.reverse()
|
/external/chromium/android/ |
H A D | prefix.h | 36 using std::reverse;
|
/external/eigen/blas/ |
H A D | 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();
|
/external/openfst/src/include/fst/script/ |
H A D | reverse.h | 22 #include <fst/reverse.h>
|
/external/openfst/src/script/ |
H A D | reverse.cc | 19 #include <fst/script/reverse.h>
|