Make HasTop and HasBottom consts.
This commit is contained in:
parent
f7b831ac8a
commit
71138e9933
3 changed files with 24 additions and 34 deletions
|
@ -75,12 +75,12 @@ pub trait MeetSemiLattice: Eq {
|
|||
|
||||
/// A set that has a "bottom" element, which is less than or equal to any other element.
|
||||
pub trait HasBottom {
|
||||
fn bottom() -> Self;
|
||||
const BOTTOM: Self;
|
||||
}
|
||||
|
||||
/// A set that has a "top" element, which is greater than or equal to any other element.
|
||||
pub trait HasTop {
|
||||
fn top() -> Self;
|
||||
const TOP: Self;
|
||||
}
|
||||
|
||||
/// A `bool` is a "two-point" lattice with `true` as the top element and `false` as the bottom:
|
||||
|
@ -113,15 +113,11 @@ impl MeetSemiLattice for bool {
|
|||
}
|
||||
|
||||
impl HasBottom for bool {
|
||||
fn bottom() -> Self {
|
||||
false
|
||||
}
|
||||
const BOTTOM: Self = false;
|
||||
}
|
||||
|
||||
impl HasTop for bool {
|
||||
fn top() -> Self {
|
||||
true
|
||||
}
|
||||
const TOP: Self = true;
|
||||
}
|
||||
|
||||
/// A tuple (or list) of lattices is itself a lattice whose least upper bound is the concatenation
|
||||
|
@ -274,13 +270,9 @@ impl<T: Clone + Eq> MeetSemiLattice for FlatSet<T> {
|
|||
}
|
||||
|
||||
impl<T> HasBottom for FlatSet<T> {
|
||||
fn bottom() -> Self {
|
||||
Self::Bottom
|
||||
}
|
||||
const BOTTOM: Self = Self::Bottom;
|
||||
}
|
||||
|
||||
impl<T> HasTop for FlatSet<T> {
|
||||
fn top() -> Self {
|
||||
Self::Top
|
||||
}
|
||||
const TOP: Self = Self::Top;
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue