diff --git a/exercise/01/containers.cpp b/exercise/01/containers.cpp new file mode 100644 index 0000000..b304dc7 --- /dev/null +++ b/exercise/01/containers.cpp @@ -0,0 +1,76 @@ +#include "containers.h" +#include +#include + +std::wstring to_lower(std::wstring const& str) +{ + // std::transform unfortunatly not allowed + std::wstring res; + res.reserve(str.size()); + for (const wchar_t c : str) + { + res.push_back(std::iswupper(c) ? std::towlower(c) : c); + } + return res; +} + +void remove_element(std::vector& v, const int index) +{ + v.erase(v.begin() + index); +} + +void input_element(std::vector& v, const int index, const std::wstring& value) +{ + v.insert(v.begin() + index, value); +} + +int list_nth_element(const std::list& c, const int index) +{ + auto it = c.cbegin(); + std::advance(it, index); + return *it; +} + +void list_sort_desc(std::list& c) +{ + // std::sort not allowed + std::set tmp_c; + for (auto&& elem : c) + tmp_c.insert(elem); + c.clear(); + for(auto it = tmp_c.crbegin(); it != tmp_c.crend(); ++it) + c.push_back(*it); +} + +int unique_numbers(std::wistream& stream) +{ + int elem; + std::set tmp_s; + while (stream >> elem) + { + tmp_s.insert(elem); + } + return tmp_s.size(); +} + +word_frequency::word_frequency(std::wistream& stream) +{ + std::wstring elem; + while (stream >> elem) + { + elem = to_lower(elem); + freq[elem]++; + } +} + +int word_frequency::frequency(const std::wstring& s) const +{ + const std::wstring lowercase_s = to_lower(s); + const auto it = freq.find(lowercase_s); + return (it != freq.end()) ? it->second : 0; +} + +int word_frequency::count() const noexcept +{ + return freq.size(); +} diff --git a/exercise/01/containers.h b/exercise/01/containers.h index 8e1b172..ceea35f 100644 --- a/exercise/01/containers.h +++ b/exercise/01/containers.h @@ -2,6 +2,7 @@ #include #include #include +#include void remove_element(std::vector& v, int index); void input_element(std::vector& v, int index, const std::wstring& value); @@ -9,12 +10,15 @@ void input_element(std::vector& v, int index, const std::wstring& int list_nth_element(const std::list& c, int index); void list_sort_desc(std::list& c); -int unique_numbers(std::wistream&); +int unique_numbers(std::wistream& stream); class word_frequency { public: word_frequency(std::wistream&); - int frequency(const std::wstring& s); - int count(); + int frequency(const std::wstring& s) const; + int count() const noexcept; + +private: + std::map freq; }; diff --git a/exercise/01/e01.vcxproj b/exercise/01/e01.vcxproj index 8db291c..5b9acd7 100644 --- a/exercise/01/e01.vcxproj +++ b/exercise/01/e01.vcxproj @@ -1,97 +1,97 @@ - - - - - Debug - Win32 - - - Release - Win32 - - - - {DD752318-EA08-4316-9EFE-C1A42F5526F4} - Win32Proj - e01 - 10.0.17134.0 - - - - DynamicLibrary - true - v141 - Unicode - false - - - DynamicLibrary - false - v141 - true - Unicode - false - - - - - - - - - - - - - true - . - - - true - . - - - - NotUsing - Level3 - Disabled - $(VCInstallDir)UnitTest\include;%(AdditionalIncludeDirectories) - WIN32;_DEBUG;%(PreprocessorDefinitions) - true - - - Windows - true - $(VCInstallDir)UnitTest\lib;%(AdditionalLibraryDirectories) - - - - - Level3 - NotUsing - MaxSpeed - true - true - $(VCInstallDir)UnitTest\include;%(AdditionalIncludeDirectories) - WIN32;NDEBUG;%(PreprocessorDefinitions) - true - - - Windows - true - true - true - $(VCInstallDir)UnitTest\lib;%(AdditionalLibraryDirectories) - - - - - - - - - - - - + + + + + Debug + Win32 + + + Release + Win32 + + + + {DD752318-EA08-4316-9EFE-C1A42F5526F4} + Win32Proj + e01 + 10.0.17134.0 + + + + DynamicLibrary + true + v141 + Unicode + false + + + DynamicLibrary + false + v141 + true + Unicode + false + + + + + + + + + + + + + true + . + + + true + . + + + + NotUsing + Level3 + Disabled + $(VCInstallDir)UnitTest\include;%(AdditionalIncludeDirectories) + WIN32;_DEBUG;%(PreprocessorDefinitions) + true + + + Windows + true + $(VCInstallDir)UnitTest\lib;%(AdditionalLibraryDirectories) + + + + + Level3 + NotUsing + MaxSpeed + true + true + $(VCInstallDir)UnitTest\include;%(AdditionalIncludeDirectories) + WIN32;NDEBUG;%(PreprocessorDefinitions) + true + + + Windows + true + true + true + $(VCInstallDir)UnitTest\lib;%(AdditionalLibraryDirectories) + + + + + + + + + + + + \ No newline at end of file diff --git a/exercise/02/algorithms_test.cpp b/exercise/02/algorithms_test.cpp index 9df3595..8140018 100644 --- a/exercise/02/algorithms_test.cpp +++ b/exercise/02/algorithms_test.cpp @@ -16,7 +16,7 @@ TEST_CLASS(test_standard_algorithms_usage) std::wstringstream ss(L"14 -78 22"); std::vector v; // TODO: read values from input stream into vector - + std::copy(std::istream_iterator(ss), std::istream_iterator(), std::back_inserter(v)); Assert::AreEqual(3u, v.size()); Assert::AreEqual(14, v[0]); Assert::AreEqual(-78, v[1]); @@ -27,6 +27,7 @@ TEST_CLASS(test_standard_algorithms_usage) { std::vector v(10); // TODO: fill vector with incremental values + std::iota(v.begin(), v.end(), 1); Assert::AreEqual(10u, v.size()); Assert::IsTrue(std::is_sorted(v.cbegin(), v.cend())); Assert::AreEqual( 1, v[0]); @@ -37,6 +38,7 @@ TEST_CLASS(test_standard_algorithms_usage) // generate std::vector v(10); // TODO: fill vector with incremental values (by 2) + std::generate(v.begin(), v.end(), []() { static int start = -1; return start += 2; }); Assert::IsTrue(std::is_sorted(v.cbegin(), v.cend())); Assert::IsTrue(v.cend() == std::adjacent_find(v.cbegin(), v.cend(), [](int a, int b) { return b - a != 2; })); Assert::AreEqual(1, v[0]); @@ -47,6 +49,7 @@ TEST_CLASS(test_standard_algorithms_usage) { std::vector v = { 1, 5, 10 } ; // TODO: change all values in a vector + std::transform(v.begin(), v.end(), v.begin(), [](auto val) { return std::pow(val, 3); }); Assert::AreEqual(3u, v.size()); Assert::AreEqual(1, v[0]); Assert::AreEqual(125, v[1]); @@ -57,8 +60,8 @@ TEST_CLASS(test_standard_algorithms_usage) int x[] = { 3, 5, 10 }; std::vector y = { 4, 12, 10 }; std::vector d; - // TODO: calculate distances from origin (from x and y collections) to new vector + std::transform(std::cbegin(x), std::cend(x), std::cbegin(y), std::back_inserter(d), [](auto x, auto y) { return std::sqrt(x * x + y * y); }); Assert::AreEqual(3u, d.size()); Assert::AreEqual(5., d[0]); Assert::AreEqual(13., d[1]); @@ -67,67 +70,89 @@ TEST_CLASS(test_standard_algorithms_usage) TEST_METHOD(test_04a) { std::wstringstream ss(L"1.5 2.5 3.5"); - auto res = // TODO: sum of all values in input stream + //auto res = // TODO: sum of all values in input stream + auto res = std::accumulate(std::istream_iterator(ss), std::istream_iterator(), 0.); Assert::AreEqual(7.5, res); } TEST_METHOD(test_04b) { std::vector v { L"A", L"V", L"L", L"!" }; - auto res = // TODO: concatenated string with additional prefix + //auto res = // TODO: concatenated string with additional prefix + auto res = std::accumulate(std::cbegin(v), std::cend(v), std::wstring(L"GO ")); Assert::AreEqual(L"GO AVL!", res.c_str()); } TEST_METHOD(test_04c) { struct person { std::wstring name; int age; }; std::vector v{ {L"Pero", 33}, {L"Iva", 25} }; - auto total_age = // TODO: sum of all ages + //auto total_age = // TODO: sum of all ages + auto total_age = std::accumulate(std::cbegin(v), std::cend(v), 0, [](int sum, auto&& x) { return sum + x.age; }); Assert::AreEqual(58, total_age); } TEST_METHOD(test_05a) { std::vector v { -5, 8, 11, 0, -9, 77, -4 }; - auto number_of_negative = // TODO: + //auto number_of_negative = // TODO: + auto number_of_negative = std::count_if(std::cbegin(v), std::cend(v), [](auto x) { return x < 0; }); Assert::AreEqual(3, number_of_negative); } TEST_METHOD(test_05b) { std::vector v { 1.5, 8, -11.23, 0, 1e10, 1e10, 1e10, 0, 99 }; - auto number_of_invalid = // TODO: + //auto number_of_invalid = // TODO: + auto number_of_invalid = std::count(std::cbegin(v), std::cend(v), 1e10); Assert::AreEqual(3, number_of_invalid); } TEST_METHOD(test_05c) { struct point { int x, y; }; std::vector v{ {1,1}, {-5,3}, {2,2}, {-7,-6}, {9,-4} }; - auto number_in_first_quadrant = // TODO: + //auto number_in_first_quadrant = // TODO: + auto number_in_first_quadrant = std::count_if(std::cbegin(v), std::cend(v), [](auto&& point) { return point.x >= 0 && point.y >= 0; }); Assert::AreEqual(2, number_in_first_quadrant); } TEST_METHOD(test_06) { std::vector v { 33, 16, 24, 41, 25, 19, 9 }; - auto first_prime = // TODO: + //auto first_prime = // TODO: + auto first_prime = *std::find_if(v.cbegin(), v.cend(), [](auto val) + { + bool is_prime = true; + for (int i = 2; i <= static_cast(std::sqrt(val)); ++i) + { + if (0 == val % i) + { + is_prime = false; + break; + } + } + return is_prime; + }); Assert::AreEqual(41, first_prime); } TEST_METHOD(test_07a) { std::vector v{ 1e10, 8, -11.23, 0, 1e10, 1e10, 1e10, 0, 99 }; // TODO: change every invalid value (1e10) with -1 + std::replace(v.begin(), v.end(), 1e10, -1.); Assert::AreEqual(-1., v[0]); Assert::AreEqual(-1., v[4]); Assert::AreEqual(-1., v[6]); } - TEST_METHOD(test_07b) - { - std::wstring s(L"ponedjeljak"); - // TODO: change every vowel with x + TEST_METHOD(test_07b) + { + std::wstring s(L"ponedjeljak"); + // TODO: change every vowel with x + std::replace_if(s.begin(), s.end(), [](auto c) { return c == L'a' || c == L'e' || c == L'i' || c == L'o' || c == L'u'; }, L'x'); Assert::AreEqual(L"pxnxdjxljxk", s.c_str()); } TEST_METHOD(test_08a) { std::vector v{ 1e10, 8, -11.23, 0, 1e10, 1e10, 1e10, 0, 99 }; // TODO: delete all invalid values (1e10) + v.erase(std::remove(v.begin(), v.end(), 1e10), v.end()); Assert::AreEqual(5u, v.size()); Assert::AreEqual(8., v[0]); Assert::AreEqual(99., v[4]); @@ -137,6 +162,7 @@ TEST_CLASS(test_standard_algorithms_usage) { std::wstring s(L"ponedjeljak"); // TODO: delete all vowels + s.erase(std::remove_if(s.begin(), s.end(), [](auto c) { return c == L'a' || c == L'e' || c == L'i' || c == L'o' || c == L'u'; }), s.end()); Assert::AreEqual(L"pndjljk", s.c_str()); } TEST_METHOD(test_09) @@ -144,6 +170,7 @@ TEST_CLASS(test_standard_algorithms_usage) struct exam { std::wstring name; int points, grade; }; std::vector v{ {L"Pero", 55, 2}, {L"Iva", 93, 5}, {L"Marko", 89, 5} }; // TODO: sort vector by grade, then by points + std::sort(v.begin(), v.end(), [](exam const& x, exam const& y) { return (x.grade != y.grade) ? x.grade > y.grade : x.points > y.points; }); Assert::AreEqual(L"Iva", v[0].name.c_str()); Assert::AreEqual(L"Marko", v[1].name.c_str()); Assert::AreEqual(L"Pero", v[2].name.c_str()); @@ -163,6 +190,7 @@ TEST_CLASS(test_standard_algorithms_usage) using namespace std::chrono; auto t1 = steady_clock::now(); // TODO: put median value in the middle of vector. fast. + std::nth_element(v.begin(), v.begin() + v.size() / 2, v.end()); auto t2 = steady_clock::now(); auto dur = duration_cast(t2 - t1); Assert::AreEqual(1000., v[v.size() / 2]); // median value @@ -179,16 +207,23 @@ TEST_CLASS(test_standard_algorithms_usage) TEST_METHOD(test_12) { std::vector v{ 11, 0.5, -97.23, -23.11, 48.78, 22.96, -77 }; - auto smallest_value = // TODO: + //auto smallest_value = // TODO: + auto smallest_value = *std::min_element(v.cbegin(), v.cend()); Assert::AreEqual(-97.23, smallest_value); - auto largest_value = // TODO: + //auto largest_value = // TODO: + auto largest_value = *std::max_element(v.cbegin(), v.cend()); Assert::AreEqual(48.78, largest_value); } TEST_METHOD(test_13) { std::vector atp_points { 8445, 7480, 6220, 5300, 5285 }; // the most interesting match is the one with the smallest difference - auto smallest_difference = // TODO: + //auto smallest_difference = // TODO: + + std::vector tmp; + tmp.reserve(atp_points.size()); + std::adjacent_difference(atp_points.crbegin(), atp_points.crend(), std::back_inserter(tmp)); + auto smallest_difference = *std::min_element(tmp.cbegin()+1, tmp.cend()); Assert::AreEqual(15, smallest_difference); } };