public CacheableNode popTail() {
CacheableNode cacheableNode = head.previousNode;
if (cacheableNode == head) {
return null;
}
cacheableNode.clear();
return cacheableNode;
}
public void insertHead(CacheableNode cacheableNode) {
if (cacheableNode.nextNode != null) {
cacheableNode.clear();
}
cacheableNode.nextNode = head.nextNode;
cacheableNode.previousNode = head;
cacheableNode.nextNode.previousNode = cacheableNode;
cacheableNode.previousNode.nextNode = cacheableNode;
}
public Queue() {
head.previousNode = head;
head.nextNode = head;
}
