#[repr(transparent)]pub struct Bloom(pub FixedBytes<256>);Expand description
Ethereum 256 byte bloom filter.
Tuple Fields§
§0: FixedBytes<256>Implementations§
Source§impl Bloom
impl Bloom
Sourcepub const fn with_last_byte(x: u8) -> Self
pub const fn with_last_byte(x: u8) -> Self
Creates a new byte array with the last byte set to x.
Sourcepub const fn repeat_byte(byte: u8) -> Self
pub const fn repeat_byte(byte: u8) -> Self
Creates a new byte array where all bytes are set to byte.
Sourcepub fn random() -> Self
Available on crate feature getrandom only.
pub fn random() -> Self
getrandom only.Creates a new fixed byte array with the default cryptographic random number generator.
This is rand::thread_rng if the “rand” and “std” features are enabled, otherwise
it uses getrandom::getrandom. Both are cryptographically secure.
Sourcepub fn try_random() -> Result<Self, Error>
Available on crate feature getrandom only.
pub fn try_random() -> Result<Self, Error>
getrandom only.Tries to create a new fixed byte array with the default cryptographic random number generator.
See random for more details.
Sourcepub fn randomize(&mut self)
Available on crate feature getrandom only.
pub fn randomize(&mut self)
getrandom only.Fills this fixed byte array with the default cryptographic random number generator.
See random for more details.
Sourcepub fn try_randomize(&mut self) -> Result<(), Error>
Available on crate feature getrandom only.
pub fn try_randomize(&mut self) -> Result<(), Error>
getrandom only.Tries to fill this fixed byte array with the default cryptographic random number generator.
See random for more details.
Sourcepub fn random_with<R: RngCore + ?Sized>(rng: &mut R) -> Self
Available on crate feature rand only.
pub fn random_with<R: RngCore + ?Sized>(rng: &mut R) -> Self
rand only.Creates a new fixed byte array with the given random number generator.
Sourcepub fn try_random_with<R: TryRngCore + ?Sized>(
rng: &mut R,
) -> Result<Self, R::Error>
Available on crate feature rand only.
pub fn try_random_with<R: TryRngCore + ?Sized>( rng: &mut R, ) -> Result<Self, R::Error>
rand only.Tries to create a new fixed byte array with the given random number generator.
Sourcepub fn randomize_with<R: RngCore + ?Sized>(&mut self, rng: &mut R)
Available on crate feature rand only.
pub fn randomize_with<R: RngCore + ?Sized>(&mut self, rng: &mut R)
rand only.Fills this fixed byte array with the given random number generator.
Sourcepub fn try_randomize_with<R: TryRngCore + ?Sized>(
&mut self,
rng: &mut R,
) -> Result<(), R::Error>
Available on crate feature rand only.
pub fn try_randomize_with<R: TryRngCore + ?Sized>( &mut self, rng: &mut R, ) -> Result<(), R::Error>
rand only.Tries to fill this fixed byte array with the given random number generator.
Sourcepub fn from_slice(src: &[u8]) -> Self
pub fn from_slice(src: &[u8]) -> Self
Sourcepub fn left_padding_from(value: &[u8]) -> Self
pub fn left_padding_from(value: &[u8]) -> Self
Sourcepub fn right_padding_from(value: &[u8]) -> Self
pub fn right_padding_from(value: &[u8]) -> Self
Sourcepub const fn into_array(self) -> [u8; 256]
pub const fn into_array(self) -> [u8; 256]
Returns the inner bytes array.
Source§impl Bloom
impl Bloom
Sourcepub const fn data_mut(&mut self) -> &mut [u8; 256]
pub const fn data_mut(&mut self) -> &mut [u8; 256]
Returns a mutable reference to the underlying data.
Sourcepub fn contains_input(&self, input: BloomInput<'_>) -> bool
pub fn contains_input(&self, input: BloomInput<'_>) -> bool
Returns true if this bloom filter is a possible superset of the other bloom filter, admitting false positives.
Note: This method may return false positives. This is inherent to the bloom filter data structure.
Sourcepub const fn const_contains(self, other: Self) -> bool
pub const fn const_contains(self, other: Self) -> bool
Compile-time version of contains.
Note: This method may return false positives. This is inherent to the bloom filter data structure.
Sourcepub fn contains(&self, other: &Self) -> bool
pub fn contains(&self, other: &Self) -> bool
Returns true if this bloom filter is a possible superset of the other bloom filter, admitting false positives.
Note: This method may return false positives. This is inherent to the bloom filter data structure.
Sourcepub fn accrue(&mut self, input: BloomInput<'_>)
pub fn accrue(&mut self, input: BloomInput<'_>)
Accrues the input into the bloom filter.
Sourcepub fn accrue_bloom(&mut self, bloom: &Self)
pub fn accrue_bloom(&mut self, bloom: &Self)
Accrues the input into the bloom filter.
Sourcepub fn m3_2048(&mut self, bytes: &[u8])
pub fn m3_2048(&mut self, bytes: &[u8])
Specialised Bloom filter that sets three bits out of 2048, given an arbitrary byte sequence.
See Section 4.3.1 “Transaction Receipt” of the Ethereum Yellow Paper (page 6).
Sourcepub fn m3_2048_hashed(&mut self, hash: &B256)
pub fn m3_2048_hashed(&mut self, hash: &B256)
m3_2048 but with a pre-hashed input.
Sourcepub fn accrue_raw_log(&mut self, address: Address, topics: &[B256])
pub fn accrue_raw_log(&mut self, address: Address, topics: &[B256])
Ingests a raw log into the bloom filter.
Sourcepub fn accrue_log(&mut self, log: &Log)
pub fn accrue_log(&mut self, log: &Log)
Ingests a log into the bloom filter.
Sourcepub fn accrue_logs(&mut self, logs: &[Log])
pub fn accrue_logs(&mut self, logs: &[Log])
Ingests multiple logs into the bloom filter.
Sourcepub fn contains_raw_log(&self, address: Address, topics: &[B256]) -> bool
pub fn contains_raw_log(&self, address: Address, topics: &[B256]) -> bool
True if the bloom filter contains a log with given address and topics.
Note: This method may return false positives. This is inherent to the bloom filter data structure.
Sourcepub fn contains_log(&self, log: &Log) -> bool
pub fn contains_log(&self, log: &Log) -> bool
True if the bloom filter contains a log with given address and topics.
Note: This method may return false positives. This is inherent to the bloom filter data structure.
Methods from Deref<Target = FixedBytes<256>>§
pub const ZERO: Self
Sourcepub fn randomize(&mut self)
Available on crate feature getrandom only.
pub fn randomize(&mut self)
getrandom only.Fills this FixedBytes with the default cryptographic random number generator.
See random for more details.
Sourcepub fn try_randomize(&mut self) -> Result<(), Error>
Available on crate feature getrandom only.
pub fn try_randomize(&mut self) -> Result<(), Error>
getrandom only.Tries to fill this FixedBytes with the default cryptographic random number
generator.
See random for more details.
Sourcepub fn randomize_with<R: RngCore + ?Sized>(&mut self, rng: &mut R)
Available on crate feature rand only.
pub fn randomize_with<R: RngCore + ?Sized>(&mut self, rng: &mut R)
rand only.Fills this FixedBytes with the given random number generator.
Sourcepub fn try_randomize_with<R: TryRngCore + ?Sized>(
&mut self,
rng: &mut R,
) -> Result<(), R::Error>
Available on crate feature rand only.
pub fn try_randomize_with<R: TryRngCore + ?Sized>( &mut self, rng: &mut R, ) -> Result<(), R::Error>
rand only.Tries to fill this FixedBytes with the given random number generator.
Sourcepub fn as_slice(&self) -> &[u8] ⓘ
pub fn as_slice(&self) -> &[u8] ⓘ
Returns a slice containing the entire array. Equivalent to &s[..].
Sourcepub fn as_mut_slice(&mut self) -> &mut [u8] ⓘ
pub fn as_mut_slice(&mut self) -> &mut [u8] ⓘ
Returns a mutable slice containing the entire array. Equivalent to
&mut s[..].
Sourcepub fn covers(&self, other: &Self) -> bool
pub fn covers(&self, other: &Self) -> bool
Returns true if all bits set in self are also set in b.
Sourcepub fn const_eq(&self, other: &Self) -> bool
pub fn const_eq(&self, other: &Self) -> bool
Compile-time equality. NOT constant-time equality.
Sourcepub fn const_is_zero(&self) -> bool
pub fn const_is_zero(&self) -> bool
Returns true if no bits are set.
Methods from Deref<Target = [u8; N]>§
Sourcepub fn as_ascii(&self) -> Option<&[AsciiChar; N]>
🔬This is a nightly-only experimental API. (ascii_char)
pub fn as_ascii(&self) -> Option<&[AsciiChar; N]>
ascii_char)Converts this array of bytes into an array of ASCII characters,
or returns None if any of the characters is non-ASCII.
§Examples
#![feature(ascii_char)]
const HEX_DIGITS: [std::ascii::Char; 16] =
*b"0123456789abcdef".as_ascii().unwrap();
assert_eq!(HEX_DIGITS[1].as_str(), "1");
assert_eq!(HEX_DIGITS[10].as_str(), "a");Sourcepub unsafe fn as_ascii_unchecked(&self) -> &[AsciiChar; N]
🔬This is a nightly-only experimental API. (ascii_char)
pub unsafe fn as_ascii_unchecked(&self) -> &[AsciiChar; N]
ascii_char)Converts this array of bytes into an array of ASCII characters, without checking whether they’re valid.
§Safety
Every byte in the array must be in 0..=127, or else this is UB.
1.57.0 · Sourcepub fn as_slice(&self) -> &[T]
pub fn as_slice(&self) -> &[T]
Returns a slice containing the entire array. Equivalent to &s[..].
1.57.0 · Sourcepub fn as_mut_slice(&mut self) -> &mut [T]
pub fn as_mut_slice(&mut self) -> &mut [T]
Returns a mutable slice containing the entire array. Equivalent to
&mut s[..].
1.77.0 · Sourcepub fn each_ref(&self) -> [&T; N]
pub fn each_ref(&self) -> [&T; N]
Borrows each element and returns an array of references with the same
size as self.
§Example
let floats = [3.1, 2.7, -1.0];
let float_refs: [&f64; 3] = floats.each_ref();
assert_eq!(float_refs, [&3.1, &2.7, &-1.0]);This method is particularly useful if combined with other methods, like
map. This way, you can avoid moving the original
array if its elements are not Copy.
let strings = ["Ferris".to_string(), "♥".to_string(), "Rust".to_string()];
let is_ascii = strings.each_ref().map(|s| s.is_ascii());
assert_eq!(is_ascii, [true, false, true]);
// We can still access the original array: it has not been moved.
assert_eq!(strings.len(), 3);1.77.0 · Sourcepub fn each_mut(&mut self) -> [&mut T; N]
pub fn each_mut(&mut self) -> [&mut T; N]
Borrows each element mutably and returns an array of mutable references
with the same size as self.
§Example
let mut floats = [3.1, 2.7, -1.0];
let float_refs: [&mut f64; 3] = floats.each_mut();
*float_refs[0] = 0.0;
assert_eq!(float_refs, [&mut 0.0, &mut 2.7, &mut -1.0]);
assert_eq!(floats, [0.0, 2.7, -1.0]);Sourcepub fn split_array_ref<const M: usize>(&self) -> (&[T; M], &[T])
🔬This is a nightly-only experimental API. (split_array)
pub fn split_array_ref<const M: usize>(&self) -> (&[T; M], &[T])
split_array)Divides one array reference into two at an index.
The first will contain all indices from [0, M) (excluding
the index M itself) and the second will contain all
indices from [M, N) (excluding the index N itself).
§Panics
Panics if M > N.
§Examples
#![feature(split_array)]
let v = [1, 2, 3, 4, 5, 6];
{
let (left, right) = v.split_array_ref::<0>();
assert_eq!(left, &[]);
assert_eq!(right, &[1, 2, 3, 4, 5, 6]);
}
{
let (left, right) = v.split_array_ref::<2>();
assert_eq!(left, &[1, 2]);
assert_eq!(right, &[3, 4, 5, 6]);
}
{
let (left, right) = v.split_array_ref::<6>();
assert_eq!(left, &[1, 2, 3, 4, 5, 6]);
assert_eq!(right, &[]);
}Sourcepub fn split_array_mut<const M: usize>(&mut self) -> (&mut [T; M], &mut [T])
🔬This is a nightly-only experimental API. (split_array)
pub fn split_array_mut<const M: usize>(&mut self) -> (&mut [T; M], &mut [T])
split_array)Divides one mutable array reference into two at an index.
The first will contain all indices from [0, M) (excluding
the index M itself) and the second will contain all
indices from [M, N) (excluding the index N itself).
§Panics
Panics if M > N.
§Examples
#![feature(split_array)]
let mut v = [1, 0, 3, 0, 5, 6];
let (left, right) = v.split_array_mut::<2>();
assert_eq!(left, &mut [1, 0][..]);
assert_eq!(right, &mut [3, 0, 5, 6]);
left[1] = 2;
right[1] = 4;
assert_eq!(v, [1, 2, 3, 4, 5, 6]);Sourcepub fn rsplit_array_ref<const M: usize>(&self) -> (&[T], &[T; M])
🔬This is a nightly-only experimental API. (split_array)
pub fn rsplit_array_ref<const M: usize>(&self) -> (&[T], &[T; M])
split_array)Divides one array reference into two at an index from the end.
The first will contain all indices from [0, N - M) (excluding
the index N - M itself) and the second will contain all
indices from [N - M, N) (excluding the index N itself).
§Panics
Panics if M > N.
§Examples
#![feature(split_array)]
let v = [1, 2, 3, 4, 5, 6];
{
let (left, right) = v.rsplit_array_ref::<0>();
assert_eq!(left, &[1, 2, 3, 4, 5, 6]);
assert_eq!(right, &[]);
}
{
let (left, right) = v.rsplit_array_ref::<2>();
assert_eq!(left, &[1, 2, 3, 4]);
assert_eq!(right, &[5, 6]);
}
{
let (left, right) = v.rsplit_array_ref::<6>();
assert_eq!(left, &[]);
assert_eq!(right, &[1, 2, 3, 4, 5, 6]);
}Sourcepub fn rsplit_array_mut<const M: usize>(&mut self) -> (&mut [T], &mut [T; M])
🔬This is a nightly-only experimental API. (split_array)
pub fn rsplit_array_mut<const M: usize>(&mut self) -> (&mut [T], &mut [T; M])
split_array)Divides one mutable array reference into two at an index from the end.
The first will contain all indices from [0, N - M) (excluding
the index N - M itself) and the second will contain all
indices from [N - M, N) (excluding the index N itself).
§Panics
Panics if M > N.
§Examples
#![feature(split_array)]
let mut v = [1, 0, 3, 0, 5, 6];
let (left, right) = v.rsplit_array_mut::<4>();
assert_eq!(left, &mut [1, 0]);
assert_eq!(right, &mut [3, 0, 5, 6][..]);
left[1] = 2;
right[1] = 4;
assert_eq!(v, [1, 2, 3, 4, 5, 6]);Trait Implementations§
Source§impl Allocative for Bloom
Available on crate feature allocative only.
impl Allocative for Bloom
allocative only.Source§impl<'a> Arbitrary<'a> for Bloom
Available on crate feature arbitrary only.
impl<'a> Arbitrary<'a> for Bloom
arbitrary only.Source§fn arbitrary(u: &mut Unstructured<'a>) -> Result<Self>
fn arbitrary(u: &mut Unstructured<'a>) -> Result<Self>
Self from the given unstructured data. Read moreSource§fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self>
fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self>
Self from the entirety of the given
unstructured data. Read moreSource§fn size_hint(depth: usize) -> (usize, Option<usize>)
fn size_hint(depth: usize) -> (usize, Option<usize>)
Unstructured this type
needs to construct itself. Read moreSource§fn try_size_hint(
depth: usize,
) -> Result<(usize, Option<usize>), MaxRecursionReached>
fn try_size_hint( depth: usize, ) -> Result<(usize, Option<usize>), MaxRecursionReached>
Unstructured this type
needs to construct itself. Read moreSource§impl Arbitrary for Bloom
Available on crate feature arbitrary only.
impl Arbitrary for Bloom
arbitrary only.Source§type Parameters = <FixedBytes<256> as Arbitrary>::Parameters
type Parameters = <FixedBytes<256> as Arbitrary>::Parameters
arbitrary_with accepts for configuration
of the generated Strategy. Parameters must implement Default.Source§type Strategy = Map<<FixedBytes<256> as Arbitrary>::Strategy, fn(FixedBytes<256>) -> Bloom>
type Strategy = Map<<FixedBytes<256> as Arbitrary>::Strategy, fn(FixedBytes<256>) -> Bloom>
Strategy used to generate values of type Self.Source§fn arbitrary_with(args: Self::Parameters) -> Self::Strategy
fn arbitrary_with(args: Self::Parameters) -> Self::Strategy
Source§impl Archive for Bloomwhere
FixedBytes<256>: Archive,
impl Archive for Bloomwhere
FixedBytes<256>: Archive,
Source§const COPY_OPTIMIZATION: CopyOptimization<Self>
const COPY_OPTIMIZATION: CopyOptimization<Self>
serialize. Read moreSource§type Archived = ArchivedBloom
type Archived = ArchivedBloom
Source§type Resolver = BloomResolver
type Resolver = BloomResolver
Source§impl AsExpression<Binary> for &Bloom
impl AsExpression<Binary> for &Bloom
Source§type Expression = Bound<Binary, &Bloom>
type Expression = Bound<Binary, &Bloom>
Source§fn as_expression(self) -> Self::Expression
fn as_expression(self) -> Self::Expression
Source§impl AsExpression<Binary> for Bloom
impl AsExpression<Binary> for Bloom
Source§type Expression = Bound<Binary, Bloom>
type Expression = Bound<Binary, Bloom>
Source§fn as_expression(self) -> Self::Expression
fn as_expression(self) -> Self::Expression
Source§impl AsExpression<Nullable<Binary>> for &Bloom
impl AsExpression<Nullable<Binary>> for &Bloom
Source§fn as_expression(self) -> Self::Expression
fn as_expression(self) -> Self::Expression
Source§impl AsExpression<Nullable<Binary>> for Bloom
impl AsExpression<Nullable<Binary>> for Bloom
Source§fn as_expression(self) -> Self::Expression
fn as_expression(self) -> Self::Expression
Source§impl AsMut<FixedBytes<256>> for Bloom
impl AsMut<FixedBytes<256>> for Bloom
Source§fn as_mut(&mut self) -> &mut FixedBytes<256>
fn as_mut(&mut self) -> &mut FixedBytes<256>
Source§impl AsRef<FixedBytes<256>> for Bloom
impl AsRef<FixedBytes<256>> for Bloom
Source§fn as_ref(&self) -> &FixedBytes<256>
fn as_ref(&self) -> &FixedBytes<256>
Source§impl BitAndAssign<&Bloom> for Bloom
impl BitAndAssign<&Bloom> for Bloom
Source§fn bitand_assign(&mut self, rhs: &Self)
fn bitand_assign(&mut self, rhs: &Self)
&= operation. Read moreSource§impl BitAndAssign for Bloom
impl BitAndAssign for Bloom
Source§fn bitand_assign(&mut self, __rhs: Self)
fn bitand_assign(&mut self, __rhs: Self)
&= operation. Read moreSource§impl BitOrAssign<&Bloom> for Bloom
impl BitOrAssign<&Bloom> for Bloom
Source§fn bitor_assign(&mut self, rhs: &Self)
fn bitor_assign(&mut self, rhs: &Self)
|= operation. Read moreSource§impl BitOrAssign for Bloom
impl BitOrAssign for Bloom
Source§fn bitor_assign(&mut self, __rhs: Self)
fn bitor_assign(&mut self, __rhs: Self)
|= operation. Read moreSource§impl BitXorAssign<&Bloom> for Bloom
impl BitXorAssign<&Bloom> for Bloom
Source§fn bitxor_assign(&mut self, rhs: &Self)
fn bitxor_assign(&mut self, rhs: &Self)
^= operation. Read moreSource§impl BitXorAssign for Bloom
impl BitXorAssign for Bloom
Source§fn bitxor_assign(&mut self, __rhs: Self)
fn bitxor_assign(&mut self, __rhs: Self)
^= operation. Read moreSource§impl BorshDeserialize for Bloom
Available on crate feature borsh only.
impl BorshDeserialize for Bloom
borsh only.fn deserialize_reader<R: Read>(reader: &mut R) -> Result<Self, Error>
Source§fn deserialize(buf: &mut &[u8]) -> Result<Self, Error>
fn deserialize(buf: &mut &[u8]) -> Result<Self, Error>
Source§fn try_from_slice(v: &[u8]) -> Result<Self, Error>
fn try_from_slice(v: &[u8]) -> Result<Self, Error>
fn try_from_reader<R>(reader: &mut R) -> Result<Self, Error>where
R: Read,
Source§impl BorshSerialize for Bloom
Available on crate feature borsh only.
impl BorshSerialize for Bloom
borsh only.Source§impl<'de> Deserialize<'de> for Bloom
Available on crate feature serde only.
impl<'de> Deserialize<'de> for Bloom
serde only.Source§fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>
fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>
Source§impl<__D: Fallible + ?Sized> Deserialize<Bloom, __D> for Archived<Bloom>where
FixedBytes<256>: Archive,
<FixedBytes<256> as Archive>::Archived: Deserialize<FixedBytes<256>, __D>,
impl<__D: Fallible + ?Sized> Deserialize<Bloom, __D> for Archived<Bloom>where
FixedBytes<256>: Archive,
<FixedBytes<256> as Archive>::Archived: Deserialize<FixedBytes<256>, __D>,
Source§impl Distribution<Bloom> for StandardUniform
Available on crate feature rand only.
impl Distribution<Bloom> for StandardUniform
rand only.Source§impl<'a, DB> Encode<'a, DB> for Bloom
impl<'a, DB> Encode<'a, DB> for Bloom
Source§fn encode_by_ref(
&self,
buf: &mut <DB as Database>::ArgumentBuffer<'a>,
) -> Result<IsNull, BoxDynError>
fn encode_by_ref( &self, buf: &mut <DB as Database>::ArgumentBuffer<'a>, ) -> Result<IsNull, BoxDynError>
Source§fn encode(
self,
buf: &mut <DB as Database>::ArgumentBuffer<'q>,
) -> Result<IsNull, Box<dyn Error + Sync + Send>>where
Self: Sized,
fn encode(
self,
buf: &mut <DB as Database>::ArgumentBuffer<'q>,
) -> Result<IsNull, Box<dyn Error + Sync + Send>>where
Self: Sized,
self into buf in the expected format for the database.fn produces(&self) -> Option<<DB as Database>::TypeInfo>
fn size_hint(&self) -> usize
Source§impl<'a> Extend<&'a (Address, LogData)> for Bloom
impl<'a> Extend<&'a (Address, LogData)> for Bloom
Source§fn extend<T: IntoIterator<Item = &'a (Address, LogData)>>(&mut self, iter: T)
fn extend<T: IntoIterator<Item = &'a (Address, LogData)>>(&mut self, iter: T)
Source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one)Source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one)Source§impl<'a, 'b> Extend<&'a BloomInput<'b>> for Bloom
impl<'a, 'b> Extend<&'a BloomInput<'b>> for Bloom
Source§fn extend<T: IntoIterator<Item = &'a BloomInput<'b>>>(&mut self, inputs: T)
fn extend<T: IntoIterator<Item = &'a BloomInput<'b>>>(&mut self, inputs: T)
Source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one)Source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one)Source§impl<'a> Extend<&'a Log> for Bloom
impl<'a> Extend<&'a Log> for Bloom
Source§fn extend<T: IntoIterator<Item = &'a Log>>(&mut self, logs: T)
fn extend<T: IntoIterator<Item = &'a Log>>(&mut self, logs: T)
Source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one)Source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one)Source§impl From<ArchivedBloom> for Bloom
Available on crate feature rkyv only.
impl From<ArchivedBloom> for Bloom
rkyv only.Source§fn from(archived: ArchivedBloom) -> Self
fn from(archived: ArchivedBloom) -> Self
Source§impl From<Bloom> for FixedBytes<256>
impl From<Bloom> for FixedBytes<256>
Source§impl From<BloomInput<'_>> for Bloom
impl From<BloomInput<'_>> for Bloom
Source§fn from(input: BloomInput<'_>) -> Self
fn from(input: BloomInput<'_>) -> Self
Source§impl From<FixedBytes<256>> for Bloom
impl From<FixedBytes<256>> for Bloom
Source§fn from(value: FixedBytes<256>) -> Self
fn from(value: FixedBytes<256>) -> Self
Source§impl<'a, 'b> FromIterator<&'a BloomInput<'b>> for Bloom
impl<'a, 'b> FromIterator<&'a BloomInput<'b>> for Bloom
Source§fn from_iter<T: IntoIterator<Item = &'a BloomInput<'b>>>(inputs: T) -> Self
fn from_iter<T: IntoIterator<Item = &'a BloomInput<'b>>>(inputs: T) -> Self
Source§impl<'a> FromIterator<&'a Log> for Bloom
impl<'a> FromIterator<&'a Log> for Bloom
Source§impl<'__deriveMoreLifetime> IntoIterator for &'__deriveMoreLifetime Bloomwhere
&'__deriveMoreLifetime FixedBytes<256>: IntoIterator,
impl<'__deriveMoreLifetime> IntoIterator for &'__deriveMoreLifetime Bloomwhere
&'__deriveMoreLifetime FixedBytes<256>: IntoIterator,
Source§type Item = <&'__deriveMoreLifetime FixedBytes<256> as IntoIterator>::Item
type Item = <&'__deriveMoreLifetime FixedBytes<256> as IntoIterator>::Item
Source§type IntoIter = <&'__deriveMoreLifetime FixedBytes<256> as IntoIterator>::IntoIter
type IntoIter = <&'__deriveMoreLifetime FixedBytes<256> as IntoIterator>::IntoIter
Source§impl<'__deriveMoreLifetime> IntoIterator for &'__deriveMoreLifetime mut Bloomwhere
&'__deriveMoreLifetime mut FixedBytes<256>: IntoIterator,
impl<'__deriveMoreLifetime> IntoIterator for &'__deriveMoreLifetime mut Bloomwhere
&'__deriveMoreLifetime mut FixedBytes<256>: IntoIterator,
Source§type Item = <&'__deriveMoreLifetime mut FixedBytes<256> as IntoIterator>::Item
type Item = <&'__deriveMoreLifetime mut FixedBytes<256> as IntoIterator>::Item
Source§type IntoIter = <&'__deriveMoreLifetime mut FixedBytes<256> as IntoIterator>::IntoIter
type IntoIter = <&'__deriveMoreLifetime mut FixedBytes<256> as IntoIterator>::IntoIter
Source§impl IntoIterator for Bloomwhere
FixedBytes<256>: IntoIterator,
impl IntoIterator for Bloomwhere
FixedBytes<256>: IntoIterator,
Source§type Item = <FixedBytes<256> as IntoIterator>::Item
type Item = <FixedBytes<256> as IntoIterator>::Item
Source§type IntoIter = <FixedBytes<256> as IntoIterator>::IntoIter
type IntoIter = <FixedBytes<256> as IntoIterator>::IntoIter
Source§impl Ord for Bloom
impl Ord for Bloom
Source§impl PartialOrd<&[u8]> for Bloom
impl PartialOrd<&[u8]> for Bloom
Source§impl PartialOrd<&Bloom> for [u8]
impl PartialOrd<&Bloom> for [u8]
Source§impl PartialOrd<[u8]> for &Bloom
impl PartialOrd<[u8]> for &Bloom
Source§impl PartialOrd<[u8]> for Bloom
impl PartialOrd<[u8]> for Bloom
Source§impl PartialOrd<Bloom> for &[u8]
impl PartialOrd<Bloom> for &[u8]
Source§impl PartialOrd<Bloom> for [u8]
impl PartialOrd<Bloom> for [u8]
Source§impl PartialOrd for Bloom
impl PartialOrd for Bloom
impl Copy for Bloom
impl Eq for Bloom
impl MaxEncodedLen<{ $len }> for Bloom
impl StructuralPartialEq for Bloom
Auto Trait Implementations§
impl Freeze for Bloom
impl RefUnwindSafe for Bloom
impl Send for Bloom
impl Sync for Bloom
impl Unpin for Bloom
impl UnwindSafe for Bloom
Blanket Implementations§
Source§impl<T> AggregateExpressionMethods for T
impl<T> AggregateExpressionMethods for T
Source§fn aggregate_distinct(self) -> Self::Outputwhere
Self: DistinctDsl,
fn aggregate_distinct(self) -> Self::Outputwhere
Self: DistinctDsl,
DISTINCT modifier for aggregate functions Read moreSource§fn aggregate_all(self) -> Self::Outputwhere
Self: AllDsl,
fn aggregate_all(self) -> Self::Outputwhere
Self: AllDsl,
ALL modifier for aggregate functions Read moreSource§fn aggregate_filter<P>(self, f: P) -> Self::Output
fn aggregate_filter<P>(self, f: P) -> Self::Output
Source§fn aggregate_order<O>(self, o: O) -> Self::Outputwhere
Self: OrderAggregateDsl<O>,
fn aggregate_order<O>(self, o: O) -> Self::Outputwhere
Self: OrderAggregateDsl<O>,
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Source§impl<T> ArchiveUnsized for Twhere
T: Archive,
impl<T> ArchiveUnsized for Twhere
T: Archive,
Source§type Archived = <T as Archive>::Archived
type Archived = <T as Archive>::Archived
Archive, it may be
unsized. Read moreSource§fn archived_metadata(
&self,
) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
fn archived_metadata( &self, ) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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> ⓘ
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> ⓘ
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> IntoSql for T
impl<T> IntoSql for T
Source§fn into_sql<T>(self) -> Self::Expression
fn into_sql<T>(self) -> Self::Expression
self to an expression for Diesel’s query builder. Read moreSource§fn as_sql<'a, T>(&'a self) -> <&'a Self as AsExpression<T>>::Expression
fn as_sql<'a, T>(&'a self) -> <&'a Self as AsExpression<T>>::Expression
&self to an expression for Diesel’s query builder. Read moreSource§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out indicating that a T is niched.Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T, S> SerializeUnsized<S> for T
impl<T, S> SerializeUnsized<S> for T
Source§impl<T> ToHex for T
impl<T> ToHex for T
Source§fn encode_hex<U>(&self) -> Uwhere
U: FromIterator<char>,
fn encode_hex<U>(&self) -> Uwhere
U: FromIterator<char>,
ToHexExt insteadself into the result.
Lower case letters are used (e.g. f9b4ca).Source§fn encode_hex_upper<U>(&self) -> Uwhere
U: FromIterator<char>,
fn encode_hex_upper<U>(&self) -> Uwhere
U: FromIterator<char>,
ToHexExt insteadself into the result.
Upper case letters are used (e.g. F9B4CA).Source§impl<T> ToHexExt for T
impl<T> ToHexExt for T
Source§fn encode_hex(&self) -> String
fn encode_hex(&self) -> String
self into the result.
Lower case letters are used (e.g. f9b4ca).Source§fn encode_hex_upper(&self) -> String
fn encode_hex_upper(&self) -> String
self into the result.
Upper case letters are used (e.g. F9B4CA).Source§fn encode_hex_with_prefix(&self) -> String
fn encode_hex_with_prefix(&self) -> String
self into the result with prefix 0x.
Lower case letters are used (e.g. 0xf9b4ca).Source§fn encode_hex_upper_with_prefix(&self) -> String
fn encode_hex_upper_with_prefix(&self) -> String
self into the result with prefix 0X.
Upper case letters are used (e.g. 0xF9B4CA).Source§impl<T> WindowExpressionMethods for T
impl<T> WindowExpressionMethods for T
Source§fn over(self) -> Self::Outputwhere
Self: OverDsl,
fn over(self) -> Self::Outputwhere
Self: OverDsl,
Source§fn window_filter<P>(self, f: P) -> Self::Output
fn window_filter<P>(self, f: P) -> Self::Output
Source§fn partition_by<E>(self, expr: E) -> Self::Outputwhere
Self: PartitionByDsl<E>,
fn partition_by<E>(self, expr: E) -> Self::Outputwhere
Self: PartitionByDsl<E>,
Source§fn window_order<E>(self, expr: E) -> Self::Outputwhere
Self: OrderWindowDsl<E>,
fn window_order<E>(self, expr: E) -> Self::Outputwhere
Self: OrderWindowDsl<E>,
Source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
Source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
Source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 256 bytes