You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
* Use Arrays if you know the element types and have a fixed length and/or known-up-front collection size that will not change.
* Use ArrayList if you have an unkown collection size with either unknown or mixed type elements.
* Use a Generic List<t> when know the type of the elements but not the size of the collection.
* Use a HashTable if you are going to do key based lookups on a collection and don't know the object type of the elements.
* Use a Dictionary<TKey, TValue> you are going to do key based lookups on a collection and you know the type of the elements.
* Use a HashSet<t> when you know the type of elements and just want unique values and quick lookups and assignmnets.
* Use LinkList<t> if you are going to make large numbers of additions and subtractions to an ordered list (and have the understanding to use this type)
* Use Queue<t> if you will build a collection that will need to be worked on First-in-first-out FIFO
* Use Stack<t> if you will build a collection that will need to be worked Last-in-first-out LIFO
* Use SortedSet<T> when you need a HasSet<t> like set, but sorted (alaphbetically, for example)
* Use SortedList<t> when you need a List<t>, but sorted (alaphbetically, for example)
* Use SortedDictionary<TKey, TValue> when you need a Dictionary<TKey, TValue>, but sorted (alaphbetically, for example)
## Avoid the following:
* Do not use Object[]
* Do not use += on Arrays. If your collection will grow or shrink, use ArrayList or List<t>
* Do not use List<Object> for value types (int32, int64, char, etc)
* avoid using Arrays, Lists, and ArrayLists for lookup/search operations, use ditcionaries and sets instead
* Linked lists should only be considered in rediculously high volume add/remove operations to a list as the code complexity is too much for PowerShell
* Only use "sorted" types when you really need to. If you only need it for reconstituion, sorting the keys and then foreaching them can work on small collections