Circular-Doubly-Linked-List-Implementation/InsertNodeManager.cpp at main · dvernon5/Circular-Doubly-Linked-List-Implementation · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include "InsertNodeManager.h"
#include <iostream>

struct Node* InsertNodeManager::InsertRootNode(struct Node* ptr_node, NodePositionInfo& node) {
  struct Node* root_node       = new Node;
  list_info.AllocationWarningMessage(root_node);
  root_node->prev_node         = root_node;
  root_node->data              = node.data;
  root_node->next_node         = root_node;
  ptr_node                     = root_node;
  const int POSITION_INCREMENT = 1;
  std::cout << "Your data " << node.data << " was successfully added at "
            << "Position "  << node.position + POSITION_INCREMENT << ".\n";

  return ptr_node;
}

struct Node* InsertNodeManager::InsertAtFirstNode(struct Node* ptr_node, NodePositionInfo& node) {
  struct Node* new_node = new Node;
  list_info.AllocationWarningMessage(new_node);
  new_node->prev_node             = ptr_node->prev_node;
  new_node->data                  = node.data;
  new_node->next_node             = ptr_node;
  new_node->prev_node->next_node  = new_node;
  ptr_node->prev_node             = new_node;
  ptr_node                        = new_node;
  std::cout << "Your data " << node.data << " was successfully added at "
            << "Position "  << node.position << ".\n";

  return ptr_node;
}

struct Node* InsertNodeManager::InsertBetweenNodes(struct Node* ptr_node, NodePositionInfo& node) {
  const int POSITION_DECREMENT = 1;
  struct Node* current_node    = ptr_node;
  for (size_t current_position = 0;
        current_position < node.position - POSITION_DECREMENT && current_node->next_node != ptr_node;
       ++current_position)
  {
    current_node = current_node->next_node;
  }
  struct Node* new_node              = new Node;
  list_info.AllocationWarningMessage(new_node);
  new_node->prev_node                = current_node->prev_node;
  new_node->data                     = node.data;
  new_node->next_node                = current_node;
  current_node->prev_node->next_node = new_node;
  current_node->prev_node            = new_node;
  std::cout << "Your data " << node.data  << " was successfully added at "
            << "Position "  << node.position << ".\n";

  return ptr_node;
}

struct Node* InsertNodeManager::InsertAtBackNode(struct Node* ptr_node, NodePositionInfo &node) {
  struct Node* new_node          = new Node;
  list_info.AllocationWarningMessage(new_node);
  new_node->prev_node            = ptr_node->prev_node;
  new_node->data                 = node.data;
  new_node->next_node            = ptr_node->prev_node->next_node;
  ptr_node->prev_node->next_node = new_node;
  ptr_node->prev_node            = new_node;

  return ptr_node;
}

struct Node* InsertNodeManager::InsertNode(struct Node* ptr_node, NodePositionInfo& node) {
  const int BEGINNING_POSITION = 1;
  const int NODES_TO_ADD       = 1;
  int total_nodes = list_info.GetNumberOfNodes(ptr_node);
  if (list_info.IsEmptyList(ptr_node)) {
    ptr_node = InsertRootNode(ptr_node, node);
  } else if (node.position == BEGINNING_POSITION) {
    ptr_node = InsertAtFirstNode(ptr_node, node);
  } else if (node.position > BEGINNING_POSITION && node.position <= total_nodes) {
    ptr_node = InsertBetweenNodes(ptr_node, node);
  } else if (node.position == total_nodes + NODES_TO_ADD) {
    ptr_node = InsertAtBackNode(ptr_node, node);
  } else {
    std::cout << "Invalid position! Please enter a number between "
              << BEGINNING_POSITION << " and " << total_nodes + NODES_TO_ADD << "\n";
  }

  return ptr_node;
}