spack.util.unparse package

spack.util.unparse.unparse(tree, py_ver_consistent=False)

Submodules

spack.util.unparse.unparser module

Usage: unparse.py <path to source file>

class spack.util.unparse.unparser.Unparser(py_ver_consistent=False, _avoid_backslashes=False)

Bases: object

Methods in this class recursively traverse an AST and output source code for the abstract syntax; original formatting is disregarded.

binop = {'Add': '+', 'BitAnd': '&', 'BitOr': '|', 'BitXor': '^', 'Div': '/', 'FloorDiv': '//', 'LShift': '<<', 'MatMult': '@', 'Mod': '%', 'Mult': '*', 'Pow': '**', 'RShift': '>>', 'Sub': '-'}

binop_precedence = {'%': 12, '&': 9, '*': 12, '**': 14, '+': 11, '-': 11, '/': 12, '//': 12, '<<': 10, '>>': 10, '@': 12, '^': 8, '|': 7}

binop_rassoc = frozenset({'**'})

block()

boolop_precedence = {'and': 4, 'or': 3}

boolops = {'And': 'and', 'Or': 'or'}

cmpops = {'Eq': '==', 'Gt': '>', 'GtE': '>=', 'In': 'in', 'Is': 'is', 'IsNot': 'is not', 'Lt': '<', 'LtE': '<=', 'NotEq': '!=', 'NotIn': 'not in'}

delimit(start, end)

A context manager for preparing the source for expressions. It adds start to the buffer and enters, after exit it adds end.

delimit_if(start, end, condition)

dispatch(tree)

Dispatcher function, dispatching tree type T to method _T.

fill(text='')

Indent a piece of text, according to the current indentation level

get_precedence(node)

items_view(traverser, items)

Traverse and separate the given items with a comma and append it to the buffer. If items is a single item sequence, a trailing comma will be added.

require_parens(precedence, node)

Shortcut to adding precedence related parens

set_precedence(precedence, *nodes)

unop = {'Invert': '~', 'Not': 'not', 'UAdd': '+', 'USub': '-'}

unop_precedence = {'+': 13, '-': 13, 'not': 5, '~': 13}

visit(tree, output_file)

Traverse tree and write source code to output_file.

visit_AnnAssign(node)

visit_Assert(node)

visit_Assign(node)

visit_AsyncFor(node)

visit_AsyncFunctionDef(node)

visit_AsyncWith(node)

visit_Attribute(node)

visit_AugAssign(node)

visit_Await(node)

visit_BinOp(node)

visit_BoolOp(node)

visit_Break(node)

visit_Bytes(node)

visit_Call(node)

visit_ClassDef(node)

visit_Compare(node)

visit_Constant(node)

visit_Continue(node)

visit_Delete(node)

visit_Dict(node)

visit_DictComp(node)

visit_Ellipsis(node)

visit_ExceptHandler(node)

visit_Expr(tree)

visit_Expression(tree)

visit_ExtSlice(node)

visit_For(node)

visit_FormattedValue(node)

visit_FunctionDef(node)

visit_GeneratorExp(node)

visit_Global(node)

visit_If(node)

visit_IfExp(node)

visit_Import(node)

visit_ImportFrom(node)

visit_Index(node)

visit_Interactive(tree)

visit_JoinedStr(node)

visit_Lambda(node)

visit_List(node)

visit_ListComp(node)

visit_Match(node)

visit_MatchAs(node)

visit_MatchClass(node)

visit_MatchMapping(node)

visit_MatchOr(node)

visit_MatchSequence(node)

visit_MatchSingleton(node)

visit_MatchStar(node)

visit_MatchValue(node)

visit_Module(tree)

visit_Name(node)

visit_NameConstant(node)

visit_NamedExpr(tree)

visit_Nonlocal(node)

visit_Num(node)

visit_ParamSpec(node)

visit_Pass(node)

visit_Raise(node)

visit_Return(node)

visit_Set(node)

visit_SetComp(node)

visit_Slice(node)

visit_Starred(node)

visit_Str(tree)

visit_Subscript(node)

visit_Try(node)

visit_Tuple(node)

visit_TypeAlias(node)

visit_TypeVar(node)

visit_TypeVarTuple(node)

visit_UnaryOp(node)

visit_While(node)

visit_With(node)

visit_Yield(node)

visit_YieldFrom(node)

visit_alias(node)

visit_arg(node)

visit_arguments(node)

visit_comprehension(node)

visit_keyword(node)

visit_match_case(node)

visit_withitem(node)

write(text)

Append a piece of text to the current line.

spack.util.unparse.unparser.interleave(inter, f, seq)

Call f on each item in seq, calling inter() in between.

spack.util.unparse.unparser.is_simple_tuple(slice_value)

spack.util.unparse.unparser.nullcontext()

spack.util.unparse.unparser.pnext(precedence)