{"id":574,"date":"2013-05-15T13:39:44","date_gmt":"2013-05-15T12:39:44","guid":{"rendered":"http:\/\/oprsteny.cz\/?p=574"},"modified":"2013-05-15T15:30:32","modified_gmt":"2013-05-15T14:30:32","slug":"algorithms-two-way-linked-list","status":"publish","type":"post","link":"https:\/\/oprsteny.cz\/?p=574","title":{"rendered":"Algorithms: Two-way linked list"},"content":{"rendered":"<p>Simple implementation of <em>Two-way linked list<\/em>\u00a0in C++<!--more--><\/p>\n<p><img decoding=\"async\" class=\"alignnone size-full\" alt=\"\" src=\"http:\/\/oprsteny.cz\/wp-content\/uploads\/img_51939bffa0254.png\" \/><\/p>\n<pre lang=\"cpp\">#include&lt;iostream.h&gt;\r\n\r\nclass ListNode {\r\n  int item;\r\n\r\npublic:\r\n  ListNode *prev;\r\n  ListNode *next;\r\n  int GetItem() { return item; }\r\n  ListNode(int data = 0) {\r\n    this-&gt;item = data;\r\n  }\r\n};\r\n\r\nclass List {\r\n  ListNode *head;\r\n  ListNode *tail;\r\n  int count;\r\n\r\n  public:\r\n    List() {\r\n      this-&gt;head = NULL;\r\n      this-&gt;tail = NULL;\r\n      this-&gt;count = 0;\r\n    }\r\n\r\n    void Add(int data) {\r\n      ListNode *n = new ListNode(data);\r\n      this-&gt;count++;\r\n\r\n      if(this-&gt;head == NULL) {\r\n        this-&gt;head = n;\r\n        this-&gt;tail = n;\r\n      } else {\r\n        n-&gt;prev = tail;\r\n        tail-&gt;next = n;\r\n        tail = n;\r\n      }      \r\n    }\r\n\r\n    void Print (int index) {\r\n      if(index &lt; 0 || index &gt;= this-&gt;count) {\r\n        cout &lt;&lt; \"Index '\" &lt;&lt; index &lt;&lt; \"' out of range\\n\";\r\n      } else {\r\n        ListNode *n = this-&gt;head;\r\n        for(int i=0; i&lt;index; i++) {\r\n          n = n-&gt;next;\r\n        }\r\n        cout &lt;&lt; \"Value at index \" &lt;&lt; index &lt;&lt; \": \" &lt;&lt; n-&gt;GetItem() &lt;&lt; \"\\n\";         \r\n      }\r\n    }    \r\n};\r\n\r\nint main (int argc, char* argv) {\r\n  List list;\r\n\/\/ Add some items  \r\n  for(int i = 0; i&lt;6; i++) {    \r\n    list.Add(i);\r\n  }\r\n\/\/ Print output with some indexes out of range\r\n  for(int i = -1; i&lt;=6; i++) {    \r\n    list.Print(i);\r\n  }\r\n}<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Simple implementation of Two-way linked list\u00a0in C++<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"Two-way linked list","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[15,150,9],"tags":[148,149,84],"class_list":["post-574","post","type-post","status-publish","format-standard","hentry","category-algorithms","category-c-development","category-development","tag-algorithms-2","tag-cpp","tag-list"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p3nYbe-9g","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/oprsteny.cz\/index.php?rest_route=\/wp\/v2\/posts\/574","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/oprsteny.cz\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/oprsteny.cz\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/oprsteny.cz\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/oprsteny.cz\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=574"}],"version-history":[{"count":4,"href":"https:\/\/oprsteny.cz\/index.php?rest_route=\/wp\/v2\/posts\/574\/revisions"}],"predecessor-version":[{"id":580,"href":"https:\/\/oprsteny.cz\/index.php?rest_route=\/wp\/v2\/posts\/574\/revisions\/580"}],"wp:attachment":[{"href":"https:\/\/oprsteny.cz\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=574"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/oprsteny.cz\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=574"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/oprsteny.cz\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=574"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}