datos2014/CircularList.cpp at master · awainer/datos2014 · 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
129
130
131
132
133
134
135
136
137
138
139
140
/*
 * CircularList.cpp
 *
 *  Created on: 14/05/2014
 *      Author: tavo
 */

#include "CircularList.h"
#include "DataBlock.h"
#include <list>
#include <iostream>

namespace std{


CircularList::CircularList() {
	this->quantity_nodes = 0;
//	this->list_circular_nodes = NULL;
	this->first_node = NULL;
	this->last_node = NULL;
}


unsigned long int CircularList::getQuantityNodes(){
	return quantity_nodes;
}


CircularListNode * CircularList::getFirstNode(){
	return this->first_node;
}


CircularListNode * CircularList::getLastNode(){
	return this->last_node;
}


void CircularList::addNode(unsigned char val){
	CircularListNode * new_node;
	if (this->quantity_nodes == 0) {
		new_node = new CircularListNode(val);
		new_node->setPrevious(new_node);
		this->first_node = new_node;
		this->last_node = new_node;

	}
	else{
		new_node = new CircularListNode(val,this->first_node,this->last_node);
		this->first_node->setPrevious(new_node);
	}
	(this->last_node)->setNext(new_node);
	this->last_node = new_node;
	this->quantity_nodes++;
	list_circular_nodes.push_back(new_node);
}


DataBlock * CircularList::getStringStartingAt(unsigned long int initial_node){
	list<CircularListNode *>::iterator itNodes = this->list_circular_nodes.begin();
	DataBlock * block = new DataBlock();
	CircularListNode * actual_node;

	for (unsigned long int i = 1; i < initial_node; i++){
		itNodes++;
	}

	actual_node = (*itNodes);

	for (unsigned long int i = 1; i <= this->quantity_nodes; i++){
		block->addByte(actual_node->getVal());
		actual_node= (actual_node->getNext());
	}

	return block;
}

DataBlock * CircularList::getStringStartingAtNode(CircularListNode * initial_node){
	//list<CircularListNode *>::iterator itNodes = this->list_circular_nodes.begin();
	DataBlock * block = new DataBlock();
	CircularListNode * actual_node=initial_node;

	for (unsigned long int i = 1; i <= this->quantity_nodes; i++){
		block->addByte(actual_node->getVal());
		actual_node= (actual_node->getNext());
	}
	return block;
}


CircularListNode * CircularList::getNodeAt(unsigned long int node_number){
	list<CircularListNode *>::iterator itNodes = this->list_circular_nodes.begin();

	for (unsigned long int i = 1; i < node_number; i++){
		itNodes++;
	}

	return (*itNodes);
}


unsigned long int CircularList::getPosNode(CircularListNode * node){
	list<CircularListNode *>::iterator itNodes = this->list_circular_nodes.begin();

	for (unsigned long int i = 1; i <= quantity_nodes; i++){
		if ((*itNodes)== node){
			return i;
		}
		itNodes++;
	}
	return 0;
}


list<CircularListNode *>::iterator CircularList::getIterator(){
	list<CircularListNode *>::iterator itNodes = this->list_circular_nodes.begin();

	return itNodes;
}


list<CircularListNode *>::iterator CircularList::getIteratorAt(unsigned long int initial_node){
	list<CircularListNode *>::iterator itNodes = this->list_circular_nodes.begin();

	for (unsigned long int i = 1; i < initial_node; i++){
		itNodes++;
	}

	return itNodes;
}


CircularList::~CircularList() {
	list<CircularListNode *>::iterator itNodes = this->list_circular_nodes.begin();
	for (; itNodes != this->list_circular_nodes.end(); itNodes++)
		delete (*itNodes);
}

}