mirror of
				https://github.com/RGBCube/serenity
				synced 2025-10-31 19:02:44 +00:00 
			
		
		
		
	
		
			
				
	
	
		
			49 lines
		
	
	
	
		
			1.4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			49 lines
		
	
	
	
		
			1.4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| /*
 | |
|  * Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
 | |
|  *
 | |
|  * SPDX-License-Identifier: BSD-2-Clause
 | |
|  */
 | |
| 
 | |
| #pragma once
 | |
| 
 | |
| #include <LibJS/Runtime/GlobalObject.h>
 | |
| #include <LibJS/Runtime/Map.h>
 | |
| #include <LibJS/Runtime/Object.h>
 | |
| #include <LibJS/Runtime/Value.h>
 | |
| 
 | |
| namespace JS {
 | |
| 
 | |
| class Set : public Object {
 | |
|     JS_OBJECT(Set, Object);
 | |
| 
 | |
| public:
 | |
|     static NonnullGCPtr<Set> create(Realm&);
 | |
| 
 | |
|     virtual void initialize(Realm&) override;
 | |
|     virtual ~Set() override = default;
 | |
| 
 | |
|     // NOTE: Unlike what the spec says, we implement Sets using an underlying map,
 | |
|     //       so all the functions below do not directly implement the operations as
 | |
|     //       defined by the specification.
 | |
| 
 | |
|     void set_clear() { m_values->map_clear(); }
 | |
|     bool set_remove(Value const& value) { return m_values->map_remove(value); }
 | |
|     bool set_has(Value const& key) const { return m_values->map_has(key); }
 | |
|     void set_add(Value const& key) { m_values->map_set(key, js_undefined()); }
 | |
|     size_t set_size() const { return m_values->map_size(); }
 | |
| 
 | |
|     auto begin() const { return const_cast<Map const&>(*m_values).begin(); }
 | |
|     auto begin() { return m_values->begin(); }
 | |
|     auto end() const { return m_values->end(); }
 | |
| 
 | |
|     NonnullGCPtr<Set> copy() const;
 | |
| 
 | |
| private:
 | |
|     explicit Set(Object& prototype);
 | |
| 
 | |
|     virtual void visit_edges(Visitor& visitor) override;
 | |
| 
 | |
|     GCPtr<Map> m_values;
 | |
| };
 | |
| 
 | |
| }
 | 
