gee
Description:
Content:
Namespaces:
- Vala
Classes:
- ArrayList - Arrays of arbitrary elements which grow
automatically as elements are added.
- Collection - Serves as the base interface
for implementing collection classes. Defines size, iteration, and modification methods.
- HashMap - Hashtable implementation of the Map interface.
- HashSet - Hashtable implementation of the Set interface.
- Iterable - Implemented by classes that support
a simple iteration over instances of the collection.
- Iterator - Implemented by classes that support
a simple iteration over instances of the collection.
- List - Represents a collection of items in a well-
defined order.
- Map - A map is a generic collection of key/value
pairs.
- MapIterator - An iterator over a map.
- Set - A set is a collection without duplicates.
- TimSort - A stable, adaptive, iterative mergesort that
requires far fewer than n*lg(n) comparisons when running on partially sorted arrays, while offering performance comparable to a
traditional mergesort when run on random arrays. Like all proper mergesorts, this sort is stable and runs O(n*log(n)) time (worst
case). In the worst case, this sort requires temporary storage space for n/2 object references; in the best case, it requires only a
small constant amount of space.