mirror of
https://github.com/RGBCube/serenity
synced 2025-10-31 16:42:44 +00:00
ffad902c07
Unlike ensure_web_prototype<T>(), the cached version doesn't require the prototype type to be fully formed, so we can use it without including the FooPrototype.h header. It's also a bit less verbose. :^)
47 lines
1.9 KiB
C++
47 lines
1.9 KiB
C++
/*
|
|
* Copyright (c) 2022, Luke Wilde <lukew@serenityos.org>
|
|
* Copyright (c) 2022, Andreas Kling <kling@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#include <LibWeb/DOM/MutationRecord.h>
|
|
#include <LibWeb/DOM/Node.h>
|
|
#include <LibWeb/DOM/NodeList.h>
|
|
#include <LibWeb/HTML/Window.h>
|
|
|
|
namespace Web::DOM {
|
|
|
|
JS::NonnullGCPtr<MutationRecord> MutationRecord::create(HTML::Window& window, FlyString const& type, Node& target, NodeList& added_nodes, NodeList& removed_nodes, Node* previous_sibling, Node* next_sibling, String const& attribute_name, String const& attribute_namespace, String const& old_value)
|
|
{
|
|
return *window.heap().allocate<MutationRecord>(window.realm(), window, type, target, added_nodes, removed_nodes, previous_sibling, next_sibling, attribute_name, attribute_namespace, old_value);
|
|
}
|
|
|
|
MutationRecord::MutationRecord(HTML::Window& window, FlyString const& type, Node& target, NodeList& added_nodes, NodeList& removed_nodes, Node* previous_sibling, Node* next_sibling, String const& attribute_name, String const& attribute_namespace, String const& old_value)
|
|
: PlatformObject(window.realm())
|
|
, m_type(type)
|
|
, m_target(JS::make_handle(target))
|
|
, m_added_nodes(added_nodes)
|
|
, m_removed_nodes(removed_nodes)
|
|
, m_previous_sibling(JS::make_handle(previous_sibling))
|
|
, m_next_sibling(JS::make_handle(next_sibling))
|
|
, m_attribute_name(attribute_name)
|
|
, m_attribute_namespace(attribute_namespace)
|
|
, m_old_value(old_value)
|
|
{
|
|
set_prototype(&window.cached_web_prototype("MutationRecord"));
|
|
}
|
|
|
|
MutationRecord::~MutationRecord() = default;
|
|
|
|
void MutationRecord::visit_edges(Cell::Visitor& visitor)
|
|
{
|
|
Base::visit_edges(visitor);
|
|
visitor.visit(m_target.ptr());
|
|
visitor.visit(m_added_nodes.ptr());
|
|
visitor.visit(m_removed_nodes.ptr());
|
|
visitor.visit(m_previous_sibling.ptr());
|
|
visitor.visit(m_next_sibling.ptr());
|
|
}
|
|
|
|
}
|