Skip to main content

What is the default Capacity of List(Stack, Queue)?

Under the hood Lists (Stacks and Queues) rely on array to store their items. Whenever we create a empty list the default capacity of the list will be 0. At this time the underline array will be empty. In the code below we are creating an empty list and then we are writing its capacity in console.
List<int> number = new List<int>();
Console.WriteLine(number.Capacity);
The code returns 0. Now lets add an item to the list.
List<int> number = new List<int>();
number.Add(10);
Console.WriteLine(number.Capacity);
Console.ReadLine();
If we run this code it shows 4 as capacity, but we added only 1 item then why we are getting 4 as capacity?
Actually, it starts with a Capacity of 0. When you add the first element, the current implementation allocates a capacity of 4. After that, the capacity keeps doubling if expansion is needed, to guarantee amortized O(1) operation. Code below should demonstrate the current behavior
List<int> list = new List<int>();
int capacity = list.Capacity;
Console.WriteLine(“Capacity: ” + capacity);
for (int i = 0; i < 100000; i++)
{
list.Add(i);
if (list.Capacity > capacity)
{
capacity = list.Capacity;
Console.WriteLine(“Capacity: ” + capacity);
}
}
Console.ReadLine();
In simpler words whenever we add first element in the list, framework creates an array of size 4 and use it to store list’s elements. As soon as we add 5th element in the list framework create another array of size 8, copy all 4 list elements from the old array to new array and then add new element to the new array. Now when we add 9th element framework creates and new array of size 16 and copy elements from older array to new array and add newly added element. This creation of new array and copying of older elements keep repeating whenever we reach the size of underline array. All this operation require time and operation and hits performance. It is a good idea to initialize a list with required capacity in advance, if we know how many Items we need to store in a list . So, if you know that you may have from, say, 50 to 60 items in your list, create a list with capacity 60 and no memory deallocation will happen and Garbage Collector will not have to clean up old arrays.

Comments

Post a Comment

Popular posts from this blog

Accessing File Stored in Windows Azure Blob Storage Using jQuery

Did you know it was possible to access the Windows Azure Blob Storage directly from JavaScript, for example using jQuery? At first, it sounds obvious, since Blobs are after all accessible from a public UR. But in practice, there is a very big hurdle: the Web browser’s Same Origine Policy or SOP, that restricts JavaScript code to accessing resources originating from the same site the script was loaded from. This means that you will never be able to load a Windows Azure Blob using XMLHttpRequest for example! Fortunately, there is a popular workaround called JSONP (“JSON with Padding”). The idea behind this technique is that the script tag is not submitted to the SOP: an HTML page can thus load a JavaScript file from any site. So, if you expose your data in an “executable” form in JavaScript, a page will be able to load this data using a script tag. For example: <script type=”text/javascript” src=”http://www.sandeepknarware.in/exemple.jsonp”> </script> But how can ...
Post a Comment
Read more

Support for debugging lambda expressions with Visual Studio 2015

Anyone who uses LINQ (or lambdas in general) and the debugger will quickly discover the dreaded message “Expression cannot contain lambda expressions”. Lack of lambda support has been a limitation of the Visual Studio Debugger ever since Lambdas were added to C# and Visual Basic.  With visual studio 2015 Microsoft has added support for debugging lambda expressions. Let’s first look at an example, and then I’ll walk you through current limitations. Example To try this yourself, create a new C# Console app with this code: using System.Diagnostics; using System.Linq; class Program { static void Main() { float[] values = Enumerable.Range(0, 100).Select(i => (float)i / 10).ToArray(); Debugger.Break(); } } Then compile, start debugging, and add “values.Where(v => (int)v == 3).ToArray()” in the Watch window. You’ll be happy to see the same as what the screenshot above shows you. I am using Visual Studio 2015 Preview and it has some limitati...
1 comment
Read more

gcAllowVeryLargeObjects Element

There are numerous new features coming with .NET 4.5 and here, on this blog, you can find several posts about it. But the feature we are goint to talk about today is very exciting, because we were waiting for it more than 10 years. Since .NET 1.0 the memory limit of .NET object is 2GB. This means you cannot for example create array which contains elements with more than 2GB in total. If try to create such array, you will get the OutOfMemoryException. Let’s see an example how to produce OutOfMemoryException. Before that Open Visual Studio 2012, and create C# Console Application, like picture below. First lets create simple struct with two double members like example below: 1 2 3 4 5 6 7 8 9 10 11 12 public struct ComplexNumber {      public double Re;      public double Im;      public ComplexNumber( double re, double im)      {    ...
Post a Comment
Read more