All Downloads are FREE. Search and download functionalities are using the official Maven repository.

info.bliki.wiki.template.expr.ast.FunctionNode Maven / Gradle / Ivy

The newest version!
package info.bliki.wiki.template.expr.ast;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;

/**
 * A list of ASTNode's which represents a parsed function.
* The head of the function (i.e. Ceil, Floor, Trunc, Plus, Times,...) is stored * in the 0-th index of the list.
The arguments of the function are stored * in the 1...n-th index of the list. */ public class FunctionNode extends ASTNode implements java.util.List { private ArrayList fNodesList; public FunctionNode(final ASTNode head) { super(null); fNodesList = new ArrayList<>(5); fNodesList.add(head); } public FunctionNode(final SymbolNode head, final ASTNode arg0) { super(null); fNodesList = new ArrayList<>(3); fNodesList.add(head); fNodesList.add(arg0); } public FunctionNode(final SymbolNode head, final ASTNode arg0, final ASTNode arg1) { super(null); fNodesList = new ArrayList<>(3); fNodesList.add(head); fNodesList.add(arg0); fNodesList.add(arg1); } @Override public void add(final int index, final ASTNode element) { fNodesList.add(index, element); } /** * Appends the node to the end of this list. * * @param node * element to be appended to this list * @return true (as specified by {@link Collection#add}) */ @Override public boolean add(final ASTNode node) { return fNodesList.add(node); } @Override public boolean addAll(final Collection c) { return fNodesList.addAll(c); } @Override public boolean addAll(final int index, final Collection c) { return fNodesList.addAll(index, c); } @Override public void clear() { fNodesList.clear(); } @Override public boolean contains(final Object o) { return fNodesList.contains(o); } @Override public boolean containsAll(final Collection c) { return fNodesList.containsAll(c); } public void ensureCapacity(final int minCapacity) { fNodesList.ensureCapacity(minCapacity); } @Override public boolean equals(final Object o) { if (o instanceof FunctionNode) { return fNodesList.equals(((FunctionNode) o).fNodesList); } return false; } /** * Returns the node at the specified position in this list. * * @param index * index of the ASTNode to return * @return the ASTNode at the specified position in this list * * @throws IndexOutOfBoundsException */ @Override public ASTNode get(final int index) { return fNodesList.get(index); } @Override public int hashCode() { return fNodesList.hashCode(); } @Override public int indexOf(final Object o) { return fNodesList.indexOf(o); } @Override public boolean isEmpty() { return fNodesList.isEmpty(); } @Override public Iterator iterator() { return fNodesList.iterator(); } @Override public int lastIndexOf(final Object o) { return fNodesList.lastIndexOf(o); } @Override public ListIterator listIterator() { return fNodesList.listIterator(); } @Override public ListIterator listIterator(final int index) { return fNodesList.listIterator(index); } @Override public ASTNode remove(final int index) { return fNodesList.remove(index); } @Override public boolean remove(final Object o) { return fNodesList.remove(o); } @Override public boolean removeAll(final Collection c) { return fNodesList.removeAll(c); } @Override public boolean retainAll(final Collection c) { return fNodesList.retainAll(c); } @Override public ASTNode set(final int index, final ASTNode element) { return fNodesList.set(index, element); } @Override public int size() { return fNodesList.size(); } @Override public List subList(final int fromIndex, final int toIndex) { return fNodesList.subList(fromIndex, toIndex); } @Override public Object[] toArray() { return fNodesList.toArray(); } @Override public T[] toArray(final T[] a) { return fNodesList.toArray(a); } @Override public String toString() { ASTNode temp = fNodesList.get(0); final StringBuffer buf = new StringBuffer(); if (temp == null) { buf.append(""); } else { buf.append(temp.toString()); } buf.append("["); for (int i = 1; i < size(); i++) { temp = get(i); buf.append(temp == this ? "(this ListNode)" : String.valueOf(temp)); if (i < size() - 1) { buf.append(", "); } } buf.append("]"); return buf.toString(); } public void trimToSize() { fNodesList.trimToSize(); } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy