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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#ifdef _MSC_VER
#pragma hdrstop
#endif
#include <vector>
#include <map>
#include "stylepool.hxx"
#include <bf_svtools/itemiter.hxx>
#include <bf_svtools/itempool.hxx>
using namespace boost;
namespace binfilter
{
// A "Node" represents a subset of inserted SfxItemSets
// The root node represents the empty set
// The other nodes contain a SfxPoolItem and represents an item set which contains their
// pool item and the pool items of their parents.
class Node
{
std::vector<Node*> mChildren; // child nodes, create by findChildNode(..)
std::vector< StylePool::SfxItemSet_Pointer_t > aItemSet; // shared pointer an inserted item set or nul
const SfxPoolItem *pItem; // my pool item
Node *pUpper; // if I'm a child node that's my parent node
public:
Node() : pItem( 0 ), pUpper( 0 ) {} // root node Ctor
Node( const SfxPoolItem& rItem, Node* pParent ) : // child node Ctor
pItem( rItem.Clone() ), pUpper( pParent ){}
~Node();
bool hasItemSet() const { return 0 < !aItemSet.empty(); }
const StylePool::SfxItemSet_Pointer_t getItemSet() const { return aItemSet[aItemSet.size()-1]; }
void setItemSet( const SfxItemSet& rSet ){ aItemSet.push_back( StylePool::SfxItemSet_Pointer_t( rSet.Clone() ) ); }
Node* findChildNode( const SfxPoolItem& rItem );
Node* nextItemSet( Node* pLast );
const SfxPoolItem& getPoolItem() const { return *pItem; }
};
Node* Node::findChildNode( const SfxPoolItem& rItem )
{
Node* pNextNode = this;
std::vector<Node*>::iterator aIter = mChildren.begin();
while( aIter != mChildren.end() )
{
if( rItem.Which() == (*aIter)->getPoolItem().Which() &&
rItem == (*aIter)->getPoolItem() )
return *aIter;
++aIter;
}
pNextNode = new Node( rItem, pNextNode );
mChildren.push_back( pNextNode );
return pNextNode;
}
/* Find the next node which has a SfxItemSet.
The input parameter pLast has a sophisticated meaning:
downstairs only:
pLast == 0 => scan your children and their children
but neither your parents neither your siblings
downstairs and upstairs:
pLast == this => scan your children, their children,
the children of your parent behind you, and so on
partial downstairs and upstairs
pLast != 0 && pLast != this => scan your children behind the given children,
the children of your parent behind you and so on.
*/
Node* Node::nextItemSet( Node* pLast )
{
// Searching downstairs
std::vector<Node*>::iterator aIter = mChildren.begin();
// For pLast == 0 and pLast == this all children are of interest
// for another pLast the search starts behind pLast...
if( pLast && pLast != this )
{
aIter = std::find( mChildren.begin(), mChildren.end(), pLast );
if( aIter != mChildren.end() )
++aIter;
}
Node *pNext = 0;
while( aIter != mChildren.end() )
{
pNext = *aIter;
if( pNext->hasItemSet() ) // any child with item set?
return pNext;
pNext = pNext->nextItemSet( 0 ); // 0 => downstairs only
if( pNext )
return pNext;
++aIter;
}
// Searching upstairs
if( pLast && pUpper )
pNext = pUpper->nextItemSet( this );
return pNext;
}
Node::~Node()
{
std::vector<Node*>::iterator aIter = mChildren.begin();
while( aIter != mChildren.end() )
{
delete *aIter;
++aIter;
}
delete pItem;
}
class Iterator : public IStylePoolIteratorAccess
{
std::map< const SfxItemSet*, Node >& rRoot;
std::map< const SfxItemSet*, Node >::iterator pCurrNode;
Node* pNode;
public:
Iterator( std::map< const SfxItemSet*, Node >& rR )
: rRoot( rR ), pCurrNode( rR.begin() ), pNode(0) {}
virtual StylePool::SfxItemSet_Pointer_t getNext();
virtual ::rtl::OUString getName();
};
StylePool::SfxItemSet_Pointer_t Iterator::getNext()
{
StylePool::SfxItemSet_Pointer_t pReturn;
while( pNode || pCurrNode != rRoot.end() )
{
if( !pNode )
{
pNode = &pCurrNode->second;
++pCurrNode;
if( pNode->hasItemSet() )
return pNode->getItemSet();
}
pNode = pNode->nextItemSet( pNode );
if( pNode && pNode->hasItemSet() )
return pNode->getItemSet();
}
return pReturn;
}
::rtl::OUString Iterator::getName()
{
::rtl::OUString aString;
if( pNode && pNode->hasItemSet() )
aString = StylePool::nameOf( pNode->getItemSet() );
return aString;
}
/* This static method creates a unique name from a shared pointer to a SfxItemSet
The name is the memory address of the SfxItemSet itself. */
::rtl::OUString StylePool::nameOf( SfxItemSet_Pointer_t pSet )
{
return ::rtl::OUString::valueOf( reinterpret_cast<sal_IntPtr>( pSet.get() ), 16 );
}
// class StylePoolImpl organized a tree-structure where every node represents a SfxItemSet.
// The insertItemSet method adds a SfxItemSet into the tree if necessary and returns a shared_ptr
// to a copy of the SfxItemSet.
// The aRoot-Node represents an empty SfxItemSet.
class StylePoolImpl
{
private:
std::map< const SfxItemSet*, Node > aRoot;
sal_Int32 nCount;
public:
StylePoolImpl() : nCount(0) {}
StylePool::SfxItemSet_Pointer_t insertItemSet( const SfxItemSet& rSet );
IStylePoolIteratorAccess* createIterator();
sal_Int32 getCount() const { return nCount; }
};
StylePool::SfxItemSet_Pointer_t StylePoolImpl::insertItemSet( const SfxItemSet& rSet )
{
bool bNonPoolable = false;
Node* pCurNode = &aRoot[ rSet.GetParent() ];
SfxItemIter aIter( rSet );
const SfxPoolItem* pItem = aIter.GetCurItem();
// Every SfxPoolItem in the SfxItemSet causes a step deeper into the tree,
// a complete empty SfxItemSet would stay at the root node.
while( pItem )
{
if( !rSet.GetPool()->IsItemFlag(pItem->Which(), SFX_ITEM_POOLABLE ) )
bNonPoolable = true;
pCurNode = pCurNode->findChildNode( *pItem );
pItem = aIter.NextItem();
}
// Every leaf node represents an inserted item set, but "non-leaf" nodes represents subsets
// of inserted itemsets.
// These nodes could have but does not need to have a shared_ptr to a item set.
if( !pCurNode->hasItemSet() )
{
pCurNode->setItemSet( rSet );
bNonPoolable = false; // to avoid a double insertion
++nCount;
}
// If rSet contains at least one non poolable item, a new itemset has to be inserted
if( bNonPoolable )
pCurNode->setItemSet( rSet );
#ifdef DEBUG
{
sal_Int32 nCheck = -1;
IStylePoolIteratorAccess* pIter = createIterator();
StylePool::SfxItemSet_Pointer_t pTemp;
do
{
++nCheck;
pTemp = pIter->getNext();
} while( pTemp.get() );
DBG_ASSERT( nCount == nCheck, "Wrong counting");
delete pIter;
}
#endif
return pCurNode->getItemSet();
}
IStylePoolIteratorAccess* StylePoolImpl::createIterator()
{ return new Iterator( aRoot ); }
// Ctor, Dtor and redirected methods of class StylePool, nearly inline ;-)
StylePool::SfxItemSet_Pointer_t StylePool::insertItemSet( const SfxItemSet& rSet )
{ return pImpl->insertItemSet( rSet ); }
IStylePoolIteratorAccess* StylePool::createIterator()
{ return pImpl->createIterator(); }
sal_Int32 StylePool::getCount() const
{ return pImpl->getCount(); }
StylePool::~StylePool() { delete pImpl; }
// End of class StylePool
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
