diff options
| Commit | 2b25a22595660765cf42cba544dfa222871f86a1 (patch) | |
|---|---|---|
| Author | 2022-12-29 18:05:47 +0200 | |
| Committer | 2022-12-29 18:05:47 +0200 | |
| Files | 9beafe4974b6d3e021061093d4ed0f7a01e5ef18 | |
| uni-projects-2b25a22595660765cf42cba544dfa222871f86a1.tar uni-projects-2b25a22595660765cf42cba544dfa222871f86a1.tar.gz uni-projects-2b25a22595660765cf42cba544dfa222871f86a1.zip | ||
| Parent | c79f7ea4ac93a9b11bff676d4174f5de46e0015b (diff) | |
[SDP/P] Added comments and removed iostream includes where unnecessary
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 <iostream> - template <class T> bool SkipList<T>::recShortSublist(Node* current, std::deque<T>& search, std::deque<T>& 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 <string> #include <iostream> +/* Самото решение се намира в 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 <iostream> 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 <iostream> +/* Самото решение се намира в 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 <fstream> #include <exception> +/* Самото решение се намира в removeUselessSubBoxes в Box.cpp */ + int main() { std::ifstream inFile("boxesList.txt"); if (!inFile.is_open()) |
