Another update from ingydotnet^djgoku

Task/Doubly-linked-list-Element-insertion/C++/doubly-linked-list-element-insertion.cpp

@@ -0,0 +1,8 @@
+template <typename T>
+void insert_after(Node<T>* N, T&& data)
+{
+    auto node = new Node<T>{N, N->next, std::forward(data)};
+    if(N->next != nullptr)
+        N->next->prev = node;
+    N->next = node;
+}

Task/Doubly-linked-list-Element-insertion/Objeck/doubly-linked-list-element-insertion.objeck

@@ -0,0 +1,12 @@
+method : public : native : AddBack(value : Base) ~ Nil {
+  node := ListNode->New(value);
+  if(@head = Nil) {
+    @head := node;
+    @tail := @head;
+  }
+  else {
+    @tail->SetNext(node);
+    node->SetPrevious(@tail);
+    @tail := node;
+  };
+}