Enum snarkvm_circuit::Variable

source ·

pub enum Variable<F>where
    F: PrimeField,{
    Constant(Rc<F>),
    Public(u64, Rc<F>),
    Private(u64, Rc<F>),
}

Variants

`Constant(Rc<F>)`

`Public(u64, Rc<F>)`

`Private(u64, Rc<F>)`

Implementations

source

impl<F> Variable<F>where
F: PrimeField,

source

pub fn is_constant(&self) -> bool

Returns true if the variable is a constant.

source

pub fn is_public(&self) -> bool

Returns true if the variable is public.

source

pub fn is_private(&self) -> bool

Returns true if the variable is private.

source

pub fn mode(&self) -> Mode

Returns the mode of the variable.

source

pub fn index(&self) -> u64

Returns the relative index of the variable.

source

pub fn value(&self) -> F

Returns the value of the variable.

Trait Implementations

source

impl<F> Add<&LinearCombination<F>> for &Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: &LinearCombination<F>
) -> <&Variable<F> as Add<&LinearCombination<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<&LinearCombination<F>> for Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: &LinearCombination<F>
) -> <Variable<F> as Add<&LinearCombination<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<&Variable<F>> for &Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(self, other: &Variable<F>) -> <&Variable<F> as Add<&Variable<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<&Variable<F>> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: &Variable<F>
) -> <LinearCombination<F> as Add<&Variable<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<&Variable<F>> for Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(self, other: &Variable<F>) -> <Variable<F> as Add<&Variable<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<LinearCombination<F>> for &Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: LinearCombination<F>
) -> <&Variable<F> as Add<LinearCombination<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<LinearCombination<F>> for Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: LinearCombination<F>
) -> <Variable<F> as Add<LinearCombination<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<Variable<F>> for &LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: Variable<F>
) -> <&LinearCombination<F> as Add<Variable<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<Variable<F>> for &Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(self, other: Variable<F>) -> <&Variable<F> as Add<Variable<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<Variable<F>> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(
self,
other: Variable<F>
) -> <LinearCombination<F> as Add<Variable<F>>>::Output

Performs the + operation. Read more

source

impl<F> Add<Variable<F>> for Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the + operator.

source

fn add(self, other: Variable<F>) -> <Variable<F> as Add<Variable<F>>>::Output

Performs the + operation. Read more

source

impl<F> Clone for Variable<F>where
F: Clone + PrimeField,

source

fn clone(&self) -> Variable<F>

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

impl<F> Debug for Variable<F>where
F: PrimeField,

source

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

Formats the value using the given formatter. Read more

source

impl<F> Display for Variable<F>where
F: PrimeField,

source

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

Formats the value using the given formatter. Read more

source

impl<F> From<&Variable<F>> for LinearCombination<F>where
F: PrimeField,

source

fn from(variable: &Variable<F>) -> LinearCombination<F>

Converts to this type from the input type.

source

impl<F> From<Variable<F>> for LinearCombination<F>where
F: PrimeField,

source

fn from(variable: Variable<F>) -> LinearCombination<F>

Converts to this type from the input type.

source

impl<F> Hash for Variable<F>where
F: Hash + PrimeField,

source

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

Feeds this value into the given Hasher. Read more

1.3.0 · source

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

Feeds a slice of this type into the given Hasher. Read more

source

impl<F> Ord for Variable<F>where
F: PrimeField,

source

fn cmp(&self, other: &Variable<F>) -> Ordering

This method returns an Ordering between self and other. Read more

1.21.0 · source

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

Compares and returns the maximum of two values. Read more

1.21.0 · source

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

Compares and returns the minimum of two values. Read more

1.50.0 · source

fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval. Read more

source

impl<F> PartialEq<Variable<F>> for Variable<F>where
F: PartialEq<F> + PrimeField,

source

fn eq(&self, other: &Variable<F>) -> bool

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

1.0.0 · source

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

source

impl<F> PartialOrd<Variable<F>> for Variable<F>where
F: PrimeField,

source

fn partial_cmp(&self, other: &Variable<F>) -> Option<Ordering>

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

1.0.0 · source

fn lt(&self, other: &Rhs) -> bool

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

1.0.0 · source

fn le(&self, other: &Rhs) -> bool

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

1.0.0 · source

fn gt(&self, other: &Rhs) -> bool

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

1.0.0 · source

fn ge(&self, other: &Rhs) -> bool

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

source

impl<F> Sub<&LinearCombination<F>> for &Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: &LinearCombination<F>
) -> <&Variable<F> as Sub<&LinearCombination<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<&LinearCombination<F>> for Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: &LinearCombination<F>
) -> <Variable<F> as Sub<&LinearCombination<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<&Variable<F>> for &Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(self, other: &Variable<F>) -> <&Variable<F> as Sub<&Variable<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<&Variable<F>> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: &Variable<F>
) -> <LinearCombination<F> as Sub<&Variable<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<&Variable<F>> for Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(self, other: &Variable<F>) -> <Variable<F> as Sub<&Variable<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<LinearCombination<F>> for &Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: LinearCombination<F>
) -> <&Variable<F> as Sub<LinearCombination<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<LinearCombination<F>> for Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: LinearCombination<F>
) -> <Variable<F> as Sub<LinearCombination<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<Variable<F>> for &LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: Variable<F>
) -> <&LinearCombination<F> as Sub<Variable<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<Variable<F>> for &Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(self, other: Variable<F>) -> <&Variable<F> as Sub<Variable<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<Variable<F>> for LinearCombination<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(
self,
other: Variable<F>
) -> <LinearCombination<F> as Sub<Variable<F>>>::Output

Performs the - operation. Read more

source

impl<F> Sub<Variable<F>> for Variable<F>where
F: PrimeField,

type Output = LinearCombination<F>

The resulting type after applying the - operator.

source

fn sub(self, other: Variable<F>) -> <Variable<F> as Sub<Variable<F>>>::Output

Performs the - operation. Read more

source

impl<F> Eq for Variable<F>where
F: Eq + PrimeField,

source

impl<F> StructuralEq for Variable<F>where
F: PrimeField,

source

impl<F> StructuralPartialEq for Variable<F>where
F: PrimeField,

Auto Trait Implementations

impl<F> RefUnwindSafe for Variable<F>where
F: RefUnwindSafe,

impl<F> !Send for Variable<F>

impl<F> !Sync for Variable<F>

impl<F> Unpin for Variable<F>

impl<F> UnwindSafe for Variable<F>where
F: RefUnwindSafe,

Blanket Implementations

source

impl<T> Any for Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source

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

Mutably borrows from an owned value. Read more

impl<T> CallHasher for Twhere
T: Hash + ?Sized,

default fn get_hash<H, B>(value: &H, build_hasher: &B) -> u64where
H: Hash + ?Sized,
B: BuildHasher,

source

impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

source

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for Twhere
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.

type Init = T

The type for initializers.

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more

source

impl<T> Same<T> for T

type Output = T

Should always be Self

source

impl<T> ToOwned for Twhere
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T> ToString for Twhere
T: Display + ?Sized,

source

default fn to_string(&self) -> String

Converts the given value to a String. Read more

source

impl<T, U> TryFrom for Twhere
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for Twhere
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Enum snarkvm_circuit::Variable

Variants

Constant(Rc<F>)

Public(u64, Rc<F>)

Private(u64, Rc<F>)

Implementations

impl<F> Variable<F>where F: PrimeField,

pub fn is_constant(&self) -> bool

pub fn is_public(&self) -> bool

pub fn is_private(&self) -> bool

pub fn mode(&self) -> Mode

pub fn index(&self) -> u64

pub fn value(&self) -> F

Trait Implementations

impl<F> Add<&LinearCombination<F>> for &Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: &LinearCombination<F>) -> <&Variable<F> as Add<&LinearCombination<F>>>::Output

impl<F> Add<&LinearCombination<F>> for Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: &LinearCombination<F>) -> <Variable<F> as Add<&LinearCombination<F>>>::Output

impl<F> Add<&Variable<F>> for &Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add(self, other: &Variable<F>) -> <&Variable<F> as Add<&Variable<F>>>::Output

impl<F> Add<&Variable<F>> for LinearCombination<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: &Variable<F>) -> <LinearCombination<F> as Add<&Variable<F>>>::Output

impl<F> Add<&Variable<F>> for Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add(self, other: &Variable<F>) -> <Variable<F> as Add<&Variable<F>>>::Output

impl<F> Add<LinearCombination<F>> for &Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: LinearCombination<F>) -> <&Variable<F> as Add<LinearCombination<F>>>::Output

impl<F> Add<LinearCombination<F>> for Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: LinearCombination<F>) -> <Variable<F> as Add<LinearCombination<F>>>::Output

impl<F> Add<Variable<F>> for &LinearCombination<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: Variable<F>) -> <&LinearCombination<F> as Add<Variable<F>>>::Output

impl<F> Add<Variable<F>> for &Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add(self, other: Variable<F>) -> <&Variable<F> as Add<Variable<F>>>::Output

impl<F> Add<Variable<F>> for LinearCombination<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add( self, other: Variable<F>) -> <LinearCombination<F> as Add<Variable<F>>>::Output

impl<F> Add<Variable<F>> for Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

fn add(self, other: Variable<F>) -> <Variable<F> as Add<Variable<F>>>::Output

impl<F> Clone for Variable<F>where F: Clone + PrimeField,

fn clone(&self) -> Variable<F>

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

impl<F> Debug for Variable<F>where F: PrimeField,

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

impl<F> Display for Variable<F>where F: PrimeField,

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

impl<F> From<&Variable<F>> for LinearCombination<F>where F: PrimeField,

fn from(variable: &Variable<F>) -> LinearCombination<F>

impl<F> From<Variable<F>> for LinearCombination<F>where F: PrimeField,

fn from(variable: Variable<F>) -> LinearCombination<F>

impl<F> Hash for Variable<F>where F: Hash + PrimeField,

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

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

impl<F> Ord for Variable<F>where F: PrimeField,

fn cmp(&self, other: &Variable<F>) -> Ordering

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

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

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

impl<F> PartialEq<Variable<F>> for Variable<F>where F: PartialEq<F> + PrimeField,

fn eq(&self, other: &Variable<F>) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<F> PartialOrd<Variable<F>> for Variable<F>where F: PrimeField,

fn partial_cmp(&self, other: &Variable<F>) -> Option<Ordering>

fn lt(&self, other: &Rhs) -> bool

fn le(&self, other: &Rhs) -> bool

fn gt(&self, other: &Rhs) -> bool

fn ge(&self, other: &Rhs) -> bool

impl<F> Sub<&LinearCombination<F>> for &Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

fn sub( self, other: &LinearCombination<F>) -> <&Variable<F> as Sub<&LinearCombination<F>>>::Output

impl<F> Sub<&LinearCombination<F>> for Variable<F>where F: PrimeField,

type Output = LinearCombination<F>

`Constant(Rc<F>)`

`Public(u64, Rc<F>)`

`Private(u64, Rc<F>)`

impl<F> Variable<F>where
F: PrimeField,

impl<F> Add<&LinearCombination<F>> for &Variable<F>where
F: PrimeField,

fn add(
self,
other: &LinearCombination<F>
) -> <&Variable<F> as Add<&LinearCombination<F>>>::Output

impl<F> Add<&LinearCombination<F>> for Variable<F>where
F: PrimeField,

fn add(
self,
other: &LinearCombination<F>
) -> <Variable<F> as Add<&LinearCombination<F>>>::Output

impl<F> Add<&Variable<F>> for &Variable<F>where
F: PrimeField,

impl<F> Add<&Variable<F>> for LinearCombination<F>where
F: PrimeField,

fn add(
self,
other: &Variable<F>
) -> <LinearCombination<F> as Add<&Variable<F>>>::Output

impl<F> Add<&Variable<F>> for Variable<F>where
F: PrimeField,

impl<F> Add<LinearCombination<F>> for &Variable<F>where
F: PrimeField,

fn add(
self,
other: LinearCombination<F>
) -> <&Variable<F> as Add<LinearCombination<F>>>::Output

impl<F> Add<LinearCombination<F>> for Variable<F>where
F: PrimeField,

fn add(
self,
other: LinearCombination<F>
) -> <Variable<F> as Add<LinearCombination<F>>>::Output

impl<F> Add<Variable<F>> for &LinearCombination<F>where
F: PrimeField,

fn add(
self,
other: Variable<F>
) -> <&LinearCombination<F> as Add<Variable<F>>>::Output

impl<F> Add<Variable<F>> for &Variable<F>where
F: PrimeField,

impl<F> Add<Variable<F>> for LinearCombination<F>where
F: PrimeField,

fn add(
self,
other: Variable<F>
) -> <LinearCombination<F> as Add<Variable<F>>>::Output

impl<F> Add<Variable<F>> for Variable<F>where
F: PrimeField,

impl<F> Clone for Variable<F>where
F: Clone + PrimeField,

impl<F> Debug for Variable<F>where
F: PrimeField,

impl<F> Display for Variable<F>where
F: PrimeField,

impl<F> From<&Variable<F>> for LinearCombination<F>where
F: PrimeField,

impl<F> From<Variable<F>> for LinearCombination<F>where
F: PrimeField,

impl<F> Hash for Variable<F>where
F: Hash + PrimeField,

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

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

impl<F> Ord for Variable<F>where
F: PrimeField,

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

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

fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: Sized + PartialOrd<Self>,

impl<F> PartialEq<Variable<F>> for Variable<F>where
F: PartialEq<F> + PrimeField,

impl<F> PartialOrd<Variable<F>> for Variable<F>where
F: PrimeField,

impl<F> Sub<&LinearCombination<F>> for &Variable<F>where
F: PrimeField,

fn sub(
self,
other: &LinearCombination<F>
) -> <&Variable<F> as Sub<&LinearCombination<F>>>::Output

impl<F> Sub<&LinearCombination<F>> for Variable<F>where
F: PrimeField,

fn sub(
self,
other: &LinearCombination<F>
) -> <Variable<F> as Sub<&LinearCombination<F>>>::Output

impl<F> Sub<&Variable<F>> for &Variable<F>where
F: PrimeField,

impl<F> Sub<&Variable<F>> for LinearCombination<F>where
F: PrimeField,

fn sub(
self,
other: &Variable<F>
) -> <LinearCombination<F> as Sub<&Variable<F>>>::Output

impl<F> Sub<&Variable<F>> for Variable<F>where
F: PrimeField,

impl<F> Sub<LinearCombination<F>> for &Variable<F>where
F: PrimeField,

fn sub(
self,
other: LinearCombination<F>
) -> <&Variable<F> as Sub<LinearCombination<F>>>::Output

impl<F> Sub<LinearCombination<F>> for Variable<F>where
F: PrimeField,

fn sub(
self,
other: LinearCombination<F>
) -> <Variable<F> as Sub<LinearCombination<F>>>::Output

impl<F> Sub<Variable<F>> for &LinearCombination<F>where
F: PrimeField,

fn sub(
self,
other: Variable<F>
) -> <&LinearCombination<F> as Sub<Variable<F>>>::Output

impl<F> Sub<Variable<F>> for &Variable<F>where
F: PrimeField,

impl<F> Sub<Variable<F>> for LinearCombination<F>where
F: PrimeField,

fn sub(
self,
other: Variable<F>
) -> <LinearCombination<F> as Sub<Variable<F>>>::Output

impl<F> Sub<Variable<F>> for Variable<F>where
F: PrimeField,

impl<F> Eq for Variable<F>where
F: Eq + PrimeField,

impl<F> StructuralEq for Variable<F>where
F: PrimeField,

impl<F> StructuralPartialEq for Variable<F>where
F: PrimeField,

impl<F> RefUnwindSafe for Variable<F>where
F: RefUnwindSafe,

impl<F> UnwindSafe for Variable<F>where
F: RefUnwindSafe,

impl<T> Any for Twhere
T: 'static + ?Sized,

impl<T> Borrow<T> for Twhere
T: ?Sized,

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

impl<T> CallHasher for Twhere
T: Hash + ?Sized,

default fn get_hash<H, B>(value: &H, build_hasher: &B) -> u64where
H: Hash + ?Sized,
B: BuildHasher,

impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

impl<T, U> Into<U> for Twhere
U: From<T>,

impl<T> ToOwned for Twhere
T: Clone,