pub struct PathQuantifier {
pub min: u32,
pub max: Option<u32>,
}Expand description
The {min, max} bounds of a CIP-28 quantifier (*, +, {m,n}, {m,},
{,n}, {,}, {n}). max = None means unbounded. Bounds are already
normalized and validated by the parser: Rule 1 ({,} -> {0,}) and
Rule 2 (upper bound > 0, lower bound <= upper bound) are enforced at
parse time, so every PathQuantifier that reaches the AST is legal.
Fields§
§min: u32§max: Option<u32>Trait Implementations§
Source§impl Clone for PathQuantifier
impl Clone for PathQuantifier
impl Copy for PathQuantifier
Source§impl Debug for PathQuantifier
impl Debug for PathQuantifier
impl Eq for PathQuantifier
Source§impl PartialEq for PathQuantifier
impl PartialEq for PathQuantifier
impl StructuralPartialEq for PathQuantifier
Auto Trait Implementations§
impl Forget for PathQuantifier
impl Freeze for PathQuantifier
impl Move for PathQuantifier
impl RefUnwindSafe for PathQuantifier
impl Send for PathQuantifier
impl Sync for PathQuantifier
impl Unpin for PathQuantifier
impl UnsafeUnpin for PathQuantifier
impl UnwindSafe for PathQuantifier
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.