| /external/python/cpython2/Lib/test/ |
| test_generators.py | 1181 # start. Starting in a corner makes the 2nd move easy.
1182 corner = self.coords2index(0, 0)
1183 remove_from_successors(corner)
1184 self.lastij = corner
1185 yield corner
1186 add_to_successors(corner)
1190 corner = self.coords2index(0, 0)
1191 assert self.lastij == corner # i.e., we started in the corner
1194 assert len(succs[corner]) ==
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_generators.py | 1181 # start. Starting in a corner makes the 2nd move easy.
1182 corner = self.coords2index(0, 0)
1183 remove_from_successors(corner)
1184 self.lastij = corner
1185 yield corner
1186 add_to_successors(corner)
1190 corner = self.coords2index(0, 0)
1191 assert self.lastij == corner # i.e., we started in the corner
1194 assert len(succs[corner]) ==
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_generators.py | 1181 # start. Starting in a corner makes the 2nd move easy.
1182 corner = self.coords2index(0, 0)
1183 remove_from_successors(corner)
1184 self.lastij = corner
1185 yield corner
1186 add_to_successors(corner)
1190 corner = self.coords2index(0, 0)
1191 assert self.lastij == corner # i.e., we started in the corner
1194 assert len(succs[corner]) ==
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_generators.py | 1181 # start. Starting in a corner makes the 2nd move easy.
1182 corner = self.coords2index(0, 0)
1183 remove_from_successors(corner)
1184 self.lastij = corner
1185 yield corner
1186 add_to_successors(corner)
1190 corner = self.coords2index(0, 0)
1191 assert self.lastij == corner # i.e., we started in the corner
1194 assert len(succs[corner]) ==
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_generators.py | 1181 # start. Starting in a corner makes the 2nd move easy.
1182 corner = self.coords2index(0, 0)
1183 remove_from_successors(corner)
1184 self.lastij = corner
1185 yield corner
1186 add_to_successors(corner)
1190 corner = self.coords2index(0, 0)
1191 assert self.lastij == corner # i.e., we started in the corner
1194 assert len(succs[corner]) ==
[all...] |
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/hppa/basic/ |
| imem.s | 12 ; We could/should test some of the corner cases for register and
|
| /prebuilts/go/darwin-x86/src/bufio/ |
| export_test.go | 24 // ErrOrEOF is like Err, but returns EOF. Used to test a corner case.
|
| /prebuilts/go/linux-x86/src/bufio/ |
| export_test.go | 24 // ErrOrEOF is like Err, but returns EOF. Used to test a corner case.
|
| /development/samples/devbytes/animation/CardFlip/src/com/example/android/cardflip/ |
| CardView.java | 50 enum Corner {
255 public ObjectAnimator getRotationAnimator (int cardFromTop, Corner corner,
257 rotateCardAroundCorner(corner);
277 public ObjectAnimator getFullRotationAnimator (int cardFromTop, Corner corner,
281 rotateCardAroundCorner(corner);
304 public void rotateCardAroundCorner(Corner corner) {
305 switch(corner) {
[all...] |
| CardFlip.java | 40 * be rotated out or back in about their bottom left corner in a counter-clockwise direction.
141 rotateCardsFullRotation(stack, CardView.Corner.BOTTOM_LEFT);
194 rotateCards(RIGHT_STACK, CardView.Corner.BOTTOM_LEFT, rotateCardsOut);
210 rotateCards(LEFT_STACK, CardView.Corner.BOTTOM_LEFT, rotateCardsOut);
242 public void rotateCards (final int stack, CardView.Corner corner,
250 animations.add(cardView.getRotationAnimator(i, corner, isRotatingOut, false));
274 public void rotateCardsFullRotation (int stack, CardView.Corner corner) {
280 animations.add(cardView.getFullRotationAnimator(i, corner, false))
[all...] |
| /external/pdfium/xfa/fxfa/parser/ |
| cxfa_box.cpp | 25 CXFA_Corner corner = local
26 CXFA_Corner(pNode->GetProperty(i, XFA_Element::Corner, i == 0));
27 if (corner || i == 0) {
28 (*strokes)[j] = corner;
|
| /external/skia/gm/ |
| patheffects.cpp | 20 sk_sp<SkPathEffect> corner = SkCornerPathEffect::Make(25); local
23 compose = SkPathEffect::MakeCompose(sk_ref_sp(pe), corner);
25 compose = corner;
|
| occludedrrectblur.cpp | 63 static void draw_45(SkCanvas* canvas, SkRRect::Corner corner,
65 SkRRect::Corner left = SkRRect::kUpperLeft_Corner, right = SkRRect::kUpperLeft_Corner;
70 switch (corner) {
174 static void draw_30_60(SkCanvas* canvas, SkRRect::Corner corner, const SkVector& v,
176 SkRRect::Corner left = SkRRect::kUpperLeft_Corner, right = SkRRect::kUpperLeft_Corner;
181 switch (corner) {
|
| /external/eigen/test/ |
| eigen2support.cpp | 39 VERIFY_IS_EQUAL((m1.corner(TopLeft,1,1)), (m1.block(0,0,1,1)));
40 VERIFY_IS_EQUAL((m1.template corner<1,1>(TopLeft)), (m1.template block<1,1>(0,0)));
|
| /prebuilts/go/darwin-x86/test/ |
| divide.go | 7 // Test divide corner cases.
|
| /prebuilts/go/linux-x86/test/ |
| divide.go | 7 // Test divide corner cases.
|
| /external/swiftshader/third_party/LLVM/docs/CommandGuide/html/ |
| manpage.css | 223 background: #f0f5fa url(/i/corner-leftline.gif) repeat-y;
227 background: #f0f5fa url(/i/corner-rightline.gif) repeat-y;
231 background: #f0f5fa url(/i/corner-topline.gif) repeat-x;
235 background: #f0f5fa url(/i/corner-botline.gif) repeat-x;
239 background: #ffffff url(/i/corner-rightline.gif) repeat-y;
243 background: #ffffff url(/i/corner-topline.gif) repeat-x;
247 background: #ffffff url(/i/corner-botline.gif) repeat-x;
255 background: #ffffff url(/i/corner-leftline.gif) repeat-y;
|
| /external/swiftshader/third_party/LLVM/docs/CommandGuide/ |
| manpage.css | 223 background: #f0f5fa url(/i/corner-leftline.gif) repeat-y;
227 background: #f0f5fa url(/i/corner-rightline.gif) repeat-y;
231 background: #f0f5fa url(/i/corner-topline.gif) repeat-x;
235 background: #f0f5fa url(/i/corner-botline.gif) repeat-x;
239 background: #ffffff url(/i/corner-rightline.gif) repeat-y;
243 background: #ffffff url(/i/corner-topline.gif) repeat-x;
247 background: #ffffff url(/i/corner-botline.gif) repeat-x;
255 background: #ffffff url(/i/corner-leftline.gif) repeat-y;
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/ppc/ |
| simpshft.s | 15 # These test the remaining corner cases for 64-bit operations.
60 # These test the remaining corner cases for 32-bit operations.
|
| /external/eigen/Eigen/src/Geometry/ |
| AlignedBox.h | 50 /** Identifier for 2D corner @{ */
55 /** Identifier for 3D corner @{ */
105 /** \returns the minimal corner */
107 /** \returns a non const reference to the minimal corner */
109 /** \returns the maximal corner */
111 /** \returns a non const reference to the maximal corner */
137 /** \returns the vertex of the bounding box at the corner defined by
138 * the corner-id corner. It works only for a 1D, 2D or 3D bounding box.
146 EIGEN_DEVICE_FUNC inline VectorType corner(CornerType corner) cons function in class:Eigen::AlignedBox
[all...] |
| /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/policy/ |
| KeyButtonRipple.java | 103 final float corner = horizontal ? cy : cx; local
107 corner, corner, p);
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/webchecker/ |
| tktools.py | 87 corner = None
98 corner = Frame(vbarframe, width=sbwidth, height=sbwidth)
99 corner.propagate(0)
100 corner.pack(side=BOTTOM)
|
| /external/python/cpython2/Tools/webchecker/ |
| tktools.py | 87 corner = None
98 corner = Frame(vbarframe, width=sbwidth, height=sbwidth)
99 corner.propagate(0)
100 corner.pack(side=BOTTOM)
|
| /external/skia/samplecode/ |
| SampleSVGPong.cpp | 218 const SkPoint corner = pos - SkPoint::Make(size.width() / 2, size.height() / 2); local
219 objectNode->setX(SkSVGLength(corner.x()));
220 objectNode->setY(SkSVGLength(corner.y()));
225 const SkPoint shadowCorner = corner + shadowOffset;
|
| /external/opencv/cv/src/ |
| cvcalibinit.cpp | 43 This is improved variant of chessboard corner detection algorithm that
97 /// Corner info structure
98 /** This structure stores information about the chessboard corner.*/
101 CvPoint2D32f pt; // Coordinates of the corner
118 // neighbors and corners are synced, i.e., neighbor 0 shares corner 0
151 static void icvOrderQuad(CvCBQuad *quad, CvCBCorner *corner, int common);
488 // for each corner c lying between end points in the same row/column it checks that
535 // can add quads, so we need to have quad/corner arrays passed in
578 // 0,1,2,3) are in the at the same relative corner (e.g., lower right).
808 CvCBCorner* corner; local
1719 CvCBCorner* corner = &(*out_corners)[quad_count*4 + i]; local
1945 CvCBCorner* corner = &(*out_corners)[quad_count*4 + i]; local
[all...] |
