pub struct FullDeps<C, P, B, SC, A: ChainApi> {Show 20 fields
pub client: Arc<C>,
pub pool: Arc<P>,
pub graph: Arc<Pool<A>>,
pub select_chain: SC,
pub chain_spec: Box<dyn ChainSpec>,
pub deny_unsafe: DenyUnsafe,
pub babe: BabeDeps,
pub grandpa: GrandpaDeps<B>,
pub is_authority: bool,
pub network: Arc<NetworkService<Block, Hash>>,
pub fee_history_cache: FeeHistoryCache,
pub fee_history_cache_limit: FeeHistoryCacheLimit,
pub filter_pool: Option<FilterPool>,
pub frontier_backend: Arc<Backend<Block>>,
pub backend: Arc<B>,
pub max_past_logs: u32,
pub target_gas_price: u32,
pub beefy: BeefyDeps,
pub block_data_cache: Arc<EthBlockDataCacheTask<Block>>,
pub overrides: Arc<OverrideHandle<Block>>,
}Expand description
Full client dependencies.
Fields§
§client: Arc<C>The client instance to use.
pool: Arc<P>Transaction pool instance.
graph: Arc<Pool<A>>Graph pool instance.
select_chain: SCThe SelectChain Strategy
chain_spec: Box<dyn ChainSpec>A copy of the chain spec.
deny_unsafe: DenyUnsafeWhether to deny unsafe calls
babe: BabeDepsBABE specific dependencies.
grandpa: GrandpaDeps<B>GRANDPA specific dependencies.
The Node authority flag
network: Arc<NetworkService<Block, Hash>>Network service
fee_history_cache: FeeHistoryCacheFee history cache.
fee_history_cache_limit: FeeHistoryCacheLimitFee history cache limit.
filter_pool: Option<FilterPool>EthFilterApi pool.
frontier_backend: Arc<Backend<Block>>Frontier backend.
backend: Arc<B>Backend.
max_past_logs: u32Maximum number of logs in a query.
target_gas_price: u32Target gas price.
beefy: BeefyDepsBEEFY specific dependencies.
block_data_cache: Arc<EthBlockDataCacheTask<Block>>Block data cache.
overrides: Arc<OverrideHandle<Block>>Ethereum data access overrides.
Auto Trait Implementations§
impl<C, P, B, SC, A> !RefUnwindSafe for FullDeps<C, P, B, SC, A>
impl<C, P, B, SC, A> Send for FullDeps<C, P, B, SC, A>where B: Send + Sync, C: Send + Sync, P: Send + Sync, SC: Send,
impl<C, P, B, SC, A> Sync for FullDeps<C, P, B, SC, A>where B: Send + Sync, C: Send + Sync, P: Send + Sync, SC: Sync,
impl<C, P, B, SC, A> Unpin for FullDeps<C, P, B, SC, A>where SC: Unpin,
impl<C, P, B, SC, A> !UnwindSafe for FullDeps<C, P, B, SC, A>
Blanket Implementations§
source§impl<T> CanUpdate<()> for T
impl<T> CanUpdate<()> for T
source§fn can_remove(&self, _entity: &()) -> bool
fn can_remove(&self, _entity: &()) -> bool
Checks whether the existing entity can be removed.
§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
§fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
fn checked_from<T>(t: T) -> Option<Self>where Self: TryFrom<T>,
§fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T>where Self: TryInto<T>,
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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>
§impl<T> IsType<T> for T
impl<T> IsType<T> for T
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere Self: UniqueSaturatedFrom<T>,
§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere Self: UniqueSaturatedInto<T>,
Consume self to return an equivalent value of
T. Read more§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere T: UncheckedFrom<S>,
§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
The counterpart to
unchecked_from.§impl<T, S> UniqueSaturatedInto<T> for Swhere
T: Bounded,
S: TryInto<T>,
impl<T, S> UniqueSaturatedInto<T> for Swhere T: Bounded, S: TryInto<T>,
§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
Consume self to return an equivalent value of
T.