-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathdlist.h
More file actions
99 lines (77 loc) · 2.03 KB
/
dlist.h
File metadata and controls
99 lines (77 loc) · 2.03 KB
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
/*
IL : Intlog Language
Object Oriented Prolog Project
Copyright (C) 1992-2021 - Ing. Capelli Carlo
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
*/
#ifndef DLIST_H_
#define DLIST_H_
//--------------------
// double linked list
//--------------------
class e_dlist;
class dlist;
class dlist_iter;
class e_dlist {
friend class dlist;
friend class dlist_iter;
e_dlist* next;
e_dlist* prev;
public:
e_dlist() { next = prev = nullptr; }
virtual ~e_dlist() {}
};
class dlist {
friend class dlist_iter;
e_dlist* first;
e_dlist* last;
public:
void insert(e_dlist *e, int pos = -1);
void remove(int pos);
void clear();
e_dlist* get(int pos);
unsigned numel() const;
dlist() { first = last = nullptr; }
~dlist() { clear(); }
};
class dlist_iter {
dlist* l;
e_dlist* e;
public:
dlist_iter(dlist& dl) {
first(dl);
}
void first(dlist& dl) {
l = &dl; e = l->first;
}
void last(dlist& dl) {
l = &dl; e = l->last;
}
e_dlist* next() {
if (e) {
e_dlist *n = e;
e = e->next;
return n;
}
return nullptr;
}
e_dlist* prev() {
if (e) {
e_dlist *n = e;
e = e->prev;
return n;
}
return nullptr;
}
};
#endif