OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2006, 2007 Apple, Inc. All rights reserved. | 2 * Copyright (C) 2006, 2007 Apple, Inc. All rights reserved. |
3 * Copyright (C) 2012 Google, Inc. All rights reserved. | 3 * Copyright (C) 2012 Google, Inc. All rights reserved. |
4 * | 4 * |
5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
7 * are met: | 7 * are met: |
8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
(...skipping 10 matching lines...) Expand all Loading... |
21 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | 21 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
22 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 22 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
25 */ | 25 */ |
26 | 26 |
27 #include "core/editing/commands/UndoStack.h" | 27 #include "core/editing/commands/UndoStack.h" |
28 | 28 |
29 #include "core/dom/ContainerNode.h" | 29 #include "core/dom/ContainerNode.h" |
30 #include "core/editing/commands/UndoStep.h" | 30 #include "core/editing/commands/UndoStep.h" |
| 31 #include "platform/EventDispatchForbiddenScope.h" |
31 #include "wtf/TemporaryChange.h" | 32 #include "wtf/TemporaryChange.h" |
32 | 33 |
33 namespace blink { | 34 namespace blink { |
34 | 35 |
35 // Arbitrary depth limit for the undo stack, to keep it from using | 36 // Arbitrary depth limit for the undo stack, to keep it from using |
36 // unbounded memory. This is the maximum number of distinct undoable | 37 // unbounded memory. This is the maximum number of distinct undoable |
37 // actions -- unbroken stretches of typed characters are coalesced | 38 // actions -- unbroken stretches of typed characters are coalesced |
38 // into a single action. | 39 // into a single action. |
39 static const size_t maximumUndoStackDepth = 1000; | 40 static const size_t maximumUndoStackDepth = 1000; |
40 | 41 |
(...skipping 14 matching lines...) Expand all Loading... |
55 if (!m_inRedo) | 56 if (!m_inRedo) |
56 m_redoStack.clear(); | 57 m_redoStack.clear(); |
57 m_undoStack.append(step); | 58 m_undoStack.append(step); |
58 } | 59 } |
59 | 60 |
60 void UndoStack::registerRedoStep(UndoStep* step) | 61 void UndoStack::registerRedoStep(UndoStep* step) |
61 { | 62 { |
62 m_redoStack.append(step); | 63 m_redoStack.append(step); |
63 } | 64 } |
64 | 65 |
| 66 void UndoStack::didUnloadFrame(const LocalFrame& frame) |
| 67 { |
| 68 EventDispatchForbiddenScope assertNoEventDispatch; |
| 69 filterOutUndoSteps(m_undoStack, frame); |
| 70 filterOutUndoSteps(m_redoStack, frame); |
| 71 } |
| 72 |
| 73 void UndoStack::filterOutUndoSteps(UndoStepStack& stack, const LocalFrame& frame
) |
| 74 { |
| 75 UndoStepStack newStack; |
| 76 while (!stack.isEmpty()) { |
| 77 UndoStep* step = stack.first().get(); |
| 78 if (!step->belongsTo(frame)) |
| 79 newStack.append(step); |
| 80 stack.removeFirst(); |
| 81 } |
| 82 stack.swap(newStack); |
| 83 } |
| 84 |
65 bool UndoStack::canUndo() const | 85 bool UndoStack::canUndo() const |
66 { | 86 { |
67 return !m_undoStack.isEmpty(); | 87 return !m_undoStack.isEmpty(); |
68 } | 88 } |
69 | 89 |
70 bool UndoStack::canRedo() const | 90 bool UndoStack::canRedo() const |
71 { | 91 { |
72 return !m_redoStack.isEmpty(); | 92 return !m_redoStack.isEmpty(); |
73 } | 93 } |
74 | 94 |
(...skipping 22 matching lines...) Expand all Loading... |
97 } | 117 } |
98 } | 118 } |
99 | 119 |
100 DEFINE_TRACE(UndoStack) | 120 DEFINE_TRACE(UndoStack) |
101 { | 121 { |
102 visitor->trace(m_undoStack); | 122 visitor->trace(m_undoStack); |
103 visitor->trace(m_redoStack); | 123 visitor->trace(m_redoStack); |
104 } | 124 } |
105 | 125 |
106 } // namespace blink | 126 } // namespace blink |
OLD | NEW |