| /external/pdfium/xfa/fxfa/parser/ |
| cxfa_stroke.h | 33 bool IsCorner() const { return GetElementType() == XFA_Element::Corner; }
|
| cxfa_border.cpp | 16 {XFA_Element::Corner, 4, 0}, {XFA_Element::Fill, 1, 0},
|
| cxfa_corner.cpp | 32 constexpr wchar_t kName[] = L"corner";
41 XFA_Element::Corner,
|
| cxfa_box.cpp | 142 CXFA_Corner* corner; local
144 corner =
145 JSObject()->GetOrCreateProperty<CXFA_Corner>(i, XFA_Element::Corner);
147 corner = JSObject()->GetProperty<CXFA_Corner>(i, XFA_Element::Corner);
151 // with a null corner in the first position.
152 if (corner || i == 0) {
153 strokes[j] = corner;
|
| cxfa_rectangle.cpp | 19 {XFA_Element::Corner, 4, 0},
|
| cxfa_node_statics.cpp | 470 {0x6a9e04c9 /* corner */, XFA_Element::Corner},
[all...] |
| /development/samples/devbytes/animation/CardFlip/src/com/example/android/cardflip/ |
| 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...] |
| 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...] |
| /external/skia/gm/ |
| rrect.cpp | 27 radii[i] = src.radii((SkRRect::Corner)i);
47 radii[i] = src.radii((SkRRect::Corner)i);
63 radii[i] = src.radii((SkRRect::Corner)i);
91 radii[i] = src.radii((SkRRect::Corner)i);
|
| /external/skqp/gm/ |
| rrect.cpp | 27 radii[i] = src.radii((SkRRect::Corner)i);
47 radii[i] = src.radii((SkRRect::Corner)i);
63 radii[i] = src.radii((SkRRect::Corner)i);
91 radii[i] = src.radii((SkRRect::Corner)i);
|
| /external/skia/tests/ |
| RoundRectTest.cpp | 162 REPORTER_ASSERT(reporter, rquad[i] == rr.radii((SkRRect::Corner) i));
183 REPORTER_ASSERT(reporter, zeroPt == empty.radii((SkRRect::Corner) i));
196 REPORTER_ASSERT(reporter, zeroPt == rr1.radii((SkRRect::Corner) i));
216 SkPointPriv::EqualsWithinTolerance(rr2.radii((SkRRect::Corner) i),
237 REPORTER_ASSERT(reporter, p == rr3.radii((SkRRect::Corner) i));
270 REPORTER_ASSERT(reporter, radii2[i] == rr5.radii((SkRRect::Corner) i));
415 // each corner and edge
482 // all in for NW (rect) corner (same as rect case)
589 orig.radii((SkRRect::Corner) i) == dst.radii((SkRRect::Corner) i))
[all...] |
| /external/skqp/tests/ |
| RoundRectTest.cpp | 162 REPORTER_ASSERT(reporter, rquad[i] == rr.radii((SkRRect::Corner) i));
183 REPORTER_ASSERT(reporter, zeroPt == empty.radii((SkRRect::Corner) i));
196 REPORTER_ASSERT(reporter, zeroPt == rr1.radii((SkRRect::Corner) i));
216 SkPointPriv::EqualsWithinTolerance(rr2.radii((SkRRect::Corner) i),
237 REPORTER_ASSERT(reporter, p == rr3.radii((SkRRect::Corner) i));
270 REPORTER_ASSERT(reporter, radii2[i] == rr5.radii((SkRRect::Corner) i));
415 // each corner and edge
482 // all in for NW (rect) corner (same as rect case)
589 orig.radii((SkRRect::Corner) i) == dst.radii((SkRRect::Corner) i))
[all...] |
| /external/skia/include/core/ |
| SkRRect.h | 28 SkRRect describes a rounded rectangle with a bounds and a pair of radii for each corner.
37 If either axis radii is zero or less: radii are stored as zero; corner is square.
38 If corner curves overlap, radii are proportionally reduced to fit within bounds.
44 Initializes corner radii to (0, 0), and sets type of kEmpty_Type.
50 /** Initializes to copy of rrect bounds and corner radii.
52 @param rrect bounds and corner to copy
57 /** Copies rrect bounds and corner radii.
59 @param rrect bounds and corner to copy
121 /** Returns top-left corner radii. If type() returns kEmpty_Type, kRect_Type,
122 kOval_Type, or kSimple_Type, returns a value representative of all corner radii
[all...] |
| /external/skqp/include/core/ |
| SkRRect.h | 28 SkRRect describes a rounded rectangle with a bounds and a pair of radii for each corner.
37 If either axis radii is zero or less: radii are stored as zero; corner is square.
38 If corner curves overlap, radii are proportionally reduced to fit within bounds.
44 Initializes corner radii to (0, 0), and sets type of kEmpty_Type.
50 /** Initializes to copy of rrect bounds and corner radii.
52 @param rrect bounds and corner to copy
57 /** Copies rrect bounds and corner radii.
59 @param rrect bounds and corner to copy
121 /** Returns top-left corner radii. If type() returns kEmpty_Type, kRect_Type,
122 kOval_Type, or kSimple_Type, returns a value representative of all corner radii
[all...] |
| /external/skia/src/gpu/ops/ |
| GrAAFillRRectOp.cpp | 190 // Top-left corner.
198 // Top-right corner.
206 // Bottom-right corner.
214 // Bottom-left corner.
327 v->codeAppend("float2 corner = corner_and_radius_outsets.xy;");
352 v->codeAppend( "corner = max(abs(corner), aa_bloatradius) * sign(corner);");
360 // The radii are very small. Demote this arc to a sharp 90 degree corner.
362 // Snap octagon vertices to the corner of the bounding box
537 auto corner = static_cast<SkRRect::Corner>(i); local
[all...] |
| /external/skia/src/utils/ |
| SkPatchUtils.cpp | 40 // Enum for corner also clockwise.
41 enum Corner {
|
| SkLua.cpp | 1489 int corner = SkToInt(lua_tointeger(L, 2)); local
[all...] |
| /external/skqp/src/gpu/ops/ |
| GrAAFillRRectOp.cpp | 178 // Top-left corner.
186 // Top-right corner.
194 // Bottom-right corner.
202 // Bottom-left corner.
312 v->codeAppend("float2 corner = corner_and_radius_outsets.xy;");
337 v->codeAppend( "corner = max(abs(corner), aa_bloatradius) * sign(corner);");
345 // The radii are very small. Demote this arc to a sharp 90 degree corner.
347 // Snap octagon vertices to the corner of the bounding box
524 auto corner = static_cast<SkRRect::Corner>(i); local
[all...] |
| /external/skqp/src/utils/ |
| SkPatchUtils.cpp | 40 // Enum for corner also clockwise.
41 enum Corner {
|
| /external/syzkaller/vendor/golang.org/x/net/trace/ |
| histogram.go | 123 // Corner cases (make sure result is strictly less than Total())
|
| /external/pdfium/xfa/fxfa/ |
| fxfa_basic.h | 769 Corner,
|
| /external/skia/src/core/ |
| SkPathRef.cpp | 766 SkRRect::Corner corner =
772 SkASSERT(!radii[corner].fX && !radii[corner].fY);
773 radii[corner] = dxdy;
|
| /external/skia/src/gpu/effects/ |
| GrRRectEffect.cpp | 106 // The corner flags are derived from fRRect, so no need to check them.
176 // At each quarter-circle corner we compute a vector that is the offset of the fragment position
178 // to that corner. This means that points near the interior near the rrect top edge will have
180 // alpha from this vector at either the TR or TL corner will give the correct result. Similarly,
449 // ensure at least one corner really is elliptical
510 // At each quarter-ellipse corner we compute a vector that is the offset of the fragment pos
512 // to that corner. This means that points near the interior near the rrect top edge will have
514 // alpha from this vector at either the TR or TL corner will give the correct result. Similarly,
562 // corner where both the x and y offsets are positive, hence the maxes. (The inverse
[all...] |
| /external/skqp/src/core/ |
| SkPathRef.cpp | 761 SkRRect::Corner corner =
767 SkASSERT(!radii[corner].fX && !radii[corner].fY);
768 radii[corner] = dxdy;
|
| /external/skqp/src/gpu/effects/ |
| GrRRectEffect.cpp | 106 // The corner flags are derived from fRRect, so no need to check them.
176 // At each quarter-circle corner we compute a vector that is the offset of the fragment position
178 // to that corner. This means that points near the interior near the rrect top edge will have
180 // alpha from this vector at either the TR or TL corner will give the correct result. Similarly,
449 // ensure at least one corner really is elliptical
510 // At each quarter-ellipse corner we compute a vector that is the offset of the fragment pos
512 // to that corner. This means that points near the interior near the rrect top edge will have
514 // alpha from this vector at either the TR or TL corner will give the correct result. Similarly,
562 // corner where both the x and y offsets are positive, hence the maxes. (The inverse
[all...] |
