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
|
/* -*- 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/itemset.hxx>
#include <svl/whiter.hxx>
SfxWhichIter::SfxWhichIter(const SfxItemSet& rSet)
: m_rItemSet(rSet)
, m_pCurrentWhichPair(rSet.m_pWhichRanges.begin())
, m_nOffsetFromStartOfCurrentWhichPair(0)
, m_nItemsOffset(0)
{
}
sal_uInt16 SfxWhichIter::GetCurWhich() const
{
const WhichRangesContainer& rWhichRanges = m_rItemSet.m_pWhichRanges;
if (m_pCurrentWhichPair >= (rWhichRanges.begin() + rWhichRanges.size()))
return 0;
return m_pCurrentWhichPair->first + m_nOffsetFromStartOfCurrentWhichPair;
}
sal_uInt16 SfxWhichIter::NextWhich()
{
const WhichRangesContainer& rWhichRanges = m_rItemSet.m_pWhichRanges;
if (m_pCurrentWhichPair >= (rWhichRanges.begin() + rWhichRanges.size()))
return 0;
const sal_uInt16 nLastWhich = m_pCurrentWhichPair->first + m_nOffsetFromStartOfCurrentWhichPair;
++m_nOffsetFromStartOfCurrentWhichPair;
if (m_pCurrentWhichPair->second == nLastWhich)
{
m_nItemsOffset += m_pCurrentWhichPair->second - m_pCurrentWhichPair->first + 1;
++m_pCurrentWhichPair;
m_nOffsetFromStartOfCurrentWhichPair = 0;
}
if (m_pCurrentWhichPair >= (rWhichRanges.begin() + rWhichRanges.size()))
return 0;
return m_pCurrentWhichPair->first + m_nOffsetFromStartOfCurrentWhichPair;
}
sal_uInt16 SfxWhichIter::FirstWhich()
{
m_pCurrentWhichPair = m_rItemSet.m_pWhichRanges.begin();
m_nOffsetFromStartOfCurrentWhichPair = 0;
m_nItemsOffset = 0;
return m_pCurrentWhichPair->first;
}
SfxItemState SfxWhichIter::GetItemState(bool bSrchInParent, const SfxPoolItem** ppItem) const
{
const sal_uInt16 nOffset(m_nItemsOffset + m_nOffsetFromStartOfCurrentWhichPair);
// we have the offset, so use it to profit. It is always valid, so no need
// to check if smaller than TotalCount()
SfxItemState eState(m_rItemSet.GetItemState_ForOffset(nOffset, ppItem));
// search in parent?
if (bSrchInParent && nullptr != m_rItemSet.GetParent() && (SfxItemState::UNKNOWN == eState || SfxItemState::DEFAULT == eState))
{
// nOffset was only valid for *local* SfxItemSet, need to continue with WhichID
// Use the *highest* SfxItemState as result
const sal_uInt16 nWhich(m_pCurrentWhichPair->first + m_nOffsetFromStartOfCurrentWhichPair);
return m_rItemSet.GetParent()->GetItemState_ForWhichID( eState, nWhich, true, ppItem);
}
return eState;
}
void SfxWhichIter::ClearItem()
{
// we have the offset, so use it to profit. It is always valid, so no need
// to check if smaller than TotalCount()
const_cast<SfxItemSet&>(m_rItemSet).ClearSingleItem_ForOffset(m_nItemsOffset + m_nOffsetFromStartOfCurrentWhichPair);
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
