pub struct FmtPrinter<'a, 'tcx>(Box<FmtPrinterData<'a, 'tcx>>);
Tuple Fields§
§0: Box<FmtPrinterData<'a, 'tcx>>
Implementations§
source§impl<'a, 'tcx> FmtPrinter<'a, 'tcx>
impl<'a, 'tcx> FmtPrinter<'a, 'tcx>
pub fn new(tcx: TyCtxt<'tcx>, ns: Namespace) -> Self
pub fn print_string( tcx: TyCtxt<'tcx>, ns: Namespace, f: impl FnOnce(&mut Self) -> Result<(), PrintError>, ) -> Result<String, PrintError>
pub fn new_with_limit( tcx: TyCtxt<'tcx>, ns: Namespace, type_length_limit: Limit, ) -> Self
pub fn into_buffer(self) -> String
source§impl<'tcx> FmtPrinter<'_, 'tcx>
impl<'tcx> FmtPrinter<'_, 'tcx>
source§impl<'tcx> FmtPrinter<'_, 'tcx>
impl<'tcx> FmtPrinter<'_, 'tcx>
pub fn name_all_regions<T>( &mut self, value: &Binder<'tcx, T>, ) -> Result<(T, UnordMap<BoundRegion, Region<'tcx>>), Error>
pub fn pretty_in_binder<T>( &mut self, value: &Binder<'tcx, T>, ) -> Result<(), Error>
pub fn pretty_wrap_binder<T, C: FnOnce(&T, &mut Self) -> Result<(), Error>>( &mut self, value: &Binder<'tcx, T>, f: C, ) -> Result<(), Error>
fn prepare_region_info<T>(&mut self, value: &Binder<'tcx, T>)where
T: TypeVisitable<TyCtxt<'tcx>>,
Trait Implementations§
source§impl<'a, 'tcx> Deref for FmtPrinter<'a, 'tcx>
impl<'a, 'tcx> Deref for FmtPrinter<'a, 'tcx>
source§impl DerefMut for FmtPrinter<'_, '_>
impl DerefMut for FmtPrinter<'_, '_>
source§impl<'tcx> PrettyPrinter<'tcx> for FmtPrinter<'_, 'tcx>
impl<'tcx> PrettyPrinter<'tcx> for FmtPrinter<'_, 'tcx>
fn ty_infer_name(&self, id: TyVid) -> Option<Symbol>
fn reset_type_limit(&mut self)
fn const_infer_name(&self, id: ConstVid) -> Option<Symbol>
source§fn print_value_path(
&mut self,
def_id: DefId,
args: &'tcx [GenericArg<'tcx>],
) -> Result<(), PrintError>
fn print_value_path( &mut self, def_id: DefId, args: &'tcx [GenericArg<'tcx>], ) -> Result<(), PrintError>
Like
print_def_path
but for value paths.fn in_binder<T>(&mut self, value: &Binder<'tcx, T>) -> Result<(), PrintError>
fn wrap_binder<T, C: FnOnce(&T, &mut Self) -> Result<(), PrintError>>( &mut self, value: &Binder<'tcx, T>, f: C, ) -> Result<(), PrintError>
source§fn typed_value(
&mut self,
f: impl FnOnce(&mut Self) -> Result<(), PrintError>,
t: impl FnOnce(&mut Self) -> Result<(), PrintError>,
conversion: &str,
) -> Result<(), PrintError>
fn typed_value( &mut self, f: impl FnOnce(&mut Self) -> Result<(), PrintError>, t: impl FnOnce(&mut Self) -> Result<(), PrintError>, conversion: &str, ) -> Result<(), PrintError>
Prints
{f: t}
or {f as t}
depending on the cast
argumentsource§fn generic_delimiters(
&mut self,
f: impl FnOnce(&mut Self) -> Result<(), PrintError>,
) -> Result<(), PrintError>
fn generic_delimiters( &mut self, f: impl FnOnce(&mut Self) -> Result<(), PrintError>, ) -> Result<(), PrintError>
Prints
<...>
around what f
prints.source§fn should_print_region(&self, region: Region<'tcx>) -> bool
fn should_print_region(&self, region: Region<'tcx>) -> bool
Returns
true
if the region should be printed in
optional positions, e.g., &'a T
or dyn Tr + 'b
.
This is typically the case for all non-'_
regions.source§fn pretty_print_const_pointer<Prov: Provenance>(
&mut self,
p: Pointer<Prov>,
ty: Ty<'tcx>,
) -> Result<(), PrintError>
fn pretty_print_const_pointer<Prov: Provenance>( &mut self, p: Pointer<Prov>, ty: Ty<'tcx>, ) -> Result<(), PrintError>
This is overridden for MIR printing because we only want to hide alloc ids from users, not
from MIR where it is actually useful.
source§fn comma_sep<T>(
&mut self,
elems: impl Iterator<Item = T>,
) -> Result<(), PrintError>where
T: Print<'tcx, Self>,
fn comma_sep<T>(
&mut self,
elems: impl Iterator<Item = T>,
) -> Result<(), PrintError>where
T: Print<'tcx, Self>,
Prints comma-separated elements.
source§fn parenthesized(
&mut self,
f: impl FnOnce(&mut Self) -> Result<(), PrintError>,
) -> Result<(), PrintError>
fn parenthesized( &mut self, f: impl FnOnce(&mut Self) -> Result<(), PrintError>, ) -> Result<(), PrintError>
Prints
(...)
around what f
prints.source§fn maybe_parenthesized(
&mut self,
f: impl FnOnce(&mut Self) -> Result<(), PrintError>,
parenthesized: bool,
) -> Result<(), PrintError>
fn maybe_parenthesized( &mut self, f: impl FnOnce(&mut Self) -> Result<(), PrintError>, parenthesized: bool, ) -> Result<(), PrintError>
Prints
(...)
around what f
prints if parenthesized
is true, otherwise just prints f
.source§fn try_print_visible_def_path(
&mut self,
def_id: DefId,
) -> Result<bool, PrintError>
fn try_print_visible_def_path( &mut self, def_id: DefId, ) -> Result<bool, PrintError>
If possible, this returns a global path resolving to
def_id
that is visible
from at least one local module, and returns true
. If the crate defining def_id
is
declared with an extern crate
, the path is guaranteed to use the extern crate
.fn force_print_trimmed_def_path( &mut self, def_id: DefId, ) -> Result<bool, PrintError>
source§fn try_print_trimmed_def_path(
&mut self,
def_id: DefId,
) -> Result<bool, PrintError>
fn try_print_trimmed_def_path( &mut self, def_id: DefId, ) -> Result<bool, PrintError>
Try to see if this path can be trimmed to a unique symbol name.
source§fn try_print_visible_def_path_recur(
&mut self,
def_id: DefId,
callers: &mut Vec<DefId>,
) -> Result<bool, PrintError>
fn try_print_visible_def_path_recur( &mut self, def_id: DefId, callers: &mut Vec<DefId>, ) -> Result<bool, PrintError>
Does the work of
try_print_visible_def_path
, building the
full definition path recursively before attempting to
post-process it into the valid and visible version that
accounts for re-exports. Read morefn pretty_path_qualified( &mut self, self_ty: Ty<'tcx>, trait_ref: Option<TraitRef<'tcx>>, ) -> Result<(), PrintError>
fn pretty_path_append_impl( &mut self, print_prefix: impl FnOnce(&mut Self) -> Result<(), PrintError>, self_ty: Ty<'tcx>, trait_ref: Option<TraitRef<'tcx>>, ) -> Result<(), PrintError>
fn pretty_print_type(&mut self, ty: Ty<'tcx>) -> Result<(), PrintError>
fn pretty_print_opaque_impl_type( &mut self, def_id: DefId, args: GenericArgsRef<'tcx>, ) -> Result<(), PrintError>
source§fn insert_trait_and_projection(
&mut self,
trait_ref: PolyTraitRef<'tcx>,
polarity: PredicatePolarity,
proj_ty: Option<(DefId, Binder<'tcx, Term<'tcx>>)>,
traits: &mut FxIndexMap<(PolyTraitRef<'tcx>, PredicatePolarity), FxIndexMap<DefId, Binder<'tcx, Term<'tcx>>>>,
fn_traits: &mut FxIndexMap<PolyTraitRef<'tcx>, OpaqueFnEntry<'tcx>>,
)
fn insert_trait_and_projection( &mut self, trait_ref: PolyTraitRef<'tcx>, polarity: PredicatePolarity, proj_ty: Option<(DefId, Binder<'tcx, Term<'tcx>>)>, traits: &mut FxIndexMap<(PolyTraitRef<'tcx>, PredicatePolarity), FxIndexMap<DefId, Binder<'tcx, Term<'tcx>>>>, fn_traits: &mut FxIndexMap<PolyTraitRef<'tcx>, OpaqueFnEntry<'tcx>>, )
Insert the trait ref and optionally a projection type associated with it into either the
traits map or fn_traits map, depending on if the trait is in the Fn* family of traits.
fn pretty_print_inherent_projection( &mut self, alias_ty: AliasTerm<'tcx>, ) -> Result<(), PrintError>
fn pretty_print_dyn_existential( &mut self, predicates: &'tcx List<PolyExistentialPredicate<'tcx>>, ) -> Result<(), PrintError>
fn pretty_fn_sig( &mut self, inputs: &[Ty<'tcx>], c_variadic: bool, output: Ty<'tcx>, ) -> Result<(), PrintError>
fn pretty_print_const( &mut self, ct: Const<'tcx>, print_ty: bool, ) -> Result<(), PrintError>
fn pretty_print_const_expr( &mut self, expr: Expr<'tcx>, print_ty: bool, ) -> Result<(), PrintError>
fn pretty_print_const_scalar( &mut self, scalar: Scalar, ty: Ty<'tcx>, ) -> Result<(), PrintError>
fn pretty_print_const_scalar_ptr( &mut self, ptr: Pointer, ty: Ty<'tcx>, ) -> Result<(), PrintError>
fn pretty_print_const_scalar_int( &mut self, int: ScalarInt, ty: Ty<'tcx>, print_ty: bool, ) -> Result<(), PrintError>
fn pretty_print_byte_str( &mut self, byte_str: &'tcx [u8], ) -> Result<(), PrintError>
fn pretty_print_const_valtree( &mut self, valtree: ValTree<'tcx>, ty: Ty<'tcx>, print_ty: bool, ) -> Result<(), PrintError>
fn pretty_closure_as_impl( &mut self, closure: ClosureArgs<TyCtxt<'tcx>>, ) -> Result<(), PrintError>
fn pretty_print_bound_constness( &mut self, constness: BoundConstness, ) -> Result<(), PrintError>
fn should_print_verbose(&self) -> bool
source§impl<'tcx> Printer<'tcx> for FmtPrinter<'_, 'tcx>
impl<'tcx> Printer<'tcx> for FmtPrinter<'_, 'tcx>
fn tcx<'a>(&'a self) -> TyCtxt<'tcx>
fn print_def_path( &mut self, def_id: DefId, args: &'tcx [GenericArg<'tcx>], ) -> Result<(), PrintError>
fn print_region(&mut self, region: Region<'tcx>) -> Result<(), PrintError>
fn print_type(&mut self, ty: Ty<'tcx>) -> Result<(), PrintError>
fn print_dyn_existential( &mut self, predicates: &'tcx List<PolyExistentialPredicate<'tcx>>, ) -> Result<(), PrintError>
fn print_const(&mut self, ct: Const<'tcx>) -> Result<(), PrintError>
fn path_crate(&mut self, cnum: CrateNum) -> Result<(), PrintError>
fn path_qualified( &mut self, self_ty: Ty<'tcx>, trait_ref: Option<TraitRef<'tcx>>, ) -> Result<(), PrintError>
fn path_append_impl( &mut self, print_prefix: impl FnOnce(&mut Self) -> Result<(), PrintError>, _disambiguated_data: &DisambiguatedDefPathData, self_ty: Ty<'tcx>, trait_ref: Option<TraitRef<'tcx>>, ) -> Result<(), PrintError>
fn path_append( &mut self, print_prefix: impl FnOnce(&mut Self) -> Result<(), PrintError>, disambiguated_data: &DisambiguatedDefPathData, ) -> Result<(), PrintError>
fn path_generic_args( &mut self, print_prefix: impl FnOnce(&mut Self) -> Result<(), PrintError>, args: &[GenericArg<'tcx>], ) -> Result<(), PrintError>
fn print_impl_path( &mut self, impl_def_id: DefId, args: &'tcx [GenericArg<'tcx>], self_ty: Ty<'tcx>, trait_ref: Option<TraitRef<'tcx>>, ) -> Result<(), PrintError>
fn default_print_def_path( &mut self, def_id: DefId, args: &'tcx [GenericArg<'tcx>], ) -> Result<(), PrintError>
fn default_print_impl_path( &mut self, impl_def_id: DefId, _args: &'tcx [GenericArg<'tcx>], self_ty: Ty<'tcx>, impl_trait_ref: Option<TraitRef<'tcx>>, ) -> Result<(), PrintError>
Auto Trait Implementations§
impl<'a, 'tcx> Freeze for FmtPrinter<'a, 'tcx>
impl<'a, 'tcx> !RefUnwindSafe for FmtPrinter<'a, 'tcx>
impl<'a, 'tcx> !Send for FmtPrinter<'a, 'tcx>
impl<'a, 'tcx> !Sync for FmtPrinter<'a, 'tcx>
impl<'a, 'tcx> Unpin for FmtPrinter<'a, 'tcx>
impl<'a, 'tcx> !UnwindSafe for FmtPrinter<'a, 'tcx>
Blanket Implementations§
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
Mutably borrows from an owned value. Read more
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<T> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
Creates a filterable data provider with the given name for debugging. Read more
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>
Converts
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>
Converts
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<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
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<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for T
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: 8 bytes