mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2026-04-18 09:50:27 +00:00
7cc973fa77
Eliminate O(n) tree-order sorted insert on every add() by simply appending elements and deferring order resolution to lookup time. Cache the first-in-tree-order element in get() so repeated getElementById() calls avoid repeated subtree traversal. Improves performance on YouTube where add() was hot in profiles while scrolling through comments.
37 lines
940 B
C++
37 lines
940 B
C++
/*
|
|
* Copyright (c) 2025-2026, Aliaksandr Kalenik <kalenik.aliaksandr@gmail.com>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Function.h>
|
|
#include <LibWeb/DOM/Element.h>
|
|
#include <LibWeb/Forward.h>
|
|
|
|
namespace Web::DOM {
|
|
|
|
class ElementByIdMap {
|
|
public:
|
|
void add(FlyString const& element_id, Element&);
|
|
void remove(FlyString const& element_id, Element&);
|
|
GC::Ptr<Element> get(FlyString const& element_id, Node const& scope_root) const;
|
|
void for_each_element_with_id(StringView element_id, Node const& scope_root, Function<void(Element&)> callback) const;
|
|
|
|
template<typename Callback>
|
|
void for_each_id(Callback callback)
|
|
{
|
|
for (auto const& id : m_map.keys())
|
|
callback(id);
|
|
}
|
|
|
|
private:
|
|
struct MapEntry {
|
|
GC::Weak<Element> cached_first_element;
|
|
Vector<GC::Weak<Element>> elements;
|
|
};
|
|
mutable HashMap<FlyString, MapEntry> m_map;
|
|
};
|
|
|
|
}
|