diff options
[SDP/P/exa] Replaced parameter skiplists and stacks to deque
1 files changed, 9 insertions, 9 deletions
| -rw-r--r-- | Year 2/Structures and data algorithms/Project/exa/SkipList.hpp | 18 |
diff --git a/Year 2/Structures and data algorithms/Project/exa/SkipList.hpp b/Year 2/Structures and data algorithms/Project/exa/SkipList.hpp index f124516..125013b 100644 --- a/Year 2/Structures and data algorithms/Project/exa/SkipList.hpp +++ b/Year 2/Structures and data algorithms/Project/exa/SkipList.hpp @@ -3,7 +3,7 @@ #include <istream> #include <ostream> -#include <stack> +#include <deque> template <class T> class SkipList { @@ -23,10 +23,10 @@ class SkipList { void free(); Node* findNode(const T&); - bool recShortSublist(Node*, SkipList<T>&, std::stack<T>&); + bool recShortSublist(Node*, std::deque<T>&, std::deque<T>&); public: - std::stack<T> shortestSublistIncluding(SkipList<T>&); + std::deque<T> shortestSublistIncluding(std::deque<T>&); void push(const T& elem); bool addSkip(const T&, const T&); @@ -89,26 +89,26 @@ public: #include <iostream> template <class T> -bool SkipList<T>::recShortSublist(Node* current, SkipList<T>& search, std::stack<T>& out) { +bool SkipList<T>::recShortSublist(Node* current, std::deque<T>& search, std::deque<T>& out) { if (current == nullptr) return false; - out.push(current->value); + out.push_back(current->value); if (current->value == search.front()) { - search.pop(); + search.pop_front(); if (search.empty()) return true; } if (!recShortSublist(current->skip, search, out) && !recShortSublist(current->next, search, out)) { - out.pop(); + out.pop_back(); return false; } return true; } template <class T> -std::stack<T> SkipList<T>::shortestSublistIncluding(SkipList<T>& locs) { - std::stack<T> out; +std::deque<T> SkipList<T>::shortestSublistIncluding(std::deque<T>& locs) { + std::deque<T> out; recShortSublist(head, locs, out); return out; } |
