kafka.utils

DoublyLinkedList

class DoublyLinkedList[T] extends AnyRef

A simple doubly linked list util to allow O(1) remove.

T

type of element in nodes

Annotations
@threadsafe()
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. DoublyLinkedList
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DoublyLinkedList()

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. def add(node: DoublyLinkedListNode[T]): Unit

    Add offset to the tail of the list

    Add offset to the tail of the list

    node

    the node to be added to the tail of the list

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  14. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  15. def iterator: Iterator[DoublyLinkedListNode[T]]

  16. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  17. final def notify(): Unit

    Definition Classes
    AnyRef
  18. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  19. def peek(): DoublyLinkedListNode[T]

    Get the first node in the list without removing it.

    Get the first node in the list without removing it.

    returns

    the first node in the list.

  20. def remove(): DoublyLinkedListNode[T]

    Remove the first node in the list and return it if the list is not empty.

    Remove the first node in the list and return it if the list is not empty.

    returns

    The first node in the list if the list is not empty. Return Null if the list is empty.

  21. def remove(node: DoublyLinkedListNode[T]): Unit

    Remove a node from the list.

    Remove a node from the list. The list will not check if the node is really in the list.

    node

    the node to be removed from the list

  22. def size: Int

  23. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  24. def toString(): String

    Definition Classes
    AnyRef → Any
  25. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped