linked_list.h

#ifndef LINKED_LIST_H
#define LINKED_LIST_H
 
#ifdef LINKED_LIST_VISUALIZATION_H
#include "../../visualization/list_visual/linked_list_visualization.h"
#endif
 
#ifdef __cplusplus
#include <iostream>
#include <memory>
#include <string>
#include <type_traits>
#include <vector>
#endif
 
template <typename T> class linked_list {
    public:
    explicit linked_list(std::vector<T> _elements = {}) noexcept
    : root(nullptr), tail(nullptr) {
        if (!_elements.empty()) {
            for (T &x : _elements) {
                this->push_back(x);
            }
        }
    }
 
    explicit linked_list(const linked_list &l) : root(l.root), tail(l.tail), _size(l._size) {
 
 
 
    }
 
    linked_list &operator=(const linked_list &l) {
        root = l.root;
        tail = l.tail;
        _size = l._size;
        return *this;
    }
 
    bool empty() { return root == nullptr; }
 
    size_t size() { return _size; }
 
    class Iterator;
 
    Iterator begin() { return Iterator(root); }
 
    Iterator end() { return Iterator(nullptr); }
 
    void push_back(T key);
 
    void push_front(T key);
 
    void erase(T key);
 
    bool search(T key);
 
    std::vector<T> elements();
 
    void reverse();
 
    void visualize();
 
    friend std::ostream &operator<<(std::ostream &out, linked_list<T> &l1) {
        out << '{';
        std::shared_ptr<node> head = l1.root;
        while (head) {
            out << head->val << ' ';
            head = head->next;
        }
        out << '}' << '\n';
        return out;
    }
 
    private:
    struct node {
        T val;
        std::shared_ptr<node> next;
        node(T key = 0) : val(key), next(nullptr) {}
    };
    std::shared_ptr<node> root;
    std::shared_ptr<node> tail;
    size_t _size{0};
 
    std::string generate();
};
 
template <typename T> void linked_list<T>::push_back(T key) {
    std::shared_ptr<node> p = std::make_shared<node>(key);
    if (root == nullptr) {
        root = p;
    } else {
        tail->next = p;
    }
    tail = p;
    _size++;
}
 
template <typename T> void linked_list<T>::push_front(T key) {
    std::shared_ptr<node> p = std::make_shared<node>(key);
    p->next = root;
    if(tail == nullptr) { tail = root; }
    root = p;
    _size++;
}
 
template <typename T> void linked_list<T>::erase(T key) {
    if (empty()) {
        return;
    }
    std::shared_ptr<node> t = root;
    std::shared_ptr<node> to_be_removed = nullptr;
    while (t != tail && t->next->val != key) {
        t = t->next;
    }
    if (t == tail) {
        return;
    }
    to_be_removed = t->next;
    t->next = t->next->next;
    to_be_removed.reset();
    if (t->next == nullptr) {
        tail = t;
    }
    if (root == tail) {
        tail = nullptr;
    }
    _size--;
}
 
template <typename T> bool linked_list<T>::search(T key) {
    try {
        if (empty()) {
            return false;
        } else {
            std::shared_ptr<node> t = root;
            while (t != tail && t->val != key) {
                t = t->next;
            }
            if (t == tail || t == nullptr) {
                return false;
            }
            return true;
        }
    } catch (std::invalid_argument &e) {
        std::cerr << e.what() << '\n';
        return false;
    }
}
 
template <typename T> std::vector<T> linked_list<T>::elements() {
    std::vector<T> _elements;
 
    if (this->empty()) {
        return _elements;
    }
    std::shared_ptr<node> head = root;
    while (head) {
        _elements.push_back(head->val);
        head = head->next;
    }
    return _elements;
}
 
template <typename T> void linked_list<T>::reverse() {
    std::shared_ptr<node> current = root;
    std::shared_ptr<node> prev{nullptr}, next{nullptr};
 
    while (current != nullptr) {
        next = current->next;
        current->next = prev;
        prev = current;
        current = next;
    }
    root = prev;
}
 
template <typename T> std::string linked_list<T>::generate() {
    std::string gen;
    gen += "rankdir=LR;";
    gen += '\n';
    gen += "node [shape=record;]";
    gen += '\n';
    std::vector<T> els = this->elements();
    if (std::is_same_v<T, std::string> || std::is_same_v<T, char>) {
        for (auto &x : els) {
            gen += x;
            gen += " [label=<{ ";
            gen += x;
            gen += " | }>] ;";
            gen += '\n';
        }
 
        std::shared_ptr<node> curr = root;
        while (curr->next) {
            gen += curr->val;
            gen += ":ref -> ";
            gen += curr->next->val;
            gen += ":data [arrowhead=vee, arrowtail=dot, dir=both];";
            gen += '\n';
            curr = curr->next;
        }
    } else {
        for (auto &x : els) {
            gen += std::to_string(x);
            gen += " [label=<{ ";
            gen += std::to_string(x);
            gen += " | }>] ;";
            gen += '\n';
        }
 
        std::shared_ptr<node> curr = root;
        while (curr->next) {
            gen += std::to_string(curr->val);
            gen += ":ref -> ";
            gen += std::to_string(curr->next->val);
            gen += ":data [arrowhead=vee, arrowtail=dot, dir=both];";
            gen += '\n';
            curr = curr->next;
        }
    }
    return gen;
}
 
#ifdef LINKED_LIST_VISUALIZATION_H
template <typename T> void linked_list<T>::visualize() {
    std::string generated = this->generate();
    linked_list_visualization::visualize(generated);
}
#endif
 
 
template <typename T> class linked_list<T>::Iterator {
    private:
    std::shared_ptr<node> curr_root;
 
    public:
    explicit Iterator(const std::shared_ptr<node> &l) noexcept : curr_root(l) {}
 
    Iterator &operator=(std::shared_ptr<node> current) {
        this->curr_root = current;
        return *(this);
    }
 
    Iterator &operator++() {
        if (curr_root) {
            curr_root = curr_root->next;
        }
        return *(this);
    }
 
    Iterator operator++(int) {
        Iterator it = *this;
        ++*(this);
        return it;
    }
 
    bool operator!=(const Iterator &it) { return curr_root != it.curr_root; }
 
    T operator*() { return curr_root->val; }
};
 
#endif