Struct static_rc::rcref::StaticRcRef

pub struct StaticRcRef<'a, T: ?Sized, const NUM: usize, const DEN: usize> { /* fields omitted */ }

A compile-time reference-counted pointer.

The inherent methods of StaticRc are all associated functions to avoid conflicts with the the methods of the inner type T which are brought into scope by the Deref implementation.

The parameters NUM and DEN DENote the ratio (NUM / DEN) of ownership of the pointer:

• The ratio is always in the (0, 1] interval, that is: NUM > 0 and NUM <= DEN.
• When the ratio is equal to 1, that is when NUM == DEN, then the instance has full ownership of the pointee and extra capabilities are unlocked.

Implementations

impl<'a, T: ?Sized, const N: usize> StaticRcRef<'a, T, N, N>

pub fn new(value: &'a mut T) -> Self where
    (): Sized, 

Constructs a new StaticRcRef<'a, T, N, N>.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 1, 1>;

let mut value = 42;
let rc = Full::new(&mut value);
assert_eq!(42, *rc);

pub fn pin(value: &'a mut T) -> Pin<Self> where
    (): Sized, 

Constructs a new Pin<StaticRcRef<'a, T, N, N>>.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 1, 1>;

let mut value = 42;
let rc = Full::pin(&mut value);
assert_eq!(42, *rc);

pub fn into_inner(this: Self) -> &'a mut T

Returns the inner value.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 1, 1>;

let mut value = 42;
let rc = Full::new(&mut value);
let inner: &mut i32 = Full::into_inner(rc);
assert_eq!(42, *inner);

pub fn get_mut(this: &mut Self) -> &mut T

Returns a mutable reference into the given StaticRcRef.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 1, 1>;

let mut value = 42;
let mut rc = Full::new(&mut value);
assert_eq!(42, *Full::get_mut(&mut rc));

impl<'a, T: ?Sized, const NUM: usize, const DEN: usize> StaticRcRef<'a, T, NUM, DEN>

pub fn into_raw(this: Self) -> NonNull<T>

Consumes the StaticRcRef, returning the wrapped pointer.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 1, 1>;

let mut value = 42;
let rc = Full::new(&mut value);
let pointer = Full::into_raw(rc);
assert_eq!(&mut value as *mut _, pointer.as_ptr());

pub fn as_ptr(this: &Self) -> NonNull<T>

Provides a raw pointer to the data.

StaticRcRef is not consumed or affected in any way, the pointer is valid as long as the original value is.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 1, 1>;

let mut value = 42;
let pointer = &mut value as *mut _;

let rc = Full::new(&mut value);
let other_pointer = Full::as_ptr(&rc);

assert_eq!(pointer, other_pointer.as_ptr());

pub fn get_ref(this: &Self) -> &T

Provides a reference to the data.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 1, 1>;

let mut value = 42;
let rc = Full::new(&mut value);

let r = Full::get_ref(&rc);

assert_eq!(42, *r);

pub unsafe fn from_raw(pointer: NonNull<T>) -> Self where
    (): Sized, 

Constructs a StaticRcRef<'a, T, NUM, DEN> from a raw pointer.

The raw pointer must have been previously returned by a call to StaticRcRef<'a, U, N, D>::into_raw:

• If U is different from T, then specific restrictions on size and alignment apply. See mem::transmute for the restrictions applying to transmuting references.
• If N / D is different from NUM / DEN, then specific restrictions apply. The user is responsible for ensuring proper management of the ratio of shares, and ultimately that the value is not dropped twice.

pub fn ptr_eq<const N: usize, const D: usize>(
    this: &Self,
    other: &StaticRcRef<'a, T, N, D>
) -> bool

Returns true if the two StaticRcRef point to the same allocation.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 2, 2>;

let mut value = 42;
let rc = Full::new(&mut value);
let (one, two) = Full::split::<1, 1>(rc);

assert!(StaticRcRef::ptr_eq(&one, &two));

pub fn adjust<const N: usize, const D: usize>(
    this: Self
) -> StaticRcRef<'a, T, N, D> where
    (): Sized,
    ((), ()): Sized, 

Adjusts the NUMerator and DENumerator of the ratio of the instance, preserving the ratio.

Panics

If the compile-time-ratio feature is not used, and the ratio is not preserved; that is N / D <> NUM / DEN.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 2, 2>;

let mut value = 42;
let rc = Full::new(&mut value);
let rc = Full::adjust::<1, 1>(rc);

assert_eq!(42, *rc);

pub fn split<const A: usize, const B: usize>(
    this: Self
) -> (StaticRcRef<'a, T, A, DEN>, StaticRcRef<'a, T, B, DEN>) where
    (): Sized,
    (): Sized,
    ((), ()): Sized, 

Splits the current instance into two instances with the specified NUMerators.

Panics

If the compile-time-ratio feature is not used, and the ratio is not preserved; that is A + B <> NUM.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 2, 2>;

let mut value = 42;
let rc = Full::new(&mut value);
let (one, two) = Full::split::<1, 1>(rc);

assert_eq!(42, *one);
assert_eq!(42, *two);

pub fn split_array<const N: usize, const DIM: usize>(
    this: Self
) -> [StaticRcRef<'a, T, N, DEN>; DIM] where
    T: 'a,
    ((), ()): Sized,
    (): Sized, 

Splits the current instance into DIM instances with the specified Numerators.

Panics

If the compile-time-ratio feature is not used, and the ratio is not preserved; that is N * DIM <> NUM.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 2, 2>;

let mut value = 42;
let rc = Full::new(&mut value);
let array = Full::split_array::<1, 2>(rc);

assert_eq!(42, *array[0]);
assert_eq!(42, *array[1]);

pub fn join<const A: usize, const B: usize>(
    left: StaticRcRef<'a, T, A, DEN>,
    right: StaticRcRef<'a, T, B, DEN>
) -> Self

Joins two instances into a single instance.

Panics

If the two instances do no point to the same allocation, as determined by StaticRcRef::ptr_eq.

If the compile-time-ratio feature is not used and the ratio is not preserved; that is A + B <> NUM.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 2, 2>;

let mut value = 42;
let rc = Full::new(&mut value);
let (one, two) = Full::split::<1, 1>(rc);
let rc = Full::join(one, two);

assert_eq!(42, *rc);

pub unsafe fn join_unchecked<const A: usize, const B: usize>(
    left: StaticRcRef<'a, T, A, DEN>,
    _right: StaticRcRef<'a, T, B, DEN>
) -> Self

Joins two instances into a single instance without checking whether they point to the same allocation.

Unless compile-time-ratio is activated, the ratios are checked nevertheless.

Safety

The caller must guarantee that those instances point to the same allocation.

Panics

If the compile-time-ratio feature is not used and the ratio is not preserved; that is A + B <> NUM.

In debug, if the two instances do no point to the same allocation, as determined by StaticRcRef::ptr_eq.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 2, 2>;

let mut value = 42;
let rc = Full::new(&mut value);
let (one, two) = Full::split::<1, 1>(rc);
let rc = unsafe { Full::join_unchecked(one, two) };

assert_eq!(42, *rc);

pub fn join_array<const N: usize, const DIM: usize>(
    array: [StaticRcRef<'a, T, N, DEN>; DIM]
) -> Self

Joins DIM instances into a single instance.

Panics

If all instances do not point to the same allocation, as determined by StaticRcRef::ptr_eq.

If the compile-time-ratio feature is not used and the ratio is not preserved; that is N * DIM <> NUM.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 2, 2>;

let mut value = 42;
let rc = Full::new(&mut value);
let array = Full::split_array::<1, 2>(rc);
let rc = Full::join_array(array);

assert_eq!(42, *rc);

pub unsafe fn join_array_unchecked<const N: usize, const DIM: usize>(
    array: [StaticRcRef<'a, T, N, DEN>; DIM]
) -> Self

Joins DIM instances into a single instance.

Panics

If the compile-time-ratio feature is not used and the ratio is not preserved; that is N * DIM <> NUM.

In debug, if all instances do not point to the same allocation, as determined by StaticRcRef::ptr_eq.

Example

use static_rc::StaticRcRef;

type Full<'a> = StaticRcRef<'a, i32, 2, 2>;

let mut value = 42;
let rc = Full::new(&mut value);
let array = Full::split_array::<1, 2>(rc);
let rc = unsafe { Full::join_array_unchecked(array) };

assert_eq!(42, *rc);

impl<'a, const NUM: usize, const DEN: usize> StaticRcRef<'a, dyn Any, NUM, DEN>

pub fn downcast<T: Any>(self) -> Result<StaticRcRef<'a, T, NUM, DEN>, Self>

Attempts to downcast Self to a concrete type.

Trait Implementations

impl<'a, T: ?Sized, const N: usize> AsMut<T> for StaticRcRef<'a, T, N, N>

fn as_mut(&mut self) -> &mut T

Performs the conversion.

impl<'a, T: ?Sized, const NUM: usize, const DEN: usize> AsRef<T> for StaticRcRef<'a, T, NUM, DEN>

fn as_ref(&self) -> &T

Performs the conversion.

impl<'a, T: ?Sized, const NUM: usize, const DEN: usize> Borrow<T> for StaticRcRef<'a, T, NUM, DEN>

fn borrow(&self) -> &T

Immutably borrows from an owned value.

impl<'a, T: ?Sized, const N: usize> BorrowMut<T> for StaticRcRef<'a, T, N, N>

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value.

impl<'a, T: ?Sized + Debug, const NUM: usize, const DEN: usize> Debug for StaticRcRef<'a, T, NUM, DEN>

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

Formats the value using the given formatter.

impl<'a, T: ?Sized, const NUM: usize, const DEN: usize> Deref for StaticRcRef<'a, T, NUM, DEN>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &T

Dereferences the value.

impl<'a, T: ?Sized, const N: usize> DerefMut for StaticRcRef<'a, T, N, N>

fn deref_mut(&mut self) -> &mut T

Mutably dereferences the value.

impl<'a, T: ?Sized + Display, const NUM: usize, const DEN: usize> Display for StaticRcRef<'a, T, NUM, DEN>

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

Formats the value using the given formatter.

impl<'a, I: DoubleEndedIterator + ?Sized, const N: usize> DoubleEndedIterator for StaticRcRef<'a, I, N, N>

fn next_back(&mut self) -> Option<I::Item>

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

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

Returns the nth element from the end of the iterator.

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.

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

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

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.

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<'a, I: ExactSizeIterator + ?Sized, const N: usize> ExactSizeIterator for StaticRcRef<'a, I, N, N>

fn len(&self) -> usize

Returns the exact length of the iterator.

fn is_empty(&self) -> bool

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

Returns true if the iterator is empty.

impl<'a, const NUM: usize, const DEN: usize> From<StaticRcRef<'a, str, NUM, DEN>> for StaticRcRef<'a, [u8], NUM, DEN>

fn from(value: StaticRcRef<'a, str, NUM, DEN>) -> Self

Performs the conversion.

impl<'a, F: ?Sized + Future + Unpin, const N: usize> Future for StaticRcRef<'a, F, N, N>

type Output = F::Output

The type of value produced on completion.

fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output>

Attempt to resolve the future to a final value, registering the current task for wakeup if the value is not yet available.

impl<'a, T: ?Sized + Hash, const NUM: usize, const DEN: usize> Hash for StaticRcRef<'a, T, NUM, DEN>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<'a, I: Iterator + ?Sized, const N: usize> Iterator for StaticRcRef<'a, I, N, N>

type Item = I::Item

The type of the elements being iterated over.

fn next(&mut self) -> Option<I::Item>

Advances the iterator and returns the next value.

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

Returns the bounds on the remaining length of the iterator.

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

Returns the nth element of the iterator.

fn last(self) -> Option<I::Item>

Consumes the iterator, returning the last element.

fn count(self) -> usize

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

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.

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.

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.

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.

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

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

recently added

Creates a new iterator which places a copy of separator between adjacent items of the original iterator.

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> where
    G: FnMut() -> Self::Item, 

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

recently added

Creates a new iterator which places an item generated by separator between adjacent items of the original iterator.

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.

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

Calls a closure on each element of an iterator.

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.

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.

fn enumerate(self) -> Enumerate<Self>

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

fn peekable(self) -> Peekable<Self>

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information.

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.

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.

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.

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

Creates an iterator that skips the first n elements.

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

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner.

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.

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

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

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

Creates an iterator that flattens nested structure.

fn fuse(self) -> Fuse<Self>

Creates an iterator which ends after the first None.

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.

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"]

fn collect<B>(self) -> B where
    B: FromIterator<Self::Item>, 

Transforms an iterator into a collection.

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.

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

🔬 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.

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.

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

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

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

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

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

Folds every element into an accumulator by applying an operation, returning the final result.

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

Reduces the elements to a single one, by repeatedly applying a reducing operation.

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

Tests if every element of the iterator matches a predicate.

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

Tests if any element of the iterator matches a predicate.

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.

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.

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

🔬 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.

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.

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.

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

Returns the maximum element of an iterator.

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

Returns the minimum element of an iterator.

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.

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.

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.

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.

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

Reverses an iterator’s direction.

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.

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.

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.

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

Repeats an iterator endlessly.

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

Sums the elements of an iterator.

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

Iterates over the entire iterator, multiplying all the elements

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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<'a, T: ?Sized + Ord, const NUM: usize, const DEN: usize> Ord for StaticRcRef<'a, T, NUM, DEN>

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

#[must_use]

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<'a, T: ?Sized, const NUM: usize, const DEN: usize, const N: usize, const D: usize> PartialEq<StaticRcRef<'a, T, N, D>> for StaticRcRef<'a, T, NUM, DEN> where
    T: PartialEq<T>, 

fn eq(&self, other: &StaticRcRef<'a, T, N, D>) -> bool

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

fn ne(&self, other: &StaticRcRef<'a, T, N, D>) -> bool

This method tests for !=.

impl<'a, T: ?Sized, const NUM: usize, const DEN: usize, const N: usize, const D: usize> PartialOrd<StaticRcRef<'a, T, N, D>> for StaticRcRef<'a, T, NUM, DEN> where
    T: PartialOrd<T>, 

fn partial_cmp(&self, other: &StaticRcRef<'a, T, N, D>) -> Option<Ordering>

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

fn lt(&self, other: &StaticRcRef<'a, T, N, D>) -> bool

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

fn le(&self, other: &StaticRcRef<'a, T, N, D>) -> bool

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

fn gt(&self, other: &StaticRcRef<'a, T, N, D>) -> bool

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

fn ge(&self, other: &StaticRcRef<'a, T, N, D>) -> bool

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

impl<'a, T: ?Sized, const NUM: usize, const DEN: usize> Pointer for StaticRcRef<'a, T, NUM, DEN>

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

Formats the value using the given formatter.

impl<'a, T: ?Sized + Eq, const NUM: usize, const DEN: usize> Eq for StaticRcRef<'a, T, NUM, DEN>

impl<'a, I: FusedIterator + ?Sized, const N: usize> FusedIterator for StaticRcRef<'a, I, N, N>

impl<'a, T: ?Sized + Send, const NUM: usize, const DEN: usize> Send for StaticRcRef<'a, T, NUM, DEN>

impl<'a, T: ?Sized + Sync, const NUM: usize, const DEN: usize> Sync for StaticRcRef<'a, T, NUM, DEN>

impl<'a, T: ?Sized, const NUM: usize, const DEN: usize> Unpin for StaticRcRef<'a, T, NUM, DEN>