Working With Lists in C#

In today's discussion, we'll see how to implement Lists. So, what is a List? To answer this questions, Lists are like arrays. That means they are an index-based collection with some bonus features like supporting adding and removing the elements from the collection. Below, in the snippet I have an array of months containing the months until November. However, I attempted to add December to the collection and found the following error.

using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System;
namespace Collections
{
internal class Array
{
private static void Main(string[] args)
{
var monthsofYear = new string[]
{
"January",
"February",
"March",
"April",
"May",
"June",
"July",
"August",
"September",
"October",
"November"
};
//Nice to have this feature
monthsofYear.Add("December");
foreach (var month in monthsofYear)
{
Console.WriteLine(month);
}
Console.ReadLine();
}
}
}

Since arrays are a readonly collection, it can't grow or shrink. Hence, to fix this problem, Lists are introduced. Now, with a minimal change when I run it, it will produce the expected output.

using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System;
namespace Collections
{
internal class Array
{
private static void Main(string[] args)
{
var monthsofYear = new List<string>
{
"January",
"February",
"March",
"April",
"May",
"June",
"July",
"August",
"September",
"October",
"November"
};
//Nice to have this feature
monthsofYear.Add("December");
foreach (var month in monthsofYear)
{
Console.WriteLine(month);
}
Console.ReadLine();
}
}
}

However, one point to note here is that a List is a wrapper around array Array[T]. So, when we execute the List code, what we get is a new list reference with the modified item in it. However, when the List is created it always allocates an extra block of memory to accommodate new incoming requests to add the element to the List. Now, there are two main properties associated with List. They are:

Count: which gives the total no of elements present in the list.
Capacity: gives the total no of count including extra block of memory to accommodate new ones.

Let's do a quick demo around this to prove the point.

using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System;
namespace Collections
{
internal class Array
{
private static void Main(string[] args)
{
var monthsofYear = new List<string>
{
"January",
"February",
"March",
"April",
"May",
"June",
"July",
"August",
"September",
"October",
"November"
};
Console.WriteLine("Count:{0} and Capacity:{1} before!",monthsofYear.Count,monthsofYear.Capacity);
monthsofYear.Add("December");
Console.WriteLine("Count:{0} and Capacity:{1} after!",monthsofYear.Count,monthsofYear.Capacity);
foreach (var month in monthsofYear)
{
Console.WriteLine(month);
}
Console.ReadLine();
}
}
}

So I can proceed and add up to 16 items to the same list and its capacity won't change, but let's assume that I add one more item to it as shown below, then the List's capacity will be reevaluated and then it will drop the existing internal array and create a new array with the capacity 32 as shown below. Remember, as I said, Lists are a wrapper around arrays. So, under the hood arrays are only working to hold the elements.

using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System;
namespace Collections
{
internal class Array
{
private static void Main(string[] args)
{
var monthsofYear = new List<string>
{
"January",
"February",
"March",
"April",
"May",
"June",
"July",
"August",
"September",
"October",
"November"
};
Console.WriteLine("Count:{0} and Capacity:{1} before!",monthsofYear.Count,monthsofYear.Capacity);
monthsofYear.Add("December");
monthsofYear.Add("1");
monthsofYear.Add("2");
monthsofYear.Add("3");
monthsofYear.Add("4");
monthsofYear.Add("5");
Console.WriteLine("Count:{0} and Capacity:{1} after!",monthsofYear.Count,monthsofYear.Capacity);
foreach (var month in monthsofYear)
{
Console.WriteLine(month);
}
Console.ReadLine();
}
}
}

However, this dynamic allocation of capacity could create performance issues when it comes to recreating the array and reference it when there are millions of item in the list, but if you are roughly sure about the list's capacity well in advance, then you can use the pass the capacity size as shown below in the snippet.

using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System;
namespace Collections
{
internal class Array
{
private static void Main(string[] args)
{
var monthsofYear = new List<string>(20)
{
"January",
"February",
"March",
"April",
"May",
"June",
"July",
"August",
"September",
"October",
"November"
};
Console.WriteLine("Count:{0} and Capacity:{1} before!",monthsofYear.Count,monthsofYear.Capacity);
monthsofYear.Add("December");
monthsofYear.Add("1");
monthsofYear.Add("2");
monthsofYear.Add("3");
monthsofYear.Add("4");
monthsofYear.Add("5");
Console.WriteLine("Count:{0} and Capacity:{1} after!",monthsofYear.Count,monthsofYear.Capacity);
foreach (var month in monthsofYear)
{
Console.WriteLine(month);
}
Console.ReadLine();
}
}
}

So, here I passed 20 as the capacity, hence it produced the capacity 20 before and after it. Now, let's talk about the remove operation. Below in the screen shot, Intellisense has listed all the remove options available for the list.

You can use either of the following mentioned options to remove the item. Both of these operations will do the same thing but the later one will be expensive, since it needs to scan all the elements of the list until it finds the required element. However, RemoveAt will simply jump on that index and remove the element. Even after removing the element, the List will reorganize internally, so if the removal is the last element of the list, then it will be the fastest operation and if the removal of the element is the top element, then it will be the slowest operation.

//Index based
monthsofYear.RemoveAt(11);
//Value based
monthsofYear.Remove("December");

One more thing here is that you can extend it to the readonly collection. Now, let's assume that you want to pass your collection to some other code whom you don't want this flexibility to modify your List. So, in order to do that you can use the List with readonly collection as shown below.

using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System;
namespace Collections
{
internal class Array
{
private static void Main(string[] args)
{
var monthsofYear = new List<string>(20)
{
"January",
"February",
"March",
"April",
"May",
"June",
"July",
"August",
"September",
"October",
"November"
};
monthsofYear.Add("December");
var lstCopy = monthsofYear.AsReadOnly();
callingMonths(lstCopy);
foreach (var month in monthsofYear)
{
Console.WriteLine(month);
}
Console.ReadLine();
}
static void callingMonths(IList<string> lstList )
{
lstList.RemoveAt(5);
}
}
}

Now, if I execute it then it will throw the following exception. One more point to note here is that I am using IList here. That means I can get or set the value based on index on the collection being passed.

One point of caution here, even this code can be modified using reflection. To circumvent that we can modify the code a bit as shown below.

//To avoid the collection from get modified at reflection level
var lstCopy= new ReadOnlyCollection<string>(monthsofYear);

Now, let's look at another collection and that is Collection<T>. This provides an implementation of IList<T>. In fact, this is very similar to a readonly collection, the only change is that you can modify the collection here. However, there is already a good implementation of IList<T>, so why is Collection<T> required? To answer this question, List<T> is very efficient but it can't be customized. However, Collection<T> is specifically designed to be derived from, hence it's highly customizable. Below, in the screen shot, you can see various virtual methods available to be overridden.

So, here I can proceed and implement any of these and test for specific checks as shown below.

class collectionClass:Collection<string>
{
protected override void InsertItem(int index, string item)
{
if(string.IsNullOrEmpty(item))
throw new Exception("Passed element is not valid");
base.InsertItem(index, item);
}
}

Now, let's look at the ObservableCollection<T>. Now, this is one of the most famous collections to track the changes. As soon as a list is modified, it will send the notification.

using System.Collections;
using System.Collections.Generic;
using System.Collections.ObjectModel;
using System.Linq;
using System;
namespace Collections
{
internal class Array
{
private static void Main(string[] args)
{
ObservableCollection<string> monthsofYear = new ObservableCollection<string>
{
"January",
"February",
"March",
"April",
"May",
"June",
"July",
"August",
"September",
"October",
"November"
};
monthsofYear.CollectionChanged += monthsofYear_CollectionChanged;
monthsofYear.Add("December");
foreach (var month in monthsofYear)
{
Console.WriteLine(month);
}
Console.ReadLine();
}
static void monthsofYear_CollectionChanged(object sender, System.Collections.Specialized.NotifyCollectionChangedEventArgs e)
{
Console.WriteLine("Collection changed with action {0} and item:{1} added to collection", e.Action, e.NewItems[0]);
}
}
}

Now, when I run it, it will produce the following output showing that the action Add added an item (December) to the collection.

With this I would like to end this List module here only. In the next section, we'll pick some other module and explain it. Until then stay tuned and Happy Coding.

8 Comments

Join the conversation! Your thoughts help the community grow.

Vipul Malhotra11y ago
nice article
Debasis Saha11y ago
Nice Article..
Santhakumar Munuswamy11y ago
Good work
Dominique Ceja11y ago
Good article
Sibeesh Venu11y ago
Good one.
Rakesh11y ago
Good one
Rajeesh Menoth11y ago
Good Rahul Sahay
Gopi Chand11y ago
Well explained