ladybird/Userland/Libraries/LibJS/Runtime/Set.h
Idan Horowitz 08ff148bc3 LibJS: Use OrderedHashTable instead of HashTable in the Set built-in
This ensures insertion-order iteration.
2021-06-15 23:51:20 +01:00

34 lines
739 B
C++

/*
* Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#pragma once
#include <AK/HashTable.h>
#include <LibJS/Runtime/GlobalObject.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;
OrderedHashTable<Value, ValueTraits> const& values() const { return m_values; };
OrderedHashTable<Value, ValueTraits>& values() { return m_values; };
private:
virtual void visit_edges(Visitor& visitor) override;
OrderedHashTable<Value, ValueTraits> m_values;
};
}