HashList
Sourceclass HLIterator
Source
int i
Source
HashList list
Source
 function close()
Source
 function hasNext() returns boolean
Source
 function next() returns Q
Source
 function remove()
Source
 function reset()
Source
interface HLItrClosure
Source
 function run(T t)
Source
class HashList
Source
HashLists are used if you require quick contains operations
on a large list object. LinkedLists should be generally used, but are slow in this regard.
Removing elements from a HashList is slower than of LinkedLists.
 function add(vararg T elems)
Source
 Add an element to the end of the list 
 function addAll(HashList elems)
Source
 Add all elements from elems to this list 
 function clear()
Source
 Remove all elements from this list without destroying it 
 function copy() returns HashList
Source
 Returns a shallow copy of this list 
 function count(T elem) returns int
Source
 Returns the number of occurences of an element in this list 
 function forEach(HLItrClosure itr) returns HashList
Source
 Executes the closure for each element 
 function get(int index) returns T
Source
 Get the element at the given index from this list 
 function getRandomElement() returns T
Source
 function has(T elem) returns boolean
Source
 Return whether the element exists in the list 
 function hasAt(int index) returns boolean
Source
 Return whether the element exists in the list 
 function isEmpty() returns boolean
Source
 Return whether the list is empty 
 function iterator() returns HLIterator
Source
 Get an iterator for this list 
 function remove(T t) 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 and returns the element at the given index 
 function removeIf(RemovePredicate predicate)
Source
 Removes the element if the predicates returns true 
 function set(int index, T elem)
Source
 Set an element at the given index.
If the index is higher than the list's size,
the list will be resized with null elements added between
the index and the previous size. 
 function size() returns int
Source
 Get the size of the list 
 function staticItr() returns HLIterator
Source
 get the static iterator for this list 
interface RemovePredicate
Source
 function shouldRemove(T element) returns boolean
Source