]> git.lyx.org Git - lyx.git/blob - src/ParagraphList.C
add some cut and paste bugs (disguised as cleanups)
[lyx.git] / src / ParagraphList.C
1 #include <config.h>
2
3 #include "ParagraphList.h"
4
5 #include "paragraph.h"
6
7 ////////// The ParagraphList::iterator
8
9 ParagraphList::iterator::iterator()
10         : ptr(0)
11 {}
12
13
14 ParagraphList::iterator::iterator(Paragraph * p)
15         : ptr(p)
16 {}
17
18
19 ParagraphList::iterator::reference
20 ParagraphList::iterator::operator*()
21 {
22         return *ptr;
23 }
24
25
26 ParagraphList::iterator::pointer
27 ParagraphList::iterator::operator->()
28 {
29         return ptr;
30 }
31
32
33 ParagraphList::iterator &
34 ParagraphList::iterator::operator++()
35 {
36         ptr = ptr->next();
37         return *this;
38 }
39
40
41 ParagraphList::iterator
42 ParagraphList::iterator::operator++(int)
43 {
44         iterator tmp = *this;
45         ++*this;
46         return tmp;
47 }
48
49
50 ParagraphList::iterator &
51 ParagraphList::iterator::operator--()
52 {
53         ptr = ptr->previous();
54         return *this;
55 }
56
57
58 ParagraphList::iterator
59 ParagraphList::iterator::operator--(int)
60 {
61         iterator tmp = *this;
62         --*this;
63         return tmp;
64 }
65
66
67 bool operator==(ParagraphList::iterator const & i1,
68                 ParagraphList::iterator const & i2)
69 {
70         return &(*const_cast<ParagraphList::iterator&>(i1))
71             == &(*const_cast<ParagraphList::iterator&>(i2));
72 }
73
74
75 bool operator!=(ParagraphList::iterator const & i1,
76                 ParagraphList::iterator const & i2)
77 {
78         return !(i1 == i2);
79 }
80
81
82 ////////// The ParagraphList proper
83 ParagraphList::ParagraphList()
84         : parlist(0)
85 {}
86
87
88 ParagraphList::iterator
89 ParagraphList::insert(ParagraphList::iterator it, Paragraph * par)
90 {
91         if (it != end()) {
92                 Paragraph * prev = it->previous();
93                 par->next(&*it);
94                 par->previous(prev);
95                 prev->next(par);
96                 it->previous(par);
97         } else if (parlist == 0) {
98                 parlist = par;
99         } else {
100                 // Find last par.
101                 Paragraph * last = parlist;
102                 while (last->next())
103                         last = last->next();
104                 last->next(par);
105                 par->previous(last);
106         }
107         return iterator(par);
108 }
109
110
111 void ParagraphList::clear()
112 {
113         while (parlist) {
114                 Paragraph * tmp = parlist->next();
115                 delete parlist;
116                 parlist = tmp;
117         }
118 }
119
120
121 void ParagraphList::erase(ParagraphList::iterator it)
122 {
123         Paragraph * prev = it->previous();
124         Paragraph * next = it->next();
125
126         if (prev)
127                 prev->next(next);
128         if (next)
129                 next->previous(prev);
130
131         delete &*it;
132 }
133
134
135 ParagraphList::iterator ParagraphList::begin()
136 {
137         return iterator(parlist);
138 }
139
140
141 ParagraphList::iterator ParagraphList::begin() const
142 {
143         return iterator(parlist);
144 }
145
146
147 ParagraphList::iterator ParagraphList::end()
148 {
149         return iterator();
150 }
151
152
153 ParagraphList::iterator ParagraphList::end() const
154 {
155         return iterator();
156 }
157
158
159 Paragraph const & ParagraphList::front() const
160 {
161         return *parlist;
162 }
163
164
165 Paragraph & ParagraphList::front()
166 {
167         return *parlist;
168 }
169
170
171 Paragraph const & ParagraphList::back() const
172 {
173         Paragraph * tmp = parlist;
174         while (tmp->next())
175                 tmp = tmp->next();
176         return *tmp;
177 }
178
179
180 Paragraph & ParagraphList::back()
181 {
182         Paragraph * tmp = parlist;
183         while (tmp->next())
184                 tmp = tmp->next();
185         return *tmp;
186 }
187
188
189 void ParagraphList::set(Paragraph * p)
190 {
191         parlist = p;
192 }
193
194
195 void ParagraphList::push_back(Paragraph * p)
196 {
197         if (!parlist) {
198                 parlist = p;
199                 return;
200         }
201
202         Paragraph * pos = parlist;
203         while (pos->next())
204                 pos = pos->next();
205         pos->next(p);
206         p->previous(pos);
207 }
208
209
210 int ParagraphList::size() const
211 {
212         // When we switch to a std::container this will be O(1)
213         // instead of O(n). (Lgb)
214         Paragraph * tmp = parlist;
215         int c = 0;
216         while (tmp) {
217                 ++c;
218                 tmp = tmp->next();
219         }
220         return c;
221 }
222
223
224 bool ParagraphList::empty() const
225 {
226         return parlist == 0;
227 }