C# Cookbook, 2nd Edition

Problem: You have created a class or structure that will be used as a key in a Hashtable or Dictionary<T,U>. You need to overload the GetHashCode method in order to return a good distribution of hash values (the Discussion section defines a go...

Problem: You need a data structure that operates similarly to a Queue but that returns objects based on a specific order. When objects are added to this queue, they are located in the queue according to their priority. When objects are retrieved fro...

Problem: You need a queue object in which you can explicitly control the adding and removing of objects to either the head (top) or tail (bottom), also known as a double queue. Solution: A queue that allows explicit removal of items from the h...

Problem: It is not uncommon to accidentally create strings that contain unbalanced parentheses. For example, a user might enter the following equation in your calculator application: (((a) + (b)) + c * d This equation contains four ( charac...

Problem: A Hashtable or a Dictionary<T,U> can map only a single key to a single value, but you need to map a key to one or more values. In addition, it may also be possible to map a key to null. Solution: Use a Dictionary<T,U> with...

Problem: You need to store information in a tree structure, where the left node is less than its parent node and the right node is greater than or equal to (in cases in which the tree can contain duplicates) its parent. The stored information must b...

Problem: You need a tree that can store a number of child nodes in each of its nodes. A binary tree will work if each node needs to have only two children, but in this case each node needs to have a fixed number of child nodes greater than two. ...

Problem: You need an object that contains a group of unordered objects. This object must be able to be compared to other objects containing sets of data. In addition, the two must be able to have the following actions performed on them: Union of th...