1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
/* -*- 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 _BF_CONTNR_HXX
#define _BF_CONTNR_HXX
#include <tools/solar.h>
#include <limits.h>
namespace binfilter {
class CBlock;
// -------------
// - Container -
// -------------
// Maximale Blockgroesse
#define CONTAINER_MAXBLOCKSIZE ((sal_uInt16)0x3FF0)
#define CONTAINER_APPEND ULONG_MAX
#define CONTAINER_ENTRY_NOTFOUND ULONG_MAX
class Container
{
private:
CBlock* pFirstBlock;
CBlock* pCurBlock;
CBlock* pLastBlock;
sal_uInt16 nCurIndex;
sal_uInt16 nBlockSize;
sal_uInt16 nInitSize;
sal_uInt16 nReSize;
sal_uIntPtr nCount;
void ImpCopyContainer(Container const *);
#if defined DBG_UTIL
static char const * DbgCheckContainer(void const *);
#endif
protected:
#ifdef _BF_IMPCONT_HXX
void ImpInsert( void* p, CBlock* pBlock, sal_uInt16 nIndex );
void* ImpRemove( CBlock* pBlock, sal_uInt16 nIndex );
void* ImpGetObject( sal_uIntPtr nIndex ) const;
void** ImpGetOnlyNodes() const;
#endif
public:
Container( sal_uInt16 nBlockSize,
sal_uInt16 nInitSize,
sal_uInt16 nReSize );
Container( sal_uIntPtr nSize );
Container( const Container& rContainer );
~Container();
void Insert( void* p, sal_uIntPtr nIndex );
void* Remove( sal_uIntPtr nIndex );
void* Remove( void* p )
{ return Remove( GetPos( p ) ); }
void* Replace( void* p, sal_uIntPtr nIndex );
void* Replace( void* pNew, void* pOld )
{ return Replace( pNew, GetPos( pOld ) ); }
void SetSize( sal_uIntPtr nNewSize );
sal_uIntPtr GetSize() const { return nCount; }
sal_uIntPtr Count() const { return nCount; }
void Clear();
void* GetCurObject() const;
sal_uIntPtr GetCurPos() const;
void* GetObject( sal_uIntPtr nIndex ) const;
sal_uIntPtr GetPos( const void* p ) const;
void* Seek( sal_uIntPtr nIndex );
void* Seek( void* p ) { return Seek( GetPos( p ) ); }
void* First();
void* Last();
void* Next();
void* Prev();
Container& operator =( const Container& rContainer );
sal_Bool operator ==( const Container& rContainer ) const;
sal_Bool operator !=( const Container& rContainer ) const
{ return !(Container::operator==( rContainer )); }
};
}
#endif // _BF_CONTNR_HXX
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
