{"id":286,"date":"2023-07-30T06:19:21","date_gmt":"2023-07-30T05:19:21","guid":{"rendered":"https:\/\/ishooscode.com\/?p=286"},"modified":"2023-07-30T06:23:30","modified_gmt":"2023-07-30T05:23:30","slug":"how-does-a-dictionary-maintains-data","status":"publish","type":"post","link":"https:\/\/ishooscode.com\/index.php\/2023\/07\/30\/how-does-a-dictionary-maintains-data\/","title":{"rendered":"How does a dictionary maintains data"},"content":{"rendered":"\n

Dictionary is common data structure which most of developers use to store data for quick access in future. It provides various operation, has good capabilities and has really good time complexity. But, Do you ever wonder how dictionary does all this effortlessly. A common curiosity which every developer should have is how does a dictionary maintains data internally. Well, Answer to this question is rather painless.<\/p>\n\n\n\n

A dictionary uses linked lists to store data. Consider you are using a generic dictionary<string, \u2018AnyType<\/em>\u2019>. A dictionary sorts and searches data based on the key which will be timer consuming and resource consuming as well to sort on string type. <\/p>\n\n\n\n

How does dictionary perform these operations so quickly?<\/strong><\/p>\n\n\n\n

Well, quite elementary. It uses a hash code to sort data. Dictionary converts the key value into its corresponding hash code and stores only that hash code. Now searching and sorting on hash code becomes faster.<\/p>\n\n\n\n

How does it do it, practically?<\/strong><\/p>\n\n\n\n

Just like linked list, let\u2019s create a Node class. To understand following code better, I would say please go and watch how linked list is implemented here<\/a><\/p>\n\n\n\n

namespace Generic  \n{  \n    public class Node<T>  \n    {  \n        public T data;  \n        public Node(T data)  \n        {  \n            this.data = data;  \n        }  \n    }  \n}<\/code><\/pre>\n\n\n\n
Now to maintain a key value pair and to link the objects, we need to create another class.<\/p>\n\n\n\n
namespace Generic  \n{  \n    public class HashNodeMap<T>  \n    {  \n        public int key;  \n        public Node<T> data;  \n        public HashNodeMap<T> next;  \n    }  \n}  <\/code><\/pre>\n\n\n\n
Above, a key is used to store hash code of each key, a node stores actual data. The next step will help us link the new item.<\/p>\n\n\n\n
public class GenericHashDictionary<Tkey,Tdata>    \n    {    \n        public HashNodeMap<Tdata> hashNode = null;    \n        public int Count;    \n    \n        public object this[Tkey s]    \n        {    \n            get    \n            {    \n                return FindHashCode(s).data;    \n            }    \n            set    \n            {    \n    \n            }    \n        }    \n    \n        private HashNodeMap<Tdata> CreateNode(Tkey key, Tdata data)    \n        {    \n            int hashCode = key.GetHashCode();    \n            HashNodeMap<Tdata> newNodeMap = new HashNodeMap<Tdata>();    \n            newNodeMap.data = new Node<Tdata>(data);    \n            newNodeMap.key = hashCode;    \n            return newNodeMap;    \n        }    \n    \n        public void Add(Tkey key, Tdata data)    \n        {    \n            HashNodeMap<Tdata> current = null;    \n            if (hashNode == null)    \n            {    \n                hashNode = CreateNode(key, data);    \n            }    \n            else    \n            {    \n                current = hashNode;    \n                while (current.next != null)    \n                {    \n                    current = current.next;    \n                }    \n                current.next = CreateNode(key, data);    \n            }    \n            Count++;    \n        }    \n    \n        private Node<Tdata> FindHashCode(Tkey key)    \n        {    \n            Node<Tdata> data = null;    \n            int hashCode = key.GetHashCode();    \n            HashNodeMap<Tdata> current = hashNode;    \n    \n            while (current != null)    \n            {    \n                if (current.key == hashCode)    \n                {    \n                    data = current.data;    \n                    break;    \n                }    \n                if (current.next != null)    \n                {    \n                    current = current.next;    \n                }    \n            }    \n            return data;    \n        }    \n}<\/code><\/pre>\n\n\n\n
Above are some basic operation performed in a standard dictionary.<\/p>\n\n\n\n
Now time to use this<\/p>\n\n\n\n
GenericHashDictionary<string, string> hdt = new GenericHashDictionary<string, string>();  \nhdt.Add(\"userName\", \"ishoo\");  \nhdt.Add(\"password\", \"1234\");  \nhdt.Add(\"email\", \"ishooagarwal\");  <\/code><\/pre>\n\n\n\n
\"How<\/figure>\n\n\n\n
As you can see the (-ve) numbers these are keys which I had used. <\/p>\n\n\n\n
I am still developing this data structure and implementing various things in it. Currently I am implementing IEnumerable and IEnumerator so that foreach loop can be performed on this custom dictionary. <\/p>\n\n\n\n
In my next blog I will show you how to to sort remove and iterate through the custom dictionary.<\/p>\n\n\n\n
Hope you enjoy it and find it helpful.<\/p>\n","protected":false},"excerpt":{"rendered":"
Dictionary is common data structure which most of developers use to store data for quick…<\/p>\n","protected":false},"author":1,"featured_media":289,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0},"categories":[22,61],"tags":[],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/ishooscode.com\/index.php\/wp-json\/wp\/v2\/posts\/286"}],"collection":[{"href":"https:\/\/ishooscode.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/ishooscode.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/ishooscode.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/ishooscode.com\/index.php\/wp-json\/wp\/v2\/comments?post=286"}],"version-history":[{"count":2,"href":"https:\/\/ishooscode.com\/index.php\/wp-json\/wp\/v2\/posts\/286\/revisions"}],"predecessor-version":[{"id":291,"href":"https:\/\/ishooscode.com\/index.php\/wp-json\/wp\/v2\/posts\/286\/revisions\/291"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/ishooscode.com\/index.php\/wp-json\/wp\/v2\/media\/289"}],"wp:attachment":[{"href":"https:\/\/ishooscode.com\/index.php\/wp-json\/wp\/v2\/media?parent=286"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ishooscode.com\/index.php\/wp-json\/wp\/v2\/categories?post=286"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ishooscode.com\/index.php\/wp-json\/wp\/v2\/tags?post=286"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}