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 {
  98                 // Find last par.
  99                 Paragraph * last = parlist;
 100                 while (last->next())
 101                         last = last->next();
 102                 last->next(par);
 103                 par->previous(last);
 104         }
 105         return iterator(par);
 106 }
 107
 108
 109 void ParagraphList::clear()
 110 {
 111         while (parlist) {
 112                 Paragraph * tmp = parlist->next();
 113                 delete parlist;
 114                 parlist = tmp;
 115         }
 116 }
 117
 118
 119 void ParagraphList::erase(ParagraphList::iterator it)
 120 {
 121         Paragraph * prev = it->previous();
 122         Paragraph * next = it->next();
 123
 124         if (prev)
 125                 prev->next(next);
 126         if (next)
 127                 next->previous(prev);
 128
 129         delete &*it;
 130 }
 131
 132
 133 ParagraphList::iterator ParagraphList::begin()
 134 {
 135         return iterator(parlist);
 136 }
 137
 138
 139 ParagraphList::iterator ParagraphList::begin() const
 140 {
 141         return iterator(parlist);
 142 }
 143
 144
 145 ParagraphList::iterator ParagraphList::end()
 146 {
 147         return iterator();
 148 }
 149
 150
 151 ParagraphList::iterator ParagraphList::end() const
 152 {
 153         return iterator();
 154 }
 155
 156
 157 void ParagraphList::set(Paragraph * p)
 158 {
 159         parlist = p;
 160 }
 161
 162
 163 void ParagraphList::push_back(Paragraph * p)
 164 {
 165         if (!parlist) {
 166                 parlist = p;
 167                 return;
 168         }
 169
 170         Paragraph * pos = parlist;
 171         while (pos->next())
 172                 pos = pos->next();
 173         pos->next(p);
 174         p->previous(pos);
 175 }
 176
 177
 178 int ParagraphList::size() const
 179 {
 180         // When we switch to a std::container this will be O(1)
 181         // instead of O(n). (Lgb)
 182         Paragraph * tmp = parlist;
 183         int c = 0;
 184         while (tmp) {
 185                 ++c;
 186                 tmp = tmp->next();
 187         }
 188         return c;
 189 }
 190
 191
 192 bool ParagraphList::empty() const
 193 {
 194         return parlist == 0;
 195 }