Package | Description |
---|---|
org.openjdk.jmc.flightrecorder.rules.tree | |
org.openjdk.jmc.flightrecorder.rules.tree.traversal |
Modifier and Type | Class and Description |
---|---|
class |
TreeNode<T>
A simple mutable tree node implementation, with a typed payload.
|
Modifier and Type | Field and Description |
---|---|
private java.util.List<ITreeNode<T>> |
TreeNode.children |
Modifier and Type | Method and Description |
---|---|
static ITreeNode<IItem> |
ItemTreeBuilder.buildEncapsulationTree(IItemCollection items,
boolean allowInstants)
Builds a tree where events that wrap other events, time wise, are higher up in the hierarchy.
|
static ITreeNode<IItem> |
ItemTreeBuilder.buildEncapsulationTree(IItemCollection items,
boolean allowInstants,
boolean ignoreThread)
Builds a tree where events that wrap other events, time wise, are higher up in the hierarchy.
|
static ITreeNode<IItem> |
ItemTreeBuilder.buildEncapsulationTree(IItemCollection items,
boolean allowInstants,
boolean ignoreThread,
ItemTreeBuilder.IItemTreeBuilderCallback callback)
Builds a tree where events that wrap other events, time wise, are higher up in the hierarchy.
|
ITreeNode<T> |
TreeNode.getParent() |
ITreeNode<T> |
ITreeNode.getParent() |
Modifier and Type | Method and Description |
---|---|
java.util.List<ITreeNode<T>> |
TreeNode.getChildren() |
java.util.List<ITreeNode<T>> |
ITreeNode.getChildren() |
Modifier and Type | Method and Description |
---|---|
static void |
ItemTreeToolkit.appendLayeredBreakdown(java.lang.StringBuilder report,
ITreeNode<IItem> root,
int maxDepth)
Reports all encapsulation layers.
|
static void |
ItemTreeToolkit.appendLongestBreakdown(java.lang.StringBuilder report,
ITreeNode<IItem> root)
Renders a report of the longest encapsulating event chain.
|
static int |
ItemTreeToolkit.getDepth(ITreeNode<?> node)
Returns the number of ancestors the node has.
|
static java.lang.String |
ItemTreeToolkit.printTree(ITreeNode<IItem> node) |
void |
ITreeVisitor.visit(ITreeNode<T> node) |
Modifier and Type | Field and Description |
---|---|
private ITreeNode<IItem> |
LongestDurationIterator.currentNode |
private ITreeNode<IItem> |
LayerBreakdownGenerator.startNode |
Modifier and Type | Field and Description |
---|---|
private java.util.Deque<ITreeNode<T>> |
DFIterator.next |
private java.util.Queue<ITreeNode<T>> |
BFTreeVisitor.next |
private java.util.Queue<ITreeNode<T>> |
BFIterator.next |
Modifier and Type | Method and Description |
---|---|
private ITreeNode<IItem> |
LongestDurationIterator.getFirstNode(ITreeNode<IItem> initNode) |
private ITreeNode<IItem> |
LongestDurationIterator.getLongestLastingChild(java.util.List<ITreeNode<IItem>> children) |
ITreeNode<IItem> |
LayerBreakdownGenerator.getStartNode() |
ITreeNode<T> |
DFIterator.next() |
ITreeNode<T> |
BFIterator.next() |
Modifier and Type | Method and Description |
---|---|
private void |
LayerBreakdownGenerator.calculateLayers(ITreeNode<IItem> startNode) |
private ITreeNode<IItem> |
LongestDurationIterator.getFirstNode(ITreeNode<IItem> initNode) |
void |
DFTreeVisitor.visit(ITreeNode<T> node) |
void |
BFTreeVisitor.visit(ITreeNode<T> node) |
Modifier and Type | Method and Description |
---|---|
private ITreeNode<IItem> |
LongestDurationIterator.getLongestLastingChild(java.util.List<ITreeNode<IItem>> children) |
Constructor and Description |
---|
BFIterator(ITreeNode<T> node) |
DFIterator(ITreeNode<T> node) |
LayerBreakdownGenerator(ITreeNode<IItem> startNode) |
LongestDurationIterator(ITreeNode<IItem> node) |