Gee Reference Manual
Packages
gee-1.0
Gee
Functions
BidirIterator
Collection
Comparable
Deque
Iterable
Iterator
List
ListIterator
Map
MapIterator
MultiMap
MultiSet
Queue
Set
SortedSet
AbstractCollection
AbstractList
AbstractMap
AbstractMultiMap
AbstractMultiSet
AbstractQueue
AbstractSet
ArrayList
HashMap
HashMultiMap
HashMultiSet
HashSet
LinkedList
PriorityQueue
TreeMap
TreeMultiMap
TreeMultiSet
TreeSet
direct_compare
Gee
Description:
Content:
Namespaces:
Functions
Helpers for equal, hash and compare functions.
Interfaces:
BidirIterator
-
A bi-directional iterator.
Collection
-
A generic collection of objects.
Comparable
-
This interface defines a total ordering among instances of each class implementing it.
Deque
-
A double-ended queue.
Iterable
-
An object that can provide an
Iterator
.
Iterator
-
An iterator over a collection.
List
-
An ordered collection.
ListIterator
-
A list iterator. This supports bi-directionnal and index-based iteration.
Map
-
An object that maps keys to values.
MapIterator
-
An iterator over a map.
MultiMap
-
A map with multiple values per key.
MultiSet
-
A collection with duplicate elements.
Queue
-
A collection designed for holding elements prior to processing.
Set
-
A collection without duplicate elements.
SortedSet
-
A sorted set, which you can navigate over and get sub-sets of.
Classes:
AbstractCollection
-
Skeletal implementation of the
Collection
interface.
AbstractList
-
Skeletal implementation of the
List
interface.
AbstractMap
-
Skeletal implementation of the
Map
interface.
AbstractMultiMap
-
Skeletal implementation of the
MultiMap
interface.
AbstractMultiSet
-
Skeletal implementation of the
MultiSet
interface.
AbstractQueue
-
Skeletal implementation of the
Queue
interface.
AbstractSet
-
Skeletal implementation of the
Set
interface.
ArrayList
-
Resizable array implementation of the
List
interface.
HashMap
-
Hash table implementation of the
Map
interface.
HashMultiMap
-
Hash table implementation of the
MultiMap
interface.
HashMultiSet
-
Hash table implementation of the
MultiSet
interface.
HashSet
-
Hash table implementation of the
Set
interface.
LinkedList
-
Doubly-linked list implementation of the
List
interface.
PriorityQueue
-
Relaxed fibonacci heap priority queue implementation of the
Queue
.
TreeMap
-
Left-leaning red-black tree implementation of the
Map
interface.
TreeMultiMap
-
Left-leaning red-black tree implementation of the
MultiMap
interface.
TreeMultiSet
-
Left-leaning red-black tree implementation of the
MultiSet
interface.
TreeSet
-
Left-leaning red-black tree implementation of the
Set
interface.
Methods:
public
int
direct_compare
(
void
* _val1,
void
* _val2)
Compares two arbitrary elements together.
Generated by
Valadoc