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
|
/*
* This file is part of the KDE libraries
* Copyright (C) 2003 Apple Computer, Inc
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library 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
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#include "reference_list.h"
namespace KJS {
class ReferenceListNode {
friend class ReferenceList;
friend class ReferenceListIterator;
protected:
ReferenceListNode(const Reference &ref) : reference(ref), next(NULL) {}
private:
Reference reference;
ReferenceListNode *next;
};
class ReferenceListHeadNode : private ReferenceListNode {
friend class ReferenceList;
friend class ReferenceListIterator;
ReferenceListHeadNode(const Reference &ref) : ReferenceListNode(ref), refcount(1), length(0) {}
int refcount;
int length;
};
}
using namespace KJS;
// ReferenceList
ReferenceList::ReferenceList() :
head(NULL),
tail(NULL)
{
}
ReferenceList::ReferenceList(const ReferenceList &list)
{
head = list.head;
tail = list.tail;
if (head != NULL) {
head->refcount++;
}
}
ReferenceList &ReferenceList::operator=(const ReferenceList &list)
{
ReferenceList tmp(list);
tmp.swap(*this);
return *this;
}
void ReferenceList::swap(ReferenceList &list)
{
ReferenceListHeadNode *tmpHead = list.head;
list.head = head;
head = tmpHead;
ReferenceListNode *tmpTail = list.tail;
list.tail = tail;
tail = tmpTail;
}
void ReferenceList::append(const Reference& ref)
{
if (tail == NULL) {
tail = head = new ReferenceListHeadNode(ref);
} else {
tail->next = new ReferenceListNode(ref);
tail = tail->next;
}
head->length++;
}
int ReferenceList::length()
{
return head ? head->length : 0;
}
ReferenceList::~ReferenceList()
{
if (head != NULL && --(head->refcount) == 0) {
ReferenceListNode *next;
for (ReferenceListNode *p = head; p != NULL; p = next) {
next = p->next;
if (p == head) {
delete (ReferenceListHeadNode *)p;
} else {
delete p;
}
}
}
}
ReferenceListIterator ReferenceList::begin() const
{
return ReferenceListIterator(head);
}
ReferenceListIterator ReferenceList::end() const
{
return ReferenceListIterator(NULL);
}
// ReferenceListIterator
ReferenceListIterator::ReferenceListIterator(ReferenceListNode *n) :
node(n)
{
}
bool ReferenceListIterator::operator!=(const ReferenceListIterator &it) const
{
return node != it.node;
}
const Reference *ReferenceListIterator::operator->() const
{
return &node->reference;
}
const Reference &ReferenceListIterator::operator++(int /*i*/)
{
const Reference &ref = node->reference;
node = node->next;
return ref;
}
|
