Package ghidra.util.datastruct
Class DependencyGraphTest
- java.lang.Object
-
- ghidra.util.datastruct.DependencyGraphTest
-
public class DependencyGraphTest extends java.lang.Object
-
-
Constructor Summary
Constructors Constructor Description DependencyGraphTest()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
checkOrderSatisfiesDependencies(DependencyGraph<java.lang.String> dependencyGraph, java.util.List<java.lang.String> visitedOrder)
Given a dependency map, does the captured linear order of execution satisfy the ordering constraints?void
testCycleDetection()
void
testCycleDetectionDoesNotCorruptGraph()
void
testMultipleDependencyCase()
void
testPop()
void
testPopWithCycle()
void
testRandomProcessingOfDependenciesSimulation()
void
testSimpleCase()
-
-
-
Method Detail
-
testSimpleCase
public void testSimpleCase()
-
testMultipleDependencyCase
public void testMultipleDependencyCase()
-
testPop
public void testPop()
-
testPopWithCycle
public void testPopWithCycle()
-
testCycleDetection
public void testCycleDetection()
-
testCycleDetectionDoesNotCorruptGraph
public void testCycleDetectionDoesNotCorruptGraph()
-
testRandomProcessingOfDependenciesSimulation
public void testRandomProcessingOfDependenciesSimulation()
-
checkOrderSatisfiesDependencies
public void checkOrderSatisfiesDependencies(DependencyGraph<java.lang.String> dependencyGraph, java.util.List<java.lang.String> visitedOrder)
Given a dependency map, does the captured linear order of execution satisfy the ordering constraints?- Type Parameters:
T
- the type of the keys being compared- Parameters:
dependencyGraph
- a map where keys are predecessors and values are successors that depend on the respective keyvisitedOrder
- the actual execution order to be tested
-
-