Uses of Class
org.datanucleus.store.rdbms.datasource.dbcp2.pool2.impl.LinkedBlockingDeque.Node
Packages that use LinkedBlockingDeque.Node
Package
Description
This is a repackaged Apache Commons DBCP v2.7.0 and Apache Commons Pool v2.8.0.
-
Uses of LinkedBlockingDeque.Node in org.datanucleus.store.rdbms.datasource.dbcp2.pool2.impl
Fields in org.datanucleus.store.rdbms.datasource.dbcp2.pool2.impl declared as LinkedBlockingDeque.NodeModifier and TypeFieldDescriptionprivate LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.first
Pointer to first node.private LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.last
Pointer to last node.private LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.AbstractItr.lastRet
Node returned by most recent call to next.(package private) LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.AbstractItr.next
The next node to return in next()(package private) LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.Node.next
One of: - the real successor Node - this Node, meaning the successor is head - null, meaning there is no successor(package private) LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.Node.prev
One of: - the real predecessor Node - this Node, meaning the predecessor is tail - null, meaning there is no predecessorMethods in org.datanucleus.store.rdbms.datasource.dbcp2.pool2.impl that return LinkedBlockingDeque.NodeModifier and TypeMethodDescription(package private) abstract LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.AbstractItr.firstNode()
Obtain the first node to be returned by the iterator.(package private) LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.DescendingItr.firstNode()
(package private) LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.Itr.firstNode()
(package private) abstract LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.AbstractItr.nextNode
(LinkedBlockingDeque.Node<E> n) For a given node, obtain the next node to be returned by the iterator.(package private) LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.DescendingItr.nextNode
(LinkedBlockingDeque.Node<E> n) (package private) LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.Itr.nextNode
(LinkedBlockingDeque.Node<E> n) private LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.AbstractItr.succ
(LinkedBlockingDeque.Node<E> n) Returns the successor node of the given non-null, but possibly previously deleted, node.Methods in org.datanucleus.store.rdbms.datasource.dbcp2.pool2.impl with parameters of type LinkedBlockingDeque.NodeModifier and TypeMethodDescription(package private) abstract LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.AbstractItr.nextNode
(LinkedBlockingDeque.Node<E> n) For a given node, obtain the next node to be returned by the iterator.(package private) LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.DescendingItr.nextNode
(LinkedBlockingDeque.Node<E> n) (package private) LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.Itr.nextNode
(LinkedBlockingDeque.Node<E> n) private LinkedBlockingDeque.Node
<E> LinkedBlockingDeque.AbstractItr.succ
(LinkedBlockingDeque.Node<E> n) Returns the successor node of the given non-null, but possibly previously deleted, node.private void
LinkedBlockingDeque.unlink
(LinkedBlockingDeque.Node<E> x) Unlinks the provided node.Constructors in org.datanucleus.store.rdbms.datasource.dbcp2.pool2.impl with parameters of type LinkedBlockingDeque.NodeModifierConstructorDescription(package private)
Node
(E x, LinkedBlockingDeque.Node<E> p, LinkedBlockingDeque.Node<E> n) Create a new list node.