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 new(lower: IntervalLimit<T>, upper: IntervalLimit<T>) -> Interval<T>
[src]
pub fn new(lower: IntervalLimit<T>, upper: IntervalLimit<T>) -> Interval<T>
[src]Generate an interval.
- params
- lower: lower interval limit
- upper: upper interval limit
- return: an interval
pub fn over(
lower: LimitValue<T>,
lower_included: bool,
upper: LimitValue<T>,
upper_included: bool
) -> Self
[src]
pub fn over(
lower: LimitValue<T>,
lower_included: bool,
upper: LimitValue<T>,
upper_included: bool
) -> Self
[src]Generate an interval.
Mainly used to generate half-open interval (intervals where only one of the upper and lower limits is open).
- params
- lower: lower limit, Limitless means there is no limit.
- lower_included: specify
true
if the lower limit is included in the interval (closed lower limit). - upper: upper limit, Limitless means there is no limit.
- upper_included: specify
true
if the upper limit is included in the interval (closed upper limit)
- return: an interval
- panic
- if the lower limit is greater than the upper limit
pub fn and_more(lower: LimitValue<T>) -> Self
[src]
pub fn and_more(lower: LimitValue<T>) -> Self
[src]Generate an interval with only the lower limit.
The lower limit is the interval that is included (closed) in the interval.
- params
- lower: lower limit, Limitless means that there is no limit.
- return: an interval
pub fn closed(lower: LimitValue<T>, upper: LimitValue<T>) -> Self
[src]
pub fn closed(lower: LimitValue<T>, upper: LimitValue<T>) -> Self
[src]Generate a closed interval.
- params
- lower: lower limit, Limitless means there is no limit.
- upper: upper limit, Limitless means there is no limit.
- return: a closed interval
- panic
- if the lower limit is greater than the upper limit
pub fn more_than(lower: LimitValue<T>) -> Self
[src]
pub fn more_than(lower: LimitValue<T>) -> Self
[src]Generate an interval with only the lower limit.
The lower limit is the interval that is not included in the (open) interval.
- params
- lower: lower limit, Limitless means there is no limit.
- return: an interval
pub fn open(lower: LimitValue<T>, upper: LimitValue<T>) -> Self
[src]
pub fn open(lower: LimitValue<T>, upper: LimitValue<T>) -> Self
[src]Generate an open interval.
- params
- lower: lower limit, Limitless means there is no limit.
- upper: upper limit, Limitless means there is no limit.
- return: an open interval
pub fn single_element(element: LimitValue<T>) -> Self
[src]
pub fn single_element(element: LimitValue<T>) -> Self
[src]Generate a single-element interval.
- params
- element: an limit value
- return: an interval
pub fn under(upper: LimitValue<T>) -> Self
[src]
pub fn under(upper: LimitValue<T>) -> Self
[src]Generate an interval with only an upper limit.
The upper limit is the interval that is not included in the (open) interval.
- params
- upper: upper limit, Limitless means there is no limit.
- return: an interval
pub fn up_to(upper: LimitValue<T>) -> Self
[src]
pub fn up_to(upper: LimitValue<T>) -> Self
[src]Generate an interval with only an upper limit.
The upper limit is the (closed) interval included in the interval.
- params
- upper: upper limit, Limitless means there is no limit.
- return: an interval
pub fn as_upper_limit(&self) -> &LimitValue<T>
[src]
pub fn as_lower_limit(&self) -> &LimitValue<T>
[src]
pub fn covers(&self, other: &Interval<T>) -> bool
[src]
pub fn covers(&self, other: &Interval<T>) -> bool
[src]Verify that this interval completely encloses the specified interval other
.
- params
- other: an
Interval
- other: an
- return:
true
for full comprehension,false
otherwise
pub fn gap(&self, other: &Interval<T>) -> Interval<T>
[src]
pub fn gap(&self, other: &Interval<T>) -> Interval<T>
[src]Get the interval that lies between this interval and the given interval other
.
For example, the gap between [3, 5) and [10, 20) is [5, 19). If the two intervals have a common part, return an empty interval.
- params
- other: an interval to be compared
- return: gap interval
pub fn is_single_element(&self) -> bool
[src]
pub fn is_single_element(&self) -> bool
[src]Verify whether this interval is a single-element interval or not.
A single-element interval has both upper and lower limits, and also indicates that these limits are equal and not an open interval.
For example, 3 <= x < 3
, 3 <= x <= 3
, and 3 <= x <= 3
.
- return:
true
if it’s a single element interval,false
otherwise
pub fn empty_of_same_type(&self) -> Interval<T>
[src]
pub fn empty_of_same_type(&self) -> Interval<T>
[src]Generate a new open interval with the same limits as this interval.
- return: a new interval
pub fn new_of_same_type(
&self,
lower: LimitValue<T>,
lower_closed: bool,
upper: LimitValue<T>,
upper_closed: bool
) -> 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]Generate a new interval with the same type as this interval.
- params
- lower: lower limit, if there is no limit value, then Limitless.
- lower_closed: Specify
true
if the lower limit is included in the interval (closed lower limit). - upper: upper limit, if there is no limit value, then Limitless.
- upper_closed: specify
true
if the upper limit is included in the interval (closed upper limit)
- return: an new interval
pub fn includes(&self, value: &LimitValue<T>) -> bool
[src]
pub fn includes(&self, value: &LimitValue<T>) -> bool
[src]Verify whether or not the specified value value
is included in this interval.
- params
- value: an interval value
- return:
true
if included,false
otherwise
pub fn is_below(&self, value: &LimitValue<T>) -> bool
[src]
pub fn is_below(&self, value: &LimitValue<T>) -> bool
[src]Verify that the specified value value
does not exceed the upper limit of this interval.
- params
- value: an interval value
- return:
true
if not exceeded,false
otherwise
pub fn is_above(&self, value: &LimitValue<T>) -> bool
[src]
pub fn is_above(&self, value: &LimitValue<T>) -> bool
[src]Verify that the specified value value
does not exceed the lower limit of this interval.
- params
- value: an interval value
- return:
true
if not exceeded,false
otherwise
pub fn is_open(&self) -> bool
[src]
pub fn is_open(&self) -> bool
[src]Verify whether this interval is an open interval or not.
- return:
true
if it’s an open interval,false
otherwise (including half-open interval)
pub fn is_closed(&self) -> bool
[src]
pub fn is_closed(&self) -> bool
[src]Verify whether this interval is a closed interval or not.
- return:
true
if it’s a closed interval,false
otherwise (including half-open interval)
pub fn is_empty(&self) -> bool
[src]
pub fn is_empty(&self) -> bool
[src]Verify whether this interval is empty or not.
The interval is empty means that the upper and lower limits are the same value and the interval is open.
For example, a state like 3 < x < 3
.
- return:
true
if it’s empty,false
otherwise.
pub fn intersect(&self, other: &Interval<T>) -> Interval<T>
[src]
pub fn intersect(&self, other: &Interval<T>) -> Interval<T>
[src]Return the product set (common part) of this interval and the given interval other
.
If the common part does not exist, it returns an empty interval.
- params
- other: an interval to be compared
pub fn intersects(&self, other: &Interval<T>) -> bool
[src]
pub fn intersects(&self, other: &Interval<T>) -> bool
[src]Verify if there is a common part between this interval and the given interval other
.
- params
- other: a target interval
- return:
true
if the common part exists,false
otherwise
pub fn has_upper_limit(&self) -> bool
[src]
pub fn has_upper_limit(&self) -> bool
[src]Get whether there is an upper limit or not.
Warning: This method is generally used for the purpose of displaying this value and for interaction with classes that are highly coupled to this class. Careless use of this method will unnecessarily increase the coupling between this class and the client-side class.
If you want to use this value for calculations,
-
find another appropriate method or add a new method to this class.
-
find another suitable method or consider adding a new method to this class.
-
return:
true
if upper limit is present,false
otherwise
pub fn has_lower_limit(&self) -> bool
[src]
pub fn has_lower_limit(&self) -> bool
[src]Get whether there is an lower limit or not.
Warning: This method is generally used for the purpose of displaying this value and for interaction with classes that are highly coupled to this class. Careless use of this method will unnecessarily increase the coupling between this class and the client-side class.
If you want to use this value for calculations,
-
find another appropriate method or add a new method to this class.
-
find another suitable method or consider adding a new method to this class.
-
return:
true
if lower limit is present,false
otherwise
pub fn includes_upper_limit(&self) -> bool
[src]
pub fn includes_upper_limit(&self) -> bool
[src]Get whether the upper limit is closed or not.
Warning: This method is generally used for the purpose of displaying this value and for interaction with classes that are highly coupled to this class. Careless use of this method will unnecessarily increase the coupling between this class and the client-side class.
If you want to use this value for calculations,
-
find another appropriate method or add a new method to this class.
-
find another suitable method or consider adding a new method to this class.
-
return: true
if the upper limit is closed,
false` otherwise
pub fn includes_lower_limit(&self) -> bool
[src]
pub fn includes_lower_limit(&self) -> bool
[src]Get whether the lower limit is closed or not.
Warning: This method is generally used for the purpose of displaying this value and for interaction with classes that are highly coupled to this class. Careless use of this method will unnecessarily increase the coupling between this class and the client-side class.
If you want to use this value for calculations,
-
find another appropriate method or add a new method to this class.
-
find another suitable method or consider adding a new method to this class.
-
return: true
if the lower limit is closed,
false` otherwise
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]fn eq(&self, other: &Self) -> bool
[src]
fn eq(&self, other: &Self) -> bool
[src]Verify the identity of this interval and the given interval other
.
It returns true
if both intervals are empty, and false
if only one of them is empty.
If both are single-element intervals, the limits that are single elements are compared with each other, and true
is returned if they match.
If only one of them is a single-element interval, false
is returned.
- param
- other: an interval to be compared
- return:
true
if they are identical,false
if they are not
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 = T
The 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