Hello, I have used this kind arrays for sorting:
Code:
RPointerArray<CResData> iArray;
// Returns positive value,
// if aLeft object has creater position, negative value if aRight
// object has creater position, and zero if positions are equal.
static TInt CResData::CompareItemPositions (const CResData& aLeft,const CResData& aRight)
{
return aLeft.iDesiredPosition - aRight.iDesiredPosition;
}
TLinearOrder<CResData> key CResData::CompareItemPositions);
CResData* item = CResData::NewL(position);
item->iDesiredPosition = 666;
User::LeaveIfError(iArray.InsertInOrderAllowRepeats (item,key));
// Now item is in place '1' but it will be in place 666 when there is all 3k items are added.
Br V.