mirror of
				https://github.com/RGBCube/serenity
				synced 2025-10-31 16:32:45 +00:00 
			
		
		
		
	 3bfcd7b52d
			
		
	
	
		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>
		
			
				
	
	
		
			39 lines
		
	
	
	
		
			944 B
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			39 lines
		
	
	
	
		
			944 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;
 | |
|     Map::ConstIterator m_iterator;
 | |
| };
 | |
| 
 | |
| }
 |