lab10

Author: drewxa

.travis.yml

@@ -18,6 +18,9 @@ script:
   - ( for file in $(find ./lab5 -name "*.cpp"); do ./cpplint.py $file || exit; done );
   - ( for file in $(find ./lab6 -name "*.cpp"); do ./cpplint.py $file || exit; done );
   - ( for file in $(find ./lab7 -name "*.cpp"); do ./cpplint.py $file || exit; done );
+  - ( for file in $(find ./lab8 -name "*.cpp"); do ./cpplint.py $file || exit; done );
+  - ( for file in $(find ./lab9 -name "*.cpp"); do ./cpplint.py $file || exit; done );
+  - ( for file in $(find ./lab10 -name "*.cpp"); do ./cpplint.py $file || exit; done );
   - cd lab1
   - mkdir build && cd build
   - cmake .. && make
@@ -45,4 +48,19 @@ script:
   - cd lab7
   - mkdir build && cd build
   - cmake .. && make
+  
+  - cd ../..
+  - cd lab8
+  - mkdir build && cd build
+  - cmake .. && make
+  
+  - cd ../..
+  - cd lab9
+  - mkdir build && cd build
+  - cmake .. && make
+  
+  - cd ../..
+  - cd lab10
+  - mkdir build && cd build
+  - cmake .. && make
 #  - ./executable

README.md

@@ -41,8 +41,8 @@
 ### [Лабораторная работа 8](lab8/lab8_1.cpp)
 * Алгоритмы STL
 
-### Лабораторная работа 9
+### [Лабораторная работа 9](lab9/lab9_1.cpp)
 * Указатели
 
-### Лабораторная работа 10
-* Реализация двусвязного списка
+### [Лабораторная работа 10](lab10)
+* Реализация двусвязного списка

lab10/CMakeLists.txt

@@ -0,0 +1,17 @@
+cmake_minimum_required (VERSION 2.8)
+
+include_directories(SYSTEM
+    ./
+)
+
+ADD_DEFINITIONS(
+    -std=c++11
+)
+
+# enum your files
+add_executable(executable
+    lab10.cpp
+    list.cpp
+)
+
+target_link_libraries(executable)

lab10/lab10.cpp

@@ -0,0 +1,27 @@
+#include "list.hpp"
+
+int main()
+{
+    List* l = initList();
+
+    pushBack(l, 1);
+    erase(l, l->Head);
+
+    pushBack(l, 2);
+    pushBack(l, 3);
+    pushFront(l, -1);
+    pushFront(l, -2);
+    pushFront(l, -3);
+    print(l);
+    erase(l, l->Head->Next->Next);
+    print(l);
+    erase(l, l->Tail);
+    print(l);
+
+    insert(l, l->Head->Next, 100);
+    print(l);
+
+    destroyList(&l);
+
+    return 0;
+}

lab10/list.cpp

@@ -0,0 +1,118 @@
+#include "list.hpp"
+
+List::Node* createNode(const List::value_type& data, List::Node* prev, List::Node* next)
+{
+    List::Node* node = new List::Node();
+    node->Data = data;
+    node->Prev = prev;
+    node->Next = next;
+
+    return node;
+}
+
+void destroyNode(List::Node** ptr)
+{
+    List::Node* node = *ptr;
+    delete node;
+    *ptr = nullptr;
+}
+
+List* initList()
+{
+    List* ls = new List();
+    ls->Head = nullptr;
+    ls->Tail = nullptr;
+    return ls;
+}
+
+void destroyList(List** ls)
+{
+    List* list = *ls;
+
+    List::Node* head = list->Head;
+    while (head)
+    {
+        List::Node* tmp = head->Next;
+        delete head;
+        head = tmp;
+    }
+    delete list;
+
+    *ls = nullptr;
+}
+
+List::Node* pushFront(List* const list, const List::value_type & data)
+{
+    List::Node* node = createNode(data, nullptr, list->Head);
+
+    if (list->Head)
+        list->Head->Prev = node;
+    list->Head = node;
+
+    if (list->Tail == nullptr)
+        list->Tail = node;
+    return node;
+}
+
+List::Node* pushBack(List* const list, const List::value_type & data)
+{
+    List::Node* node = createNode(data, list->Tail, nullptr);
+
+    if (list->Tail)
+        list->Tail->Next = node;
+    list->Tail = node;
+
+    if (list->Head == nullptr)
+        list->Head = node;
+    return node;
+}
+
+List::Node* insert(List* const list, List::Node* const where, const List::value_type& data)
+{
+    List::Node* newNode = createNode(data, where->Prev, where);
+    List::Node* prev = where->Prev;
+    if (prev)
+        prev->Next = newNode;
+    where->Prev = newNode;
+    return newNode;
+}
+
+List::Node* erase(List* const list, List::Node* const where)
+{
+    List::Node* next = where->Next;
+    List::Node* prev = where->Prev;
+
+    if (list->Head == where)
+        list->Head = next;
+    if (list->Tail == where)
+        list->Tail = prev;
+
+    if (prev)
+        prev->Next = next;
+
+    delete where;
+
+    return next;
+}
+
+size_t size(const List* const list)
+{
+    size_t size = 0;
+    List::Node* head = list->Head;
+    while (head)
+    {
+        ++size;
+        head = head->Next;
+    }
+    return size;
+}
+
+void print(const List* const ls)
+{
+    List::Node* tmp = ls->Head;
+    while (tmp)
+    {
+        std::cout << tmp->Data << std::endl;
+        tmp = tmp->Next;
+    }
+}

lab10/list.hpp

@@ -0,0 +1,36 @@
+#pragma once
+
+struct List
+{
+    using value_type = int;
+
+    struct Node
+    {
+        value_type Data;
+        Node* Next;
+        Node* Prev;
+    };
+
+    Node* Head;
+    Node* Tail;
+};
+
+List::Node* createNode(const List::value_type& data, List::Node* prev, List::Node* next);
+
+void destroyNode(List::Node** ptr);
+
+List* initList();
+
+void destroyList(List** ls);
+
+List::Node* pushFront(List* const list, const List::value_type & data);
+
+List::Node* pushBack(List* const list, const List::value_type & data);
+
+List::Node* insert(List* const list, List::Node* const where, const List::value_type& data);
+
+List::Node* erase(List* const list, List::Node* const where);
+
+size_t size(const List* const list);
+
+void print(const List* const ls);

lab9/CMakeLists.txt

@@ -0,0 +1,16 @@
+cmake_minimum_required (VERSION 2.8)
+
+include_directories(SYSTEM
+    ./
+)
+
+ADD_DEFINITIONS(
+    -std=c++11
+)
+
+# enum your files
+add_executable(executable
+    lab9_1.cpp
+)
+
+target_link_libraries(executable)

lab9/lab9_1.cpp

@@ -0,0 +1,6 @@
+#include <iostream>
+
+int main()
+{
+    return 0;
+}