162 lines
5.1 KiB
C++
162 lines
5.1 KiB
C++
/*************************************************************************
|
||
*
|
||
* $RCSfile: bparr.hxx,v $
|
||
*
|
||
* $Revision: 1.2 $
|
||
*
|
||
* last change: $Author: obo $ $Date: 2004-08-12 12:00:08 $
|
||
*
|
||
* The Contents of this file are made available subject to the terms of
|
||
* either of the following licenses
|
||
*
|
||
* - GNU Lesser General Public License Version 2.1
|
||
* - Sun Industry Standards Source License Version 1.1
|
||
*
|
||
* Sun Microsystems Inc., October, 2000
|
||
*
|
||
* GNU Lesser General Public License Version 2.1
|
||
* =============================================
|
||
* Copyright 2000 by Sun Microsystems, Inc.
|
||
* 901 San Antonio Road, Palo Alto, CA 94303, USA
|
||
*
|
||
* This library is free software; you can redistribute it and/or
|
||
* modify it under the terms of the GNU Lesser General Public
|
||
* License version 2.1, as published by the Free Software Foundation.
|
||
*
|
||
* This library is distributed in the hope that it will be useful,
|
||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||
* Lesser General Public License for more details.
|
||
*
|
||
* You should have received a copy of the GNU Lesser General Public
|
||
* License along with this library; if not, write to the Free Software
|
||
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
|
||
* MA 02111-1307 USA
|
||
*
|
||
*
|
||
* Sun Industry Standards Source License Version 1.1
|
||
* =================================================
|
||
* The contents of this file are subject to the Sun Industry Standards
|
||
* Source License Version 1.1 (the "License"); You may not use this file
|
||
* except in compliance with the License. You may obtain a copy of the
|
||
* License at http://www.openoffice.org/license.html.
|
||
*
|
||
* Software provided under this License is provided on an "AS IS" basis,
|
||
* WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
|
||
* WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
|
||
* MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
|
||
* See the License for the specific provisions governing your rights and
|
||
* obligations concerning the Software.
|
||
*
|
||
* The Initial Developer of the Original Code is: Sun Microsystems, Inc.
|
||
*
|
||
* Copyright: 2000 by Sun Microsystems, Inc.
|
||
*
|
||
* All Rights Reserved.
|
||
*
|
||
* Contributor(s): _______________________________________
|
||
*
|
||
*
|
||
************************************************************************/
|
||
|
||
#ifndef _BPARR_HXX
|
||
#define _BPARR_HXX
|
||
|
||
#ifndef _SOLAR_H
|
||
#include <tools/solar.h>
|
||
#endif
|
||
#ifndef _DEBUG_HXX //autogen
|
||
#include <tools/debug.hxx>
|
||
#endif
|
||
|
||
struct BlockInfo;
|
||
class BigPtrArray;
|
||
|
||
class BigPtrEntry
|
||
{
|
||
friend class BigPtrArray;
|
||
BlockInfo* pBlock;
|
||
USHORT nOffset;
|
||
protected:
|
||
BigPtrEntry() : pBlock(0), nOffset(0) {}
|
||
virtual ~BigPtrEntry() {}
|
||
|
||
inline ULONG GetPos() const;
|
||
inline BigPtrArray& GetArray() const;
|
||
};
|
||
typedef BigPtrEntry* ElementPtr;
|
||
|
||
|
||
typedef BOOL (*FnForEach)( const ElementPtr&, void* pArgs );
|
||
|
||
// 1000 Eintr<74>ge pro Block = etwas weniger als 4K
|
||
#define MAXENTRY 1000
|
||
|
||
|
||
// Anzahl Eintraege, die bei der Kompression frei bleiben duerfen
|
||
// dieser Wert ist fuer den Worst Case, da wir MAXBLOCK mit ca 25%
|
||
// Overhead definiert haben, reichen 80% = 800 Eintraege vollkommen aus
|
||
// Will mann voellige Kompression haben, muss eben 100 angegeben werden.
|
||
|
||
#define COMPRESSLVL 80
|
||
|
||
struct BlockInfo { // Block-Info:
|
||
BigPtrArray* pBigArr; // in diesem Array steht der Block
|
||
ElementPtr* pData; // Datenblock
|
||
ULONG nStart, nEnd; // Start- und EndIndex
|
||
USHORT nElem; // Anzahl Elemente
|
||
};
|
||
|
||
class BigPtrArray
|
||
{
|
||
BlockInfo** ppInf; // Block-Infos
|
||
ULONG nSize; // Anzahl Elemente
|
||
USHORT nMaxBlock; // akt. max Anzahl Bloecke
|
||
USHORT nBlock; // Anzahl Bloecke
|
||
USHORT nCur; // letzter Block
|
||
|
||
USHORT Index2Block( ULONG ) const; // Blocksuche
|
||
BlockInfo* InsBlock( USHORT ); // Block einfuegen
|
||
void BlockDel( USHORT ); // es wurden Bloecke geloescht
|
||
void UpdIndex( USHORT ); // Indexe neu berechnen
|
||
|
||
protected:
|
||
// fuelle alle Bloecke auf.
|
||
// Der short gibt in Prozent an, wie voll die Bloecke werden sollen.
|
||
// Der ReturnWert besagt, das irgendetwas "getan" wurde
|
||
USHORT Compress( short = COMPRESSLVL );
|
||
|
||
public:
|
||
BigPtrArray();
|
||
~BigPtrArray();
|
||
|
||
ULONG Count() const { return nSize; }
|
||
|
||
void Insert( const ElementPtr& r, ULONG pos );
|
||
void Remove( ULONG pos, ULONG n = 1 );
|
||
void Move( ULONG from, ULONG to );
|
||
void Replace( ULONG pos, const ElementPtr& r);
|
||
|
||
ElementPtr operator[]( ULONG ) const;
|
||
void ForEach( FnForEach fn, void* pArgs = NULL )
|
||
{
|
||
ForEach( 0, nSize, fn, pArgs );
|
||
}
|
||
void ForEach( ULONG nStart, ULONG nEnd, FnForEach fn, void* pArgs = NULL );
|
||
};
|
||
|
||
|
||
|
||
inline ULONG BigPtrEntry::GetPos() const
|
||
{
|
||
DBG_ASSERT( this == pBlock->pData[ nOffset ], "Element nicht im Block" );
|
||
return pBlock->nStart + nOffset;
|
||
}
|
||
|
||
inline BigPtrArray& BigPtrEntry::GetArray() const
|
||
{
|
||
return *pBlock->pBigArr;
|
||
}
|
||
|
||
|
||
#endif
|