Laboratory work 1. Adding all functions

- Adding a new element to a set
- Creating a set
- Power of the set
- Output of set elements
- Deleting a set (clearing the memory occupied by the list)

Author: Alex-Kud

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

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

laba_1/cmake-build-debug/Testing/Temporary/LastTest.log

@@ -1,4 +1,5 @@
 #include <iostream>
+#include <string>
 using namespace std;
 // Элемент списка
 struct Node {
@@ -14,19 +15,90 @@ Node* creatingAnEmptySet() {
 bool emptySet(Node* first) {
     return first == nullptr;
 }
-// Проверка принадлежности элемента множеству.
+// Проверка принадлежности элемента множеству
 bool checkingOfExistence(Node* first, int checking_value) {
     if (emptySet(first)) return false;
     Node* current = first;
-    while (current && current->value != checking_value)
+    while (current->next && current->value != checking_value)
         current = current->next;
     return current->value == checking_value;
-
 };
-int main() {
-    std::cout << "Hello, World!" << std::endl;
+// Добавление нового элемента в множество в начало списка
+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();
-    cout << set;
-    cout << emptySet(set);
-    return 0;
+    // 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);
+        }
+    }
+    cout << "Creating a set is not possible";
+    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!";
+    while (current) {                   // Удаление элементов, если они есть
+        Node* temp = current;
+        current = current->next;
+        delete temp;
+    }
+    first = nullptr;
+    return first;
 }
+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;
+}