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
|
/* -*- 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_SOURCE_CORE_INC_UNDODELETE_HXX
#define INCLUDED_SW_SOURCE_CORE_INC_UNDODELETE_HXX
#include <undobj.hxx>
#include <rtl/ustring.hxx>
#include <tools/mempool.hxx>
class SwRedlineSaveDatas;
class SwTxtNode;
namespace sfx2 {
class MetadatableUndo;
}
class SwUndoDelete
: public SwUndo
, private SwUndRng
, private SwUndoSaveCntnt
{
SwNodeIndex* pMvStt; // Position of Nodes in UndoNodes-Array
OUString *pSttStr, *pEndStr;
SwRedlineData* pRedlData;
SwRedlineSaveDatas* pRedlSaveData;
::boost::shared_ptr< ::sfx2::MetadatableUndo > m_pMetadataUndoStart;
::boost::shared_ptr< ::sfx2::MetadatableUndo > m_pMetadataUndoEnd;
OUString sTableName;
sal_uLong nNode;
sal_uLong nNdDiff; // difference of Nodes before/after Delete
sal_uLong nSectDiff; // diff. of Nodes before/after Move w/ SectionNodes
sal_uLong nReplaceDummy; // diff. to a temporary dummy object
sal_uInt16 nSetPos;
sal_Bool bGroup : 1; // TRUE: is already Grouped; see CanGrouping()
sal_Bool bBackSp : 1; // TRUE: if Grouped and preceding content deleted
sal_Bool bJoinNext: 1; // TRUE: if range is selected forwards
sal_Bool bTblDelLastNd : 1; // TRUE: TextNode following Table inserted/deleted
sal_Bool bDelFullPara : 1; // TRUE: entire Nodes were deleted
sal_Bool bResetPgDesc : 1; // TRUE: reset PgDsc on following node
sal_Bool bResetPgBrk : 1; // TRUE: reset PgBreak on following node
sal_Bool bFromTableCopy : 1; // TRUE: called by SwUndoTblCpyTbl
sal_Bool SaveCntnt( const SwPosition* pStt, const SwPosition* pEnd,
SwTxtNode* pSttTxtNd, SwTxtNode* pEndTxtNd );
public:
SwUndoDelete(
SwPaM&,
sal_Bool bFullPara = sal_False,
sal_Bool bCalledByTblCpy = sal_False );
virtual ~SwUndoDelete();
virtual void UndoImpl( ::sw::UndoRedoContext & );
virtual void RedoImpl( ::sw::UndoRedoContext & );
virtual void RepeatImpl( ::sw::RepeatContext & );
/**
Returns rewriter for this undo object.
The rewriter consists of the following rule:
$1 -> '<deleted text>'
<deleted text> is shortened to nUndoStringLength characters.
@return rewriter for this undo object
*/
virtual SwRewriter GetRewriter() const;
sal_Bool CanGrouping( SwDoc*, const SwPaM& );
void SetTblDelLastNd() { bTblDelLastNd = sal_True; }
// for PageDesc/PageBreak Attributes of a table
void SetPgBrkFlags( sal_Bool bPageBreak, sal_Bool bPageDesc )
{ bResetPgDesc = bPageDesc; bResetPgBrk = bPageBreak; }
void SetTableName(const OUString & rName);
// SwUndoTblCpyTbl needs this information:
sal_Bool IsDelFullPara() const { return bDelFullPara; }
DECL_FIXEDMEMPOOL_NEWDEL(SwUndoDelete)
};
#endif // INCLUDED_SW_SOURCE_CORE_INC_UNDODELETE_HXX
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
