MutationRecord.cpp 1.9 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647
  1. /*
  2. * Copyright (c) 2022, Luke Wilde <lukew@serenityos.org>
  3. * Copyright (c) 2022, Andreas Kling <kling@serenityos.org>
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include <LibWeb/Bindings/Intrinsics.h>
  8. #include <LibWeb/DOM/MutationRecord.h>
  9. #include <LibWeb/DOM/Node.h>
  10. #include <LibWeb/DOM/NodeList.h>
  11. namespace Web::DOM {
  12. JS::NonnullGCPtr<MutationRecord> MutationRecord::create(JS::Realm& realm, 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)
  13. {
  14. return *realm.heap().allocate<MutationRecord>(realm, realm, type, target, added_nodes, removed_nodes, previous_sibling, next_sibling, attribute_name, attribute_namespace, old_value);
  15. }
  16. MutationRecord::MutationRecord(JS::Realm& realm, 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)
  17. : PlatformObject(realm)
  18. , m_type(type)
  19. , m_target(JS::make_handle(target))
  20. , m_added_nodes(added_nodes)
  21. , m_removed_nodes(removed_nodes)
  22. , m_previous_sibling(JS::make_handle(previous_sibling))
  23. , m_next_sibling(JS::make_handle(next_sibling))
  24. , m_attribute_name(attribute_name)
  25. , m_attribute_namespace(attribute_namespace)
  26. , m_old_value(old_value)
  27. {
  28. set_prototype(&Bindings::cached_web_prototype(realm, "MutationRecord"));
  29. }
  30. MutationRecord::~MutationRecord() = default;
  31. void MutationRecord::visit_edges(Cell::Visitor& visitor)
  32. {
  33. Base::visit_edges(visitor);
  34. visitor.visit(m_target.ptr());
  35. visitor.visit(m_added_nodes.ptr());
  36. visitor.visit(m_removed_nodes.ptr());
  37. visitor.visit(m_previous_sibling.ptr());
  38. visitor.visit(m_next_sibling.ptr());
  39. }
  40. }