
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.
36 lines
875 B
C++
36 lines
875 B
C++
/*
|
|
* Copyright (c) 2020, Matthew Olsson <mattco@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <LibJS/Runtime/Object.h>
|
|
|
|
namespace JS {
|
|
|
|
class ArrayIterator final : public Object {
|
|
JS_OBJECT(ArrayIterator, Object);
|
|
|
|
public:
|
|
static ArrayIterator* create(GlobalObject&, Value array, Object::PropertyKind iteration_kind);
|
|
|
|
explicit ArrayIterator(Value array, Object::PropertyKind iteration_kind, Object& prototype);
|
|
virtual ~ArrayIterator() override;
|
|
|
|
Value array() const { return m_array; }
|
|
Object::PropertyKind iteration_kind() const { return m_iteration_kind; }
|
|
size_t index() const { return m_index; }
|
|
|
|
private:
|
|
friend class ArrayIteratorPrototype;
|
|
|
|
virtual void visit_edges(Cell::Visitor&) override;
|
|
|
|
Value m_array;
|
|
Object::PropertyKind m_iteration_kind;
|
|
size_t m_index { 0 };
|
|
};
|
|
|
|
}
|