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 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338
|
/* -*- 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 <tools/multisel.hxx>
#include <doc.hxx>
#include <IMark.hxx>
#include <fldbas.hxx>
#include <fmtfld.hxx>
#include <fmtftn.hxx>
#include <modeltoviewhelper.hxx>
#include <ndtxt.hxx>
#include <pam.hxx>
#include <txatbase.hxx>
#include <txtfld.hxx>
#include <txtftn.hxx>
#include <scriptinfo.hxx>
#include <set>
#include <vector>
struct FieldResult
{
sal_Int32 m_nFieldPos;
OUString m_sExpand;
enum { NONE, FIELD, FOOTNOTE } m_eType;
explicit FieldResult(sal_Int32 const nPos)
: m_nFieldPos(nPos), m_eType(NONE)
{ }
};
class sortfieldresults :
public std::binary_function<const FieldResult&, const FieldResult&, bool>
{
public:
bool operator()(const FieldResult &rOne, const FieldResult &rTwo) const
{
return rOne.m_nFieldPos < rTwo.m_nFieldPos;
}
};
typedef std::set<FieldResult, sortfieldresults> FieldResultSet;
struct block
{
sal_Int32 m_nStart;
sal_Int32 m_nLen;
bool m_bVisible;
FieldResultSet m_aAttrs;
block(sal_Int32 nStart, sal_Int32 nLen, bool bVisible)
: m_nStart(nStart), m_nLen(nLen), m_bVisible(bVisible)
{
}
};
struct containsPos
{
const sal_Int32 m_nPos;
explicit containsPos(const sal_Int32 nPos)
: m_nPos(nPos)
{
}
bool operator() (const block& rIn) const
{
return m_nPos >= rIn.m_nStart && m_nPos < rIn.m_nStart + rIn.m_nLen;
}
};
ModelToViewHelper::ModelToViewHelper(const SwTextNode &rNode, ExpandMode eMode)
{
const OUString& rNodeText = rNode.GetText();
m_aRetText = rNodeText;
if (eMode == ExpandMode::PassThrough)
return;
Range aRange( 0, rNodeText.isEmpty() ? 0 : rNodeText.getLength() - 1);
MultiSelection aHiddenMulti(aRange);
if (eMode & ExpandMode::HideInvisible)
SwScriptInfo::selectHiddenTextProperty(rNode, aHiddenMulti);
if (eMode & ExpandMode::HideDeletions)
SwScriptInfo::selectRedLineDeleted(rNode, aHiddenMulti);
std::vector<block> aBlocks;
sal_Int32 nShownStart = 0;
for (size_t i = 0; i < aHiddenMulti.GetRangeCount(); ++i)
{
const Range& rRange = aHiddenMulti.GetRange(i);
const sal_Int32 nHiddenStart = rRange.Min();
const sal_Int32 nHiddenEnd = rRange.Max() + 1;
const sal_Int32 nHiddenLen = nHiddenEnd - nHiddenStart;
const sal_Int32 nShownEnd = nHiddenStart;
const sal_Int32 nShownLen = nShownEnd - nShownStart;
if (nShownLen)
aBlocks.push_back(block(nShownStart, nShownLen, true));
if (nHiddenLen)
aBlocks.push_back(block(nHiddenStart, nHiddenLen, false));
nShownStart = nHiddenEnd;
}
sal_Int32 nTrailingShownLen = rNodeText.getLength() - nShownStart;
if (nTrailingShownLen)
aBlocks.push_back(block(nShownStart, nTrailingShownLen, true));
if (eMode & ExpandMode::ExpandFields || eMode & ExpandMode::ExpandFootnote)
{
//first the normal fields, get their position in the node and what the text they expand
//to is
const SwpHints* pSwpHints2 = rNode.GetpSwpHints();
for ( size_t i = 0; pSwpHints2 && i < pSwpHints2->Count(); ++i )
{
const SwTextAttr* pAttr = pSwpHints2->Get(i);
if (pAttr->HasDummyChar())
{
const sal_Int32 nDummyCharPos = pAttr->GetStart();
if (aHiddenMulti.IsSelected(nDummyCharPos))
continue;
std::vector<block>::iterator aFind = std::find_if(aBlocks.begin(),
aBlocks.end(), containsPos(nDummyCharPos));
if (aFind != aBlocks.end())
{
FieldResult aFieldResult(nDummyCharPos);
switch (pAttr->Which())
{
case RES_TXTATR_FIELD:
case RES_TXTATR_ANNOTATION:
if (eMode & ExpandMode::ExpandFields)
{
aFieldResult.m_sExpand = (eMode & ExpandMode::ReplaceMode)
? OUString(CHAR_ZWSP)
: static_txtattr_cast<SwTextField const*>(pAttr)->
GetFormatField().GetField()->ExpandField(true);
aFieldResult.m_eType = FieldResult::FIELD;
}
break;
case RES_TXTATR_FTN:
if (eMode & ExpandMode::ExpandFootnote)
{
const SwFormatFootnote& rFootnote = static_cast<SwTextFootnote const*>(pAttr)->GetFootnote();
const SwDoc *pDoc = rNode.GetDoc();
aFieldResult.m_sExpand = (eMode & ExpandMode::ReplaceMode)
? OUString(CHAR_ZWSP)
: rFootnote.GetViewNumStr(*pDoc);
aFieldResult.m_eType = FieldResult::FOOTNOTE;
}
break;
default:
break;
}
aFind->m_aAttrs.insert(aFieldResult);
}
}
}
if (eMode & ExpandMode::ExpandFields)
{
//now get the dropdown formfields, get their position in the node and what the text they expand
//to is
SwPaM aPaM(rNode, 0, rNode, rNode.Len());
std::vector<sw::mark::IFieldmark*> aDropDowns =
rNode.GetDoc()->getIDocumentMarkAccess()->getDropDownsFor(aPaM);
for (std::vector<sw::mark::IFieldmark*>::iterator aI = aDropDowns.begin(), aEnd = aDropDowns.end();
aI != aEnd; ++aI)
{
sw::mark::IFieldmark *pMark = *aI;
const sal_Int32 nDummyCharPos = pMark->GetMarkPos().nContent.GetIndex()-1;
if (aHiddenMulti.IsSelected(nDummyCharPos))
continue;
std::vector<block>::iterator aFind = std::find_if(aBlocks.begin(), aBlocks.end(),
containsPos(nDummyCharPos));
if (aFind != aBlocks.end())
{
FieldResult aFieldResult(nDummyCharPos);
aFieldResult.m_sExpand = (eMode & ExpandMode::ReplaceMode)
? OUString(CHAR_ZWSP)
: sw::mark::ExpandFieldmark(pMark);
aFieldResult.m_eType = FieldResult::FIELD;
aFind->m_aAttrs.insert(aFieldResult);
}
}
}
}
//store the end of each range in the model and where that end of range
//maps to in the view
sal_Int32 nOffset = 0;
for (std::vector<block>::iterator i = aBlocks.begin(); i != aBlocks.end(); ++i)
{
const sal_Int32 nBlockLen = i->m_nLen;
if (!nBlockLen)
continue;
const sal_Int32 nBlockStart = i->m_nStart;
const sal_Int32 nBlockEnd = nBlockStart + nBlockLen;
if (!i->m_bVisible)
{
sal_Int32 const modelBlockPos(nBlockEnd);
sal_Int32 const viewBlockPos(nBlockStart + nOffset);
m_aMap.push_back(ConversionMapEntry(modelBlockPos, viewBlockPos, false));
m_aRetText = m_aRetText.replaceAt(nOffset + nBlockStart, nBlockLen, OUString());
nOffset -= nBlockLen;
}
else
{
for (FieldResultSet::iterator j = i->m_aAttrs.begin(); j != i->m_aAttrs.end(); ++j)
{
sal_Int32 const modelFieldPos(j->m_nFieldPos);
sal_Int32 const viewFieldPos(j->m_nFieldPos + nOffset);
m_aMap.push_back( ConversionMapEntry(modelFieldPos, viewFieldPos, true) );
m_aRetText = m_aRetText.replaceAt(viewFieldPos, 1, j->m_sExpand);
nOffset += j->m_sExpand.getLength() - 1;
switch (j->m_eType)
{
case FieldResult::FIELD:
m_FieldPositions.push_back(viewFieldPos);
break;
case FieldResult::FOOTNOTE:
m_FootnotePositions.push_back(viewFieldPos);
break;
case FieldResult::NONE: /*ignore*/
break;
}
}
sal_Int32 const modelEndBlock(nBlockEnd);
sal_Int32 const viewFieldPos(nBlockEnd + nOffset);
m_aMap.push_back(ConversionMapEntry(modelEndBlock, viewFieldPos, true));
}
}
}
/** Converts a model position into a view position
*/
sal_Int32 ModelToViewHelper::ConvertToViewPosition( sal_Int32 nModelPos ) const
{
// Search for entry after nPos:
ConversionMap::const_iterator aIter;
for ( aIter = m_aMap.begin(); aIter != m_aMap.end(); ++aIter )
{
if (aIter->m_nModelPos >= nModelPos)
{
//if it's an invisible portion, map all contained positions
//to the anchor viewpos
if (!aIter->m_bVisible)
return aIter->m_nViewPos;
//if it's a visible portion, then the view position is the anchor
//viewpos - the offset of the input modelpos from the anchor
//modelpos
const sal_Int32 nOffsetFromEnd = aIter->m_nModelPos - nModelPos;
return aIter->m_nViewPos - nOffsetFromEnd;
}
}
return nModelPos;
}
/** Converts a view position into a model position
*/
ModelToViewHelper::ModelPosition ModelToViewHelper::ConvertToModelPosition( sal_Int32 nViewPos ) const
{
ModelPosition aRet;
aRet.mnPos = nViewPos;
// Search for entry after nPos:
ConversionMap::const_iterator aIter;
for ( aIter = m_aMap.begin(); aIter != m_aMap.end(); ++aIter )
{
if (aIter->m_nViewPos > nViewPos)
{
const sal_Int32 nPosModel = aIter->m_nModelPos;
const sal_Int32 nPosExpand = aIter->m_nViewPos;
// If nViewPos is in front of first field, we are finished.
if ( aIter == m_aMap.begin() )
break;
--aIter;
// nPrevPosModel is the field position
const sal_Int32 nPrevPosModel = aIter->m_nModelPos;
const sal_Int32 nPrevPosExpand = aIter->m_nViewPos;
const sal_Int32 nLengthModel = nPosModel - nPrevPosModel;
const sal_Int32 nLengthExpand = nPosExpand - nPrevPosExpand;
const sal_Int32 nFieldLengthExpand = nLengthExpand - nLengthModel + 1;
const sal_Int32 nFieldEndExpand = nPrevPosExpand + nFieldLengthExpand;
// Check if nPos is outside of field:
if ( nFieldEndExpand <= nViewPos )
{
// nPos is outside of field:
const sal_Int32 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;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|