Struct bee_crypto::ternary::Hash [−][src]
pub struct Hash(_);
bee-crypto
will not be supported in future versions. You can use functions from iota-crypto
instead.
Expand description
Ternary cryptographic hash.
Implementations
👎 Deprecated: bee-crypto
will not be supported in future versions. You can use functions from iota-crypto
instead.
bee-crypto
will not be supported in future versions. You can use functions from iota-crypto
instead.
Creates a hash filled with zeros.
👎 Deprecated: bee-crypto
will not be supported in future versions. You can use functions from iota-crypto
instead.
bee-crypto
will not be supported in future versions. You can use functions from iota-crypto
instead.
Interpret the Hash
as a trit slice.
👎 Deprecated: bee-crypto
will not be supported in future versions. You can use functions from iota-crypto
instead.
bee-crypto
will not be supported in future versions. You can use functions from iota-crypto
instead.
Interpret the Hash
as a mutable trit slice.
Methods from Deref<Target = Trits<T1B1>>
Interpret this slice as an (core::i8
) slice.
Panics
This function will panic if the slice is not byte-aligned.
Fetch the trit at the given index of this trit slice without first checking whether the index is in bounds. Providing an index that is not less than the length of this slice is undefined behaviour.
This is perhaps the ‘least bad’ unsafe
function in this crate: not because any form of
undefined behaviour is better or worse than another (after all, the point of undefined
behaviour is that it is undefined) but because it’s the easiest to use correctly.
Safety
An index with a value less then the result of Trits::len
must be used. Any other value
is undefined behaviour.
Set the trit at the given index of this trit slice without first checking whether the index is in bounds. Providing an index that is not less than the length of this slice is undefined behaviour.
This is perhaps the ‘least bad’ unsafe
function in this crate: not because any form of
undefined behaviour is better or worse than another (after all, the point of undefined
behaviour is that it is undefined) but because it’s the easiest to use correctly.
Safety
An index with a value less then the result of Trits::len
must be used. Any other value
is undefined behaviour.
Fetch the trit at the given index of this trit slice, if the index is valid.
Set the trit at the given index of this mutable trit slice, if the index is valid.
Panics
This function will panic if the index is not less than the length of this slice.
Returns an iterator over the trits in this slice.
Using this function is significantly faster than calling Trits::get
in a loop and
should be used where possible.
Returns a subslice of this slice with the given range of trits.
Panics
This function will panic if called with a range that contains indices outside this slice, or the start of the range is greater than its end.
Returns a mutable subslice of this mutable slice with the given range of trits.
Panics
This function will panic if called with a range that contains indices outside this slice, or the start of the range is greater than its end.
pub fn copy_from<U>(&mut self, trits: &Trits<U>) where
U: RawEncoding<Trit = <T as RawEncoding>::Trit> + ?Sized,
pub fn copy_from<U>(&mut self, trits: &Trits<U>) where
U: RawEncoding<Trit = <T as RawEncoding>::Trit> + ?Sized,
Copy the trits from a trit slice into this mutable trit slice (the encoding need not be equivalent).
Panics
This function will panic if the length of the slices are different.
Fill this mutable trit slice with copied of the given trit.
Copy the contents of this trit slice into a new TritBuf
with the same encoding. This
function is analogous to to_vec
method implemented on ordinary slices.
Return an iterator over distinct, non-overlapping subslices of this trit slice, each with the given chunk length. If the length of the trit slice is not a multiple of the given chunk length, the last slice provided by the iterator will be smaller to compensate.
Panics
This function will panic if the given chunk length is 0
.
pub fn encode<U>(&self) -> TritBuf<U> where
U: RawEncodingBuf,
<U as RawEncodingBuf>::Slice: RawEncoding,
<<U as RawEncodingBuf>::Slice as RawEncoding>::Trit == <T as RawEncoding>::Trit,
pub fn encode<U>(&self) -> TritBuf<U> where
U: RawEncodingBuf,
<U as RawEncodingBuf>::Slice: RawEncoding,
<<U as RawEncodingBuf>::Slice as RawEncoding>::Trit == <T as RawEncoding>::Trit,
Encode the contents of this trit slice into a TritBuf
with a different encoding.
Returns an iterator over the trytes represented within this slice.
For encodings that are representation-compatible with trytes, such as T3B1
, use
Trits::as_trytes
instead since it is faster and more capable.
View this trit slice as an ordinary slice of trits.
View this mutable trit slice as an ordinary slice of mutable trits.
Return an iterator over distinct, non-overlapping mutable subslices of this mutable trit slice, each with the given chunk length. If the length of the trit slice is not a multiple of the given chunk length, the last slice provided by the iterator will be smaller to compensate.
Panics
This function will panic if the given chunk length is 0
.
Returns a mutable iterator over the trits in this slice.
Using this function is significantly faster than calling Trits::set
in a loop and
should be used where possible.
Trait Implementations
Auto Trait Implementations
impl RefUnwindSafe for Hash
impl UnwindSafe for Hash
Blanket Implementations
Mutably borrows from an owned value. Read more