From 2b25a22595660765cf42cba544dfa222871f86a1 Mon Sep 17 00:00:00 2001 From: Syndamia Date: Thu, 29 Dec 2022 18:05:47 +0200 Subject: [SDP/P] Added comments and removed iostream includes where unnecessary --- Year 2/Structures and data algorithms/Project/exa/SkipList.hpp | 2 -- Year 2/Structures and data algorithms/Project/exa/main.cpp | 2 ++ Year 2/Structures and data algorithms/Project/exb/City.cpp | 1 - Year 2/Structures and data algorithms/Project/exb/main.cpp | 2 ++ Year 2/Structures and data algorithms/Project/exc/main.cpp | 2 ++ 5 files changed, 6 insertions(+), 3 deletions(-) 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 142c58a..6a73533 100644 --- a/Year 2/Structures and data algorithms/Project/exa/SkipList.hpp +++ b/Year 2/Structures and data algorithms/Project/exa/SkipList.hpp @@ -88,8 +88,6 @@ public: * Exercise functionality */ -#include - template bool SkipList::recShortSublist(Node* current, std::deque& search, std::deque& out) { if (current == nullptr) return false; diff --git a/Year 2/Structures and data algorithms/Project/exa/main.cpp b/Year 2/Structures and data algorithms/Project/exa/main.cpp index 0beae8b..9a6ff09 100644 --- a/Year 2/Structures and data algorithms/Project/exa/main.cpp +++ b/Year 2/Structures and data algorithms/Project/exa/main.cpp @@ -2,6 +2,8 @@ #include #include +/* Самото решение се намира в recShortSublist в SkipList.hpp */ + int main() { std::cout << "Брой на градовете през които преминава пътническия влак: "; unsigned n = 0; diff --git a/Year 2/Structures and data algorithms/Project/exb/City.cpp b/Year 2/Structures and data algorithms/Project/exb/City.cpp index daf9b5c..1fb04ca 100644 --- a/Year 2/Structures and data algorithms/Project/exb/City.cpp +++ b/Year 2/Structures and data algorithms/Project/exb/City.cpp @@ -1,5 +1,4 @@ #include "CityVisit.h" -#include CityVisit::Landmark* CityVisit::find(const std::string& name) { for (Landmark* l : landmarks) { diff --git a/Year 2/Structures and data algorithms/Project/exb/main.cpp b/Year 2/Structures and data algorithms/Project/exb/main.cpp index 118c79b..8ab5aec 100644 --- a/Year 2/Structures and data algorithms/Project/exb/main.cpp +++ b/Year 2/Structures and data algorithms/Project/exb/main.cpp @@ -1,6 +1,8 @@ #include "CityVisit.h" #include +/* Самото решение се намира в visitTheMostInTimeRec в City.cpp */ + int main() { std::cout << "Име на град: "; std::string fileName; diff --git a/Year 2/Structures and data algorithms/Project/exc/main.cpp b/Year 2/Structures and data algorithms/Project/exc/main.cpp index fa640c9..95636ce 100644 --- a/Year 2/Structures and data algorithms/Project/exc/main.cpp +++ b/Year 2/Structures and data algorithms/Project/exc/main.cpp @@ -3,6 +3,8 @@ #include #include +/* Самото решение се намира в removeUselessSubBoxes в Box.cpp */ + int main() { std::ifstream inFile("boxesList.txt"); if (!inFile.is_open()) -- cgit v1.3.1-26-gb76a