Difference between revisions of "Collections Csharp"
From Teknologisk videncenter
m (Created page with "*List<T> - A list of objects that can be accessed by index as an array. But with additional methods to search, sort, delete, push any many other methods. *[[Queue...") |
m |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
*[[Dictionary Csharp|Dictionary<TKey,TValue>]] A collection of values that can be indentified and retreived using a key. | *[[Dictionary Csharp|Dictionary<TKey,TValue>]] A collection of values that can be indentified and retreived using a key. | ||
*[[SortedList Csharp|SortedList<TKey, TValue>]] A sorted list of key/Value pairs. Keys must be implement IComparable<T> interface. | *[[SortedList Csharp|SortedList<TKey, TValue>]] A sorted list of key/Value pairs. Keys must be implement IComparable<T> interface. | ||
| + | |||
| + | [[Category:Csharp]] | ||
Latest revision as of 11:56, 19 January 2017
- List<T> - A list of objects that can be accessed by index as an array. But with additional methods to search, sort, delete, push any many other methods.
- Queue<T> - A First-in First-out (FIFO) data structure.
- Stack<T> - A First-in Last-out (FILO) data structrure
- LinkedList<T> - A double-ended ordered list optimized to insert and remove at either end. Can function as a Queue<T> or an Stack<T> but also supports random access as List<T>
- Hashset<T> An unordered set of values optimized for fast retrival.
- Dictionary<TKey,TValue> A collection of values that can be indentified and retreived using a key.
- SortedList<TKey, TValue> A sorted list of key/Value pairs. Keys must be implement IComparable<T> interface.