Struct embedded_graphics::primitives::CornerRadii [−][src]
pub struct CornerRadii {
pub top_left: Size,
pub top_right: Size,
pub bottom_right: Size,
pub bottom_left: Size,
}Expand description
The definition of each corner radius for a rounded rectangle.
Examples
Create a radii configuration with equal corners
This example create a CornerRadii instance where each corner has an equal, elliptical radius
of 10px x 8px.
use embedded_graphics::{geometry::Size, primitives::CornerRadii}; let radii = CornerRadii::new(Size::new(10, 8)); assert_eq!( radii, CornerRadii { top_left: Size::new(10, 8), top_right: Size::new(10, 8), bottom_right: Size::new(10, 8), bottom_left: Size::new(10, 8), } );
Fields
top_left: SizeTop left corner radius
top_right: SizeTop right corner radius
bottom_right: SizeBottom right corner radius
bottom_left: SizeBottom left corner radius
Implementations
impl CornerRadii[src]
impl CornerRadii[src]pub const fn new(radius: Size) -> Self[src]
pub const fn new(radius: Size) -> Self[src]Create a new set of corner radii with all corners having equal values.
To create a CornerRadii instance with different radii for each corner, use the
CornerRadiiBuilder builder.
Trait Implementations
impl Clone for CornerRadii[src]
impl Clone for CornerRadii[src]fn clone(&self) -> CornerRadii[src]
fn clone(&self) -> CornerRadii[src]Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)1.0.0[src]
fn clone_from(&mut self, source: &Self)1.0.0[src]Performs copy-assignment from source. Read more
impl Debug for CornerRadii[src]
impl Debug for CornerRadii[src]impl Default for CornerRadii[src]
impl Default for CornerRadii[src]fn default() -> CornerRadii[src]
fn default() -> CornerRadii[src]Returns the “default value” for a type. Read more
impl From<&'_ CornerRadii> for CornerRadiiBuilder[src]
impl From<&'_ CornerRadii> for CornerRadiiBuilder[src]fn from(corners: &CornerRadii) -> Self[src]
fn from(corners: &CornerRadii) -> Self[src]Performs the conversion.
impl Hash for CornerRadii[src]
impl Hash for CornerRadii[src]impl Ord for CornerRadii[src]
impl Ord for CornerRadii[src]impl PartialEq<CornerRadii> for CornerRadii[src]
impl PartialEq<CornerRadii> for CornerRadii[src]fn eq(&self, other: &CornerRadii) -> bool[src]
fn eq(&self, other: &CornerRadii) -> bool[src]This method tests for self and other values to be equal, and is used
by ==. Read more
fn ne(&self, other: &CornerRadii) -> bool[src]
fn ne(&self, other: &CornerRadii) -> bool[src]This method tests for !=.
impl PartialOrd<CornerRadii> for CornerRadii[src]
impl PartialOrd<CornerRadii> for CornerRadii[src]fn partial_cmp(&self, other: &CornerRadii) -> Option<Ordering>[src]
fn partial_cmp(&self, other: &CornerRadii) -> Option<Ordering>[src]This method returns an ordering between self and other values if one exists. Read more
#[must_use]fn lt(&self, other: &Rhs) -> bool1.0.0[src]
#[must_use]fn lt(&self, other: &Rhs) -> bool1.0.0[src]This method tests less than (for self and other) and is used by the < operator. Read more
#[must_use]fn le(&self, other: &Rhs) -> bool1.0.0[src]
#[must_use]fn le(&self, other: &Rhs) -> bool1.0.0[src]This method tests less than or equal to (for self and other) and is used by the <=
operator. Read more
impl Copy for CornerRadii[src]
impl Eq for CornerRadii[src]
impl StructuralEq for CornerRadii[src]
impl StructuralPartialEq for CornerRadii[src]
Auto Trait Implementations
impl RefUnwindSafe for CornerRadii
impl Send for CornerRadii
impl Sync for CornerRadii
impl Unpin for CornerRadii
impl UnwindSafe for CornerRadii
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]pub fn borrow_mut(&mut self) -> &mut T[src]
pub fn borrow_mut(&mut self) -> &mut T[src]Mutably borrows from an owned value. Read more
impl<Src, Dst> LosslessTryInto<Dst> for Src where
Dst: LosslessTryFrom<Src>, [src]
impl<Src, Dst> LosslessTryInto<Dst> for Src where
Dst: LosslessTryFrom<Src>, [src]pub fn lossless_try_into(self) -> Option<Dst>[src]
pub fn lossless_try_into(self) -> Option<Dst>[src]Performs the conversion.
impl<Src, Dst> LossyInto<Dst> for Src where
Dst: LossyFrom<Src>, [src]
impl<Src, Dst> LossyInto<Dst> for Src where
Dst: LossyFrom<Src>, [src]pub fn lossy_into(self) -> Dst[src]
pub fn lossy_into(self) -> Dst[src]Performs the conversion.
impl<T> Same<T> for T
impl<T> Same<T> for Ttype Output = T
type Output = TShould always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>, pub fn to_subset(&self) -> Option<SS>
pub fn to_subset(&self) -> Option<SS>The inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> boolChecks if self is actually part of its subset T (and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SSUse with care! Same as self.to_subset but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SPThe inclusion map: converts self to the equivalent element of its superset.
impl<T> ToOwned for T where
T: Clone, [src]
impl<T> ToOwned for T where
T: Clone, [src]type Owned = T
type Owned = TThe resulting type after obtaining ownership.
pub fn to_owned(&self) -> T[src]
pub fn to_owned(&self) -> T[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)[src]
pub fn clone_into(&self, target: &mut T)[src]🔬 This is a nightly-only experimental API. (toowned_clone_into)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,