9collection in c#
Download as PPTX, PDF0 likes160 views
This document discusses collections in C#. It describes that collections allow storing, updating, deleting, retrieving, searching, and sorting objects. There are three main namespaces for collections: System.Collections.Generic, System.Collections, and System.Collections.Concurrent. Common collection classes include List, Stack, Queue, LinkedList, HashSet, SortedSet, Dictionary, and SortedDictionary. The document provides details on each collection class and their purposes.
9collection in c#
- 1. C# Tutorial Part 10 :Collections www.sirykt.blogspot.com
- 2. • In C#, collection represents group of objects. By the help of collections, we can perform various operations on objects such as • store object • update object • delete object • retrieve object • search object, and • sort object • In sort, all the data structure work can be performed by C# collections. • We can store objects in array or collection. Collection has advantage over array. Array has size limit but objects stored in collection can grow or shrink dynamically. • Types of Collections in C# • There are 3 ways to work with collections. The three namespaces are given below: • System.Collections.Generic classes • System.Collections classes (Now deprecated) • System.Collections.Concurrent classes
- 3. • 1) System.Collections.Generic classes • The System.Collections.Generic namespace has following classes: • List • Stack • Queue • LinkedList • HashSet • SortedSet • Dictionary • SortedDictionary • SortedList • 2) System.Collections classes • These classes are legacy. It is suggested now to use System.Collections.Generic classes. The System.Collections namespace has following classes: • ArrayList • Stack • Queue • Hashtable
- 4. • 3) System.Collections.Concurrent classes • The System.Collections.Concurrent namespace provides classes for thread-safe operations. Now multiple threads will not create problem for accessing the collection items. • The System.Collections.Concurrent namespace has following classes: • BlockingCollection • ConcurrentBag • ConcurrentStack • ConcurrentQueue • ConcurrentDictionary • Partitioner • Partitioner • OrderablePartitioner
- 5. • C# List<T> class is used to store and fetch elements. It can have duplicate elements. It is found in System.Collections.Generic namespace. • C# HashSet class can be used to store, remove or view elements. It does not store duplicate elements. • It is suggested to use HashSet class if you have to store only unique elements. It is found in System.Collections.Generic namespace. • C# SortedSet class can be used to store, remove or view elements. It maintains ascending order and does not store duplicate elements. • It is suggested to use SortedSet class if you have to store unique elements and maintain ascending order. It is found in System.Collections.Generic namespace.
- 6. • C# Stack<T> class is used to push and pop elements. It uses the concept of Stack that arranges elements in LIFO (Last In First Out) order. • It can have duplicate elements. It is found in System.Collections.Generic namespace. • C# Queue<T> class is used to Enqueue and Dequeue elements. It uses the concept of Queue that arranges elements in FIFO (First In First Out) order. • It can have duplicate elements. It is found in System.Collections.Generic namespace. • C# LinkedList<T> class uses the concept of linked list. • It allows us to insert and delete elements fastly. It can have duplicate elements. It is found in System.Collections.Generic namespace.
- 7. • C# Dictionary<TKey, TValue> class uses the concept of hashtable. It stores values on the basis of key. • It contains unique keys only. • By the help of key, we can easily search or remove elements. • It is found in System.Collections.Generic namespace. • C# SortedDictionary<TKey, TValue> class uses the concept of hashtable. • It stores values on the basis of key. • It contains unique keys and maintains ascending order on the basis of key. • By the help of key, we can easily search or remove elements. • It is found in System.Collections.Generic namespace.
- 8. • C# SortedList<TKey, TValue> • C# SortedList<TKey, TValue> is an array of key/value pairs. It stores values on the basis of key. • The SortedList<TKey, TValue> class contains unique keys and maintains ascending order on the basis of key. • By the help of key, we can easily search or remove elements. It is found in System.Collections.Generic namespace. • It is like SortedDictionary<TKey, TValue> class. • C# SortedList<TKey, TValue> vs SortedDictionary<TKey, TValue> • SortedList<TKey, TValue> class uses less memory than SortedDictionary<TKey, TValue>. • It is recommended to use SortedList<TKey, TValue> if you have to store and retrieve key/valye pairs. • The SortedDictionary<TKey, TValue> class is faster than SortedList<TKey, TValue> class if you perform insertion and removal for
- 9. SIRYKT Sharing Knowledge is Learning
- 10. For more updates For more visit our website www.sirykt.blogspot.com