FryingPan/framework/Generic/DynList.cpp

   1 /*
   2  * Amiga Generic Set - set of libraries and includes to ease sw development for all Amiga platforms
   3  * Copyright (C) 2001-2011 Tomasz Wiszkowski Tomasz.Wiszkowski at gmail.com.
   4  *
   5  * This library is free software; you can redistribute it and/or
   6  * modify it under the terms of the GNU Lesser General Public
   7  * License as published by the Free Software Foundation; either
   8  * version 2.1 of the License, or (at your option) any later version.
   9  *
  10  * This library is distributed in the hope that it will be useful,
  11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  13  * Lesser General Public License for more details.
  14  *
  15  * You should have received a copy of the GNU Lesser General Public
  16  * License along with this library; if not, write to the Free Software
  17  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  18  */
  19
  20 #include "DynList.h"
  21 #include "String.h"
  22 #include "LibrarySpool.h"
  23 #include <libclass/exec.h>
  24 #include <LibC/LibC.h>
  25
  26 using namespace GenNS;
  27
  28 EList::EList(MinList* pList)
  29 {
  30    bExternalList = true;
  31    PrvList  = pList;
  32    Count    = 0;
  33 }
  34
  35 EList::EList()
  36 {
  37    bExternalList           = false;
  38    PrvList                 = new MinList;
  39    PrvList->mlh_Head       = (MinNode*)&PrvList->mlh_Tail;
  40    PrvList->mlh_TailPred   = (MinNode*)&PrvList->mlh_Head;
  41    PrvList->mlh_Tail       = 0;
  42    Count                   = 0;
  43 }
  44
  45 EList::~EList()
  46 {
  47    if (false == bExternalList)
  48    {
  49       while (Count > 0)
  50       {
  51          Rem(0UL);
  52       }
  53       delete PrvList;
  54    }
  55 }
  56
  57 void EList::Add(void* ApObject)
  58 {
  59    ENode *pNode = new ENode;
  60
  61    memset(pNode, 0, sizeof(ENode));
  62    pNode->ln_Data = ApObject;
  63
  64    Exec->AddTail((List*)PrvList, (Node*)pNode);
  65    if (false == bExternalList)
  66       ++Count;
  67 }
  68
  69 void EList::AddFeatured(void* ApObject, const char* ApName, signed char AlPri)
  70 {
  71    ENode *pNode = new ENode;
  72
  73    memset(pNode, 0, sizeof(ENode));
  74    pNode->ln_Data = ApObject;
  75    pNode->ln_Pri  = AlPri;
  76    pNode->ln_Name = const_cast<char*>(ApName);
  77
  78    Exec->Enqueue((List*)PrvList, (Node*)pNode);
  79    if (false == bExternalList)
  80       ++Count;
  81 }
  82
  83 void EList::InsertAt(void* ApObject, unsigned long APos)
  84 {
  85    ENode *pNode = new ENode;
  86    pNode->ln_Data = ApObject;
  87    if (APos >=GetCount())
  88    {
  89       Exec->AddTail((List*)PrvList, (Node*)pNode);
  90    }
  91    else if (!APos)
  92    {
  93       Exec->AddHead((List*)PrvList, (Node*)pNode);
  94    }
  95    else
  96    {
  97       Node* pBefore = (Node*)PrvList->mlh_Head;
  98       while (--APos)
  99       {
 100          pBefore = pBefore->ln_Succ;
 101       }
 102       Exec->Insert((List*)PrvList, (Node*)pNode, pBefore);
 103    }
 104    if (false == bExternalList)
 105       ++Count;
 106 }
 107
 108 void EList::Rem(void* ApObject)
 109 {
 110    ENode *pNode = (ENode*)PrvList->mlh_Head;
 111    while (pNode->ln_Succ)
 112    {
 113       ENode *pNext = (ENode*)pNode->ln_Succ;
 114       if (pNode->ln_Data == ApObject)
 115       {
 116          Exec->Remove((Node*)pNode);
 117          if (false == bExternalList)
 118             --Count;
 119          delete pNode;
 120       }
 121       pNode = pNext;
 122    }
 123 }
 124
 125 void EList::Rem(unsigned long AItem)
 126 {
 127    if (false == bExternalList)
 128       if (AItem > Count) return;
 129
 130    ENode *pNode = (ENode*)PrvList->mlh_Head;
 131    while (pNode->ln_Succ)
 132    {
 133       ENode *pNext = (ENode*)pNode->ln_Succ;
 134       if (!AItem)
 135       {
 136          Exec->Remove((Node*)pNode);
 137          if (false == bExternalList)
 138             --Count;
 139          delete pNode;
 140          return;
 141       }
 142       pNode = pNext;
 143       --AItem;
 144    }
 145 }
 146
 147 void* EList::operator [] (unsigned long AItem)
 148 {
 149    if (false == bExternalList)
 150       if (AItem > Count) return 0;
 151    ENode *pNode = (ENode*)PrvList->mlh_Head;
 152    while (pNode->ln_Succ)
 153    {
 154       ENode *pNext = (ENode*)pNode->ln_Succ;
 155       if (!AItem)
 156       {
 157          return pNode->ln_Data;
 158       }
 159       pNode = pNext;
 160       --AItem;
 161    }
 162    return 0;
 163 }
 164
 165 unsigned long EList::GetCount()
 166 {
 167    if (false == bExternalList)
 168       return Count;
 169
 170    ENode *pNode = (ENode*)PrvList->mlh_Head;
 171    long  lItems = 0;
 172
 173    while (pNode->ln_Succ)
 174    {
 175       pNode = (ENode*)pNode->ln_Succ;
 176       ++lItems;
 177    }
 178    return lItems;
 179 }
 180
 181 void *EList::Get(unsigned long AItem)
 182 {
 183    return (*this)[AItem];
 184 }
 185
 186 Node* EList::GetNode(unsigned long AItem)
 187 {
 188    if (false == bExternalList)
 189       if (AItem > Count) return 0;
 190    ENode *pNode = (ENode*)PrvList->mlh_Head;
 191    while (pNode->ln_Succ)
 192    {
 193       ENode *pNext = (ENode*)pNode->ln_Succ;
 194       if (!AItem)
 195       {
 196          return pNode;
 197       }
 198       pNode = pNext;
 199       --AItem;
 200    }
 201    return 0;
 202 }
 203
 204 MinList *EList::GetList()
 205 {
 206    return PrvList;
 207 }
 208
 209 void EList::Update()
 210 {
 211     bool bCopy = bExternalList;
 212     bExternalList = true;
 213     Count = GetCount();
 214     bExternalList = bCopy;
 215 }
 216