mirror of
https://github.com/RGBCube/serenity
synced 2025-10-31 16:22:43 +00:00
45646eee43
Before this would assume that the element found in operator++ was still valid when dereferencing it in operator*. Since any code can have been run since that increment this is not always valid. To further simplify the logic of the iterator we no longer store the index in an optional.
93 lines
2 KiB
C++
93 lines
2 KiB
C++
/*
|
|
* Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#include <LibJS/Runtime/Map.h>
|
|
|
|
namespace JS {
|
|
|
|
Map* Map::create(GlobalObject& global_object)
|
|
{
|
|
return global_object.heap().allocate<Map>(global_object, *global_object.map_prototype());
|
|
}
|
|
|
|
Map::Map(Object& prototype)
|
|
: Object(prototype)
|
|
{
|
|
}
|
|
|
|
Map::~Map()
|
|
{
|
|
}
|
|
|
|
// 24.1.3.1 Map.prototype.clear ( ), https://tc39.es/ecma262/#sec-map.prototype.clear
|
|
void Map::map_clear()
|
|
{
|
|
m_keys.clear();
|
|
m_entries.clear();
|
|
}
|
|
|
|
// 24.1.3.3 Map.prototype.delete ( key ), https://tc39.es/ecma262/#sec-map.prototype.delete
|
|
bool Map::map_remove(Value const& key)
|
|
{
|
|
Optional<size_t> index;
|
|
|
|
for (auto it = m_keys.begin(); !it.is_end(); ++it) {
|
|
if (ValueTraits::equals(*it, key)) {
|
|
index = it.key();
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!index.has_value())
|
|
return false;
|
|
|
|
m_keys.remove(*index);
|
|
m_entries.remove(key);
|
|
return true;
|
|
}
|
|
|
|
// 24.1.3.6 Map.prototype.get ( key ), https://tc39.es/ecma262/#sec-map.prototype.get
|
|
Optional<Value> Map::map_get(Value const& key) const
|
|
{
|
|
if (auto it = m_entries.find(key); it != m_entries.end())
|
|
return it->value;
|
|
return {};
|
|
}
|
|
|
|
// 24.1.3.7 Map.prototype.has ( key ), https://tc39.es/ecma262/#sec-map.prototype.has
|
|
bool Map::map_has(Value const& key) const
|
|
{
|
|
return m_entries.contains(key);
|
|
}
|
|
|
|
// 24.1.3.9 Map.prototype.set ( key, value ), https://tc39.es/ecma262/#sec-map.prototype.set
|
|
void Map::map_set(Value const& key, Value value)
|
|
{
|
|
auto it = m_entries.find(key);
|
|
if (it != m_entries.end()) {
|
|
it->value = value;
|
|
} else {
|
|
auto index = m_next_insertion_id++;
|
|
m_keys.insert(index, key);
|
|
m_entries.set(key, value);
|
|
}
|
|
}
|
|
|
|
size_t Map::map_size() const
|
|
{
|
|
return m_keys.size();
|
|
}
|
|
|
|
void Map::visit_edges(Cell::Visitor& visitor)
|
|
{
|
|
Base::visit_edges(visitor);
|
|
for (auto& value : m_entries) {
|
|
visitor.visit(value.key);
|
|
visitor.visit(value.value);
|
|
}
|
|
}
|
|
|
|
}
|