Struct intervals_rs::Interval [−][src]
pub struct Interval<T: Debug + Display + Clone + Hash + Eq + Ord + PartialEq + PartialOrd> { /* fields omitted */ }
Implementations
impl<T: Debug + Display + Clone + Hash + Eq + Ord + PartialEq + PartialOrd> Interval<T>[src]
impl<T: Debug + Display + Clone + Hash + Eq + Ord + PartialEq + PartialOrd> Interval<T>[src]pub fn and_more(lower: LimitValue<T>) -> Self[src]
pub fn closed(lower: LimitValue<T>, upper: LimitValue<T>) -> Self[src]
pub fn more_than(lower: LimitValue<T>) -> Self[src]
pub fn open(lower: LimitValue<T>, upper: LimitValue<T>) -> Self[src]
pub fn over(
lower: LimitValue<T>,
lower_included: bool,
upper: LimitValue<T>,
upper_included: bool
) -> Self[src]
lower: LimitValue<T>,
lower_included: bool,
upper: LimitValue<T>,
upper_included: bool
) -> Self
pub fn single_element(element: LimitValue<T>) -> Self[src]
pub fn under(upper: LimitValue<T>) -> Self[src]
pub fn up_to(upper: LimitValue<T>) -> Self[src]
pub fn complement_relative_to(&self, other: &Interval<T>) -> Vec<Interval<T>>[src]
pub fn covers(&self, other: &Interval<T>) -> bool[src]
pub fn gap(&self, other: &Interval<T>) -> Interval<T>[src]
pub fn is_single_element(&self) -> bool[src]
pub fn empty_of_same_type(&self) -> Interval<T>[src]
pub fn new_of_same_type(
&self,
lower: LimitValue<T>,
lower_closed: bool,
upper: LimitValue<T>,
upper_closed: bool
) -> Interval<T>[src]
&self,
lower: LimitValue<T>,
lower_closed: bool,
upper: LimitValue<T>,
upper_closed: bool
) -> Interval<T>
pub fn includes(&self, value: &LimitValue<T>) -> bool[src]
pub fn is_below(&self, value: &LimitValue<T>) -> bool[src]
pub fn is_above(&self, value: &LimitValue<T>) -> bool[src]
pub fn is_open(&self) -> bool[src]
pub fn is_closed(&self) -> bool[src]
pub fn is_empty(&self) -> bool[src]
pub fn new(lower: IntervalLimit<T>, upper: IntervalLimit<T>) -> Interval<T>[src]
pub fn new_with(
lower: LimitValue<T>,
is_lower_closed: bool,
upper: LimitValue<T>,
is_upper_closed: bool
) -> Interval<T>[src]
lower: LimitValue<T>,
is_lower_closed: bool,
upper: LimitValue<T>,
is_upper_closed: bool
) -> Interval<T>
pub fn intersect(&self, other: &Interval<T>) -> Interval<T>[src]
pub fn intersects(&self, other: &Interval<T>) -> bool[src]
pub fn upper_limit(&self) -> &LimitValue<T>[src]
pub fn lower_limit(&self) -> &LimitValue<T>[src]
pub fn has_upper_limit(&self) -> bool[src]
pub fn has_lower_limit(&self) -> bool[src]
pub fn includes_upper_limit(&self) -> bool[src]
pub fn includes_lower_limit(&self) -> bool[src]
pub fn greater_of_lower_limits<'a>(
&'a self,
other: &'a Interval<T>
) -> &'a LimitValue<T>[src]
&'a self,
other: &'a Interval<T>
) -> &'a LimitValue<T>
pub fn lesser_of_upper_limits<'a>(
&'a self,
other: &'a Interval<T>
) -> &'a LimitValue<T>[src]
&'a self,
other: &'a Interval<T>
) -> &'a LimitValue<T>
pub fn greater_of_lower_included_in_intersection(
&self,
other: &Interval<T>
) -> bool[src]
&self,
other: &Interval<T>
) -> bool
pub fn greater_of_lower_included_in_union(&self, other: &Interval<T>) -> bool[src]
pub fn lesser_of_upper_included_in_intersection(
&self,
other: &Interval<T>
) -> bool[src]
&self,
other: &Interval<T>
) -> bool
pub fn lesser_of_upper_included_in_union(&self, other: &Interval<T>) -> bool[src]
pub fn left_complement_relative_to(
&self,
other: &Interval<T>
) -> Option<Interval<T>>[src]
pub fn left_complement_relative_to(
&self,
other: &Interval<T>
) -> Option<Interval<T>>[src]この区間の下側補区間と与えた区間 other の共通部分を返す。
other 比較対象の区間
return この区間の下側の補区間と、与えた区間の共通部分。存在しない場合は None
pub fn right_complement_relative_to(
&self,
other: &Interval<T>
) -> Option<Interval<T>>[src]
&self,
other: &Interval<T>
) -> Option<Interval<T>>
Trait Implementations
impl<T: Clone + Debug + Display + Hash + Eq + Ord + PartialEq + PartialOrd> Clone for Interval<T>[src]
impl<T: Clone + Debug + Display + Hash + Eq + Ord + PartialEq + PartialOrd> Clone for Interval<T>[src]impl<T: Debug + Display + Clone + Hash + Eq + Ord + PartialEq + PartialOrd> Debug for Interval<T>[src]
impl<T: Debug + Display + Clone + Hash + Eq + Ord + PartialEq + PartialOrd> Debug for Interval<T>[src]impl<T: Debug + Display + Clone + Hash + Eq + Ord + PartialEq + PartialOrd> Display for Interval<T>[src]
impl<T: Debug + Display + Clone + Hash + Eq + Ord + PartialEq + PartialOrd> Display for Interval<T>[src]impl<T: Hash + Debug + Display + Clone + Eq + Ord + PartialEq + PartialOrd> Hash for Interval<T>[src]
impl<T: Hash + Debug + Display + Clone + Eq + Ord + PartialEq + PartialOrd> Hash for Interval<T>[src]impl<T: Debug + Display + Clone + Hash + Eq + Ord + PartialEq + PartialOrd> PartialEq<Interval<T>> for Interval<T>[src]
impl<T: Debug + Display + Clone + Hash + Eq + Ord + PartialEq + PartialOrd> PartialEq<Interval<T>> for Interval<T>[src]impl<T: Eq + Debug + Display + Clone + Hash + Ord + PartialEq + PartialOrd> Eq for Interval<T>[src]
impl<T: Debug + Display + Clone + Hash + Eq + Ord + PartialEq + PartialOrd> StructuralEq for Interval<T>[src]
Auto Trait Implementations
impl<T> RefUnwindSafe for Interval<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for Interval<T> where
T: Send,
T: Send,
impl<T> Sync for Interval<T> where
T: Sync,
T: Sync,
impl<T> Unpin for Interval<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for Interval<T> where
T: UnwindSafe,
T: UnwindSafe,
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<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