Add Module 3: Object-Oriented Programming and Ownership Semantics (#25)

add module 3: object-oriented programming and ownership semantics (#25)

---------

Signed-off-by: Evgenii Moiseenko <evg.moiseenko94@gmail.com>
Co-authored-by: Dmitrii Kotov <87141565+boruno@users.noreply.github.com>
Co-authored-by: Mikhail Oshukov <Mikhail.Oshukov@jetbrains.com>

Author: 3 people

.gitignore

@@ -9,3 +9,4 @@ sfml/*
 
 Makefile
 CMakeCache.txt
+.DS_Store

MemoryManagement/LinkedList/LinkedList/src/approaching.cpp

@@ -1,4 +1,4 @@
-#include "scene.hpp"
+#include "game.hpp"
 
 void approachingLoop(Circle player, Circle consumable[], bool concerned[], int size) {
     for (int i = 0; i < size; ++i) {

MemoryManagement/LinkedList/LinkedList/src/borders.cpp

@@ -1,4 +1,4 @@
-#include "scene.hpp"
+#include "game.hpp"
 
 Point2D adjustToBorders(Point2D position) {
     Point2D result = position;

MemoryManagement/LinkedList/LinkedList/src/collision.cpp

@@ -1,6 +1,6 @@
 #include <cmath>
 
-#include "scene.hpp"
+#include "game.hpp"
 
 float distance(Point2D a, Point2D b) {
     float dx = a.x - b.x;

MemoryManagement/LinkedList/LinkedList/src/direction.cpp

@@ -1,4 +1,4 @@
-#include "scene.hpp"
+#include "game.hpp"
 
 Point2D getDirection(Direction direction) {
     switch (direction) {

MemoryManagement/LinkedList/LinkedList/src/generate.cpp

@@ -1,4 +1,4 @@
-#include "scene.hpp"
+#include "game.hpp"
 
 #include <cstdlib>
 

MemoryManagement/LinkedList/LinkedList/src/loop.cpp

@@ -1,4 +1,4 @@
-#include "scene.hpp"
+#include "game.hpp"
 
 void collisionLoop(Circle player, Circle consumable[], bool consumed[], int size) {
     for (int i = 0; i < size; ++i) {

MemoryManagement/LinkedList/LinkedList/src/main.cpp

@@ -1,6 +1,6 @@
 #include <SFML/Graphics.hpp>
 
-#include "scene.hpp"
+#include "game.hpp"
 #include "dllist.hpp"
 
 const int MAX_CONSUMABLES_COUNT = 8;

MemoryManagement/LinkedList/LinkedList/src/point.cpp

@@ -1,4 +1,4 @@
-#include "scene.hpp"
+#include "game.hpp"
 
 Point2D add(Point2D a, Point2D b) {
     Point2D c = { 0, 0 };

MemoryManagement/LinkedList/LinkedList/task.md

@@ -55,7 +55,7 @@ void link(Node* cursor, Node* node);
 It should link together the `cursor` and `node` nodes, putting `node` right after `cursor`.
 Make sure to properly update the `next` and `prev` fields of all relevant nodes, 
 that is, the nodes pointed by the `cursor`, `cursor->next`, and `node` pointers. 
-You might assume that all nodes reachable from `cursor` through `next` and `prev`
+You might assume that all nodes which are reachable from `cursor` through `next` and `prev`
 are valid nodes and none of their `next` or `prev` pointers are null
 (we will see why this is true for our intended list implementation later).
 
@@ -91,7 +91,7 @@ struct List {
 For this scheme to work properly, we also have to initialize the 
 `next` and `prev` fields of the `sentry` node.
 We can make them both point to the `sentry` node. 
-Therefore, in our encoding, an empty list is modelled as 
+Therefore, in our encoding, an empty list is modeled as 
 a list consisting of a single sentinel node whose `next` and `prev` pointers form a cycle.
 Write code for the function `initList` implementing this idea
 (set the `data` field of the `sentry` node to `nullptr`):