Uses of Class
com.google.common.util.concurrent.CycleDetectingLockFactory.LockGraphNode
Packages that use CycleDetectingLockFactory.LockGraphNode
-
Uses of CycleDetectingLockFactory.LockGraphNode in com.google.common.util.concurrent
Fields in com.google.common.util.concurrent declared as CycleDetectingLockFactory.LockGraphNodeModifier and TypeFieldDescriptionprivate final CycleDetectingLockFactory.LockGraphNodeCycleDetectingLockFactory.CycleDetectingReentrantLock.lockGraphNodeprivate final CycleDetectingLockFactory.LockGraphNodeCycleDetectingLockFactory.CycleDetectingReentrantReadWriteLock.lockGraphNodeFields in com.google.common.util.concurrent with type parameters of type CycleDetectingLockFactory.LockGraphNodeModifier and TypeFieldDescriptionprivate static final ThreadLocal<ArrayList<CycleDetectingLockFactory.LockGraphNode>>CycleDetectingLockFactory.acquiredLocksTracks the currently acquired locks for each Thread, kept up to date by calls toCycleDetectingLockFactory.aboutToAcquire(CycleDetectingLock)andCycleDetectingLockFactory.lockStateChanged(CycleDetectingLock).(package private) final Map<CycleDetectingLockFactory.LockGraphNode,CycleDetectingLockFactory.ExampleStackTrace> CycleDetectingLockFactory.LockGraphNode.allowedPriorLocksThe map tracking the locks that are known to be acquired before this lock, each associated with an example stack trace.(package private) final Map<CycleDetectingLockFactory.LockGraphNode,CycleDetectingLockFactory.PotentialDeadlockException> CycleDetectingLockFactory.LockGraphNode.disallowedPriorLocksThe map tracking lock nodes that can cause a lock acquisition cycle if acquired before this node.private final Map<E,CycleDetectingLockFactory.LockGraphNode> CycleDetectingLockFactory.WithExplicitOrdering.lockGraphNodesprivate static final ConcurrentMap<Class<? extends Enum<?>>,Map<? extends Enum<?>, CycleDetectingLockFactory.LockGraphNode>> CycleDetectingLockFactory.lockGraphNodesPerTypeMethods in com.google.common.util.concurrent that return CycleDetectingLockFactory.LockGraphNodeModifier and TypeMethodDescriptionCycleDetectingLockFactory.CycleDetectingLock.getLockGraphNode()CycleDetectingLockFactory.CycleDetectingReentrantLock.getLockGraphNode()CycleDetectingLockFactory.CycleDetectingReentrantReadWriteLock.getLockGraphNode()Methods in com.google.common.util.concurrent that return types with arguments of type CycleDetectingLockFactory.LockGraphNodeModifier and TypeMethodDescription(package private) static <E extends Enum<E>>
Map<E,CycleDetectingLockFactory.LockGraphNode> CycleDetectingLockFactory.createNodes(Class<E> clazz) For a given Enum type, creates an immutable map from each of the Enum's values to a corresponding LockGraphNode, with theallowedPriorLocksanddisallowedPriorLocksprepopulated with nodes according to the natural ordering of the associated Enum values.private static <E extends Enum<E>>
Map<? extends E,CycleDetectingLockFactory.LockGraphNode> CycleDetectingLockFactory.getOrCreateNodes(Class<E> clazz) Methods in com.google.common.util.concurrent with parameters of type CycleDetectingLockFactory.LockGraphNodeModifier and TypeMethodDescription(package private) voidCycleDetectingLockFactory.LockGraphNode.checkAcquiredLock(CycleDetectingLockFactory.Policy policy, CycleDetectingLockFactory.LockGraphNode acquiredLock) Checks the acquisition-ordering betweenthis, which is about to be acquired, and the specifiedacquiredLock.CycleDetectingLockFactory.LockGraphNode.findPathTo(CycleDetectingLockFactory.LockGraphNode node, Set<CycleDetectingLockFactory.LockGraphNode> seen) Performs a depth-first traversal of the graph edges defined by each node'sallowedPriorLocksto find a path betweenthisand the specifiedlock.Method parameters in com.google.common.util.concurrent with type arguments of type CycleDetectingLockFactory.LockGraphNodeModifier and TypeMethodDescription(package private) voidCycleDetectingLockFactory.LockGraphNode.checkAcquiredLocks(CycleDetectingLockFactory.Policy policy, List<CycleDetectingLockFactory.LockGraphNode> acquiredLocks) CycleDetectingLockFactory.LockGraphNode.findPathTo(CycleDetectingLockFactory.LockGraphNode node, Set<CycleDetectingLockFactory.LockGraphNode> seen) Performs a depth-first traversal of the graph edges defined by each node'sallowedPriorLocksto find a path betweenthisand the specifiedlock.Constructors in com.google.common.util.concurrent with parameters of type CycleDetectingLockFactory.LockGraphNodeModifierConstructorDescriptionprivateCycleDetectingReentrantLock(CycleDetectingLockFactory.LockGraphNode lockGraphNode, boolean fair) privateCycleDetectingReentrantReadWriteLock(CycleDetectingLockFactory.LockGraphNode lockGraphNode, boolean fair) (package private)ExampleStackTrace(CycleDetectingLockFactory.LockGraphNode node1, CycleDetectingLockFactory.LockGraphNode node2) privatePotentialDeadlockException(CycleDetectingLockFactory.LockGraphNode node1, CycleDetectingLockFactory.LockGraphNode node2, CycleDetectingLockFactory.ExampleStackTrace conflictingStackTrace) Constructor parameters in com.google.common.util.concurrent with type arguments of type CycleDetectingLockFactory.LockGraphNodeModifierConstructorDescription(package private)WithExplicitOrdering(CycleDetectingLockFactory.Policy policy, Map<E, CycleDetectingLockFactory.LockGraphNode> lockGraphNodes)