mirror of
https://github.com/RGBCube/serenity
synced 2025-10-31 11:02: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>
45 lines
1.2 KiB
C++
45 lines
1.2 KiB
C++
/*
|
|
* Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <LibJS/Runtime/GlobalObject.h>
|
|
#include <LibJS/Runtime/Map.h>
|
|
#include <LibJS/Runtime/Object.h>
|
|
#include <LibJS/Runtime/Value.h>
|
|
|
|
namespace JS {
|
|
|
|
class Set : public Object {
|
|
JS_OBJECT(Set, Object);
|
|
|
|
public:
|
|
static Set* create(GlobalObject&);
|
|
|
|
explicit Set(Object& prototype);
|
|
virtual ~Set() override;
|
|
|
|
// NOTE: Unlike what the spec says, we implement Sets using an underlying map,
|
|
// so all the functions below do not directly implement the operations as
|
|
// defined by the specification.
|
|
|
|
void set_clear() { m_values.map_clear(); }
|
|
bool set_remove(Value const& value) { return m_values.map_remove(value); }
|
|
bool set_has(Value const& key) const { return m_values.map_has(key); }
|
|
void set_add(Value const& key) { m_values.map_set(key, js_undefined()); }
|
|
size_t set_size() const { return m_values.map_size(); }
|
|
|
|
auto begin() const { return m_values.begin(); }
|
|
auto begin() { return m_values.begin(); }
|
|
auto end() const { return m_values.end(); }
|
|
|
|
private:
|
|
virtual void visit_edges(Visitor& visitor) override;
|
|
|
|
Map m_values;
|
|
};
|
|
|
|
}
|