5 * Copyright (c) 2022 Samsung Electronics Co., Ltd.
7 * Licensed under the Apache License, Version 2.0 (the "License");
8 * you may not use this file except in compliance with the License.
9 * You may obtain a copy of the License at
11 * http://www.apache.org/licenses/LICENSE-2.0
13 * Unless required by applicable law or agreed to in writing, software
14 * distributed under the License is distributed on an "AS IS" BASIS,
15 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
16 * See the License for the specific language governing permissions and
17 * limitations under the License.
24 #include <cstdint> // uint32_t
27 #include <dali/public-api/common/dali-common.h>
28 #include <dali/public-api/common/type-traits.h>
29 #include <dali/public-api/math/math-utils.h>
32 * @brief For DALi internal use, asserts are enabled in debug builds.
34 * For Application use, asserts can be enabled manually.
37 #if defined(DEBUG_ENABLED)
38 #define ENABLE_VECTOR_ASSERTS
41 #if defined(ENABLE_VECTOR_ASSERTS)
42 #define DALI_ASSERT_VECTOR(cond) DALI_ASSERT_ALWAYS(cond)
44 #define DALI_ASSERT_VECTOR(cond)
50 * @addtogroup dali_core_common
55 * @brief Base class to handle the memory of simple vector.
57 * Memory layout is such that it has two std::size_t to hold the count
58 * and capacity of the vector. VectorBase::mData is adjusted so that it points to the
59 * beginning of the first real item so that iterating the items is quick.
62 class DALI_CORE_API VectorBase
65 using SizeType = std::size_t;
67 protected: // Construction
69 * @brief Default constructor. Does not allocate space.
77 * Does not release the space. Derived class needs to call Release.
78 * Not virtual as this should not be called directly and we do not want
79 * a vtable for this class as it would unnecessarily increase size.
86 * @brief This method is inlined as it's needed frequently for Vector::End() iterator.
89 * @return The count of elements in this vector
91 SizeType Count() const
96 SizeType* metadata = reinterpret_cast<SizeType*>(mData);
97 items = *(metadata - 1u);
103 * @brief Gets the count of elements in this vector.
105 * @return The count of elements in this vector
107 SizeType Size() const
113 * @brief @ return if the vector is empty.
115 * @return True if the count of elements is empty
119 return Count() == 0u;
123 * @brief Gets the capacity of this vector.
125 * @return The capacity of this vector
127 SizeType Capacity() const;
130 * @brief Releases the data.
132 * Does not call destructors on objects held.
137 protected: // for Derived classes
139 * @brief Helper to set the count.
142 * @param[in] count Number of elements in the vector
144 void SetCount(SizeType count);
147 * @brief Reserves space in the vector.
150 * @param[in] count Count of elements to reserve
151 * @param[in] elementSize Size of a single element
153 void Reserve(SizeType count, SizeType elementSize);
156 * @brief Copy a vector.
159 * @param[in] vector Vector to copy from
160 * @param[in] elementSize Size of a single element
162 void Copy(const VectorBase& vector, SizeType elementSize);
165 * @brief Swaps the contents of two vectors.
168 * @param[in] vector Vector to swap with
170 void Swap(VectorBase& vector);
173 * @brief Erases an element.
175 * Does not change capacity.
177 * @param[in] address Address to erase from
178 * @param[in] elementSize Size to erase
179 * @pre Last element cannot be erased as there is nothing to move.
181 void Erase(char* address, SizeType elementSize);
184 * @brief Erases a range of elements.
186 * Does not change capacity.
188 * @param[in] first Address to the first element to be erased
189 * @param[in] last Address to the last element to be erased
190 * @param[in] elementSize Size of one of the elements to be erased
191 * @return Address pointing to the next element of the last one
193 char* Erase(char* first, char* last, SizeType elementSize);
196 * @brief Copies a number of bytes from \e source to \e destination.
198 * \e source and \e destination must not overlap.
201 * @param[in] destination Pointer to the destination address
202 * @param[in] source Pointer to the source address
203 * @param[in] numberOfBytes The number of bytes to be copied
205 void CopyMemory(char* destination, const char* source, size_t numberOfBytes);
208 * @brief Replace the data as new data address.
209 * After replace, release the old data.
211 * It will be used when we want to keep the mData integrity.
213 * Does not call destructors on objects held.
214 * @param[in] newData new data address to be replaced
216 void Replace(void* newData);
219 // not copyable as it does not know the size of elements
220 VectorBase(const VectorBase&) = delete; ///< Deleted copy constructor. @SINCE_1_0.0
221 VectorBase& operator=(const VectorBase&) = delete; ///< Deleted copy assignment operator. @SINCE_1_0.0
223 // not movable as this is handled by deriving classes
224 VectorBase(VectorBase&&) = delete; ///< Deleted move constructor. @SINCE_1_9.25
225 VectorBase& operator=(VectorBase&&) = delete; ///< Deleted copy assignment operator. @SINCE_1_9.25
228 void* mData; ///< Pointer to the data.
233 * @brief Vector algorithm variant for trivial types.
235 * Trivial types do not need destructor or copy constructor called.
238 template<bool IsTrivial>
239 class VectorAlgorithms : public VectorBase
241 protected: // API for deriving classes
242 using SizeType = VectorBase::SizeType;
245 * @brief Empty constructor.
248 VectorAlgorithms() = default;
251 * @brief Empty destructor.
254 ~VectorAlgorithms() = default;
257 * @brief Copy vector contents.
260 * @param[in] rhs VectorBase object to copy from
261 * @param[in] elementSize Size of the content
263 void Copy(const VectorBase& rhs, SizeType elementSize)
265 if(rhs.Capacity() > 0u)
267 VectorBase::Copy(rhs, elementSize);
271 VectorBase::Release();
276 * @brief Reserves space in the vector.
279 * @param[in] count Count of elements to reserve
280 * @param[in] elementSize Size of a single element
282 void Reserve(SizeType count, SizeType elementSize)
284 VectorBase::Reserve(count, elementSize);
288 * @brief Resizes the vector. Does not change capacity.
291 * @param[in] count Count to resize to
292 * @param[in] elementSize Size of a single element
294 void Resize(SizeType count, SizeType elementSize)
296 // reserve will copy old elements as well
297 Reserve(count, elementSize);
301 * @brief Clears the contents.
303 * For simple types, nothing to do.
310 VectorBase::SetCount(0u);
315 * @brief Releases the vector.
320 VectorBase::Release();
324 * @brief Erases an element. Does not change capacity.
327 * @param[in] address Address to erase from
328 * @param[in] elementSize Size to erase
330 void Erase(uint8_t* address, SizeType elementSize)
332 VectorBase::Erase(reinterpret_cast<char*>(address), elementSize);
336 * @brief Erases a range of elements. Does not change capacity.
339 * @param[in] first Address to the first element to be erased
340 * @param[in] last Address to the last element to be erased
341 * @param[in] elementSize Size of one of the elements to be erased
342 * @return Address pointing to the next element of the last one
344 uint8_t* Erase(uint8_t* first, uint8_t* last, SizeType elementSize)
346 return reinterpret_cast<uint8_t*>(VectorBase::Erase(reinterpret_cast<char*>(first), reinterpret_cast<char*>(last), elementSize));
350 * @brief Inserts the given elements into the vector.
353 * @param[in] at Address where to insert the elements into the vector
354 * @param[in] from Address to the first element to be inserted
355 * @param[in] to Address to the last element to be inserted
356 * @param[in] elementSize Size of one of the elements to be inserted
358 void Insert(uint8_t* at, uint8_t* from, uint8_t* to, SizeType elementSize)
360 const SizeType size = to - from;
361 const SizeType count = Count();
362 const SizeType newCount = count + size / elementSize;
364 if(newCount > Capacity())
366 // Calculate the at offset as the pointer is invalid after the Reserve() call.
367 std::size_t offset = at - reinterpret_cast<uint8_t*>(mData);
370 Reserve(NextPowerOfTwo(static_cast<uint32_t>(newCount)), elementSize); // reserve enough space to store at least the next power of two elements of the new required size.
372 // Set the new at pointer.
373 at = reinterpret_cast<uint8_t*>(mData) + offset;
375 // set new count first as otherwise the debug assert will hit us
378 // Move current items to a new position inside the vector.
379 CopyMemory(reinterpret_cast<char*>(at + size),
380 reinterpret_cast<const char*>(at),
381 (reinterpret_cast<uint8_t*>(mData) + count * elementSize) - at);
383 // Copy the given items.
384 CopyMemory(reinterpret_cast<char*>(at), reinterpret_cast<const char*>(from), size);
391 * @brief Vector algorithm variant for complex types.
393 * Not yet supported so will lead to compile error
394 * as constructor and destructor are private.
395 * TODO add support for this variant.
399 class VectorAlgorithms<false> : public VectorBase
402 VectorAlgorithms() = default;
403 ~VectorAlgorithms() = default;
408 * @brief Vector class with minimum space allocation when it's empty.
411 * @param type The type of the data that the vector holds
413 template<class T, bool IsTrivialType = TypeTraits<T>::IS_TRIVIAL_TYPE == true>
414 class Vector : public VectorAlgorithms<IsTrivialType>
418 * @brief Type definitions.
421 using SizeType = VectorBase::SizeType; ///< Size type @SINCE_1_0.0
422 using Iterator = T*; ///< Most simple Iterator is a pointer @SINCE_1_0.0
423 using ConstIterator = const T*; ///< Const iterator @SINCE_1_0.0
424 using ItemType = T; ///< Item type @SINCE_1_0.0
427 * @brief Enumeration for BaseType.
432 BaseType = IsTrivialType ///< @SINCE_1_0.0
436 * @brief Default constructor. Does not allocate any space.
442 * @brief Destructor. Releases the allocated space.
451 * @brief Copy constructor.
454 * @param[in] vector Vector to copy from
456 Vector(const Vector& vector)
458 // reuse copy assignment
463 * @brief Default move constructor.
466 * @param[in] vector Vector to move
468 Vector(Vector&& vector)
470 // reuse move assignment
471 operator=(std::move(vector));
475 * @brief Assignment operator.
478 * @param[in] vector Vector to assign from
479 * @return Reference to self for chaining
481 Vector& operator=(const Vector& vector)
485 VectorAlgorithms<BaseType>::Copy(vector, sizeof(ItemType));
491 * @brief Default move assignment operator.
494 * @param[in] vector Vector to move
496 Vector& operator=(Vector&& vector)
500 VectorAlgorithms<BaseType>::Replace(vector.mData);
501 vector.mData = nullptr;
507 * @brief Iterator to the beginning of the data.
509 * @return Iterator to the beginning of the data
511 Iterator Begin() const
513 ItemType* address = reinterpret_cast<ItemType*>(VectorBase::mData);
518 * @brief Iterator to the end of the data (one past last element).
520 * @return Iterator to the end of the data (one past last element)
524 ItemType* address = reinterpret_cast<ItemType*>(VectorBase::mData);
525 address += VectorBase::Count();
530 * Support for C++11 Range-based for loop: for( item : container ).
532 * @return The start iterator
534 Iterator begin() const
540 * Support for C++11 Range-based for loop: for( item : container ).
542 * @return The end iterator
550 * @brief Subscript operator.
552 * @param[in] index Index of the element
553 * @return Reference to the element for given index
554 * @pre Index must be in the vector's range.
556 ItemType& operator[](SizeType index)
558 // reuse the const version
559 return const_cast<ItemType&>(const_cast<const Vector<ItemType>&>(*this)[index]);
563 * @brief Subscript operator.
565 * @param[in] index Index of the element
566 * @return Reference to the element for given index
567 * @pre Index must be in the vector's range.
569 const ItemType& operator[](SizeType index) const
571 DALI_ASSERT_VECTOR(VectorBase::mData && "Vector is empty");
572 DALI_ASSERT_VECTOR(index < VectorBase::Count() && "Index out of bounds");
573 ItemType* address = reinterpret_cast<ItemType*>(VectorBase::mData);
579 * @brief Pushes back an element to the vector.
581 * The underlying storage may be reallocated to provide space.
582 * If this occurs, all pre-existing pointers into the vector will
586 * @param[in] element Element to be added
588 void PushBack(const ItemType& element)
590 const SizeType count = VectorBase::Count();
591 const SizeType newCount = count + 1u;
592 const SizeType capacity = VectorBase::Capacity();
593 if(newCount > capacity)
596 Reserve(newCount << 1u); // reserve double the current count
598 // set new count first as otherwise the debug assert will hit us
599 VectorBase::SetCount(newCount);
600 operator[](count) = element;
604 * @brief Inserts an element to the vector.
606 * Elements after \e at are moved one position to the right.
608 * The underlying storage may be reallocated to provide space.
609 * If this occurs, all pre-existing pointers into the vector will
613 * @param[in] at Iterator where to insert the elements into the vector
614 * @param[in] element An element to be added
615 * @pre Iterator at must be in the vector's range ( Vector::Begin(), Vector::End() ).
617 void Insert(Iterator at, const ItemType& element)
619 DALI_ASSERT_VECTOR((at <= End()) && (at >= Begin()) && "Iterator not inside vector");
620 const SizeType size = sizeof(ItemType);
621 uint8_t* address = const_cast<uint8_t*>(reinterpret_cast<const uint8_t*>(&element));
622 VectorAlgorithms<BaseType>::Insert(reinterpret_cast<uint8_t*>(at),
629 * @brief Inserts the given elements into the vector.
631 * Elements after \e at are moved the number of given elements positions to the right.
633 * The underlying storage may be reallocated to provide space.
634 * If this occurs, all pre-existing pointers into the vector will
638 * @param[in] at Iterator where to insert the elements into the vector
639 * @param[in] from Iterator to the first element to be inserted
640 * @param[in] to Iterator to the last element to be inserted
641 * @pre Iterator \e at must be in the vector's range ( Vector::Begin(), Vector::End() ).
642 * @pre Iterators \e from and \e to must be valid iterators.
643 * @pre Iterator \e from must not be grater than Iterator \e to.
646 void Insert(Iterator at, Iterator from, Iterator to)
648 DALI_ASSERT_VECTOR((at <= End()) && (at >= Begin()) && "Iterator not inside vector");
649 DALI_ASSERT_VECTOR((from <= to) && "from address can't be greater than to");
657 VectorAlgorithms<BaseType>::Insert(reinterpret_cast<uint8_t*>(at),
658 reinterpret_cast<uint8_t*>(from),
659 reinterpret_cast<uint8_t*>(to),
664 * @brief Reserves space in the vector.
666 * Reserving less than current Capacity is a no-op.
668 * @param[in] count Count of elements to reserve
670 void Reserve(SizeType count)
672 VectorAlgorithms<BaseType>::Reserve(count, sizeof(ItemType));
676 * @brief Resizes the vector. Does not change capacity.
679 * @param[in] count Count to resize to
681 void Resize(SizeType count)
683 ItemType item = ItemType();
688 * @brief Resizes the vector without initializing the data.
690 * Can be used as a data container for reading whole file content.
692 * @param[in] count Count to resize to
694 void ResizeUninitialized(SizeType count)
697 VectorBase::SetCount(count);
701 * @brief Resizes the vector. Does not change capacity.
704 * @param[in] count Count to resize to
705 * @param[in] item An item to insert to the new indices
707 void Resize(SizeType count, const ItemType& item)
709 const SizeType oldCount = VectorBase::Count();
710 if(count <= oldCount)
712 // getting smaller so just set count
713 VectorBase::SetCount(count);
717 // remember how many new items get added
718 SizeType newItems = count - oldCount;
720 for(; newItems > 0u; --newItems)
728 * @brief Erases an element.
730 * Does not change capacity. Other elements get moved.
733 * @param[in] iterator Iterator pointing to the item to remove
734 * @return Iterator pointing to next element
735 * @pre Iterator \e iterator must be within the vector's range ( Vector::Begin(), Vector::End() - 1 ).
738 Iterator Erase(Iterator iterator)
740 DALI_ASSERT_VECTOR((iterator < End()) && (iterator >= Begin()) && "Iterator not inside vector");
741 if(iterator < (End() - 1u))
743 VectorAlgorithms<BaseType>::Erase(reinterpret_cast<uint8_t*>(iterator), sizeof(ItemType));
747 // just remove the element
754 * @brief Erases a range of elements.
756 * Does not change capacity. Other elements get moved.
759 * @param[in] first Iterator to the first element to be erased
760 * @param[in] last Iterator to the last element to be erased
762 * @return Iterator pointing to the next element of the last one
763 * @pre Iterator \e first must be in the vector's range ( Vector::Begin(), Vector::End() ).
764 * @pre Iterator \e last must be in the vector's range ( Vector::Begin(), Vector::End() ).
765 * @pre Iterator \e first must not be grater than Iterator \e last.
768 Iterator Erase(Iterator first, Iterator last)
770 DALI_ASSERT_VECTOR((first <= End()) && (first >= Begin()) && "Iterator not inside vector");
771 DALI_ASSERT_VECTOR((last <= End()) && (last >= Begin()) && "Iterator not inside vector");
772 DALI_ASSERT_VECTOR((first <= last) && "first iterator greater than last");
774 Iterator nextElement;
778 // Erase up to the end.
779 VectorBase::SetCount(VectorBase::Count() - (last - first));
784 nextElement = reinterpret_cast<Iterator>(VectorAlgorithms<BaseType>::Erase(reinterpret_cast<uint8_t*>(first),
785 reinterpret_cast<uint8_t*>(last),
793 * @brief Removes an element.
795 * Does not maintain order. Swaps the element with end and
796 * decreases size by one. This is much faster than Erase so use
797 * this in case order does not matter. Does not change capacity.
800 * @param[in] iterator Iterator pointing to the item to remove
801 * @pre Iterator \e iterator must be in the vector's range ( Vector::Begin(), Vector::End() - 1 ).
804 void Remove(Iterator iterator)
806 DALI_ASSERT_VECTOR((iterator < End()) && (iterator >= Begin()) && "Iterator not inside vector");
808 Iterator last = End() - 1u;
811 std::swap(*iterator, *last);
813 VectorBase::SetCount(VectorBase::Count() - 1u);
817 * @brief Swaps the contents of two vectors.
820 * @param[in] vector Vector to swap with
822 void Swap(Vector& vector)
824 VectorBase::Swap(vector);
828 * @brief Clears the contents of the vector. Keeps its capacity.
833 VectorAlgorithms<BaseType>::Clear();
837 * @brief Releases the memory that the vector holds.
842 VectorAlgorithms<BaseType>::Release();
847 * @brief Erases all elements that compare equal to value from the vector.
850 * @param[in] vector The vector
851 * @param[in] value The value to be removed.
853 template<class T, class U>
854 inline void Erase(Dali::Vector<T>& vector, const U& value)
856 auto begin = vector.Begin();
857 auto end = vector.End();
859 vector.Erase(std::remove(begin, end, value), end);
863 * @brief Erases all elements that satisfy the predicate from the vector.
866 * @param[in] vector The vector
867 * @param[in] predicate The predicate
869 template<class T, class Predicate>
870 inline void EraseIf(Dali::Vector<T>& vector, Predicate predicate)
872 auto begin = vector.Begin();
873 auto end = vector.End();
875 vector.Erase(std::remove_if(begin, end, predicate), end);
883 #endif // DALI_VECTOR_H