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
|
/* -*- 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 .
*/
#include <svl/itemiter.hxx>
#include <svl/whiter.hxx>
#include "shellio.hxx"
#include "wrt_fn.hxx"
#include "node.hxx"
#include "format.hxx"
Writer& Out( const SwAttrFnTab pTab, const SfxPoolItem& rHt, Writer & rWrt )
{
sal_uInt16 nId = rHt.Which();
OSL_ENSURE( nId < POOLATTR_END && nId >= POOLATTR_BEGIN, "SwAttrFnTab::Out()" );
FnAttrOut pOut;
if( 0 != ( pOut = pTab[ nId - RES_CHRATR_BEGIN] ))
(*pOut)( rWrt, rHt );
return rWrt;
}
Writer& Out_SfxItemSet( const SwAttrFnTab pTab, Writer& rWrt,
const SfxItemSet& rSet, bool bDeep,
bool bTstForDefault )
{
// at first give the own attributes out
const SfxItemPool& rPool = *rSet.GetPool();
const SfxItemSet* pSet = &rSet;
if( !pSet->Count() ) // Optimizing - empty Sets
{
if( !bDeep )
return rWrt;
while( 0 != ( pSet = pSet->GetParent() ) && !pSet->Count() )
;
if( !pSet )
return rWrt;
}
const SfxPoolItem* pItem(0);
FnAttrOut pOut;
if( !bDeep || !pSet->GetParent() )
{
OSL_ENSURE( rSet.Count(), "It has been handled already, right?" );
SfxItemIter aIter( *pSet );
pItem = aIter.GetCurItem();
do {
// pTab only covers POOLATTR_BEGIN..POOLATTR_END.
if( pItem->Which() <= POOLATTR_END && 0 != ( pOut = pTab[ pItem->Which() - RES_CHRATR_BEGIN] ))
(*pOut)( rWrt, *pItem );
} while( !aIter.IsAtEnd() && 0 != ( pItem = aIter.NextItem() ) );
}
else
{
SfxWhichIter aIter( *pSet );
sal_uInt16 nWhich = aIter.FirstWhich();
while( nWhich )
{
if( SfxItemState::SET == pSet->GetItemState( nWhich, bDeep, &pItem ) &&
( !bTstForDefault || (
*pItem != rPool.GetDefaultItem( nWhich )
|| ( pSet->GetParent() &&
*pItem != pSet->GetParent()->Get( nWhich ))
)) && 0 != ( pOut = pTab[ nWhich - RES_CHRATR_BEGIN] ))
(*pOut)( rWrt, *pItem );
nWhich = aIter.NextWhich();
}
}
return rWrt;
}
Writer& Out( const SwNodeFnTab pTab, SwNode& rNode, Writer & rWrt )
{
// It must be a CntntNode!
SwCntntNode * pCNd = rNode.GetCntntNode();
if( !pCNd )
return rWrt;
sal_uInt16 nId = RES_TXTNODE;
switch (pCNd->GetNodeType())
{
case ND_TEXTNODE:
nId = RES_TXTNODE;
break;
case ND_GRFNODE:
nId = RES_GRFNODE;
break;
case ND_OLENODE:
nId = RES_OLENODE;
break;
default:
OSL_FAIL("What kind of node is it now?");
break;
}
FnNodeOut pOut;
if( 0 != ( pOut = pTab[ nId - RES_NODE_BEGIN ] ))
(*pOut)( rWrt, *pCNd );
return rWrt;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
