308 lines
10 KiB
C++
308 lines
10 KiB
C++
/* -*- 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 .
|
|
*/
|
|
#ifndef INCLUDED_SW_INC_PAM_HXX
|
|
#define INCLUDED_SW_INC_PAM_HXX
|
|
|
|
#include <stddef.h>
|
|
#include <sal/types.h>
|
|
#include <tools/mempool.hxx>
|
|
#include <cshtyp.hxx>
|
|
#include <ring.hxx>
|
|
#include <index.hxx>
|
|
#include <ndindex.hxx>
|
|
#include "swdllapi.h"
|
|
|
|
class SwFmt;
|
|
class SfxPoolItem;
|
|
class SfxItemSet;
|
|
class SwDoc;
|
|
class SwNode;
|
|
class SwCntntNode;
|
|
class SwPaM;
|
|
class Point;
|
|
|
|
namespace com { namespace sun { namespace star { namespace util {
|
|
struct SearchOptions;
|
|
} } } }
|
|
|
|
namespace utl {
|
|
class TextSearch;
|
|
}
|
|
|
|
/// Marks a position in the document model.
|
|
struct SW_DLLPUBLIC SwPosition
|
|
{
|
|
SwNodeIndex nNode;
|
|
SwIndex nContent;
|
|
|
|
SwPosition( const SwNodeIndex &rNode, const SwIndex &rCntnt );
|
|
explicit SwPosition( const SwNodeIndex &rNode );
|
|
explicit SwPosition( const SwNode& rNode );
|
|
explicit SwPosition( SwCntntNode& rNode, const sal_Int32 nOffset = 0 );
|
|
|
|
SwPosition( const SwPosition & );
|
|
SwPosition &operator=(const SwPosition &);
|
|
|
|
/**
|
|
Returns the document this position is in.
|
|
|
|
@return the document this position is in.
|
|
*/
|
|
SwDoc * GetDoc() const;
|
|
|
|
bool operator < (const SwPosition &) const;
|
|
bool operator > (const SwPosition &) const;
|
|
bool operator <=(const SwPosition &) const;
|
|
bool operator >=(const SwPosition &) const;
|
|
bool operator ==(const SwPosition &) const;
|
|
bool operator !=(const SwPosition &) const;
|
|
};
|
|
|
|
// Result of comparing positions.
|
|
enum SwComparePosition {
|
|
POS_BEFORE, ///< Pos1 before Pos2.
|
|
POS_BEHIND, ///< Pos1 behind Pos2.
|
|
POS_INSIDE, ///< Pos1 completely contained in Pos2.
|
|
POS_OUTSIDE, ///< Pos2 completely contained in Pos1.
|
|
POS_EQUAL, ///< Pos1 is as large as Pos2.
|
|
POS_OVERLAP_BEFORE, ///< Pos1 overlaps Pos2 at the beginning.
|
|
POS_OVERLAP_BEHIND, ///< Pos1 overlaps Pos2 at the end.
|
|
POS_COLLIDE_START, ///< Pos1 start touches at Pos2 end.
|
|
POS_COLLIDE_END ///< Pos1 end touches at Pos2 start.
|
|
};
|
|
|
|
template<typename T>
|
|
SwComparePosition ComparePosition(
|
|
const T& rStt1, const T& rEnd1,
|
|
const T& rStt2, const T& rEnd2 )
|
|
{
|
|
SwComparePosition nRet;
|
|
if( rStt1 < rStt2 )
|
|
{
|
|
if( rEnd1 > rStt2 )
|
|
{
|
|
if( rEnd1 >= rEnd2 )
|
|
nRet = POS_OUTSIDE;
|
|
else
|
|
nRet = POS_OVERLAP_BEFORE;
|
|
|
|
}
|
|
else if( rEnd1 == rStt2 )
|
|
nRet = POS_COLLIDE_END;
|
|
else
|
|
nRet = POS_BEFORE;
|
|
}
|
|
else if( rEnd2 > rStt1 )
|
|
{
|
|
if( rEnd2 >= rEnd1 )
|
|
{
|
|
if( rEnd2 == rEnd1 && rStt2 == rStt1 )
|
|
nRet = POS_EQUAL;
|
|
else
|
|
nRet = POS_INSIDE;
|
|
}
|
|
else
|
|
{
|
|
if (rStt1 == rStt2)
|
|
nRet = POS_OUTSIDE;
|
|
else
|
|
nRet = POS_OVERLAP_BEHIND;
|
|
}
|
|
}
|
|
else if( rEnd2 == rStt1 )
|
|
nRet = POS_COLLIDE_START;
|
|
else
|
|
nRet = POS_BEHIND;
|
|
return nRet;
|
|
}
|
|
|
|
/// SwPointAndMark / SwPaM
|
|
struct SwMoveFnCollection;
|
|
typedef SwMoveFnCollection* SwMoveFn;
|
|
SW_DLLPUBLIC extern SwMoveFn fnMoveForward; ///< SwPam::Move()/Find() default argument.
|
|
SW_DLLPUBLIC extern SwMoveFn fnMoveBackward;
|
|
|
|
typedef bool (*SwGoInDoc)( SwPaM& rPam, SwMoveFn fnMove );
|
|
SW_DLLPUBLIC extern SwGoInDoc fnGoDoc;
|
|
extern SwGoInDoc fnGoSection;
|
|
SW_DLLPUBLIC extern SwGoInDoc fnGoNode;
|
|
SW_DLLPUBLIC extern SwGoInDoc fnGoCntnt; ///< SwPam::Move() default argument.
|
|
extern SwGoInDoc fnGoCntntCells;
|
|
extern SwGoInDoc fnGoCntntSkipHidden;
|
|
extern SwGoInDoc fnGoCntntCellsSkipHidden;
|
|
|
|
void _InitPam();
|
|
|
|
/// PaM is Point and Mark: a selection of the document model.
|
|
class SW_DLLPUBLIC SwPaM : public Ring
|
|
{
|
|
SwPosition m_Bound1;
|
|
SwPosition m_Bound2;
|
|
SwPosition * m_pPoint; ///< points at either m_Bound1 or m_Bound2
|
|
SwPosition * m_pMark; ///< points at either m_Bound1 or m_Bound2
|
|
bool m_bIsInFrontOfLabel;
|
|
|
|
SwPaM* MakeRegion( SwMoveFn fnMove, const SwPaM * pOrigRg = 0 );
|
|
|
|
public:
|
|
SwPaM( const SwPosition& rPos, SwPaM* pRing = 0 );
|
|
SwPaM( const SwPosition& rMk, const SwPosition& rPt, SwPaM* pRing = 0 );
|
|
SwPaM( const SwNodeIndex& rMk, const SwNodeIndex& rPt,
|
|
long nMkOffset = 0, long nPtOffset = 0, SwPaM* pRing = 0 );
|
|
SwPaM( const SwNode& rMk, const SwNode& rPt,
|
|
long nMkOffset = 0, long nPtOffset = 0, SwPaM* pRing = 0 );
|
|
SwPaM( const SwNodeIndex& rMk, sal_Int32 nMkCntnt,
|
|
const SwNodeIndex& rPt, sal_Int32 nPtCntnt, SwPaM* pRing = 0 );
|
|
SwPaM( const SwNode& rMk, sal_Int32 nMkCntnt,
|
|
const SwNode& rPt, sal_Int32 nPtCntnt, SwPaM* pRing = 0 );
|
|
SwPaM( const SwNode& rNd, sal_Int32 nCntnt = 0, SwPaM* pRing = 0 );
|
|
SwPaM( const SwNodeIndex& rNd, sal_Int32 nCntnt = 0, SwPaM* pRing = 0 );
|
|
virtual ~SwPaM();
|
|
|
|
/// @@@ semantic: no copy ctor.
|
|
SwPaM( SwPaM & );
|
|
/// @@@ semantic: no copy assignment for super class Ring.
|
|
SwPaM& operator=( const SwPaM & );
|
|
|
|
/// Movement of cursor.
|
|
bool Move( SwMoveFn fnMove = fnMoveForward,
|
|
SwGoInDoc fnGo = fnGoCntnt );
|
|
|
|
/// Search.
|
|
bool Find( const com::sun::star::util::SearchOptions& rSearchOpt,
|
|
bool bSearchInNotes,
|
|
utl::TextSearch& rSTxt,
|
|
SwMoveFn fnMove = fnMoveForward,
|
|
const SwPaM *pPam =0, bool bInReadOnly = false);
|
|
bool Find( const SwFmt& rFmt,
|
|
SwMoveFn fnMove = fnMoveForward,
|
|
const SwPaM *pPam =0, bool bInReadOnly = false);
|
|
bool Find( const SfxPoolItem& rAttr, bool bValue = true,
|
|
SwMoveFn fnMove = fnMoveForward,
|
|
const SwPaM *pPam =0, bool bInReadOnly = false );
|
|
bool Find( const SfxItemSet& rAttr, bool bNoColls,
|
|
SwMoveFn fnMove,
|
|
const SwPaM *pPam, bool bInReadOnly, bool bMoveFirst );
|
|
|
|
bool DoSearch( const com::sun::star::util::SearchOptions& rSearchOpt, utl::TextSearch& rSTxt,
|
|
SwMoveFn fnMove, bool bSrchForward, bool bRegSearch, bool bChkEmptyPara, bool bChkParaEnd,
|
|
sal_Int32 &nStart, sal_Int32 &nEnd, sal_Int32 nTxtLen, SwNode* pNode, SwPaM* pPam);
|
|
|
|
inline bool IsInFrontOfLabel() const { return m_bIsInFrontOfLabel; }
|
|
inline void _SetInFrontOfLabel( bool bNew ) { m_bIsInFrontOfLabel = bNew; }
|
|
|
|
/// Unless this is called, the getter method of Mark will return Point.
|
|
virtual void SetMark();
|
|
|
|
void DeleteMark()
|
|
{
|
|
if (m_pMark != m_pPoint)
|
|
{
|
|
/** clear the mark position; this helps if mark's SwIndex is
|
|
registered at some node, and that node is then deleted */
|
|
*m_pMark = SwPosition( SwNodeIndex( GetNode().GetNodes() ) );
|
|
m_pMark = m_pPoint;
|
|
}
|
|
}
|
|
#ifdef DBG_UTIL
|
|
void Exchange();
|
|
|
|
#else
|
|
void Exchange()
|
|
{
|
|
if (m_pPoint != m_pMark)
|
|
{
|
|
SwPosition *pTmp = m_pPoint;
|
|
m_pPoint = m_pMark;
|
|
m_pMark = pTmp;
|
|
}
|
|
}
|
|
#endif
|
|
|
|
/** A PaM marks a selection if Point and Mark are distinct positions.
|
|
@return true if the PaM spans a selection
|
|
*/
|
|
bool HasMark() const { return m_pPoint != m_pMark; }
|
|
|
|
const SwPosition *GetPoint() const { return m_pPoint; }
|
|
SwPosition *GetPoint() { return m_pPoint; }
|
|
const SwPosition *GetMark() const { return m_pMark; }
|
|
SwPosition *GetMark() { return m_pMark; }
|
|
|
|
const SwPosition *Start() const
|
|
{ return (*m_pPoint) <= (*m_pMark) ? m_pPoint : m_pMark; }
|
|
SwPosition *Start()
|
|
{ return (*m_pPoint) <= (*m_pMark) ? m_pPoint : m_pMark; }
|
|
|
|
const SwPosition *End() const
|
|
{ return (*m_pPoint) > (*m_pMark) ? m_pPoint : m_pMark; }
|
|
SwPosition *End()
|
|
{ return (*m_pPoint) > (*m_pMark) ? m_pPoint : m_pMark; }
|
|
|
|
/// @return current Node at Point/Mark
|
|
SwNode & GetNode ( bool bPoint = true ) const
|
|
{
|
|
return ( bPoint ? m_pPoint->nNode : m_pMark->nNode ).GetNode();
|
|
}
|
|
|
|
/// @return current ContentNode at Point/Mark
|
|
SwCntntNode* GetCntntNode( bool bPoint = true ) const
|
|
{
|
|
return GetNode(bPoint).GetCntntNode();
|
|
}
|
|
|
|
/**
|
|
Normalizes PaM, i.e. sort point and mark.
|
|
|
|
@param bPointFirst true: If the point is behind the mark then swap.
|
|
false: If the mark is behind the point then swap.
|
|
*/
|
|
SwPaM & Normalize(bool bPointFirst = true);
|
|
|
|
/// @return the document (SwDoc) at which the PaM is registered
|
|
SwDoc* GetDoc() const { return m_pPoint->nNode.GetNode().GetDoc(); }
|
|
|
|
SwPosition& GetBound( bool bOne = true )
|
|
{ return bOne ? m_Bound1 : m_Bound2; }
|
|
const SwPosition& GetBound( bool bOne = true ) const
|
|
{ return bOne ? m_Bound1 : m_Bound2; }
|
|
|
|
/// Get number of page which contains cursor.
|
|
sal_uInt16 GetPageNum( bool bAtPoint = true, const Point* pLayPos = 0 );
|
|
|
|
/** Is in something protected (readonly) or selection contains
|
|
something protected. */
|
|
bool HasReadonlySel( bool bFormView, bool bAnnotationMode = false ) const;
|
|
|
|
bool ContainsPosition(const SwPosition & rPos) const
|
|
{
|
|
return *Start() <= rPos && rPos <= *End();
|
|
}
|
|
|
|
DECL_FIXEDMEMPOOL_NEWDEL(SwPaM);
|
|
|
|
OUString GetTxt() const;
|
|
void InvalidatePaM();
|
|
};
|
|
|
|
bool CheckNodesRange( const SwNodeIndex&, const SwNodeIndex&, bool bChkSection );
|
|
|
|
#endif // INCLUDED_SW_INC_PAM_HXX
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|