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

Example 1 with Aggregation

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

the class DescendantTreeAggregator method addChildren.

/**
 * Recursive method for aggregating the children (and descendants) of the {@link LeanNode}s which are aggregated by
 * the provided {@link Node}.
 * <p>
 * @param source the original {@link AggregationProfile}
 * @param child the input {@link Node}
 * @param tree the resulting {@link Tree}
 * @param grouping the key calculation grouping
 */
private void addChildren(AggregationProfile source, Node child, Tree tree, CombinedGrouping grouping) {
    Map<String, Node> result = child.getAggregatedNodes().stream().flatMap(node -> node.getChildren().stream()).collect(groupingBy(// Group LeanNodes by calculated key
    node -> grouping.apply(source, node), // Downstream collector, collects 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 Node accumulator
    (x, y) -> {
        x.add(y);
        x.setKey(grouping.apply(source, y));
    }, // Combiner, combines two Nodes with the same key
    (x, y) -> x.combine(y))));
    // Add the aggregated children as children to the Node, and recurse
    result.values().forEach(parent -> {
        child.addChild(parent);
        // Recursively add descendants
        addChildren(source, parent, tree, grouping);
    });
}

Example 2 with Aggregation

use of com.insightfullogic.honest_profiler.core.aggregation.result.Aggregation 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);
    });
}