pub struct Crateify(/* private fields */);Implementations§
Trait Implementations§
Source§impl FullMut for Crateify
impl FullMut for Crateify
Source§fn visit_item_use_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemUse)
fn visit_item_use_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemUse)
Visits syn::ItemUse nodes
Source§fn visit_angle_bracketed_generic_arguments_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut AngleBracketedGenericArguments,
)
fn visit_angle_bracketed_generic_arguments_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut AngleBracketedGenericArguments, )
Visits syn::AngleBracketedGenericArguments nodes
Source§fn visit_assoc_const_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut AssocConst,
)
fn visit_assoc_const_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut AssocConst, )
Visits syn::AssocConst nodes
Source§fn visit_assoc_type_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut AssocType)
fn visit_assoc_type_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut AssocType)
Visits syn::AssocType nodes
Source§fn visit_attr_style_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut AttrStyle)
fn visit_attr_style_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut AttrStyle)
Visits syn::AttrStyle nodes
Source§fn visit_attribute_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Attribute)
fn visit_attribute_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Attribute)
Visits syn::Attribute nodes
Source§fn visit_bare_fn_arg_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut BareFnArg)
fn visit_bare_fn_arg_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut BareFnArg)
Visits syn::BareFnArg nodes
Source§fn visit_bare_variadic_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut BareVariadic,
)
fn visit_bare_variadic_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut BareVariadic, )
Visits syn::BareVariadic nodes
Source§fn visit_bin_op_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut BinOp)
fn visit_bin_op_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut BinOp)
Visits syn::BinOp nodes
Source§fn visit_block_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Block)
fn visit_block_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Block)
Visits syn::Block nodes
Source§fn visit_bound_lifetimes_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut BoundLifetimes,
)
fn visit_bound_lifetimes_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut BoundLifetimes, )
Visits syn::BoundLifetimes nodes
Source§fn visit_captured_param_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut CapturedParam,
)
fn visit_captured_param_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut CapturedParam, )
Visits syn::CapturedParam nodes
Source§fn visit_const_param_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ConstParam,
)
fn visit_const_param_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ConstParam, )
Visits syn::ConstParam nodes
Source§fn visit_constraint_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Constraint)
fn visit_constraint_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Constraint)
Visits syn::Constraint nodes
Source§fn visit_data_enum_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut DataEnum)
fn visit_data_enum_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut DataEnum)
Visits syn::DataEnum nodes
Source§fn visit_data_struct_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut DataStruct,
)
fn visit_data_struct_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut DataStruct, )
Visits syn::DataStruct nodes
Source§fn visit_data_union_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut DataUnion)
fn visit_data_union_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut DataUnion)
Visits syn::DataUnion nodes
Source§fn visit_derive_input_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut DeriveInput,
)
fn visit_derive_input_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut DeriveInput, )
Visits syn::DeriveInput nodes
Source§fn visit_expr_array_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprArray)
fn visit_expr_array_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprArray)
Visits syn::ExprArray nodes
Source§fn visit_expr_assign_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ExprAssign,
)
fn visit_expr_assign_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ExprAssign, )
Visits syn::ExprAssign nodes
Source§fn visit_expr_async_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprAsync)
fn visit_expr_async_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprAsync)
Visits syn::ExprAsync nodes
Source§fn visit_expr_await_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprAwait)
fn visit_expr_await_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprAwait)
Visits syn::ExprAwait nodes
Source§fn visit_expr_binary_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ExprBinary,
)
fn visit_expr_binary_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ExprBinary, )
Visits syn::ExprBinary nodes
Source§fn visit_expr_block_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprBlock)
fn visit_expr_block_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprBlock)
Visits syn::ExprBlock nodes
Source§fn visit_expr_break_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprBreak)
fn visit_expr_break_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprBreak)
Visits syn::ExprBreak nodes
Source§fn visit_expr_call_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprCall)
fn visit_expr_call_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprCall)
Visits syn::ExprCall nodes
Source§fn visit_expr_cast_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprCast)
fn visit_expr_cast_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprCast)
Visits syn::ExprCast nodes
Source§fn visit_expr_closure_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ExprClosure,
)
fn visit_expr_closure_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ExprClosure, )
Visits syn::ExprClosure nodes
Source§fn visit_expr_const_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprConst)
fn visit_expr_const_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprConst)
Visits syn::ExprConst nodes
Source§fn visit_expr_continue_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ExprContinue,
)
fn visit_expr_continue_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ExprContinue, )
Visits syn::ExprContinue nodes
Source§fn visit_expr_field_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprField)
fn visit_expr_field_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprField)
Visits syn::ExprField nodes
Source§fn visit_expr_for_loop_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ExprForLoop,
)
fn visit_expr_for_loop_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ExprForLoop, )
Visits syn::ExprForLoop nodes
Source§fn visit_expr_group_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprGroup)
fn visit_expr_group_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprGroup)
Visits syn::ExprGroup nodes
Source§fn visit_expr_if_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprIf)
fn visit_expr_if_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprIf)
Visits syn::ExprIf nodes
Source§fn visit_expr_index_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprIndex)
fn visit_expr_index_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprIndex)
Visits syn::ExprIndex nodes
Source§fn visit_expr_infer_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprInfer)
fn visit_expr_infer_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprInfer)
Visits syn::ExprInfer nodes
Source§fn visit_expr_let_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprLet)
fn visit_expr_let_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprLet)
Visits syn::ExprLet nodes
Source§fn visit_expr_lit_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprLit)
fn visit_expr_lit_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprLit)
Visits syn::ExprLit nodes
Source§fn visit_expr_loop_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprLoop)
fn visit_expr_loop_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprLoop)
Visits syn::ExprLoop nodes
Source§fn visit_expr_macro_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprMacro)
fn visit_expr_macro_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprMacro)
Visits syn::ExprMacro nodes
Source§fn visit_expr_match_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprMatch)
fn visit_expr_match_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprMatch)
Visits syn::ExprMatch nodes
Source§fn visit_expr_method_call_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ExprMethodCall,
)
fn visit_expr_method_call_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ExprMethodCall, )
Visits syn::ExprMethodCall nodes
Source§fn visit_expr_paren_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprParen)
fn visit_expr_paren_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprParen)
Visits syn::ExprParen nodes
Source§fn visit_expr_path_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprPath)
fn visit_expr_path_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprPath)
Visits syn::ExprPath nodes
Source§fn visit_expr_range_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprRange)
fn visit_expr_range_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprRange)
Visits syn::ExprRange nodes
Source§fn visit_expr_raw_addr_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ExprRawAddr,
)
fn visit_expr_raw_addr_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ExprRawAddr, )
Visits syn::ExprRawAddr nodes
Source§fn visit_expr_reference_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ExprReference,
)
fn visit_expr_reference_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ExprReference, )
Visits syn::ExprReference nodes
Source§fn visit_expr_repeat_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ExprRepeat,
)
fn visit_expr_repeat_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ExprRepeat, )
Visits syn::ExprRepeat nodes
Source§fn visit_expr_return_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ExprReturn,
)
fn visit_expr_return_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ExprReturn, )
Visits syn::ExprReturn nodes
Source§fn visit_expr_struct_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ExprStruct,
)
fn visit_expr_struct_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ExprStruct, )
Visits syn::ExprStruct nodes
Source§fn visit_expr_try_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprTry)
fn visit_expr_try_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprTry)
Visits syn::ExprTry nodes
Source§fn visit_expr_try_block_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ExprTryBlock,
)
fn visit_expr_try_block_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ExprTryBlock, )
Visits syn::ExprTryBlock nodes
Source§fn visit_expr_tuple_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprTuple)
fn visit_expr_tuple_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprTuple)
Visits syn::ExprTuple nodes
Source§fn visit_expr_unary_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprUnary)
fn visit_expr_unary_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprUnary)
Visits syn::ExprUnary nodes
Source§fn visit_expr_unsafe_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ExprUnsafe,
)
fn visit_expr_unsafe_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ExprUnsafe, )
Visits syn::ExprUnsafe nodes
Source§fn visit_expr_while_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprWhile)
fn visit_expr_while_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprWhile)
Visits syn::ExprWhile nodes
Source§fn visit_expr_yield_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprYield)
fn visit_expr_yield_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ExprYield)
Visits syn::ExprYield nodes
Source§fn visit_field_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Field)
fn visit_field_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Field)
Visits syn::Field nodes
Source§fn visit_field_mutability_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut FieldMutability,
)
fn visit_field_mutability_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut FieldMutability, )
Visits syn::FieldMutability nodes
Source§fn visit_field_pat_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut FieldPat)
fn visit_field_pat_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut FieldPat)
Visits syn::FieldPat nodes
Source§fn visit_field_value_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut FieldValue,
)
fn visit_field_value_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut FieldValue, )
Visits syn::FieldValue nodes
Source§fn visit_fields_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Fields)
fn visit_fields_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Fields)
Visits syn::Fields nodes
Source§fn visit_fields_named_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut FieldsNamed,
)
fn visit_fields_named_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut FieldsNamed, )
Visits syn::FieldsNamed nodes
Source§fn visit_fields_unnamed_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut FieldsUnnamed,
)
fn visit_fields_unnamed_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut FieldsUnnamed, )
Visits syn::FieldsUnnamed nodes
Source§fn visit_fn_arg_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut FnArg)
fn visit_fn_arg_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut FnArg)
Visits syn::FnArg nodes
Source§fn visit_foreign_item_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ForeignItem,
)
fn visit_foreign_item_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ForeignItem, )
Visits syn::ForeignItem nodes
Source§fn visit_foreign_item_fn_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ForeignItemFn,
)
fn visit_foreign_item_fn_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ForeignItemFn, )
Visits syn::ForeignItemFn nodes
Source§fn visit_foreign_item_macro_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ForeignItemMacro,
)
fn visit_foreign_item_macro_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ForeignItemMacro, )
Visits syn::ForeignItemMacro nodes
Source§fn visit_foreign_item_static_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ForeignItemStatic,
)
fn visit_foreign_item_static_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ForeignItemStatic, )
Visits syn::ForeignItemStatic nodes
Source§fn visit_foreign_item_type_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ForeignItemType,
)
fn visit_foreign_item_type_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ForeignItemType, )
Visits syn::ForeignItemType nodes
Source§fn visit_generic_argument_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut GenericArgument,
)
fn visit_generic_argument_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut GenericArgument, )
Visits syn::GenericArgument nodes
Source§fn visit_generic_param_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut GenericParam,
)
fn visit_generic_param_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut GenericParam, )
Visits syn::GenericParam nodes
Source§fn visit_generics_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Generics)
fn visit_generics_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Generics)
Visits syn::Generics nodes
Source§fn visit_ident_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Ident)
fn visit_ident_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Ident)
Visits proc_macro2::Ident nodes
Source§fn visit_impl_item_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ImplItem)
fn visit_impl_item_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ImplItem)
Visits syn::ImplItem nodes
Source§fn visit_impl_item_const_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ImplItemConst,
)
fn visit_impl_item_const_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ImplItemConst, )
Visits syn::ImplItemConst nodes
Source§fn visit_impl_item_fn_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ImplItemFn,
)
fn visit_impl_item_fn_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ImplItemFn, )
Visits syn::ImplItemFn nodes
Source§fn visit_impl_item_macro_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ImplItemMacro,
)
fn visit_impl_item_macro_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ImplItemMacro, )
Visits syn::ImplItemMacro nodes
Source§fn visit_impl_item_type_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ImplItemType,
)
fn visit_impl_item_type_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ImplItemType, )
Visits syn::ImplItemType nodes
Source§fn visit_impl_restriction_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ImplRestriction,
)
fn visit_impl_restriction_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ImplRestriction, )
Visits syn::ImplRestriction nodes
Source§fn visit_index_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Index)
fn visit_index_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Index)
Visits syn::Index nodes
Source§fn visit_item_const_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemConst)
fn visit_item_const_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemConst)
Visits syn::ItemConst nodes
Source§fn visit_item_enum_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemEnum)
fn visit_item_enum_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemEnum)
Visits syn::ItemEnum nodes
Source§fn visit_item_extern_crate_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ItemExternCrate,
)
fn visit_item_extern_crate_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ItemExternCrate, )
Visits syn::ItemExternCrate nodes
Source§fn visit_item_fn_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemFn)
fn visit_item_fn_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemFn)
Visits syn::ItemFn nodes
Source§fn visit_item_foreign_mod_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ItemForeignMod,
)
fn visit_item_foreign_mod_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ItemForeignMod, )
Visits syn::ItemForeignMod nodes
Source§fn visit_item_impl_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemImpl)
fn visit_item_impl_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemImpl)
Visits syn::ItemImpl nodes
Source§fn visit_item_macro_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemMacro)
fn visit_item_macro_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemMacro)
Visits syn::ItemMacro nodes
Source§fn visit_item_mod_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemMod)
fn visit_item_mod_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemMod)
Visits syn::ItemMod nodes
Source§fn visit_item_static_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ItemStatic,
)
fn visit_item_static_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ItemStatic, )
Visits syn::ItemStatic nodes
Source§fn visit_item_struct_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ItemStruct,
)
fn visit_item_struct_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ItemStruct, )
Visits syn::ItemStruct nodes
Source§fn visit_item_trait_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemTrait)
fn visit_item_trait_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemTrait)
Visits syn::ItemTrait nodes
Source§fn visit_item_trait_alias_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ItemTraitAlias,
)
fn visit_item_trait_alias_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ItemTraitAlias, )
Visits syn::ItemTraitAlias nodes
Source§fn visit_item_type_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemType)
fn visit_item_type_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemType)
Visits syn::ItemType nodes
Source§fn visit_item_union_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemUnion)
fn visit_item_union_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut ItemUnion)
Visits syn::ItemUnion nodes
Source§fn visit_label_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Label)
fn visit_label_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Label)
Visits syn::Label nodes
Source§fn visit_lifetime_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Lifetime)
fn visit_lifetime_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Lifetime)
Visits syn::Lifetime nodes
Source§fn visit_lifetime_param_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut LifetimeParam,
)
fn visit_lifetime_param_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut LifetimeParam, )
Visits syn::LifetimeParam nodes
Source§fn visit_lit_bool_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitBool)
fn visit_lit_bool_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitBool)
Visits syn::LitBool nodes
Source§fn visit_lit_byte_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitByte)
fn visit_lit_byte_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitByte)
Visits syn::LitByte nodes
Source§fn visit_lit_byte_str_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut LitByteStr,
)
fn visit_lit_byte_str_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut LitByteStr, )
Visits syn::LitByteStr nodes
Source§fn visit_lit_cstr_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitCStr)
fn visit_lit_cstr_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitCStr)
Visits syn::LitCStr nodes
Source§fn visit_lit_char_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitChar)
fn visit_lit_char_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitChar)
Visits syn::LitChar nodes
Source§fn visit_lit_float_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitFloat)
fn visit_lit_float_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitFloat)
Visits syn::LitFloat nodes
Source§fn visit_lit_int_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitInt)
fn visit_lit_int_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitInt)
Visits syn::LitInt nodes
Source§fn visit_lit_str_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitStr)
fn visit_lit_str_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LitStr)
Visits syn::LitStr nodes
Source§fn visit_local_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Local)
fn visit_local_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Local)
Visits syn::Local nodes
Source§fn visit_local_init_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LocalInit)
fn visit_local_init_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut LocalInit)
Visits syn::LocalInit nodes
Source§fn visit_macro_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Macro)
fn visit_macro_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Macro)
Visits syn::Macro nodes
Source§fn visit_macro_delimiter_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut MacroDelimiter,
)
fn visit_macro_delimiter_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut MacroDelimiter, )
Visits syn::MacroDelimiter nodes
Source§fn visit_member_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Member)
fn visit_member_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Member)
Visits syn::Member nodes
Source§fn visit_meta_list_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut MetaList)
fn visit_meta_list_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut MetaList)
Visits syn::MetaList nodes
Source§fn visit_meta_name_value_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut MetaNameValue,
)
fn visit_meta_name_value_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut MetaNameValue, )
Visits syn::MetaNameValue nodes
Source§fn visit_parenthesized_generic_arguments_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ParenthesizedGenericArguments,
)
fn visit_parenthesized_generic_arguments_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ParenthesizedGenericArguments, )
Visits syn::ParenthesizedGenericArguments nodes
Source§fn visit_pat_ident_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatIdent)
fn visit_pat_ident_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatIdent)
Visits syn::PatIdent nodes
Source§fn visit_pat_or_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatOr)
fn visit_pat_or_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatOr)
Visits syn::PatOr nodes
Source§fn visit_pat_paren_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatParen)
fn visit_pat_paren_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatParen)
Visits syn::PatParen nodes
Source§fn visit_pat_reference_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut PatReference,
)
fn visit_pat_reference_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut PatReference, )
Visits syn::PatReference nodes
Source§fn visit_pat_rest_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatRest)
fn visit_pat_rest_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatRest)
Visits syn::PatRest nodes
Source§fn visit_pat_slice_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatSlice)
fn visit_pat_slice_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatSlice)
Visits syn::PatSlice nodes
Source§fn visit_pat_struct_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatStruct)
fn visit_pat_struct_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatStruct)
Visits syn::PatStruct nodes
Source§fn visit_pat_tuple_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatTuple)
fn visit_pat_tuple_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatTuple)
Visits syn::PatTuple nodes
Source§fn visit_pat_tuple_struct_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut PatTupleStruct,
)
fn visit_pat_tuple_struct_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut PatTupleStruct, )
Visits syn::PatTupleStruct nodes
Source§fn visit_pat_type_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatType)
fn visit_pat_type_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatType)
Visits syn::PatType nodes
Source§fn visit_pat_wild_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatWild)
fn visit_pat_wild_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut PatWild)
Visits syn::PatWild nodes
Source§fn visit_path_arguments_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut PathArguments,
)
fn visit_path_arguments_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut PathArguments, )
Visits syn::PathArguments nodes
Source§fn visit_path_segment_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut PathSegment,
)
fn visit_path_segment_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut PathSegment, )
Visits syn::PathSegment nodes
Source§fn visit_pointer_mutability_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut PointerMutability,
)
fn visit_pointer_mutability_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut PointerMutability, )
Visits syn::PointerMutability nodes
Source§fn visit_precise_capture_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut PreciseCapture,
)
fn visit_precise_capture_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut PreciseCapture, )
Visits syn::PreciseCapture nodes
Source§fn visit_predicate_lifetime_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut PredicateLifetime,
)
fn visit_predicate_lifetime_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut PredicateLifetime, )
Visits syn::PredicateLifetime nodes
Source§fn visit_predicate_type_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut PredicateType,
)
fn visit_predicate_type_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut PredicateType, )
Visits syn::PredicateType nodes
Source§fn visit_qself_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut QSelf)
fn visit_qself_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut QSelf)
Visits syn::QSelf nodes
Source§fn visit_range_limits_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut RangeLimits,
)
fn visit_range_limits_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut RangeLimits, )
Visits syn::RangeLimits nodes
Source§fn visit_receiver_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Receiver)
fn visit_receiver_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Receiver)
Visits syn::Receiver nodes
Source§fn visit_return_type_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut ReturnType,
)
fn visit_return_type_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut ReturnType, )
Visits syn::ReturnType nodes
Source§fn visit_signature_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Signature)
fn visit_signature_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Signature)
Visits syn::Signature nodes
Source§fn visit_static_mutability_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut StaticMutability,
)
fn visit_static_mutability_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut StaticMutability, )
Visits syn::StaticMutability nodes
Source§fn visit_stmt_macro_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut StmtMacro)
fn visit_stmt_macro_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut StmtMacro)
Visits syn::StmtMacro nodes
Source§fn visit_token_stream_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut TokenStream,
)
fn visit_token_stream_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut TokenStream, )
Visits proc_macro2::TokenStream nodes
Source§fn visit_trait_bound_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut TraitBound,
)
fn visit_trait_bound_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut TraitBound, )
Visits syn::TraitBound nodes
Source§fn visit_trait_bound_modifier_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut TraitBoundModifier,
)
fn visit_trait_bound_modifier_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut TraitBoundModifier, )
Visits syn::TraitBoundModifier nodes
Source§fn visit_trait_item_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TraitItem)
fn visit_trait_item_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TraitItem)
Visits syn::TraitItem nodes
Source§fn visit_trait_item_const_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut TraitItemConst,
)
fn visit_trait_item_const_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut TraitItemConst, )
Visits syn::TraitItemConst nodes
Source§fn visit_trait_item_fn_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut TraitItemFn,
)
fn visit_trait_item_fn_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut TraitItemFn, )
Visits syn::TraitItemFn nodes
Source§fn visit_trait_item_macro_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut TraitItemMacro,
)
fn visit_trait_item_macro_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut TraitItemMacro, )
Visits syn::TraitItemMacro nodes
Source§fn visit_trait_item_type_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut TraitItemType,
)
fn visit_trait_item_type_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut TraitItemType, )
Visits syn::TraitItemType nodes
Source§fn visit_type_array_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeArray)
fn visit_type_array_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeArray)
Visits syn::TypeArray nodes
Source§fn visit_type_bare_fn_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut TypeBareFn,
)
fn visit_type_bare_fn_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut TypeBareFn, )
Visits syn::TypeBareFn nodes
Source§fn visit_type_group_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeGroup)
fn visit_type_group_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeGroup)
Visits syn::TypeGroup nodes
Source§fn visit_type_impl_trait_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut TypeImplTrait,
)
fn visit_type_impl_trait_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut TypeImplTrait, )
Visits syn::TypeImplTrait nodes
Source§fn visit_type_infer_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeInfer)
fn visit_type_infer_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeInfer)
Visits syn::TypeInfer nodes
Source§fn visit_type_macro_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeMacro)
fn visit_type_macro_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeMacro)
Visits syn::TypeMacro nodes
Source§fn visit_type_never_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeNever)
fn visit_type_never_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeNever)
Visits syn::TypeNever nodes
Source§fn visit_type_param_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeParam)
fn visit_type_param_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeParam)
Visits syn::TypeParam nodes
Source§fn visit_type_param_bound_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut TypeParamBound,
)
fn visit_type_param_bound_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut TypeParamBound, )
Visits syn::TypeParamBound nodes
Source§fn visit_type_paren_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeParen)
fn visit_type_paren_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeParen)
Visits syn::TypeParen nodes
Source§fn visit_type_path_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypePath)
fn visit_type_path_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypePath)
Visits syn::TypePath nodes
Source§fn visit_type_ptr_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypePtr)
fn visit_type_ptr_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypePtr)
Visits syn::TypePtr nodes
Source§fn visit_type_reference_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut TypeReference,
)
fn visit_type_reference_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut TypeReference, )
Visits syn::TypeReference nodes
Source§fn visit_type_slice_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeSlice)
fn visit_type_slice_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeSlice)
Visits syn::TypeSlice nodes
Source§fn visit_type_trait_object_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut TypeTraitObject,
)
fn visit_type_trait_object_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut TypeTraitObject, )
Visits syn::TypeTraitObject nodes
Source§fn visit_type_tuple_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeTuple)
fn visit_type_tuple_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut TypeTuple)
Visits syn::TypeTuple nodes
Source§fn visit_use_glob_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut UseGlob)
fn visit_use_glob_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut UseGlob)
Visits syn::UseGlob nodes
Source§fn visit_use_group_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut UseGroup)
fn visit_use_group_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut UseGroup)
Visits syn::UseGroup nodes
Source§fn visit_use_name_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut UseName)
fn visit_use_name_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut UseName)
Visits syn::UseName nodes
Source§fn visit_use_path_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut UsePath)
fn visit_use_path_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut UsePath)
Visits syn::UsePath nodes
Source§fn visit_use_rename_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut UseRename)
fn visit_use_rename_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut UseRename)
Visits syn::UseRename nodes
Source§fn visit_use_tree_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut UseTree)
fn visit_use_tree_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut UseTree)
Visits syn::UseTree nodes
Source§fn visit_variadic_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Variadic)
fn visit_variadic_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Variadic)
Visits syn::Variadic nodes
Source§fn visit_variant_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Variant)
fn visit_variant_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Variant)
Visits syn::Variant nodes
Source§fn visit_vis_restricted_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut VisRestricted,
)
fn visit_vis_restricted_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut VisRestricted, )
Visits syn::VisRestricted nodes
Source§fn visit_visibility_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Visibility)
fn visit_visibility_mut<D>(visitor: Visitor<'_, D, Self>, node: &mut Visibility)
Visits syn::Visibility nodes
Source§fn visit_where_clause_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut WhereClause,
)
fn visit_where_clause_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut WhereClause, )
Visits syn::WhereClause nodes
Source§fn visit_where_predicate_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut WherePredicate,
)
fn visit_where_predicate_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut WherePredicate, )
Visits syn::WherePredicate nodes
Source§fn visit_generics_enter_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut GenericsEnter,
)
fn visit_generics_enter_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut GenericsEnter, )
Visits crate::syn::GenericsEnter nodes
Source§fn visit_generics_exit_mut<D>(
visitor: Visitor<'_, D, Self>,
node: &mut GenericsExit,
)
fn visit_generics_exit_mut<D>( visitor: Visitor<'_, D, Self>, node: &mut GenericsExit, )
Visits crate::syn::GenericsExit nodes
Auto Trait Implementations§
impl Freeze for Crateify
impl RefUnwindSafe for Crateify
impl !Send for Crateify
impl !Sync for Crateify
impl Unpin for Crateify
impl UnwindSafe for Crateify
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> VisitMut<Abi> for T
impl<T> VisitMut<Abi> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Abi)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Abi)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<AngleBracketedGenericArguments> for T
impl<T> VisitMut<AngleBracketedGenericArguments> for T
Source§fn visit_mut<D>(
visitor: Visitor<'_, D, T>,
node: &mut AngleBracketedGenericArguments,
)
fn visit_mut<D>( visitor: Visitor<'_, D, T>, node: &mut AngleBracketedGenericArguments, )
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Arm> for T
impl<T> VisitMut<Arm> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Arm)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Arm)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<AssocConst> for T
impl<T> VisitMut<AssocConst> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut AssocConst)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut AssocConst)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<AssocType> for T
impl<T> VisitMut<AssocType> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut AssocType)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut AssocType)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<AttrStyle> for T
impl<T> VisitMut<AttrStyle> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut AttrStyle)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut AttrStyle)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Attribute> for T
impl<T> VisitMut<Attribute> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Attribute)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Attribute)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<BareFnArg> for T
impl<T> VisitMut<BareFnArg> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut BareFnArg)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut BareFnArg)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<BareVariadic> for T
impl<T> VisitMut<BareVariadic> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut BareVariadic)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut BareVariadic)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<BinOp> for T
impl<T> VisitMut<BinOp> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut BinOp)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut BinOp)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Block> for T
impl<T> VisitMut<Block> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Block)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Block)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<BoundLifetimes> for T
impl<T> VisitMut<BoundLifetimes> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut BoundLifetimes)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut BoundLifetimes)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<CapturedParam> for T
impl<T> VisitMut<CapturedParam> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut CapturedParam)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut CapturedParam)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ConstParam> for T
impl<T> VisitMut<ConstParam> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ConstParam)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ConstParam)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Constraint> for T
impl<T> VisitMut<Constraint> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Constraint)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Constraint)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Data> for T
impl<T> VisitMut<Data> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Data)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Data)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<DataEnum> for T
impl<T> VisitMut<DataEnum> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut DataEnum)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut DataEnum)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<DataStruct> for T
impl<T> VisitMut<DataStruct> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut DataStruct)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut DataStruct)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<DataUnion> for T
impl<T> VisitMut<DataUnion> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut DataUnion)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut DataUnion)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<DeriveInput> for T
impl<T> VisitMut<DeriveInput> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut DeriveInput)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut DeriveInput)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Expr> for T
impl<T> VisitMut<Expr> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Expr)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Expr)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprArray> for T
impl<T> VisitMut<ExprArray> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprArray)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprArray)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprAssign> for T
impl<T> VisitMut<ExprAssign> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprAssign)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprAssign)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprAsync> for T
impl<T> VisitMut<ExprAsync> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprAsync)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprAsync)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprAwait> for T
impl<T> VisitMut<ExprAwait> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprAwait)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprAwait)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprBinary> for T
impl<T> VisitMut<ExprBinary> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprBinary)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprBinary)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprBlock> for T
impl<T> VisitMut<ExprBlock> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprBlock)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprBlock)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprBreak> for T
impl<T> VisitMut<ExprBreak> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprBreak)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprBreak)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprCall> for T
impl<T> VisitMut<ExprCall> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprCall)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprCall)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprCast> for T
impl<T> VisitMut<ExprCast> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprCast)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprCast)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprClosure> for T
impl<T> VisitMut<ExprClosure> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprClosure)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprClosure)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprConst> for T
impl<T> VisitMut<ExprConst> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprConst)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprConst)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprContinue> for T
impl<T> VisitMut<ExprContinue> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprContinue)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprContinue)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprField> for T
impl<T> VisitMut<ExprField> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprField)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprField)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprForLoop> for T
impl<T> VisitMut<ExprForLoop> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprForLoop)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprForLoop)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprGroup> for T
impl<T> VisitMut<ExprGroup> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprGroup)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprGroup)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprIf> for T
impl<T> VisitMut<ExprIf> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprIf)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprIf)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprIndex> for T
impl<T> VisitMut<ExprIndex> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprIndex)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprIndex)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprInfer> for T
impl<T> VisitMut<ExprInfer> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprInfer)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprInfer)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprLet> for T
impl<T> VisitMut<ExprLet> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprLet)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprLet)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprLit> for T
impl<T> VisitMut<ExprLit> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprLit)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprLit)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprLoop> for T
impl<T> VisitMut<ExprLoop> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprLoop)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprLoop)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprMacro> for T
impl<T> VisitMut<ExprMacro> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprMacro)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprMacro)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprMatch> for T
impl<T> VisitMut<ExprMatch> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprMatch)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprMatch)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprMethodCall> for T
impl<T> VisitMut<ExprMethodCall> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprMethodCall)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprMethodCall)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprParen> for T
impl<T> VisitMut<ExprParen> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprParen)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprParen)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprPath> for T
impl<T> VisitMut<ExprPath> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprPath)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprPath)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprRange> for T
impl<T> VisitMut<ExprRange> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprRange)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprRange)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprRawAddr> for T
impl<T> VisitMut<ExprRawAddr> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprRawAddr)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprRawAddr)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprReference> for T
impl<T> VisitMut<ExprReference> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprReference)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprReference)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprRepeat> for T
impl<T> VisitMut<ExprRepeat> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprRepeat)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprRepeat)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprReturn> for T
impl<T> VisitMut<ExprReturn> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprReturn)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprReturn)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprStruct> for T
impl<T> VisitMut<ExprStruct> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprStruct)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprStruct)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprTry> for T
impl<T> VisitMut<ExprTry> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprTry)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprTry)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprTryBlock> for T
impl<T> VisitMut<ExprTryBlock> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprTryBlock)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprTryBlock)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprTuple> for T
impl<T> VisitMut<ExprTuple> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprTuple)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprTuple)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprUnary> for T
impl<T> VisitMut<ExprUnary> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprUnary)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprUnary)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprUnsafe> for T
impl<T> VisitMut<ExprUnsafe> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprUnsafe)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprUnsafe)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprWhile> for T
impl<T> VisitMut<ExprWhile> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprWhile)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprWhile)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ExprYield> for T
impl<T> VisitMut<ExprYield> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprYield)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ExprYield)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Field> for T
impl<T> VisitMut<Field> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Field)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Field)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<FieldMutability> for T
impl<T> VisitMut<FieldMutability> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut FieldMutability)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut FieldMutability)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<FieldPat> for T
impl<T> VisitMut<FieldPat> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut FieldPat)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut FieldPat)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<FieldValue> for T
impl<T> VisitMut<FieldValue> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut FieldValue)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut FieldValue)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Fields> for T
impl<T> VisitMut<Fields> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Fields)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Fields)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<FieldsNamed> for T
impl<T> VisitMut<FieldsNamed> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut FieldsNamed)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut FieldsNamed)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<FieldsUnnamed> for T
impl<T> VisitMut<FieldsUnnamed> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut FieldsUnnamed)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut FieldsUnnamed)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<File> for T
impl<T> VisitMut<File> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut File)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut File)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<FnArg> for T
impl<T> VisitMut<FnArg> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut FnArg)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut FnArg)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ForeignItem> for T
impl<T> VisitMut<ForeignItem> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ForeignItem)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ForeignItem)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ForeignItemFn> for T
impl<T> VisitMut<ForeignItemFn> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ForeignItemFn)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ForeignItemFn)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ForeignItemMacro> for T
impl<T> VisitMut<ForeignItemMacro> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ForeignItemMacro)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ForeignItemMacro)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ForeignItemStatic> for T
impl<T> VisitMut<ForeignItemStatic> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ForeignItemStatic)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ForeignItemStatic)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ForeignItemType> for T
impl<T> VisitMut<ForeignItemType> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ForeignItemType)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ForeignItemType)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<GenericArgument> for T
impl<T> VisitMut<GenericArgument> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut GenericArgument)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut GenericArgument)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<GenericParam> for T
impl<T> VisitMut<GenericParam> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut GenericParam)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut GenericParam)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Generics> for T
impl<T> VisitMut<Generics> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Generics)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Generics)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<GenericsEnter> for T
impl<T> VisitMut<GenericsEnter> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut GenericsEnter)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut GenericsEnter)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<GenericsExit> for T
impl<T> VisitMut<GenericsExit> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut GenericsExit)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut GenericsExit)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Ident> for T
impl<T> VisitMut<Ident> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Ident)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Ident)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ImplItem> for T
impl<T> VisitMut<ImplItem> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ImplItem)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ImplItem)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ImplItemConst> for T
impl<T> VisitMut<ImplItemConst> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ImplItemConst)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ImplItemConst)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ImplItemFn> for T
impl<T> VisitMut<ImplItemFn> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ImplItemFn)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ImplItemFn)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ImplItemMacro> for T
impl<T> VisitMut<ImplItemMacro> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ImplItemMacro)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ImplItemMacro)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ImplItemType> for T
impl<T> VisitMut<ImplItemType> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ImplItemType)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ImplItemType)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ImplRestriction> for T
impl<T> VisitMut<ImplRestriction> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ImplRestriction)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ImplRestriction)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Index> for T
impl<T> VisitMut<Index> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Index)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Index)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Item> for T
impl<T> VisitMut<Item> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Item)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Item)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemConst> for T
impl<T> VisitMut<ItemConst> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemConst)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemConst)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemEnum> for T
impl<T> VisitMut<ItemEnum> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemEnum)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemEnum)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemExternCrate> for T
impl<T> VisitMut<ItemExternCrate> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemExternCrate)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemExternCrate)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemFn> for T
impl<T> VisitMut<ItemFn> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemFn)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemFn)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemForeignMod> for T
impl<T> VisitMut<ItemForeignMod> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemForeignMod)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemForeignMod)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemImpl> for T
impl<T> VisitMut<ItemImpl> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemImpl)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemImpl)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemMacro> for T
impl<T> VisitMut<ItemMacro> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemMacro)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemMacro)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemMod> for T
impl<T> VisitMut<ItemMod> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemMod)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemMod)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemStatic> for T
impl<T> VisitMut<ItemStatic> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemStatic)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemStatic)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemStruct> for T
impl<T> VisitMut<ItemStruct> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemStruct)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemStruct)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemTrait> for T
impl<T> VisitMut<ItemTrait> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemTrait)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemTrait)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemTraitAlias> for T
impl<T> VisitMut<ItemTraitAlias> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemTraitAlias)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemTraitAlias)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemType> for T
impl<T> VisitMut<ItemType> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemType)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemType)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemUnion> for T
impl<T> VisitMut<ItemUnion> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemUnion)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemUnion)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ItemUse> for T
impl<T> VisitMut<ItemUse> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemUse)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ItemUse)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Label> for T
impl<T> VisitMut<Label> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Label)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Label)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Lifetime> for T
impl<T> VisitMut<Lifetime> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Lifetime)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Lifetime)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<LifetimeParam> for T
impl<T> VisitMut<LifetimeParam> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LifetimeParam)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LifetimeParam)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Lit> for T
impl<T> VisitMut<Lit> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Lit)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Lit)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<LitBool> for T
impl<T> VisitMut<LitBool> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitBool)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitBool)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<LitByte> for T
impl<T> VisitMut<LitByte> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitByte)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitByte)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<LitByteStr> for T
impl<T> VisitMut<LitByteStr> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitByteStr)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitByteStr)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<LitCStr> for T
impl<T> VisitMut<LitCStr> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitCStr)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitCStr)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<LitChar> for T
impl<T> VisitMut<LitChar> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitChar)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitChar)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<LitFloat> for T
impl<T> VisitMut<LitFloat> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitFloat)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitFloat)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<LitInt> for T
impl<T> VisitMut<LitInt> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitInt)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitInt)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<LitStr> for T
impl<T> VisitMut<LitStr> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitStr)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LitStr)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Local> for T
impl<T> VisitMut<Local> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Local)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Local)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<LocalInit> for T
impl<T> VisitMut<LocalInit> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LocalInit)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut LocalInit)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Macro> for T
impl<T> VisitMut<Macro> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Macro)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Macro)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<MacroDelimiter> for T
impl<T> VisitMut<MacroDelimiter> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut MacroDelimiter)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut MacroDelimiter)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Member> for T
impl<T> VisitMut<Member> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Member)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Member)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Meta> for T
impl<T> VisitMut<Meta> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Meta)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Meta)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<MetaList> for T
impl<T> VisitMut<MetaList> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut MetaList)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut MetaList)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<MetaNameValue> for T
impl<T> VisitMut<MetaNameValue> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut MetaNameValue)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut MetaNameValue)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ParenthesizedGenericArguments> for T
impl<T> VisitMut<ParenthesizedGenericArguments> for T
Source§fn visit_mut<D>(
visitor: Visitor<'_, D, T>,
node: &mut ParenthesizedGenericArguments,
)
fn visit_mut<D>( visitor: Visitor<'_, D, T>, node: &mut ParenthesizedGenericArguments, )
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Pat> for T
impl<T> VisitMut<Pat> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Pat)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Pat)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PatIdent> for T
impl<T> VisitMut<PatIdent> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatIdent)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatIdent)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PatOr> for T
impl<T> VisitMut<PatOr> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatOr)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatOr)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PatParen> for T
impl<T> VisitMut<PatParen> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatParen)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatParen)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PatReference> for T
impl<T> VisitMut<PatReference> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatReference)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatReference)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PatRest> for T
impl<T> VisitMut<PatRest> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatRest)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatRest)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PatSlice> for T
impl<T> VisitMut<PatSlice> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatSlice)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatSlice)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PatStruct> for T
impl<T> VisitMut<PatStruct> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatStruct)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatStruct)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PatTuple> for T
impl<T> VisitMut<PatTuple> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatTuple)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatTuple)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PatTupleStruct> for T
impl<T> VisitMut<PatTupleStruct> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatTupleStruct)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatTupleStruct)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PatType> for T
impl<T> VisitMut<PatType> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatType)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatType)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PatWild> for T
impl<T> VisitMut<PatWild> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatWild)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PatWild)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Path> for T
impl<T> VisitMut<Path> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Path)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Path)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PathArguments> for T
impl<T> VisitMut<PathArguments> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PathArguments)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PathArguments)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PathSegment> for T
impl<T> VisitMut<PathSegment> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PathSegment)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PathSegment)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PointerMutability> for T
impl<T> VisitMut<PointerMutability> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PointerMutability)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PointerMutability)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PreciseCapture> for T
impl<T> VisitMut<PreciseCapture> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PreciseCapture)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PreciseCapture)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PredicateLifetime> for T
impl<T> VisitMut<PredicateLifetime> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PredicateLifetime)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PredicateLifetime)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<PredicateType> for T
impl<T> VisitMut<PredicateType> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PredicateType)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut PredicateType)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<QSelf> for T
impl<T> VisitMut<QSelf> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut QSelf)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut QSelf)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<RangeLimits> for T
impl<T> VisitMut<RangeLimits> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut RangeLimits)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut RangeLimits)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Receiver> for T
impl<T> VisitMut<Receiver> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Receiver)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Receiver)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<ReturnType> for T
impl<T> VisitMut<ReturnType> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ReturnType)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut ReturnType)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Signature> for T
impl<T> VisitMut<Signature> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Signature)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Signature)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<StaticMutability> for T
impl<T> VisitMut<StaticMutability> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut StaticMutability)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut StaticMutability)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Stmt> for T
impl<T> VisitMut<Stmt> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Stmt)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Stmt)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<StmtMacro> for T
impl<T> VisitMut<StmtMacro> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut StmtMacro)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut StmtMacro)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TokenStream> for T
impl<T> VisitMut<TokenStream> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TokenStream)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TokenStream)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TraitBound> for T
impl<T> VisitMut<TraitBound> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitBound)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitBound)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TraitBoundModifier> for T
impl<T> VisitMut<TraitBoundModifier> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitBoundModifier)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitBoundModifier)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TraitItem> for T
impl<T> VisitMut<TraitItem> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitItem)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitItem)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TraitItemConst> for T
impl<T> VisitMut<TraitItemConst> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitItemConst)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitItemConst)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TraitItemFn> for T
impl<T> VisitMut<TraitItemFn> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitItemFn)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitItemFn)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TraitItemMacro> for T
impl<T> VisitMut<TraitItemMacro> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitItemMacro)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitItemMacro)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TraitItemType> for T
impl<T> VisitMut<TraitItemType> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitItemType)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TraitItemType)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Type> for T
impl<T> VisitMut<Type> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Type)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Type)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeArray> for T
impl<T> VisitMut<TypeArray> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeArray)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeArray)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeBareFn> for T
impl<T> VisitMut<TypeBareFn> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeBareFn)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeBareFn)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeGroup> for T
impl<T> VisitMut<TypeGroup> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeGroup)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeGroup)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeImplTrait> for T
impl<T> VisitMut<TypeImplTrait> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeImplTrait)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeImplTrait)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeInfer> for T
impl<T> VisitMut<TypeInfer> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeInfer)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeInfer)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeMacro> for T
impl<T> VisitMut<TypeMacro> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeMacro)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeMacro)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeNever> for T
impl<T> VisitMut<TypeNever> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeNever)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeNever)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeParam> for T
impl<T> VisitMut<TypeParam> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeParam)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeParam)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeParamBound> for T
impl<T> VisitMut<TypeParamBound> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeParamBound)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeParamBound)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeParen> for T
impl<T> VisitMut<TypeParen> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeParen)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeParen)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypePath> for T
impl<T> VisitMut<TypePath> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypePath)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypePath)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypePtr> for T
impl<T> VisitMut<TypePtr> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypePtr)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypePtr)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeReference> for T
impl<T> VisitMut<TypeReference> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeReference)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeReference)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeSlice> for T
impl<T> VisitMut<TypeSlice> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeSlice)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeSlice)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeTraitObject> for T
impl<T> VisitMut<TypeTraitObject> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeTraitObject)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeTraitObject)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<TypeTuple> for T
impl<T> VisitMut<TypeTuple> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeTuple)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut TypeTuple)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<UnOp> for T
impl<T> VisitMut<UnOp> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UnOp)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UnOp)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<UseGlob> for T
impl<T> VisitMut<UseGlob> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UseGlob)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UseGlob)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<UseGroup> for T
impl<T> VisitMut<UseGroup> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UseGroup)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UseGroup)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<UseName> for T
impl<T> VisitMut<UseName> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UseName)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UseName)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<UsePath> for T
impl<T> VisitMut<UsePath> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UsePath)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UsePath)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<UseRename> for T
impl<T> VisitMut<UseRename> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UseRename)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UseRename)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<UseTree> for T
impl<T> VisitMut<UseTree> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UseTree)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut UseTree)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Variadic> for T
impl<T> VisitMut<Variadic> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Variadic)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Variadic)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Variant> for T
impl<T> VisitMut<Variant> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Variant)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Variant)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<VisRestricted> for T
impl<T> VisitMut<VisRestricted> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut VisRestricted)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut VisRestricted)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<Visibility> for T
impl<T> VisitMut<Visibility> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Visibility)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut Visibility)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<WhereClause> for T
impl<T> VisitMut<WhereClause> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut WhereClause)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut WhereClause)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.Source§impl<T> VisitMut<WherePredicate> for T
impl<T> VisitMut<WherePredicate> for T
Source§fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut WherePredicate)
fn visit_mut<D>(visitor: Visitor<'_, D, T>, node: &mut WherePredicate)
Performs the visiting action. The default implementation simply calls
Visitor::visit_mut(visitor, node), which returns control to the DirectMut implementation
to continue to further sub-nodes. If you wish to skip sub-nodes, simply omit this
call from your implementation.