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
|
/* -*- 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 <sortedobjs.hxx>
#include <algorithm>
#include <anchoredobject.hxx>
#include <fmtanchr.hxx>
#include <fmtsrnd.hxx>
#include <fmtwrapinfluenceonobjpos.hxx>
#include <frmfmt.hxx>
#include <pam.hxx>
#include <svx/svdobj.hxx>
#include <IDocumentDrawModelAccess.hxx>
#include <osl/diagnose.h>
using namespace ::com::sun::star;
SwSortedObjs::SwSortedObjs()
{
}
SwSortedObjs::~SwSortedObjs()
{
}
size_t SwSortedObjs::size() const
{
return maSortedObjLst.size();
}
SwAnchoredObject* SwSortedObjs::operator[]( size_t _nIndex ) const
{
SwAnchoredObject* pAnchoredObj = nullptr;
if ( _nIndex >= size() )
{
OSL_FAIL( "<SwSortedObjs::operator[]> - index out of range" );
}
else
{
pAnchoredObj = maSortedObjLst[ _nIndex ];
}
return pAnchoredObj;
}
namespace
{
int GetAnchorWeight(RndStdIds eAnchor)
{
if (eAnchor == RndStdIds::FLY_AT_CHAR)
return 0;
if (eAnchor == RndStdIds::FLY_AS_CHAR)
return 1;
return 2;
}
struct ObjAnchorOrder
{
bool operator()( const SwAnchoredObject* _pListedAnchoredObj,
const SwAnchoredObject* _pNewAnchoredObj )
{
// get attributes of listed object
const SwFrameFormat* pFormatListed = _pListedAnchoredObj->GetFrameFormat();
if (!pFormatListed)
return false;
const SwFormatAnchor* pAnchorListed = &(pFormatListed->GetAnchor());
// get attributes of new object
const SwFrameFormat* pFormatNew = _pNewAnchoredObj->GetFrameFormat();
if (!pFormatNew)
return false;
const SwFormatAnchor* pAnchorNew = &(pFormatNew->GetAnchor());
// check for to-page anchored objects
if ((pAnchorListed->GetAnchorId() == RndStdIds::FLY_AT_PAGE) &&
(pAnchorNew ->GetAnchorId() != RndStdIds::FLY_AT_PAGE))
{
return true;
}
else if ((pAnchorListed->GetAnchorId() != RndStdIds::FLY_AT_PAGE) &&
(pAnchorNew ->GetAnchorId() == RndStdIds::FLY_AT_PAGE))
{
return false;
}
else if ((pAnchorListed->GetAnchorId() == RndStdIds::FLY_AT_PAGE) &&
(pAnchorNew ->GetAnchorId() == RndStdIds::FLY_AT_PAGE))
{
return pAnchorListed->GetOrder() < pAnchorNew->GetOrder();
}
// Both objects aren't anchored to page.
// Thus, check for to-fly anchored objects
if ((pAnchorListed->GetAnchorId() == RndStdIds::FLY_AT_FLY) &&
(pAnchorNew ->GetAnchorId() != RndStdIds::FLY_AT_FLY))
{
return true;
}
else if ((pAnchorListed->GetAnchorId() != RndStdIds::FLY_AT_FLY) &&
(pAnchorNew ->GetAnchorId() == RndStdIds::FLY_AT_FLY))
{
return false;
}
else if ((pAnchorListed->GetAnchorId() == RndStdIds::FLY_AT_FLY) &&
(pAnchorNew ->GetAnchorId() == RndStdIds::FLY_AT_FLY))
{
return pAnchorListed->GetOrder() < pAnchorNew->GetOrder();
}
// Both objects aren't anchor to page or to fly
// Thus, compare content anchor nodes, if existing.
const SwNode* pContentAnchorListed = pAnchorListed->GetAnchorNode();
const SwNode* pContentAnchorNew = pAnchorNew->GetAnchorNode();
if ( pContentAnchorListed && pContentAnchorNew &&
*pContentAnchorListed != *pContentAnchorNew )
{
return *pContentAnchorListed < *pContentAnchorNew;
}
// objects anchored at the same content.
// --> OD 2006-11-29 #???# - objects have to be ordered by anchor node position
// Thus, compare content anchor node positions and anchor type,
// if not anchored at-paragraph
if (pContentAnchorListed && pContentAnchorNew)
{
sal_Int32 nListedIndex = pAnchorListed->GetAnchorId() != RndStdIds::FLY_AT_PARA ?
pAnchorListed->GetAnchorContentOffset() : 0;
sal_Int32 nNewIndex = pAnchorNew->GetAnchorId() != RndStdIds::FLY_AT_PARA ?
pAnchorNew->GetAnchorContentOffset() : 0;
if (nListedIndex != nNewIndex)
{
return nListedIndex < nNewIndex;
}
}
int nAnchorListedWeight = GetAnchorWeight(pAnchorListed->GetAnchorId());
int nAnchorNewWeight = GetAnchorWeight(pAnchorNew->GetAnchorId());
if (nAnchorListedWeight != nAnchorNewWeight)
{
return nAnchorListedWeight < nAnchorNewWeight;
}
// objects anchored at the same content and at the same content anchor
// node position with the same anchor type
// Thus, compare its wrapping style including its layer
const IDocumentDrawModelAccess& rIDDMA = pFormatListed->getIDocumentDrawModelAccess();
const SdrLayerID nHellId = rIDDMA.GetHellId();
const SdrLayerID nInvisibleHellId = rIDDMA.GetInvisibleHellId();
const bool bWrapThroughOrHellListed =
pFormatListed->GetSurround().GetSurround() == css::text::WrapTextMode_THROUGH ||
_pListedAnchoredObj->GetDrawObj()->GetLayer() == nHellId ||
_pListedAnchoredObj->GetDrawObj()->GetLayer() == nInvisibleHellId;
const bool bWrapThroughOrHellNew =
pFormatNew->GetSurround().GetSurround() == css::text::WrapTextMode_THROUGH ||
_pNewAnchoredObj->GetDrawObj()->GetLayer() == nHellId ||
_pNewAnchoredObj->GetDrawObj()->GetLayer() == nInvisibleHellId;
if ( bWrapThroughOrHellListed != bWrapThroughOrHellNew )
{
return !bWrapThroughOrHellListed;
}
else if ( bWrapThroughOrHellListed && bWrapThroughOrHellNew )
{
return pAnchorListed->GetOrder() < pAnchorNew->GetOrder();
}
// objects anchored at the same content with a set text wrapping
// Thus, compare wrap influences on object position
const SwFormatWrapInfluenceOnObjPos* pWrapInfluenceOnObjPosListed =
&(pFormatListed->GetWrapInfluenceOnObjPos());
const SwFormatWrapInfluenceOnObjPos* pWrapInfluenceOnObjPosNew =
&(pFormatNew->GetWrapInfluenceOnObjPos());
// #i35017# - handle ITERATIVE as ONCE_SUCCESSIVE
if ( pWrapInfluenceOnObjPosListed->GetWrapInfluenceOnObjPos( true ) !=
pWrapInfluenceOnObjPosNew->GetWrapInfluenceOnObjPos( true ) )
{
// #i35017# - constant name has changed
return pWrapInfluenceOnObjPosListed->GetWrapInfluenceOnObjPos( true )
== text::WrapInfluenceOnPosition::ONCE_SUCCESSIVE;
}
// objects anchored at the same content position/page/fly with same
// wrap influence.
// Thus, compare anchor order number
return pAnchorListed->GetOrder() < pAnchorNew->GetOrder();
}
};
}
bool SwSortedObjs::is_sorted() const
{
return std::is_sorted(maSortedObjLst.begin(), maSortedObjLst.end(), ObjAnchorOrder());
}
bool SwSortedObjs::Insert( SwAnchoredObject& _rAnchoredObj )
{
if (!is_sorted())
{
SAL_WARN("sw.core", "SwSortedObjs::Insert: object list is not sorted");
UpdateAll();
}
// #i51941#
if ( Contains( _rAnchoredObj ) )
{
// list already contains object
OSL_FAIL( "<SwSortedObjs::Insert()> - already contains object" );
return true;
}
// find insert position
std::vector< SwAnchoredObject* >::iterator aInsPosIter =
std::lower_bound( maSortedObjLst.begin(), maSortedObjLst.end(),
&_rAnchoredObj, ObjAnchorOrder() );
// insert object into list
maSortedObjLst.insert( aInsPosIter, &_rAnchoredObj );
return Contains( _rAnchoredObj );
}
void SwSortedObjs::Remove( SwAnchoredObject& _rAnchoredObj )
{
std::vector< SwAnchoredObject* >::iterator aDelPosIter =
std::find( maSortedObjLst.begin(), maSortedObjLst.end(), &_rAnchoredObj );
if ( aDelPosIter == maSortedObjLst.end() )
{
// object not found.
OSL_FAIL( "<SwSortedObjs::Remove()> - object not found" );
}
else
{
maSortedObjLst.erase( aDelPosIter );
}
}
bool SwSortedObjs::Contains( const SwAnchoredObject& _rAnchoredObj ) const
{
std::vector< SwAnchoredObject* >::const_iterator aIter =
std::find( maSortedObjLst.begin(), maSortedObjLst.end(), &_rAnchoredObj );
return aIter != maSortedObjLst.end();
}
void SwSortedObjs::Update( SwAnchoredObject& _rAnchoredObj )
{
if ( !Contains( _rAnchoredObj ) )
{
// given anchored object not found in list
OSL_FAIL( "<SwSortedObjs::Update(..) - sorted list doesn't contain given anchored object" );
return;
}
if ( size() == 1 )
{
// given anchored object is the only one in the list.
return;
}
Remove( _rAnchoredObj );
Insert( _rAnchoredObj );
}
void SwSortedObjs::UpdateAll()
{
std::stable_sort(maSortedObjLst.begin(), maSortedObjLst.end(), ObjAnchorOrder());
}
size_t SwSortedObjs::ListPosOf( const SwAnchoredObject& _rAnchoredObj ) const
{
std::vector< SwAnchoredObject* >::const_iterator aIter =
std::find( maSortedObjLst.begin(), maSortedObjLst.end(), &_rAnchoredObj );
if ( aIter != maSortedObjLst.end() )
{
// #i51941#
std::vector< SwAnchoredObject* >::difference_type nPos =
aIter - maSortedObjLst.begin();
return static_cast<size_t>( nPos );
}
return size();
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|