bfd354492e
With this change, we now have ~1200 CellAllocators across both LibJS and LibWeb in a normal WebContent instance. This gives us a minimum heap size of 4.7 MiB in the scenario where we only have one cell allocated per type. Of course, in practice there will be many more of each type, so the effective overhead is quite a bit smaller than that in practice. I left a few types unconverted to this mechanism because I got tired of doing this. :^)
50 lines
1.3 KiB
C++
50 lines
1.3 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 : public NodeList {
|
|
WEB_PLATFORM_OBJECT(LiveNodeList, NodeList);
|
|
JS_DECLARE_ALLOCATOR(LiveNodeList);
|
|
|
|
public:
|
|
enum class Scope {
|
|
Children,
|
|
Descendants,
|
|
};
|
|
|
|
[[nodiscard]] static 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;
|
|
|
|
protected:
|
|
LiveNodeList(JS::Realm&, Node& root, Scope, Function<bool(Node const&)> filter);
|
|
|
|
Node* first_matching(Function<bool(Node const&)> const& filter) const;
|
|
|
|
private:
|
|
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 };
|
|
};
|
|
|
|
}
|