
This makes sure that is<Set> checks done on the Set prototype instead of on Set instances return false, thereby emulating the behaviour of the RequireInternalSlot abstract operation.
32 lines
537 B
C++
32 lines
537 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)
|
|
{
|
|
}
|
|
|
|
Set::~Set()
|
|
{
|
|
}
|
|
|
|
void Set::visit_edges(Cell::Visitor& visitor)
|
|
{
|
|
Object::visit_edges(visitor);
|
|
for (auto& value : m_values)
|
|
visitor.visit(value);
|
|
}
|
|
|
|
}
|