Gee

---

Description:

Content:

Classes:

• AbstractBidirList
• AbstractBidirSortedMap - Skeletal implementation of the BidirSortedSet interface.
• AbstractBidirSortedSet - Skeletal implementation of the BidirSortedSet interface.
• 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.
• AbstractSortedMap
• AbstractSortedSet - Skeletal implementation of the SortedSet interface.
• ArrayList - Resizable array implementation of the List interface.
• ArrayQueue - Resizable array implementation of the Deque interface.
• ConcurrentList - A single-linked list. This implementation is based on Mikhail Fomitchev and Eric Ruppert paper .
• ConcurrentSet - A skip-linked list. This implementation is based on Mikhail Fomitchev Master Thesis.
• 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.
• HazardPointer - Hazard pointer is a method of protecting a pointer shared by many threads. If you want to use atomic pointer that may be freed you should use following code:
• Lazy - Represents a lazy value. I.e. value that is computed on demand.
• LinkedList - Doubly-linked list implementation of the List interface.
• PriorityQueue - Relaxed fibonacci heap priority queue implementation of the Queue.
• Promise - Promise allows to set a value with associated Future. Please note that value can be stored only once.
• 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.
• UnrolledLinkedList - Unrolled doubly-linked list implementation of the List interface.

Delegates:

• public delegate bool EqualDataFunc<T> (T a, T b)
  A function comparing two object defining equivalence relationship.
• public delegate Iterator<A> FlatMapFunc<A,G> (owned G g)
• public delegate A FoldFunc<A,G> (owned G g, owned A a)
• public delegate A FoldMapFunc<A,K,V> (K k, V v, owned A a)
• public delegate bool ForallFunc<G> (owned G g)
• public delegate bool ForallMapFunc<K,V> (K k, V v)
• public delegate uint HashDataFunc<T> (T v)
  A function producing a hash for an object. Two hashes of equal objects (as specified by corresponding EqualDataFunc) have to be equal.
• public delegate G LazyFunc<G> ()
• public delegate A MapFunc<A,G> (owned G g)
• public delegate bool Predicate<G> (G g)
• public delegate Stream StreamFunc<G,A> (Stream state, owned Lazy<G>? g, out Lazy<A>? lazy)
• public delegate G Task<G> ()
• public delegate Lazy<A>? UnfoldFunc<A> ()

Methods:

• public async void async_task () throws ThreadError
  Continues the execution asynchroniously in helper thread. Internally one of threads from pool will execute the task.
• public Future<G> task<G> (owned Task<G> task) throws ThreadError
  Schedules a task to execute asynchroniously. Internally one of threads from pool will execute the task.