mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-08-01 05:39:11 +00:00
Everywhere: Hoist the Libraries folder to the top-level
This commit is contained in:
parent
950e819ee7
commit
93712b24bf
Notes:
github-actions[bot]
2024-11-10 11:51:52 +00:00
Author: https://github.com/trflynn89
Commit: 93712b24bf
Pull-request: https://github.com/LadybirdBrowser/ladybird/pull/2256
Reviewed-by: https://github.com/sideshowbarker
4547 changed files with 104 additions and 113 deletions
96
Libraries/LibWeb/DOM/LiveNodeList.cpp
Normal file
96
Libraries/LibWeb/DOM/LiveNodeList.cpp
Normal file
|
@ -0,0 +1,96 @@
|
|||
/*
|
||||
* Copyright (c) 2021, Luke Wilde <lukew@serenityos.org>
|
||||
* Copyright (c) 2022, Andreas Kling <andreas@ladybird.org>
|
||||
*
|
||||
* SPDX-License-Identifier: BSD-2-Clause
|
||||
*/
|
||||
|
||||
#include <LibJS/Heap/Heap.h>
|
||||
#include <LibJS/Runtime/Error.h>
|
||||
#include <LibWeb/DOM/LiveNodeList.h>
|
||||
#include <LibWeb/DOM/Node.h>
|
||||
|
||||
namespace Web::DOM {
|
||||
|
||||
JS_DEFINE_ALLOCATOR(LiveNodeList);
|
||||
|
||||
JS::NonnullGCPtr<NodeList> LiveNodeList::create(JS::Realm& realm, Node const& root, Scope scope, Function<bool(Node const&)> filter)
|
||||
{
|
||||
return realm.heap().allocate<LiveNodeList>(realm, realm, root, scope, move(filter));
|
||||
}
|
||||
|
||||
LiveNodeList::LiveNodeList(JS::Realm& realm, Node const& root, Scope scope, Function<bool(Node const&)> filter)
|
||||
: NodeList(realm)
|
||||
, m_root(root)
|
||||
, m_filter(move(filter))
|
||||
, m_scope(scope)
|
||||
{
|
||||
}
|
||||
|
||||
LiveNodeList::~LiveNodeList() = default;
|
||||
|
||||
void LiveNodeList::visit_edges(Cell::Visitor& visitor)
|
||||
{
|
||||
Base::visit_edges(visitor);
|
||||
visitor.visit(m_root);
|
||||
}
|
||||
|
||||
JS::MarkedVector<Node*> LiveNodeList::collection() const
|
||||
{
|
||||
JS::MarkedVector<Node*> nodes(heap());
|
||||
if (m_scope == Scope::Descendants) {
|
||||
m_root->for_each_in_subtree([&](auto& node) {
|
||||
if (m_filter(node))
|
||||
nodes.append(const_cast<Node*>(&node));
|
||||
return TraversalDecision::Continue;
|
||||
});
|
||||
} else {
|
||||
m_root->for_each_child([&](auto& node) {
|
||||
if (m_filter(node))
|
||||
nodes.append(const_cast<Node*>(&node));
|
||||
return IterationDecision::Continue;
|
||||
});
|
||||
}
|
||||
return nodes;
|
||||
}
|
||||
|
||||
Node* LiveNodeList::first_matching(Function<bool(Node const&)> const& filter) const
|
||||
{
|
||||
Node* matched_node = nullptr;
|
||||
if (m_scope == Scope::Descendants) {
|
||||
m_root->for_each_in_subtree([&](auto& node) {
|
||||
if (m_filter(node) && filter(node)) {
|
||||
matched_node = const_cast<Node*>(&node);
|
||||
return TraversalDecision::Break;
|
||||
}
|
||||
return TraversalDecision::Continue;
|
||||
});
|
||||
} else {
|
||||
m_root->for_each_child([&](auto& node) {
|
||||
if (m_filter(node) && filter(node)) {
|
||||
matched_node = const_cast<Node*>(&node);
|
||||
return IterationDecision::Break;
|
||||
}
|
||||
return IterationDecision::Continue;
|
||||
});
|
||||
}
|
||||
return matched_node;
|
||||
}
|
||||
|
||||
// https://dom.spec.whatwg.org/#dom-nodelist-length
|
||||
u32 LiveNodeList::length() const
|
||||
{
|
||||
return collection().size();
|
||||
}
|
||||
|
||||
// https://dom.spec.whatwg.org/#dom-nodelist-item
|
||||
Node const* LiveNodeList::item(u32 index) const
|
||||
{
|
||||
// The item(index) method must return the indexth node in the collection. If there is no indexth node in the collection, then the method must return null.
|
||||
auto nodes = collection();
|
||||
if (index >= nodes.size())
|
||||
return nullptr;
|
||||
return nodes[index];
|
||||
}
|
||||
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue