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 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221
|
//////////////////////////////////////////////////////////////////////////
//
// pgAdmin III - PostgreSQL Tools
//
// Copyright (C) 2002 - 2014, The pgAdmin Development Team
// This software is released under the PostgreSQL Licence
//
// hdArrayCollection.cpp - Implementation of Collection Using Arrays
//
//////////////////////////////////////////////////////////////////////////
#include "pgAdmin3.h"
// wxWindows headers
#include <wx/wx.h>
// App headers
#include "hotdraw/utilities/hdArrayCollection.h"
#include "hotdraw/main/hdObject.h"
// Destructor
hdArrayCollection::~hdArrayCollection()
{
WX_CLEAR_ARRAY(ddArray);
}
// Add item to array
void hdArrayCollection::addItem(hdObject *item)
{
ddArray.Add(item);
}
// Remove item from array but don't delete it.
void hdArrayCollection::removeItem(hdObject *item)
{
ddArray.Remove(item);
}
void hdArrayCollection::removeItemAt(int index)
{
ddArray.RemoveAt(index);
}
// Create an iterator for the objects inside the array
hdIteratorBase *hdArrayCollection::createIterator()
{
return (new hdArrayIterator(&ddArray));
}
// Create a Down to iterator for the objects inside the array
hdIteratorBase *hdArrayCollection::createDownIterator()
{
return (new hdArrayDownIterator(&ddArray));
}
// Return the number of elements inside the array
int hdArrayCollection::count()
{
return ddArray.Count();
}
// Return true if an element pointer is found inside array
bool hdArrayCollection::existsObject(hdObject *item)
{
hdObject *found = NULL;
int size = ddArray.GetCount();
for(int i = 0; i < size; i++)
{
if (ddArray.Item(i) == item)
{
found = ddArray.Item(i);
break;
}
}
return (found != NULL);
}
// Delete all elements inside array
void hdArrayCollection::deleteAll()
{
WX_CLEAR_ARRAY(ddArray);
}
// Removes all elements inside array without deleting
void hdArrayCollection::removeAll()
{
ddArray.Empty();
}
// Get Item at certain position at Collection
hdObject *hdArrayCollection::getItemAt(int index)
{
if(!ddArray.IsEmpty())
return ddArray[index];
else
return NULL;
}
//Bring item to start of array
void hdArrayCollection::bringToFront(hdObject *item)
{
hdObject *tmp = ddArray[0];
int index = getIndex(item);
ddArray[0] = ddArray[index];
ddArray[index] = tmp;
}
//Bring item to end of array
void hdArrayCollection::sendToBack(hdObject *item)
{
int end = count() - 1;
hdObject *tmp = ddArray[end];
int index = getIndex(item);
ddArray[end] = ddArray[index];
ddArray[index] = tmp;
}
int hdArrayCollection::getIndex(hdObject *item)
{
return ddArray.Index(item);
}
// Insert item into the array before the index
void hdArrayCollection::insertAtIndex(hdObject *item, int index)
{
ddArray.Insert(item, index);
}
// Replace item into the array at index (if overwrite user should delete manually previous object at index)
void hdArrayCollection::replaceAtIndex(hdObject *item, int index)
{
ddArray.RemoveAt(index);
ddArray.Insert(item, index);
}
//
// hdArrayIterator - Manages iterator for the array collection concrete class, from first to last element
//
// Constructor
hdArrayIterator::hdArrayIterator(ddObjsArray *ddPtrsArray)
{
position = 0;
internalArray = ddPtrsArray;
}
// Get current item in the array for the iterator
hdObject *hdArrayIterator::Current()
{
hdObject *obj = internalArray->Item(position);
return obj;
}
// Get next item in the array for the iterator
hdObject *hdArrayIterator::Next()
{
hdObject *obj = internalArray->Item(position);
position++;
return obj;
}
// Return true if the array has more elements to return
bool hdArrayIterator::HasNext()
{
int size = internalArray->GetCount();
if( (size > 0) && (position <= (size - 1)) )
return true;
else
return false;
}
void hdArrayIterator::ResetIterator()
{
position = 0;
}
//
// hdArrayDownIterator - Manages iterator for the array collection concrete class from last to first element
//
// Constructor
hdArrayDownIterator::hdArrayDownIterator(ddObjsArray *ddPtrsArray)
{
internalArray = ddPtrsArray;
position = internalArray->GetCount() - 1;
}
// Get current item in the array for the iterator
hdObject *hdArrayDownIterator::Current()
{
hdObject *obj = internalArray->Item(position);
return obj;
}
// Get next item in the array for the iterator
hdObject *hdArrayDownIterator::Next()
{
hdObject *obj = internalArray->Item(position);
position--;
return obj;
}
// Return true if the array has more elements to return
bool hdArrayDownIterator::HasNext()
{
int size = internalArray->GetCount();
if( (size > 0) && (position <= (size - 1) && position >= 0) )
return true;
else
return false;
}
void hdArrayDownIterator::ResetIterator()
{
position = internalArray->GetCount() - 1;
}
|