InvalidBlockSelection in reth_node_core::args

InvalidBlockSelection in reth_node_core::args - Rust

Struct InvalidBlockSelection

pub struct InvalidBlockSelection(/* private fields */);

Expand description

Describes the invalid block hooks that should be installed.

§Example

Create a InvalidBlockSelection from a selection.

use reth_node_core::args::{InvalidBlockHookType, InvalidBlockSelection};
let config: InvalidBlockSelection = vec![InvalidBlockHookType::Witness].into();

Source §

Source

Creates a new unique InvalidBlockSelection from the given items.

§Note

This will dedupe the selection and remove duplicates while preserving the order.

§Example

Create a selection from the InvalidBlockHookType string identifiers

use reth_node_core::args::{InvalidBlockHookType, InvalidBlockSelection};
let selection = vec!["witness", "prestate", "opcode"];
let config = InvalidBlockSelection::try_from_selection(selection).unwrap();
assert_eq!(
    config,
    InvalidBlockSelection::from([
        InvalidBlockHookType::Witness,
        InvalidBlockHookType::PreState,
        InvalidBlockHookType::Opcode
    ])
);

Create a unique selection from the InvalidBlockHookType string identifiers

use reth_node_core::args::{InvalidBlockHookType, InvalidBlockSelection};
let selection = vec!["witness", "prestate", "opcode", "witness", "prestate"];
let config = InvalidBlockSelection::try_from_selection(selection).unwrap();
assert_eq!(
    config,
    InvalidBlockSelection::from([
        InvalidBlockHookType::Witness,
        InvalidBlockHookType::PreState,
        InvalidBlockHookType::Opcode
    ])
);

Source

1.0.0 · Source

Returns the number of elements the set can hold without reallocating.

§Examples

use std::collections::HashSet;
let set: HashSet<i32> = HashSet::with_capacity(100);
assert!(set.capacity() >= 100);

1.0.0 · Source

An iterator visiting all elements in arbitrary order. The iterator element type is &'a T.

§Examples

use std::collections::HashSet;
let mut set = HashSet::new();
set.insert("a");
set.insert("b");

// Will print in an arbitrary order.
for x in set.iter() {
    println!("{x}");
}

§Performance

In the current implementation, iterating over set takes O(capacity) time instead of O(len) because it internally visits empty buckets too.

1.0.0 · Source

Returns the number of elements in the set.

§Examples

use std::collections::HashSet;

let mut v = HashSet::new();
assert_eq!(v.len(), 0);
v.insert(1);
assert_eq!(v.len(), 1);

1.0.0 · Source

Returns true if the set contains no elements.

§Examples

use std::collections::HashSet;

let mut v = HashSet::new();
assert!(v.is_empty());
v.insert(1);
assert!(!v.is_empty());

1.9.0 · Source

Returns a reference to the set’s BuildHasher.

§Examples

use std::collections::HashSet;
use std::hash::RandomState;

let hasher = RandomState::new();
let set: HashSet<i32> = HashSet::with_hasher(hasher);
let hasher: &RandomState = set.hasher();

1.0.0 · Source

Visits the values representing the difference, i.e., the values that are in self but not in other.

§Examples

use std::collections::HashSet;
let a = HashSet::from([1, 2, 3]);
let b = HashSet::from([4, 2, 3, 4]);

// Can be seen as `a - b`.
for x in a.difference(&b) {
    println!("{x}"); // Print 1
}

let diff: HashSet<_> = a.difference(&b).collect();
assert_eq!(diff, [1].iter().collect());

// Note that difference is not symmetric,
// and `b - a` means something else:
let diff: HashSet<_> = b.difference(&a).collect();
assert_eq!(diff, [4].iter().collect());

1.0.0 · Source

Visits the values representing the symmetric difference, i.e., the values that are in self or in other but not in both.

§Examples

use std::collections::HashSet;
let a = HashSet::from([1, 2, 3]);
let b = HashSet::from([4, 2, 3, 4]);

// Print 1, 4 in arbitrary order.
for x in a.symmetric_difference(&b) {
    println!("{x}");
}

let diff1: HashSet<_> = a.symmetric_difference(&b).collect();
let diff2: HashSet<_> = b.symmetric_difference(&a).collect();

assert_eq!(diff1, diff2);
assert_eq!(diff1, [1, 4].iter().collect());

1.0.0 · Source

Visits the values representing the intersection, i.e., the values that are both in self and other.

When an equal element is present in self and other then the resulting Intersection may yield references to one or the other. This can be relevant if T contains fields which are not compared by its Eq implementation, and may hold different value between the two equal copies of T in the two sets.

§Examples

use std::collections::HashSet;
let a = HashSet::from([1, 2, 3]);
let b = HashSet::from([4, 2, 3, 4]);

// Print 2, 3 in arbitrary order.
for x in a.intersection(&b) {
    println!("{x}");
}

let intersection: HashSet<_> = a.intersection(&b).collect();
assert_eq!(intersection, [2, 3].iter().collect());

1.0.0 · Source

Visits the values representing the union, i.e., all the values in self or other, without duplicates.

§Examples

use std::collections::HashSet;
let a = HashSet::from([1, 2, 3]);
let b = HashSet::from([4, 2, 3, 4]);

// Print 1, 2, 3, 4 in arbitrary order.
for x in a.union(&b) {
    println!("{x}");
}

let union: HashSet<_> = a.union(&b).collect();
assert_eq!(union, [1, 2, 3, 4].iter().collect());

1.0.0 · Source

Returns true if the set contains a value.

The value may be any borrowed form of the set’s value type, but Hash and Eq on the borrowed form must match those for the value type.

§Examples

use std::collections::HashSet;

let set = HashSet::from([1, 2, 3]);
assert_eq!(set.contains(&1), true);
assert_eq!(set.contains(&4), false);

1.9.0 · Source

Returns a reference to the value in the set, if any, that is equal to the given value.

The value may be any borrowed form of the set’s value type, but Hash and Eq on the borrowed form must match those for the value type.

§Examples

use std::collections::HashSet;

let set = HashSet::from([1, 2, 3]);
assert_eq!(set.get(&2), Some(&2));
assert_eq!(set.get(&4), None);

1.0.0 · Source

Returns true if self has no elements in common with other. This is equivalent to checking for an empty intersection.

§Examples

use std::collections::HashSet;

let a = HashSet::from([1, 2, 3]);
let mut b = HashSet::new();

assert_eq!(a.is_disjoint(&b), true);
b.insert(4);
assert_eq!(a.is_disjoint(&b), true);
b.insert(1);
assert_eq!(a.is_disjoint(&b), false);

1.0.0 · Source

Returns true if the set is a subset of another, i.e., other contains at least all the values in self.

§Examples

use std::collections::HashSet;

let sup = HashSet::from([1, 2, 3]);
let mut set = HashSet::new();

assert_eq!(set.is_subset(&sup), true);
set.insert(2);
assert_eq!(set.is_subset(&sup), true);
set.insert(4);
assert_eq!(set.is_subset(&sup), false);

1.0.0 · Source

Returns true if the set is a superset of another, i.e., self contains at least all the values in other.

§Examples

use std::collections::HashSet;

let sub = HashSet::from([1, 2]);
let mut set = HashSet::new();

assert_eq!(set.is_superset(&sub), false);

set.insert(0);
set.insert(1);
assert_eq!(set.is_superset(&sub), false);

set.insert(2);
assert_eq!(set.is_superset(&sub), true);

Source §

🔬This is a nightly-only experimental API. (clone_to_uninit #126799)

Performs copy-assignment from self to dest. Read more

Source §

Compare self to key and return true if they are equal.

Checks if this value is equivalent to the given key. Read more

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

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

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

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

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

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

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

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

Formats each item in a sequence. Read more

Source §

Returns the argument unchanged.

Builds a [TxEnv] from a transaction and a sender address.

Builds a [TxEnv] from a transaction, its sender, and encoded transaction bytes.

Attaches the provided Context to this type, returning a WithContext wrapper. Read more

Attaches the current Context to this type, returning a WithContext wrapper. Read more

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

Source §

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

Source §

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

Source §

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

Wrap the input message T in a tonic::Request

Applies the layer to a service and wraps it in [Layered].

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

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

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

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

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

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

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

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

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

The alignment of pointer.

The type for initializers.

Initializes a with the given initializer. Read more

Dereferences the given pointer. Read more

Mutably dereferences the given pointer. Read more

Drops the object pointed to by the given pointer. Read more

Create a new Policy that returns [Action::Follow] only if self and other return Action::Follow. Read more

Create a new Policy that returns [Action::Follow] if either self or other returns Action::Follow. Read more

Source §

🔬This is a nightly-only experimental API. (arbitrary_self_types #44874)

The target type on which the method may be called.

Source §

Available on crate feature propagate-header only.

Propagate a header from the request to the response. Read more

Available on crate feature add-extension only.

Available on crate feature map-request-body only.

Apply a transformation to the request body. Read more

Available on crate feature map-response-body only.

Apply a transformation to the response body. Read more

Available on crate features compression-br or compression-deflate or compression-gzip or compression-zstd only.

Compresses response bodies. Read more

Available on crate features decompression-br or decompression-deflate or decompression-gzip or decompression-zstd only.

Decompress response bodies. Read more

Available on crate feature trace only.

High level tracing that classifies responses using HTTP status codes. Read more

Available on crate feature trace only.

High level tracing that classifies responses using gRPC headers. Read more

Available on crate feature follow-redirect only.

Available on crate feature sensitive-headers only.