ladybird/Userland/Libraries/LibWeb/DOM/LiveNodeList.h
Andreas Kling fa25f70086 LibWeb: Make LiveNodeList faster when it only cares about children
Same optimization as HTMLCollection, ported to LiveNodeList.
2023-05-23 14:38:45 +02:00

46 lines
1.1 KiB
C++

/*
* Copyright (c) 2021, Luke Wilde <lukew@serenityos.org>
* Copyright (c) 2022, Andreas Kling <kling@serenityos.org>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#pragma once
#include <AK/Function.h>
#include <LibWeb/DOM/NodeList.h>
namespace Web::DOM {
// FIXME: Just like HTMLCollection, LiveNodeList currently does no caching.
class LiveNodeList final : public NodeList {
WEB_PLATFORM_OBJECT(LiveNodeList, NodeList);
public:
enum class Scope {
Children,
Descendants,
};
static WebIDL::ExceptionOr<JS::NonnullGCPtr<NodeList>> create(JS::Realm&, Node& root, Scope, Function<bool(Node const&)> filter);
virtual ~LiveNodeList() override;
virtual u32 length() const override;
virtual Node const* item(u32 index) const override;
virtual bool is_supported_property_index(u32) const override;
private:
LiveNodeList(JS::Realm&, Node& root, Scope, Function<bool(Node const&)> filter);
virtual void visit_edges(Cell::Visitor&) override;
JS::MarkedVector<Node*> collection() const;
JS::NonnullGCPtr<Node> m_root;
Function<bool(Node const&)> m_filter;
Scope m_scope { Scope::Descendants };
};
}