12 |
13 | ### Doświadczenie nie tylko w programowaniu
14 |
15 | * Trener i DevOps w Coders School
16 | * Developer C++ i Python w Nokii i Credit Suisse
17 | * Team leader i Trener w Nokii
18 | * Scrum Master w Nokii i Credit Suisse
19 | * Code Reviewer w Nokii
20 | * Web developer (HTML, PHP, CSS) w StarCraft Area
21 |
22 |
23 |
24 |
25 |
26 | ### Doświadczenie jako trener
27 |
28 | * Kursy C++ w Coders School
29 | * Praktyczne Aspekty Inżynierii Oprogramowania na PWr i UWr
30 | * Nokia Academy w Nokii
31 | * Wewnętrzne szkolenia korporacyjne
32 |
33 |
67 |
68 | Uwaga:
69 | Zasada Vegas: co dzieje się w Vegas, to zostaje w Vegas.
70 | Jeśli chcesz poskarżyć się na pracodawcę, nikomu nie powiem.
71 |
72 |
73 | ___
74 |
75 | ### [Link do prezentacji w GitHub](https://github.com/coders-school/modern-cpp/tree/main/module1)
76 |
--------------------------------------------------------------------------------
/01-basic-features/01-pretest.md:
--------------------------------------------------------------------------------
1 |
2 |
3 | # Pre-test
4 |
5 | ___
6 |
7 | ## 1. Jaki jest typ zmiennej `v`?
8 |
9 | ```cpp
10 | int i = 42;
11 | const auto v = &i;
12 | ```
13 |
14 | 1. `const int`
15 | 1. `const int&`
16 | 1. `const int*`
17 | 1. inny
18 |
19 | ___
20 |
21 | ## 2. Które z poniższych inicjalizacji są poprawne w C++14?
22 |
23 | ```cpp
24 | struct P { int a, b };
25 | ```
26 |
27 | 1. `int values[] = { 1, 2, 3, 4, 5 };`
28 | 1. `P v = { 1, 4 };`
29 | 1. `P v{1, 4};`
30 | 1. `P v(1, 4);`
31 | 1. `std::vector v = { 1, 2, 3, 4 };`
32 | 1. `std::vector v(1, 2, 3, 4);`
33 | 1. `int v[] = { 1, 3, 5, 6.6 };`
34 |
35 | ___
36 |
37 | ## 3. Które z poniższych elementów można zdefiniować jako usunięte (`= delete;`)?
38 |
39 | 1. domyślny konstruktor
40 | 1. konstruktor kopiujący
41 | 1. konstruktor przenoszący
42 | 1. kopiujący operator przypisania
43 | 1. przenoszący operator przypisania
44 | 1. destruktor
45 | 1. wolna funkcja
46 | 1. metoda klasy
47 | 1. pole klasy
48 |
--------------------------------------------------------------------------------
/01-basic-features/02-standards.md:
--------------------------------------------------------------------------------
1 |
2 | # Standardy C++
3 |
4 | ___
5 |
6 | ## Historia standaryzacji C++
7 |
8 | ### Kiedy utworzono C++?
9 |
10 |
11 | #### 1979
12 |
13 |
14 | * 1998 - pierwszy standard ISO C++ - C++98
15 | * 2003 - TC1 (Technical Corrigendum 1) opublikowane jako C++03. Poprawki błędów dla C++98
16 | * 2005 - Publikacja raportu technicznego (Technical Report 1) - przestrzeń nazw std::tr1
17 | * 2011 - opublikowano C++0x jako C++11
18 | * 2013 - pełna wersja robocza C++1y
19 | * 2014 - C++1y opublikowany jako C++14
20 | * 2017 - C++1z opublikowany jako C++17
21 | * 2020 - C++2a opublikowane jako C++20
22 | * 2023 - C++2b powinno zostać opublikowane jako C++23
23 |
24 | ___
25 |
26 | ## Wsparcie kompilatorów
27 |
28 | ### [GCC](https://gcc.gnu.org/projects/cxx-status.html) - [Clang](https://clang.llvm.org/cxx_status.html)
29 |
30 |
31 |
C++23
32 |
33 |
Pełne wsparcie: jeszcze nie zaimplementowane
34 |
Flagi kompilatora: -std=c++2b
35 |
36 |
37 |
38 |
39 |
C++20
40 |
41 |
(prawie) pełne wsparcie: gcc11, clang14
42 |
Flagi kompilatora: -std=c++20, -std=c++2a
43 |
44 |
45 |
46 |
C++17
47 |
48 |
Pełne wsparcie: gcc7, clang5
49 |
Flagi kompilatora: -std=c++17, -std=c++1z
50 |
51 |
52 |
53 |
C++14
54 |
55 |
Pełne wsparcie: gcc5, clang3.4
56 |
Flagi kompilatora: -std=c++14, -std=c++1y
57 |
Domyślnie włączone od gcc6.1
58 |
59 |
60 |
61 |
C++11
62 |
63 |
Pełne wsparcie: gcc4.8.1, clang3.3
64 |
Flagi kompilatora: -std=c++11, -std=c++0x
65 |
66 |
67 |
--------------------------------------------------------------------------------
/01-basic-features/03-static-assert.md:
--------------------------------------------------------------------------------
1 |
2 | # `static_assert`
3 |
4 | ___
5 |
6 | ## `static_assert`
7 |
8 | ```cpp
9 | template
10 | void swap(T& a, T& b)
11 | {
12 | static_assert(std::is_copy_constructible::value,
13 | "Swap requires copying");
14 | static_assert(std::is_nothrow_move_constructible_v &&
15 | std::is_nothrow_move_assignable_v);
16 | auto c = b;
17 | b = a;
18 | a = c;
19 | }
20 | ```
21 |
22 |
23 | **Motywacja**: Przerywa kompilację w przypadku nie spełnienia warunków zdefiniowanych przez programistę (zwykle nie spełnienie wymagań określonych typów).
24 |
25 |
26 | Wykonuje sprawdzanie asercji w czasie kompilacji. Zwykle używany z biblioteką ``.
27 |
28 |
29 | Wiadomość podawana jako drugi parametr jest opcjonalna od C++17.
30 |
31 |
32 | ___
33 |
34 | ## Zadanie
35 |
36 | Sprawdź, czy `M_PI` wykorzystane w pliku `Circle.cpp` nie jest równe `3.14`.
37 |
38 | ```cpp
39 | static_assert(condition, "optional message");
40 | ```
41 |
--------------------------------------------------------------------------------
/01-basic-features/04-nullptr.md:
--------------------------------------------------------------------------------
1 |
2 | # `nullptr`
3 |
4 | ___
5 |
6 | ## Porównanie wskaźników
7 |
8 | ```cpp
9 | int* p1 = nullptr;
10 | int* p2 = NULL;
11 | int* p3 = 0;
12 |
13 | p2 == p1; // true
14 | p3 == p1; // true
15 |
16 | int* p {}; // p is set to nullptr
17 | ```
18 |
19 | ___
20 |
21 | ## Overload resolution - wybór przeciążenia funkcji
22 |
23 | ```cpp
24 | void foo(int);
25 |
26 | foo(0); // calls foo(int)
27 | foo(NULL); // calls foo(int)
28 | foo(nullptr); // compile time error
29 | ```
30 |
31 |
32 | ```cpp
33 | void bar(int);
34 | void bar(void*);
35 | void bar(std::nullptr_t);
36 |
37 | bar(0); // calls bar(int)
38 | bar(NULL); // calls bar(int) if NULL is 0, may be ambiguous if NULL is 0L
39 | bar(nullptr); // calls bar(std::nullptr_t) if provided, bar(void*) otherwise
40 | ```
41 |
42 |
43 | ___
44 |
45 | ## `nullptr`
46 |
47 | * wartość wskaźnika, który na nic nie wskazuje
48 | * bardziej ekspresyjny i bezpieczniejszy zapis niż stała NULL/0
49 | * ma zdefiniowany typ std::nullptr_t
50 | * rozwiązuje problem z przeciążonymi funkcjami, które jako argument przyjmują wskaźnik lub liczbę całkowitą
51 |
--------------------------------------------------------------------------------
/01-basic-features/05-scoped-enum.md:
--------------------------------------------------------------------------------
1 |
2 | # Silne typy wyliczeniowe
3 |
4 | ## scoped `enum`
5 |
6 | ___
7 |
8 | ## Zwykłe `enum`
9 |
10 | ```cpp
11 | enum Colors {
12 | RED = 10,
13 | ORANGE,
14 | GREEN
15 | };
16 |
17 | Colors a = RED; // OK
18 | int b = GREEN; // OK
19 |
20 | enum Fruits {
21 | ORANGE,
22 | BANANA
23 | };
24 |
25 | Colors c = ORANGE; // 11 czy 0?
26 | // Hopefully: error: ‘ORANGE’ conflicts with a previous declaration
27 | ```
28 |
29 | ___
30 |
31 | ## `enum class`
32 |
33 | ```cpp
34 | enum class Languages {
35 | ENGLISH,
36 | GERMAN,
37 | POLISH
38 | };
39 |
40 | Languages a = Languages::ENGLISH;
41 | // Languages b = GERMAN;
42 | // int c = Languages::ENGLISH;
43 | int d = static_cast(Languages::ENGLISH); // only explicit cast allowed
44 | ```
45 |
46 |
47 | **Motywacja**: Silniejsze i mniej podatne na błędy enumy.
48 |
49 |
50 | * Wprowadzony w C++11
51 | * Ogranicza zakres zdefiniowanych stałych tylko do tych zdefiniowanych w klasie wyliczeniowej
52 | * Dostęp do wartości można uzyskać poprzedzając wartość nazwą enuma
53 | * Nie zezwala na niejawne konwersje, można zrobić jawną konwersją za pomocą static_cast
54 | * enum class == enum struct
55 |
56 | ___
57 |
58 | ## typ bazowy `enum`
59 |
60 | ```cpp
61 | #include
62 | #include
63 |
64 | enum Colors { YELLOW = 10, ORANGE };
65 | enum BigValue { VALUE = std::numeric_limits::max() };
66 | enum RgbColors : unsigned char {
67 | RED = 0x01,
68 | GREEN = 0x02,
69 | BLUE = 0x04,
70 | // BLACK = 0xFF + 1 // error: enumerator value 256 is outside
71 | }; // the range of underlying type ‘unsigned char’
72 |
73 | int main() {
74 | std::cout << sizeof(Colors) << std::endl; // 4 - sizeof(int)
75 | std::cout << sizeof(BigValue) << std::endl; // 8 - sizeof(long)
76 | std::cout << sizeof(RgbColors) << std::endl; // 1 - sizeof(unsigned char)
77 | return 0;
78 | }
79 | ```
80 |
81 | [Pobaw się kodem na ideone.com](https://ideone.com/e.js/8sR1XK)
82 |
83 | ___
84 |
85 | ## rozmiar `enum`
86 |
87 | * Domyślny rozmiar enuma to sizeof(int)
88 | * typ bazowy enum jest rozszerzany automatycznie, jeśli wprowadzone wartości są większe od int
89 | * Aby zaoszczędzić trochę pamięci możemy zdefiniować typ bazowy za pomocą dziedziczenia
90 | * Kompilator nie pozwoli na zdefiniowanie wartości większej niż może pomieścić zdefiniowany typ bazowy
91 | * Dziedziczenie działa zarówno dla starych enumów oraz dla enum class
92 |
93 | ___
94 |
95 | ## deklaracja zapowiadająca `enuma` (forward declaration)
96 |
97 | W przypadku `enum`ów ze zdefiniowanym typem bazowym można podać samą deklarację, jeśli wartości nie muszą być znane.
98 |
99 |
100 | Dzięki temu nie będzie potrzeby ponownej kompilacji pliku źródłowego, jeśli zostaną dodane nowe wartości do typu wyliczeniowego.
101 |
102 |
103 | ```cpp
104 | enum Colors : unsigned int;
105 | enum struct Languages : unsigned char;
106 | ```
107 |
108 |
109 | ___
110 |
111 | ## Zadanie
112 |
113 | Napisz silny typ wyliczeniowy o nazwie `Color` i zdefiniuj w nim 3 wybrane kolory.
114 |
115 | Dodaj dziedziczenie po `unsigned char`.
116 |
117 | Dodaj nowe pole: `Color color` w klasie `Shape`, tak aby każdy kształt mógł mieć swój własny, zdefiniowany kolor.
118 |
119 | Dodaj domyślną wartość koloru w klasie Shape.
120 |
--------------------------------------------------------------------------------
/01-basic-features/06-auto.md:
--------------------------------------------------------------------------------
1 |
2 | # Automatyczna dedukcja typu
3 |
4 | ___
5 |
6 | ## słowo kluczowe `auto`
7 |
8 | ```cpp
9 | auto a; // error: declaration of ‘auto a’ has no initializer
10 | auto i = 42; // i is int
11 | auto u = 42u; // u is unsigned
12 | auto d = 42.0; // d is double
13 | auto f = 42.0f; // f is float
14 |
15 | double f();
16 | auto r1 = f(); // r1 is double
17 |
18 | std::set collection;
19 | auto it = collection.begin(); // it is std::set::iterator
20 | ```
21 |
22 | **Motywacja**: nieważne (ale silnie zdefiniowane) typy, mniej pisania, mniej refaktoryzacji.
23 |
24 |
25 | * Kompilator może automatycznie wywnioskować typ zmiennej podczas inicjalizacji
26 | * Dedukcja jest dokonywana na podstawie literału, innej zmiennej lub zwracanego typu funkcji
27 | * Obowiązują takie same zasady, jak w przypadku dedukcji typów dla szablonów
28 |
29 | ___
30 |
31 | ## Modyfikatory zmiennych
32 |
33 | ```cpp
34 | int func() { return 10; }
35 |
36 | int main() {
37 | const auto& v1 = func(); // v1 is const int&
38 | const auto v2 = func(); // v2 is const int
39 | // auto& v3 = func(); // error: cannot bind non-const lvalue reference
40 | // of type ‘int&’ to an rvalue of type ‘int’
41 | auto v4 = func(); // v4 is int
42 | return 0;
43 | }
44 | ```
45 |
46 | ___
47 |
48 |
49 | ### Reguły dedukcji dla referencji
50 |
51 | ```cpp
52 | const vector values;
53 | auto v1 = values; // v1 : vector
54 | auto& v2 = values; // v2 : const vector&
55 |
56 | volatile long clock = 0L;
57 | auto c1 = clock; // c1 : long
58 | auto& c2 = clock; // c2 : volatile long&
59 |
60 | Gadget items[10];
61 | auto g1 = items; // g1 : Gadget*
62 | auto& g2 = items; // g2 : Gadget(&)[10] - a reference to
63 | // the 10-elementh array of Gadgets
64 |
65 | int func(double) { return 10; }
66 | auto f1 = func; // f1 : int (*)(double)
67 | auto& f2 = func ; // f2: int (&)(double)
68 | ```
69 |
70 | * Referencja oznacza ten sam obiekt o takich samych właściwościach
71 | * Referencja zachowuje kwalifikatory cv (cv-qualifiers: const, volatile)
72 | * Kopia porzuca kwalifikatory cv
73 | * Kopia tablicy zamienia się na wskaźnik
74 |
75 | ___
76 |
77 | ### Deklaracja funkcji ze strzałką
78 |
79 | ```cpp
80 | int sum(int a, int b);
81 | auto sum(int a, int b) -> int;
82 |
83 |
84 | auto isEven = [](int a) -> bool {
85 | return a % 2;
86 | }
87 | ```
88 |
89 | Wprowadzono ją, aby umożliwić definicję typu zwracanego z funkcji lambda.
90 |
91 |
92 | ___
93 |
94 |
95 | ### Dedukcja typu zwracanego przez funkcję
96 |
97 | ```cpp
98 | auto multiply(int x, int y) {
99 | return x * y;
100 | }
101 |
102 | auto get_name(int id) {
103 | if (id == 1)
104 | return std::string("Gadget");
105 | else if (id == 2)
106 | return std::string("SuperGadget");
107 | return string("Unknown");
108 | }
109 |
110 | auto factorial(int n) {
111 | if (n == 1)
112 | return 1;
113 | return factorial(n - 1) * n;
114 | }
115 | ```
116 |
117 | * Wprowadzony w C++14
118 | * Mechanizm dedukcji jest taki sam, jak w przypadku dedukcji typów zmiennych
119 | * Wszystkie instrukcje return muszą zwracać ten sam typ
120 | * Rekursja jest dozwolona tylko wtedy, gdy rekurencyjne wywołanie funkcji nie jest pierwszą instrukcją return
121 |
122 | ___
123 |
124 | ## zakresowa pętla for
125 |
126 | ```cpp
127 | std::vector v = {0, 1, 2, 3, 4, 5};
128 |
129 | for (const auto & element : v) {
130 | std::cout << element << ' ';
131 | }
132 | std::cout << '\n';
133 | ```
134 |
135 | ___
136 |
137 | ### Kod wygenerowany na podstawie zakresowej pętli for
138 |
139 | ```cpp
140 | {
141 | auto && __range = range_expression ;
142 | auto __begin = begin_expr ;
143 | auto __end = end_expr ;
144 | for ( ; __begin != __end; ++__begin) {
145 | range_declaration = *__begin;
146 | loop_statement
147 | }
148 | }
149 | ```
150 |
151 | ___
152 |
153 | ## Zadanie
154 |
155 | Umieść `auto` tam, gdzie uważasz, powinno się znaleźć.
156 |
157 | Tam, gdzie to możliwe, użyj zakresowych pętli `for`.
158 |
--------------------------------------------------------------------------------
/01-basic-features/07-using.md:
--------------------------------------------------------------------------------
1 |
2 | # alias typu `using`
3 |
4 | ___
5 |
6 | ## Aliasy typów
7 |
8 | ```cpp
9 | typedef std::ios_base::fmtflags Flags;
10 | using Flags = std::ios_base::fmtflags; // the same as above
11 | Flags fl = std::ios_base::dec;
12 | ```
13 |
14 |
15 | ```cpp
16 | typedef std::vector> SocketContainer;
17 | std::vector> typedef SocketContainer; // correct ;)
18 | using SocketContainer = std::vector>;
19 | ```
20 |
21 |
22 | **Motywacja**: Bardziej intuicyjne tworzenie aliasów.
23 |
24 |
25 | Alias to nazwa odnosząca się do wcześniej zdefiniowanego typu. Można go utworzyć za pomocą `typedef`.
26 | Od C++11 należy tworzyć aliasy typu za pomocą słowa kluczowego `using`.
27 |
28 |
29 | ___
30 |
31 | ### Aliasy szablonów
32 |
33 | ```cpp
34 | template
35 | using StrKeyMap = std::map;
36 |
37 | StrKeyMap my_map; // std::map
38 | ```
39 |
40 | Alias typu można sparametryzować za pomocą szablonów. Z `typedef` było to niemożliwe.
41 |
42 |
43 | Nie można tworzyć specjalizacji szablonowych aliasów.
44 |
45 |
46 | ___
47 |
48 | ### Dziedziczenie konstruktorów
49 |
50 | ```cpp
51 | struct A {
52 | explicit A(int);
53 | int a;
54 | };
55 |
56 | struct B : A {
57 | using A::A; // implicit declaration of B::B(int)
58 | B(int, int); // overloaded inherited Base ctor
59 | };
60 | ```
61 |
62 | Dzięki `using` możemy też "odziedziczyć" konstruktory, które normalnie nie są dziedziczone.
63 |
64 | * Konstruktory klas pochodnych są generowane niejawnie i tylko jeśli są używane
65 | * Konstruktory klas pochodnych przyjmują te same argumenty, co konstruktory klas bazowych
66 | * Konstruktor klasy pochodnej wywołuje odpowiedni konstruktor klasy bazowej
67 | * Dziedziczenie konstruktora w klasie, która posiada nowe pola, może być ryzykowne - nowe pola mogą być niezainicjowane
68 |
69 | ___
70 |
71 | ## Zadanie
72 |
73 | Zamień `typedef` na `using`.
74 |
--------------------------------------------------------------------------------
/01-basic-features/08-uniform-initialization.md:
--------------------------------------------------------------------------------
1 |
2 | # Jednolita inicjalizacja
3 |
4 | ___
5 |
6 | ## Inicjalizacja w C++98/03
7 |
8 |
9 | int a; // undefined value
10 | int b(5); // direct initialization, b = 5
11 | int c = 10; // copy initialization, c = 10
12 | int d = int(); // default initialization, d = 0
13 | int e(); // function declaration - "most vexing parse"
14 |
15 | int values[] = { 1, 2, 3, 4 }; // brace initialization of aggregate
16 | int array[] = { 1, 2, 3.5 }; // C++98 - ok, implicit type narrowing
17 |
18 | struct P { int a, b; };
19 | P p = { 20, 40 }; // brace initialization of POD
20 |
21 | std::complex<double> c(4.0, 2.0); // initialization of classes
22 |
23 | std::vector<std::string> names; // no initialization for list of values
24 | names.push_back("John");
25 | names.push_back("Jane");
26 |
27 |
28 | ___
29 |
30 | ## inicjalizacja w C++11 z użyciem `{}`
31 |
32 |
33 | int a; // still undefined value
34 | int b{5}; // brace initialization, b = 5
35 | int c{}; // brace initialization, c = 0
36 |
37 | int values[] = { 1, 2, 3, 4 }; // brace initialization of aggregate
38 | int array[] = { 1, 2, 3.5 }; // C++11: error - implicit type narrowing
39 |
40 | struct P { int a, b; };
41 | P p = { 20, 40 }; // brace initialization of POD
42 |
43 | std::complex<double> c{4.0, 2.0}; // brace initialization calls adequate c-tor
44 |
45 | std::vector<std::string> names = { "John", "Jane" }; // brace initialization of vector
46 |
47 |
48 | **Motywacja**: wyeliminowanie problematycznych przypadków inicjalizacji z C++98, inicjalizacja kontenerów STL, jeden uniwersalny sposób inicjalizacji.
49 |
50 |
51 | ___
52 |
53 | ## Inicjalizacja zmiennych niestatycznych w klasie
54 |
55 | ```cpp
56 | struct Foo
57 | {
58 | Foo() {}
59 | Foo(std::string a) : a_(a) {}
60 | void print() { std::cout << a_ << std::endl; }
61 |
62 | private:
63 | std::string a_ = "Foo"; // C++98: error, C++11: OK
64 | static const unsigned VALUE = 20u; // C++98: OK, C++11: OK
65 | };
66 |
67 | Foo().print(); // Foo
68 | Foo("Bar").print(); // Bar
69 | ```
70 |
71 | ___
72 |
73 | ## `std::initializer_list`
74 |
75 | ```cpp
76 | auto values = {1, 2, 3, 4, 5}; // values is std::initializer_list
77 | std::vector v = {1, 2, -3}; // creates a vector from
78 | // std::initializer_list
79 | ```
80 |
81 | * Zdefiniowany w nagłówku initializer_list
82 | * Elementy są przechowywane w tablicy
83 | * Elementy są niezmienne (immutable)
84 | * Elementy muszą być kopiowalne
85 | * Ma ograniczony interfejs, ma dostęp przez iteratory - begin(), end(), size()
86 | * Powinien być przekazywany do funkcji przez wartość
87 |
88 | ___
89 |
90 | ## Priorytety konstruktorów
91 |
92 |
93 | template<class Type>
94 | class Bar {
95 | std::vector<Type> values_;
96 | public:
97 | Bar(std::initializer_list<Type> values) : values_(values) {}
98 | Bar(Type a, Type b) : values_{a, b} {}
99 | };
100 |
101 | Bar<int> c = {1, 2, 5, 51};// calls std::initializer_list c-tor
102 | Bar<int> d{1, 2, 5, 51};// calls std::initializer_list c-tor
103 | Bar<int> e = {1, 2};// calls std::initializer_list c-tor
104 | Bar<int> f{1, 2};// calls std::initializer_list c-tor
105 | Bar<int> g(1, 2);// calls Bar(Type a, Type b) c-tor
106 | Bar<int> h = {};// calls std::initializer_list c-tor
107 | // or default c-tor if exists
108 | Bar<std::unique_ptr<int>> c = {new int{1}, new int{2}};
109 | // error - std::unique_ptr is non-copyable
110 |
111 |
112 | Konstruktor z std::initializer_list ma większy priorytet, nawet jeśli inne konstruktory pasują lepiej.
113 |
114 |
115 | ___
116 |
117 | ## Zadanie
118 |
119 | Zastosuj `initializer_list`, aby zainicjować kolekcję `shapes`.
120 |
121 | Dodaj nowy konstruktor do Shape - `Shape(Color c)`. Co się dzieje?
122 |
123 | Użyj dziedziczenia konstruktora, aby umożliwić inicjalizację wszystkich kształtów, podając tylko `Color` jako parametr.
124 |
125 | Utwórz kilka kształtów, podając tylko parametr `Color`.
126 |
127 | Dodaj inicjalizację pola w klasie dla wszystkich kształtów, aby bezpiecznie używać odziedziczonego konstruktora.
128 |
--------------------------------------------------------------------------------
/01-basic-features/09-default-delete-final-override.md:
--------------------------------------------------------------------------------
1 |
2 | # Nowe słowa kluczowe
3 |
4 | ## `default`, `delete`, `final`, `override`
5 |
6 | ___
7 |
8 | ## słowo kluczowe `default`
9 |
10 | ```cpp
11 | class AwesomeClass {
12 | public:
13 | AwesomeClass(const AwesomeClass&);
14 | AwesomeClass& operator=(const AwesomeClass&);
15 | // user defined copy operations prevents implicit generation
16 | // of default c-tor and move operations
17 |
18 | AwesomeClass() = default;
19 | AwesomeClass(AwesomeClass&&) = default;
20 | AwesomeClass& operator=(AwesomeClass&&) = default;
21 | };
22 | ```
23 |
24 | ___
25 |
26 |
27 | ## słowo kluczowe `default`
28 |
29 | * Deklaracja default wymusza na kompilatorze generowanie domyślnej niejawnej implementacji dla oznaczonych funkcji
30 | * 7 funkcji specjalnych można oznaczyć jako default:
31 | * domyślny konstruktor
32 | * konstruktor kopiujący
33 | * kopiujący operator przypisania
34 | * konstruktor przenoszący
35 | * przenoszący operator przypisania
36 | * destruktor
37 | * operator<=> (C++20)
38 | * Operacje zadeklarowane jako default są traktowane jako zadeklarowane przez użytkownika (nie zadeklarowane niejawnie)
39 | * Domyślna implementacja domyślnego konstruktora wywołuje domyślny konstruktor dla każdej składowej
40 | * Domyślna implementacja destruktora wywołuje destruktor dla każdej składowej
41 | * Domyślną implementacją operacji kopiowania jest wywołanie operacji kopiowania dla każdej składowej
42 | * Domyślną implementacją operacji przenoszenia jest wywołanie operacji przenoszenia dla każdej składowej
43 |
44 | ___
45 |
46 | ## słowo kluczowe `delete`
47 |
48 | ```cpp
49 | class NoCopyable { // NoCopyable idiom
50 | public:
51 | NoCopyable() = default;
52 | NoCopyable(const NoCopyable&) = delete;
53 | NoCopyable& operator=(const NoCopyable&) = delete;
54 | };
55 |
56 | class NoMoveable { // NoMoveable idiom
57 | NoMoveable(NoMoveable&&) = delete;
58 | NoMoveable& operator=(NoMoveable&&) = delete;
59 | };
60 | ```
61 |
62 | ___
63 |
64 | ## słowo kluczowe `delete`
65 |
66 | * Deklaracja delete usuwa zaznaczoną funkcję
67 | * Wywołanie usuniętej funkcji lub pobranie jej adresu powoduje błąd kompilacji
68 | * Żaden kod nie jest generowany dla usuniętej funkcji
69 | * Usunięta funkcja jest traktowana jako zadeklarowana przez użytkownika
70 | * Deklaracja delete może być używana do dowolnej funkcji, nie tylko do specjalnych funkcji składowych klasy
71 | * delete może służyć do uniknięcia niechcianej niejawnej konwersji argumentów funkcji
72 |
73 | ___
74 |
75 | ## słowo kluczowe `delete`
76 |
77 | ```cpp
78 | void integral_only(int a) {
79 | // ...
80 | }
81 | void integral_only(double d) = delete;
82 |
83 | integral_only(10); // OK
84 | short s = 3;
85 | integral_only(s); // OK - implicit conversion to int
86 | integral_only(3.0); // error - use of deleted function
87 | ```
88 |
89 | ___
90 |
91 | ## Zadanie
92 |
93 | Spraw, aby kompilator sam automatycznie wygenerował implementacje dla konstruktów kopiujących dla wszystkich kształtów.
94 |
95 | Usuń metodę `getY()` w `Square`.
96 |
97 | Usuń wszystkie domyślne (bezparametryczne) konstruktory kształtów.
98 |
99 | ___
100 |
101 | ## słowo kluczowe `final`
102 |
103 | ```cpp
104 | struct A final {};
105 |
106 | struct B : A {}; // compilation error
107 | // cannot derive from class marked as final
108 | ```
109 |
110 | Słowo kluczowe `final` używane po deklaracji klasy/struktury blokuje dziedziczenie z tej klasy.
111 |
112 |
113 | ___
114 |
115 | ## słowo kluczowe `final`
116 |
117 | ```cpp
118 | struct A {
119 | virtual void foo() const final {}
120 | void bar() const final {} // compilation error, only virtual
121 | // functions can be marked as final
122 | };
123 |
124 | struct B : A {
125 | void foo() const {} // compilation error, cannot override
126 | // function marked as final
127 | };
128 | ```
129 |
130 | `final` używane po deklaracji funkcji wirtualnej blokuje możliwość nadpisania implementacji tej funkcji w klasach pochodnych.
131 |
132 |
133 | ___
134 |
135 |
136 | ## słowo kluczowe `override`
137 |
138 | ```cpp
139 | struct Base {
140 | virtual void a();
141 | virtual void b() const;
142 | virtual void c();
143 | void d();
144 | };
145 | ```
146 |
147 | ```cpp
148 | struct WithoutOverride : Base {
149 | void a(); // overrides Base::a()
150 | void b(); // doesn't override Base::b() const
151 | virtual void c(); // overrides Base::c()
152 | void d(); // doesn't override Base::d()
153 | };
154 | ```
155 |
156 |
157 | ```cpp
158 | struct WithOverride : Base {
159 | void a() override; // OK - overrides Base::a()
160 | void b() override; // error - doesn't override Base::b() const
161 | virtual void c() override; // OK - overrides Base::c()
162 | void d() override; // error - Base::d() is not virtual
163 | };
164 | ```
165 |
166 |
167 | Deklaracja override wymusza na kompilatorze sprawdzenie, czy dana funkcja wirtualna jest zadeklarowana w taki sam sposób w klasie bazowej.
168 |
169 |
170 | ___
171 |
172 | ## Zadanie
173 |
174 | Oznacz klasę `Circle` jako `final`.
175 |
176 | Oznacz `getX()` w prostokącie jako `final`. Jaki jest problem?
177 |
178 | Oznacz słowem `override` wszystkie nadpisane metody wirtualne. Czy potrafisz dostrzec problem?
179 |
--------------------------------------------------------------------------------
/01-basic-features/10-recap.md:
--------------------------------------------------------------------------------
1 |
2 | # Podsumowanie
3 |
4 | ___
5 |
6 |
7 | ## Co pamiętasz z Nowoczesnego C++?
8 |
9 | 1. static_assert
10 | 2. nullptr
11 | 3. silne typy wyliczeniowe (scoped enum)
12 | 4. słowo kluczowe auto i zakresowa pętla for
13 | 5. alias typu using
14 | 6. jednolita inicjalizacja
15 | 7. nowe słowa kluczowe: default, delete, final, override
16 |
--------------------------------------------------------------------------------
/01-basic-features/11-pretest-answers.md:
--------------------------------------------------------------------------------
1 |
2 |
3 | # Pre-test
4 |
5 | ## Odpowiedzi
6 |
7 | ___
8 |
9 | ## 1. Jaki jest typ zmiennej `v`?
10 |
11 | ```cpp
12 | int i = 42;
13 | const auto v = &i;
14 | ```
15 |
16 | 1. const int
17 | 1. const int&
18 | 1. const int*
19 | 1. inny
20 |
21 | ___
22 |
23 | ## 2. Które z poniższych inicjalizacji są poprawne w C++14?
24 |
25 | ```cpp
26 | struct P { int a, b };
27 | ```
28 |
29 | 1. int values[] = { 1, 2, 3, 4, 5 };
30 | 1. P v = { 1, 4 };
31 | 1. P v{1, 4};
32 | 1. P v(1, 4);
33 | 1. std::vector<int> v = { 1, 2, 3, 4 };
34 | 1. std::vector<int> v(1, 2, 3, 4);
35 | 1. int v[] = { 1, 3, 5, 6.6 };
36 |
37 | ___
38 |
39 | ## 3. Które z poniższych elementów można zdefiniować jako usunięte (`= delete;`)?
40 |
41 | 1. domyślny konstruktor
42 | 1. konstruktor kopiujący
43 | 1. konstruktor przenoszący
44 | 1. kopiujący operator przypisania
45 | 1. przenoszący operator przypisania
46 | 1. destruktor
47 | 1. wolna funkcja
48 | 1. metoda klasy
49 | 1. pole klasy
50 |
--------------------------------------------------------------------------------
/01-basic-features/12-decltype.md:
--------------------------------------------------------------------------------
1 |
2 | # `decltype`
3 |
4 | ___
5 |
6 | ## `decltype`
7 |
8 | **Motywacja**: Dedukcja w kontekstach, w których auto jest niedozwolone.
9 |
10 | `decltype` pozwala kompilatorowi wydedukować typ zmiennej lub wyrażenia, np. gdy zwracany typ można wywnioskować z parametrów funkcji.
11 |
12 | ```cpp
13 | std::map collection;
14 |
15 | decltype(collection) other; // other has type of collection
16 | decltype(collection)::mapped_type value; // value is float
17 |
18 | template
19 | auto add(T1 a, T2 b) -> decltype(a + b) // from C++14 decltype not necessary
20 | {
21 | return a + b;
22 | }
23 | ```
24 |
25 | ___
26 |
27 | ## `decltype(auto)`
28 |
29 | Mechanizm dedukcji `decltype(auto)` zachowuje modyfikatory typu (referencje, const, volatile).
30 |
31 | Mechanizm dedukcji `auto` nie zachowuje modyfikatorów typu.
32 |
33 | ```cpp
34 | template
35 | decltype(auto) Example(FunctionType fun, Args&&... args)
36 | {
37 | return fun(std::forward(args)...);
38 | }
39 | ```
40 |
--------------------------------------------------------------------------------
/01-basic-features/index.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 | Nowoczesny C++
8 |
9 |
10 |
11 |
12 |
13 |
14 |
15 |
16 |
17 |
18 |
19 |
20 |
21 |
22 |
110 |
111 |
112 |
113 |
114 |
115 |
116 |
126 |
127 |
128 |
--------------------------------------------------------------------------------
/01-basic-features/modern_cpp_basic_features.pdf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/coders-school/modern-cpp/3b4d7191ebf2b2048f2d399a369790d6d8757601/01-basic-features/modern_cpp_basic_features.pdf
--------------------------------------------------------------------------------
/02-advanced-features/00-intro.md:
--------------------------------------------------------------------------------
1 | ## Poznajmy się lepiej
2 |
3 | * Twoje imię oraz doświadczenie w programowaniu
4 | * Czego nie lubisz w C++?
5 | * Twoje hobby
6 |
7 | ___
8 |
9 |
10 |
Łukasz Ziobroń
11 |
12 |
13 | ### Doświadczenie nie tylko w programowaniu
14 |
15 | * Trener i DevOps w Coders School
16 | * Developer C++ i Python w Nokii i Credit Suisse
17 | * Team leader i Trener w Nokii
18 | * Scrum Master w Nokii i Credit Suisse
19 | * Code Reviewer w Nokii
20 | * Web developer (HTML, PHP, CSS) w StarCraft Area
21 |
22 |
23 |
24 |
25 |
26 | ### Doświadczenie jako trener
27 |
28 | * Kursy C++ w Coders School
29 | * Praktyczne Aspekty Inżynierii Oprogramowania na PWr i UWr
30 | * Nokia Academy w Nokii
31 | * Wewnętrzne szkolenia korporacyjne
32 |
33 |
56 |
57 | ___
58 |
59 | ## Contract
60 |
61 | * 🎰 Vegas rule
62 | * 🗣 Discussion, not a lecture
63 | * ☕️ Additional breaks on demand
64 | * ⌚️ Be on time after breaks
65 |
--------------------------------------------------------------------------------
/03-move-semantics/01-pretest.md:
--------------------------------------------------------------------------------
1 | ## Pre-test 📝
2 |
3 | ___
4 |
5 | ### Pytanie 1/2
6 |
7 | Mamy zdefiniowaną tylko poniższą funkcję szablonową.
8 | Co się stanie w każdym z poniższych przypadków? Który z nich się skompiluje i wyświetli "OK"?
9 |
10 | ```cpp
11 | template
12 | void foo(T && a) {std::cout << "OK\n"; }
13 |
14 | int a = 5;
15 | ```
16 |
17 | 1. foo(4);
18 | 2. foo(a);
19 | 3. foo(std::move(a));
20 |
21 | ___
22 |
23 | ### Pytanie 2/2
24 |
25 | Co wyświetli się na ekranie?
26 |
27 | ```cpp
28 | class Gadget {};
29 | void f(const Gadget&) { std::cout << "const Gadget&\n"; }
30 | void f(Gadget&) { std::cout << "Gadget&\n"; }
31 | void f(Gadget&&) { std::cout << "Gadget&&\n"; }
32 |
33 | template
34 | void use(Gadget&& g) { f(g); }
35 |
36 | int main() {
37 | const Gadget cg;
38 | Gadget g;
39 | use(cg);
40 | use(g);
41 | use(Gadget());
42 | }
43 | ```
44 |
--------------------------------------------------------------------------------
/03-move-semantics/02-rvalues-lvalues.md:
--------------------------------------------------------------------------------
1 | # Semantyka przenoszenia
2 |
3 | ## Motywacja
4 |
5 | * Lepsza optymalizacja przez unikanie zbędnych kopii
6 | * Ulepszone bezpieczeństwo poprzez zapewnienie tylko jednej instancji obiektu
7 |
8 | ___
9 |
10 | ## Nowe elementy składni
11 |
12 | * auto && value - r-value reference
13 | * Class(Class &&) - move constructor
14 | * Class& operator=(Class&&) - move assignment operator
15 | * std::move() auxilary function
16 | * std::forward() auxilary function
17 |
18 | ___
19 |
20 | ## r-value, l-value
21 |
22 | ```cpp
23 | struct A { int a, b; };
24 |
25 | A foo() { return {1, 2}; }
26 |
27 | A a; // l-value
28 | A{5, 3}; // r-value
29 | foo(); // r-value
30 | ```
31 |
32 | ___
33 |
34 | ## r-value, l-value
35 |
36 | * obiekty l-value mają nazwę i adres
37 | * obiekty l-value są trwałe, w kolejnej linii kodu można się do nich odwołać
38 | * obiekty r-value nie mają nazwy (zazwyczaj) ani adresu
39 | * obiekty r-value są tymczasowe, w kolejnej linii kodu nie można się do nich odwołać
40 |
41 | ___
42 |
43 | ## r-value and l-value references
44 |
45 | ```cpp
46 | struct A { int a, b; };
47 | A foo() { return {1, 2}; }
48 |
49 | A a; // l-value
50 | A{5, 3}; // r-value
51 | foo(); // r-value
52 |
53 | A & ra = a; // l-value reference to l-value, OK
54 | A & rb = foo(); // l-value reference to r-value, ERROR
55 | A const& rc = foo(); // const l-value reference to r-value, OK (exception)
56 |
57 | A && rra = a; // r-value reference to l-value, ERROR
58 | A && rrb = foo(); // r-value reference to r-value, OK
59 |
60 | A ca{20, 40};
61 | A const&& rrc = ca; // const r-value reference to l-value, ERROR
62 | ```
63 |
64 |
65 | ___
66 |
67 | ## r-value czy l-value?
68 |
69 |
70 | str1 + str2 // r-value
71 | str1 += str2 // l-value
72 | [](int x){ return x * x; }; // r-value
73 | std::move(a); // r-value
74 | int && a = 4; // 4 is an r-value, a is an l-value
75 |
76 |
77 | ___
78 |
79 | ## referencja do r-value to... l-value?
80 |
81 | ### `int && a = 4;`
82 |
83 | * 4 to r-value
84 | * a to referencja do r-value
85 | * samo a jest jednak l-value - ma adres i nazwę, można się później do niego odnosić
86 | * ale na razie o tym nie myśl 😉
87 |
88 | ___
89 |
90 |
91 |
92 |
131 |
132 |
133 |
134 |
135 |
136 |
137 |
147 |
148 |
149 |
--------------------------------------------------------------------------------
/03-move-semantics/move_semantics.pdf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/coders-school/modern-cpp/3b4d7191ebf2b2048f2d399a369790d6d8757601/03-move-semantics/move_semantics.pdf
--------------------------------------------------------------------------------
/03-move-semantics/rule0.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #include
4 |
5 | template
6 | T take(T&& a) {
7 | return a;
8 | }
9 |
10 | // int take(const int & a) {
11 | // return a;
12 | // }
13 |
14 | int main() {
15 | take(5);
16 | const int i = 10;
17 | const int & ref = i;
18 | take(std::move(ref));
19 | take(i);
20 | // take(ref);
21 | return 0;
22 | }
--------------------------------------------------------------------------------
/03-move-semantics/rules.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 |
4 | template
5 | class X {
6 | T* ptr {};
7 | int a = 4;
8 | int b = 10;
9 | public:
10 | X(T* p) : ptr(p) {}
11 | ~X() {
12 | delete ptr;
13 | }
14 | X(const X & other) : ptr(new T{*other.ptr}) {}
15 | X& operator=(const X & other) {
16 | if (&other != this) {
17 | delete ptr;
18 | ptr = new T{*other.ptr};
19 | }
20 | return *this;
21 | }
22 | X(X && other) : ptr(other.ptr) {
23 | other.ptr = nullptr;
24 | }
25 | X& operator=(X && other) {
26 | if (&other != this) {
27 | delete ptr;
28 | ptr = other.ptr;
29 | other.ptr = nullptr;
30 | }
31 | return *this;
32 | }
33 | T& get() {
34 | return *ptr;
35 | }
36 | };
37 |
38 | int main() {
39 | X x{new int{42}};
40 | x = x;
41 | X x2{new int{42}};
42 | X x3 = x; // copy constructor
43 | x2 = x; // copy assignment
44 | X x4{std::move(x2)};
45 | x3 = std::move(x);
46 | std::cout << x4.get();
47 | return 0;
48 | }
--------------------------------------------------------------------------------
/03-move-semantics/unique.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 |
4 | template
5 | class uniquePtr{
6 | public:
7 |
8 |
9 | uniquePtr(T *t) {
10 | myPtr = t;
11 | }
12 | uniquePtr(const T* src) {
13 | myPtr = src;
14 | }
15 | ~uniquePtr() {
16 | delete myPtr;
17 | }
18 | uniquePtr(uniquePtr&& src) {
19 | myPtr = src.myPtr;
20 | src.myPtr = nullptr;
21 | }
22 | uniquePtr(const uniquePtr& src) = delete;
23 |
24 |
25 |
26 |
27 | T* get() const noexcept {
28 | return myPtr;
29 | }
30 | void reset(T *ptr = nullptr) noexcept {
31 | delete myPtr;
32 | myPtr = ptr;
33 | }
34 | T& operator*() const {
35 | return *myPtr;
36 | }
37 | T* operator->() const noexcept {
38 | return myPtr;
39 | }
40 |
41 | uniquePtr& operator=(uniquePtr&& ptr) {
42 | reset(ptr.myPtr);
43 | ptr.myPtr = nullptr;
44 | return *this;
45 | }
46 | uniquePtr& operator=(const uniquePtr& ptr) = delete;
47 |
48 | private:
49 | T* myPtr {};
50 | };
51 |
52 |
53 | int main()
54 | {
55 | int a = 5;
56 | uniquePtr a_ptr (new int (5));
57 | printf("ptr-value=%d\n", *a_ptr.get());
58 | a_ptr.reset(new int (10));
59 | printf("ptr-value=%d\n", *a_ptr.get());
60 | printf("ptr-value=%d\n", *a_ptr);
61 | // uniquePtr b_ptr = a_ptr;
62 | //uniquePtr b_ptr(a_ptr);
63 | uniquePtr b_ptr(std::move(a_ptr));
64 | a_ptr = std::move(b_ptr);
65 | // b_ptr = a_ptr;
66 | printf("ptr-value=%d\n", *a_ptr.get());
67 |
68 | // printf("ptr-value=%d\n", *a_ptr.get());
69 |
70 | return 0;
71 | }
--------------------------------------------------------------------------------
/LICENSE.md:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 | # Nowoczesny C++
6 |
7 | ## [Moduł 1](module1/)
8 |
9 | ### [Pre-test](module1/01_pretest.pl.md)
10 |
11 | ### [C++ standards](module1/02_standards.pl.md)
12 |
13 | ### [`static_assert`](module1/03_static_assert.pl.md)
14 |
15 | ### [`nullptr`](module1/04_nullptr.pl.md)
16 |
17 | ### [Scoped `enum`](module1/05_scoped_enum.pl.md)
18 |
19 | ### [`auto` keyword](module1/06_auto.pl.md)
20 |
21 | ### [`using` alias](module1/07_using.pl.md)
22 |
23 | ### [Uniform initialization](module1/08_uniform_initialization.pl.md)
24 |
25 | ### [`default`, `delete`, `final`, `override`](module1/09_default_delete_final_override.pl.md)
26 |
27 | ### [Recap](module1/10_recap.pl.md)
28 |
29 | ### [Pre-test answers](module1/11_pretest_answers.pl.md)
30 |
31 | ___
32 |
33 | # Modern C++
34 |
35 | ## [Module 1](module1/index.en.html)
36 |
37 | ### [Pre-test](module1/01_pretest.en.md)
38 |
39 | ### [C++ standards](module1/02_standards.en.md)
40 |
41 | ### [`static_assert`](module1/03_static_assert.en.md)
42 |
43 | ### [`nullptr`](module1/04_nullptr.en.md)
44 |
45 | ### [Scoped `enum`](module1/05_scoped_enum.en.md)
46 |
47 | ### [`auto` keyword](module1/06_auto.en.md)
48 |
49 | ### [`using` alias](module1/07_using.en.md)
50 |
51 | ### [Uniform initialization](module1/08_uniform_initialization.en.md)
52 |
53 | ### [`default`, `delete`, `final`, `override`](module1/09_default_delete_final_override.en.md)
54 |
55 | ### [Recap](module1/10_recap.en.md)
56 |
57 | ### [Pre-test answers](module1/11_pretest_answers.en.md)
58 |
59 | ## [Module 2](module2/index.en.html)
60 |
61 | ### [Pre-test](module2/pretest.en.md)
62 |
63 | ### [Attributes](module2/modern_cpp_attributes.en.md)
64 |
65 | ### [`constexpr`](module2/modern_cpp_constexpr.en.md)
66 |
67 | ### [`noexcept`](module2/modern_cpp_noexcept.en.md)
68 |
69 | ### [Data structure alignment](module2/modern_cpp_dsa.en.md)
70 |
71 | ### [Structured bindings](module2/modern_cpp_structure_bindings.en.md)
72 |
73 | ### [Lambda expressions](module2/modern_cpp_lambda.en.md)
74 |
75 | ### [Other features](module2/modern_cpp_other.en.md)
76 |
77 | ### [Recap](module2/modern_cpp_recap.en.md)
78 |
79 | ### [Pre-test answers](module2/pretest_answers.en.md)
80 |
81 | ## [Module 3](module3/index.en.html)
82 |
83 | ### [Pre-test](module3/move_semantics_pretest.en.md)
84 |
85 | ### [r-value and l-value](module3/move_semantics_rvalues_lvalues.en.md)
86 |
87 | ### [Usage and properties of move semantics](module3/move_semantics_usage.en.md)
88 |
89 | ### [Implementation of move semantic](module3/move_semantics_implementation.en.md)
90 |
91 | ### [Rules of 0, 3, 5](module3/move_semantics_rules.en.md)
92 |
93 | ### [`std::move`](module3/move_semantics_std_move.en.md)
94 |
95 | ### [Reference collapsing](module3/move_semantics_reference_collapsing.en.md)
96 |
97 | ### [`std::forward`](module3/move_semantics_std_forward.en.md)
98 |
99 | ### [Copy elision](module3/move_semantics_copy_elision.en.md)
100 |
101 | ### [Knowledge check](module3/move_semantics_knowledge_check.en.md)
102 |
103 | ### [Recap](module3/move_semantics_recap.en.md)
104 |
--------------------------------------------------------------------------------
/coders_school_logo.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/coders-school/modern-cpp/3b4d7191ebf2b2048f2d399a369790d6d8757601/coders_school_logo.png
--------------------------------------------------------------------------------
/cpp20/coroutines/coro.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #include
4 | #include
5 | #include
6 | #include
7 |
8 | template
9 | struct coroutine_handle;
10 |
11 | template <>
12 | struct coroutine_handle {
13 | constexpr coroutine_handle() noexcept;
14 | constexpr coroutine_handle(nullptr_t) noexcept;
15 | coroutine_handle& operator=(nullptr_t) noexcept;
16 | constexpr void* address() const noexcept;
17 | constexpr static coroutine_handle from_address(void* addr);
18 | constexpr explicit operator bool() const noexcept;
19 | bool done() const;
20 | void operator()();
21 | void resume();
22 | void destroy();
23 |
24 | private:
25 | void* ptr; // exposition only
26 | };
27 |
28 | class resumable {
29 | public:
30 | struct promise_type;
31 | using coro_handle = std::coroutine_handle;
32 |
33 | resumable(coro_handle handle)
34 | : handle_(handle) { assert(handle); }
35 | resumable(resumable&) = delete;
36 | resumable(resumable&&) = delete;
37 |
38 | unsigned long long operator()() {
39 | if (resume()) {
40 | return factorial();
41 | }
42 | return 0ull;
43 | }
44 |
45 | bool resume() {
46 | if (not handle_.done()) {
47 | handle_.resume();
48 | }
49 | return not handle_.done();
50 | }
51 | ~resumable() { handle_.destroy(); }
52 | // const char* recent_val();
53 | unsigned long long factorial();
54 |
55 | private:
56 | coro_handle handle_;
57 | };
58 |
59 | struct resumable::promise_type {
60 | using coro_handle = std::coroutine_handle;
61 | auto get_return_object() {
62 | return coro_handle::from_promise(*this);
63 | }
64 | auto initial_suspend() { return std::suspend_always(); }
65 | auto final_suspend() { return std::suspend_always(); }
66 | void return_void() {}
67 | void unhandled_exception() {
68 | std::terminate();
69 | }
70 |
71 | // const char* string_ = nullptr;
72 | unsigned long long fact_ = 1ull;
73 |
74 | auto yield_value(unsigned long long n) {
75 | fact_ *= n;
76 | return std::suspend_always();
77 | }
78 | };
79 |
80 | // const char* resumable::recent_val() { return handle_.promise().string_; }
81 | unsigned long long resumable::factorial() {
82 | return handle_.promise().fact_;
83 | }
84 |
85 | // resumable foo(){
86 | // while(true){
87 | // co_yield "Hello";
88 | // co_yeild "Coroutine";
89 | // }
90 | // }
91 |
92 | // resumable foo(){
93 | // std::cout << "Hello" << std::endl;
94 | // co_await std::suspend_always();
95 | // std::cout << "Coroutine" << std::endl;
96 | // }
97 |
98 | resumable foo() {
99 | unsigned long long i = 1;
100 | while (true) {
101 | co_yield i++;
102 | }
103 | }
104 |
105 | struct Point2D {
106 | int x = 0;
107 | int y = 0;
108 |
109 | bool operator==(Point2D other);
110 | bool operator!=(Point2D other);
111 | bool operator<(Point2D other);
112 | bool operator>(Point2D other);
113 | bool operator<=(Point2D other);
114 | bool operator>=(Point2D other);
115 |
116 | int operator<=>(const Point2D & other) const = default;
117 | };
118 |
119 | int main() {
120 | resumable res = foo();
121 |
122 | std::vector collection;
123 |
124 | std::generate_n(std::back_inserter(collection), 50, std::ref(res));
125 |
126 | for (auto && el : collection) {
127 | std::cout << el << '\n';
128 | }
129 |
130 | return 0;
131 | }
132 |
--------------------------------------------------------------------------------
/cpp20/modules/CMakeLists.txt:
--------------------------------------------------------------------------------
1 | cmake_minimum_required(VERSION 3.11.0)
2 |
3 | # g++ -std=c++2a Circle.cppm -Wall -Wpedantic -Wextra -fmodules-ts --precompile -o Circle.pcm -fmodule-file=Shape.pcm
4 | # g++ -std=c++2a *.cpp -Wall -Wpedantic -Wextra -fmodules-ts -fmodule-file=Shape.pcm -fmodule-file=Circle.pcm
5 |
6 | set(CMAKE_CXX_STANDARD 20)
7 | set(CMAKE_CXX_STANDARD_REQUIRED ON)
8 | set(CXX_FLAGS -Wall -Wpedantic -Wextra)
9 | set(COMPILER g++)
10 |
11 | include(FetchContent)
12 | FetchContent_Declare(
13 | googletest
14 | GIT_REPOSITORY https://github.com/google/googletest.git
15 | GIT_TAG main # release-1.10.0
16 | )
17 | # For Windows: Prevent overriding the parent project's compiler/linker settings
18 | set(gtest_force_shared_crt ON CACHE BOOL "" FORCE)
19 | FetchContent_MakeAvailable(googletest)
20 |
21 | # Now simply link against gtest or gtest_main as needed. Eg
22 |
23 | project(shapes)
24 |
25 | add_custom_target(Shape.pcm ALL
26 | COMMAND ${COMPILER} -std=c++2a ${CMAKE_CURRENT_SOURCE_DIR}/Shape.cppm ${CXX_FLAGS} -fmodules-ts --precompile -o Shape.pcm
27 | )
28 |
29 | add_custom_target(Circle.pcm ALL
30 | COMMAND ${COMPILER} -std=c++2a ${CMAKE_CURRENT_SOURCE_DIR}/Circle.cppm ${CXX_FLAGS} -fmodules-ts --precompile -o Circle.pcm -fmodule-file=Shape.pcm
31 | DEPENDS Shape.pcm
32 | )
33 |
34 | add_custom_target(Rectangle.pcm ALL
35 | COMMAND ${COMPILER} -std=c++2a ${CMAKE_CURRENT_SOURCE_DIR}/Rectangle.cppm ${CXX_FLAGS} -fmodules-ts --precompile -o Rectangle.pcm -fmodule-file=Shape.pcm
36 | DEPENDS Shape.pcm
37 | )
38 |
39 | add_custom_target(Square.pcm ALL
40 | COMMAND ${COMPILER} -std=c++2a ${CMAKE_CURRENT_SOURCE_DIR}/Square.cppm ${CXX_FLAGS} -fmodules-ts --precompile -o Square.pcm -fmodule-file=Shape.pcm -fmodule-file=Rectangle.pcm
41 | DEPENDS Rectangle.pcm Shape.pcm
42 | )
43 |
44 | add_custom_target(shapes ALL
45 | COMMAND ${COMPILER} -std=c++2a ${CMAKE_CURRENT_SOURCE_DIR}/main.cpp ${CXX_FLAGS} -fmodules-ts -o shapes -fmodule-file=${CMAKE_CURRENT_BINARY_DIR}/Shape.pcm -fmodule-file=${CMAKE_CURRENT_BINARY_DIR}/Circle.pcm -fmodule-file=${CMAKE_CURRENT_BINARY_DIR}/Rectangle.pcm -fmodule-file=${CMAKE_CURRENT_BINARY_DIR}/Square.pcm
46 | DEPENDS Shape.pcm Rectangle.pcm Circle.pcm Square.pcm
47 | )
48 |
49 | include(GoogleTest)
50 | gtest_discover_tests(${PROJECT_NAME}-ut)
51 |
--------------------------------------------------------------------------------
/cpp20/modules/Circle.cppm:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | export module Circle;
4 | import Shape;
5 |
6 | export class Circle final : public Shape {
7 | public:
8 | using Shape::Shape;
9 | Circle(double r)
10 | : r_(r) {}
11 |
12 | Circle(const Circle& other) = default;
13 |
14 | [[deprecated("Please use M_PI instead.")]] double getPi() const {
15 | return 5.0;
16 | }
17 | double getArea() const override {
18 | return M_PI * r_ * r_;
19 | }
20 | double getPerimeter() const override {
21 | return 2 * M_PI * r_;
22 | }
23 | auto getRadius() const {
24 | return r_;
25 | }
26 | void print() const override {
27 | std::cout << "Circle: radius: " << getRadius() << std::endl
28 | << " area: " << getArea() << std::endl
29 | << " perimeter: " << getPerimeter() << std::endl;
30 | }
31 |
32 | private:
33 | Circle() = delete; // doesn't allow to call default constructor
34 |
35 | double r_{};
36 | };
37 |
38 | static_assert(M_PI != 3.14, "M_PI is only an estimated value");
39 |
--------------------------------------------------------------------------------
/cpp20/modules/README.md:
--------------------------------------------------------------------------------
1 | # Modern C++ exercises
2 |
3 | ## Compilation and running the project
4 |
5 | Check your g++ version by typing:
6 | `> g++ --version`
7 | It should be >= 7.0
8 |
9 | ```bash
10 | > mkdir build
11 | > cd build
12 | > cmake ..
13 | > make
14 | > ./modern_cpp
15 | ```
16 |
17 | ## Tasks
18 |
19 | 1. `static_assert`:
20 | Assert that `M_PI` used in `Circle.cpp` file is not equal to `3.14`
21 | 2. `using` alias:
22 | Change `typedef` to `using` alias
23 | 3. scoped `enum`:
24 | Write a new scoped enum named Color and define in it 3 colors of your choice. Inherit from unsigned char.
25 | Add a new field: `Color color` in the `Shape` class, so that every shape has it's own defined color.
26 | 4. `auto`:
27 | Use `auto`, wherever you should.
28 | 5. range-based for loop:
29 | Use range-based for loops, wherever possible.
30 | 6. move semantics:
31 | Group task:
32 | Implement your own unique_ptr. Requirements:
33 | - Template class
34 | - RAII
35 | - Copy operations not allowed
36 | - Move operations allowed
37 | - Interface functions - at least:
38 | - T* get()
39 | - T& operator*()
40 | - T* operator->()
41 |
42 | Add move constructors and move assignment operators to all shapes.
43 | Mark them as `noexcept`.
44 | What about Rule of 5?
45 | Move some shapes into the collection.
46 | 7. `default`, `delete`:
47 | Mark copy constructors as `default`.
48 | Delete `getY()` method in `Square` and all default constructors of shapes
49 | 8. `final`, `override`:
50 | Mark `Circle` class as `final`
51 | Mark `getX()` in `Rectangle` as `final`. What is the problem?
52 | Mark all overridden virtual methods. Can you spot the problem?
53 | 9. `constexpr`:
54 | Write a function that calculates n-th Fibonacci's number. Do not mark it `constexpr`.
55 | In the first line of `main()` add computing 45-th Fibonacci's number. Measure the time of program execution (time ./modern_cpp)
56 | Mark fibonacci function as `constexpr`, compile the program and measure the time of execution once again.
57 | If you can't see a big difference assign the result to the constexpr variable.
58 | 10. uniform initialization:
59 | Use `initializer_list` to initialize the collection.
60 | Add a new constructor to Shape - `Shape(Color c)`. What happens?
61 | Use constructor inheritance to allow initialization of all shapes providing only a `Color` as a parameter. Create some shapes providing `Color` only param.
62 | Add in-class field initialization for all shapes to safely use inherited constructor.
63 | 11. SFINAE ✅ (15 XP)
64 | Write a function that allows inserting only subclasses of Shape to the collection. Other parameter types should not compile. Use SFINAE. Find proper type_traits.
65 | 12. attributes:
66 | Add a new method `double getPi()` in `Circle` class, which returns a PI number. Mark it as deprecated.
67 | 13. `noexcept`:
68 | Mark some `getArea()` and `getPerimeter()` methods as `noexcept`
69 | 14. `alignas`, `alignof` ✅ (5 XP)
70 | Change the alignment of the `Circle` class to 128.
71 | Print the alignment in `main()` function.
72 | Change the alignment to 2.
73 | Print the alignment.
74 | 15. delegating constructors: ✅ (5 XP)
75 | Add a new constructor, which takes also the previously defined Color of a shape. You can use a default parameter for Color.
76 | Delegate a call in the old constructor to the new one.
77 | 16. lambda functions: ✅ (5 XP)
78 | Change functions from `main.cpp` into lambdas (`sortByArea`, `perimeterBiggerThan20`, `areaLessThan10`)
79 | Change lambda `areaLessThan10` into lambda `areaLessThanX`, which takes `x = 10` on a capture list. What is the problem?
80 | Use `std::function` to solve the problem.
81 | 17. structured bindings: ✅ (5 XP)
82 | Create an `std::map, double>` that will hold a shape and it's perimeter.
83 | Use structured bindings to iterate over this collection and display shape info (call `print()` member function) and a perimeter.
84 | 18. variadic templates: ✅ (15 XP)
85 | Write a factory method which should work like `std::make_shared`.
86 | It should have below signature:
87 |
88 | ```cpp
89 | template
90 | std::shared_ptr make_shape(Arguments&&... args);
91 | ```
92 |
93 | Inside, it should create a `shared_ptr` to DerivedType and pass all arguments into constructor of DerivedType via perfect forwarding.
94 |
--------------------------------------------------------------------------------
/cpp20/modules/Rectangle.cppm:
--------------------------------------------------------------------------------
1 | #include
2 | import Shape;
3 | export module Rectangle;
4 |
5 | export class Rectangle : public Shape
6 | {
7 | public:
8 | using Shape::Shape;
9 | Rectangle(double x, double y) : x_(x),
10 | y_(y)
11 | {}
12 | Rectangle(const Rectangle & other) = default;
13 |
14 | double getArea() const noexcept override
15 | {
16 | return x_ * y_;
17 | }
18 | double getPerimeter() const noexcept override{
19 | return 2 * (x_ + y_);
20 | }
21 | virtual double getX() const final{
22 | return x_;
23 | }
24 | double getY() const{
25 | return y_;
26 | }
27 | void print() const override{
28 | std::cout << "Rectangle: x: " << getX() << std::endl
29 | << " y: " << getY() << std::endl
30 | << " area: " << getArea() << std::endl
31 | << " perimeter: " << getPerimeter() << std::endl;
32 | }
33 |
34 | private:
35 | Rectangle() = delete;
36 |
37 | double x_{};
38 | double y_{};
39 | };
40 |
--------------------------------------------------------------------------------
/cpp20/modules/Shape.cppm:
--------------------------------------------------------------------------------
1 | #include
2 | export module Shape;
3 |
4 | export enum class Color : unsigned char {
5 | Red,
6 | Green,
7 | Black
8 | };
9 |
10 | export class Shape
11 | {
12 | Color color_ = Color::Red;
13 | public:
14 | explicit Shape(Color c) : color_(c) {}
15 | Shape() = default;
16 | virtual ~Shape() {}
17 |
18 | virtual auto getArea() const -> double = 0;
19 | virtual double getPerimeter() const = 0;
20 | virtual void print() const {
21 | std::cout << "Unknown Shape" << std::endl;
22 | }
23 | };
24 |
--------------------------------------------------------------------------------
/cpp20/modules/Square.cppm:
--------------------------------------------------------------------------------
1 | #include
2 | import Shape; // for Color
3 | import Rectangle;
4 | export module Square;
5 |
6 | export class Square : public Rectangle {
7 | public:
8 | Square(Color c)
9 | : Rectangle(c) {}
10 | Square(double x)
11 | : Rectangle(x, x) {}
12 | Square(const Square& other) = default;
13 |
14 | double getArea() const noexcept override {
15 | return getX() * getX();
16 | }
17 | double getPerimeter() const noexcept override {
18 | return 4 * getX();
19 | }
20 | void print() const override {
21 | std::cout << "Square: x: " << getX() << std::endl
22 | << " area: " << getArea() << std::endl
23 | << " perimeter: " << getPerimeter() << std::endl;
24 | }
25 |
26 | private:
27 | double getY() = delete; // should not have Y dimension
28 | Square() = delete;
29 | };
30 |
--------------------------------------------------------------------------------
/cpp20/modules/main.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #include
4 | #include
5 | #include
6 | import Shape;
7 | import Circle;
8 | import Rectangle;
9 | import Square;
10 |
11 | using namespace std;
12 |
13 | using Collection = vector>;
14 |
15 | bool sortByArea(shared_ptr first, shared_ptr second)
16 | {
17 | if(first == nullptr || second == nullptr)
18 | return false;
19 | return (first->getArea() < second->getArea());
20 | }
21 |
22 | bool perimeterBiggerThan20(shared_ptr s)
23 | {
24 | if(s)
25 | return (s->getPerimeter() > 20);
26 | return false;
27 | }
28 |
29 | bool areaLessThan10(shared_ptr s)
30 | {
31 | if(s)
32 | return (s->getArea() < 10);
33 | return false;
34 | }
35 |
36 | void printCollection(const Collection& collection)
37 | {
38 | for (const auto & it : collection)
39 | if (it)
40 | it->print();
41 | }
42 |
43 | void printAreas(const Collection& collection)
44 | {
45 | for (const auto & it : collection)
46 | if (it)
47 | cout << it->getArea() << std::endl;
48 | }
49 |
50 | void findFirstShapeMatchingPredicate(const Collection& collection,
51 | bool (*predicate)(shared_ptr s),
52 | std::string info)
53 | {
54 | auto iter = std::find_if(collection.begin(), collection.end(), predicate);
55 | if(*iter != nullptr)
56 | {
57 | cout << "First shape matching predicate: " << info << endl;
58 | (*iter)->print();
59 | }
60 | else
61 | {
62 | cout << "There is no shape matching predicate " << info << endl;
63 | }
64 | }
65 |
66 | int fibo(int n) {
67 | if (n<=2) {
68 | return 1;
69 | } else {
70 | return fibo(n - 1) + fibo(n - 2);
71 | }
72 | }
73 |
74 | int main()
75 | {
76 | // [[maybe_unused]] int n = fibo(45);
77 | Collection shapes {
78 | make_shared(2.0),
79 | make_shared(3.0),
80 | nullptr,
81 | make_shared(4.0),
82 | make_shared(10.0, 5.0),
83 | make_shared(3.0),
84 | make_shared(4.0),
85 | };
86 | printCollection(shapes);
87 |
88 | Circle c1{Color::Green};
89 | // auto pi = c1.getPi();
90 | Rectangle r1{Color::Black};
91 | // Square s1{};
92 | [[maybe_unused]] auto values = {1, 2, 3, 4, 5};
93 | // std::cout << values[2];
94 |
95 | cout << "Areas before sort: " << std::endl;
96 | printAreas(shapes);
97 |
98 | std::sort(shapes.begin(), shapes.end(), sortByArea);
99 |
100 | cout << "Areas after sort: " << std::endl;
101 | printAreas(shapes);
102 |
103 | auto square = make_shared(4.0);
104 | shapes.push_back(square);
105 |
106 | findFirstShapeMatchingPredicate(shapes, perimeterBiggerThan20, "perimeter bigger than 20");
107 | findFirstShapeMatchingPredicate(shapes, areaLessThan10, "area less than 10");
108 |
109 | return 0;
110 | }
111 |
--------------------------------------------------------------------------------
/cpp20/ranges/ranges.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #include
4 | #include
5 |
6 |
7 | int main() {
8 | std::vector ints{1, 23, 54, 35, 43, 2, 342, 4, 44};
9 | std::vector other{0, 23, 44, 666, 22222};
10 | auto even = [](int i){ return 0 == i % 2; };
11 | auto square = [](int i) { return i * i; };
12 |
13 | for (int i : ints | std::views::take(4) | std::views::transform(square)) {
14 | std::cout << i << ' ';
15 | }
16 |
17 | std::cout << '\n';
18 |
19 | using namespace std::ranges;
20 |
21 | sort(ints);
22 | for (int i : ints | std::views::common) {
23 | std::cout << i << ' ';
24 | }
25 |
26 | std::cout << '\n';
27 |
28 | return 0;
29 | }
30 |
--------------------------------------------------------------------------------
/img/lukasz.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/coders-school/modern-cpp/3b4d7191ebf2b2048f2d399a369790d6d8757601/img/lukasz.jpg
--------------------------------------------------------------------------------
/img/lukin.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/coders-school/modern-cpp/3b4d7191ebf2b2048f2d399a369790d6d8757601/img/lukin.jpg
--------------------------------------------------------------------------------
/logo.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/coders-school/modern-cpp/3b4d7191ebf2b2048f2d399a369790d6d8757601/logo.png
--------------------------------------------------------------------------------
/shapes/CMakeLists.txt:
--------------------------------------------------------------------------------
1 | cmake_minimum_required(VERSION 3.11.0)
2 |
3 | set(CMAKE_CXX_STANDARD 17)
4 | set(CMAKE_CXX_STANDARD_REQUIRED ON)
5 |
6 | project(shapes)
7 |
8 | set(SRC_LIST
9 | Circle.cpp
10 | Rectangle.cpp
11 | Square.cpp
12 | Shape.cpp
13 | main.cpp
14 | )
15 |
16 | add_executable(${PROJECT_NAME} ${SRC_LIST})
17 | target_compile_options(${PROJECT_NAME} PUBLIC -Wall -Wpedantic -Wextra)
18 | # TODO: Add -Werror flag above:)
19 |
--------------------------------------------------------------------------------
/shapes/Circle.cpp:
--------------------------------------------------------------------------------
1 | #include "Circle.hpp"
2 | #include
3 | #include
4 |
5 | Circle::Circle(double r)
6 | : r_(r)
7 | {}
8 |
9 | Circle::Circle(const Circle & other)
10 | {
11 | r_ = other.getRadius();
12 | }
13 |
14 | double Circle::getArea() const
15 | {
16 | return M_PI * r_ * r_;
17 | }
18 |
19 | double Circle::getPerimeter() const
20 | {
21 | return 2 * M_PI * r_;
22 | }
23 |
24 | double Circle::getRadius() const
25 | {
26 | return r_;
27 | }
28 |
29 | void Circle::print() const
30 | {
31 | std::cout << "Circle: radius: " << getRadius() << std::endl
32 | << " area: " << getArea() << std::endl
33 | << " perimeter: " << getPerimeter() << std::endl;
34 | }
35 |
--------------------------------------------------------------------------------
/shapes/Circle.hpp:
--------------------------------------------------------------------------------
1 | #pragma once
2 |
3 | #include "Shape.hpp"
4 |
5 | class Circle : public Shape
6 | {
7 | public:
8 | Circle(double r);
9 | Circle(const Circle & other);
10 |
11 | double getArea() const;
12 | double getPerimeter() const;
13 | double getRadius() const;
14 | void print() const;
15 |
16 | private:
17 | Circle(); // doesn't allow to call default constructor
18 |
19 | double r_;
20 | };
21 |
--------------------------------------------------------------------------------
/shapes/README.md:
--------------------------------------------------------------------------------
1 | # Modern C++ exercises
2 |
3 | ## Compilation and running the project
4 |
5 | Check your g++ version by typing:
6 | `> g++ --version`
7 | It should be >= 7.0
8 |
9 | ```bash
10 | > mkdir build
11 | > cd build
12 | > cmake ..
13 | > make
14 | > ./shapes
15 | ```
16 |
17 | ## Tasks
18 |
19 | 1. `static_assert`:
20 | Assert that `M_PI` used in `Circle.cpp` file is not equal to `3.14`
21 | 2. `using` alias:
22 | Change `typedef` to `using` alias
23 | 3. scoped `enum`:
24 | Write a new scoped enum named Color and define in it 3 colors of your choice. Inherit from unsigned char.
25 | Add a new field: `Color color` in the `Shape` class, so that every shape has it's own defined color.
26 | 4. `auto`:
27 | Use `auto`, wherever you should.
28 | 5. range-based for loop:
29 | Use range-based for loops, wherever possible.
30 | 6. move semantics:
31 | Group task:
32 | Implement your own unique_ptr. Requirements:
33 | - Template class
34 | - RAII
35 | - Copy operations not allowed
36 | - Move operations allowed
37 | - Interface functions - at least:
38 | - T* get()
39 | - T& operator*()
40 | - T* operator->()
41 |
42 | Add move constructors and move assignment operators to all shapes.
43 | Mark them as `noexcept`.
44 | What about Rule of 5?
45 | Move some shapes into the collection.
46 | 7. `default`, `delete`:
47 | Mark copy constructors as `default`.
48 | Delete `getY()` method in `Square` and all default constructors of shapes
49 | 8. `final`, `override`:
50 | Mark `Circle` class as `final`
51 | Mark `getX()` in `Rectangle` as `final`. What is the problem?
52 | Mark all overridden virtual methods. Can you spot the problem?
53 | 9. `constexpr`:
54 | Write a function that calculates n-th Fibonacci's number. Do not mark it `constexpr`.
55 | In the first line of `main()` add computing 45-th Fibonacci's number. Measure the time of program execution (time ./shapes)
56 | Mark fibonacci function as `constexpr`, compile the program and measure the time of execution once again.
57 | If you can't see a big difference assign the result to the constexpr variable.
58 | 10. uniform initialization:
59 | Use `initializer_list` to initialize the collection.
60 | Add a new constructor to Shape - `Shape(Color c)`. What happens?
61 | Use constructor inheritance to allow initialization of all shapes providing only a `Color` as a parameter. Create some shapes providing `Color` only param.
62 | Add in-class field initialization for all shapes to safely use inherited constructor.
63 | 11. SFINAE
64 | Write a function that allows inserting only subclasses of Shape to the collection. Other parameter types should not compile. Use SFINAE. Find proper type_traits.
65 | 12. attributes:
66 | Add a new method `double getPi()` in `Circle` class, which returns a PI number. Mark it as deprecated.
67 | 13. `noexcept`:
68 | Mark some `getArea()` and `getPerimeter()` methods as `noexcept`
69 | 14. `alignas`, `alignof`
70 | Change the alignment of the `Circle` class to 128.
71 | Print the alignment in `main()` function.
72 | Change the alignment to 2.
73 | Print the alignment.
74 | 15. delegating constructors:
75 | Add a new constructor, which takes also the previously defined Color of a shape. You can use a default parameter for Color.
76 | Delegate a call in the old constructor to the new one.
77 | 16. lambda functions:
78 | Change functions from `main.cpp` into lambdas (`sortByArea`, `perimeterBiggerThan20`, `areaLessThan10`)
79 | Change lambda `areaLessThan10` into lambda `areaLessThanX`, which takes `x = 10` on a capture list. What is the problem?
80 | Use `std::function` to solve the problem.
81 | 17. structured bindings:
82 | Create an `std::map, double>` that will hold a shape and it's perimeter.
83 | Use structured bindings to iterate over this collection and display shape info (call `print()` member function) and a perimeter.
84 | 18. variadic templates:
85 | Write a factory method which should work like `std::make_shared`.
86 | It should have below signature:
87 |
88 | ```cpp
89 | template
90 | std::shared_ptr make_shape(Arguments&&... args);
91 | ```
92 |
93 | Inside, it should create a `shared_ptr` to DerivedType and pass all arguments into constructor of DerivedType via perfect forwarding.
94 |
--------------------------------------------------------------------------------
/shapes/Rectangle.cpp:
--------------------------------------------------------------------------------
1 | #include "Rectangle.hpp"
2 | #include
3 |
4 | Rectangle::Rectangle(double x, double y)
5 | : x_(x),
6 | y_(y)
7 | {}
8 |
9 | Rectangle::Rectangle(const Rectangle &other)
10 | {
11 | x_ = other.getX();
12 | y_ = other.getY();
13 | }
14 |
15 | double Rectangle::getArea() const
16 | {
17 | return x_ * y_;
18 | }
19 |
20 | double Rectangle::getPerimeter() const
21 | {
22 | return 2 * (x_ + y_);
23 | }
24 |
25 | double Rectangle::getX() const
26 | {
27 | return x_;
28 | }
29 |
30 | double Rectangle::getY() const
31 | {
32 | return y_;
33 | }
34 |
35 | void Rectangle::print() const
36 | {
37 | std::cout << "Rectangle: x: " << getX() << std::endl
38 | << " y: " << getY() << std::endl
39 | << " area: " << getArea() << std::endl
40 | << " perimeter: " << getPerimeter() << std::endl;
41 | }
42 |
--------------------------------------------------------------------------------
/shapes/Rectangle.hpp:
--------------------------------------------------------------------------------
1 | #pragma once
2 |
3 | #include "Shape.hpp"
4 |
5 | class Rectangle : public Shape
6 | {
7 | public:
8 | Rectangle(double x, double y);
9 | Rectangle(const Rectangle & other);
10 |
11 | double getArea() const;
12 | double getPerimeter() const;
13 | double getX() const;
14 | double getY() const;
15 | void print() const;
16 |
17 | private:
18 | Rectangle();
19 |
20 | double x_;
21 | double y_;
22 | };
23 |
--------------------------------------------------------------------------------
/shapes/Shape.cpp:
--------------------------------------------------------------------------------
1 | #include "Shape.hpp"
2 | #include
3 |
4 | void Shape::print() const
5 | {
6 | std::cout << "Unknown Shape" << std::endl;
7 | }
8 |
--------------------------------------------------------------------------------
/shapes/Shape.hpp:
--------------------------------------------------------------------------------
1 | #pragma once
2 |
3 | class Shape
4 | {
5 | public:
6 | virtual ~Shape() {}
7 |
8 | virtual double getArea() const = 0;
9 | virtual double getPerimeter() const = 0;
10 | virtual void print() const;
11 | };
12 |
--------------------------------------------------------------------------------
/shapes/Square.cpp:
--------------------------------------------------------------------------------
1 | #include "Square.hpp"
2 | #include
3 |
4 | Square::Square(double x)
5 | : Rectangle(x, x)
6 | {}
7 |
8 | Square::Square(const Square &other)
9 | : Rectangle(other.getX(), other.getX())
10 | {}
11 |
12 | double Square::getArea()
13 | {
14 | return getX() * getX();
15 | }
16 |
17 | double Square::getPerimeter()
18 | {
19 | return 4 * getX();
20 | }
21 |
22 | void Square::print()
23 | {
24 | std::cout << "Square: x: " << getX() << std::endl
25 | << " area: " << getArea() << std::endl
26 | << " perimeter: " << getPerimeter() << std::endl;
27 | }
28 |
--------------------------------------------------------------------------------
/shapes/Square.hpp:
--------------------------------------------------------------------------------
1 | #pragma once
2 |
3 | #include "Rectangle.hpp"
4 |
5 | class Square : public Rectangle
6 | {
7 | public:
8 | Square(double x);
9 | Square(const Square & other);
10 |
11 | double getArea();
12 | double getPerimeter();
13 | void print();
14 |
15 | private:
16 | double getY(); // should not have Y dimension
17 | Square();
18 | };
19 |
--------------------------------------------------------------------------------
/shapes/main.cpp:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #include
4 | #include
5 | #include
6 | #include "Shape.hpp"
7 | #include "Rectangle.hpp"
8 | #include "Square.hpp"
9 | #include "Circle.hpp"
10 |
11 | using namespace std;
12 |
13 | typedef vector> Collection;
14 |
15 | bool sortByArea(shared_ptr first, shared_ptr second)
16 | {
17 | if(first == NULL || second == NULL)
18 | return false;
19 | return (first->getArea() < second->getArea());
20 | }
21 |
22 | bool perimeterBiggerThan20(shared_ptr s)
23 | {
24 | if(s)
25 | return (s->getPerimeter() > 20);
26 | return false;
27 | }
28 |
29 | bool areaLessThan10(shared_ptr s)
30 | {
31 | if(s)
32 | return (s->getArea() < 10);
33 | return false;
34 | }
35 |
36 | void printCollectionElements(const Collection& collection)
37 | {
38 | for(Collection::const_iterator it = collection.begin(); it != collection.end(); ++it)
39 | if(*it)
40 | (*it)->print();
41 | }
42 |
43 | void printAreas(const Collection& collection)
44 | {
45 | for(vector>::const_iterator it = collection.begin(); it != collection.end(); ++it)
46 | if(*it)
47 | cout << (*it)->getArea() << std::endl;
48 | }
49 |
50 | void findFirstShapeMatchingPredicate(const Collection& collection,
51 | bool (*predicate)(shared_ptr s),
52 | std::string info)
53 | {
54 | Collection::const_iterator iter = std::find_if(collection.begin(), collection.end(), predicate);
55 | if(*iter != 0)
56 | {
57 | cout << "First shape matching predicate: " << info << endl;
58 | (*iter)->print();
59 | }
60 | else
61 | {
62 | cout << "There is no shape matching predicate " << info << endl;
63 | }
64 | }
65 |
66 | int main()
67 | {
68 | Collection shapes;
69 | shapes.push_back(make_shared(2.0));
70 | shapes.push_back(make_shared(3.0));
71 | shapes.push_back(nullptr);
72 | shapes.push_back(make_shared(4.0));
73 | shapes.push_back(make_shared(10.0, 5.0));
74 | shapes.push_back(make_shared(3.0));
75 | shapes.push_back(make_shared(4.0));
76 | printCollectionElements(shapes);
77 |
78 | cout << "Areas before sort: " << std::endl;
79 | printAreas(shapes);
80 |
81 | std::sort(shapes.begin(), shapes.end(), sortByArea);
82 |
83 | cout << "Areas after sort: " << std::endl;
84 | printAreas(shapes);
85 |
86 | auto square = make_shared(4.0);
87 | shapes.push_back(square);
88 |
89 | findFirstShapeMatchingPredicate(shapes, perimeterBiggerThan20, "perimeter bigger than 20");
90 | findFirstShapeMatchingPredicate(shapes, areaLessThan10, "area less than 10");
91 |
92 | return 0;
93 | }
94 |
95 |
--------------------------------------------------------------------------------
30 |
31 | 
44 |
45 | 
127 |
128 | 
3 |
4 |
5 | # Nowoczesny C++
6 |
7 | ## [Moduł 1](module1/)
8 |
9 | ### [Pre-test](module1/01_pretest.pl.md)
10 |
11 | ### [C++ standards](module1/02_standards.pl.md)
12 |
13 | ### [`static_assert`](module1/03_static_assert.pl.md)
14 |
15 | ### [`nullptr`](module1/04_nullptr.pl.md)
16 |
17 | ### [Scoped `enum`](module1/05_scoped_enum.pl.md)
18 |
19 | ### [`auto` keyword](module1/06_auto.pl.md)
20 |
21 | ### [`using` alias](module1/07_using.pl.md)
22 |
23 | ### [Uniform initialization](module1/08_uniform_initialization.pl.md)
24 |
25 | ### [`default`, `delete`, `final`, `override`](module1/09_default_delete_final_override.pl.md)
26 |
27 | ### [Recap](module1/10_recap.pl.md)
28 |
29 | ### [Pre-test answers](module1/11_pretest_answers.pl.md)
30 |
31 | ___
32 |
33 | # Modern C++
34 |
35 | ## [Module 1](module1/index.en.html)
36 |
37 | ### [Pre-test](module1/01_pretest.en.md)
38 |
39 | ### [C++ standards](module1/02_standards.en.md)
40 |
41 | ### [`static_assert`](module1/03_static_assert.en.md)
42 |
43 | ### [`nullptr`](module1/04_nullptr.en.md)
44 |
45 | ### [Scoped `enum`](module1/05_scoped_enum.en.md)
46 |
47 | ### [`auto` keyword](module1/06_auto.en.md)
48 |
49 | ### [`using` alias](module1/07_using.en.md)
50 |
51 | ### [Uniform initialization](module1/08_uniform_initialization.en.md)
52 |
53 | ### [`default`, `delete`, `final`, `override`](module1/09_default_delete_final_override.en.md)
54 |
55 | ### [Recap](module1/10_recap.en.md)
56 |
57 | ### [Pre-test answers](module1/11_pretest_answers.en.md)
58 |
59 | ## [Module 2](module2/index.en.html)
60 |
61 | ### [Pre-test](module2/pretest.en.md)
62 |
63 | ### [Attributes](module2/modern_cpp_attributes.en.md)
64 |
65 | ### [`constexpr`](module2/modern_cpp_constexpr.en.md)
66 |
67 | ### [`noexcept`](module2/modern_cpp_noexcept.en.md)
68 |
69 | ### [Data structure alignment](module2/modern_cpp_dsa.en.md)
70 |
71 | ### [Structured bindings](module2/modern_cpp_structure_bindings.en.md)
72 |
73 | ### [Lambda expressions](module2/modern_cpp_lambda.en.md)
74 |
75 | ### [Other features](module2/modern_cpp_other.en.md)
76 |
77 | ### [Recap](module2/modern_cpp_recap.en.md)
78 |
79 | ### [Pre-test answers](module2/pretest_answers.en.md)
80 |
81 | ## [Module 3](module3/index.en.html)
82 |
83 | ### [Pre-test](module3/move_semantics_pretest.en.md)
84 |
85 | ### [r-value and l-value](module3/move_semantics_rvalues_lvalues.en.md)
86 |
87 | ### [Usage and properties of move semantics](module3/move_semantics_usage.en.md)
88 |
89 | ### [Implementation of move semantic](module3/move_semantics_implementation.en.md)
90 |
91 | ### [Rules of 0, 3, 5](module3/move_semantics_rules.en.md)
92 |
93 | ### [`std::move`](module3/move_semantics_std_move.en.md)
94 |
95 | ### [Reference collapsing](module3/move_semantics_reference_collapsing.en.md)
96 |
97 | ### [`std::forward`](module3/move_semantics_std_forward.en.md)
98 |
99 | ### [Copy elision](module3/move_semantics_copy_elision.en.md)
100 |
101 | ### [Knowledge check](module3/move_semantics_knowledge_check.en.md)
102 |
103 | ### [Recap](module3/move_semantics_recap.en.md)
104 |
--------------------------------------------------------------------------------
/coders_school_logo.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/coders-school/modern-cpp/3b4d7191ebf2b2048f2d399a369790d6d8757601/coders_school_logo.png
--------------------------------------------------------------------------------
/cpp20/coroutines/coro.cpp:
--------------------------------------------------------------------------------
1 | #include