Updates linked list. Not complete.

aq-org · Mar 28, 2024 · 8199344 · 8199344
1 parent c40386d
commit 8199344
Show file tree

Hide file tree

Showing 3 changed files with 17 additions and 41 deletions.
diff --git a/compiler/compiler.h b/compiler/compiler.h
@@ -22,7 +22,7 @@ class Compiler {
   struct Pair;
   template <typename ValueType>
   class HashMap;
-  template <typename ValueType>
+  template <typename DataType>
   class LinkedList;
   template <typename ArrayType>
   class DynArray;

diff --git a/compiler/linked_list/linked_list.cc b/compiler/linked_list/linked_list.cc
@@ -9,6 +9,6 @@ template <typename ValueType>
 Compiler::LinkedList<ValueType>::LinkedList()=default;
 template <typename ValueType>
 Compiler::LinkedList<ValueType>::~LinkedList(){
-    Clear();
+
 };
 }
diff --git a/compiler/linked_list/linked_list.h b/compiler/linked_list/linked_list.h
@@ -12,57 +12,33 @@
 
 namespace Aq {
 
-template <typename ValueType>
+template <typename DataType>
 class Compiler::LinkedList {
  public:
-  struct Node {
-    Pair<Node*, Node*> location;
-    ValueType data;
-  };
-
   LinkedList();
   ~LinkedList();
 
-  /*
+  LinkedList(const LinkedList&) = delete;
+  LinkedList(LinkedList&&) noexcept = delete;
+  LinkedList& operator=(const LinkedList&) = delete;
+  LinkedList& operator=(LinkedList&&) noexcept = delete;
+
   LinkedList& operator=(const LinkedList& other);
 
-  allocator_type GetAllocator() const;
-  ValueType* Front();
-  const ValueType* Front() const;
-  ValueType* Back();
-  const ValueType* Back() const;
-  iterator Begin();
-  const_iterator Begin() const;
-  iterator End();
-  const_iterator End() const;
-  bool Empty() const;
-  size_type Size() const;
-  void Clear();
-  iterator Insert(iterator pos, const ValueType& value);
-  template <class... Args>
-  iterator Emplace(iterator pos, Args&&... args);
-  iterator Erase(iterator pos);
-  void PushFront(const ValueType& value);
-  void PushBack(const ValueType& value);
-  void PopFront();
-  void PopBack();
-  void Merge(MyList& other);
-  void Splice(iterator pos, MyList& other, iterator first, iterator last);
-  void Remove(const ValueType& value);
-  template <class UnaryPredicate>
-  void RemoveIf(UnaryPredicate pred);
-  void Reverse();
-  void Unique();
-  template <class Compare>
-  void Sort(Compare comp);
-  */
+  struct Node {
+    Pair<Node*, Node*> location;
+    DataType data;
+  };
+
+  void Insert(Node* prev_node, DataType new_data);
 
-  // Wait development.
+  void Remove(Node* delete_node);
 
  private:
   Node* head_;
+  Node* tail_;
 };
 
 }  // namespace Aq
 
-#endif  // AQ_COMPILER_LINKED_LIST_LINKED_LIST_H_
+#endif