src/OpenFOAM/containers/LinkedLists/linkTypes/DLListBase/DLListBase.C

   1 /*---------------------------------------------------------------------------*\
   2   =========                 |
   3   \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
   4    \\    /   O peration     |
   5     \\  /    A nd           | Copyright (C) 1991-2008 OpenCFD Ltd.
   6      \\/     M anipulation  |
   7 -------------------------------------------------------------------------------
   8 License
   9     This file is part of OpenFOAM.
  10
  11     OpenFOAM is free software; you can redistribute it and/or modify it
  12     under the terms of the GNU General Public License as published by the
  13     Free Software Foundation; either version 2 of the License, or (at your
  14     option) any later version.
  15
  16     OpenFOAM is distributed in the hope that it will be useful, but WITHOUT
  17     ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  18     FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  19     for more details.
  20
  21     You should have received a copy of the GNU General Public License
  22     along with OpenFOAM; if not, write to the Free Software Foundation,
  23     Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  24
  25 \*---------------------------------------------------------------------------*/
  26
  27 #include "error.H"
  28
  29 #include "DLListBase.H"
  30 #include "IOstreams.H"
  31 #include "long.H"
  32
  33 // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
  34
  35 namespace Foam
  36 {
  37
  38 // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
  39
  40 DLListBase::iterator DLListBase::endIter
  41 (
  42     const_cast<DLListBase&>(static_cast<const DLListBase&>(DLListBase()))
  43 );
  44
  45 DLListBase::const_iterator DLListBase::endConstIter
  46 (
  47     static_cast<const DLListBase&>(DLListBase()),
  48     reinterpret_cast<const link*>(NULL)
  49 );
  50
  51
  52 // * * * * * * * * * * * * * * * Member Functions  * * * * * * * * * * * * * //
  53
  54 void DLListBase::insert(DLListBase::link* a)
  55 {
  56     nElmts_++;
  57
  58     if (!first_)
  59     {
  60         a->prev_ = a;
  61         a->next_ = a;
  62         first_ = last_ = a;
  63     }
  64     else
  65     {
  66         a->prev_ = a;
  67         a->next_ = first_;
  68         first_->prev_ = a;
  69         first_ = a;
  70     }
  71 }
  72
  73
  74 void DLListBase::append(DLListBase::link* a)
  75 {
  76     nElmts_++;
  77
  78     if (!first_)
  79     {
  80         a->prev_ = a;
  81         a->next_ = a;
  82         first_ = last_ = a;
  83     }
  84     else
  85     {
  86         last_->next_ = a;
  87         a->prev_ = last_;
  88         a->next_ = a;
  89         last_ = a;
  90     }
  91 }
  92
  93
  94 bool DLListBase::swapUp(DLListBase::link* a)
  95 {
  96     if (first_ != a)
  97     {
  98         link* ap = a->prev_;
  99
 100         if (ap == first_)
 101         {
 102             first_ = a;
 103         }
 104
 105         if (a == last_)
 106         {
 107             last_ = ap;
 108         }
 109
 110         if (a->next_)
 111         {
 112             a->next_->prev_ = ap;
 113         }
 114
 115         if (ap->prev_)
 116         {
 117             ap->prev_->next_ = a;
 118         }
 119
 120         a->prev_ = ap->prev_;
 121         ap->prev_ = a;
 122
 123         ap->next_ = a->next_;
 124         a->next_ = ap;
 125
 126         return true;
 127     }
 128     else
 129     {
 130         return false;
 131     }
 132 }
 133
 134
 135 bool DLListBase::swapDown(DLListBase::link* a)
 136 {
 137     if (last_ != a)
 138     {
 139         link* an = a->next_;
 140
 141         if (a == first_)
 142         {
 143             first_ = an;
 144         }
 145
 146         if (an == last_)
 147         {
 148             last_ = a;
 149         }
 150
 151         if (a->prev_)
 152         {
 153             a->prev_->next_ = an;
 154         }
 155
 156         if (an->next_)
 157         {
 158             an->next_->prev_ = a;
 159         }
 160
 161         an->prev_ = a->prev_;
 162         a->prev_ = an;
 163
 164         a->next_ = an->next_;
 165         an->next_ = a;
 166
 167         return true;
 168     }
 169     else
 170     {
 171         return false;
 172     }
 173 }
 174
 175
 176 DLListBase::link* DLListBase::removeHead()
 177 {
 178     nElmts_--;
 179
 180     if (!first_)
 181     {
 182         FatalErrorIn("void DLListBase::removeHead()")
 183             << "remove from empty list"
 184             << abort(FatalError);
 185     }
 186
 187     DLListBase::link* f = first_;
 188     first_ = f->next_;
 189
 190     if (!first_)
 191     {
 192         last_ = 0;
 193     }
 194
 195     f->deregister();
 196     return f;
 197 }
 198
 199
 200 DLListBase::link* DLListBase::remove(DLListBase::link* l)
 201 {
 202     nElmts_--;
 203
 204     link* ret = l;
 205
 206     if (l == first_ && first_ == last_)
 207     {
 208         first_ = 0;
 209         last_ = 0;
 210     }
 211     else if (l == first_)
 212     {
 213         first_ = first_->next_;
 214         first_->prev_ = first_;
 215     }
 216     else if (l == last_)
 217     {
 218         last_ = last_->prev_;
 219         last_->next_ = last_;
 220     }
 221     else
 222     {
 223         l->next_->prev_ = l->prev_;
 224         l->prev_->next_ = l->next_;
 225     }
 226
 227     ret->deregister();
 228     return ret;
 229 }
 230
 231
 232 DLListBase::link* DLListBase::replace
 233 (
 234     DLListBase::link* oldLink,
 235     DLListBase::link* newLink
 236 )
 237 {
 238     link* ret = oldLink;
 239
 240     newLink->prev_ = oldLink->prev_;
 241     newLink->next_ = oldLink->next_;
 242
 243     if (oldLink == first_ && first_ == last_)
 244     {
 245         first_ = newLink;
 246         last_  = newLink;
 247     }
 248     else if (oldLink == first_)
 249     {
 250         first_ = newLink;
 251         newLink->next_->prev_ = newLink;
 252     }
 253     else if (oldLink == last_)
 254     {
 255         last_ = newLink;
 256         newLink->prev_->next_ = newLink;
 257     }
 258     else
 259     {
 260         newLink->prev_->next_ = newLink;
 261         newLink->next_->prev_ = newLink;
 262     }
 263
 264     ret->deregister();
 265     return ret;
 266 }
 267
 268
 269 // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
 270
 271 } // End namespace Foam
 272
 273 // ************************************************************************* //