Struct glsp::Root

pub struct Root<T> where
    T: Allocate,  { /* fields omitted */ }

A pointer onto the garbage-collected heap.

Implementations

impl<T> Root<T> where
    T: Allocate, 

pub fn ptr_eq(root0: &Root<T>, root1: &Root<T>) -> bool

impl<T> Root<T> where
    T: Allocate, 

pub fn downgrade(&self) -> Gc<T>

Constructs a new weak pointer to this heap-allocated object.

Trait Implementations

impl<T> AsRef<T> for Root<T> where
    T: Allocate, 

pub fn as_ref(&self) -> &T

Performs the conversion.

impl<T> Borrow<T> for Root<T> where
    T: Allocate, 

pub fn borrow(&self) -> &T

Immutably borrows from an owned value.

impl CallableOps for Root<GFn>

pub fn receive_call(&self, arg_count: usize) -> Result<Val, GError>

pub fn arg_limits(&self) -> (usize, Option<usize>)

Returns this function's minimum and maximum argument count.

pub fn name(&self) -> Option<Sym>

Returns this function's registered name, if any.

pub fn min_args(&self) -> usize

Returns this function's minimum argument count.

pub fn max_args(&self) -> Option<usize>

Returns this function's maximum argument count, if any.

impl CallableOps for Root<Class>

pub fn receive_call(&self, arg_count: usize) -> Result<Val, GError>

pub fn arg_limits(&self) -> (usize, Option<usize>)

Returns this function's minimum and maximum argument count.

pub fn name(&self) -> Option<Sym>

Returns this function's registered name, if any.

pub fn min_args(&self) -> usize

Returns this function's minimum argument count.

pub fn max_args(&self) -> Option<usize>

Returns this function's maximum argument count, if any.

impl CallableOps for Root<RFn>

pub fn receive_call(&self, arg_count: usize) -> Result<Val, GError>

pub fn name(&self) -> Option<Sym>

Returns this function's registered name, if any.

pub fn arg_limits(&self) -> (usize, Option<usize>)

Returns this function's minimum and maximum argument count.

pub fn min_args(&self) -> usize

Returns this function's minimum argument count.

pub fn max_args(&self) -> Option<usize>

Returns this function's maximum argument count, if any.

impl<T> Clone for Root<T> where
    T: Allocate, 

pub fn clone(&self) -> Root<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for Root<T> where
    T: Allocate + Debug, 

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

Formats the value using the given formatter.

impl<T> Deref for Root<T> where
    T: Allocate, 

type Target = T

The resulting type after dereferencing.

pub fn deref(&self) -> &T

Dereferences the value.

impl<'de> Deserialize<'de> for Root<Arr>

pub fn deserialize<D>(
    d: D
) -> Result<Root<Arr>, <D as Deserializer<'de>>::Error> where
    D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<'de> Deserialize<'de> for Root<Tab>

pub fn deserialize<D>(
    d: D
) -> Result<Root<Tab>, <D as Deserializer<'de>>::Error> where
    D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<'de> Deserialize<'de> for Root<Str>

pub fn deserialize<D>(
    d: D
) -> Result<Root<Str>, <D as Deserializer<'de>>::Error> where
    D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<T> Display for Root<T> where
    T: Allocate + Display, 

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

Formats the value using the given formatter.

impl DoubleEndedIterator for Root<GIter>

pub fn next_back(&mut self) -> Option<Result<Val, GError>>

Removes and returns an element from the end of the iterator.

pub fn advance_back_by(&mut self, n: usize) -> Result<(), usize>

🔬 This is a nightly-only experimental API. (iter_advance_by)

recently added

Advances the iterator from the back by n elements.

pub fn nth_back(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element from the end of the iterator.

pub fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
    R: Try<Ok = B>,
    F: FnMut(B, Self::Item) -> R, 

This is the reverse version of Iterator::try_fold(): it takes elements starting from the back of the iterator.

pub fn rfold<B, F>(self, init: B, f: F) -> B where
    F: FnMut(B, Self::Item) -> B, 

An iterator method that reduces the iterator's elements to a single, final value, starting from the back.

pub fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item> where
    P: FnMut(&Self::Item) -> bool, 

Searches for an element of an iterator from the back that satisfies a predicate.

impl<T> Drop for Root<T> where
    T: Allocate, 

pub fn drop(&mut self)

Executes the destructor for this type.

impl<T> Eq for Root<T> where
    T: Allocate + Eq, 

impl FromVal for Root<RData>

pub fn from_val(val: &Val) -> Result<Root<RData>, GError>

impl FromVal for Root<Class>

pub fn from_val(val: &Val) -> Result<Root<Class>, GError>

impl FromVal for Root<Tab>

pub fn from_val(val: &Val) -> Result<Root<Tab>, GError>

impl FromVal for Root<Arr>

pub fn from_val(val: &Val) -> Result<Root<Arr>, GError>

impl FromVal for Root<GFn>

pub fn from_val(val: &Val) -> Result<Root<GFn>, GError>

impl FromVal for Root<GIter>

pub fn from_val(val: &Val) -> Result<Root<GIter>, GError>

impl FromVal for Root<Coro>

pub fn from_val(val: &Val) -> Result<Root<Coro>, GError>

impl FromVal for Root<RFn>

pub fn from_val(val: &Val) -> Result<Root<RFn>, GError>

impl FromVal for Root<Obj>

pub fn from_val(val: &Val) -> Result<Root<Obj>, GError>

impl FromVal for Root<Str>

pub fn from_val(val: &Val) -> Result<Root<Str>, GError>

impl<'a> IntoIterator for &'a Root<Str>

type Item = char

The type of the elements being iterated over.

type IntoIter = IterDeque<'a, Str>

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> IterDeque<'a, Str>

Creates an iterator from a value.

impl<'a> IntoIterator for &'a mut Root<Str>

type Item = char

The type of the elements being iterated over.

type IntoIter = IterDeque<'a, Str>

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> IterDeque<'a, Str>

Creates an iterator from a value.

impl<'a> IntoIterator for &'a mut Root<Arr>

type Item = Val

The type of the elements being iterated over.

type IntoIter = IterDeque<'a, Arr>

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> IterDeque<'a, Arr>

Creates an iterator from a value.

impl<'a> IntoIterator for &'a Root<Arr>

type Item = Val

The type of the elements being iterated over.

type IntoIter = IterDeque<'a, Arr>

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> IterDeque<'a, Arr>

Creates an iterator from a value.

impl<'a> IntoVal for &'a Root<Str>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a Root<Arr>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a Root<GFn>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a mut Root<Str>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a mut Root<RData>

pub fn into_val(self) -> Result<Val, GError>

impl IntoVal for Root<Obj>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a mut Root<GIter>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a Root<Class>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a Root<GIter>

pub fn into_val(self) -> Result<Val, GError>

impl IntoVal for Root<Arr>

pub fn into_val(self) -> Result<Val, GError>

impl IntoVal for Root<RData>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a mut Root<Obj>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a Root<Obj>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a mut Root<Tab>

pub fn into_val(self) -> Result<Val, GError>

impl IntoVal for Root<GIter>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a Root<Coro>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a Root<RData>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a mut Root<GFn>

pub fn into_val(self) -> Result<Val, GError>

impl IntoVal for Root<Coro>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a mut Root<Arr>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a mut Root<Coro>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a mut Root<Class>

pub fn into_val(self) -> Result<Val, GError>

impl IntoVal for Root<RFn>

pub fn into_val(self) -> Result<Val, GError>

impl IntoVal for Root<Str>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a Root<Tab>

pub fn into_val(self) -> Result<Val, GError>

impl IntoVal for Root<Tab>

pub fn into_val(self) -> Result<Val, GError>

impl IntoVal for Root<GFn>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a Root<RFn>

pub fn into_val(self) -> Result<Val, GError>

impl IntoVal for Root<Class>

pub fn into_val(self) -> Result<Val, GError>

impl<'a> IntoVal for &'a mut Root<RFn>

pub fn into_val(self) -> Result<Val, GError>

impl IterableOps for Root<Tab>

pub fn giter(&self) -> Root<GIter>

impl IterableOps for Root<GIter>

pub fn giter(&self) -> Root<GIter>

impl IterableOps for Root<Str>

pub fn giter(&self) -> Root<GIter>

impl IterableOps for Root<Arr>

pub fn giter(&self) -> Root<GIter>

impl IterableOps for Root<Coro>

pub fn giter(&self) -> Root<GIter>

impl Iterator for Root<GIter>

type Item = Result<Val, GError>

The type of the elements being iterated over.

pub fn next(&mut self) -> Option<Result<Val, GError>>

Advances the iterator and returns the next value.

pub fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

pub fn count(self) -> usize

Consumes the iterator, counting the number of iterations and returning it.

pub fn last(self) -> Option<Self::Item>

Consumes the iterator, returning the last element.

pub fn advance_by(&mut self, n: usize) -> Result<(), usize>

🔬 This is a nightly-only experimental API. (iter_advance_by)

recently added

Advances the iterator by n elements.

pub fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

pub fn step_by(self, step: usize) -> StepBy<Self>

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

pub fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
    U: IntoIterator<Item = Self::Item>, 

Takes two iterators and creates a new iterator over both in sequence.

pub fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
    U: IntoIterator, 

'Zips up' two iterators into a single iterator of pairs.

pub fn intersperse(self, separator: Self::Item) -> Intersperse<Self> where
    Self::Item: Clone, 

🔬 This is a nightly-only experimental API. (iter_intersperse)

recently added

Places a copy of separator between all elements.

pub fn map<B, F>(self, f: F) -> Map<Self, F> where
    F: FnMut(Self::Item) -> B, 

Takes a closure and creates an iterator which calls that closure on each element.

pub fn for_each<F>(self, f: F) where
    F: FnMut(Self::Item), 

Calls a closure on each element of an iterator.

pub fn filter<P>(self, predicate: P) -> Filter<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator which uses a closure to determine if an element should be yielded.

pub fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
    F: FnMut(Self::Item) -> Option<B>, 

Creates an iterator that both filters and maps.

pub fn enumerate(self) -> Enumerate<Self>

Creates an iterator which gives the current iteration count as well as the next value.

pub fn peekable(self) -> Peekable<Self>

Creates an iterator which can use peek to look at the next element of the iterator without consuming it.

pub fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator that skips elements based on a predicate.

pub fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator that yields elements based on a predicate.

pub fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> where
    P: FnMut(Self::Item) -> Option<B>, 

🔬 This is a nightly-only experimental API. (iter_map_while)

recently added

Creates an iterator that both yields elements based on a predicate and maps.

pub fn skip(self, n: usize) -> Skip<Self>

Creates an iterator that skips the first n elements.

pub fn take(self, n: usize) -> Take<Self>

Creates an iterator that yields its first n elements.

pub fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
    F: FnMut(&mut St, Self::Item) -> Option<B>, 

An iterator adaptor similar to fold that holds internal state and produces a new iterator.

pub fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
    F: FnMut(Self::Item) -> U,
    U: IntoIterator, 

Creates an iterator that works like map, but flattens nested structure.

pub fn flatten(self) -> Flatten<Self> where
    Self::Item: IntoIterator, 

Creates an iterator that flattens nested structure.

pub fn fuse(self) -> Fuse<Self>

Creates an iterator which ends after the first None.

pub fn inspect<F>(self, f: F) -> Inspect<Self, F> where
    F: FnMut(&Self::Item), 

Does something with each element of an iterator, passing the value on.

pub fn by_ref(&mut self) -> &mut Self

Borrows an iterator, rather than consuming it.

#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]pub fn collect<B>(self) -> B where
    B: FromIterator<Self::Item>, 

Transforms an iterator into a collection.

pub fn partition<B, F>(self, f: F) -> (B, B) where
    B: Default + Extend<Self::Item>,
    F: FnMut(&Self::Item) -> bool, 

Consumes an iterator, creating two collections from it.

pub fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
    Self: DoubleEndedIterator<Item = &'a mut T>,
    P: FnMut(&T) -> bool,
    T: 'a, 

🔬 This is a nightly-only experimental API. (iter_partition_in_place)

new API

Reorders the elements of this iterator in-place according to the given predicate, such that all those that return true precede all those that return false. Returns the number of true elements found.

pub fn is_partitioned<P>(self, predicate: P) -> bool where
    P: FnMut(Self::Item) -> bool, 

🔬 This is a nightly-only experimental API. (iter_is_partitioned)

new API

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false.

pub fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
    R: Try<Ok = B>,
    F: FnMut(B, Self::Item) -> R, 

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

pub fn try_for_each<F, R>(&mut self, f: F) -> R where
    R: Try<Ok = ()>,
    F: FnMut(Self::Item) -> R, 

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

pub fn fold<B, F>(self, init: B, f: F) -> B where
    F: FnMut(B, Self::Item) -> B, 

An iterator method that applies a function, producing a single, final value.

pub fn fold_first<F>(self, f: F) -> Option<Self::Item> where
    F: FnMut(Self::Item, Self::Item) -> Self::Item, 

🔬 This is a nightly-only experimental API. (iterator_fold_self)

The same as fold(), but uses the first element in the iterator as the initial value, folding every subsequent element into it. If the iterator is empty, return None; otherwise, return the result of the fold.

pub fn all<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool, 

Tests if every element of the iterator matches a predicate.

pub fn any<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool, 

Tests if any element of the iterator matches a predicate.

pub fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
    P: FnMut(&Self::Item) -> bool, 

Searches for an element of an iterator that satisfies a predicate.

pub fn find_map<B, F>(&mut self, f: F) -> Option<B> where
    F: FnMut(Self::Item) -> Option<B>, 

Applies function to the elements of iterator and returns the first non-none result.

pub fn try_find<F, R>(
    &mut self,
    f: F
) -> Result<Option<Self::Item>, <R as Try>::Error> where
    R: Try<Ok = bool>,
    F: FnMut(&Self::Item) -> R, 

🔬 This is a nightly-only experimental API. (try_find)

new API

Applies function to the elements of iterator and returns the first true result or the first error.

pub fn position<P>(&mut self, predicate: P) -> Option<usize> where
    P: FnMut(Self::Item) -> bool, 

Searches for an element in an iterator, returning its index.

pub fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
    Self: ExactSizeIterator + DoubleEndedIterator,
    P: FnMut(Self::Item) -> bool, 

Searches for an element in an iterator from the right, returning its index.

pub fn max(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the maximum element of an iterator.

pub fn min(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the minimum element of an iterator.

pub fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    B: Ord,
    F: FnMut(&Self::Item) -> B, 

Returns the element that gives the maximum value from the specified function.

pub fn max_by<F>(self, compare: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item, &Self::Item) -> Ordering, 

Returns the element that gives the maximum value with respect to the specified comparison function.

pub fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    B: Ord,
    F: FnMut(&Self::Item) -> B, 

Returns the element that gives the minimum value from the specified function.

pub fn min_by<F>(self, compare: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item, &Self::Item) -> Ordering, 

Returns the element that gives the minimum value with respect to the specified comparison function.

pub fn rev(self) -> Rev<Self> where
    Self: DoubleEndedIterator, 

Reverses an iterator's direction.

pub fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
    Self: Iterator<Item = (A, B)>,
    FromA: Default + Extend<A>,
    FromB: Default + Extend<B>, 

Converts an iterator of pairs into a pair of containers.

pub fn copied<'a, T>(self) -> Copied<Self> where
    Self: Iterator<Item = &'a T>,
    T: 'a + Copy, 

Creates an iterator which copies all of its elements.

pub fn cloned<'a, T>(self) -> Cloned<Self> where
    Self: Iterator<Item = &'a T>,
    T: 'a + Clone, 

Creates an iterator which clones all of its elements.

pub fn cycle(self) -> Cycle<Self> where
    Self: Clone, 

Repeats an iterator endlessly.

pub fn sum<S>(self) -> S where
    S: Sum<Self::Item>, 

Sums the elements of an iterator.

pub fn product<P>(self) -> P where
    P: Product<Self::Item>, 

Iterates over the entire iterator, multiplying all the elements

pub fn cmp<I>(self, other: I) -> Ordering where
    I: IntoIterator<Item = Self::Item>,
    Self::Item: Ord, 

Lexicographically compares the elements of this Iterator with those of another.

pub fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
    I: IntoIterator,
    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering, 

🔬 This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

pub fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Lexicographically compares the elements of this Iterator with those of another.

pub fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where
    I: IntoIterator,
    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>, 

🔬 This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

pub fn eq<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are equal to those of another.

pub fn eq_by<I, F>(self, other: I, eq: F) -> bool where
    I: IntoIterator,
    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool, 

🔬 This is a nightly-only experimental API. (iter_order_by)

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function.

pub fn ne<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are unequal to those of another.

pub fn lt<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically less than those of another.

pub fn le<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

pub fn gt<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically greater than those of another.

pub fn ge<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

pub fn is_sorted(self) -> bool where
    Self::Item: PartialOrd<Self::Item>, 

🔬 This is a nightly-only experimental API. (is_sorted)

new API

Checks if the elements of this iterator are sorted.

pub fn is_sorted_by<F>(self, compare: F) -> bool where
    F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>, 

🔬 This is a nightly-only experimental API. (is_sorted)

new API

Checks if the elements of this iterator are sorted using the given comparator function.

pub fn is_sorted_by_key<F, K>(self, f: F) -> bool where
    F: FnMut(Self::Item) -> K,
    K: PartialOrd<K>, 

🔬 This is a nightly-only experimental API. (is_sorted)

new API

Checks if the elements of this iterator are sorted using the given key extraction function.

impl<T> Ord for Root<T> where
    T: Allocate + Ord, 

pub fn cmp(&self, other: &Root<T>) -> Ordering

This method returns an Ordering between self and other.

#[must_use]pub fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]pub fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl PartialEq<Root<Obj>> for Obj

pub fn eq(&self, other: &Root<Obj>) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl PartialEq<Root<RData>> for RData

pub fn eq(&self, other: &Root<RData>) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<T> PartialEq<Root<T>> for Root<T> where
    T: Allocate + PartialEq<T>, 

pub fn eq(&self, other: &Root<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<T> PartialOrd<Root<T>> for Root<T> where
    T: Allocate + PartialOrd<T>, 

pub fn partial_cmp(&self, other: &Root<T>) -> Option<Ordering>

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

#[must_use]pub fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

#[must_use]pub fn le(&self, other: &Rhs) -> bool

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

#[must_use]pub fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

#[must_use]pub fn ge(&self, other: &Rhs) -> bool

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

impl<T> Pointer for Root<T> where
    T: Allocate, 

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

Formats the value using the given formatter.

impl<T> Serialize for Root<T> where
    T: Allocate + Serialize, 

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

Serialize this value into the given Serde serializer.

impl Write for Root<Str>

pub fn write_str(&mut self, s: &str) -> Result<(), Error>

Writes a string slice into this writer, returning whether the write succeeded.

pub fn write_char(&mut self, c: char) -> Result<(), Error>

Writes a char into this writer, returning whether the write succeeded.

pub fn write_fmt(&mut self, args: Arguments<'_>) -> Result<(), Error>

Glue for usage of the write! macro with implementors of this trait.