DoubleLinkedList.Node (Javadocs: diewald_CV_kit)

Overview | Package | Class | Tree | Deprecated | Index | Help

PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

## diewald_CV_kit.utility
Class DoubleLinkedList.Node<T>

    java.lang.Object
      diewald_CV_kit.utility.DoubleLinkedList.Node<T>

Type Parameters:
  `T` -

Enclosing class:
  DoubleLinkedList<E>

    public final class DoubleLinkedList.Node<T>

extends Object

each node has a link to a next node, and a link to a previous node, which actually defines a double-linked-list.

Author:
  thomas

Method Summary
`T` | `get()` returns the nodes value.

Methods inherited from class java.lang.Object
`equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`

Method Detail

### get

    public final T get()

  returns the nodes value.

  Returns:
    the nodes value.

Overview | Package | Class | Tree | Deprecated | Index | Help

PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

Processing library diewald_CV_kit by Thomas Diewald. (C) 2012