mirror of
https://github.com/RGBCube/serenity
synced 2025-10-31 21:02:44 +00:00
b84f8fb55b
Some of these are allocated upon initialization of the intrinsics, and some lazily, but in neither case the getters actually return a nullptr. This saves us a whole bunch of pointer dereferences (as NonnullGCPtr has an `operator T&()`), and also has the interesting side effect of forcing us to explicitly use the FunctionObject& overload of call(), as passing a NonnullGCPtr is ambigous - it could implicitly be turned into a Value _or_ a FunctionObject& (so we have to dereference manually).
36 lines
821 B
C++
36 lines
821 B
C++
/*
|
|
* Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#include <LibJS/Runtime/WeakMap.h>
|
|
|
|
namespace JS {
|
|
|
|
NonnullGCPtr<WeakMap> WeakMap::create(Realm& realm)
|
|
{
|
|
return realm.heap().allocate<WeakMap>(realm, realm.intrinsics().weak_map_prototype()).release_allocated_value_but_fixme_should_propagate_errors();
|
|
}
|
|
|
|
WeakMap::WeakMap(Object& prototype)
|
|
: Object(ConstructWithPrototypeTag::Tag, prototype)
|
|
, WeakContainer(heap())
|
|
{
|
|
}
|
|
|
|
void WeakMap::remove_dead_cells(Badge<Heap>)
|
|
{
|
|
m_values.remove_all_matching([](Cell* key, Value) {
|
|
return key->state() != Cell::State::Live;
|
|
});
|
|
}
|
|
|
|
void WeakMap::visit_edges(Visitor& visitor)
|
|
{
|
|
Base::visit_edges(visitor);
|
|
for (auto& entry : m_values)
|
|
visitor.visit(entry.value);
|
|
}
|
|
|
|
}
|