Difference between revisions of "Collections Csharp"
From Teknologisk videncenter
m (added Category:Csharp using HotCat) |
m |
||
| Line 1: | Line 1: | ||
| − | *[[list Csharp|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. | + | *[[list<T> Csharp|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 Csharp|Queue<T>]] - A First-in First-out (FIFO) data structure. | *[[Queue Csharp|Queue<T>]] - A First-in First-out (FIFO) data structure. | ||
*[[Stack Csharp|Stack<T>]] - A First-in Last-out (FILO) data structrure | *[[Stack Csharp|Stack<T>]] - A First-in Last-out (FILO) data structrure | ||
Revision as of 11:55, 19 January 2017
- [[list<T> Csharp|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.