pub struct maybe_unused_trait_imports<'tcx> {
data: PhantomData<&'tcx ()>,
}Fields§
§data: PhantomData<&'tcx ()>Trait Implementations§
source§impl<'tcx> Clone for maybe_unused_trait_imports<'tcx>
impl<'tcx> Clone for maybe_unused_trait_imports<'tcx>
source§fn clone(&self) -> maybe_unused_trait_imports<'tcx>
fn clone(&self) -> maybe_unused_trait_imports<'tcx>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl<'tcx> Default for maybe_unused_trait_imports<'tcx>
impl<'tcx> Default for maybe_unused_trait_imports<'tcx>
source§fn default() -> maybe_unused_trait_imports<'tcx>
fn default() -> maybe_unused_trait_imports<'tcx>
Returns the “default value” for a type. Read more
source§impl<'tcx> QueryConfig<QueryCtxt<'tcx>> for maybe_unused_trait_imports<'tcx>
impl<'tcx> QueryConfig<QueryCtxt<'tcx>> for maybe_unused_trait_imports<'tcx>
type Key = ()
type Value = Erased<impl Copy>
fn name(self) -> &'static str
fn format_value(self) -> fn(_: &Self::Value) -> String
fn cache_on_disk(self, tcx: TyCtxt<'tcx>, key: &Self::Key) -> bool
type Cache = SingleCache<Erased<impl Copy>>
fn query_state<'a>( self, tcx: QueryCtxt<'tcx> ) -> &'a QueryState<Self::Key, DepKind>where QueryCtxt<'tcx>: 'a,
fn query_cache<'a>(self, tcx: QueryCtxt<'tcx>) -> &'a Self::Cachewhere 'tcx: 'a,
fn execute_query(self, tcx: TyCtxt<'tcx>, key: Self::Key) -> Self::Value
fn compute(self, qcx: QueryCtxt<'tcx>, key: Self::Key) -> Self::Value
fn try_load_from_disk( self, _qcx: QueryCtxt<'tcx>, _key: &Self::Key ) -> TryLoadFromDisk<QueryCtxt<'tcx>, Self::Value>
fn loadable_from_disk( self, _qcx: QueryCtxt<'tcx>, _key: &Self::Key, _index: SerializedDepNodeIndex ) -> bool
source§fn value_from_cycle_error(
self,
tcx: TyCtxt<'tcx>,
cycle: &[QueryInfo<DepKind>]
) -> Self::Value
fn value_from_cycle_error( self, tcx: TyCtxt<'tcx>, cycle: &[QueryInfo<DepKind>] ) -> Self::Value
Synthesize an error value to let compilation continue after a cycle.
fn anon(self) -> bool
fn eval_always(self) -> bool
fn depth_limit(self) -> bool
fn feedable(self) -> bool
fn dep_kind(self) -> DepKind
fn handle_cycle_error(self) -> HandleCycleError
fn hash_result(self) -> HashResult<Self::Value>
fn construct_dep_node( self, tcx: <Qcx as HasDepContext>::DepContext, key: &Self::Key ) -> DepNode<<Qcx as HasDepContext>::DepKind>
source§impl<'tcx> QueryConfigRestored<'tcx> for maybe_unused_trait_imports<'tcx>
impl<'tcx> QueryConfigRestored<'tcx> for maybe_unused_trait_imports<'tcx>
type RestoredValue = &'tcx IndexSet<LocalDefId, BuildHasherDefault<FxHasher>>
fn restore(value: Erased<impl Copy>) -> Self::RestoredValue
impl<'tcx> Copy for maybe_unused_trait_imports<'tcx>
Auto Trait Implementations§
impl<'tcx> RefUnwindSafe for maybe_unused_trait_imports<'tcx>
impl<'tcx> Send for maybe_unused_trait_imports<'tcx>
impl<'tcx> Sync for maybe_unused_trait_imports<'tcx>
impl<'tcx> Unpin for maybe_unused_trait_imports<'tcx>
impl<'tcx> UnwindSafe for maybe_unused_trait_imports<'tcx>
Blanket Implementations§
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: 0 bytes