subspace_proof_of_space::chiapos

Struct Tables

Source 
pub struct Tables<const K: u8>(/* private fields */)
where
    EvaluatableUsize<{ _ }>: Sized,
    EvaluatableUsize<{ _ }>: Sized,
    EvaluatableUsize<{ _ }>: Sized,
    EvaluatableUsize<{ _ }>: Sized,
    EvaluatableUsize<{ _ }>: Sized,
    EvaluatableUsize<{ _ }>: Sized,
    EvaluatableUsize<{ _ }>: Sized;
Expand description

Collection of Chia tables

Implementations§

Source§

impl Tables<15>

Source

pub fn create(seed: [u8; 32], cache: &mut TablesCache<15>) -> Self

Create Chia proof of space tables. There also exists Self::create_parallel() that trades CPU efficiency and memory usage for lower latency.

Advanced version of Self::create_simple that allows to reuse cache.

Source

pub fn create_parallel(seed: [u8; 32], cache: &mut TablesCache<15>) -> Self

Almost the same as Self::create(), but uses parallelism internally for better performance (though not efficiency of CPU and memory usage), if you create multiple tables in parallel, prefer Self::create() for better overall performance.

Source

pub fn create_simple(seed: [u8; 32]) -> Self

Create Chia proof of space tables.

Simpler version of Self::create.

Source

pub fn find_quality<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 32]> + 'a

Find proof of space quality for given challenge.

Source

pub fn find_proof<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 120]> + 'a

Find proof of space for given challenge.

Source

pub fn verify( seed: [u8; 32], challenge: &[u8; 32], proof_of_space: &[u8; 120], ) -> Option<[u8; 32]>

Verify proof of space for given seed and challenge.

Source§

impl Tables<16>

Source

pub fn create(seed: [u8; 32], cache: &mut TablesCache<16>) -> Self

Create Chia proof of space tables. There also exists Self::create_parallel() that trades CPU efficiency and memory usage for lower latency.

Advanced version of Self::create_simple that allows to reuse cache.

Source

pub fn create_parallel(seed: [u8; 32], cache: &mut TablesCache<16>) -> Self

Almost the same as Self::create(), but uses parallelism internally for better performance (though not efficiency of CPU and memory usage), if you create multiple tables in parallel, prefer Self::create() for better overall performance.

Source

pub fn create_simple(seed: [u8; 32]) -> Self

Create Chia proof of space tables.

Simpler version of Self::create.

Source

pub fn find_quality<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 32]> + 'a

Find proof of space quality for given challenge.

Source

pub fn find_proof<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 128]> + 'a

Find proof of space for given challenge.

Source

pub fn verify( seed: [u8; 32], challenge: &[u8; 32], proof_of_space: &[u8; 128], ) -> Option<[u8; 32]>

Verify proof of space for given seed and challenge.

Source§

impl Tables<17>

Source

pub fn create(seed: [u8; 32], cache: &mut TablesCache<17>) -> Self

Create Chia proof of space tables. There also exists Self::create_parallel() that trades CPU efficiency and memory usage for lower latency.

Advanced version of Self::create_simple that allows to reuse cache.

Source

pub fn create_parallel(seed: [u8; 32], cache: &mut TablesCache<17>) -> Self

Almost the same as Self::create(), but uses parallelism internally for better performance (though not efficiency of CPU and memory usage), if you create multiple tables in parallel, prefer Self::create() for better overall performance.

Source

pub fn create_simple(seed: [u8; 32]) -> Self

Create Chia proof of space tables.

Simpler version of Self::create.

Source

pub fn find_quality<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 32]> + 'a

Find proof of space quality for given challenge.

Source

pub fn find_proof<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 136]> + 'a

Find proof of space for given challenge.

Source

pub fn verify( seed: [u8; 32], challenge: &[u8; 32], proof_of_space: &[u8; 136], ) -> Option<[u8; 32]>

Verify proof of space for given seed and challenge.

Source§

impl Tables<18>

Source

pub fn create(seed: [u8; 32], cache: &mut TablesCache<18>) -> Self

Create Chia proof of space tables. There also exists Self::create_parallel() that trades CPU efficiency and memory usage for lower latency.

Advanced version of Self::create_simple that allows to reuse cache.

Source

pub fn create_parallel(seed: [u8; 32], cache: &mut TablesCache<18>) -> Self

Almost the same as Self::create(), but uses parallelism internally for better performance (though not efficiency of CPU and memory usage), if you create multiple tables in parallel, prefer Self::create() for better overall performance.

Source

pub fn create_simple(seed: [u8; 32]) -> Self

Create Chia proof of space tables.

Simpler version of Self::create.

Source

pub fn find_quality<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 32]> + 'a

Find proof of space quality for given challenge.

Source

pub fn find_proof<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 144]> + 'a

Find proof of space for given challenge.

Source

pub fn verify( seed: [u8; 32], challenge: &[u8; 32], proof_of_space: &[u8; 144], ) -> Option<[u8; 32]>

Verify proof of space for given seed and challenge.

Source§

impl Tables<19>

Source

pub fn create(seed: [u8; 32], cache: &mut TablesCache<19>) -> Self

Create Chia proof of space tables. There also exists Self::create_parallel() that trades CPU efficiency and memory usage for lower latency.

Advanced version of Self::create_simple that allows to reuse cache.

Source

pub fn create_parallel(seed: [u8; 32], cache: &mut TablesCache<19>) -> Self

Almost the same as Self::create(), but uses parallelism internally for better performance (though not efficiency of CPU and memory usage), if you create multiple tables in parallel, prefer Self::create() for better overall performance.

Source

pub fn create_simple(seed: [u8; 32]) -> Self

Create Chia proof of space tables.

Simpler version of Self::create.

Source

pub fn find_quality<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 32]> + 'a

Find proof of space quality for given challenge.

Source

pub fn find_proof<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 152]> + 'a

Find proof of space for given challenge.

Source

pub fn verify( seed: [u8; 32], challenge: &[u8; 32], proof_of_space: &[u8; 152], ) -> Option<[u8; 32]>

Verify proof of space for given seed and challenge.

Source§

impl Tables<20>

Source

pub fn create(seed: [u8; 32], cache: &mut TablesCache<20>) -> Self

Create Chia proof of space tables. There also exists Self::create_parallel() that trades CPU efficiency and memory usage for lower latency.

Advanced version of Self::create_simple that allows to reuse cache.

Source

pub fn create_parallel(seed: [u8; 32], cache: &mut TablesCache<20>) -> Self

Almost the same as Self::create(), but uses parallelism internally for better performance (though not efficiency of CPU and memory usage), if you create multiple tables in parallel, prefer Self::create() for better overall performance.

Source

pub fn create_simple(seed: [u8; 32]) -> Self

Create Chia proof of space tables.

Simpler version of Self::create.

Source

pub fn find_quality<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 32]> + 'a

Find proof of space quality for given challenge.

Source

pub fn find_proof<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 160]> + 'a

Find proof of space for given challenge.

Source

pub fn verify( seed: [u8; 32], challenge: &[u8; 32], proof_of_space: &[u8; 160], ) -> Option<[u8; 32]>

Verify proof of space for given seed and challenge.

Source§

impl Tables<21>

Source

pub fn create(seed: [u8; 32], cache: &mut TablesCache<21>) -> Self

Create Chia proof of space tables. There also exists Self::create_parallel() that trades CPU efficiency and memory usage for lower latency.

Advanced version of Self::create_simple that allows to reuse cache.

Source

pub fn create_parallel(seed: [u8; 32], cache: &mut TablesCache<21>) -> Self

Almost the same as Self::create(), but uses parallelism internally for better performance (though not efficiency of CPU and memory usage), if you create multiple tables in parallel, prefer Self::create() for better overall performance.

Source

pub fn create_simple(seed: [u8; 32]) -> Self

Create Chia proof of space tables.

Simpler version of Self::create.

Source

pub fn find_quality<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 32]> + 'a

Find proof of space quality for given challenge.

Source

pub fn find_proof<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 168]> + 'a

Find proof of space for given challenge.

Source

pub fn verify( seed: [u8; 32], challenge: &[u8; 32], proof_of_space: &[u8; 168], ) -> Option<[u8; 32]>

Verify proof of space for given seed and challenge.

Source§

impl Tables<22>

Source

pub fn create(seed: [u8; 32], cache: &mut TablesCache<22>) -> Self

Create Chia proof of space tables. There also exists Self::create_parallel() that trades CPU efficiency and memory usage for lower latency.

Advanced version of Self::create_simple that allows to reuse cache.

Source

pub fn create_parallel(seed: [u8; 32], cache: &mut TablesCache<22>) -> Self

Almost the same as Self::create(), but uses parallelism internally for better performance (though not efficiency of CPU and memory usage), if you create multiple tables in parallel, prefer Self::create() for better overall performance.

Source

pub fn create_simple(seed: [u8; 32]) -> Self

Create Chia proof of space tables.

Simpler version of Self::create.

Source

pub fn find_quality<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 32]> + 'a

Find proof of space quality for given challenge.

Source

pub fn find_proof<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 176]> + 'a

Find proof of space for given challenge.

Source

pub fn verify( seed: [u8; 32], challenge: &[u8; 32], proof_of_space: &[u8; 176], ) -> Option<[u8; 32]>

Verify proof of space for given seed and challenge.

Source§

impl Tables<23>

Source

pub fn create(seed: [u8; 32], cache: &mut TablesCache<23>) -> Self

Create Chia proof of space tables. There also exists Self::create_parallel() that trades CPU efficiency and memory usage for lower latency.

Advanced version of Self::create_simple that allows to reuse cache.

Source

pub fn create_parallel(seed: [u8; 32], cache: &mut TablesCache<23>) -> Self

Almost the same as Self::create(), but uses parallelism internally for better performance (though not efficiency of CPU and memory usage), if you create multiple tables in parallel, prefer Self::create() for better overall performance.

Source

pub fn create_simple(seed: [u8; 32]) -> Self

Create Chia proof of space tables.

Simpler version of Self::create.

Source

pub fn find_quality<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 32]> + 'a

Find proof of space quality for given challenge.

Source

pub fn find_proof<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 184]> + 'a

Find proof of space for given challenge.

Source

pub fn verify( seed: [u8; 32], challenge: &[u8; 32], proof_of_space: &[u8; 184], ) -> Option<[u8; 32]>

Verify proof of space for given seed and challenge.

Source§

impl Tables<24>

Source

pub fn create(seed: [u8; 32], cache: &mut TablesCache<24>) -> Self

Create Chia proof of space tables. There also exists Self::create_parallel() that trades CPU efficiency and memory usage for lower latency.

Advanced version of Self::create_simple that allows to reuse cache.

Source

pub fn create_parallel(seed: [u8; 32], cache: &mut TablesCache<24>) -> Self

Almost the same as Self::create(), but uses parallelism internally for better performance (though not efficiency of CPU and memory usage), if you create multiple tables in parallel, prefer Self::create() for better overall performance.

Source

pub fn create_simple(seed: [u8; 32]) -> Self

Create Chia proof of space tables.

Simpler version of Self::create.

Source

pub fn find_quality<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 32]> + 'a

Find proof of space quality for given challenge.

Source

pub fn find_proof<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 192]> + 'a

Find proof of space for given challenge.

Source

pub fn verify( seed: [u8; 32], challenge: &[u8; 32], proof_of_space: &[u8; 192], ) -> Option<[u8; 32]>

Verify proof of space for given seed and challenge.

Source§

impl Tables<25>

Source

pub fn create(seed: [u8; 32], cache: &mut TablesCache<25>) -> Self

Create Chia proof of space tables. There also exists Self::create_parallel() that trades CPU efficiency and memory usage for lower latency.

Advanced version of Self::create_simple that allows to reuse cache.

Source

pub fn create_parallel(seed: [u8; 32], cache: &mut TablesCache<25>) -> Self

Almost the same as Self::create(), but uses parallelism internally for better performance (though not efficiency of CPU and memory usage), if you create multiple tables in parallel, prefer Self::create() for better overall performance.

Source

pub fn create_simple(seed: [u8; 32]) -> Self

Create Chia proof of space tables.

Simpler version of Self::create.

Source

pub fn find_quality<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 32]> + 'a

Find proof of space quality for given challenge.

Source

pub fn find_proof<'a>( &'a self, challenge: &'a [u8; 32], ) -> impl Iterator<Item = [u8; 200]> + 'a

Find proof of space for given challenge.

Source

pub fn verify( seed: [u8; 32], challenge: &[u8; 32], proof_of_space: &[u8; 200], ) -> Option<[u8; 32]>

Verify proof of space for given seed and challenge.

Trait Implementations§

Source§

impl<const K: u8> Debug for Tables<K>
where EvaluatableUsize<{ _ }>: Sized, EvaluatableUsize<{ _ }>: Sized, EvaluatableUsize<{ _ }>: Sized, EvaluatableUsize<{ _ }>: Sized, EvaluatableUsize<{ _ }>: Sized, EvaluatableUsize<{ _ }>: Sized, EvaluatableUsize<{ _ }>: Sized,

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<const K: u8> Freeze for Tables<K>
where EvaluatableUsize<{ metadata_size_bytes(K, 7) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 6) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 5) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 4) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 3) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 2) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 1) }>: Sized,

§

impl<const K: u8> RefUnwindSafe for Tables<K>
where EvaluatableUsize<{ metadata_size_bytes(K, 7) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 6) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 5) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 4) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 3) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 2) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 1) }>: Sized,

§

impl<const K: u8> Send for Tables<K>
where EvaluatableUsize<{ metadata_size_bytes(K, 7) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 6) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 5) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 4) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 3) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 2) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 1) }>: Sized,

§

impl<const K: u8> Sync for Tables<K>
where EvaluatableUsize<{ metadata_size_bytes(K, 7) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 6) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 5) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 4) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 3) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 2) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 1) }>: Sized,

§

impl<const K: u8> Unpin for Tables<K>
where EvaluatableUsize<{ metadata_size_bytes(K, 7) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 6) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 5) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 4) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 3) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 2) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 1) }>: Sized,

§

impl<const K: u8> UnwindSafe for Tables<K>
where EvaluatableUsize<{ metadata_size_bytes(K, 7) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 6) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 5) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 4) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 3) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 2) }>: Sized, EvaluatableUsize<{ metadata_size_bytes(K, 1) }>: Sized,

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

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

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

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

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

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

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

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

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

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

fn fmt_list(self) -> FmtList<Self>
where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

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

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.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
§

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

§

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

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>, 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>, 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>, 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>, U: 'a + ?Sized, R: 'a,

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

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

impl<T> Pointable for T

§

const ALIGN: usize

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 for T

Source§

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<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
§

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

Mutable access to the BorrowMut<B> 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.
§

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

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

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

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

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

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

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

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

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<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

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

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
§

impl<T> JsonSchemaMaybe for T