mirror of
				https://github.com/RGBCube/serenity
				synced 2025-10-31 10:02:43 +00:00 
			
		
		
		
	
		
			
				
	
	
		
			82 lines
		
	
	
	
		
			3.1 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			82 lines
		
	
	
	
		
			3.1 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| /*
 | |
|  * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
 | |
|  * All rights reserved.
 | |
|  *
 | |
|  * Redistribution and use in source and binary forms, with or without
 | |
|  * modification, are permitted provided that the following conditions are met:
 | |
|  *
 | |
|  * 1. Redistributions of source code must retain the above copyright notice, this
 | |
|  *    list of conditions and the following disclaimer.
 | |
|  *
 | |
|  * 2. Redistributions in binary form must reproduce the above copyright notice,
 | |
|  *    this list of conditions and the following disclaimer in the documentation
 | |
|  *    and/or other materials provided with the distribution.
 | |
|  *
 | |
|  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 | |
|  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 | |
|  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 | |
|  * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
 | |
|  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 | |
|  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 | |
|  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 | |
|  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 | |
|  * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 | |
|  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 | |
|  */
 | |
| 
 | |
| #pragma once
 | |
| 
 | |
| #include <AK/Vector.h>
 | |
| 
 | |
| namespace AK {
 | |
| 
 | |
| template<typename PtrType, int inline_capacity = 0>
 | |
| class NonnullPtrVector : public Vector<PtrType, inline_capacity> {
 | |
|     typedef typename PtrType::ElementType T;
 | |
|     typedef Vector<PtrType, inline_capacity> Base;
 | |
| 
 | |
| public:
 | |
|     NonnullPtrVector()
 | |
|     {
 | |
|     }
 | |
| 
 | |
|     NonnullPtrVector(Vector<PtrType>&& other)
 | |
|         : Base(static_cast<Base&&>(other))
 | |
|     {
 | |
|     }
 | |
|     NonnullPtrVector(const Vector<PtrType>& other)
 | |
|         : Base(static_cast<const Base&>(other))
 | |
|     {
 | |
|     }
 | |
| 
 | |
|     using Base::size;
 | |
| 
 | |
|     using ConstIterator = SimpleIterator<const NonnullPtrVector, const T>;
 | |
|     using Iterator = SimpleIterator<NonnullPtrVector, T>;
 | |
| 
 | |
|     constexpr ConstIterator begin() const { return ConstIterator::begin(*this); }
 | |
|     constexpr Iterator begin() { return Iterator::begin(*this); }
 | |
| 
 | |
|     constexpr ConstIterator end() const { return ConstIterator::end(*this); }
 | |
|     constexpr Iterator end() { return Iterator::end(*this); }
 | |
| 
 | |
|     PtrType& ptr_at(int index) { return Base::at(index); }
 | |
|     const PtrType& ptr_at(int index) const { return Base::at(index); }
 | |
| 
 | |
|     T& at(int index) { return *Base::at(index); }
 | |
|     const T& at(int index) const { return *Base::at(index); }
 | |
|     T& operator[](int index) { return at(index); }
 | |
|     const T& operator[](int index) const { return at(index); }
 | |
|     T& first() { return at(0); }
 | |
|     const T& first() const { return at(0); }
 | |
|     T& last() { return at(size() - 1); }
 | |
|     const T& last() const { return at(size() - 1); }
 | |
| 
 | |
| private:
 | |
|     // NOTE: You can't use resize() on a NonnullFooPtrVector since making the vector
 | |
|     //       bigger would require being able to default-construct NonnullFooPtrs.
 | |
|     //       Instead, use shrink(new_size).
 | |
|     void resize(int) = delete;
 | |
| };
 | |
| 
 | |
| }
 | 
