Struct storage_proofs_porep::stacked::StackedDrg
source · pub struct StackedDrg<'a, Tree: MerkleTreeTrait, G: Hasher> { /* private fields */ }
Implementations§
source§impl<'a, Tree: 'static + MerkleTreeTrait, G: 'static + Hasher> StackedDrg<'a, Tree, G>
impl<'a, Tree: 'static + MerkleTreeTrait, G: 'static + Hasher> StackedDrg<'a, Tree, G>
pub fn extract_and_invert_transform_layers( graph: &StackedBucketGraph<Tree::Hasher>, num_layers: usize, replica_id: &<Tree::Hasher as Hasher>::Domain, data: &mut [u8], config: StoreConfig, ) -> Result<()>
sourcepub fn generate_labels_for_decoding(
graph: &StackedBucketGraph<Tree::Hasher>,
num_layers: usize,
replica_id: &<Tree::Hasher as Hasher>::Domain,
config: StoreConfig,
) -> Result<LabelsCache<Tree>>
pub fn generate_labels_for_decoding( graph: &StackedBucketGraph<Tree::Hasher>, num_layers: usize, replica_id: &<Tree::Hasher as Hasher>::Domain, config: StoreConfig, ) -> Result<LabelsCache<Tree>>
Generates the layers, as needed for decoding.
pub fn generate_tree_c<ColumnArity, TreeArity>(
nodes_count: usize,
tree_count: usize,
configs: Vec<StoreConfig>,
labels: &LabelsCache<Tree>,
) -> Result<DiskTree<Tree::Hasher, Tree::Arity, Tree::SubTreeArity, Tree::TopTreeArity>>where
ColumnArity: 'static + PoseidonArity,
TreeArity: PoseidonArity,
pub fn generate_tree_r_last( data: &mut Data<'_>, nodes_count: usize, tree_count: usize, tree_r_last_config: StoreConfig, replica_path: PathBuf, source: &DiskStore<<Tree::Hasher as Hasher>::Domain>, callback: Option<fn(source: &DiskStore<<Tree::Hasher as Hasher>::Domain>, data: Option<&mut Data<'_>>, start: usize, end: usize) -> Result<TreeRElementData<Tree>>>, ) -> Result<LCTree<Tree::Hasher, Tree::Arity, Tree::SubTreeArity, Tree::TopTreeArity>>
sourcepub fn replicate_phase1<P>(
pp: &'a PublicParams<Tree>,
replica_id: &<Tree::Hasher as Hasher>::Domain,
cache_path: P,
) -> Result<(Labels<Tree>, Vec<LayerState>)>
pub fn replicate_phase1<P>( pp: &'a PublicParams<Tree>, replica_id: &<Tree::Hasher as Hasher>::Domain, cache_path: P, ) -> Result<(Labels<Tree>, Vec<LayerState>)>
Phase1 of replication.
sourcepub fn replicate_phase2(
pp: &'a PublicParams<Tree>,
label_configs: Labels<Tree>,
data: Data<'a>,
data_tree: Option<BinaryMerkleTree<G>>,
cache_path: PathBuf,
replica_path: PathBuf,
) -> Result<(Tau<<Tree::Hasher as Hasher>::Domain, <G as Hasher>::Domain>, (PersistentAux<<Tree::Hasher as Hasher>::Domain>, TemporaryAux<Tree, G>))>
pub fn replicate_phase2( pp: &'a PublicParams<Tree>, label_configs: Labels<Tree>, data: Data<'a>, data_tree: Option<BinaryMerkleTree<G>>, cache_path: PathBuf, replica_path: PathBuf, ) -> Result<(Tau<<Tree::Hasher as Hasher>::Domain, <G as Hasher>::Domain>, (PersistentAux<<Tree::Hasher as Hasher>::Domain>, TemporaryAux<Tree, G>))>
Phase2 of replication.
pub fn fake_replicate_phase2<R: AsRef<Path>, S: AsRef<Path>>( tree_c_root: <Tree::Hasher as Hasher>::Domain, replica_path: R, cache_path: S, sector_size: usize, ) -> Result<(<Tree::Hasher as Hasher>::Domain, PersistentAux<<Tree::Hasher as Hasher>::Domain>)>
pub fn fake_comm_r<R: AsRef<Path>>( tree_c_root: <Tree::Hasher as Hasher>::Domain, existing_p_aux_path: R, ) -> Result<(<Tree::Hasher as Hasher>::Domain, PersistentAux<<Tree::Hasher as Hasher>::Domain>)>
Trait Implementations§
source§impl<'a, Tree: 'static + MerkleTreeTrait, G: 'static + Hasher> CompoundProof<'a, StackedDrg<'a, Tree, G>, StackedCircuit<Tree, G>> for StackedCompound<Tree, G>
impl<'a, Tree: 'static + MerkleTreeTrait, G: 'static + Hasher> CompoundProof<'a, StackedDrg<'a, Tree, G>, StackedCircuit<Tree, G>> for StackedCompound<Tree, G>
source§fn generate_public_inputs(
pub_in: &<StackedDrg<'_, Tree, G> as ProofScheme<'_>>::PublicInputs,
pub_params: &<StackedDrg<'_, Tree, G> as ProofScheme<'_>>::PublicParams,
k: Option<usize>,
) -> Result<Vec<Fr>>
fn generate_public_inputs( pub_in: &<StackedDrg<'_, Tree, G> as ProofScheme<'_>>::PublicInputs, pub_params: &<StackedDrg<'_, Tree, G> as ProofScheme<'_>>::PublicParams, k: Option<usize>, ) -> Result<Vec<Fr>>
generate_public_inputs generates public inputs suitable for use as input during verification
of a proof generated from this CompoundProof’s bellperson::Circuit (C). These inputs correspond
to those allocated when C is synthesized.
source§fn circuit<'b>(
public_inputs: &'b <StackedDrg<'_, Tree, G> as ProofScheme<'_>>::PublicInputs,
_component_private_inputs: <StackedCircuit<Tree, G> as CircuitComponent>::ComponentPrivateInputs,
vanilla_proof: &'b <StackedDrg<'_, Tree, G> as ProofScheme<'_>>::Proof,
_public_params: &'b <StackedDrg<'_, Tree, G> as ProofScheme<'_>>::PublicParams,
_partition_k: Option<usize>,
) -> Result<StackedCircuit<Tree, G>>
fn circuit<'b>( public_inputs: &'b <StackedDrg<'_, Tree, G> as ProofScheme<'_>>::PublicInputs, _component_private_inputs: <StackedCircuit<Tree, G> as CircuitComponent>::ComponentPrivateInputs, vanilla_proof: &'b <StackedDrg<'_, Tree, G> as ProofScheme<'_>>::Proof, _public_params: &'b <StackedDrg<'_, Tree, G> as ProofScheme<'_>>::PublicParams, _partition_k: Option<usize>, ) -> Result<StackedCircuit<Tree, G>>
circuit constructs an instance of this CompoundProof’s bellperson::Circuit.
circuit takes PublicInputs, PublicParams, and Proof from this CompoundProof’s proof::ProofScheme (S)
and uses them to initialize Circuit fields which will be used to construct public and private
inputs during circuit synthesis.
fn blank_circuit( public_params: &<StackedDrg<'_, Tree, G> as ProofScheme<'_>>::PublicParams, ) -> StackedCircuit<Tree, G>
fn setup(sp: &SetupParams<'a, S>) -> Result<PublicParams<'a, S>, Error>
fn partition_count(public_params: &PublicParams<'a, S>) -> usize
source§fn prove(
pub_params: &PublicParams<'a, S>,
pub_in: &<S as ProofScheme<'a>>::PublicInputs,
priv_in: &<S as ProofScheme<'a>>::PrivateInputs,
groth_params: &MappedParameters<Bls12>,
) -> Result<Vec<Proof<Bls12>>, Error>
fn prove( pub_params: &PublicParams<'a, S>, pub_in: &<S as ProofScheme<'a>>::PublicInputs, priv_in: &<S as ProofScheme<'a>>::PrivateInputs, groth_params: &MappedParameters<Bls12>, ) -> Result<Vec<Proof<Bls12>>, Error>
prove is equivalent to ProofScheme::prove.
fn prove_with_vanilla( pub_params: &PublicParams<'a, S>, pub_in: &<S as ProofScheme<'a>>::PublicInputs, vanilla_proofs: Vec<<S as ProofScheme<'a>>::Proof>, groth_params: &MappedParameters<Bls12>, ) -> Result<Vec<Proof<Bls12>>, Error>
fn verify<'b>( public_params: &PublicParams<'a, S>, public_inputs: &<S as ProofScheme<'a>>::PublicInputs, multi_proof: &MultiProof<'b>, requirements: &<S as ProofScheme<'a>>::Requirements, ) -> Result<bool, Error>
source§fn batch_verify<'b>(
public_params: &PublicParams<'a, S>,
public_inputs: &[<S as ProofScheme<'a>>::PublicInputs],
multi_proofs: &[MultiProof<'b>],
requirements: &<S as ProofScheme<'a>>::Requirements,
) -> Result<bool, Error>
fn batch_verify<'b>( public_params: &PublicParams<'a, S>, public_inputs: &[<S as ProofScheme<'a>>::PublicInputs], multi_proofs: &[MultiProof<'b>], requirements: &<S as ProofScheme<'a>>::Requirements, ) -> Result<bool, Error>
Efficiently verify multiple proofs.
source§fn circuit_proofs(
pub_in: &<S as ProofScheme<'a>>::PublicInputs,
vanilla_proofs: Vec<<S as ProofScheme<'a>>::Proof>,
pub_params: &<S as ProofScheme<'a>>::PublicParams,
groth_params: &MappedParameters<Bls12>,
priority: bool,
) -> Result<Vec<Proof<Bls12>>, Error>
fn circuit_proofs( pub_in: &<S as ProofScheme<'a>>::PublicInputs, vanilla_proofs: Vec<<S as ProofScheme<'a>>::Proof>, pub_params: &<S as ProofScheme<'a>>::PublicParams, groth_params: &MappedParameters<Bls12>, priority: bool, ) -> Result<Vec<Proof<Bls12>>, Error>
circuit_proof creates and synthesizes a circuit from concrete params/inputs, then generates a
groth proof from it. It returns a groth proof.
circuit_proof is used internally and should neither be called nor implemented outside of
default trait methods.
source§fn aggregate_proofs(
prover_srs: &ProverSRS<Bls12>,
hashed_seeds_and_comm_rs: &[u8],
proofs: &[Proof<Bls12>],
version: AggregateVersion,
) -> Result<AggregateProof<Bls12>, Error>
fn aggregate_proofs( prover_srs: &ProverSRS<Bls12>, hashed_seeds_and_comm_rs: &[u8], proofs: &[Proof<Bls12>], version: AggregateVersion, ) -> Result<AggregateProof<Bls12>, Error>
Given a prover_srs key, a list of groth16 proofs, and an ordered list of seeds
(used to derive the PoRep challenges) hashed pair-wise with the comm_rs using sha256, aggregate them all into
an AggregateProof type.
source§fn verify_aggregate_proofs(
ip_verifier_srs: &VerifierSRS<Bls12>,
pvk: &PreparedVerifyingKey<Bls12>,
hashed_seeds_and_comm_rs: &[u8],
public_inputs: &[Vec<Scalar>],
aggregate_proof: &AggregateProof<Bls12>,
version: AggregateVersion,
) -> Result<bool, Error>
fn verify_aggregate_proofs( ip_verifier_srs: &VerifierSRS<Bls12>, pvk: &PreparedVerifyingKey<Bls12>, hashed_seeds_and_comm_rs: &[u8], public_inputs: &[Vec<Scalar>], aggregate_proof: &AggregateProof<Bls12>, version: AggregateVersion, ) -> Result<bool, Error>
Verifies the aggregate proof, with respect to the flattened input list. Read more
source§fn groth_params<R>(
rng: Option<&mut R>,
public_params: &<S as ProofScheme<'a>>::PublicParams,
) -> Result<MappedParameters<Bls12>, Error>where
R: RngCore,
fn groth_params<R>(
rng: Option<&mut R>,
public_params: &<S as ProofScheme<'a>>::PublicParams,
) -> Result<MappedParameters<Bls12>, Error>where
R: RngCore,
If the rng option argument is set, parameters will be
generated using it. This is used for testing only, or where
parameters are otherwise unavailable (e.g. benches). If rng
is not set, an error will result if parameters are not
present.
source§fn verifying_key<R>(
rng: Option<&mut R>,
public_params: &<S as ProofScheme<'a>>::PublicParams,
) -> Result<VerifyingKey<Bls12>, Error>where
R: RngCore,
fn verifying_key<R>(
rng: Option<&mut R>,
public_params: &<S as ProofScheme<'a>>::PublicParams,
) -> Result<VerifyingKey<Bls12>, Error>where
R: RngCore,
If the rng option argument is set, parameters will be
generated using it. This is used for testing only, or where
parameters are otherwise unavailable (e.g. benches). If rng
is not set, an error will result if parameters are not
present.
source§fn srs_key<R>(
rng: Option<&mut R>,
public_params: &<S as ProofScheme<'a>>::PublicParams,
num_proofs_to_aggregate: usize,
) -> Result<ProverSRS<Bls12>, Error>where
R: RngCore,
fn srs_key<R>(
rng: Option<&mut R>,
public_params: &<S as ProofScheme<'a>>::PublicParams,
num_proofs_to_aggregate: usize,
) -> Result<ProverSRS<Bls12>, Error>where
R: RngCore,
If the rng option argument is set, parameters will be
generated using it. This is used for testing only, or where
parameters are otherwise unavailable (e.g. benches). If rng
is not set, an error will result if parameters are not
present.
source§fn srs_verifier_key<R>(
rng: Option<&mut R>,
public_params: &<S as ProofScheme<'a>>::PublicParams,
num_proofs_to_aggregate: usize,
) -> Result<VerifierSRS<Bls12>, Error>where
R: RngCore,
fn srs_verifier_key<R>(
rng: Option<&mut R>,
public_params: &<S as ProofScheme<'a>>::PublicParams,
num_proofs_to_aggregate: usize,
) -> Result<VerifierSRS<Bls12>, Error>where
R: RngCore,
If the rng option argument is set, parameters will be
generated using it. This is used for testing only, or where
parameters are otherwise unavailable (e.g. benches). If rng
is not set, an error will result if parameters are not
present.
fn circuit_for_test( public_parameters: &PublicParams<'a, S>, public_inputs: &<S as ProofScheme<'a>>::PublicInputs, private_inputs: &<S as ProofScheme<'a>>::PrivateInputs, ) -> Result<(C, Vec<Scalar>), Error>
source§fn circuit_for_test_all(
public_parameters: &PublicParams<'a, S>,
public_inputs: &<S as ProofScheme<'a>>::PublicInputs,
private_inputs: &<S as ProofScheme<'a>>::PrivateInputs,
) -> Result<Vec<(C, Vec<Scalar>)>, Error>
fn circuit_for_test_all( public_parameters: &PublicParams<'a, S>, public_inputs: &<S as ProofScheme<'a>>::PublicInputs, private_inputs: &<S as ProofScheme<'a>>::PrivateInputs, ) -> Result<Vec<(C, Vec<Scalar>)>, Error>
Like circuit_for_test but returns values for all partitions.
source§impl<'a, Tree: Debug + MerkleTreeTrait, G: Debug + Hasher> Debug for StackedDrg<'a, Tree, G>
impl<'a, Tree: Debug + MerkleTreeTrait, G: Debug + Hasher> Debug for StackedDrg<'a, Tree, G>
source§impl<'a, 'c, Tree: 'static + MerkleTreeTrait, G: 'static + Hasher> ProofScheme<'a> for StackedDrg<'c, Tree, G>
impl<'a, 'c, Tree: 'static + MerkleTreeTrait, G: 'static + Hasher> ProofScheme<'a> for StackedDrg<'c, Tree, G>
type PublicParams = PublicParams<Tree>
type SetupParams = SetupParams
type PublicInputs = PublicInputs<<<Tree as MerkleTreeTrait>::Hasher as Hasher>::Domain, <G as Hasher>::Domain>
type PrivateInputs = PrivateInputs<Tree, G>
type Proof = Vec<Proof<Tree, G>>
type Requirements = ChallengeRequirements
source§fn setup(sp: &Self::SetupParams) -> Result<Self::PublicParams>
fn setup(sp: &Self::SetupParams) -> Result<Self::PublicParams>
setup is used to generate public parameters from setup parameters in order to specialize
a ProofScheme to the specific parameters required by a consumer.
source§fn prove<'b>(
pub_params: &'b Self::PublicParams,
pub_inputs: &'b Self::PublicInputs,
priv_inputs: &'b Self::PrivateInputs,
) -> Result<Self::Proof>
fn prove<'b>( pub_params: &'b Self::PublicParams, pub_inputs: &'b Self::PublicInputs, priv_inputs: &'b Self::PrivateInputs, ) -> Result<Self::Proof>
prove generates and returns a proof from public parameters, public inputs, and private inputs.
fn prove_all_partitions<'b>( pub_params: &'b Self::PublicParams, pub_inputs: &'b Self::PublicInputs, priv_inputs: &'b Self::PrivateInputs, partition_count: usize, ) -> Result<Vec<Self::Proof>>
fn verify_all_partitions( pub_params: &Self::PublicParams, pub_inputs: &Self::PublicInputs, partition_proofs: &[Self::Proof], ) -> Result<bool>
fn with_partition( pub_in: Self::PublicInputs, k: Option<usize>, ) -> Self::PublicInputs
fn satisfies_requirements( public_params: &PublicParams<Tree>, requirements: &ChallengeRequirements, partitions: usize, ) -> bool
source§fn verify(
_pub_params: &Self::PublicParams,
_pub_inputs: &Self::PublicInputs,
_proof: &Self::Proof,
) -> Result<bool, Error>
fn verify( _pub_params: &Self::PublicParams, _pub_inputs: &Self::PublicInputs, _proof: &Self::Proof, ) -> Result<bool, Error>
verify returns true if the supplied proof is valid for the given public parameter and public inputs.
Note that verify does not have access to private inputs.
Remember that proof is untrusted, and any data it provides MUST be validated as corresponding
to the supplied public parameters and inputs.
Auto Trait Implementations§
impl<'a, Tree, G> Freeze for StackedDrg<'a, Tree, G>
impl<'a, Tree, G> RefUnwindSafe for StackedDrg<'a, Tree, G>where
Tree: RefUnwindSafe,
G: RefUnwindSafe,
impl<'a, Tree, G> Send for StackedDrg<'a, Tree, G>
impl<'a, Tree, G> Sync for StackedDrg<'a, Tree, G>
impl<'a, Tree, G> Unpin for StackedDrg<'a, Tree, G>
impl<'a, Tree, G> UnwindSafe for StackedDrg<'a, Tree, G>where
Tree: RefUnwindSafe,
G: RefUnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> FmtForward for T
impl<T> FmtForward for T
source§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
Causes
self
to use its Binary
implementation when Debug
-formatted.source§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
Causes
self
to use its Display
implementation when
Debug
-formatted.source§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
Causes
self
to use its LowerExp
implementation when
Debug
-formatted.source§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
Causes
self
to use its LowerHex
implementation when
Debug
-formatted.source§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
Causes
self
to use its Octal
implementation when Debug
-formatted.source§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
Causes
self
to use its Pointer
implementation when
Debug
-formatted.source§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
Causes
self
to use its UpperExp
implementation when
Debug
-formatted.source§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
Causes
self
to use its UpperHex
implementation when
Debug
-formatted.source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
source§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
Pipes by value. This is generally the method you want to use. Read more
source§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
Borrows
self
and passes that borrow into the pipe function. Read moresource§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
Mutably borrows
self
and passes that borrow into the pipe function. Read moresource§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
source§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
source§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
Borrows
self
, then passes self.as_ref()
into the pipe function.source§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
Mutably borrows
self
, then passes self.as_mut()
into the pipe
function.source§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
Borrows
self
, then passes self.deref()
into the pipe function.source§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<T> Tap for T
impl<T> Tap for T
source§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Immutable access to the
Borrow<B>
of a value. Read moresource§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
Mutable access to the
BorrowMut<B>
of a value. Read moresource§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
Immutable access to the
AsRef<R>
view of a value. Read moresource§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
Mutable access to the
AsMut<R>
view of a value. Read moresource§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Immutable access to the
Deref::Target
of a value. Read moresource§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Mutable access to the
Deref::Target
of a value. Read moresource§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
Calls
.tap()
only in debug builds, and is erased in release builds.source§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
Calls
.tap_mut()
only in debug builds, and is erased in release
builds.source§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
Calls
.tap_borrow()
only in debug builds, and is erased in release
builds.source§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
Calls
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.source§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
Calls
.tap_ref()
only in debug builds, and is erased in release
builds.source§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
Calls
.tap_ref_mut()
only in debug builds, and is erased in release
builds.source§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
Calls
.tap_deref()
only in debug builds, and is erased in release
builds.