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
|
/* -*- 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.
*
************************************************************************/
#ifndef SW_UNDOCORE_HXX
#define SW_UNDOCORE_HXX
#include <undobj.hxx>
#include <calbck.hxx>
class SfxItemSet;
class SwFmtColl;
class SwFmtAnchor;
class SdrMarkList;
class SwUndoDelete;
class SwRedlineSaveData;
class SwFrm;
class SwFmt;
namespace sw {
class UndoManager;
class IShellCursorSupplier;
}
typedef SwRedlineSaveData* SwRedlineSaveDataPtr;
SV_DECL_PTRARR_DEL( SwRedlineSaveDatas, SwRedlineSaveDataPtr, 8, 8 )
namespace sw {
class SW_DLLPRIVATE UndoRedoContext
: public SfxUndoContext
{
public:
UndoRedoContext(SwDoc & rDoc, IShellCursorSupplier & rCursorSupplier)
: m_rDoc(rDoc)
, m_rCursorSupplier(rCursorSupplier)
, m_pSelFmt(0)
, m_pMarkList(0)
{ }
SwDoc & GetDoc() const { return m_rDoc; }
IShellCursorSupplier & GetCursorSupplier() { return m_rCursorSupplier; }
void SetSelections(SwFrmFmt *const pSelFmt, SdrMarkList *const pMarkList)
{
m_pSelFmt = pSelFmt;
m_pMarkList = pMarkList;
}
void GetSelections(SwFrmFmt *& o_rpSelFmt, SdrMarkList *& o_rpMarkList)
{
o_rpSelFmt = m_pSelFmt;
o_rpMarkList = m_pMarkList;
}
private:
SwDoc & m_rDoc;
IShellCursorSupplier & m_rCursorSupplier;
SwFrmFmt * m_pSelFmt;
SdrMarkList * m_pMarkList;
};
class SW_DLLPRIVATE RepeatContext
: public SfxRepeatTarget
{
public:
RepeatContext(SwDoc & rDoc, SwPaM & rPaM)
: m_rDoc(rDoc)
, m_pCurrentPaM(& rPaM)
, m_bDeleteRepeated(false)
{ }
SwDoc & GetDoc() const { return m_rDoc; }
SwPaM & GetRepeatPaM()
{
return *m_pCurrentPaM;
}
private:
friend class ::sw::UndoManager;
friend class ::SwUndoDelete;
SwDoc & m_rDoc;
SwPaM * m_pCurrentPaM;
bool m_bDeleteRepeated; /// has a delete action been repeated?
};
} // namespace sw
class SwUndoFmtColl : public SwUndo, private SwUndRng
{
String aFmtName;
SwHistory* pHistory;
SwFmtColl* pFmtColl;
// for correct <ReDo(..)> and <Repeat(..)>
// boolean, which indicates that the attributes are reseted at the nodes
// before the format has been applied.
const bool mbReset;
// boolean, which indicates that the list attributes had been reseted at
// the nodes before the format has been applied.
const bool mbResetListAttrs;
void DoSetFmtColl(SwDoc & rDoc, SwPaM & rPaM);
public:
SwUndoFmtColl( const SwPaM&, SwFmtColl*,
const bool bReset,
const bool bResetListAttrs );
virtual ~SwUndoFmtColl();
virtual void UndoImpl( ::sw::UndoRedoContext & );
virtual void RedoImpl( ::sw::UndoRedoContext & );
virtual void RepeatImpl( ::sw::RepeatContext & );
/**
Returns the rewriter for this undo object.
The rewriter contains one rule:
$1 -> <name of format collection>
<name of format collection> is the name of the format
collection that is applied by the action recorded by this undo
object.
@return the rewriter for this undo object
*/
virtual SwRewriter GetRewriter() const;
SwHistory* GetHistory() { return pHistory; }
};
class SwUndoSetFlyFmt : public SwUndo, public SwClient
{
SwFrmFmt* pFrmFmt; // das gespeicherte FlyFormat
SwFrmFmt* pOldFmt; // die alte Fly Vorlage
SwFrmFmt* pNewFmt; // die neue Fly Vorlage
SfxItemSet* pItemSet; // die zurueck-/ gesetzten Attribute
sal_uLong nOldNode, nNewNode;
xub_StrLen nOldCntnt, nNewCntnt;
sal_uInt16 nOldAnchorTyp, nNewAnchorTyp;
sal_Bool bAnchorChgd;
void PutAttr( sal_uInt16 nWhich, const SfxPoolItem* pItem );
void Modify( const SfxPoolItem*, const SfxPoolItem* );
void GetAnchor( SwFmtAnchor& rAnhor, sal_uLong nNode, xub_StrLen nCntnt );
public:
SwUndoSetFlyFmt( SwFrmFmt& rFlyFmt, SwFrmFmt& rNewFrmFmt );
virtual ~SwUndoSetFlyFmt();
virtual void UndoImpl( ::sw::UndoRedoContext & );
virtual void RedoImpl( ::sw::UndoRedoContext & );
virtual SwRewriter GetRewriter() const;
void DeRegisterFromFormat( SwFmt& );
};
//------------ Undo von verschieben/stufen von Gliederung ----------------
class SwUndoOutlineLeftRight : public SwUndo, private SwUndRng
{
short nOffset;
public:
SwUndoOutlineLeftRight( const SwPaM& rPam, short nOffset );
virtual void UndoImpl( ::sw::UndoRedoContext & );
virtual void RedoImpl( ::sw::UndoRedoContext & );
virtual void RepeatImpl( ::sw::RepeatContext & );
};
const int nUndoStringLength = 20;
/**
Shortens a string to a maximum length.
@param rStr the string to be shortened
@param nLength the maximum length for rStr
@param rFillStr string to replace cut out characters with
If rStr has less than nLength characters it will be returned unaltered.
If rStr has more than nLength characters the following algorithm
generates the shortened string:
frontLength = (nLength - length(rFillStr)) / 2
rearLength = nLength - length(rFillStr) - frontLength
shortenedString = concat(<first frontLength characters of rStr,
rFillStr,
<last rearLength characters of rStr>)
Preconditions:
- nLength - length(rFillStr) >= 2
@return the shortened string
*/
String
ShortenString(const String & rStr, xub_StrLen nLength, const String & rFillStr);
/**
Denotes special characters in a string.
The rStr is split into parts containing special characters and
parts not containing special characters. In a part containing
special characters all characters are equal. These parts are
maximal.
@param rStr the string to denote in
The resulting string is generated by concatenating the found
parts. The parts without special characters are surrounded by
"'". The parts containing special characters are denoted as "n x",
where n is the length of the part and x is the representation of
the special character (i. e. "tab(s)").
@return the denoted string
*/
String DenoteSpecialCharacters(const String & rStr);
#endif // SW_UNDOCORE_HXX
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|