Use sortedlist in C #

1. Using system;
2. Using system. Collections. Generic;
3. Using system. LINQ;
4. Using system. text;
6. Namespace set
7. {
8. Class ordered table
9. {
10. Public static void main ()
11. {
12. // If you want to use a sorted table, you can use sortedlist <tkey, tvalue> to sort the elements.
13. Sortedlist <string, string> books = new sortedlist <string, string> ();
15. Books. Add ("Aladdin", "64kb@163.com ");
16. Books. Add ("zhaohaifu", "65kb@163.com ");
17. Books. Add ("Jacky", "66kb@163.com ");
18. Books. Add ("fuck", "67kb@163.com ");
20. // Duplicate keys are not allowed. Next we use the add method to add Aladdin again.
21. // Books. Add ("Aladdin", "sdaf"); // an exception occurs.
22. // However, if the index is used to assign values, if the key exists, the value is overwritten. If the key does not exist, the value is equivalent to add.
23. Books ["Aladdin"] = "haha_new ";
25. Foreach (string STR in books. Keys)
26. {
27. Console. writeline (STR );
28. }
30. Foreach (string STR in books. values)
31. {
32. Console. writeline (STR );
33. }
35. // One-time traversal of the value Key
36. Foreach (keyvaluepair <string, string> book in books)
37. {
38. Console. writeline ("Name: {0} Email: {1}", Book. Key, Book. value );
39. }
41. // From the above results, we can see that Aladdin is replaced and its value is changed to haha_new.
43. // The following describes the methods and attributes in sortedlist <tkey, tvalue>.
44. // The capacity attribute is used to set the capacity of an ordered table. Like ilist, it also doubles.
45. // Comparer returns the comparator related to the ordered table. You can input the comparator from the constructor.
46. // Remove () removeat () Key deletion and index Deletion
47. // Containskey (); containsvalue (); check whether a key or value contains the specified value
48. // Trygetvalue (); try to get the value of the specified key. If yes, true is used and out is used to bring the value back. If no value is flase
50. // Click Delete
51. Console. writeline ("------------------------- press the key to delete --------------");
52. Books. Remove ("Aladdin ");
54. Foreach (keyvaluepair <string, string> book in books)
55. {
56. Console. writeline ("Name: {0} Email: {1}", Book. Key, Book. value );
57. }
58. // You can see that Aladdin has been deleted.
60. // Delete by index
61. Books. removeat (0 );
62. Console. writeline ("------------------------- Delete by index --------------");
64. Foreach (keyvaluepair <string, string> book in books)
65. {
66. Console. writeline ("Name: {0} Email: {1}", Book. Key, Book. value );
67. }
68. // The result shows that the fuck is deleted, which indicates that the index is deleted in the insert order, not in the sorted order.
70. // Check whether Aladdin exists; check whether zhaohaifu (key) exists)
71. Console. writeline ("whether to include Aladdin key: {0}", Books. containskey ("Aladdin"); // false
72. Console. writeline ("whether to include zhaohaifu key: {0}", Books. containskey ("zhaohaifu"); // true
74. // Check whether contains 64kb@163.com check whether contains 64kb@163.com (value)
75. Console. writeline ("include Aladdin key: {0}", Books. containsvalue ("64kb@163.com"); // false
76. Console. writeline ("include zhaohaifu key: {0}", Books. containsvalue ("65kb@163.com"); // true
78. // The index values here are sorted.
79. Int keyindex = books. indexofkey ("zhaohaifu ");
80. Console. writeline ("zhaohaifu index value: {0}", keyindex );
82. String value = "";
83. If (books. trygetvalue ("Aladdin", out value ))
84. {
85. Console. writeline ("got Aladdin value: {0}", value );
86. }
88. String value2 = "";
89. If (books. trygetvalue ("zhaohaifu", out value2 ))
90. {
91. Console. writeline ("zhoahaifu value obtained: {0}", value2 );
92. }
94. Console. Readline ();
95. // Note: this class is a wildcard slice of sortedlist. The class corresponding to the object version exists with the same name.
96. }
97. }
98. }