DS_Project1/TermsList.cpp at main · dbfanck/DS_Project1 · 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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
#include <iostream>
#include "MemberQueueNode.h"
#include "TermsList.h"
#include "TermsBST.h"

using namespace std;

TermsLIST::TermsLIST(): head(nullptr)
{

}
TermsLIST::~TermsLIST()
{

}

TermsListNode* TermsLIST::getHead()
{
	return head;
}

// insert
void TermsLIST::insert(MemberQueueNode* popNode)
{
	if(head==nullptr) //no node
	{
		TermsListNode* newListNode = new TermsListNode; //make node
		newListNode->setType(popNode->getType()); //set type
		newListNode->cntUp(); //count up
		head=newListNode; //head

		TermsBSTNode* newBSTNode = new TermsBSTNode(popNode); //make node
		TermsBST* newBST = new TermsBST;
		newBST->insert(newBSTNode); //make BST
		newListNode->setBSTptr(newBST);

		return;
	}

	TermsListNode* curNode=head;

	while(curNode)
	{
		if(curNode->getType()==popNode->getType()) //exist node
		{
			break;
		}
		curNode=curNode->getNext();
	}

	if(curNode!=nullptr) //exist
	{
		curNode->cntUp(); //count up

		TermsBSTNode* newBSTNode = new TermsBSTNode(popNode); //make BST node
		TermsBST* BSTptr=curNode->getBSTptr();
		BSTptr->insert(newBSTNode); //insert node
	}
	else
	{
		TermsListNode* newListNode= new TermsListNode; //make List node
		newListNode->setType(popNode->getType()); //set type
		newListNode->cntUp(); //count up

		curNode=head;
		while(curNode->getNext())
		{
			curNode=curNode->getNext();
		}

		curNode->setNext(newListNode);

		TermsBSTNode* newBSTNode = new TermsBSTNode(popNode); //make BST node
		TermsBST* newBST = new TermsBST;
		newBST->insert(newBSTNode); //make BST
		newListNode->setBSTptr(newBST);
	}

}

// search
TermsListNode* TermsLIST::search(char type)
{
	TermsListNode* curNode = head;

	while(curNode)
	{
		if(curNode->getType()==type)
		{
			break;
		}

		curNode=curNode->getNext();
	}

	return curNode;
}

// delete
void TermsLIST::del_List(char type)
{
	TermsListNode* prevNode = nullptr, *curNode = head;

	while(curNode)
	{
		if(curNode->getType()==type)
		{
			break;
		}

		prevNode=curNode;
		curNode=curNode->getNext();
	}

	curNode->cntDown(); //count down

	if(curNode->getCnt()==0) //count is zero
	{
		if(curNode==head)
		{
			head=curNode->getNext();
		}
		else
		{
			prevNode->setNext(curNode->getNext());
		}
	}
}