d7b48d03e1
Change-Id: I5ba15eaa82479aa68b98ce4dcd7827f31b239c98 Reviewed-on: https://gerrit.libreoffice.org/5139 Reviewed-by: Luboš Luňák <l.lunak@suse.cz> Tested-by: Luboš Luňák <l.lunak@suse.cz>
121 lines
3.6 KiB
C++
121 lines
3.6 KiB
C++
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
|
/*
|
|
* This file is part of the LibreOffice project.
|
|
*
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
|
*
|
|
* This file incorporates work covered by the following license notice:
|
|
*
|
|
* Licensed to the Apache Software Foundation (ASF) under one or more
|
|
* contributor license agreements. See the NOTICE file distributed
|
|
* with this work for additional information regarding copyright
|
|
* ownership. The ASF licenses this file to you under the Apache
|
|
* License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0 .
|
|
*/
|
|
|
|
#ifndef SW_BPARR_HXX
|
|
#define SW_BPARR_HXX
|
|
|
|
#include <assert.h>
|
|
|
|
#include <tools/solar.h>
|
|
#include <swdllapi.h>
|
|
|
|
struct BlockInfo;
|
|
class BigPtrArray;
|
|
|
|
class BigPtrEntry
|
|
{
|
|
friend class BigPtrArray;
|
|
BlockInfo* pBlock;
|
|
sal_uInt16 nOffset;
|
|
public:
|
|
virtual ~BigPtrEntry() {}
|
|
protected:
|
|
BigPtrEntry() : pBlock(0), nOffset(0) {}
|
|
|
|
inline sal_uLong GetPos() const;
|
|
inline BigPtrArray& GetArray() const;
|
|
};
|
|
typedef BigPtrEntry* ElementPtr;
|
|
|
|
|
|
typedef bool (*FnForEach)( const ElementPtr&, void* pArgs );
|
|
|
|
// 1000 entries per Block = a bit less then 4K
|
|
#define MAXENTRY 1000
|
|
|
|
|
|
// number of entries that may remain free during compression
|
|
// this value is for the worst case; because we defined MAXBLOCK with ca 25%
|
|
// overhead, 80% = 800 entries are enough
|
|
// if complete compression is desired, 100 has to be specified
|
|
#define COMPRESSLVL 80
|
|
|
|
struct BlockInfo { // block info:
|
|
BigPtrArray* pBigArr; ///< in this array the block is located
|
|
ElementPtr* pData; ///< data block
|
|
sal_uLong nStart, nEnd; ///< start- and end index
|
|
sal_uInt16 nElem; ///< number of elements
|
|
};
|
|
|
|
class SW_DLLPUBLIC BigPtrArray
|
|
{
|
|
BlockInfo** ppInf; // block info
|
|
sal_uLong nSize; ///< number of elements
|
|
sal_uInt16 nMaxBlock; ///< current max. number of blocks
|
|
sal_uInt16 nBlock; ///< number of blocks
|
|
mutable
|
|
sal_uInt16 nCur; ///< last used block
|
|
|
|
sal_uInt16 Index2Block( sal_uLong ) const; ///< block search
|
|
BlockInfo* InsBlock( sal_uInt16 ); ///< insert block
|
|
void BlockDel( sal_uInt16 ); ///< some blocks were deleted
|
|
void UpdIndex( sal_uInt16 ); ///< recalculate indices
|
|
|
|
protected:
|
|
// fill all blocks
|
|
// the short parameter specifies in percent, how full the blocks should be
|
|
// made
|
|
sal_uInt16 Compress( short = COMPRESSLVL );
|
|
|
|
public:
|
|
BigPtrArray();
|
|
~BigPtrArray();
|
|
|
|
sal_uLong Count() const { return nSize; }
|
|
|
|
void Insert( const ElementPtr& r, sal_uLong pos );
|
|
void Remove( sal_uLong pos, sal_uLong n = 1 );
|
|
void Move( sal_uLong from, sal_uLong to );
|
|
void Replace( sal_uLong pos, const ElementPtr& r);
|
|
|
|
ElementPtr operator[]( sal_uLong ) const;
|
|
void ForEach( FnForEach fn, void* pArgs = NULL )
|
|
{
|
|
ForEach( 0, nSize, fn, pArgs );
|
|
}
|
|
void ForEach( sal_uLong nStart, sal_uLong nEnd, FnForEach fn, void* pArgs = NULL );
|
|
};
|
|
|
|
|
|
|
|
inline sal_uLong BigPtrEntry::GetPos() const
|
|
{
|
|
assert(this == pBlock->pData[ nOffset ]); // element not in the block
|
|
return pBlock->nStart + nOffset;
|
|
}
|
|
|
|
inline BigPtrArray& BigPtrEntry::GetArray() const
|
|
{
|
|
return *pBlock->pBigArr;
|
|
}
|
|
|
|
|
|
#endif
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|