/* Copyright (C) 2013 Raquel Pau and Albert Coroleu. Walkmod is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. Walkmod is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with Walkmod. If not, see <http://www.gnu.org/licenses/>.*/ package org.walkmod.javalang.ast.expr; import java.util.HashMap; import java.util.LinkedList; import java.util.List; import java.util.Map; import org.walkmod.javalang.ast.Node; import org.walkmod.javalang.ast.ScopeAware; import org.walkmod.javalang.ast.SymbolDefinition; import org.walkmod.javalang.visitors.GenericVisitor; import org.walkmod.javalang.visitors.VoidVisitor; import org.walkmod.merger.MergeEngine; /** * @author Julio Vilmar Gesser */ public final class NormalAnnotationExpr extends AnnotationExpr { private List<MemberValuePair> pairs; public NormalAnnotationExpr() { } public NormalAnnotationExpr(NameExpr name, List<MemberValuePair> pairs) { setName(name); setPairs(pairs); } public NormalAnnotationExpr(int beginLine, int beginColumn, int endLine, int endColumn, NameExpr name, List<MemberValuePair> pairs) { super(beginLine, beginColumn, endLine, endColumn); setName(name); setPairs(pairs); } @Override public boolean removeChild(Node child) { boolean result = false; if (child != null) { result = super.removeChild(child); if (!result) { if (pairs != null) { List<MemberValuePair> pairsAux = new LinkedList<MemberValuePair>(pairs); result = pairsAux.remove(child); pairs = pairsAux; } } } if(result){ updateReferences(child); } return result; } @Override public List<Node> getChildren() { List<Node> children = super.getChildren(); if (pairs != null) { children.addAll(pairs); } return children; } @Override public <R, A> R accept(GenericVisitor<R, A> v, A arg) { if (!check()) { return null; } return v.visit(this, arg); } @Override public <A> void accept(VoidVisitor<A> v, A arg) { if (check()) { v.visit(this, arg); } } public List<MemberValuePair> getPairs() { return pairs; } public void setPairs(List<MemberValuePair> pairs) { this.pairs = pairs; setAsParentNodeOf(pairs); } @Override public void merge(AnnotationExpr t1, MergeEngine configuration) { List<MemberValuePair> pairsList = new LinkedList<MemberValuePair>(); configuration.apply(getPairs(), ((NormalAnnotationExpr) t1).getPairs(), pairsList, MemberValuePair.class); if (!pairsList.isEmpty()) { setPairs(pairsList); } else { setPairs(null); } } @Override public boolean replaceChildNode(Node oldChild, Node newChild) { return replaceChildNodeInList(oldChild, newChild, pairs); } @Override public NormalAnnotationExpr clone() throws CloneNotSupportedException { return new NormalAnnotationExpr(clone(name), clone(pairs)); } @Override public Map<String, SymbolDefinition> getVariableDefinitions(){ Node parent = getParentNode(); while (parent != null && parent instanceof ScopeAware) { parent = parent.getParentNode(); } if (parent != null && (parent instanceof ScopeAware)) { return ((ScopeAware) parent).getVariableDefinitions(); } return new HashMap<String, SymbolDefinition>(); } @Override public Map<String, List<SymbolDefinition>> getMethodDefinitions(){ Node parent = getParentNode(); while (parent != null && parent instanceof ScopeAware) { parent = parent.getParentNode(); } if (parent != null && (parent instanceof ScopeAware)) { return ((ScopeAware) parent).getMethodDefinitions(); } return new HashMap<String, List<SymbolDefinition>>(); } @Override public Map<String, SymbolDefinition> getTypeDefinitions() { Node parent = getParentNode(); while (parent != null && parent instanceof ScopeAware) { parent = parent.getParentNode(); } if (parent != null && (parent instanceof ScopeAware)) { return ((ScopeAware) parent).getTypeDefinitions(); } return new HashMap<String, SymbolDefinition>(); } }