|
|
|
// kmmsglist.cpp
|
|
|
|
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
#include <config.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "kmmsglist.h"
|
|
|
|
#include "kmmsgdict.h" // FIXME Till - move those into kmfolderindex
|
|
|
|
#include "kmkernel.h"
|
|
|
|
#include <assert.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
KMMsgList::KMMsgList(int initSize)
|
|
|
|
: TQMemArray<KMMsgBase*>(initSize),
|
|
|
|
mHigh( 0 ), mCount( 0 )
|
|
|
|
{
|
|
|
|
if ( size() > 0 )
|
|
|
|
for (unsigned int i=size(); i>0; i--)
|
|
|
|
TQMemArray<KMMsgBase*>::at(i-1) = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
KMMsgList::~KMMsgList()
|
|
|
|
{
|
|
|
|
clear(TRUE);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
void KMMsgList::clear(bool doDelete, bool syncDict)
|
|
|
|
{
|
|
|
|
if ( mHigh > 0 )
|
|
|
|
for (unsigned int i=mHigh; i>0; i--)
|
|
|
|
{
|
|
|
|
KMMsgBase * msg = at(i-1);
|
|
|
|
if (msg) {
|
|
|
|
if ( syncDict )
|
|
|
|
KMMsgDict::mutableInstance()->remove(msg);
|
|
|
|
at(i-1) = 0;
|
|
|
|
if (doDelete) delete msg;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
mHigh = 0;
|
|
|
|
mCount = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
bool KMMsgList::resize(unsigned int aSize)
|
|
|
|
{
|
|
|
|
unsigned int i, oldSize = size();
|
|
|
|
KMMsgBase* msg;
|
|
|
|
|
|
|
|
// 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 (!TQMemArray<KMMsgBase*>::resize(aSize)) return FALSE;
|
|
|
|
|
|
|
|
// initialize new elements
|
|
|
|
for (i=oldSize; i<aSize; i++)
|
|
|
|
at(i) = 0;
|
|
|
|
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
bool KMMsgList::reset(unsigned int aSize)
|
|
|
|
{
|
|
|
|
if (!resize(aSize)) return FALSE;
|
|
|
|
clear();
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
void KMMsgList::set(unsigned int idx, KMMsgBase* aMsg)
|
|
|
|
{
|
|
|
|
if (idx >= size())
|
|
|
|
resize( idx > 2 * size() ? idx + 16 : 2 * size() );
|
|
|
|
|
|
|
|
if (!at(idx) && aMsg) mCount++;
|
|
|
|
else if (at(idx) && !aMsg) mCount--;
|
|
|
|
|
|
|
|
at(idx) = aMsg;
|
|
|
|
|
|
|
|
if (!aMsg || idx >= mHigh) rethinkHigh();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
void KMMsgList::insert(unsigned int idx, KMMsgBase* aMsg, bool syncDict)
|
|
|
|
{
|
|
|
|
if (idx >= size())
|
|
|
|
resize( idx > 2 * size() ? idx + 16 : 2 * size() );
|
|
|
|
|
|
|
|
if (aMsg) mCount++;
|
|
|
|
|
|
|
|
for (unsigned int i=mHigh; i>idx; i--) {
|
|
|
|
if ( syncDict )
|
|
|
|
KMMsgDict::mutableInstance()->remove(at(i - 1));
|
|
|
|
at(i) = at(i-1);
|
|
|
|
if ( syncDict )
|
|
|
|
KMMsgDict::mutableInstance()->insert(at(i), i);
|
|
|
|
}
|
|
|
|
|
|
|
|
at(idx) = aMsg;
|
|
|
|
if ( syncDict )
|
|
|
|
KMMsgDict::mutableInstance()->insert(at(idx), idx);
|
|
|
|
|
|
|
|
mHigh++;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
unsigned int KMMsgList::append(KMMsgBase* aMsg, bool syncDict)
|
|
|
|
{
|
|
|
|
const unsigned int idx = mHigh;
|
|
|
|
insert(idx, aMsg, syncDict); // mHigh gets modified in here
|
|
|
|
return idx;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
void KMMsgList::remove(unsigned int idx)
|
|
|
|
{
|
|
|
|
assert(idx<size());
|
|
|
|
if (at(idx)) {
|
|
|
|
mCount--;
|
|
|
|
KMMsgDict::mutableInstance()->remove(at(idx));
|
|
|
|
}
|
|
|
|
|
|
|
|
mHigh--;
|
|
|
|
for (unsigned int i=idx; i<mHigh; i++) {
|
|
|
|
KMMsgDict::mutableInstance()->update(at(i + 1), i + 1, i);
|
|
|
|
at(i) = at(i+1);
|
|
|
|
}
|
|
|
|
|
|
|
|
at(mHigh) = 0;
|
|
|
|
|
|
|
|
rethinkHigh();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
KMMsgBase* KMMsgList::take(unsigned int idx)
|
|
|
|
{
|
|
|
|
KMMsgBase* msg=at(idx);
|
|
|
|
remove(idx);
|
|
|
|
return msg;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
void KMMsgList::rethinkHigh()
|
|
|
|
{
|
|
|
|
unsigned int sz = size();
|
|
|
|
|
|
|
|
if (mHigh < sz && at(mHigh))
|
|
|
|
{
|
|
|
|
// forward search
|
|
|
|
while (mHigh < sz && at(mHigh))
|
|
|
|
mHigh++;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// backward search
|
|
|
|
while (mHigh>0 && !at(mHigh-1))
|
|
|
|
mHigh--;
|
|
|
|
}
|
|
|
|
}
|