-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLinkedList.h
78 lines (73 loc) · 1.19 KB
/
LinkedList.h
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
#pragma once
#include "Node.h"
#include "Util.h"
class LinkedList
{
Node *head;
uint size;
Node* getLastNode(void);
public:
LinkedList(void);
LinkedList(const LinkedList &o);
~LinkedList(void);
uint getSize(void);
void addBack(Vehicul* data);
void addFront(Vehicul* data);
bool remove(char *numar);
Node* contains(char *numar);
void showContent(void);
LinkedList& operator = (const LinkedList &o);
class myIterator
{
Node *node;
public:
myIterator(void)
{
this->node = nullptr;
}
myIterator(Node *node)
{
this->node = node;
}
myIterator(const myIterator &o)
{
this->node = o.node;
}
Vehicul* operator *(void)
{
return node->data;
}
myIterator operator ++(void)
{
node = node->next;
return *this;
}
myIterator operator ++(int unit)
{
myIterator temp(node);
this->operator++();
return temp;
}
bool operator != (const myIterator &o)
{
return !(node == o.node);
}
bool operator == (const myIterator &o)
{
return (node == o.node);
}
myIterator& operator = (const myIterator &o)
{
node = o.node;
return *this;
}
};
myIterator begin(void)
{
return head;
}
myIterator end(void)
{
return nullptr;
}
};