Options
All
  • Public
  • Public/Protected
  • All
Menu

TypeScriptCollectionsFramework https://github.com/larrydiamond/typescriptcollectionsframework

Interface Summary 
Interface Description
Collectable<E>
A comparison function, which compares objects for equality.
Collection<E>
The root mutable interface in the collection hierarchy.
Comparator<E>
A comparison function, which imposes a total ordering on some collection of objects.
Deque<E>
A linear collection that supports element insertion and removal at both ends.
Hashable<E>
A comparison function which compares objects for equality and a function for determining a hash code.
ImmutableCollection<E>
The root immutable interface in the collection hierarchy.
ImmutableList<E>
An immutable ordered collection (also known as a sequence).
ImmutableMap<K,V>
An immutable object that maps keys to values.
ImmutableSet<E>
A collection that contains no duplicate elements.
JIterator<E>
An iterator over a collection.
JMap<K,V>
An object that maps keys to values.
JSet<E>
A collection that contains no duplicate elements.
List<E>
An ordered collection (also known as a sequence).
MapEntry<K,V>
A map entry (key-value pair).
NavigableMap<K,V>
A Map that further provides a total ordering and extended with navigation methods returning the closest matches for given search targets.
NavigableSet<E>
A Set that further provides a total ordering and extended with navigation methods returning the closest matches for given search targets.
Queue<E>
A collection designed for holding elements prior to processing.

Class Summary 
Class Description
AllFieldCollectable<E>
An implementation of the Collectable interface that operates on all fields in the object
AllFieldHashable<E>
An implementation of the Hashable interfaces that operates on all fields in the object
ArrayList<E>
Resizable-array implementation of the JList interface.
Collections<E>
This class consists exclusively of static methods that operate on or return collections.
HashMap<K,V>
Hash implementation of the JMap interface
HashSet<E>
Hash implementation of the JSet interface
LinkedList<E>
Doubly-linked list implementation of the JList interface.
PriorityQueue<E>
An unbounded priority queue based on a priority heap.
SkipListMap<K,V>
Skiplist implementation of the JMap interface
SkipListSet<E>
Skiplist implementation of the JSet interface
TreeMap<K,V>
A binary tree based NavigableMap implementation.
TreeSet<E>
A binary tree based NavigableSet implementation.

Generated using TypeDoc