Several common usage of collections

// list basis of comparison do not write other less commonly used

// Dictionary 字典

Dictionary<int, EQInfo> eqs = new Dictionary<int, EQInfo>();
EQInfo tempInfo = new EQInfo();
for (int i = 1; i <= 11; i++)
{
tempInfo.ID = 1212 * i;
tempInfo.buyMoney = 220 * i;
tempInfo.sealMoney = 110 * i;
eqs.Add(tempInfo.ID, tempInfo);
}

EQInfo tempEq;
if (eqs.TryGetValue(1212, out tempEq))
{
Console.WriteLine(tempEq.buyMoney + " " + tempEq.sealMoney);
}var dicSort = from objDic in eqs orderby objDic.Value.buyMoney descending select objDic;

foreach (KeyValuePair<int, EQInfo> item in dicSort)
{
Console.WriteLine(item.Value.buyMoney);
}

 

//字典降序排序方法
public static void DictonarySort(Dictionary<string, int> dic)
{
var dicSort = from objDic in dic orderby objDic.Value descending select objDic;

foreach (KeyValuePair<string, int> kvp in dicSort)
Console.WriteLine(kvp.Key + "：" + kvp.Value + "<br />");
}

// dictionary sorted by ascending
public static void DictonarySort (the Dictionary <String, int> DIC)
{
var = dicSort in DIC from objDic OrderBy objDic.Value  Ascending  SELECT objDic;

foreach (KeyValuePair<string, int> kvp in dicSort)
Console.WriteLine(kvp.Key + "：" + kvp.Value + "<br />");
}

// Stack LIFO stack

Stack <int> = new new STA Stack <int> ();
// int = staCou sta.Count;
for (int I = 0; I <10; I ++)
{
sta.Push (I) ; // stack
}
sta.Pop (); // a stack
the foreach (STA in Item var)
{
Console.WriteLine (Item);
}

// FIFO queue queue

queue <int> que = new queue <int> ();
for (int I = 0; I <10; I ++)
{
que.Enqueue (I);
}

Console.WriteLine(que.Dequeue() + "----------");
foreach (var item in que)
{
Console.WriteLine(item);