1 line
3.9 KiB
JavaScript
1 line
3.9 KiB
JavaScript
initSidebarItems({"enum":[["Abi",""],["AttrStyle","Distinguishes between Attributes that decorate items and Attributes that are contained as statements within items. These two cases need to be distinguished for pretty-printing."],["BinOp",""],["BinOpToken",""],["Body","Body of a derived struct or enum."],["ConstExpr",""],["DelimToken","A delimiter token"],["FloatTy",""],["FunctionRetTy",""],["IntTy",""],["Lit","Literal kind."],["MetaItem","A compile-time attribute item."],["Mutability",""],["NestedMetaItem","Possible values inside of compile-time attribute lists."],["PathParameters","Parameters of a path segment."],["StrStyle",""],["Token",""],["TokenTree","When the main rust parser encounters a syntax-extension invocation, it parses the arguments to the invocation as a token-tree. This is a very loose structure, such that all sorts of different AST-fragments can be passed to syntax extensions using a uniform type."],["TraitBoundModifier","A modifier on a bound, currently this is only used for `?Sized`, where the modifier is `Maybe`. Negative bounds should also be handled here."],["Ty","The different kinds of types recognized by the compiler"],["TyParamBound","The AST represents all type param bounds as types. `typeck::collect::compute_bounds` matches these against the \"special\" built-in traits (see `middle::lang_items`) and detects Copy, Send and Sync."],["UnOp",""],["Unsafety",""],["VariantData","Data stored within an enum variant or struct."],["Visibility","Visibility level of an item."],["WherePredicate","A single predicate in a `where` clause"]],"fn":[["parse_derive_input",""],["parse_ident",""],["parse_outer_attr",""],["parse_path",""],["parse_token_trees",""],["parse_ty_param_bound",""],["parse_type",""],["parse_where_clause",""]],"mod":[["parse","This module contains a set of exported nom parsers which can be used to parse custom grammars when used alongside the `synom` crate."],["visit","AST walker. Each overridden visit method has full control over what happens with its node, it can do its own traversal of the node's children, call `visit::walk_*` to apply the default traversal algorithm, or prevent deeper traversal by doing nothing."]],"struct":[["AngleBracketedParameterData","A path like `Foo<'a, T>`"],["Attribute","Doc-comments are promoted to attributes that have `is_sugared_doc` = true"],["BareFnArg","An argument in a function type."],["BareFnTy",""],["ByteStrLit",""],["Delimited",""],["DeriveInput","Struct or enum sent to a `proc_macro_derive` macro."],["Field","A field of a struct or enum variant."],["FloatLit",""],["Generics","Represents lifetimes and type parameters attached to a declaration of a function, enum, trait, etc."],["Ident",""],["ImplGenerics","Returned by `Generics::split_for_impl`."],["IntLit",""],["Lifetime",""],["LifetimeDef","A lifetime definition, e.g. `'a: 'b+'c+'d`"],["Mac","Represents a macro invocation. The Path indicates which macro is being invoked, and the vector of token-trees contains the source of the macro invocation."],["MutTy",""],["ParenthesizedParameterData","A path like `Foo(A,B) -> C`"],["Path","A \"Path\" is essentially Rust's notion of a name."],["PathSegment","A segment of a path: an identifier, an optional lifetime, and a set of types."],["PolyTraitRef",""],["QSelf","The explicit Self type in a \"qualified path\". The actual path, including the trait and the associated item, is stored separately. `position` represents the index of the associated item qualified with this Self type."],["StrLit",""],["Turbofish","Returned by `TyGenerics::as_turbofish`."],["TyGenerics","Returned by `Generics::split_for_impl`."],["TyParam","A generic type parameter, e.g. `T: Into<String>`."],["TypeBinding","Bind a type to an associated type: `A=Foo`."],["Variant","An enum variant."],["WhereBoundPredicate","A type bound."],["WhereClause","A `where` clause in a definition"],["WhereEqPredicate","An equality predicate (unsupported)."],["WhereRegionPredicate","A lifetime predicate."]]}); |