Struct RectangleOf 

#[repr(C)]
pub struct RectangleOf<T> {
    pub pos: T,
    pub size: T,
}

A N dimension rectangle

Fields

pos: T

size: T

Implementations

impl<T> RectangleOf<T>

pub const LEN: usize = 2usize

pub const fn from_array(array: [T; 2]) -> RectangleOf<T>

pub const fn to_array(self) -> [T; 2]

pub const fn array(&self) -> &[T; 2]

pub const fn array_mut(&mut self) -> &mut [T; 2]

pub fn max(self, other: RectangleOf<T>) -> RectangleOf<T>

where RectangleOf<T>: Max,

Max function in a component way

Can cause a panic for grid if the size mismatch

pub fn min(self, other: RectangleOf<T>) -> RectangleOf<T>

where RectangleOf<T>: Min,

Min function in a component way

Can cause a panic for grid if the size mismatch

pub fn abs(self) -> <RectangleOf<T> as Abs>::Output

where RectangleOf<T>: Abs,

Absolute value in a component way.

Overflow behavior

The absolute value of iX::MIN cannot be represented as an iX, and attempting to calculate it will cause an overflow. This means that code in debug mode will trigger a panic on this case and optimized code will return iX::MIN without a panic.

Can cause a panic for grid if the size mismatch

pub fn mix<C>(self, other: RectangleOf<T>, coef: C) -> RectangleOf<T>

where RectangleOf<T>: Mix<C>, C: Float,

Mix function in a component way

The coef is clamped between 0.0..1.

0. => self,
1. => dest.

Can cause a panic for grid if the size mismatch

pub fn mix_unchecked<C>(self, other: RectangleOf<T>, coef: C) -> RectangleOf<T>

where RectangleOf<T>: Mix<C>, C: Float,

Mix function in a component way

The coef is not clamped between 0.0..1.

0. => self,
1. => dest.

Can cause a panic for grid if the size mismatch

pub fn clamp( self, min_val: RectangleOf<T>, max_val: RectangleOf<T>, ) -> RectangleOf<T>

where RectangleOf<T>: Clamp,

Clamp function in a component way

Clamps self between min_val and max_val (inclusive)

Can cause a panic for grid if the size mismatch

impl<T> RectangleOf<T>

where T: Number,

pub const SIZED_ONE: RectangleOf<T>

impl<T> RectangleOf<Vector<T, 2>>

where T: Number,

pub fn down_left(&self) -> Vector<T, 2>

pub fn down_right(&self) -> Vector<T, 2>

where T: One + Mul<Output = T> + Add<Output = T>,

pub fn bottom_left(&self) -> Vector<T, 2>

Same as down_left()

pub fn bottom_right(&self) -> Vector<T, 2>

where T: One + Mul<Output = T> + Add<Output = T>,

Same as down_right()

pub fn up_right(&self) -> Vector<T, 2>

where T: Add<Output = T>,

pub fn up_left(&self) -> Vector<T, 2>

where T: One + Mul<Output = T> + Add<Output = T>,

pub fn top_right(&self) -> Vector<T, 2>

where T: Add<Output = T>,

Same as up_right()

pub fn top_left(&self) -> Vector<T, 2>

where T: One + Mul<Output = T> + Add<Output = T>,

Same as up_left()

impl<T, const N: usize> RectangleOf<Vector<T, N>>

where Vector<T, N>: Number, T: Number,

pub fn new_centered( pos_middle: Vector<T, N>, size: Vector<T, N>, ) -> RectangleOf<Vector<T, N>>

pub fn new_with_center( bottom_left: Vector<T, N>, size: Vector<T, N>, center_coef: Vector<T, N>, ) -> RectangleOf<Vector<T, N>>

pub fn get_coef(&self, coef: Vector<T, N>) -> Vector<T, N>

where Vector<T, N>: Arithmetic,

pub fn middle(&self) -> Vector<T, N>

The center of the coordinate, whatever the dimension

pub fn center(&self) -> Vector<T, N>

pub fn middle_right(&self) -> Vector<T, N>

where Vector<T, N>: HaveX<T>,

pub fn middle_left(&self) -> Vector<T, N>

where Vector<T, N>: HaveX<T>,

pub fn middle_up(&self) -> Vector<T, N>

where Vector<T, N>: HaveY<T>,

pub fn middle_down(&self) -> Vector<T, N>

where Vector<T, N>: HaveY<T>,

pub fn middle_forward(&self) -> Vector<T, N>

where Vector<T, N>: HaveZ<T>,

pub fn middle_backward(&self) -> Vector<T, N>

where Vector<T, N>: HaveZ<T>,

pub fn middle_ana(&self) -> Vector<T, N>

where Vector<T, N>: HaveW<T>,

pub fn middle_kata(&self) -> Vector<T, N>

where Vector<T, N>: HaveW<T>,

pub fn right_value(&self) -> T

where Vector<T, N>: HaveX<T>,

pub fn left_value(&self) -> T

where Vector<T, N>: HaveX<T>,

pub fn up_value(&self) -> T

where Vector<T, N>: HaveY<T>,

pub fn down_value(&self) -> T

where Vector<T, N>: HaveY<T>,

pub fn top_value(&self) -> T

where Vector<T, N>: HaveY<T>,

Same as up_value()

pub fn bottom_value(&self) -> T

where Vector<T, N>: HaveY<T>,

Same as down_value()

pub fn forward_value(&self) -> T

where Vector<T, N>: HaveZ<T>,

pub fn backward_value(&self) -> T

where Vector<T, N>: HaveZ<T>,

pub fn ana_value(&self) -> T

where Vector<T, N>: HaveW<T>,

pub fn kata_value(&self) -> T

where Vector<T, N>: HaveW<T>,

impl<T, const N: usize> RectangleOf<Vector<T, N>>

where T: Primitive,

pub fn split_axis( &self, nb: T, axis: usize, ) -> impl Iterator<Item = RectangleOf<Vector<T, N>>>

pub fn split_x(&self, nb: T) -> impl Iterator<Item = RectangleOf<Vector<T, N>>>

where Vector<T, N>: HaveX<T>,

pub fn split_y(&self, nb: T) -> impl Iterator<Item = RectangleOf<Vector<T, N>>>

where Vector<T, N>: HaveY<T>,

pub fn split_z(&self, nb: T) -> impl Iterator<Item = RectangleOf<Vector<T, N>>>

where Vector<T, N>: HaveZ<T>,

pub fn split_w(&self, nb: T) -> impl Iterator<Item = RectangleOf<Vector<T, N>>>

where Vector<T, N>: HaveW<T>,

pub fn split_min( &self, nb: T, ) -> impl Iterator<Item = RectangleOf<Vector<T, N>>>

pub fn split_max( &self, nb: T, ) -> impl Iterator<Item = RectangleOf<Vector<T, N>>>

impl<T, const N: usize> RectangleOf<Vector<T, N>>

where T: Number,

pub fn is_inside(&self, point: Vector<T, N>) -> bool

Check if a point inside the rectangle. Also work for indexing

use hexga_math::prelude::*;

// inside :
assert!(rect2i(0, 0, 2, 2).is_inside(point2(1, 1)));
assert!(rect2i(0, 0, 2, 2).is_inside(point2(0, 0)));


// not inside :
assert!(!rect2i(0, 0, 2, 2).is_inside(point2(2, 0)));
assert!(!rect2i(0, 0, 2, 2).is_inside(point2(0, 2)));
assert!(!rect2i(0, 0, 2, 2).is_inside(point2(2, 2)));

assert!(!rect2i(0, 0, 2, 2).is_inside(point2( 3,   3)));
assert!(!rect2i(0, 0, 2, 2).is_inside(point2(-1,  -1)));
assert!(!rect2i(0, 0, 2, 2).is_inside(point2(-1,  -1)));
assert!(!rect2i(0, 0, 2, 2).is_inside(point2( 1,  10)));
assert!(!rect2i(0, 0, 2, 2).is_inside(point2( 1, -10)));
assert!(!rect2i(0, 0, 2, 2).is_inside(point2(-10,  1)));
assert!(!rect2i(0, 0, 2, 2).is_inside(point2( 10,  1)));

pub fn is_inside_inclusif(&self, point: Vector<T, N>) -> bool

Check if a point inside the rectangle. Don’t work for indexing

pub fn is_rect_inside(&self, rect: RectangleOf<Vector<T, N>>) -> bool

pub fn is_empty(&self) -> bool

pub fn clamp_vector(&self, vector: Vector<T, N>) -> Vector<T, N>

where Vector<T, N>: Clamp,

pub fn intersect_or_empty( self, other: RectangleOf<Vector<T, N>>, ) -> RectangleOf<Vector<T, N>>

where Vector<T, N>: Max + Min,

pub fn intersect( self, other: RectangleOf<Vector<T, N>>, ) -> Option<RectangleOf<Vector<T, N>>>

where Vector<T, N>: Max + Min,

None if any rectangle is empty

impl<T> RectangleOf<T>

pub const fn new(pos: T, size: T) -> RectangleOf<T>

assume the size is valid

pub const fn new_sized(size: T) -> RectangleOf<T>

where T: Zero,

assume the size is valid

impl<T, const N: usize> RectangleOf<Vector<T, N>>

where T: Number,

pub fn from_pos_to_pos( start_pos: Vector<T, N>, end_pos: Vector<T, N>, ) -> RectangleOf<Vector<T, N>>

Trait Implementations

impl<T> Add<T> for RectangleOf<T>

where T: Add + Copy,

type Output = RectangleOf<<T as Add>::Output>

The resulting type after applying the + operator.

fn add(self, rhs: T) -> <RectangleOf<T> as Add<T>>::Output

Performs the + operation.

impl<T> Add for RectangleOf<T>

where T: Add,

type Output = RectangleOf<<T as Add>::Output>

The resulting type after applying the + operator.

fn add(self, rhs: RectangleOf<T>) -> <RectangleOf<T> as Add>::Output

Performs the + operation.

impl<T> AddAssign<&RectangleOf<T>> for RectangleOf<T>

where T: AddAssign + Copy,

fn add_assign(&mut self, rhs: &RectangleOf<T>)

Performs the += operation.

impl<T> AddAssign for RectangleOf<T>

where T: AddAssign,

fn add_assign(&mut self, rhs: RectangleOf<T>)

Performs the += operation.

impl<T> Array<T, 2> for RectangleOf<T>

fn array(&self) -> &[T; 2]

fn array_mut(&mut self) -> &mut [T; 2]

const DIMENSION: usize = N

fn to_array_resized<const M: usize>(self) -> [T; M]

where T: Default,

Fill non existing component with Default

fn to_array_resized_with_value<const M: usize>(self, fill: T) -> [T; M]

where T: Clone,

Fill non existing component with the Cloned given value

impl<T> ArrayWithType<T, 2> for RectangleOf<T>

type WithType<T2> = RectangleOf<T2>

impl<T> AsMut<[T; 2]> for RectangleOf<T>

fn as_mut(&mut self) -> &mut [T; 2]

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T, Policy> AsMut<RectangleOf<T>> for RectangleOfWithDefault<T, Policy>

where Policy: Constant<T>,

fn as_mut(&mut self) -> &mut RectangleOf<T>

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T> AsRef<[T; 2]> for RectangleOf<T>

fn as_ref(&self) -> &[T; 2]

Converts this type into a shared reference of the (usually inferred) input type.

impl<T, Policy> AsRef<RectangleOf<T>> for RectangleOfWithDefault<T, Policy>

where Policy: Constant<T>,

fn as_ref(&self) -> &RectangleOf<T>

Converts this type into a shared reference of the (usually inferred) input type.

impl<T> Binary for RectangleOf<T>

where T: Binary,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<T> BitAnd<T> for RectangleOf<T>

where T: BitAnd + Copy,

type Output = RectangleOf<<T as BitAnd>::Output>

The resulting type after applying the & operator.

fn bitand(self, rhs: T) -> <RectangleOf<T> as BitAnd<T>>::Output

Performs the & operation.

impl<T> BitAnd for RectangleOf<T>

where T: BitAnd,

type Output = RectangleOf<<T as BitAnd>::Output>

The resulting type after applying the & operator.

fn bitand(self, rhs: RectangleOf<T>) -> <RectangleOf<T> as BitAnd>::Output

Performs the & operation.

impl<T> BitAndAssign<&RectangleOf<T>> for RectangleOf<T>

where T: BitAndAssign + Copy,

fn bitand_assign(&mut self, rhs: &RectangleOf<T>)

Performs the &= operation.

impl<T> BitAndAssign for RectangleOf<T>

where T: BitAndAssign,

fn bitand_assign(&mut self, rhs: RectangleOf<T>)

Performs the &= operation.

impl<T> BitOr<T> for RectangleOf<T>

where T: BitOr + Copy,

type Output = RectangleOf<<T as BitOr>::Output>

The resulting type after applying the | operator.

fn bitor(self, rhs: T) -> <RectangleOf<T> as BitOr<T>>::Output

Performs the | operation.

impl<T> BitOr for RectangleOf<T>

where T: BitOr,

type Output = RectangleOf<<T as BitOr>::Output>

The resulting type after applying the | operator.

fn bitor(self, rhs: RectangleOf<T>) -> <RectangleOf<T> as BitOr>::Output

Performs the | operation.

impl<T> BitOrAssign<&RectangleOf<T>> for RectangleOf<T>

where T: BitOrAssign + Copy,

fn bitor_assign(&mut self, rhs: &RectangleOf<T>)

Performs the |= operation.

impl<T> BitOrAssign for RectangleOf<T>

where T: BitOrAssign,

fn bitor_assign(&mut self, rhs: RectangleOf<T>)

Performs the |= operation.

impl<T> BitPattern for RectangleOf<T>

where T: BitPattern, [<T as BitPattern>::Bits; 2]: BitAnyPattern,

type Bits = [<T as BitPattern>::Bits; 2]

fn is_bit_pattern_valid(bits: &<RectangleOf<T> as BitPattern>::Bits) -> bool

fn from_bits(bits: Self::Bits) -> Option<Self>

impl<T> Clone for RectangleOf<T>

where T: Clone,

fn clone(&self) -> RectangleOf<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T, const N: usize> Crop<T, N> for RectangleOf<Vector<T, N>>

where T: Number,

fn crop( self, subrect: RectangleOf<Vector<T, N>>, ) -> Option<RectangleOf<Vector<T, N>>>

Crop the current rectangle to the given sub rectangle.

unsafe fn crop_unchecked( self, subrect: RectangleOf<Vector<T, N>>, ) -> RectangleOf<Vector<T, N>>

Crop the current rectangle to the given sub rectangle.

fn crop_intersect( self, subrect: RectangleOf<Vector<T, N>>, ) -> RectangleOf<Vector<T, N>>

Crop the current rectangle to the given sub rectangle.

unsafe fn crop_margin_unchecked( self, margin_start: Vector<T, N>, margin_end: Vector<T, N>, ) -> RectangleOf<Vector<T, N>>

fn crop_or_panic(self, subrect: RectangleOf<Vector<T, N>>) -> Self

Crop the current rectangle to the given sub rectangle.

fn crop_margin( self, margin_start: Vector<T, N>, margin_end: Vector<T, N>, ) -> Option<Self>

fn crop_margin_intersect( self, margin_start: Vector<T, N>, margin_end: Vector<T, N>, ) -> Self

Crop self by adding a margin to the start and the end of the current rectangle size.

impl<T> Debug for RectangleOf<T>

where T: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<T> Default for RectangleOf<T>

where T: Number,

fn default() -> RectangleOf<T>

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for RectangleOf<T>

where T: Deserialize<'de>,

fn deserialize<D>( deserializer: D, ) -> Result<RectangleOf<T>, <D as Deserializer<'de>>::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> Display for RectangleOf<T>

where T: Display,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<T> Div<T> for RectangleOf<T>

where T: Div + Copy,

type Output = RectangleOf<<T as Div>::Output>

The resulting type after applying the / operator.

fn div(self, rhs: T) -> <RectangleOf<T> as Div<T>>::Output

Performs the / operation.

impl<T> Div for RectangleOf<T>

where T: Div,

type Output = RectangleOf<<T as Div>::Output>

The resulting type after applying the / operator.

fn div(self, rhs: RectangleOf<T>) -> <RectangleOf<T> as Div>::Output

Performs the / operation.

impl<T> DivAssign<&RectangleOf<T>> for RectangleOf<T>

where T: DivAssign + Copy,

fn div_assign(&mut self, rhs: &RectangleOf<T>)

Performs the /= operation.

impl<T> DivAssign for RectangleOf<T>

where T: DivAssign,

fn div_assign(&mut self, rhs: RectangleOf<T>)

Performs the /= operation.

impl<T> From<[T; 2]> for RectangleOf<T>

fn from(value: [T; 2]) -> RectangleOf<T>

Converts to this type from the input type.

impl<T> From<(T, T)> for RectangleOf<T>

fn from(value: (T, T)) -> RectangleOf<T>

Converts to this type from the input type.

impl<T> From<RectangleOf<T>> for [T; 2]

fn from(value: RectangleOf<T>) -> [T; 2]

Converts to this type from the input type.

impl<T> From<RectangleOf<T>> for (T, T)

fn from(value: RectangleOf<T>) -> (T, T)

Converts to this type from the input type.

impl<T, Policy> From<RectangleOf<T>> for RectangleOfWithDefault<T, Policy>

where Policy: Constant<T>,

fn from(value: RectangleOf<T>) -> RectangleOfWithDefault<T, Policy>

Converts to this type from the input type.

impl<T, Policy> From<RectangleOfWithDefault<T, Policy>> for RectangleOf<T>

where Policy: Constant<T>,

fn from(value: RectangleOfWithDefault<T, Policy>) -> RectangleOf<T>

Converts to this type from the input type.

impl<T, Idx> Get<Idx> for RectangleOf<T>

where [T; 2]: Get<Idx>,

type Output = <[T; 2] as Get<Idx>>::Output

fn get(&self, index: Idx) -> Option<&<RectangleOf<T> as Get<Idx>>::Output>

Returns a reference to the value.

unsafe fn get_unchecked( &self, index: Idx, ) -> &<RectangleOf<T> as Get<Idx>>::Output

Returns a reference to the value.

fn get_or_panic(&self, index: Idx) -> &Self::Output

Returns a reference to the value.

fn is_index_valid(&self, index: Idx) -> bool

True if get(index) return Some, false otherwise.

fn is_index_invalid(&self, index: Idx) -> bool

True if get(index) return None, false otherwise.

fn contains(&self, index: Idx) -> bool

impl<T, Idx> GetManyMut<Idx> for RectangleOf<T>

where [T; 2]: GetManyMut<Idx>,

fn try_get_many_mut<const N: usize>( &mut self, indices: [Idx; N], ) -> Result<[&mut <RectangleOf<T> as Get<Idx>>::Output; N], GetDisjointMutError>

fn get_many_mut<const N: usize>( &mut self, indices: [Idx; N], ) -> Option<[&mut <RectangleOf<T> as Get<Idx>>::Output; N]>

Returns multiples mutables references to the values. All values that can be accessed with the indices must be disjoint.

unsafe fn get_many_unchecked_mut<const N: usize>( &mut self, indices: [Idx; N], ) -> [&mut <RectangleOf<T> as Get<Idx>>::Output; N]

Returns multiples mutables references to the values. All values that can be accessed with the indices must be disjoint.

fn get_many_mut_or_panic<const N: usize>( &mut self, indices: [Idx; N], ) -> [&mut Self::Output; N]

Returns multiples mutables references to the values. All values that can be accessed with the indices must be disjoint.

fn swap(&mut self, a: Idx, b: Idx) -> bool

where Self::Output: Sized,

Swaps the values at two mutable locations, without deinitializing either one.

fn swap_or_panic(&mut self, a: Idx, b: Idx)

where Self::Output: Sized,

Swaps the values at two mutable locations, without deinitializing either one.

unsafe fn swap_unchecked(&mut self, a: Idx, b: Idx)

where Self::Output: Sized,

Swaps the values at two mutable locations, without deinitializing either one.

impl<T, Idx> GetMut<Idx> for RectangleOf<T>

where [T; 2]: GetMut<Idx>,

fn get_mut( &mut self, index: Idx, ) -> Option<&mut <RectangleOf<T> as Get<Idx>>::Output>

Returns a mutable reference to the value.

unsafe fn get_unchecked_mut( &mut self, index: Idx, ) -> &mut <RectangleOf<T> as Get<Idx>>::Output

Returns a mutable reference to the value.

fn get_mut_or_panic(&mut self, index: Idx) -> &mut Self::Output

fn replace(&mut self, index: Idx, value: Self::Output) -> Option<Self::Output>

where Self::Output: Sized,

Replace the value and return the old one.

fn replace_or_panic(&mut self, index: Idx, value: Self::Output) -> Self::Output

where Self::Output: Sized,

Replace the value and return the old one.

unsafe fn replace_unchecked( &mut self, index: Idx, value: Self::Output, ) -> Self::Output

where Self::Output: Sized,

Replace the value and return the old one.

fn set(&mut self, index: Idx, value: Self::Output) -> bool

where Self::Output: Sized,

Set the value and drop the previous one.

fn set_or_panic(&mut self, index: Idx, value: Self::Output) -> &mut Self

where Self::Output: Sized,

Set the value and drop the previous one.

unsafe fn set_unchecked(&mut self, index: Idx, value: Self::Output) -> &mut Self

where Self::Output: Sized,

impl<T, const N: usize> GetPosition<T, N> for RectangleOf<Vector<T, N>>

where T: Number,

fn pos(&self) -> Vector<T, N>

fn x(&self) -> T

where Vector<T, N>: HaveX<T>,

fn y(&self) -> T

where Vector<T, N>: HaveY<T>,

fn z(&self) -> T

where Vector<T, N>: HaveZ<T>,

fn w(&self) -> T

where Vector<T, N>: HaveW<T>,

impl<T, const N: usize> GetSize<T, N> for RectangleOf<Vector<T, N>>

where T: Number,

fn size(&self) -> Vector<T, N>

fn size_x(&self) -> T

where Vector<T, N>: HaveX<T>,

fn size_y(&self) -> T

where Vector<T, N>: HaveY<T>,

fn size_z(&self) -> T

where Vector<T, N>: HaveZ<T>,

fn size_w(&self) -> T

where Vector<T, N>: HaveW<T>,

fn width(&self) -> T

where Vector<T, N>: HaveX<T>,

Same as .size_x()

fn height(&self) -> T

where Vector<T, N>: HaveY<T>,

Same as .size_y()

fn depth(&self) -> T

where Vector<T, N>: HaveZ<T>,

Same as .size_z()

fn area(&self) -> T

fn area_usize(&self) -> usize

where T: Integer,

impl<T> Half for RectangleOf<T>

where T: Half + Copy,

const HALF: RectangleOf<T>

fn half() -> Self

where Self: Sized,

fn set_half(&mut self) -> &mut Self

fn is_half(self) -> bool

where Self: PartialEq,

fn is_non_half(self) -> bool

where Self: PartialEq,

impl<T> Hash for RectangleOf<T>

where T: Hash,

fn hash<H>(&self, state: &mut H)

where H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T, Idx> Index<Idx> for RectangleOf<T>

where [T; 2]: Index<Idx>,

type Output = <[T; 2] as Index<Idx>>::Output

The returned type after indexing.

fn index(&self, index: Idx) -> &<RectangleOf<T> as Index<Idx>>::Output

Performs the indexing (container[index]) operation.

impl<T, Idx> IndexMut<Idx> for RectangleOf<T>

where [T; 2]: IndexMut<Idx>,

fn index_mut( &mut self, index: Idx, ) -> &mut <RectangleOf<T> as Index<Idx>>::Output

Performs the mutable indexing (container[index]) operation.

impl<T> Infinity for RectangleOf<T>

where T: Infinity + Copy,

const INFINITY: RectangleOf<T>

fn is_infinity(&self) -> bool

where Self: PartialEq,

fn is_not_infinity(&self) -> bool

where Self: PartialEq,

impl<'a, T> IntoIterator for &'a RectangleOf<T>

where &'a [T; 2]: IntoIterator,

type Item = <&'a [T; 2] as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <&'a [T; 2] as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a RectangleOf<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a mut RectangleOf<T>

where &'a mut [T; 2]: IntoIterator,

type Item = <&'a mut [T; 2] as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <&'a mut [T; 2] as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a mut RectangleOf<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for RectangleOf<T>

where [T; 2]: IntoIterator,

type Item = <[T; 2] as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <[T; 2] as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> <RectangleOf<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<Idx, const N: usize> IterIndex<Idx, N> for RectangleOf<Vector<Idx, N>>

where Idx: Integer,

type IterIndex = RectangleIter<Idx, N>

fn iter_index( &self, ) -> <RectangleOf<Vector<Idx, N>> as IterIndex<Idx, N>>::IterIndex

Iter over all Point in self.

impl<T> Length for RectangleOf<T>

fn len(&self) -> usize

fn is_empty(&self) -> bool

True if the container contains 0 elements.

fn is_not_empty(&self) -> bool

True if the container contains at least one element. Will always be different than is_empty().

impl<T> LowerExp for RectangleOf<T>

where T: LowerExp,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<T> LowerHex for RectangleOf<T>

where T: LowerHex,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<T> Map for RectangleOf<T>

type WithType<T2> = RectangleOf<T2>

fn map<T2, F>(self, f: F) -> <RectangleOf<T> as Map>::WithType<T2>

where F: FnMut(<RectangleOf<T> as MapIntern>::Item) -> T2,

Apply f to each item, returning a container of the mapped values.

impl<T> MapIntern for RectangleOf<T>

type Item = T

fn map_intern<F>(self, f: F) -> RectangleOf<T>

where F: FnMut(<RectangleOf<T> as MapIntern>::Item) -> <RectangleOf<T> as MapIntern>::Item,

Apply f to each item, producing a new container of the same type.

impl<T> MapInternWith for RectangleOf<T>

fn map_with_intern<F>(self, other: RectangleOf<T>, f: F) -> RectangleOf<T>

where F: FnMut(<RectangleOf<T> as MapIntern>::Item, <RectangleOf<T> as MapIntern>::Item) -> <RectangleOf<T> as MapIntern>::Item,

Combine self and other elementwise with f.

impl<T> MapWith for RectangleOf<T>

fn map_with<R, Item2, F>( self, other: <RectangleOf<T> as Map>::WithType<Item2>, f: F, ) -> <RectangleOf<T> as Map>::WithType<R>

where F: FnMut(<RectangleOf<T> as MapIntern>::Item, Item2) -> R,

Combine self and other elementwise with f, producing a new container of the mapped values.

impl<T> MaxValue for RectangleOf<T>

where T: MaxValue + Copy,

const MAX: RectangleOf<T>

fn is_max(&self) -> bool

where Self: PartialEq,

fn is_not_max(&self) -> bool

where Self: PartialEq,

impl<T> MinValue for RectangleOf<T>

where T: MinValue + Copy,

const MIN: RectangleOf<T>

fn is_min(&self) -> bool

where Self: PartialEq,

fn is_not_min(&self) -> bool

where Self: PartialEq,

impl<T> MinusInfinity for RectangleOf<T>

where T: MinusInfinity + Copy,

const MINUS_INFINITY: RectangleOf<T>

fn is_minus_infinity(&self) -> bool

where Self: PartialEq,

fn is_not_minus_infinity(&self) -> bool

where Self: PartialEq,

impl<T> MinusOne for RectangleOf<T>

where T: MinusOne + Copy,

const MINUS_ONE: RectangleOf<T>

fn minus_one() -> Self

where Self: Sized,

fn set_minus_one(&mut self) -> &mut Self

fn is_minus_one(&self) -> bool

where Self: PartialEq,

fn is_non_minus_one(&self) -> bool

where Self: PartialEq,

impl<T> Mul<T> for RectangleOf<T>

where T: Mul + Copy,

type Output = RectangleOf<<T as Mul>::Output>

The resulting type after applying the * operator.

fn mul(self, rhs: T) -> <RectangleOf<T> as Mul<T>>::Output

Performs the * operation.

impl<T> Mul for RectangleOf<T>

where T: Mul,

type Output = RectangleOf<<T as Mul>::Output>

The resulting type after applying the * operator.

fn mul(self, rhs: RectangleOf<T>) -> <RectangleOf<T> as Mul>::Output

Performs the * operation.

impl<T> MulAssign<&RectangleOf<T>> for RectangleOf<T>

where T: MulAssign + Copy,

fn mul_assign(&mut self, rhs: &RectangleOf<T>)

Performs the *= operation.

impl<T> MulAssign for RectangleOf<T>

where T: MulAssign,

fn mul_assign(&mut self, rhs: RectangleOf<T>)

Performs the *= operation.

impl<T> NaNValue for RectangleOf<T>

where T: NaNValue + Copy,

const NAN: RectangleOf<T>

fn is_nan(&self) -> bool

where Self: PartialEq,

fn is_not_nan(&self) -> bool

where Self: PartialEq,

impl<T> Neg for RectangleOf<T>

where T: Neg,

type Output = RectangleOf<<T as Neg>::Output>

The resulting type after applying the - operator.

fn neg(self) -> <RectangleOf<T> as Neg>::Output

Performs the unary - operation.

impl<T> Not for RectangleOf<T>

where T: Not,

type Output = RectangleOf<<T as Not>::Output>

The resulting type after applying the ! operator.

fn not(self) -> <RectangleOf<T> as Not>::Output

Performs the unary ! operation.

impl<T> Octal for RectangleOf<T>

where T: Octal,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<T> One for RectangleOf<T>

where T: One + Copy,

const ONE: RectangleOf<T>

The neutral element of the multiplication such that x * X::ONE = x

fn one() -> Self

where Self: Sized,

fn set_one(&mut self) -> &mut Self

fn is_one(&self) -> bool

where Self: PartialEq,

fn is_non_one(&self) -> bool

where Self: PartialEq,

impl<T> Ord for RectangleOf<T>

where T: Ord,

fn cmp(&self, rhs: &RectangleOf<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T> PartialEq for RectangleOf<T>

where T: PartialEq,

fn eq(&self, rhs: &RectangleOf<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> PartialOrd for RectangleOf<T>

where T: PartialOrd,

fn partial_cmp(&self, rhs: &RectangleOf<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T> Pointer for RectangleOf<T>

where T: Pointer,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<T> Product for RectangleOf<T>

where RectangleOf<T>: One + Mul<Output = RectangleOf<T>>,

fn product<I>(iter: I) -> RectangleOf<T>

where I: Iterator<Item = RectangleOf<T>>,

Takes an iterator and generates Self from the elements by multiplying the items.

impl<T> Rem<T> for RectangleOf<T>

where T: Rem + Copy,

type Output = RectangleOf<<T as Rem>::Output>

The resulting type after applying the % operator.

fn rem(self, rhs: T) -> <RectangleOf<T> as Rem<T>>::Output

Performs the % operation.

impl<T> Rem for RectangleOf<T>

where T: Rem,

type Output = RectangleOf<<T as Rem>::Output>

The resulting type after applying the % operator.

fn rem(self, rhs: RectangleOf<T>) -> <RectangleOf<T> as Rem>::Output

Performs the % operation.

impl<T> RemAssign<&RectangleOf<T>> for RectangleOf<T>

where T: RemAssign + Copy,

fn rem_assign(&mut self, rhs: &RectangleOf<T>)

Performs the %= operation.

impl<T> RemAssign for RectangleOf<T>

where T: RemAssign,

fn rem_assign(&mut self, rhs: RectangleOf<T>)

Performs the %= operation.

impl<T> Serialize for RectangleOf<T>

where T: Serialize,

Available on crate feature serde only.

fn serialize<S>( &self, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T, const N: usize> SetPosition<T, N> for RectangleOf<Vector<T, N>>

where T: Number,

fn set_pos(&mut self, pos: Vector<T, N>) -> &mut RectangleOf<Vector<T, N>>

fn set_x(&mut self, x: T) -> &mut Self

where Vector<T, N>: HaveX<T>, Self: GetPosition<T, N>,

fn set_y(&mut self, y: T) -> &mut Self

where Vector<T, N>: HaveY<T>, Self: GetPosition<T, N>,

fn set_z(&mut self, z: T) -> &mut Self

where Vector<T, N>: HaveZ<T>, Self: GetPosition<T, N>,

fn set_w(&mut self, w: T) -> &mut Self

where Vector<T, N>: HaveW<T>, Self: GetPosition<T, N>,

fn with_pos(self, pos: Vector<T, N>) -> Self

where Self: Sized + GetPosition<T, N>,

fn with_x(self, x: T) -> Self

where Vector<T, N>: HaveX<T>, Self: Sized + GetPosition<T, N>,

fn with_y(self, y: T) -> Self

where Vector<T, N>: HaveY<T>, Self: Sized + GetPosition<T, N>,

fn with_z(self, z: T) -> Self

where Vector<T, N>: HaveZ<T>, Self: Sized + GetPosition<T, N>,

fn with_w(self, w: T) -> Self

where Vector<T, N>: HaveW<T>, Self: Sized + GetPosition<T, N>,

fn move_by(&mut self, v: impl Into<Vector<T, N>>) -> &mut Self

where Vector<T, N>: Add<Output = Vector<T, N>>, Self: GetPosition<T, N>,

fn move_neg_by(&mut self, v: impl Into<Vector<T, N>>) -> &mut Self

where Vector<T, N>: Sub<Output = Vector<T, N>>, Self: GetPosition<T, N>,

fn move_x(&mut self, x: T) -> &mut Self

where Vector<T, N>: HaveX<T> + Zero + Add<Output = Vector<T, N>>, Self: GetPosition<T, N>,

fn move_y(&mut self, y: T) -> &mut Self

where Vector<T, N>: HaveY<T> + Zero + Add<Output = Vector<T, N>>, Self: GetPosition<T, N>,

fn move_z(&mut self, z: T) -> &mut Self

where Vector<T, N>: HaveZ<T> + Zero + Add<Output = Vector<T, N>>, Self: GetPosition<T, N>,

fn move_w(&mut self, w: T) -> &mut Self

where Vector<T, N>: HaveW<T> + Zero + Add<Output = Vector<T, N>>, Self: GetPosition<T, N>,

fn move_neg_x(&mut self, x: T) -> &mut Self

where Vector<T, N>: HaveX<T> + Zero + Add<Output = Vector<T, N>>, T: Neg<Output = T>, Self: GetPosition<T, N>,

fn move_neg_y(&mut self, y: T) -> &mut Self

where Vector<T, N>: HaveY<T> + Zero + Add<Output = Vector<T, N>>, T: Neg<Output = T>, Self: GetPosition<T, N>,

fn move_neg_z(&mut self, z: T) -> &mut Self

where Vector<T, N>: HaveZ<T> + Zero + Add<Output = Vector<T, N>>, T: Neg<Output = T>, Self: GetPosition<T, N>,

fn move_neg_w(&mut self, w: T) -> &mut Self

where Vector<T, N>: HaveW<T> + Zero + Add<Output = Vector<T, N>>, T: Neg<Output = T>, Self: GetPosition<T, N>,

fn moved_by(self, v: impl Into<Vector<T, N>>) -> Self

where Vector<T, N>: Add<Output = Vector<T, N>>, Self: Sized + GetPosition<T, N>,

fn moved_neg_by(self, v: impl Into<Vector<T, N>>) -> Self

where Vector<T, N>: Sub<Output = Vector<T, N>>, Self: Sized + GetPosition<T, N>,

fn moved_x(self, x: T) -> Self

where Vector<T, N>: HaveX<T> + Zero + Add<Output = Vector<T, N>>, Self: Sized + GetPosition<T, N>,

fn moved_y(self, y: T) -> Self

where Vector<T, N>: HaveY<T> + Zero + Add<Output = Vector<T, N>>, Self: Sized + GetPosition<T, N>,

fn moved_z(self, z: T) -> Self

where Vector<T, N>: HaveZ<T> + Zero + Add<Output = Vector<T, N>>, Self: Sized + GetPosition<T, N>,

fn moved_w(self, w: T) -> Self

where Vector<T, N>: HaveW<T> + Zero + Add<Output = Vector<T, N>>, Self: Sized + GetPosition<T, N>,

fn moved_neg_x(self, x: T) -> Self

where Vector<T, N>: HaveX<T> + Zero + Add<Output = Vector<T, N>>, T: Neg<Output = T>, Self: Sized + GetPosition<T, N>,

fn moved_neg_y(self, y: T) -> Self

where Vector<T, N>: HaveY<T> + Zero + Add<Output = Vector<T, N>>, T: Neg<Output = T>, Self: Sized + GetPosition<T, N>,

fn moved_neg_z(self, z: T) -> Self

where Vector<T, N>: HaveZ<T> + Zero + Add<Output = Vector<T, N>>, T: Neg<Output = T>, Self: Sized + GetPosition<T, N>,

fn moved_neg_w(self, w: T) -> Self

where Vector<T, N>: HaveW<T> + Zero + Add<Output = Vector<T, N>>, T: Neg<Output = T>, Self: Sized + GetPosition<T, N>,

impl<T, const N: usize> SetSize<T, N> for RectangleOf<Vector<T, N>>

where T: Number,

fn set_size(&mut self, size: Vector<T, N>) -> &mut RectangleOf<Vector<T, N>>

fn resize(&mut self, size: Vector<T, N>) -> &mut Self

fn set_size_x(&mut self, x: T) -> &mut Self

where Vector<T, N>: HaveX<T>,

fn set_size_y(&mut self, y: T) -> &mut Self

where Vector<T, N>: HaveY<T>,

fn set_size_z(&mut self, z: T) -> &mut Self

where Vector<T, N>: HaveZ<T>,

fn set_size_w(&mut self, w: T) -> &mut Self

where Vector<T, N>: HaveW<T>,

fn with_size(self, size: Vector<T, N>) -> Self

where Self: Sized,

fn with_size_x(self, x: T) -> Self

where Vector<T, N>: HaveX<T>, Self: Sized,

fn with_size_y(self, y: T) -> Self

where Vector<T, N>: HaveY<T>, Self: Sized,

fn with_size_z(self, z: T) -> Self

where Vector<T, N>: HaveZ<T>, Self: Sized,

fn with_size_w(self, w: T) -> Self

where Vector<T, N>: HaveW<T>, Self: Sized,

impl<T> Shl<T> for RectangleOf<T>

where T: Shl + Copy,

type Output = RectangleOf<<T as Shl>::Output>

The resulting type after applying the << operator.

fn shl(self, rhs: T) -> <RectangleOf<T> as Shl<T>>::Output

Performs the << operation.

impl<T> Shl for RectangleOf<T>

where T: Shl,

type Output = RectangleOf<<T as Shl>::Output>

The resulting type after applying the << operator.

fn shl(self, rhs: RectangleOf<T>) -> <RectangleOf<T> as Shl>::Output

Performs the << operation.

impl<T> ShlAssign<&RectangleOf<T>> for RectangleOf<T>

where T: ShlAssign + Copy,

fn shl_assign(&mut self, rhs: &RectangleOf<T>)

Performs the <<= operation.

impl<T> ShlAssign for RectangleOf<T>

where T: ShlAssign,

fn shl_assign(&mut self, rhs: RectangleOf<T>)

Performs the <<= operation.

impl<T> Shr<T> for RectangleOf<T>

where T: Shr + Copy,

type Output = RectangleOf<<T as Shr>::Output>

The resulting type after applying the >> operator.

fn shr(self, rhs: T) -> <RectangleOf<T> as Shr<T>>::Output

Performs the >> operation.

impl<T> Shr for RectangleOf<T>

where T: Shr,

type Output = RectangleOf<<T as Shr>::Output>

The resulting type after applying the >> operator.

fn shr(self, rhs: RectangleOf<T>) -> <RectangleOf<T> as Shr>::Output

Performs the >> operation.

impl<T> ShrAssign<&RectangleOf<T>> for RectangleOf<T>

where T: ShrAssign + Copy,

fn shr_assign(&mut self, rhs: &RectangleOf<T>)

Performs the >>= operation.

impl<T> ShrAssign for RectangleOf<T>

where T: ShrAssign,

fn shr_assign(&mut self, rhs: RectangleOf<T>)

Performs the >>= operation.

impl<T> Sub<T> for RectangleOf<T>

where T: Sub + Copy,

type Output = RectangleOf<<T as Sub>::Output>

The resulting type after applying the - operator.

fn sub(self, rhs: T) -> <RectangleOf<T> as Sub<T>>::Output

Performs the - operation.

impl<T> Sub for RectangleOf<T>

where T: Sub,

type Output = RectangleOf<<T as Sub>::Output>

The resulting type after applying the - operator.

fn sub(self, rhs: RectangleOf<T>) -> <RectangleOf<T> as Sub>::Output

Performs the - operation.

impl<T> SubAssign<&RectangleOf<T>> for RectangleOf<T>

where T: SubAssign + Copy,

fn sub_assign(&mut self, rhs: &RectangleOf<T>)

Performs the -= operation.

impl<T> SubAssign for RectangleOf<T>

where T: SubAssign,

fn sub_assign(&mut self, rhs: RectangleOf<T>)

Performs the -= operation.

impl<T> Sum for RectangleOf<T>

where RectangleOf<T>: Zero + Add<Output = RectangleOf<T>>,

fn sum<I>(iter: I) -> RectangleOf<T>

where I: Iterator<Item = RectangleOf<T>>,

Takes an iterator and generates Self from the elements by “summing up” the items.

impl<T, Idx> TryGet<Idx> for RectangleOf<T>

where [T; 2]: TryGet<Idx>,

type Error = <[T; 2] as TryGet<Idx>>::Error

fn try_get( &self, index: Idx, ) -> Result<&<RectangleOf<T> as Get<Idx>>::Output, <RectangleOf<T> as TryGet<Idx>>::Error>

Returns a reference to the value.

impl<T, Idx> TryGetMut<Idx> for RectangleOf<T>

where [T; 2]: TryGetMut<Idx>,

fn try_get_mut( &mut self, index: Idx, ) -> Result<&mut <RectangleOf<T> as Get<Idx>>::Output, <RectangleOf<T> as TryGet<Idx>>::Error>

Returns a mutable reference to the value.

fn try_replace( &mut self, index: Idx, value: Self::Output, ) -> Result<Self::Output, Self::Error>

where Self::Output: Sized,

Replace the value and return the old one.

fn try_set( &mut self, index: Idx, value: Self::Output, ) -> Result<(), Self::Error>

where Self::Output: Sized,

Set the value and drop the previous one.

impl<T> UpperExp for RectangleOf<T>

where T: UpperExp,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<T> UpperHex for RectangleOf<T>

where T: UpperHex,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<T, Policy> WithDefault<T, Policy> for RectangleOf<T>

where RectangleOf<T>: CfgSerialize + for<'de> CfgDeserialize<'de>, T: CfgSerialize + for<'de> CfgDeserialize<'de>, Policy: Constant<T>,

type WithDefault = RectangleOfWithDefault<T, Policy>

impl<T> Zero for RectangleOf<T>

where T: Zero + Copy,

const ZERO: RectangleOf<T>

The absorbing element of the multiplication such that x * X::ZERO = X::ZERO

fn zero() -> Self

fn set_zero(&mut self) -> &mut Self

fn is_zero(&self) -> bool

where Self: PartialEq,

fn is_non_zero(&self) -> bool

where Self: PartialEq,

impl<T> BitAllUsed for RectangleOf<T>

where T: BitAllUsed,

impl<T> BitZero for RectangleOf<T>

where T: BitZero,

impl<T> Collection for RectangleOf<T>

impl<T> CollectionBijective for RectangleOf<T>

impl<T> Copy for RectangleOf<T>

where T: Copy,

impl<T> Eq for RectangleOf<T>

where T: Eq,