Struct storage_proofs_porep::stacked::StackedGraph

source · [−]

pub struct StackedGraph<H, G> where
    H: Hasher,
    G: Graph<H> + 'static,  { /* private fields */ }

Implementations

source

impl<H, G> StackedGraph<H, G> where
H: Hasher,
G: Graph<H> + ParameterSetMetadata + Sync + Send,

source

pub fn new(
 base_graph: Option<G>,
 nodes: usize,
 base_degree: usize,
 expansion_degree: usize,
 porep_id: PoRepID,
 api_version: ApiVersion
) -> Result<Self>

source

pub fn parent_cache(&self) -> Result<ParentCache>

Returns a reference to the parent cache.

source

pub fn copy_parents_data_exp(
 &self,
 node: u32,
 base_data: &[u8 ],
 exp_data: &[u8 ],
 hasher: Sha256,
 cache: Option<&mut ParentCache>
) -> Result<[u8 ; 32]>

source

pub fn copy_parents_data(
 &self,
 node: u32,
 base_data: &[u8 ],
 hasher: Sha256,
 cache: Option<&mut ParentCache>
) -> Result<[u8 ; 32]>

source

impl<'a, H, G> StackedGraph<H, G> where
H: Hasher,
G: Graph<H> + ParameterSetMetadata + Sync + Send,

source

pub fn generate_expanded_parents(
    &self,
    node: usize,
    expanded_parents: &mut [u32 ]
)

source

pub fn new_stacked(
 nodes: usize,
 base_degree: usize,
 expansion_degree: usize,
 porep_id: PoRepID,
 api_version: ApiVersion
) -> Result<Self>

source

pub fn expanded_parents(&self, node: usize, parents: &mut [u32 ]) -> Result<()>

Assign self.expansion_degree parents to node using an invertible permutation that is applied one way for the forward layers and one way for the reversed ones.

Trait Implementations

source

impl<H: Clone, G: Clone> Clone for StackedGraph<H, G> where
H: Hasher,
G: Graph<H> + 'static,

source

fn clone(&self) -> StackedGraph<H, G>

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<H, G> Debug for StackedGraph<H, G> where
H: Hasher,
G: Graph<H> + 'static,

source

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

Formats the value using the given formatter. Read more

source

impl<H, G> Graph<H> for StackedGraph<H, G> where
H: Hasher,
G: Graph<H> + ParameterSetMetadata + Sync + Send,

type Key = Vec<u8>

source

fn size(&self) -> usize

Returns the size of the graph (number of nodes).

source

fn degree(&self) -> usize

Returns the number of parents of each node in the graph.

source

fn parents(&self, node: usize, parents: &mut [u32 ]) -> Result<()>

Returns a sorted list of all parents of this node. The parents may be repeated. Read more

source

fn seed(&self) -> [u8 ; 28]

source

fn new(
 nodes: usize,
 base_degree: usize,
 expansion_degree: usize,
 porep_id: PoRepID,
 api_version: ApiVersion
) -> Result<Self>

source

fn create_key(
 &self,
 _id: &H::Domain,
 _node: usize,
 _parents: &[u32 ],
 _base_parents_data: &[u8 ],
 _exp_parents_data: Option<&[u8 ]>
) -> Result<Self::Key>

Creates the encoding key. The algorithm for that is Sha256(id | encodedParentNode1 | encodedParentNode1 | ...). Read more

source

fn expected_size(&self) -> usize

Returns the expected size of all nodes in the graph.

source

fn merkle_tree_depth(&self) -> u64 where
U: 'static + PoseidonArity,

Returns the merkle tree depth.

source

impl<H, G> ParameterSetMetadata for StackedGraph<H, G> where
H: Hasher,
G: Graph<H> + ParameterSetMetadata,

source

fn identifier(&self) -> String

source

fn sector_size(&self) -> u64

source

impl<H, G> PartialEq<StackedGraph<H, G>> for StackedGraph<H, G> where
H: Hasher,
G: Graph<H>,

source

fn eq(&self, other: &StackedGraph<H, G>) -> 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 !=.

source

impl<H, G> Eq for StackedGraph<H, G> where
H: Hasher,
G: Graph<H>,

Auto Trait Implementations

impl<H, G> RefUnwindSafe for StackedGraph<H, G> where
G: RefUnwindSafe,
H: RefUnwindSafe,

impl<H, G> Send for StackedGraph<H, G> where
G: Send,

impl<H, G> Sync for StackedGraph<H, G> where
G: Sync,

impl<H, G> Unpin for StackedGraph<H, G> where
G: Unpin,
H: Unpin,

impl<H, G> UnwindSafe for StackedGraph<H, G> where
G: UnwindSafe,
H: UnwindSafe,

Blanket Implementations

source

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

source

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

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

const: unstable · source

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

impl<T> Conv for T

fn conv<T>(self) -> T where
Self: Into<T>,

Converts self into T using Into<T>. Read more

impl<T> FmtForward for T

fn fmt_binary(self) -> FmtBinary<Self> where
Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.

fn fmt_display(self) -> FmtDisplay<Self> where
Self: Display,

Causes self to use its Display implementation when Debug-formatted. Read more

fn fmt_lower_exp(self) -> FmtLowerExp<Self> where
Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted. Read more

fn fmt_lower_hex(self) -> FmtLowerHex<Self> where
Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted. Read more

fn fmt_octal(self) -> FmtOctal<Self> where
Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.

fn fmt_pointer(self) -> FmtPointer<Self> where
Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted. Read more

fn fmt_upper_exp(self) -> FmtUpperExp<Self> where
Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted. Read more

fn fmt_upper_hex(self) -> FmtUpperHex<Self> where
Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted. Read more

source

impl<T> From<T> for T

const: unstable · source

pub fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · source

pub 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> Pipe for T where
T: ?Sized,

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R

Pipes by value. This is generally the method you want to use. Read more

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R where
R: 'a,

Borrows self and passes that borrow into the pipe function. Read more

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R where
R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R where
 Self: Borrow,
 B: 'a + ?Sized,
 R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more

fn pipe_borrow_mut<'a, B, R>(
 &'a mut self,
 func: impl FnOnce(&'a mut B) -> R
) -> R where
 Self: BorrowMut,
 B: 'a + ?Sized,
 R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R where
 Self: AsRef,
 U: 'a + ?Sized,
 R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R where
 Self: AsMut,
 U: 'a + ?Sized,
 R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function. Read more

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
 Self: Deref<Target = T>,
 T: 'a + ?Sized,
 R: 'a,

Borrows self, then passes self.deref() into the pipe function.

fn pipe_deref_mut<'a, T, R>(
 &'a mut self,
 func: impl FnOnce(&'a mut T) -> R
) -> R where
 Self: DerefMut<Target = T> + Deref,
 T: 'a + ?Sized,
 R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function. Read more

impl<T> Pointable for T

pub const ALIGN: usize

The alignment of pointer.

type Init = T

The type for initializers.

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

Initializes a with the given initializer. Read more

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

Dereferences the given pointer. Read more

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

Mutably dereferences the given pointer. Read more

pub 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

impl<T> Tap for T

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more

fn tap_borrow(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow,
B: ?Sized,

Immutable access to the Borrow of a value. Read more

fn tap_borrow_mut(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut,
B: ?Sized,

Mutable access to the BorrowMut of a value. Read more

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self where
Self: Deref<Target = T>,
T: ?Sized,

Immutable access to the Deref::Target of a value. Read more

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self where
Self: DerefMut<Target = T> + Deref,
T: ?Sized,

Mutable access to the Deref::Target of a value. Read more

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds. Read more

fn tap_borrow_dbg(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow,
B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds. Read more

fn tap_borrow_mut_dbg(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut,
B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds. Read more

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds. Read more

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds. Read more

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self where
Self: Deref<Target = T>,
T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds. Read more

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Self where
Self: DerefMut<Target = T> + Deref,
T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds. Read more

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

pub fn to_owned(&self) -> T

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

source

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

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

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

impl<T> TryConv for T

fn try_conv<T>(self) -> Result<T, Self::Error> where
Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more

source

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

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

Struct storage_proofs_porep::stacked::StackedGraph

Implementations

impl<H, G> StackedGraph<H, G> where H: Hasher, G: Graph<H> + ParameterSetMetadata + Sync + Send,

pub fn new( base_graph: Option<G>, nodes: usize, base_degree: usize, expansion_degree: usize, porep_id: PoRepID, api_version: ApiVersion) -> Result<Self>

pub fn parent_cache(&self) -> Result<ParentCache>

pub fn copy_parents_data_exp( &self, node: u32, base_data: &[u8], exp_data: &[u8], hasher: Sha256, cache: Option<&mut ParentCache>) -> Result<[u8; 32]>

pub fn copy_parents_data( &self, node: u32, base_data: &[u8], hasher: Sha256, cache: Option<&mut ParentCache>) -> Result<[u8; 32]>

impl<'a, H, G> StackedGraph<H, G> where H: Hasher, G: Graph<H> + ParameterSetMetadata + Sync + Send,

pub fn generate_expanded_parents( &self, node: usize, expanded_parents: &mut [u32])

pub fn new_stacked( nodes: usize, base_degree: usize, expansion_degree: usize, porep_id: PoRepID, api_version: ApiVersion) -> Result<Self>

pub fn base_graph(&self) -> &G

pub fn expansion_degree(&self) -> usize

pub fn base_parents(&self, node: usize, parents: &mut [u32]) -> Result<()>

pub fn expanded_parents(&self, node: usize, parents: &mut [u32]) -> Result<()>

Trait Implementations

impl<H: Clone, G: Clone> Clone for StackedGraph<H, G> where H: Hasher, G: Graph<H> + 'static,

fn clone(&self) -> StackedGraph<H, G>

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

impl<H, G> Debug for StackedGraph<H, G> where H: Hasher, G: Graph<H> + 'static,

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

impl<H, G> Graph<H> for StackedGraph<H, G> where H: Hasher, G: Graph<H> + ParameterSetMetadata + Sync + Send,

type Key = Vec<u8>

fn size(&self) -> usize

fn degree(&self) -> usize

fn parents(&self, node: usize, parents: &mut [u32]) -> Result<()>

fn seed(&self) -> [u8; 28]

fn new( nodes: usize, base_degree: usize, expansion_degree: usize, porep_id: PoRepID, api_version: ApiVersion) -> Result<Self>

fn create_key( &self, _id: &H::Domain, _node: usize, _parents: &[u32], _base_parents_data: &[u8], _exp_parents_data: Option<&[u8]>) -> Result<Self::Key>

fn expected_size(&self) -> usize

fn merkle_tree_depth<U>(&self) -> u64 where U: 'static + PoseidonArity,

impl<H, G> ParameterSetMetadata for StackedGraph<H, G> where H: Hasher, G: Graph<H> + ParameterSetMetadata,

fn identifier(&self) -> String

fn sector_size(&self) -> u64

impl<H, G> PartialEq<StackedGraph<H, G>> for StackedGraph<H, G> where H: Hasher, G: Graph<H>,

fn eq(&self, other: &StackedGraph<H, G>) -> bool

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

impl<H, G> Eq for StackedGraph<H, G> where H: Hasher, G: Graph<H>,

Auto Trait Implementations

impl<H, G> RefUnwindSafe for StackedGraph<H, G> where G: RefUnwindSafe, H: RefUnwindSafe,

impl<H, G> Send for StackedGraph<H, G> where G: Send,

impl<H, G> Sync for StackedGraph<H, G> where G: Sync,

impl<H, G> Unpin for StackedGraph<H, G> where G: Unpin, H: Unpin,

impl<H, G> UnwindSafe for StackedGraph<H, G> where G: UnwindSafe, H: UnwindSafe,

Blanket Implementations

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

pub fn type_id(&self) -> TypeId

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

pub fn borrow(&self) -> &T

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

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

impl<T> Conv for T

fn conv<T>(self) -> T where Self: Into<T>,

impl<T> FmtForward for T

fn fmt_binary(self) -> FmtBinary<Self> where Self: Binary,

fn fmt_display(self) -> FmtDisplay<Self> where Self: Display,

fn fmt_lower_exp(self) -> FmtLowerExp<Self> where Self: LowerExp,

fn fmt_lower_hex(self) -> FmtLowerHex<Self> where Self: LowerHex,

fn fmt_octal(self) -> FmtOctal<Self> where Self: Octal,

fn fmt_pointer(self) -> FmtPointer<Self> where Self: Pointer,

fn fmt_upper_exp(self) -> FmtUpperExp<Self> where Self: UpperExp,

fn fmt_upper_hex(self) -> FmtUpperHex<Self> where Self: UpperHex,

impl<T> From<T> for T

pub fn from(t: T) -> T

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

pub fn into(self) -> U

impl<T> Pipe for T where T: ?Sized,

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R where R: 'a,

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R where R: 'a,

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R where Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R) -> R where Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R where Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R where Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R) -> R where Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

impl<T> Pointable for T

pub const ALIGN: usize

type Init = T

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

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

impl<H, G> StackedGraph<H, G> where
H: Hasher,
G: Graph<H> + ParameterSetMetadata + Sync + Send,

pub fn new(
base_graph: Option<G>,
nodes: usize,
base_degree: usize,
expansion_degree: usize,
porep_id: PoRepID,
api_version: ApiVersion
) -> Result<Self>

pub fn copy_parents_data_exp(
&self,
node: u32,
base_data: &[u8 ],
exp_data: &[u8 ],
hasher: Sha256,
cache: Option<&mut ParentCache>
) -> Result<[u8 ; 32]>

pub fn copy_parents_data(
&self,
node: u32,
base_data: &[u8 ],
hasher: Sha256,
cache: Option<&mut ParentCache>
) -> Result<[u8 ; 32]>

impl<'a, H, G> StackedGraph<H, G> where
H: Hasher,
G: Graph<H> + ParameterSetMetadata + Sync + Send,

pub fn generate_expanded_parents(
&self,
node: usize,
expanded_parents: &mut [u32 ]
)

pub fn new_stacked(
nodes: usize,
base_degree: usize,
expansion_degree: usize,
porep_id: PoRepID,
api_version: ApiVersion
) -> Result<Self>

pub fn base_parents(&self, node: usize, parents: &mut [u32 ]) -> Result<()>

pub fn expanded_parents(&self, node: usize, parents: &mut [u32 ]) -> Result<()>

impl<H: Clone, G: Clone> Clone for StackedGraph<H, G> where
H: Hasher,
G: Graph<H> + 'static,

impl<H, G> Debug for StackedGraph<H, G> where
H: Hasher,
G: Graph<H> + 'static,

impl<H, G> Graph<H> for StackedGraph<H, G> where
H: Hasher,
G: Graph<H> + ParameterSetMetadata + Sync + Send,

fn parents(&self, node: usize, parents: &mut [u32 ]) -> Result<()>

fn seed(&self) -> [u8 ; 28]

fn new(
nodes: usize,
base_degree: usize,
expansion_degree: usize,
porep_id: PoRepID,
api_version: ApiVersion
) -> Result<Self>

fn create_key(
&self,
_id: &H::Domain,
_node: usize,
_parents: &[u32 ],
_base_parents_data: &[u8 ],
_exp_parents_data: Option<&[u8 ]>
) -> Result<Self::Key>

fn merkle_tree_depth<U>(&self) -> u64 where
U: 'static + PoseidonArity,

impl<H, G> ParameterSetMetadata for StackedGraph<H, G> where
H: Hasher,
G: Graph<H> + ParameterSetMetadata,

impl<H, G> PartialEq<StackedGraph<H, G>> for StackedGraph<H, G> where
H: Hasher,
G: Graph<H>,

impl<H, G> Eq for StackedGraph<H, G> where
H: Hasher,
G: Graph<H>,

impl<H, G> RefUnwindSafe for StackedGraph<H, G> where
G: RefUnwindSafe,
H: RefUnwindSafe,

impl<H, G> Send for StackedGraph<H, G> where
G: Send,

impl<H, G> Sync for StackedGraph<H, G> where
G: Sync,

impl<H, G> Unpin for StackedGraph<H, G> where
G: Unpin,
H: Unpin,

impl<H, G> UnwindSafe for StackedGraph<H, G> where
G: UnwindSafe,
H: UnwindSafe,

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

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

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

fn conv<T>(self) -> T where
Self: Into<T>,

fn fmt_binary(self) -> FmtBinary<Self> where
Self: Binary,

fn fmt_display(self) -> FmtDisplay<Self> where
Self: Display,

fn fmt_lower_exp(self) -> FmtLowerExp<Self> where
Self: LowerExp,

fn fmt_lower_hex(self) -> FmtLowerHex<Self> where
Self: LowerHex,

fn fmt_octal(self) -> FmtOctal<Self> where
Self: Octal,

fn fmt_pointer(self) -> FmtPointer<Self> where
Self: Pointer,

fn fmt_upper_exp(self) -> FmtUpperExp<Self> where
Self: UpperExp,

fn fmt_upper_hex(self) -> FmtUpperHex<Self> where
Self: UpperHex,

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

impl<T> Pipe for T where
T: ?Sized,

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R where
R: 'a,

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R where
R: 'a,

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R where
Self: Borrow<B>,
B: 'a + ?Sized,
R: 'a,

fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R
) -> R where
Self: BorrowMut<B>,
B: 'a + ?Sized,
R: 'a,

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R where
Self: AsRef<U>,
U: 'a + ?Sized,
R: 'a,

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R where
Self: AsMut<U>,
U: 'a + ?Sized,
R: 'a,

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: Deref<Target = T>,
T: 'a + ?Sized,
R: 'a,

fn pipe_deref_mut<'a, T, R>(
&'a mut self,
func: impl FnOnce(&'a mut T) -> R
) -> R where
Self: DerefMut<Target = T> + Deref,
T: 'a + ?Sized,
R: 'a,

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized,

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized,

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized,

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized,

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self where
Self: Deref<Target = T>,
T: ?Sized,

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self where
Self: DerefMut<Target = T> + Deref,
T: ?Sized,

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized,

fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized,

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized,

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized,

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self where
Self: Deref<Target = T>,
T: ?Sized,

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Self where
Self: DerefMut<Target = T> + Deref,
T: ?Sized,

impl<T> ToOwned for T where
T: Clone,

fn try_conv<T>(self) -> Result<T, Self::Error> where
Self: TryInto<T>,

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

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

impl<V, T> VZip<V> for T where
V: MultiLane<T>,