//generated by abstract-syntax-gen package de.peeeq.wurstscript.luaAst; import java.util.*; @SuppressWarnings({"cast", "unused", "rawtypes"}) class LuaOpMinusImpl implements LuaOpMinus{ LuaOpMinusImpl() { } private Element parent; public Element getParent() { return parent; } public void setParent(Element parent) { if (parent != null && this.parent != null) { throw new Error("Cannot change parent of element " + this.getClass().getSimpleName() + ", as it is already used in another tree." + "Use the copy method to create a new tree or remove the tree from its old parent or set the parent to null before moving the tree. "); } this.parent = parent; } public void replaceBy(Element other) { if (parent == null) throw new RuntimeException("Node not attached to tree."); for (int i=0; i action) { } public int size() { return 0; } @Override public LuaOpMinus copy() { LuaOpMinus result = new LuaOpMinusImpl(); return result; } @Override public LuaOpMinus copyWithRefs() { LuaOpMinus res = copy(); return res; } @Override public void clearAttributes() { clearAttributesLocal(); } @Override public void clearAttributesLocal() { } @Override public void accept(Visitor v) { v.visit(this); } @Override public T match(LuaOpUnary.Matcher matcher) { return matcher.case_LuaOpMinus(this); } @Override public void match(LuaOpUnary.MatcherVoid matcher) { matcher.case_LuaOpMinus(this); } @Override public T match(LuaOpBinary.Matcher matcher) { return matcher.case_LuaOpMinus(this); } @Override public void match(LuaOpBinary.MatcherVoid matcher) { matcher.case_LuaOpMinus(this); } @Override public T match(Element.Matcher matcher) { return matcher.case_LuaOpMinus(this); } @Override public void match(Element.MatcherVoid matcher) { matcher.case_LuaOpMinus(this); } @Override public String toString() { return "LuaOpMinus"; } public boolean structuralEquals(Element e) { return e instanceof LuaOpMinus; } /** */ public void print(StringBuilder sb, int indent) { de.peeeq.wurstscript.translation.lua.printing.LuaPrinter.print((LuaOpMinus)this, sb, indent); } }