Laboratory work 1. The structure has been changed

The file structure of the project has been changed:
- The implementation of the functions is placed in a separate file SetLab1_12_Kudashov.cpp
- The main program file has been renamed to Lab1_12_Kudashov.cpp

Author: Alex-Kud

laba_1/CMakeLists.txt

@@ -3,4 +3,4 @@ project(laba_1)
 
 set(CMAKE_CXX_STANDARD 14)
 
-add_executable(laba_1 main.cpp)
+add_executable(laba_1 Lab1_12_Kudashov.cpp SetLab1_12_Kudashov.cpp SetLab1_12_Kudashov.h)

laba_1/Lab1_12_Kudashov.cpp

@@ -0,0 +1,19 @@
+#include "SetLab1_12_Kudashov.h"
+
+int main() {
+    srand( time(0) );
+    Node* setA = creatingSet (rand() % 4 + 6, 5, 500, 5);
+    cout << "Print set A: " << printSet(setA, " | ") << endl;
+    cout << "Power set A: " << powerOfTheSet(setA) << endl;
+    Node* setB = creatingSet (rand() % 4 + 6, 5, 500, 10);
+    cout << "Print set B: " << printSet(setB, " | ") << endl;
+    cout << "Power set B: " << powerOfTheSet(setB) << endl;
+    deleteSet(setA);
+    cout << "---------------After cleaning---------------" << endl;
+    cout << "Print set A: " << printSet(setA, " | ") << endl;
+    cout << "Power set A: " << powerOfTheSet(setA) << endl;
+    deleteSet(setB);
+    cout << "Print set B: " << printSet(setB, " | ") << endl;
+    cout << "Power set B: " << powerOfTheSet(setB) << endl;
+    return 0;
+}

laba_1/SetLab1_12_Kudashov.cpp

@@ -0,0 +1,82 @@
+#include "SetLab1_12_Kudashov.h"
+
+// Создание пустого множества
+Node* creatingAnEmptySet() {
+    Node* first = nullptr;
+    return first;
+}
+// Проверка на пустое множество
+bool emptySet(Node* first) {
+    return first == nullptr;
+}
+// Проверка принадлежности элемента множеству
+bool checkingOfExistence(Node* first, int checking_value) {
+    if (emptySet(first)) return false;
+    Node* current = first;
+    while (current->next && current->value != checking_value)
+        current = current->next;
+    return current->value == checking_value;
+};
+// Добавление нового элемента в множество в начало списка
+Node* add(Node*& first, int adding_value) {
+    if (!checkingOfExistence(first, adding_value)){
+        Node* new_node = new Node;
+        new_node->value = adding_value;
+        new_node->next = emptySet(first) ? nullptr : first;
+        first = new_node;
+    }
+    return first;
+}
+// Мощность множества
+int powerOfTheSet (Node* first) {
+    int power = 0;
+    if (emptySet(first)) return 0;
+    Node* current = first;
+    power++;
+    while (current->next) {
+        current = current->next;
+        power++;
+    }
+    return power;
+}
+// Создание нового множества
+Node* creatingSet(int quantity, int min, int max, int k){
+    Node* set = creatingAnEmptySet();
+    // int k = 5; // коэффициент кратности
+    // Множество А – множество чисел, кратных 5. Множество В – множество чисел, кратных 10.
+    if (k*quantity <= max - min + 1){
+        while (powerOfTheSet(set) < quantity){
+            int temp = rand() % (max-min+1) + min;
+            if (temp % k == 0)
+                add(set, temp);
+        }
+    }
+    else
+        cout << "Creating a set is not possible!" << endl;
+    return set;
+}
+// Вывод элементов множества
+string printSet(Node* first, string separator){
+    if (emptySet(first)) return "Elements not found";
+    Node* current = first;
+    string print;
+    while (current->next) {
+        print += to_string(current->value) + separator;
+        current = current->next;
+    }
+    print += to_string(current->value);
+    return print;
+}
+// Удаление множества
+Node* deleteSet(Node*& first){
+    Node* current = first;
+    if (emptySet(first))                // Если список пуст, сообщить об этом
+        cout << "The list is empty!" << endl;
+    while (current) {                   // Удаление элементов, если они есть
+        Node* temp = current;
+        current = current->next;
+        delete temp;
+    }
+    first = nullptr;
+    return first;
+}

laba_1/SetLab1_12_Kudashov.h

@@ -0,0 +1,28 @@
+#ifndef LABA_1_SETLAB1_12_KUDASHOV_H
+#define LABA_1_SETLAB1_12_KUDASHOV_H
+#pragma once
+#include <iostream>
+#include <string>
+using namespace std;
+// Элемент списка
+struct Node {
+    int value; // Данные - числовое значение
+    Node* next; // Указатель на следующий элемент списка
+};
+// Создание пустого множества
+Node* creatingAnEmptySet();
+// Проверка на пустое множество
+bool emptySet(Node* first);
+// Проверка принадлежности элемента множеству
+bool checkingOfExistence(Node* first, int checking_value);
+// Добавление нового элемента в множество в начало списка
+Node* add(Node*& first, int adding_value);
+// Мощность множества
+int powerOfTheSet (Node* first);
+// Создание нового множества
+Node* creatingSet(int quantity, int min, int max, int k);
+// Вывод элементов множества
+string printSet(Node* first, string separator);
+// Удаление множества
+Node* deleteSet(Node*& first);
+#endif //LABA_1_SETLAB1_12_KUDASHOV_H

laba_1/cmake-build-debug/CMakeFiles/clion-log.txt

@@ -1,16 +1,4 @@
 "C:\Program Files\JetBrains\CLion 2021.3.1\bin\cmake\win\bin\cmake.exe" -DCMAKE_BUILD_TYPE=Debug "-DCMAKE_MAKE_PROGRAM=C:/Program Files/JetBrains/CLion 2021.3.1/bin/ninja/win/ninja.exe" -G Ninja C:\Users\sasha\CLionProjects\laba_1
--- The C compiler identification is GNU 11.2.0
--- The CXX compiler identification is GNU 11.2.0
--- Detecting C compiler ABI info
--- Detecting C compiler ABI info - done
--- Check for working C compiler: C:/Program Files/JetBrains/CLion 2021.3.1/bin/mingw/bin/gcc.exe - skipped
--- Detecting C compile features
--- Detecting C compile features - done
--- Detecting CXX compiler ABI info
--- Detecting CXX compiler ABI info - done
--- Check for working CXX compiler: C:/Program Files/JetBrains/CLion 2021.3.1/bin/mingw/bin/g++.exe - skipped
--- Detecting CXX compile features
--- Detecting CXX compile features - done
 -- Configuring done
 -- Generating done
 -- Build files have been written to: C:/Users/sasha/CLionProjects/laba_1/cmake-build-debug

laba_1/cmake-build-debug/CMakeFiles/laba_1.dir/Lab1_12_Kudashov.cpp.obj

@@ -1,3 +1,3 @@
-Start testing: Dec 26 12:56 RTZ 2 (ceia)
+Start testing: Dec 26 13:46 RTZ 2 (ceia)
 ----------------------------------------------------------
-End testing: Dec 26 12:56 RTZ 2 (ceia)
+End testing: Dec 26 13:46 RTZ 2 (ceia)