Removes all contents from the LinkedHashMap
Create a new LinkedHashMap of the same size and copy the contents of the LinkedHashMap into it.
Looks up key, if it exsists returns the corresponding value else evaluates and returns defaultValue.
foreach iteration uses opApply.
in operator. Check to see if the given element exists in the container.
Indexing operators yield or modify the value at a specified index.
Reorganizes the LinkedHashMap in place so that lookups are more efficient, rehash is effective when, for example, the program is done loading up a symbol table and now needs fast lookups in it.
remove(key) does nothing if the given key does not exist and returns false. If the given key does exist, it removes it from the HashMap and returns true.
Returns a delegate suitable for use as a ForeachAggregate to a ForeachStatement which will iterate over the keys of the LinkedHashMap.
Returns a delegate suitable for use as a ForeachAggregate to a ForeachStatement which will iterate over the values of the LinkedHashMap.
An hash map that allows iteration in the insertion-order.