Week 10

Author: ivan-ristovic

10-cpp-range/.gitignore

@@ -0,0 +1 @@
+range-v3-0.11.0

10-cpp-range/01_count_adj_eq/Makefile

@@ -0,0 +1,16 @@
+PROGRAM=01_count_adj_eq.out
+CXX       = g++
+CXXFLAGS  = -g -std=c++14 -Wall -I../range-v3/include
+
+$(PROGRAM): main.o
+	$(CXX) -o $(PROGRAM) main.o
+
+.PHONY: clean dist
+
+clean:
+	-rm *.o $(PROGRAM) *core
+
+dist: clean
+	-tar -chvj -C .. -f ../$(PROGRAM).tar.bz2 $(PROGRAM)
+
+

10-cpp-range/01_count_adj_eq/main.cpp

@@ -0,0 +1,41 @@
+// Zadatak: Napisati sablonsku funkciju count_adj_equals 
+// koja vraca broj uzastopnih jednakih elemenata kolekcije.
+
+#include <iostream>
+#include <string>
+#include <numeric>
+#include <vector>
+
+// Mozemo iskoristiti std::inner_product funkciju
+// Operacije * i + cemo zameniti sa == i +
+// Dakle, za kolekcije xs i ys, racunamo:
+// (x1 == y1) + (x2 == y2) + ...
+// Mi zapravo poredimo kolekciju samu sa sobom
+// pa ce ys biti isto xs samo bez prvog elementa
+// Pocetna vrednost (akumulator) je 0
+template <typename T>
+int count_adj_equals(const T& xs)
+{
+    return std::inner_product(
+        std::cbegin(xs), std::cend(xs) - 1,
+        std::cbegin(xs) + 1,
+        0,
+        // Mozemo koristiti auto takodje
+        [](const int& x, const int &y) { return x + y; },
+        // Ovde ne znamo tip elemenata kolekcije, pa stoga auto
+        [](const auto& x, const auto &y) { return x == y ? 1 : 0; }
+    );
+}
+
+int main(int argc, char *argv[])
+{
+    const std::string text = "Hooloovoo";
+
+    std::cerr << text << ": " << count_adj_equals(text) << std::endl;
+
+    const std::vector<double> numbers{ -1.0, 2.36, 65.4, 65.4, 65.4, -1.0, 0.0, 5.4 };
+
+    std::cerr << "numbers : " << count_adj_equals(numbers) << std::endl;
+
+    return 0;
+}

10-cpp-range/02_is_sorted/Makefile

@@ -0,0 +1,16 @@
+PROGRAM=02_is_sorted.out
+CXX       = g++
+CXXFLAGS  = -g -std=c++14 -Wall -I../range-v3/include
+
+$(PROGRAM): main.o
+	$(CXX) -o $(PROGRAM) main.o
+
+.PHONY: clean dist
+
+clean:
+	-rm *.o $(PROGRAM) *core
+
+dist: clean
+	-tar -chvj -C .. -f ../$(PROGRAM).tar.bz2 $(PROGRAM)
+
+

10-cpp-range/02_is_sorted/main.cpp

@@ -0,0 +1,42 @@
+// Zadatak: Napisati sablonsku funkciju is_sorted 
+// koja proverava da li je data kolekcija sortirana.
+
+#include <iostream>
+#include <string>
+#include <numeric>
+#include <vector>
+
+// Mozemo iskoristiti std::inner_product funkciju
+// Operacije * i + cemo zameniti sa <= i &&
+// Dakle, za kolekcije xs i ys, racunamo:
+// (x1 <= y1) && (x2 <= y2) && ...
+// Mi zapravo poredimo kolekciju samu sa sobom
+// pa ce ys biti isto xs samo bez prvog elementa
+// Pocetna vrednost (akumulator) je true
+template <typename T>
+bool is_sorted(const T& xs)
+{
+    return std::inner_product(
+        std::cbegin(xs), std::cend(xs) - 1,
+        std::cbegin(xs) + 1,
+        true,
+        // Mozemo koristiti auto takodje
+        [](const bool &x, const bool &y) { return x && y; },
+        // Ovde ne znamo tip elemenata kolekcije, pa stoga auto
+        [](const auto &x, const auto &y) { return x <= y; }
+    );
+}
+
+int main(int argc, char *argv[])
+{
+    const std::string text = "Hooloovoo";
+    std::cerr << text << ": " << is_sorted(text) << std::endl;
+
+    const std::string word = "Almost";
+    std::cerr << word << ": " << is_sorted(word) << std::endl;
+
+    const std::vector<int> numbers{ 1, 2, 3, 3, 4, 5, 6, 6, 7 };
+    std::cerr << "numbers: " << is_sorted(word) << std::endl;
+
+    return 0;
+}

10-cpp-range/03_for_each/Makefile

@@ -0,0 +1,16 @@
+PROGRAM=04_for_each.out
+CXX       = g++
+CXXFLAGS  = -g -std=c++14 -Wall -I../range-v3-0.11.0/include
+
+$(PROGRAM): main.o
+	$(CXX) -o $(PROGRAM) main.o
+
+.PHONY: clean dist
+
+clean:
+	-rm *.o $(PROGRAM) *core
+
+dist: clean
+	-tar -chvj -C .. -f ../$(PROGRAM).tar.bz2 $(PROGRAM)
+
+

10-cpp-range/03_for_each/main.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <vector>
+#include <functional>
+#include <range/v3/view.hpp>
+
+using namespace ranges::v3;
+using namespace std::placeholders;
+
+int main(int argc, char *argv[])
+{
+    std::vector<int> xs = { -1, -3, -5, 1, 3, 5};
+
+    // Pravimo pogled koji ce se sastojati od tekstualnih
+    // reprezentacija apsolutnih vrednosti brojeva iz xs,
+    // ali samo onih za koje vazi da je x < 6
+    auto results =
+        xs | view::transform(abs)
+           | view::filter(std::bind(std::less<>(), _1, 6))
+           | view::transform([] (auto value) { return std::to_string(value); });
+
+    for (auto value: results) {
+        std::cout << value << std::endl;
+    }
+
+    return 0;
+}

10-cpp-range/04_filtered_sum/Makefile

@@ -0,0 +1,16 @@
+PROGRAM=03_filtered_sum.out
+CXX       = g++
+CXXFLAGS  = -g -std=c++14 -Wall -I../range-v3-0.11.0/include
+
+$(PROGRAM): main.o
+	$(CXX) -o $(PROGRAM) main.o
+
+.PHONY: clean dist
+
+clean:
+	-rm *.o $(PROGRAM) *core
+
+dist: clean
+	-tar -chvj -C .. -f ../$(PROGRAM).tar.bz2 $(PROGRAM)
+
+

10-cpp-range/04_filtered_sum/main.cpp

@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <range/v3/numeric/accumulate.hpp>
+#include <range/v3/view.hpp>
+
+using namespace ranges::v3;
+
+template <typename Predicate, typename Collection, typename Accumulator>
+Accumulator filtered_sum(Predicate predicate, Accumulator init, const Collection &xs)
+{
+    return accumulate(xs | view::filter(predicate), init);
+}
+
+int main(int argc, char *argv[])
+{
+    std::vector<int> xs = { -1, -3, -5, 1, 3, 5};
+
+    std::cout << filtered_sum(
+                    [] (auto val) { return val > 0; },
+                    0,
+                    xs)
+              << std::endl;
+
+    return 0;
+}

10-cpp-range/05_filter_by_index/Makefile

@@ -0,0 +1,16 @@
+PROGRAM=05_filter_by_index.out
+CXX       = g++
+CXXFLAGS  = -g -std=c++1z -Wall -I../range-v3-0.11.0/include
+
+$(PROGRAM): main.o
+	$(CXX) -o $(PROGRAM) main.o
+
+.PHONY: clean dist
+
+clean:
+	-rm *.o $(PROGRAM) *core
+
+dist: clean
+	-tar -chvj -C .. -f ../$(PROGRAM).tar.bz2 $(PROGRAM)
+
+

10-cpp-range/05_filter_by_index/main.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <vector>
+#include <functional>
+#include <range/v3/view.hpp>
+
+using namespace ranges::v3;
+
+bool index_filter(size_t index) {
+    return index % 3 != 0;
+}
+
+int main(int argc, char *argv[])
+{
+    std::vector<int> xs = { -1, -3, -5, 1, 3, 5};
+
+    // Zipujemo xs sa listom svih prirodnih brojeva,
+    // filtriramo po indeksu, posle toga zaboravljamo indeks.
+    auto results = view::zip(xs, view::ints(1, unreachable))
+                 | view::filter([] (auto value) { return index_filter(value.second); })
+                 | view::transform([] (auto value) { return value.first; });
+
+    for (auto value: results)
+        std::cout << value << std::endl;
+
+    return 0;
+}

10-cpp-range/06_word_count/Makefile

@@ -0,0 +1,16 @@
+PROGRAM=06_word_count.out
+CXX       = g++
+CXXFLAGS  = -g -std=c++1z -Wall -I../range-v3-0.11.0/include
+
+$(PROGRAM): main.o
+	$(CXX) -o $(PROGRAM) main.o
+
+.PHONY: clean dist
+
+clean:
+	-rm *.o $(PROGRAM) *core
+
+dist: clean
+	-tar -chvj -C .. -f ../$(PROGRAM).tar.bz2 $(PROGRAM)
+
+

10-cpp-range/06_word_count/hare.txt

@@ -0,0 +1,39 @@
+This is the story of the hare who lost his spectacles.
+
+Owl loved to rest quietly whilst no one was watching.
+Sitting on a fence one day,
+He was surprised when suddenly a kangaroo ran close by.
+Now this may not seem strange, but when Owl overheard Kangaroo whisper to no one in
+Particular,
+"The hare has lost his spectacles," well, he began to wonder.
+Presently, the moon appeared from behind a cloud and there, lying on the grass was hare.
+In the stream that flowed by the grass a newt.
+And sitting astride a twig of a bush a bee. Ostensibly motionless, the hare was trembling with
+Excitement, for without his spectacles he was completely helpless.
+Where were his spectacles?
+Could someone have stolen them?
+Had he mislaid them?
+What was he to do?
+Bee wanted to help, and thinking he had the answer began:
+"You probably ate them thinking they were a carrot."
+"No!" interrupted Owl, who was wise.
+"I have good eye-sight, insight, and foresight. How could an intelligent hare make such a silly mistake?"
+But all this time, Owl had been sitting on the fence, scowling!
+Kangaroo were hopping mad at this sort of talk.
+She thought herself far superior in intelligence to the others.
+She was their leader, their guru.
+She had the answer: "Hare, you must go in search of the optician."
+But then she realized that Hare was completely helpless without his spectacles.
+And so, Kangaroo loudly proclaimed, "I can't send Hare in search of anything!"
+"You can guru, you can!" shouted Newt.
+"You can send him with Owl."
+But Owl had gone to sleep.
+Newt knew too much to be stopped by so small a problem
+"You can take him in your pouch."
+But alas, Hare was much too big to fit into
+Kangaroo's pouch.
+All this time, it had been quite plain to hare that the others knew nothing about spectacles.
+
+As for all their tempting ideas, well Hare didn't care.
+The lost spectacles were his own affair.
+And after all, Hare did have a spare a-pair. A-pair.

10-cpp-range/06_word_count/main.cpp

@@ -0,0 +1,72 @@
+#include <iostream>
+#include <vector>
+#include <functional>
+
+#include <range/v3/view.hpp>
+#include <range/v3/action.hpp>
+#include <range/v3/range/conversion.hpp>
+#include <range/v3/view/istream.hpp>
+
+using namespace ranges::v3;
+
+std::string string_to_lower(const std::string &s) {
+    return s | view::transform(tolower) | to<std::string>();
+}
+
+std::string string_only_alnum(const std::string &s) {
+    return s | view::filter(isalnum) | to<std::string>();
+}
+
+int main(int argc, char *argv[])
+{
+    const int n = argc <= 1
+                    ? 10
+                    : atoi(argv[1]);
+
+    const auto words =
+               // Kolekcija reci
+               istream_range<std::string>(std::cin)
+
+               // Ne zelimo da imamo velika slova
+               | view::transform(string_to_lower)
+
+               // Ne zelimo da imamo bilo sta osim slova i cifara
+               | view::transform(string_only_alnum)
+
+               // Uklanjamo prazne stringove iz kolekcije
+               | view::remove_if(&std::string::empty)
+
+               // Da bismo mogli da sortiramo, potrebna nam je
+               // random-access kolekcija
+               | to_vector 
+               | action::sort;
+
+
+    const auto results =
+               words
+
+               // Grupisemo iste reci
+               | view::group_by(std::equal_to<>())
+
+               // Potrebna nam je rec, i koliko puta se ponovila
+               | view::transform([] (const auto &group) {
+                         const auto begin       = std::begin(group);
+                         const auto end         = std::end(group);
+                         const int  size        = distance(begin, end);
+                         const std::string word = *begin;
+
+                         return std::make_pair(size, word);
+                     })
+
+               // Sortiramo rezultat
+               | to_vector | action::sort;
+
+
+    for (auto value: results | view::reverse // Sortirano je u rastucem poretku, obrcemo
+                             | view::take(n) // Uzimamo prvih `n` rezultata
+            ) {
+        std::cout << value.first << " " << value.second << std::endl;
+    }
+
+    return 0;
+}

10-cpp-range/06_word_count/main.plist

@@ -0,0 +1,14 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+ <key>clang_version</key>
+<string>clang version 5.0.0 (trunk 304107)</string>
+ <key>files</key>
+ <array>
+ </array>
+ <key>diagnostics</key>
+ <array>
+ </array>
+</dict>
+</plist>