
While the WeakMap only holds a weak reference to its keys, their accompanying values should be kept alive as long as they're accessible.
39 lines
956 B
C++
39 lines
956 B
C++
/*
|
|
* Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/HashMap.h>
|
|
#include <LibJS/Runtime/GlobalObject.h>
|
|
#include <LibJS/Runtime/Object.h>
|
|
#include <LibJS/Runtime/WeakContainer.h>
|
|
|
|
namespace JS {
|
|
|
|
class WeakMap final
|
|
: public Object
|
|
, public WeakContainer {
|
|
JS_OBJECT(WeakMap, Object);
|
|
|
|
public:
|
|
static WeakMap* create(GlobalObject&);
|
|
|
|
explicit WeakMap(Object& prototype);
|
|
virtual ~WeakMap() override;
|
|
|
|
HashMap<Cell*, Value> const& values() const { return m_values; };
|
|
HashMap<Cell*, Value>& values() { return m_values; };
|
|
|
|
virtual void remove_swept_cells(Badge<Heap>, Span<Cell*>) override;
|
|
|
|
private:
|
|
virtual void did_become_zombie() override { deregister(); }
|
|
void visit_edges(Visitor&) override;
|
|
|
|
HashMap<Cell*, Value> m_values; // This stores Cell pointers instead of Object pointers to aide with sweeping
|
|
};
|
|
|
|
}
|