Menu
If I'm using an ArrayList in C#.NET, is the order guaranteed to stay the same as the order I add items to it?
823
Yes. A List, by definition, always preserves the order of the elements. This is true not only of ArrayList, but LinkedList, Vector, and any other class that implements the java.
Java ArrayList is an ordered collection. It maintains the insertion order of the elements.
List Vs Set. 1) List is an ordered collection it maintains the insertion order, which means upon displaying the list content it will display the elements in the same order in which they got inserted into the list. Set is an unordered collection, it doesn't maintain any order.
You can use arraylist. c and hashtable. c by placing them in your project. This library uses headers generated by makeheaders .
Yes, elements are always added to the end (unless you specify otherwise, e.g. with a call to Insert). In other words, if you do:
int size = list.Count;
int index = list.Add(element);
Assert.AreEqual(size, index); // Element is always added at the end
Assert.AreEqual(element, list[index]); // Returned index is position in list
The position will change if you remove any earlier elements or insert new elements ahead of it, of course.
Is there any good reason for you to use ArrayList rather than List<T> by the way? Non-generic collections are so 2003...
(The order is stable in List<T> as well, by the way.)
129
Yes, it is, unless some piece of your code changes the order by e.g. swapping.
37
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
