e5753443ae
This is so that we can reliably allocate them in a template function,
e.g. in ordinary_create_from_constructor():
global_object.heap().allocate<T>(
global_object, forward<Args>(args)..., *prototype);
The majority of objects already take the prototype as the last argument,
so I updated the ones that didn't.
39 lines
972 B
C++
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(Set& set, Object::PropertyKind iteration_kind, Object& prototype);
|
|
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;
|
|
};
|
|
|
|
}
|