mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-01-24 18:24:45 -05:00
161568103e
UndoStack will now merge adjacent commands *if they want to be merged* instead of bundling everything you push onto it until you tell it to "finalize the combo." This uses less memory and gives applications full control over how their undo stacks end up. :^)
112 lines
2.1 KiB
C++
112 lines
2.1 KiB
C++
/*
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#include <LibGUI/Command.h>
|
|
#include <LibGUI/UndoStack.h>
|
|
|
|
namespace GUI {
|
|
|
|
UndoStack::UndoStack()
|
|
{
|
|
}
|
|
|
|
UndoStack::~UndoStack()
|
|
{
|
|
}
|
|
|
|
bool UndoStack::can_undo() const
|
|
{
|
|
return m_stack_index > 0;
|
|
}
|
|
|
|
bool UndoStack::can_redo() const
|
|
{
|
|
if (m_stack.is_empty())
|
|
return false;
|
|
return m_stack_index != m_stack.size();
|
|
}
|
|
|
|
void UndoStack::undo()
|
|
{
|
|
if (!can_undo())
|
|
return;
|
|
|
|
auto& command = m_stack[--m_stack_index];
|
|
command.undo();
|
|
|
|
if (on_state_change)
|
|
on_state_change();
|
|
}
|
|
|
|
void UndoStack::redo()
|
|
{
|
|
if (!can_redo())
|
|
return;
|
|
|
|
auto& command = m_stack[m_stack_index++];
|
|
command.redo();
|
|
|
|
if (on_state_change)
|
|
on_state_change();
|
|
}
|
|
|
|
void UndoStack::push(NonnullOwnPtr<Command> command)
|
|
{
|
|
// If the stack cursor is behind the top of the stack, nuke everything from here to the top.
|
|
while (m_stack.size() != m_stack_index)
|
|
m_stack.take_last();
|
|
|
|
if (m_clean_index.has_value() && m_clean_index.value() > m_stack.size())
|
|
m_clean_index = {};
|
|
|
|
if (!m_stack.is_empty()) {
|
|
if (m_stack.last().merge_with(*command))
|
|
return;
|
|
}
|
|
|
|
m_stack.append(move(command));
|
|
m_stack_index = m_stack.size();
|
|
|
|
if (on_state_change)
|
|
on_state_change();
|
|
}
|
|
|
|
void UndoStack::set_current_unmodified()
|
|
{
|
|
if (m_clean_index.has_value() && m_clean_index.value() == m_stack_index)
|
|
return;
|
|
|
|
m_clean_index = m_stack_index;
|
|
|
|
if (on_state_change)
|
|
on_state_change();
|
|
}
|
|
|
|
bool UndoStack::is_current_modified() const
|
|
{
|
|
if (m_stack.is_empty())
|
|
return false;
|
|
if (!m_clean_index.has_value())
|
|
return true;
|
|
if (m_stack_index != m_clean_index.value())
|
|
return true;
|
|
return false;
|
|
}
|
|
|
|
void UndoStack::clear()
|
|
{
|
|
if (m_stack.is_empty() && m_stack_index == 0 && !m_clean_index.has_value())
|
|
return;
|
|
|
|
m_stack.clear();
|
|
m_stack_index = 0;
|
|
m_clean_index.clear();
|
|
|
|
if (on_state_change)
|
|
on_state_change();
|
|
}
|
|
|
|
}
|