. NET Collection class, some instructions for using the

In the absence of today's research, I always thought that the collection class only ArrayList and Hashtable is useful. After reading the book this morning, I have a deeper understanding of the collection class. The following code will be VB and C # interspersed with speaking. Because I C # and VB will, because some functions of C # function is not very good, so the use of VB.

The 1:collection of Hua Dan is certainly an array. The array is defined by the following methods:

Int[] Int_array=new int[10]

int[] Myintarray = new Int[5] {1, 2, 3, 4, 5};
The above two words, I do not have much to explain.

2: The structure is used in the array, the code is as follows:

Create a class:

Class Test
{
public string Str_name;
public string Str_phone;
}
References to and use of this class:

Test[] Mytest=new test[3];
for (int i=0;i<mytest. length;i++)
{
Mytest[i]=new test ();
}
Mytest[0].str_name= "Hello";
Mytest[1].str_name= "world!";
Mytest[0].str_phone= "Hahah";

3:arraylist

ArrayList I will not say more, anyway, his biggest feature is the sort.

4:hashtable

The disadvantage of Hashtable is that it does not support sorting. Unfortunately, also in C # based on key to fetch value is very troublesome.

5:sortedlist

The use of SortedList and ArrayList method is similar, just sortedlist automatic sorting.

6:stack

Dim St as New Stack
St. Push ("AA")
St. Push ("BB")

Stack is antithesis, according to the principle of advanced after

7:queue

Dim Myque as New System.Collections.Queue
Myque. Enqueue ("AA")

Queue in stack just the opposite, the queue is a FIFO principle to come.

8:specialized

Specialized below have a lot of strength, oneself go to use just OK.

9: Enumerate VB and C # Examples:

Vb:

Dim ie as System.Collections.IEnumerator = al. Keys.getenumerator
Dim str as String = ""
while (ie. MoveNext)
str + IE. Current
End While

C#:

System.Collections.IEnumerator IE=SL. Keys.getenumerator ();
String Str= "";
while (ie. MoveNext ())
{
Str+=ie. Current.tostring ();
}