ladybird/Userland/Libraries/LibJS/Runtime/SetIterator.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

39 lines
972 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/Object.h>
#include <LibJS/Runtime/Set.h>
namespace JS {
class SetIterator final : public Object {
JS_OBJECT(SetIterator, Object);
public:
static SetIterator* create(GlobalObject&, Set& set, Object::PropertyKind iteration_kind);
explicit SetIterator(Object& prototype, Set& set, Object::PropertyKind iteration_kind);
virtual ~SetIterator() override;
Set& set() const { return m_set; }
bool done() const { return m_done; }
Object::PropertyKind iteration_kind() const { return m_iteration_kind; }
private:
friend class SetIteratorPrototype;
virtual void visit_edges(Cell::Visitor&) override;
Set& m_set;
bool m_done { false };
Object::PropertyKind m_iteration_kind;
OrderedHashTable<Value, ValueTraits>::Iterator m_iterator;
};
}