updated filestructure and gitignore. uploading exam progress

Exam/IKT203Exam/Portfolio/SharedLib/CMakeLists.txt

@@ -0,0 +1,39 @@
+# --- Step 1: Create the Library ---
+
+# Define a library target named "SharedLib".
+# We use STATIC because we are using cpp and header files.
+add_library(SharedLib STATIC)
+
+# --- Step 2: Add Header Files to the Library ---
+
+# This command explicitly lists the header files that belong to the library.
+# This helps Visual Studio display them nicely in the Solution Explorer.
+target_sources(SharedLib
+    PUBLIC
+    # You can add more functionalty to SharedLib.h just by adding more definitions in SharedLib.h.
+    SharedLib.h
+    TDoublyLinkedList.h
+    TStack.h
+    TQueue.h
+    Utils.h
+    # Or add other shared files here
+    PRIVATE
+    ReadNames.cpp
+    ReadGraph.cpp
+    ReadSongs.cpp
+    FileReaderUtils.cpp
+    TDoublyLinkedList.cpp
+    TStack.cpp
+    TQueue.cpp
+    Utils.cpp
+)
+
+# --- Step 3: Make Headers "Findable" ---
+
+# This is the most important command here.
+# It tells any other project that links to "SharedLib" to add this
+# directory (CMAKE_CURRENT_SOURCE_DIR) to its list of include paths.
+# This is what allows you to write #include "list.hpp" in your main.cpp.
+# Note: CMAKE_CURRENT_SOURCE_DIR is a built-in variable that points to the directory
+target_include_directories(SharedLib PUBLIC ${CMAKE_CURRENT_SOURCE_DIR})
+

Exam/IKT203Exam/Portfolio/SharedLib/FileReaderUtils.cpp

@@ -0,0 +1,32 @@
+#include "FileReaderUtils.h"
+
+#include "FileReaderUtils.h"
+
+int GetRecordCount(const std::string& aHeaderLine)
+{
+	size_t recordPos = aHeaderLine.find("records:=");
+	if (recordPos == std::string::npos)
+	{
+		return 0; // No record count found
+	}
+
+	size_t countStart = recordPos + 9; // Length of "records:="
+
+	// Find the end bracket ']' or a potential semicolon ';'
+	size_t countEnd = aHeaderLine.find_first_of("];", countStart);
+	if (countEnd == std::string::npos)
+	{
+		return 0; // Malformed header
+	}
+
+	std::string countStr = aHeaderLine.substr(countStart, countEnd - countStart);
+	try
+	{
+		// stoi = string to integer
+		return std::stoi(countStr);
+	}
+	catch (const std::exception&)
+	{
+		return 0; // Malformed number
+	}
+}

Exam/IKT203Exam/Portfolio/SharedLib/FileReaderUtils.h

@@ -0,0 +1,13 @@
+// FileReaderUtils.h
+#pragma once
+#if !defined(FILEREADERUTILS_H)
+#define FILEREADERUTILS_H
+#include <string>
+/**
+ * @brief [Internal] Safely parses the "records:=N" part of a header line.
+ * @param aHeaderLine The line, e.g., "[NODES;records:=11]"
+ * @return The number of records, or 0 if not found.
+ */
+int GetRecordCount(const std::string& aHeaderLine);
+
+#endif // FILEREADERUTILS_H

Exam/IKT203Exam/Portfolio/SharedLib/ReadGraph.cpp

@@ -0,0 +1,109 @@
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <string>
+#include "SharedLib.h"
+#include "FileReaderUtils.h"
+
+// --- Enum for the parser's state ---
+enum class EParseState
+{
+	NONE,
+	NODES,
+	EDGES
+};
+
+void readGraphFromFile(const std::string& aFilename, FNodeRead aOnNodeRead, FEdgeRead aOnEdgeRead)
+{
+	if (aFilename.empty()) return;
+
+	std::ifstream file(aFilename);
+	if (!file.is_open())
+	{
+		// Optional: print an error
+		// std::cerr << "Error: Could not open file " << aFilename << std::endl;
+		return;
+	}
+
+	std::string line;
+	EParseState currentState = EParseState::NONE;
+	int totalCount = 0;
+	int currentIndex = 0;
+	bool keepReading = true;
+
+	while (keepReading && std::getline(file, line))
+	{
+		if (line.empty()) continue;
+
+		if (line[0] == '[')
+		{
+			// --- 2. USE THE SHARED FUNCTION ---
+			totalCount = GetRecordCount(line);
+			currentIndex = 0;
+
+			if (line.find("[NODES") != std::string::npos)
+			{
+				currentState = EParseState::NODES;
+				continue;
+			}
+			else if (line.find("[EDGES") != std::string::npos)
+			{
+				currentState = EParseState::EDGES;
+				continue;
+			}
+			// If it's a comment or other header, reset state and count
+			currentState = EParseState::NONE;
+			totalCount = 0;
+			continue;
+		}
+
+		// Process data based on the current state
+		switch (currentState)
+		{
+		case EParseState::NODES:
+			if (aOnNodeRead)
+			{
+				if (!aOnNodeRead(currentIndex, totalCount, line))
+				{
+					keepReading = false;
+				}
+				currentIndex++;
+			}
+			break;
+
+		case EParseState::EDGES:
+		{
+			std::istringstream edgeStream(line);
+			std::string fromNode, toNode, weightStr;
+
+			if (std::getline(edgeStream, fromNode, ';') &&
+				std::getline(edgeStream, toNode, ';') &&
+				std::getline(edgeStream, weightStr))
+			{
+				try
+				{
+					// Use std::stof (string to float) for weight
+					float weight = std::stof(weightStr);
+					if (aOnEdgeRead)
+					{
+						if (!aOnEdgeRead(currentIndex, totalCount, fromNode, toNode, weight))
+						{
+							keepReading = false;
+						}
+						currentIndex++;
+					}
+				}
+				catch (const std::exception&)
+				{
+					// Failed to parse float, skip this line
+				}
+			}
+			break;
+		}
+		case EParseState::NONE:
+		default:
+			break;
+		}
+	}
+	file.close();
+}

Exam/IKT203Exam/Portfolio/SharedLib/ReadNames.cpp

@@ -0,0 +1,55 @@
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <string>
+#include "SharedLib.h"
+#include "FileReaderUtils.h"
+
+void readNamesFromFile(const std::string& aFilename, FNameRead aOnNameRead)
+{
+	if (aFilename.empty()) return;
+
+	std::ifstream file(aFilename);
+	if (!file.is_open())
+	{
+		std::cerr << "Error: Could not open file " << aFilename << std::endl;
+		return;
+	}
+
+	std::string line;
+	int totalCount = 0;
+	int currentIndex = 0;
+	bool keepReading = true;
+
+	// --- 1. Read the header line ---
+	if (std::getline(file, line))
+	{
+		// Use our shared helper to get the count
+		totalCount = GetRecordCount(line);
+	}
+
+	// --- 2. Loop through the rest of the file ---
+	while (keepReading && std::getline(file, line))
+	{
+		if (line.empty()) continue;
+
+		std::istringstream nameStream(line);
+		std::string firstName, lastName;
+
+		// Parse "FirstName LastName"
+		if (nameStream >> firstName >> lastName)
+		{
+			if (aOnNameRead)
+			{
+				// Call the callback with all parameters
+				if (!aOnNameRead(currentIndex, totalCount, firstName, lastName))
+				{
+					keepReading = false;
+				}
+				currentIndex++;
+			}
+		}
+	}
+
+	file.close();
+}

Exam/IKT203Exam/Portfolio/SharedLib/ReadSongs.cpp

@@ -0,0 +1,60 @@
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <string>
+#include "SharedLib.h"
+#include "FileReaderUtils.h" // Include the shared utility
+
+void ReadSongsFromFile(const std::string& aFilename, FSongRead aOnSongRead)
+{
+	if (aFilename.empty()) return;
+
+	std::ifstream file(aFilename);
+	if (!file.is_open())
+	{
+		// std::cerr << "Error: Could not open file " << aFilename << std::endl;
+		return;
+	}
+
+	std::string line;
+	int totalCount = 0;
+	int currentIndex = 0;
+	bool keepReading = true;
+
+	// --- 1. Read the header line ---
+	if (std::getline(file, line))
+	{
+		// Use our shared helper to get the count
+		totalCount = GetRecordCount(line);
+	}
+
+	// --- 2. Loop through the rest of the file (the data lines) ---
+	while (keepReading && std::getline(file, line))
+	{
+		if (line.empty()) continue; // Skip empty lines
+
+		std::istringstream lineStream(line);
+		std::string artist, title, year, genre, source;
+
+		// Parse the five semicolon-separated fields
+		// Artist;Title;Year;Genre;Source
+		if (std::getline(lineStream, artist, ';') &&
+			std::getline(lineStream, title, ';') &&
+			std::getline(lineStream, year, ';') &&
+			std::getline(lineStream, genre, ';') &&
+			std::getline(lineStream, source)) // Last one reads to end of line
+		{
+			if (aOnSongRead)
+			{
+				// Call the callback with all parameters
+				if (!aOnSongRead(currentIndex, totalCount, artist, title, year, genre, source))
+				{
+					keepReading = false;
+				}
+				currentIndex++;
+			}
+		}
+	}
+
+	file.close();
+}

Exam/IKT203Exam/Portfolio/SharedLib/SharedLib.h

@@ -0,0 +1,100 @@
+#pragma once
+#ifndef SHARED_LIB_H
+#define SHARED_LIB_H
+#include <string>
+#include <functional>
+
+/// <summary>
+/// Delegate type for processing a name read from a file.
+/// </summary>
+/// <param name="aIndex">The index of the name (0-based).</param>
+/// <param name="aTotalCount">The total number of names.</param>
+/// <param name="aFirstName">The first name read from the file.</param>
+/// <param name="aLastName">The last name read from the file.</param>
+/// <returns>Returns true to continue reading, false to stop.</returns>
+typedef bool (*FNameRead)(
+	const int aIndex,
+	const int aTotalCount,
+	const std::string& aFirstName,
+	const std::string& aLastName
+	);
+
+/// <summary>
+/// Use this function to read names from a specified file and process them using a callback function.
+/// </summary>
+///	<function>readNamesFromFile</function>
+///	<description>Reads names from a specified file and invokes a callback for each name read.</description>
+/// <param name="aFilename">The path to the file containing names.</param>
+/// <param name="aOnNameRead">A callback function that is called for each name read. It takes two parameters: firstName and lastName. If the callback returns false, the reading process stops.</param>
+/// <param name="firstName">The first name read from the file.</param>
+/// <param name="lastName">The last name read from the file.</param>
+/// <returns>None.</returns>
+void readNamesFromFile(const std::string& aFilename, FNameRead aOnNameRead);
+
+/// <summary>
+/// Delegate type for processing a node read from the file.
+/// </summary>
+/// <description>Function pointer type for a callback that processes nodes read from a file.</description>
+/// <param name="aIndex">The index of the node (0-based).</param>
+/// <param name="aTotalCount">The total number of nodes.</param>
+/// <param name="aNode">The node std::string.</param>
+/// <returns>Returns true to continue reading, false to stop.</returns>
+typedef bool (*FNodeRead)(const int aIndex, const int aTotalCount, const std::string& aNode);
+
+/// <summary>
+/// Delegate type for processing an edge read from the file.
+/// </summary>
+/// <description>Function pointer type for a callback that processes edges read from a file.</description>
+/// <param name="aIndex">The index of the edge (0-based).</param>
+/// <param name="aTotalCount">The total number of edges.</param>
+/// <param name="aFromNode">The from node std::string.</param>
+/// <param name="aToNode">The to node std::string.</param>
+/// <param name="aWeight">The weight of the edge.</param>
+/// <returns>Returns true to continue reading, false to stop.</returns>
+typedef bool (*FEdgeRead)(const int aIndex, const int aTotalCount, const std::string& aFromNode, const std::string& aToNode, float aWeight);
+
+/// </summary>
+/// Use this function to read a graph from a specified file and process its nodes and edges using callback functions.
+/// </summary>
+/// <function>readGraphFromFile</function>
+/// <description>
+/// Reads a graph from a specified file and invokes callbacks for each node and edge read.
+/// All nodes are read first, followed by edges.
+/// </description>
+/// <param name="aFilename">The path to the file containing the graph data.</param>
+/// <param name="aOnNodeRead">A callback function that is called for each node read. It takes one parameter: the node std::string. If the callback returns false, the reading process stops.</param>
+/// <param name="aOnEdgeRead">A callback function that is called for each edge read. It takes three parameters: the fromNode std::string, the toNode std::string, and the weight float. If the callback returns false, the reading process stops.</param>
+void readGraphFromFile(const std::string& aFilename, FNodeRead aOnNodeRead, FEdgeRead aOnEdgeRead);
+
+
+/// <summary>
+/// Delegate type for processing a song read from the file.
+/// </summary>
+/// <param name="aIndex">The index of the song (0-based).</param>
+/// <param name="aTotalCount">The total number of songs.</param>
+/// <param name="aArtist">The artist.</param>
+/// <param name="aTitle">The title.</param>
+/// <param name="aYear">The release year (as a std::string).</param>
+/// <param name="aGenre">The genre.</param>
+/// <param name="aSource">The source.</param>
+/// <returns>Returns true to continue reading, false to stop.</returns>
+typedef bool (*FSongRead)(
+	const int aIndex,
+	const int aTotalCount,
+	const std::string& aArtist,
+	const std::string& aTitle,
+	const std::string& aYear,
+	const std::string& aGenre,
+	const std::string& aSource
+	);
+
+/// <summary>
+/// Reads song data from a file and processes them using a callback.
+/// This function automatically skips the "records:=" header.
+/// </summary>
+/// <param name="aFilename">The path to the file (e.g., "songs.txt").</param>
+/// <param name="aOnSongRead">The callback function called for each song.</param>
+void ReadSongsFromFile(const std::string& aFilename, FSongRead aOnSongRead);
+
+
+#endif // SHARED_LIB_H

Exam/IKT203Exam/Portfolio/SharedLib/TDoublyLinkedList.cpp

@@ -0,0 +1,114 @@
+#include "TDoublyLinkedList.h"
+#include <iostream>
+#include "SharedLib.h"
+
+
+
+void TDoublyLinkedList::Append(const std::string& line)
+{
+    auto* newNode = new Node(line);
+    if (size == 0)
+        head = tail = newNode;
+    else {
+        newNode->SetPrev(tail);
+        tail->SetNext(newNode);
+        tail = newNode;
+    }
+    size++;
+}
+
+void TDoublyLinkedList::Prepend(const std::string& line)
+{
+    auto* newNode = new Node(line);
+    if (size == 0)
+        head = tail = newNode;
+    else {
+        newNode->SetNext(head);
+        head->SetPrev(newNode);
+        head = newNode;
+    }
+    size++;
+}
+
+TDoublyLinkedList::Node* TDoublyLinkedList::NavigateToNode(const int index) const
+{
+    if (index < 0 || index >= size)
+        return nullptr;
+
+    auto* node = head;
+
+    for (int i = 0; i < index; i++)
+        node = node->GetNext();
+
+    return node;
+}
+
+void TDoublyLinkedList::Remove(const int index)
+{
+    auto* node = NavigateToNode(index);
+    if (!node)
+        return;
+
+    if (node->GetPrev())
+        node->GetPrev()->SetNext(node->GetNext());
+    else
+        head = node->GetNext();
+    if (node->GetNext())
+        node->GetNext()->SetPrev(node->GetPrev());
+    else
+        tail = node->GetPrev();
+
+    delete node;
+    size--;
+}
+
+std::string TDoublyLinkedList::GetAtIndex(const int index) const
+{
+    const auto* node = NavigateToNode(index);
+    return node ? node->GetLine() : "Error, line does not exist\n";
+}
+
+void TDoublyLinkedList::InsertAtIndex(const int index, const std::string &line)
+{
+    if (index < 0 || index > size) {
+        std::cout << "========\nIndex doesn't exist\n========\n" << std::endl;
+        return;
+    }
+    if (index == 0)
+    {
+        Prepend(line);
+        return;
+    }
+    if (index == size)
+    {
+        Append(line);
+        return;
+    }
+    Node* cur = head;
+    for (int i = 0; i < index; i++)
+        cur = cur->GetNext();
+    Node* newNode = new Node(line);
+    Node* prev = cur->GetPrev();
+
+    newNode->SetPrev(prev);
+    newNode->SetNext(cur);
+
+    prev->SetNext(newNode);
+    cur->SetPrev(newNode);
+
+    size++;
+}
+
+
+int TDoublyLinkedList::GetSize() const
+{
+    return size;
+}
+
+
+
+
+
+
+
+

Exam/IKT203Exam/Portfolio/SharedLib/TDoublyLinkedList.h

@@ -0,0 +1,60 @@
+#ifndef TDOUBLYLINKEDLIST_H
+#define TDOUBLYLINKEDLIST_H
+#include <string>
+#include <utility>
+#include "SharedLib.h"
+
+
+
+class TDoublyLinkedList {
+
+private:
+    struct Node {
+        std::string line;
+        Node* next;
+        Node* prev;
+        explicit Node(std::string  text) : line(std::move(text)), next(nullptr), prev(nullptr) {}
+
+        void SetNext(Node* node)
+        {
+            this->next = node;
+        }
+        void SetPrev(Node* node)
+        {
+            this->prev = node;
+        }
+        [[nodiscard]] Node* GetPrev() const
+        {
+            return this->prev;
+        }
+        [[nodiscard]] Node* GetNext() const
+        {
+            return this->next;
+        }
+        [[nodiscard]] std::string GetLine() const
+        {
+            return line;
+        }
+
+    };
+
+    Node* head;
+    Node* tail;
+    int size;
+
+
+public:
+    TDoublyLinkedList() : head(nullptr), tail(nullptr), size(0) {}
+    ~TDoublyLinkedList() = default;
+
+    void Append(const std::string &line);
+    void Prepend(const std::string& line);
+    [[nodiscard]] Node* NavigateToNode(int index) const;
+    void Remove(int index);
+    [[nodiscard]] std::string GetAtIndex(int index) const;
+    void InsertAtIndex(int index, const std::string &line);
+    [[nodiscard]] int GetSize() const;
+};
+
+
+#endif //TDOUBLYLINKEDLIST_H

Exam/IKT203Exam/Portfolio/SharedLib/TQueue.cpp

@@ -0,0 +1,47 @@
+#include "TQueue.h"
+
+#include <stdexcept>
+
+
+void TQueue::Enqueue(const std::string& text)
+{
+    if (IsFull())
+        throw std::overflow_error("Queue Overflow");
+    queue[tail] = text;
+    tail = (tail + 1) % MAX_SIZE;
+    count++;
+}
+
+std::string TQueue::Dequeue()
+{
+    if (IsEmpty())
+        throw std::underflow_error("Empty Queue");
+    const std::string item = queue[head];
+    head = (head + 1) % MAX_SIZE;
+    count--;
+    return item;
+}
+
+std::string TQueue::Peek() const
+{
+    if (IsEmpty())
+        throw std::underflow_error("Empty Queue");
+    return queue[head];
+}
+
+bool TQueue::IsEmpty() const
+{
+    return count == 0;
+}
+
+bool TQueue::IsFull() const
+{
+    return count == MAX_SIZE;
+}
+
+int TQueue::GetTail() const
+{
+    if (IsEmpty())
+        throw std::underflow_error("Empty Queue");
+    return tail;
+}

Exam/IKT203Exam/Portfolio/SharedLib/TQueue.h

@@ -0,0 +1,28 @@
+#ifndef TQUEUE_H
+#define TQUEUE_H
+#define MAX_SIZE 100
+
+#include "TDoublyLinkedList.h"
+
+
+class TQueue {
+private:
+    std::string queue[MAX_SIZE];
+    int head = 0;
+    int tail = 0;
+    int count = 0;
+
+public:
+    TQueue() = default;
+    ~TQueue() = default;
+
+    void Enqueue(const std::string& text);
+    std::string Dequeue();
+    [[nodiscard]] int GetTail() const;
+    [[nodiscard]] std::string Peek() const;
+    [[nodiscard]] bool IsEmpty() const;
+    [[nodiscard]] bool IsFull() const;
+};
+
+
+#endif //TQUEUE_H

Exam/IKT203Exam/Portfolio/SharedLib/TStack.cpp

@@ -0,0 +1,36 @@
+#include "TStack.h"
+#include <stdexcept>
+
+void TStack::Push(const TAction& action)
+{
+    if (top >= STACK_MAX_SIZE)
+        throw std::overflow_error("Stack overflow");
+    event[top++] = action;
+}
+
+TStack::TAction TStack::Pop()
+{
+    if (top == 0)
+        throw std::underflow_error("Stack empty");
+    return event[--top];
+}
+
+TStack::TAction TStack::Peek() const
+{
+    if (top == 0)
+        throw std::underflow_error("Stack empty");
+    return event[top - 1];
+}
+
+bool TStack::IsEmpty() const
+{
+    return top == 0;
+}
+
+void TStack::Clear()
+{
+    for (int i = 0; i < top; i++) {
+        this->Pop();
+    }
+}
+

Exam/IKT203Exam/Portfolio/SharedLib/TStack.h

@@ -0,0 +1,37 @@
+#ifndef TSTACK_H
+#define TSTACK_H
+
+#define STACK_MAX_SIZE 100
+#include <string>
+
+
+enum EnumActionType {
+    INSERT,
+    DELETE
+};
+
+class TStack {
+private:
+    struct TAction {
+        EnumActionType action;
+        std::string text;
+        int index;
+    };
+
+    TAction event[STACK_MAX_SIZE]{};
+    int top = 0;
+
+public:
+    TStack() = default;
+    ~TStack() = default;
+
+    void Push(const TAction& action);
+    TAction Pop();
+    [[nodiscard]] TAction Peek() const;
+    [[nodiscard]] bool IsEmpty() const;
+    void Clear();
+
+};
+
+
+#endif //TSTACK_H

Exam/IKT203Exam/Portfolio/SharedLib/Utils.cpp

@@ -0,0 +1,78 @@
+#include "Utils.h"
+
+#include <iostream>
+#include <limits>
+
+#include "TDoublyLinkedList.h"
+#include "TStack.h"
+
+
+int Utils::Choice()
+{
+    std::cout << "========\n1. Add line\n2. Remove line\n3. Print current document\n4. Print queue\n5. Undo\n6. Redo\n0. Exit"
+                 "\n\nChoice:  ";
+    int choice;
+    std::cin >> choice;
+    std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
+    //std::cout << "\n=====================\n";
+    return choice;
+}
+
+int Utils::Insert(TDoublyLinkedList &document, TStack &undoStack, TStack &redoStack, int index)
+{
+        for (int i = 0; i < document.GetSize(); i++) {
+        std::cout << i + 1 << ". " << document.GetAtIndex(i) << std::endl;
+    }
+    if (document.GetSize() > 0)
+    {
+        std::cout << "Enter the line number where you want to insert the line" <<std::endl;
+        if (!(std::cin >> index)) {
+            std::cin.clear();
+            std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
+            std::cout << "========\nIndex must be a number\n========\n\n" << std::endl;
+            return index;
+        }
+
+        std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
+    }
+    if (document.GetSize() < 1)
+        index = 1;
+
+    std::cout << "Enter the text" <<std::endl;
+    std::string line;
+    std::getline(std::cin, line);
+
+
+    document.InsertAtIndex(index - 1, line);
+    undoStack.Push({INSERT, line, index - 1});
+    if (!redoStack.IsEmpty()) {
+        redoStack.Clear();
+    }
+    return index;
+}
+
+void Utils::PrintList(const TDoublyLinkedList &document)
+{
+    for (int i = 0; i < document.GetSize(); i++) {
+        std::cout << i + 1 << ". " << document.GetAtIndex(i) << std::endl;
+    }
+    std::cout << "\n\n";
+}
+
+int Utils::RemoveLine(TDoublyLinkedList &document, TStack &undoStack, TStack &redoStack, int index)
+{
+    std::cout << "Enter the number of the line you want to remove" <<std::endl;
+    if (!(std::cin >> index)) {
+        std::cin.clear();
+        std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
+        std::cout << "========\nIndex must be a number\n========\n\n" << std::endl;
+        return index;
+    }    std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
+    const std::string deletedLine = document.GetAtIndex(index-1);
+    document.Remove(index-1);
+    undoStack.Push({DELETE, deletedLine, index-1});
+    if (!redoStack.IsEmpty()) {
+        redoStack.Clear();
+    }
+    return index;
+}

Exam/IKT203Exam/Portfolio/SharedLib/Utils.h

@@ -0,0 +1,26 @@
+#ifndef UTILS_H
+#define UTILS_H
+#include "TDoublyLinkedList.h"
+#include "TStack.h"
+
+
+class Utils {
+    public:
+    static int Choice();
+    static int Insert(TDoublyLinkedList &document, TStack &undoStack, TStack &redoStack, int index);
+    static void PrintList(const TDoublyLinkedList &document);
+    static int RemoveLine(TDoublyLinkedList &document, TStack &undoStack, TStack &redoStack, int index);
+
+
+
+
+
+
+
+
+
+
+};
+
+
+#endif //PART1_UTILS_H