mirror of
https://github.com/RGBCube/serenity
synced 2025-10-31 16:22:43 +00:00
3bfcd7b52d
This implements ordered sets using Maps with a sentinel value, and includes some extra set tests. Fixes #11004. Co-Authored-By: davidot <davidot@serenityos.org>
32 lines
588 B
C++
32 lines
588 B
C++
/*
|
|
* Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#include <LibJS/Runtime/Set.h>
|
|
|
|
namespace JS {
|
|
|
|
Set* Set::create(GlobalObject& global_object)
|
|
{
|
|
return global_object.heap().allocate<Set>(global_object, *global_object.set_prototype());
|
|
}
|
|
|
|
Set::Set(Object& prototype)
|
|
: Object(prototype)
|
|
, m_values(*prototype.global_object().map_prototype())
|
|
{
|
|
}
|
|
|
|
Set::~Set()
|
|
{
|
|
}
|
|
|
|
void Set::visit_edges(Cell::Visitor& visitor)
|
|
{
|
|
Base::visit_edges(visitor);
|
|
static_cast<Object&>(m_values).visit_edges(visitor);
|
|
}
|
|
|
|
}
|