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
|
/* -*- 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.
*
************************************************************************/
#include <modeltoviewhelper.hxx>
namespace ModelToViewHelper
{
/** Converts a model position into a view position
*/
sal_uInt32 ConvertToViewPosition( const ConversionMap* pMap, sal_uInt32 nModelPos )
{
sal_uInt32 nRet = nModelPos;
if ( !pMap )
return nRet;
// Search for entry behind nPos:
ConversionMap::const_iterator aIter;
for ( aIter = pMap->begin(); aIter != pMap->end(); ++aIter )
{
if ( (*aIter).first >= nModelPos )
{
const sal_uInt32 nPosModel = (*aIter).first;
const sal_uInt32 nPosExpand = (*aIter).second;
const sal_uInt32 nDistToNextModel = nPosModel - nModelPos;
nRet = nPosExpand - nDistToNextModel;
break;
}
}
return nRet;
}
/** Converts a view position into a model position
*/
ModelPosition ConvertToModelPosition( const ConversionMap* pMap, sal_uInt32 nViewPos )
{
ModelPosition aRet;
aRet.mnPos = nViewPos;
if ( !pMap )
return aRet;
// Search for entry behind nPos:
ConversionMap::const_iterator aIter;
for ( aIter = pMap->begin(); aIter != pMap->end(); ++aIter )
{
if ( (*aIter).second > nViewPos )
{
const sal_uInt32 nPosModel = (*aIter).first;
const sal_uInt32 nPosExpand = (*aIter).second;
// If nViewPos is in front of first field, we are finished.
if ( aIter == pMap->begin() )
break;
--aIter;
// nPrevPosModel is the field position
const sal_uInt32 nPrevPosModel = (*aIter).first;
const sal_uInt32 nPrevPosExpand = (*aIter).second;
const sal_uInt32 nLengthModel = nPosModel - nPrevPosModel;
const sal_uInt32 nLengthExpand = nPosExpand - nPrevPosExpand;
const sal_uInt32 nFieldLengthExpand = nLengthExpand - nLengthModel + 1;
const sal_uInt32 nFieldEndExpand = nPrevPosExpand + nFieldLengthExpand;
// Check if nPos is outside of field:
if ( nFieldEndExpand <= nViewPos )
{
// nPos is outside of field:
const sal_uInt32 nDistToField = nViewPos - nFieldEndExpand + 1;
aRet.mnPos = nPrevPosModel + nDistToField;
}
else
{
// nViewPos is inside a field:
aRet.mnPos = nPrevPosModel;
aRet.mnSubPos = nViewPos - nPrevPosExpand;
aRet.mbIsField = true;
}
break;
}
}
return aRet;
}
} // namespace ModelToViewStringConverter end
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
