mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-04-27 23:09:08 +00:00
0cb6103928
This will allow clients to react to the undo stack changing state. It's invoked when the stack or clean index are changed.
130 lines
2.6 KiB
C++
130 lines
2.6 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() - 1;
|
|
}
|
|
|
|
void UndoStack::undo()
|
|
{
|
|
if (!can_undo())
|
|
return;
|
|
|
|
finalize_current_combo();
|
|
auto& combo = m_stack[--m_stack_index];
|
|
for (auto i = static_cast<ssize_t>(combo.commands.size()) - 1; i >= 0; i--)
|
|
combo.commands[i].undo();
|
|
|
|
if (on_state_change)
|
|
on_state_change();
|
|
}
|
|
|
|
void UndoStack::redo()
|
|
{
|
|
if (!can_redo())
|
|
return;
|
|
|
|
auto& commands = m_stack[m_stack_index++].commands;
|
|
for (auto& command : commands)
|
|
command.redo();
|
|
|
|
if (on_state_change)
|
|
on_state_change();
|
|
}
|
|
|
|
void UndoStack::pop()
|
|
{
|
|
VERIFY(!m_stack.is_empty());
|
|
m_stack.take_last();
|
|
if (m_clean_index.has_value() && m_clean_index.value() > m_stack.size())
|
|
m_clean_index = {};
|
|
}
|
|
|
|
void UndoStack::push(NonnullOwnPtr<Command>&& command)
|
|
{
|
|
if (m_stack.is_empty())
|
|
m_stack.append(make<Combo>());
|
|
|
|
// If the stack cursor is behind the top of the stack, nuke everything from here to the top.
|
|
if (m_stack_index != m_stack.size() - 1) {
|
|
while (m_stack.size() != m_stack_index) {
|
|
pop();
|
|
}
|
|
finalize_current_combo();
|
|
}
|
|
|
|
m_stack.last().commands.append(move(command));
|
|
|
|
if (on_state_change)
|
|
on_state_change();
|
|
}
|
|
|
|
void UndoStack::finalize_current_combo()
|
|
{
|
|
if (m_stack.is_empty()) {
|
|
m_stack.append(make<Combo>());
|
|
return;
|
|
}
|
|
|
|
if (!m_stack.last().commands.is_empty()) {
|
|
m_stack.append(make<Combo>());
|
|
m_stack_index = m_stack.size() - 1;
|
|
|
|
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
|
|
{
|
|
return !(m_clean_index.has_value() && m_clean_index.value() == m_stack_index);
|
|
}
|
|
|
|
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();
|
|
}
|
|
|
|
}
|