Lines Matching full:radii
19 // add validate method (all radii positive, all radii sums < rect size, etc.)
38 radii for each corner. It does not have a constructor so must be
44 If either of a corner's radii are 0 the corner will be square.
45 Negative radii are not allowed (they are clamped to zero).
62 //!< The RR is actually a (non-empty) oval (i.e., all x radii are equal
63 //!< and >= width/2 and all the y radii are equal and >= height/2
66 //!< The RR is non-empty and all the x radii are equal & all y radii
68 //!< the curves) nor a rect (i.e., both radii are non-zero)
71 //!< The RR is non-empty and the two left x radii are equal, the two top
72 //!< y radii are equal, and the same for the right and bottom but it is
79 //!< A fully general (non-empty) RR. Some of the x and/or y radii are
81 //!< both radii are non-zero.
116 * Set this RR to the empty rectangle (0,0,0,0) with 0 x & y radii.
127 * Set this RR to match the supplied rect. All radii will be 0.
163 * Set this RR to match the supplied oval. All x radii will equal half the
164 * width and all y radii will equal half the height.
187 * Initialize the RR with the same radii for all four corners.
198 * Initialize the RR with potentially different radii for all four corners.
200 void setRectRadii(const SkRect& rect, const SkVector radii[4]);
202 // The radii are stored in UL, UR, LR, LL order.
211 const SkVector& radii(Corner corner) const { return fRadii[corner]; }
215 * When a rrect is simple, all of its radii are equal. This returns one
216 * of those radii. This call requires the rrect to be non-complex.
236 * Call inset on the bounds, and adjust the radii to reflect what happens
238 * otherwise we grow/shrink the radii by the amount of the inset. If a
250 * Call outset on the bounds, and adjust the radii to reflect what happens
252 * otherwise we grow/shrink the radii by the amount of the inset. If a
320 // Radii order is UL, UR, LR, LL. Use Corner enum to index into fRadii[]
