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
|
/*
* Copyright (C) 2006, 2007 Apple, Inc. All rights reserved.
* Copyright (C) 2012 Google, Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "core/editing/UndoStack.h"
#include "core/dom/ContainerNode.h"
#include "core/dom/NoEventDispatchAssertion.h"
#include "core/editing/UndoStep.h"
#include "wtf/TemporaryChange.h"
namespace WebCore {
// Arbitrary depth limit for the undo stack, to keep it from using
// unbounded memory. This is the maximum number of distinct undoable
// actions -- unbroken stretches of typed characters are coalesced
// into a single action.
static const size_t maximumUndoStackDepth = 1000;
UndoStack::UndoStack()
: m_inRedo(false)
{
}
DEFINE_EMPTY_DESTRUCTOR_WILL_BE_REMOVED(UndoStack)
PassOwnPtrWillBeRawPtr<UndoStack> UndoStack::create()
{
return adoptPtrWillBeNoop(new UndoStack());
}
void UndoStack::registerUndoStep(PassRefPtrWillBeRawPtr<UndoStep> step)
{
if (m_undoStack.size() == maximumUndoStackDepth)
m_undoStack.removeFirst(); // drop oldest item off the far end
if (!m_inRedo)
m_redoStack.clear();
m_undoStack.append(step);
}
void UndoStack::registerRedoStep(PassRefPtrWillBeRawPtr<UndoStep> step)
{
m_redoStack.append(step);
}
void UndoStack::didUnloadFrame(const LocalFrame& frame)
{
NoEventDispatchAssertion assertNoEventDispatch;
filterOutUndoSteps(m_undoStack, frame);
filterOutUndoSteps(m_redoStack, frame);
}
void UndoStack::filterOutUndoSteps(UndoStepStack& stack, const LocalFrame& frame)
{
UndoStepStack newStack;
while (!stack.isEmpty()) {
UndoStep* step = stack.first().get();
if (!step->belongsTo(frame))
newStack.append(step);
stack.removeFirst();
}
stack.swap(newStack);
}
bool UndoStack::canUndo() const
{
return !m_undoStack.isEmpty();
}
bool UndoStack::canRedo() const
{
return !m_redoStack.isEmpty();
}
void UndoStack::undo()
{
if (canUndo()) {
UndoStepStack::iterator back = --m_undoStack.end();
RefPtrWillBeRawPtr<UndoStep> step(back->get());
m_undoStack.remove(back);
step->unapply();
// unapply will call us back to push this command onto the redo stack.
}
}
void UndoStack::redo()
{
if (canRedo()) {
UndoStepStack::iterator back = --m_redoStack.end();
RefPtrWillBeRawPtr<UndoStep> step(back->get());
m_redoStack.remove(back);
ASSERT(!m_inRedo);
TemporaryChange<bool> redoScope(m_inRedo, true);
step->reapply();
// reapply will call us back to push this command onto the undo stack.
}
}
void UndoStack::trace(Visitor* visitor)
{
visitor->trace(m_undoStack);
visitor->trace(m_redoStack);
}
} // namesace WebCore
|
