LibreOffice Module sw (master)  1
bparr.hxx
Go to the documentation of this file.
1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 /*
3  * This file is part of the LibreOffice project.
4  *
5  * This Source Code Form is subject to the terms of the Mozilla Public
6  * License, v. 2.0. If a copy of the MPL was not distributed with this
7  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
8  *
9  * This file incorporates work covered by the following license notice:
10  *
11  * Licensed to the Apache Software Foundation (ASF) under one or more
12  * contributor license agreements. See the NOTICE file distributed
13  * with this work for additional information regarding copyright
14  * ownership. The ASF licenses this file to you under the Apache
15  * License, Version 2.0 (the "License"); you may not use this file
16  * except in compliance with the License. You may obtain a copy of
17  * the License at http://www.apache.org/licenses/LICENSE-2.0 .
18  */
19 
20 #ifndef INCLUDED_SW_INC_BPARR_HXX
21 #define INCLUDED_SW_INC_BPARR_HXX
22 
23 #include <assert.h>
24 
25 #include <tools/solar.h>
26 #include "swdllapi.h"
27 #include <array>
28 #include <memory>
29 
30 struct BlockInfo;
31 class BigPtrArray;
32 
34 {
35  friend class BigPtrArray;
37  sal_uInt16 m_nOffset;
38 public:
39  BigPtrEntry() : m_pBlock(nullptr), m_nOffset(0) {}
40  virtual ~BigPtrEntry() {}
41 
42  inline sal_uLong GetPos() const;
43  inline BigPtrArray& GetArray() const;
44 };
45 
46 // 1000 entries per Block = a bit less than 4K
47 #define MAXENTRY 1000
48 
49 // number of entries that may remain free during compression
50 // this value is for the worst case; because we defined MAXBLOCK with ca 25%
51 // overhead, 80% = 800 entries are enough
52 // if complete compression is desired, 100 has to be specified
53 #define COMPRESSLVL 80
54 
55 struct BlockInfo final
56 {
58  std::array<BigPtrEntry*, MAXENTRY>
61  sal_uInt16 nElem;
62 };
63 
65 {
66 protected:
67  std::unique_ptr<BlockInfo*[]>
70  sal_uInt16 m_nMaxBlock;
71  sal_uInt16 m_nBlock;
72  mutable
73  sal_uInt16 m_nCur;
74 
75  sal_uInt16 Index2Block( sal_uLong ) const;
76  BlockInfo* InsBlock( sal_uInt16 );
77  void BlockDel( sal_uInt16 );
78  void UpdIndex( sal_uInt16 );
79 
80  // fill all blocks
81  sal_uInt16 Compress();
82 
83 public:
84  BigPtrArray();
85  ~BigPtrArray();
86 
87  sal_uLong Count() const { return m_nSize; }
88 
89  void Insert( BigPtrEntry* p, sal_uLong pos );
90  void Remove( sal_uLong pos, sal_uLong n = 1 );
91  void Move( sal_uLong from, sal_uLong to );
92  void Replace( sal_uLong pos, BigPtrEntry* p);
93 
94  BigPtrEntry* operator[]( sal_uLong ) const;
95 };
96 
98 {
99  assert(this == m_pBlock->mvData[ m_nOffset ]); // element not in the block
100  return m_pBlock->nStart + m_nOffset;
101 }
102 
104 {
105  return *m_pBlock->pBigArr;
106 }
107 
108 #endif
109 
110 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */
sal_uInt16 m_nCur
last used block
Definition: bparr.hxx:73
BlockInfo * m_pBlock
Definition: bparr.hxx:36
sal_uIntPtr sal_uLong
BigPtrArray * pBigArr
in this array the block is located
Definition: bparr.hxx:57
sal_uInt16 m_nOffset
Definition: bparr.hxx:37
sal_uInt16 nElem
number of elements
Definition: bparr.hxx:61
sal_uInt16 m_nBlock
number of blocks
Definition: bparr.hxx:71
sal_uLong m_nSize
number of elements
Definition: bparr.hxx:69
BigPtrEntry()
Definition: bparr.hxx:39
sal_uLong Count() const
Definition: bparr.hxx:87
sal_uLong nStart
Definition: bparr.hxx:60
std::unique_ptr< BlockInfo *[]> m_ppInf
block info
Definition: bparr.hxx:68
sal_uInt16 m_nMaxBlock
current max. number of blocks
Definition: bparr.hxx:70
std::array< BigPtrEntry *, MAXENTRY > mvData
data block
Definition: bparr.hxx:59
#define SW_DLLPUBLIC
Definition: swdllapi.h:28
virtual ~BigPtrEntry()
Definition: bparr.hxx:40
sal_uLong nEnd
start- and end index
Definition: bparr.hxx:60
sal_uLong GetPos() const
Definition: bparr.hxx:97
BigPtrArray & GetArray() const
Definition: bparr.hxx:103