Examples with Entry com.insightfullogic.honest_profiler.core.aggregation.result.straight.Entry used on opensource projects

Example 6 with Entry

use of com.insightfullogic.honest_profiler.core.aggregation.result.straight.Entry in project honest-profiler by jvm-profiling-tools.

the class FlatGenerator method assertContains.

public static final void assertContains(Flat flat, String key, int selfCount, int totalCount, long selfTime, long totalTime) {
    Optional<Entry> result = flat.getData().stream().filter(entry -> key.equals(entry.getKey())).findFirst();
    assertTrue("No entry found with key " + key, result.isPresent());
    Entry entry = result.get();
    assertEquals("Wrong self count for entry " + key, selfCount, entry.getSelfCnt());
    assertEquals("Wrong total count for entry " + key, totalCount, entry.getTotalCnt());
    assertEquals("Wrong self time for entry " + key, selfTime, entry.getSelfTime());
    assertEquals("Wrong total time for entry " + key, totalTime, entry.getTotalTime());
}

Example 7 with Entry

use of com.insightfullogic.honest_profiler.core.aggregation.result.straight.Entry in project honest-profiler by jvm-profiling-tools.

the class FlatViewTest method testFlatViewScenario.

// Actual Test Method
@Test
public void testFlatViewScenario() {
    FxRobot robot = new FxRobot();
    newProfileTab(robot, app(), 0, scenario.getName(), scenario, LOG);
    selectView(robot, FLAT);
    selectFrameGrouping(robot, frameGrouping, "#flat");
    TableView<Entry> tableView = getFlatTableView(robot);
    runLater(() -> scenario.checkFlatAggregation(new FlatTableViewCheckAdapter(BY_ID, frameGrouping, tableView)));
}

Example 8 with Entry

use of com.insightfullogic.honest_profiler.core.aggregation.result.straight.Entry in project honest-profiler by jvm-profiling-tools.

the class AncestorTreeAggregator method addAncestors.

/**
 * Recursive method for aggregating the parents (and ancestors) of the {@link LeanNode}s which are aggregated by the
 * provided {@link Node} and adding them as children.
 * <p>
 * @param source the original {@link AggregationProfile}
 * @param child the input {@link Node} whose ancestors will be aggregated and added as children
 * @param tree the resulting {@link Tree}
 * @param grouping the key calculation grouping
 */
private void addAncestors(AggregationProfile source, Node child, Tree tree, CombinedGrouping grouping) {
    Map<String, Node> result = child.getAggregatedNodes().stream().map(node -> node.getParent()).filter(node -> node != null).distinct().collect(groupingBy(// Group LeanNodes by calculated key
    node -> grouping.apply(source, node), // Downstream collector, aggregates LeanNodes in a single group
    of(// Supplier, creates an empty Node
    () -> {
        Node node = new Node(tree);
        // Set the reference by default for all nodes to the global aggregation.
        node.setReference(source.getGlobalData());
        return node;
    }, // Accumulator, aggregates a LeanNode into the Entry accumulator
    (node, leanNode) -> {
        node.add(leanNode);
        node.setKey(grouping.apply(source, leanNode));
    }, // Combiner, combines two Nodes with the same key
    (node1, node2) -> node1.combine(node2))));
    // Add the aggregated parents as children to the Node, and recurse
    result.entrySet().forEach(mapEntry -> {
        // The "child" Node in the ancestor Tree has its parents (the values of the calculated map) as children.
        child.addChild(mapEntry.getValue());
        // Recursively add ancestors
        addAncestors(source, mapEntry.getValue(), tree, grouping);
    });
}