dataStructuresII/ListaClientes.cpp at master · psicobloc/dataStructuresII · 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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
// Created by Hugo.

#include "ListaClientes.h"

using namespace std;

ListaClientes::ListaClientes()
{
    if ((header = new NodoCliente) == nullptr) //creando header
    {
        cout << "exception, constructor ListaClientes" << endl;
    }
    header->setPrev(header);
    header->setNext(header);
}

ListaClientes::ListaClientes(ListaClientes &lista) : ListaClientes()
{
    copyAll(lista);
}

ListaClientes::~ListaClientes()
{
    deleteAll();
    delete header;
}

bool ListaClientes::isEmpty()
{
    return header->getNext() == header;
}

bool ListaClientes::isValidPos(NodoCliente *nodo)
{
    NodoCliente *aux(header->getNext());

    while (aux != header)
    {
        if (aux == nodo)
        {
            return true;
        }
        aux = aux->getNext();
    }
    return false;
}

void ListaClientes::insertData(NodoCliente *prevNode, Cliente &clnt)
{
    if (prevNode != nullptr and !isValidPos(prevNode))
    {
        cout << "posicion invalida, insert clientes" << endl;
    }


    NodoCliente* aux(nullptr);
    aux = new NodoCliente(clnt);

    if (prevNode == nullptr)
    {
        prevNode = header;
    }

    cout << "insert data .. " << aux->getData().toString() << endl;

    aux->setPrev(prevNode);
    aux->setNext(prevNode->getNext());
    prevNode->getNext()->setPrev(aux);
    prevNode->setNext(aux);


}

void ListaClientes::copyAll(ListaClientes &lst)
{
    NodoCliente *aux(lst.header->getNext());
    NodoCliente *newNode;

    while (aux != lst.header)
    {
        if ((newNode = new NodoCliente(aux->getData())) == nullptr)
        {
            cout << "excepcion, ListaClientes copyAll" << endl;
        }

        newNode->setPrev(header->getPrev()); //** neWnode->setprev()
        newNode->setNext(header);

        header->getPrev()->setNext(newNode);
        header->setPrev(newNode);

        aux = aux->getNext();
    }
}

void ListaClientes::deleteData(NodoCliente *nodoEliminar)
{
    nodoEliminar->getPrev()->setNext(nodoEliminar->getNext());
    nodoEliminar->getNext()->setPrev(nodoEliminar->getPrev());
    delete nodoEliminar;
}

void ListaClientes::deleteAll()
{
    NodoCliente *aux(nullptr);

    while (header->getNext() != header)
    {
        aux = header->getNext();
        header->setNext(aux->getNext());
        delete aux;
    }
    header->setPrev(header);
}

NodoCliente *ListaClientes::getLastPos()
{
    if (isEmpty())
    {
        return nullptr;
    }
    return header->getPrev();
}

NodoCliente *ListaClientes::findData(Cliente &clnt)
{
    NodoCliente *aux(header->getNext());

    while (aux != header)
    {
        if (aux->getData() == clnt)
        {
            return aux;
        }
        aux = aux->getNext();
    }
    return nullptr;
}

Cliente &ListaClientes::retrieve(NodoCliente *nodo)
{
    if (!isValidPos(nodo))
    {
        cout << "Posicion invalida, intentando recuperar de lista de Productos" << endl;
    }
    return nodo->getData();
}

std::string ListaClientes::toString()
{
    NodoCliente* aux(header->getNext());
    string result;

    while (aux != header)
    {
        result += aux->getData().toString() + "\n\n";
        aux = aux->getNext();
    }
    return result;
}

ListaClientes &ListaClientes::operator=(ListaClientes &list)
{
    deleteAll();
    copyAll(list);
    return *this;
}