Doubly-linked list implementation that implements all common list, stack and queue operations. Permits all elements (including null). Use the Typecasting package if you require lists of warcraft handles. LinkedLists should be generally used anywhere you need a list, because they are the most versatile and fast in common operations. If you need faster contains or access operations on big lists, use HashList. If you want to limit each element's occurance to one, consider HashSet.

int size

Source

function add(vararg T elems)

Source

Adds one or more elements to the end of the list (top of stack, beginning of queue)

function addAll(LinkedList elems)

Source

Adds all elements from elems to the end of this list

function addAt(T elem, int index)

Source

Adds the given element directly behind the element at the given index

function addtoStart(T elem)

Source

adds an element to the beginning of the list

function backiterator() returns LLBackIterator

Source

get a backiterator for this list

function clear()

Source

Removes all elements from the list

function copy() returns LinkedList

Source

Returns a shallow copy of this list

function dequeue() returns T

Source

Returns and removes the first added Element (FIFO)

function enqueue(T elem)

Source

adds an element to the beginning of the list

function filter(LinkedListPredicate predicate) returns LinkedList

Source

Returns a new list of the elements that satisfy the predicate

function foldl(Q startValue, FoldClosure predicate) returns Q

Source

'Folds' this list into a single value of type Q Example int-list sum: `list.foldl(0, (i, q) -> q + i)`

function forEach(LLItrClosure itr) returns LinkedList

Source

Executes the closure for each element

function get(int index) returns T

Source

Returns the element at the specified index

function getDummy() returns LLEntry

Source

function getFirst() returns T

Source

Returns the first element in the list

function getLast() returns T

Source

Returns the last element in the list

function getRandomElement() returns T

Source

Returns a random element from this list or null, if empty

function has(T elem) returns boolean

Source

Returns whether the lists contains the specified element

function indexOf(T t) returns int

Source

Returns the index of the specified element or -1 is it doesn't exist

function isEmpty() returns boolean

Source

checks whether this list is empty

function iterator() returns LLIterator

Source

get an iterator for this list

function map(MapClosure itr) returns LinkedList

Source

Returns the list obtained by applying the given closure to each element of the original list

function peek() returns T

Source

Returns the lastly added Element

function pop() returns T

Source

Returns and removes the last added Element (LIFO)

function push(T elem)

Source

Adds an element to the end of the list (top of stack, beginning of queue)

function remove(T elem) returns boolean

Source

Removes the first occurence of t from this list. Returns true if an element was removed from the list.

function removeAt(int index) returns T

Source

Removes the element and it's entry at the given index

function removeEntry(LLEntry entry)

Source

Removes an entry

function removeIf(LinkedListPredicate predicate)

Source

Removes the element if the predicates returns true

function replace(T whichElement, T newElement) returns boolean

Source

replaces the first occurence of 'whichElement' with 'newElement' returns true when an element has been replaced, false if 'whichelement' is not contained in the list

function set(int index, T elem)

Source

Sets the element at the specified index

function shuffle()

Source

Performs a Fisher–Yates shuffle on this list

function size() returns int

Source

gets the size of the list (java-compat wrapper)

function sortWith(Comparator comparator)

Source

Sorts the list according the the comparator using merge sort

function splice(LinkedList other)

Source

Adds all elements from the other list to the end of this list and removes them from the provided list. It does not add/remove elements internally, only the internal pointers of the list nodes are re-pointed. The other list will be empty, but not destroyed.

function staticBackItr() returns LLBackIterator

Source

get the static back iterator for this list

function staticItr() returns LLIterator

Source

get the static iterator for this list

function toString() returns string

Source

Prints the content of the list

function updateAll(LinkedListUpdater f)

Source

Updates all elements

interface LinkedListPredicate

Source

function isTrueFor(T t) returns boolean

Source

interface LinkedListUpdater

Source

function update(T t) returns T

Source

interface MapClosure

Source

function run(T t) returns Q

Source

Available Packages:

LinkedList

function asList(vararg T ts) returns LinkedList

function static group.asList() returns LinkedList

function LinkedList.join() returns string

function LinkedList.joinBy(string separator) returns string

function LinkedList.joinBy(ToStringClosure cls, string separator) returns string

function LinkedList.sort()

function LinkedList.sort()

function LinkedList.sort()

interface Comparator

function compare(T o1, T o2) returns int

interface FoldClosure

function run(T t, Q q) returns Q

class LLBackIterator

LLEntry current

boolean destroyOnClose

LLEntry dummy

LinkedList parent

function addBefore(T elem)

function close()

function hasNext() returns boolean

function lookahead() returns T

function modify(T newval)

function next() returns T

function reset()

class LLIterator

LLEntry current

boolean destroyOnClose

LLEntry dummy

LinkedList parent

function addBefore(T elem)

function close()

function hasNext() returns boolean

function lookahead() returns T

function modify(T newval)

function next() returns T

function previous() returns T

function remove() returns T

function reset()

interface LLItrClosure

function run(T t)

class LinkedList

int size

function add(vararg T elems)

function addAll(LinkedList elems)

function addAt(T elem, int index)

function addtoStart(T elem)

function backiterator() returns LLBackIterator

function clear()

function copy() returns LinkedList

function dequeue() returns T

function enqueue(T elem)

function filter(LinkedListPredicate predicate) returns LinkedList

function foldl(Q startValue, FoldClosure predicate) returns Q

function forEach(LLItrClosure itr) returns LinkedList

function get(int index) returns T

function getDummy() returns LLEntry

function getFirst() returns T

function getLast() returns T

function getRandomElement() returns T

function has(T elem) returns boolean

function indexOf(T t) returns int

function isEmpty() returns boolean

function iterator() returns LLIterator

function map(MapClosure itr) returns LinkedList

function peek() returns T

function pop() returns T

function push(T elem)

function remove(T elem) returns boolean

function removeAt(int index) returns T

function removeEntry(LLEntry entry)

function removeIf(LinkedListPredicate predicate)

function replace(T whichElement, T newElement) returns boolean

function set(int index, T elem)

function shuffle()

function size() returns int

function sortWith(Comparator comparator)

function splice(LinkedList other)

function staticBackItr() returns LLBackIterator