using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace ConsoleApplication7 { public class MutantHashTable { private List>> entries; private int size; public MutantHashTable(int size) { entries = new List>>(); this.size = size; for (int i = 0; i < size; i++) entries.Add(new LinkedList>()); } public TValue Find(TKey Key) { int hash = Key.GetType() == typeof(string) ? Key.ToString().ToCharArray().Sum(x => Convert.ToInt32(x)) % size : Convert.ToInt32(Key) % size; for(int i = 0; i < entries[hash].Count(); i++) { if(entries[hash].ElementAt(i).Key.Equals(Key)) { return entries[hash].ElementAt(i).Value; } } return (TValue)Convert.ChangeType(-1, typeof(TValue)); } public void Insert(TKey Key, TValue Value) { int hash = Key.GetType() == typeof(string) ? Key.ToString().ToCharArray().Sum(x => Convert.ToInt32(x)) % size : Convert.ToInt32(Key) % size; if (entries.Any(x => x.Any(y => y.Key.Equals(Key)))) throw new Exception("Key \"" + Key + "\" already exists"); entries[hash].AddLast(new KeyValuePair(Key, Value)); } public void Remove(TKey Key) { int hash = Key.GetType() == typeof(string) ? Key.ToString().ToCharArray().Sum(x => Convert.ToInt32(x)) % size : Convert.ToInt32(Key) % size; for (int i = 0; i < entries[hash].Count(); i++) { if (entries[hash].ElementAt(i).Key.Equals(Key)) { entries[hash].Remove(entries[hash].ElementAt(i)); break; } } } public int Count() { int c = 0; for (int i = 0; i < entries.Count(); i++) { if (entries[i].Count() > 0) c += entries[i].Count(); } return c; } public LinkedList> GetList(TKey Key) { int hash = Key.GetType() == typeof(string) ? Key.ToString().ToCharArray().Sum(x => Convert.ToInt32(x)) % size : Convert.ToInt32(Key) % size; return entries[hash]; } public void Merge(MutantHashTable H) { for(int i = 0; i < H.entries.Count(); i++) { for(int j = 0; j < H.entries[i].Count(); j++) { if(entries.Any(x => x.Any(y => y.Key.Equals(H.entries[i].ElementAt(j).Key)))) { continue; } Insert(H.entries[i].ElementAt(j).Key, H.entries[i].ElementAt(j).Value); } } } public Stack> ToStack() { Stack> s = new Stack>(); for (int i = 0; i < entries.Count(); i++) { for (int j = 0; j < entries[i].Count(); j++) { s.Push(entries[i].ElementAt(j)); } } return s; } public Queue> ToQueue() { Queue> q = new Queue>(); for (int i = 0; i < entries.Count(); i++) { for (int j = 0; j < entries[i].Count(); j++) { q.Enqueue(entries[i].ElementAt(j)); } } return q; } public SortedSet> ToBST() { SortedSet> ss = new SortedSet>(new KVPComp()); for (int i = 0; i < entries.Count(); i++) { for (int j = 0; j < entries[i].Count(); j++) { ss.Add(entries[i].ElementAt(j)); } } return ss; } } public class KVPComp : IComparer> { public int Compare(KeyValuePair x, KeyValuePair y) { return x.Key.ToString().CompareTo(y.Key.ToString()); } } class Program { static void Main(string[] args) { MutantHashTable m = new MutantHashTable(100); //works with keys and values of any type m.Insert("test", 10); Console.WriteLine(m.Find("test")); m.Remove("test"); Console.WriteLine(m.Find("test")); //displays -1, as it is not found m.Insert("test", 10); m.Insert("tset", 12); m.Insert("ttse", 14); var l = m.GetList("test"); foreach (var x in l) Console.WriteLine(x.Value); //prints out the values from the linkedlist associated with the elements of the same hash value as "test" Console.WriteLine(m.Count()); MutantHashTable m2 = new MutantHashTable(100); m2.Insert("aaa", 10); m.Merge(m2); Console.WriteLine(m.Count()); //is now 1 larger since they were merged var stack = m.ToStack(); Console.WriteLine(stack.Pop()); //pops an element from the returned stack var queue = m.ToQueue(); Console.WriteLine(queue.Dequeue()); //dequeues an element from the returned queue /* Note that A SortedSet is the equivalent of a binary search tree, please understand that i didn't want to implement one myself, and that the functionality is the same */ var set = m.ToBST(); Console.WriteLine(set.ElementAt(0)); //displays the element at 0 inside the binary search tree/sorted set } } }

mutant hash table