You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 

222 lines
4.3 KiB

// kmmsglist.cpp
#include "kmmsglist.h"
#include "kmmsgdict.h"
#include "kmkernel.h"
#include <assert.h>
#include <stdlib.h>
//-----------------------------------------------------------------------------
KMMsgList::KMMsgList(int initSize): KMMsgListInherited(initSize)
{
for (long int i=size()-1; i>=0; i--)
KMMsgListInherited::at(i) = 0;
mHigh = 0;
mCount = 0;
}
//-----------------------------------------------------------------------------
KMMsgList::~KMMsgList()
{
clear(TRUE);
}
//-----------------------------------------------------------------------------
void KMMsgList::clear(bool doDelete, bool syncDict)
{
KMMsgBase* msg = 0;
long i;
KMMsgDict *dict = 0;
if (syncDict)
dict = kernel->msgDict();
for (i=mHigh-1; i>=0; i--)
{
msg = at(i);
if (msg) {
if (dict)
dict->remove(msg);
KMMsgListInherited::at(i) = 0;
if (doDelete) delete msg;
}
}
mHigh = 0;
mCount = 0;
}
//-----------------------------------------------------------------------------
bool KMMsgList::resize(int aSize)
{
int i, oldSize = size();
KMMsgBase* msg;
assert(aSize>=0);
// delete messages that will get lost, if any
if (aSize < mHigh)
{
for (i=aSize; i<mHigh; i++)
{
msg = at(i);
if (msg)
{
delete msg;
mCount--;
}
mHigh = aSize;
}
}
// do the resizing
if (!KMMsgListInherited::resize(aSize)) return FALSE;
// initialize new elements
for (i=oldSize; i<aSize; i++)
KMMsgListInherited::at(i) = 0;
return TRUE;
}
//-----------------------------------------------------------------------------
bool KMMsgList::reset(int aSize)
{
if (!resize(aSize)) return FALSE;
clear();
return TRUE;
}
//-----------------------------------------------------------------------------
void KMMsgList::set(int idx, KMMsgBase* aMsg)
{
int doubleSize;
assert(idx>=0);
if (idx >= size())
{
doubleSize = size() << 1;
resize(idx>doubleSize ? idx+16 : doubleSize);
}
if (!at(idx) && aMsg) mCount++;
else if (at(idx) && !aMsg) mCount--;
delete at(idx);
KMMsgListInherited::at(idx) = aMsg;
if (!aMsg || idx >= mHigh) rethinkHigh();
}
//-----------------------------------------------------------------------------
void KMMsgList::insert(int idx, KMMsgBase* aMsg, bool syncDict)
{
int i, doubleSize;
assert(idx>=0);
KMMsgDict *dict = 0;
if (syncDict)
dict = kernel->msgDict();
if (idx >= size())
{
doubleSize = size() << 1;
resize(idx>doubleSize ? idx+16 : doubleSize);
}
if (aMsg) mCount++;
for (i=mHigh; i>idx; i--) {
if (dict)
dict->remove(at(i - 1));
KMMsgListInherited::at(i) = KMMsgListInherited::at(i-1);
if (dict)
dict->insert(at(i), i);
}
KMMsgListInherited::at(idx) = aMsg;
if (dict)
dict->insert(at(idx), idx);
mHigh++;
}
//-----------------------------------------------------------------------------
int KMMsgList::append(KMMsgBase* aMsg, bool syncDict)
{
int idx = mHigh;
insert(idx, aMsg, syncDict); // mHigh gets modified in here
return idx;
}
//-----------------------------------------------------------------------------
void KMMsgList::remove(int idx)
{
int i;
assert(idx>=0 && idx<size());
KMMsgDict *dict = kernel->msgDict();
if (KMMsgListInherited::at(idx)) {
mCount--;
if (dict)
dict->remove(at(idx));
}
mHigh--;
for (i=idx; i<mHigh; i++) {
if (dict)
dict->update(at(i + 1), i + 1, i);
KMMsgListInherited::at(i) = KMMsgListInherited::at(i+1);
}
KMMsgListInherited::at(mHigh) = 0;
rethinkHigh();
}
//-----------------------------------------------------------------------------
KMMsgBase* KMMsgList::take(int idx)
{
KMMsgBase* msg=at(idx);
remove(idx);
return msg;
}
//-----------------------------------------------------------------------------
void KMMsgList::rethinkHigh(void)
{
int sz = (int)size();
if (mHigh < sz && at(mHigh))
{
// forward search
while (mHigh < sz && at(mHigh))
mHigh++;
}
else
{
// backward search
while (mHigh>0 && !at(mHigh-1))
mHigh--;
}
}
//-----------------------------------------------------------------------------
void KMMsgList::fillMsgDict(KMMsgDict *dict)
{
for (int idx = 0; idx < mHigh; idx++)
if (at(idx))
dict->insert(0, at(idx), idx);
}