| Package | Description |
|---|---|
| com.google.common.util.concurrent |
Concurrency utilities.
|
| Modifier and Type | Class and Description |
|---|---|
static class |
CycleDetectingLockFactory.PotentialDeadlockException
Represents a detected cycle in lock acquisition ordering.
|
| Modifier and Type | Field and Description |
|---|---|
private CycleDetectingLockFactory.ExampleStackTrace |
CycleDetectingLockFactory.PotentialDeadlockException.conflictingStackTrace |
| Modifier and Type | Field and Description |
|---|---|
(package private) java.util.Map<CycleDetectingLockFactory.LockGraphNode,CycleDetectingLockFactory.ExampleStackTrace> |
CycleDetectingLockFactory.LockGraphNode.allowedPriorLocks
The map tracking the locks that are known to be acquired before this lock, each associated
with an example stack trace.
|
| Modifier and Type | Method and Description |
|---|---|
private CycleDetectingLockFactory.ExampleStackTrace |
CycleDetectingLockFactory.LockGraphNode.findPathTo(CycleDetectingLockFactory.LockGraphNode node,
java.util.Set<CycleDetectingLockFactory.LockGraphNode> seen)
Performs a depth-first traversal of the graph edges defined by each node's
allowedPriorLocks to find a path between this and the specified lock. |
CycleDetectingLockFactory.ExampleStackTrace |
CycleDetectingLockFactory.PotentialDeadlockException.getConflictingStackTrace() |
| Constructor and Description |
|---|
PotentialDeadlockException(CycleDetectingLockFactory.LockGraphNode node1,
CycleDetectingLockFactory.LockGraphNode node2,
CycleDetectingLockFactory.ExampleStackTrace conflictingStackTrace) |