There are different types of data-structure present in the AS3-Collection-Framework. Each of it has it's advantages and disadvantages. So before using it, it's recommended to first think about the requirement.
ICollection
- Definition: Root interface of the collection framework (based on Java-Collection-Framework).
IList
- Definition: The user of this interface has precise control over where in the list each element is inserted. The user can access elements by their integer index (position in the list), and search for elements in the list.
Concrete implementations: ArrayList and LinkedList.
ISet
- Definition: A collection that contains no duplicate elements and at most one null element.
Concrete implementations: ArraySet and LinkedSet.
ISortedSet
- Definition: A Set that further provides a total ordering on its elements. The elements are ordered by a Comparator provided at sorted set creation time. The set's iterator will traverse the set in ascending element order.
Concrete implementations: SortedArraySet.
IStack
- Definition: The IStack interface represents a last-in-first-out (LIFO) stack of elements.
Concrete implementations: ArrayStack and LinkedStack.
IQueue
- Definition: A collection designed for holding elements prior to processing. IQueue implementations generally do not allow insertion of null elements.
Concrete implementations: ArrayQueue and LinkedQueue.
IMap
- Definition: An object that maps keys to values. A map cannot contain duplicate keys; each key can map to at most one value.
Concrete implementations: HashMap.
