/** * Append a measurement result from the end of a tree. * * @param newTree The tree to the measurement result. */ public void appendPath(LinkedList newTree) { EtmPoint current = (EtmPoint) newTree.removeFirst(); ExecutionAggregate aggregate = getChild(current.getName()); if (newTree.size() == 0) { aggregate.addTransaction(current); } else { aggregate.appendPath(newTree); } }
/** * Append a measurement result from the end of a tree. * * @param newTree The tree to the measurement result. */ public void appendPath(LinkedList newTree) { EtmPoint current = (EtmPoint) newTree.removeFirst(); ExecutionAggregate aggregate = getChild(current.getName()); if (newTree.isEmpty()) { aggregate.addTransaction(current); } else { aggregate.appendPath(newTree); } }
public void add(EtmPoint point) { // short cut for parent == null; if (point.getParent() == null) { super.add(point); return; } // TODO check alternative strategy to improve performance // find tree root node LinkedList path = new LinkedList(); path.add(point); EtmPoint rootNode = point.getParent(); while (rootNode != null) { path.addFirst(rootNode); rootNode = rootNode.getParent(); } rootNode = (EtmPoint) path.removeFirst(); ExecutionAggregate aggregate = getAggregate(rootNode.getName()); aggregate.appendPath(path); }
public void add(EtmPoint point) { // short cut for parent == null; if (point.getParent() == null) { super.add(point); return; } // TODO check alternative strategy to improve performance // find tree root node LinkedList path = new LinkedList(); path.add(point); EtmPoint rootNode = point.getParent(); while (rootNode != null) { path.addFirst(rootNode); rootNode = rootNode.getParent(); } rootNode = (EtmPoint) path.removeFirst(); ExecutionAggregate aggregate = getAggregate(rootNode.getName()); aggregate.appendPath(path); }
public void add(EtmPoint point) { // shortcut for parent == null; if (point.getParent() == null) { ExecutionAggregate aggregate = getAggregate(point.getName()); aggregate.addTransaction(point); return; } // TODO check alternative strategy to improve performance // find tree root node LinkedList path = new LinkedList(); path.add(point); EtmPoint rootNode = point.getParent(); while (rootNode != null) { path.addFirst(rootNode); rootNode = rootNode.getParent(); } rootNode = (EtmPoint) path.removeFirst(); ExecutionAggregate aggregate = getAggregate(rootNode.getName()); aggregate.appendPath(path); }
public void add(EtmPoint point) { // shortcut for parent == null; if (point.getParent() == null) { ExecutionAggregate aggregate = getAggregate(point.getName()); aggregate.addTransaction(point); return; } // TODO check alternative strategy to improve performance // find tree root node LinkedList path = new LinkedList(); path.add(point); EtmPoint rootNode = point.getParent(); while (rootNode != null) { path.addFirst(rootNode); rootNode = rootNode.getParent(); } rootNode = (EtmPoint) path.removeFirst(); ExecutionAggregate aggregate = getAggregate(rootNode.getName()); aggregate.appendPath(path); }