public int getNrNodes() { if (samples == null) { return 0; } else { return samples.getNrNodes(); } }
/** * to do: have to remove recursion... * * @return the total number of nodes in this tree. */ public int getNrNodes() { if (subNodes == null) { return 1; } else { int nrNodes = 0; for (SampleNode node : subNodes.values()) { nrNodes += node.getNrNodes(); } return nrNodes + 1; } }
instance.collect(st1); LOG.debug("Collector = {}", instance); Assert.assertEquals(4, instance.get().getNrNodes()); instance.collect(st2); LOG.debug("Collector = {}", instance); Assert.assertEquals(5, instance.get().getNrNodes());
LOG.debug("Node 2", node2); Assert.assertEquals(4, node1.getNrNodes()); Assert.assertEquals(4, node2.getNrNodes()); LOG.debug("Node 1", node1); LOG.debug("Node 2", node2); Assert.assertEquals(5, node1.getNrNodes()); Assert.assertEquals(5, node2.getNrNodes());
public SampleGraph(final Method m, final SampleNode node) { int nrNodes = node.getNrNodes(); vertexMap = MultimapBuilder.hashKeys(nrNodes).hashSetValues(1).build(); aggregates = new THashMap<>(nrNodes); sampleTree = GraphBuilder.directed() .nodeOrder(ElementOrder.unordered()) .allowsSelfLoops(false) .expectedNodeCount(nrNodes) .build(); aggGraph = GraphBuilder.directed() .nodeOrder(ElementOrder.unordered()) .allowsSelfLoops(false) .expectedNodeCount(nrNodes) .build(); rootVertex = tree2Graph(m, node); }