Lightweight Bartering Grid

Uses of Class
lbg.common.queueing.priority.DoublyLinkedNode

Packages that use DoublyLinkedNode
lbg.common.queueing.priority   
 

Uses of DoublyLinkedNode in lbg.common.queueing.priority
 

Methods in lbg.common.queueing.priority that return DoublyLinkedNode
 DoublyLinkedNode<E> DoublyLinkedList.append(E e)
          Appends target element to the tail of the doubly-linked list.
 DoublyLinkedNode<E> DoublyLinkedList.appendAndTrim(E e, int limit)
          Appends target element to the tail of the doubly-linked list, removing as many elements as required from the head of the list so that its size does not exceed the target limit, after appending the target element.
 DoublyLinkedNode<E> DoublyLinkedNode.getNext()
           
 DoublyLinkedNode<E> DoublyLinkedNode.getPrev()
           
 DoublyLinkedNode<E> DoublyLinkedList.head()
           
 DoublyLinkedNode<E> DoublyLinkedList.tail()
           
 

Methods in lbg.common.queueing.priority with parameters of type DoublyLinkedNode
 void DoublyLinkedNode.setNext(DoublyLinkedNode<E> next)
           
 void DoublyLinkedNode.setPrev(DoublyLinkedNode<E> prev)
           
 

Constructors in lbg.common.queueing.priority with parameters of type DoublyLinkedNode
DoublyLinkedNode(E info, DoublyLinkedNode<E> prev)
           
DoublyLinkedNode(E info, DoublyLinkedNode<E> prev, DoublyLinkedNode<E> next)
           
DoublyLinkedNode(E info, DoublyLinkedNode<E> prev, DoublyLinkedNode<E> next)
           
 


Lightweight Bartering Grid

Copyright (c) 2005-2008, Cyril Briquet, parts Xavier Dalem.