#define __DALI_VECTOR_H__
/*
- * Copyright (c) 2014 Samsung Electronics Co., Ltd.
+ * Copyright (c) 2017 Samsung Electronics Co., Ltd.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
*
*/
-
// EXTERNAL INCLUDES
#include <cstddef>
+#include <algorithm>
// INTERNAL INCLUDES
#include <dali/public-api/common/dali-common.h>
+#include <dali/public-api/common/type-traits.h>
+#include <dali/public-api/math/math-utils.h>
/**
- * @brief For DALi internal use asserts are enabled in debug builds.
+ * @brief For DALi internal use, asserts are enabled in debug builds.
*
- * For Application use asserts can be enabled manually.
+ * For Application use, asserts can be enabled manually.
+ * @SINCE_1_0.0
*/
#if defined( DEBUG_ENABLED )
#define ENABLE_VECTOR_ASSERTS
#define DALI_ASSERT_VECTOR(cond)
#endif
-namespace Dali DALI_IMPORT_API
+namespace Dali
{
+/**
+ * @addtogroup dali_core_common
+ * @{
+ */
/**
* @brief Base class to handle the memory of simple vector.
*
* Memory layout is such that it has two std::size_t to hold the count
- * and capacity of the vector. mData is adjusted so that it points to the
+ * and capacity of the vector. VectorBase::mData is adjusted so that it points to the
* beginning of the first real item so that iterating the items is quick.
+ * @SINCE_1_0.0
*/
-class VectorBase
+class DALI_IMPORT_API VectorBase
{
public: // Typedefs
/**
* @brief Default constructor. Does not allocate space.
+ * @SINCE_1_0.0
*/
VectorBase();
* @brief Destructor.
*
* Does not release the space. Derived class needs to call Release.
- * Not virtual as should not be called directly and we do not want
+ * Not virtual as this should not be called directly and we do not want
* a vtable for this class as it would unnecessarily increase size.
+ * @SINCE_1_0.0
*/
~VectorBase();
public: // API
/**
- * @brief This method is inlined as its needed frequently for End() iterator.
+ * @brief This method is inlined as it's needed frequently for Vector::End() iterator.
*
- * @return The count of elements in this vector.
+ * @SINCE_1_0.0
+ * @return The count of elements in this vector
*/
SizeType Count() const
{
- SizeType items = 0;
+ SizeType items = 0u;
if( mData )
{
SizeType* metadata = reinterpret_cast< SizeType* >( mData );
- items = *(metadata - 1);
+ items = *(metadata - 1u);
}
return items;
}
-
/**
- * @return The count of elements in this vector.
+ * @brief Gets the count of elements in this vector.
+ * @SINCE_1_0.0
+ * @return The count of elements in this vector
*/
SizeType Size() const
{
}
/**
- * @return The capacity of this vector.
+ * @brief @ return if the vector is empty.
+ * @SINCE_1_0.0
+ * @return True if the count of elements is empty
+ */
+ bool Empty() const
+ {
+ return Count() == 0u;
+ }
+
+ /**
+ * @brief Gets the capacity of this vector.
+ * @SINCE_1_0.0
+ * @return The capacity of this vector
*/
SizeType Capacity() const;
/**
- * @brief Release the data.
+ * @brief Releases the data.
*
* Does not call destructors on objects held.
+ * @SINCE_1_0.0
*/
void Release();
/**
* @brief Helper to set the count.
*
- * @param count Number of elements in the vector.
+ * @SINCE_1_0.0
+ * @param[in] count Number of elements in the vector
*/
void SetCount( SizeType count );
/**
- * @brief Reserve space in the vector.
+ * @brief Reserves space in the vector.
*
- * @param count of elements to reserve.
- * @param elementSize of a single element.
+ * @SINCE_1_0.0
+ * @param[in] count Count of elements to reserve
+ * @param[in] elementSize Size of a single element
*/
void Reserve( SizeType count, SizeType elementSize );
/**
* @brief Copy a vector.
*
- * @param vector Vector to copy from.
- * @param elementSize of a single element.
+ * @SINCE_1_0.0
+ * @param[in] vector Vector to copy from
+ * @param[in] elementSize Size of a single element
*/
void Copy( const VectorBase& vector, SizeType elementSize );
/**
- * @brief Swap the contents of two vectors.
+ * @brief Swaps the contents of two vectors.
*
- * @param vector Vector to swap with.
+ * @SINCE_1_0.0
+ * @param[in] vector Vector to swap with
*/
void Swap( VectorBase& vector );
/**
- * @brief Erase an element.
+ * @brief Erases an element.
*
* Does not change capacity.
- * @pre last element cannot be erased as there is nothing to move.
- * @param address to erase from.
- * @param elementSize to erase.
+ * @SINCE_1_0.0
+ * @param[in] address Address to erase from
+ * @param[in] elementSize Size to erase
+ * @pre Last element cannot be erased as there is nothing to move.
*/
void Erase( char* address, SizeType elementSize );
+ /**
+ * @brief Erases a range of elements.
+ *
+ * Does not change capacity.
+ * @SINCE_1_0.0
+ * @param[in] first Address to the first element to be erased
+ * @param[in] last Address to the last element to be erased
+ * @param[in] elementSize Size of one of the elements to be erased
+ * @return Address pointing to the next element of the last one
+ */
+ char* Erase( char* first, char* last, SizeType elementSize );
+
+ /**
+ * @brief Copies a number of bytes from \e source to \e destination.
+ *
+ * \e source and \e destination must not overlap.
+ *
+ * @SINCE_1_0.0
+ * @param[in] destination Pointer to the destination address
+ * @param[in] source Pointer to the source address
+ * @param[in] numberOfBytes The number of bytes to be copied
+ */
+ void CopyMemory( char* destination, const char* source, size_t numberOfBytes );
+
private:
// not copiable as it does not know the size of elements
- VectorBase( const VectorBase& ); ///< Undefined
- VectorBase& operator=( const VectorBase& ); ///< Undefined
+ VectorBase( const VectorBase& ); ///< Undefined @SINCE_1_0.0
+ VectorBase& operator=( const VectorBase& ); ///< Undefined @SINCE_1_0.0
protected: // Data
* @brief Vector algorithm variant for trivial types.
*
* Trivial types do not need destructor or copy constructor called.
+ * @SINCE_1_0.0
*/
template< bool IsTrivial >
class VectorAlgorithms : public VectorBase
/**
* @brief Empty constructor.
+ * @SINCE_1_0.0
*/
VectorAlgorithms()
{ }
/**
* @brief Empty destructor.
+ * @SINCE_1_0.0
*/
~VectorAlgorithms()
{ }
/**
* @brief Copy vector contents.
*
- * @param rhs to copy from.
- * @param elementSize of the content.
+ * @SINCE_1_0.0
+ * @param[in] rhs VectorBase object to copy from
+ * @param[in] elementSize Size of the content
*/
void Copy( const VectorBase& rhs, SizeType elementSize )
{
}
/**
- * @brief Reserve space in the vector.
+ * @brief Reserves space in the vector.
*
- * @param count of elements to reserve.
- * @param elementSize of a single element.
+ * @SINCE_1_0.0
+ * @param[in] count Count of elements to reserve
+ * @param[in] elementSize Size of a single element
*/
void Reserve( SizeType count, SizeType elementSize )
{
}
/**
- * @brief Resize the vector. Does not change capacity.
+ * @brief Resizes the vector. Does not change capacity.
*
- * @param count to resize to.
- * @param elementSize of a single element.
+ * @SINCE_1_0.0
+ * @param[in] count Count to resize to
+ * @param[in] elementSize Size of a single element
*/
void Resize( SizeType count, SizeType elementSize )
{
}
/**
- * @brief Clear the contents.
+ * @brief Clears the contents.
*
- * For simple types nothing to do.
+ * For simple types, nothing to do.
+ * @SINCE_1_0.0
*/
void Clear()
{
}
/**
- * @brief Release the vector.
+ * @brief Releases the vector.
+ * @SINCE_1_0.0
*/
void Release()
{
}
/**
- * @brief Erase an element. Does not change capacity.
+ * @brief Erases an element. Does not change capacity.
*
- * @param address to erase from.
- * @param elementSize to erase.
+ * @SINCE_1_0.0
+ * @param[in] address Address to erase from
+ * @param[in] elementSize Size to erase
*/
void Erase( char* address, SizeType elementSize )
{
VectorBase::Erase( address, elementSize );
}
+ /**
+ * @brief Erases a range of elements. Does not change capacity.
+ *
+ * @SINCE_1_0.0
+ * @param[in] first Address to the first element to be erased
+ * @param[in] last Address to the last element to be erased
+ * @param[in] elementSize Size of one of the elements to be erased
+ * @return Address pointing to the next element of the last one
+ */
+ char* Erase( char* first, char* last, SizeType elementSize )
+ {
+ return VectorBase::Erase( first, last, elementSize );
+ }
+
+ /**
+ * @brief Inserts the given elements into the vector.
+ *
+ * @SINCE_1_0.0
+ * @param[in] at Address where to insert the elements into the vector
+ * @param[in] from Address to the first element to be inserted
+ * @param[in] to Address to the last element to be inserted
+ * @param[in] elementSize Size of one of the elements to be inserted
+ */
+ void Insert( char* at, char* from, char* to, SizeType elementSize )
+ {
+ const SizeType size = to - from;
+ const SizeType count = Count();
+ const SizeType newCount = count + size / elementSize;
+
+ if( newCount > Capacity() )
+ {
+ // Calculate the at offset as the pointer is invalid after the Reserve() call.
+ std::size_t offset = at - reinterpret_cast<char*>( mData );
+
+ // need more space
+ Reserve( NextPowerOfTwo( newCount ), elementSize ); // reserve enough space to store at least the next power of two elements of the new required size.
+
+ // Set the new at pointer.
+ at = reinterpret_cast<char*>( mData ) + offset;
+ }
+ // set new count first as otherwise the debug assert will hit us
+ SetCount( newCount );
+
+ // Move current items to a new position inside the vector.
+ CopyMemory( at + size,
+ at,
+ ( reinterpret_cast<char*>( mData ) + count * elementSize ) - at );
+
+ // Copy the given items.
+ CopyMemory( at, from, size );
+ }
};
/**
* Not yet supported so will lead to compile error
* as constructor and destructor are private.
* TODO add support for this variant.
+ * @SINCE_1_0.0
*/
template<>
class VectorAlgorithms< false > : public VectorBase
};
/**
- * @brief Vector class with minimum space allocation when its empty.
+ * @brief Vector class with minimum space allocation when it's empty.
*
- * @param type of the data that the vector holds.
+ * @SINCE_1_0.0
+ * @param type The type of the data that the vector holds
*/
-template< class T, bool IsTrivialType = __has_trivial_destructor(T) && __has_trivial_copy(T) >
+template< class T, bool IsTrivialType = TypeTraits<T>::IS_TRIVIAL_TYPE == true >
class Vector : public VectorAlgorithms< IsTrivialType >
{
public: // API
/**
* @brief Type definitions.
+ * @SINCE_1_0.0
*/
- typedef VectorBase::SizeType SizeType;
- typedef T* Iterator; ///< Most simple Iterator is a pointer
- typedef const T* ConstIterator;
- typedef T ItemType;
+ typedef VectorBase::SizeType SizeType; ///< Size type @SINCE_1_0.0
+ typedef T* Iterator; ///< Most simple Iterator is a pointer @SINCE_1_0.0
+ typedef const T* ConstIterator; ///< Const iterator @SINCE_1_0.0
+ typedef T ItemType; ///< Item type @SINCE_1_0.0
+ /**
+ * @brief Enumeration for BaseType.
+ * @SINCE_1_0.0
+ */
enum
{
- BaseType = IsTrivialType
+ BaseType = IsTrivialType ///< @SINCE_1_0.0
};
/**
* @brief Default constructor. Does not allocate any space.
+ * @SINCE_1_0.0
*/
Vector()
{ }
/**
* @brief Destructor. Releases the allocated space.
+ * @SINCE_1_0.0
*/
~Vector()
{
/**
* @brief Copy constructor.
*
- * @param vector Vector to copy from.
+ * @SINCE_1_0.0
+ * @param[in] vector Vector to copy from
*/
Vector( const Vector& vector )
{
/**
* @brief Assignment operator.
*
- * @param vector Vector to assign from.
- * @return reference to self for chaining.
+ * @SINCE_1_0.0
+ * @param[in] vector Vector to assign from
+ * @return Reference to self for chaining
*/
Vector& operator=( const Vector& vector )
{
}
/**
- * @return Iterator to the beginning of the data.
+ * @brief Iterator to the beginning of the data.
+ * @SINCE_1_0.0
+ * @return Iterator to the beginning of the data
*/
Iterator Begin() const
{
}
/**
- * @return Iterator to the end of the data (one past last element).
+ * @brief Iterator to the end of the data (one past last element).
+ * @SINCE_1_0.0
+ * @return Iterator to the end of the data (one past last element)
*/
Iterator End() const
{
}
/**
- * @param index of the element.
- * @return reference to the element for given index.
+ * Support for C++11 Range-based for loop: for( item : container ).
+ * @SINCE_1_2.60
+ * @return The start iterator
+ */
+ Iterator begin() const
+ {
+ return Begin();
+ }
+
+ /**
+ * Support for C++11 Range-based for loop: for( item : container ).
+ * @SINCE_1_2.60
+ * @return The end iterator
+ */
+ Iterator end() const
+ {
+ return End();
+ }
+
+ /**
+ * @brief Subscript operator.
+ * @SINCE_1_0.0
+ * @param[in] index Index of the element
+ * @return Reference to the element for given index
+ * @pre Index must be in the vector's range.
*/
ItemType& operator[]( SizeType index )
{
}
/**
- * @param index of the element.
- * @return reference to the element for given index.
+ * @brief Subscript operator.
+ * @SINCE_1_0.0
+ * @param[in] index Index of the element
+ * @return Reference to the element for given index
+ * @pre Index must be in the vector's range.
*/
const ItemType& operator[]( SizeType index ) const
{
}
/**
- * @brief Push back an element to the vector.
+ * @brief Pushes back an element to the vector.
+ *
+ * The underlying storage may be reallocated to provide space.
+ * If this occurs, all pre-existing pointers into the vector will
+ * become invalid.
*
- * @param element to be added.
+ * @SINCE_1_0.0
+ * @param[in] element Element to be added
*/
void PushBack( const ItemType& element )
{
if( newCount > capacity )
{
// need more space
- Reserve( newCount << 1 ); // reserve double the current count
+ Reserve( newCount << 1u ); // reserve double the current count
}
// set new count first as otherwise the debug assert will hit us
VectorBase::SetCount( newCount );
}
/**
- * @brief Reserve space in the vector.
+ * @brief Inserts an element to the vector.
+ *
+ * Elements after \e at are moved one position to the right.
+ *
+ * The underlying storage may be reallocated to provide space.
+ * If this occurs, all pre-existing pointers into the vector will
+ * become invalid.
+ *
+ * @SINCE_1_0.0
+ * @param[in] at Iterator where to insert the elements into the vector
+ * @param[in] element An element to be added
+ * @pre Iterator at must be in the vector's range ( Vector::Begin(), Vector::End() ).
+ */
+ void Insert( Iterator at, const ItemType& element )
+ {
+ DALI_ASSERT_VECTOR( ( at <= End() ) && ( at >= Begin() ) && "Iterator not inside vector" );
+ const SizeType size = sizeof( ItemType );
+ char* address = const_cast<char*>( reinterpret_cast<const char*>( &element ) );
+ VectorAlgorithms<BaseType>::Insert( reinterpret_cast< char* >( at ),
+ address,
+ address + size,
+ size );
+ }
+
+ /**
+ * @brief Inserts the given elements into the vector.
+ *
+ * Elements after \e at are moved the number of given elements positions to the right.
+ *
+ * The underlying storage may be reallocated to provide space.
+ * If this occurs, all pre-existing pointers into the vector will
+ * become invalid.
+ *
+ * @SINCE_1_0.0
+ * @param[in] at Iterator where to insert the elements into the vector
+ * @param[in] from Iterator to the first element to be inserted
+ * @param[in] to Iterator to the last element to be inserted
+ * @pre Iterator \e at must be in the vector's range ( Vector::Begin(), Vector::End() ).
+ * @pre Iterators \e from and \e to must be valid iterators.
+ * @pre Iterator \e from must not be grater than Iterator \e to.
+ *
+ */
+ void Insert( Iterator at, Iterator from, Iterator to )
+ {
+ DALI_ASSERT_VECTOR( ( at <= End() ) && ( at >= Begin() ) && "Iterator not inside vector" );
+ DALI_ASSERT_VECTOR( ( from <= to ) && "from address can't be greater than to" );
+
+ if( from == to )
+ {
+ // nothing to copy.
+ return;
+ }
+
+ VectorAlgorithms<BaseType>::Insert( reinterpret_cast< char* >( at ),
+ reinterpret_cast< char* >( from ),
+ reinterpret_cast< char* >( to ),
+ sizeof( ItemType ) );
+ }
+
+ /**
+ * @brief Reserves space in the vector.
*
* Reserving less than current Capacity is a no-op.
- * @param count of elements to reserve.
+ * @SINCE_1_0.0
+ * @param[in] count Count of elements to reserve
*/
void Reserve( SizeType count )
{
}
/**
- * @brief Resize the vector. Does not change capacity.
+ * @brief Resizes the vector. Does not change capacity.
*
- * @param count to resize to.
- * @param item to insert to the new indeces.
+ * @SINCE_1_0.0
+ * @param[in] count Count to resize to
*/
- void Resize( SizeType count, ItemType item = ItemType() )
+ void Resize( SizeType count )
+ {
+ ItemType item = ItemType();
+ Resize(count, item);
+ }
+
+ /**
+ * @brief Resizes the vector. Does not change capacity.
+ *
+ * @SINCE_1_0.0
+ * @param[in] count Count to resize to
+ * @param[in] item An item to insert to the new indices
+ */
+ void Resize( SizeType count, const ItemType& item )
{
const SizeType oldCount = VectorBase::Count();
if( count <= oldCount )
// remember how many new items get added
SizeType newItems = count - oldCount;
Reserve( count );
- for( ; newItems > 0; --newItems )
+ for( ; newItems > 0u; --newItems )
{
PushBack( item );
}
}
/**
- * @brief Erase an element.
+ * @brief Erases an element.
*
* Does not change capacity. Other elements get moved.
- * @param iterator Iterator pointing to item to remove.
- * @return Iterator pointing to next element.
+ *
+ * @SINCE_1_0.0
+ * @param[in] iterator Iterator pointing to the item to remove
+ * @return Iterator pointing to next element
+ * @pre Iterator \e iterator must be within the vector's range ( Vector::Begin(), Vector::End() - 1 ).
+ *
*/
Iterator Erase( Iterator iterator )
{
- DALI_ASSERT_VECTOR( VectorBase::mData && "Vector is empty" );
- DALI_ASSERT_VECTOR( (iterator < End()) && (iterator >= Begin() ) && "Iterator not inside vector" );
- if( iterator < ( End() - 1 ) )
+ DALI_ASSERT_VECTOR( (iterator < End()) && (iterator >= Begin()) && "Iterator not inside vector" );
+ if( iterator < ( End() - 1u ) )
{
VectorAlgorithms<BaseType>::Erase( reinterpret_cast< char* >( iterator ), sizeof( ItemType ) );
}
}
/**
+ * @brief Erases a range of elements.
+ *
+ * Does not change capacity. Other elements get moved.
+ *
+ * @SINCE_1_0.0
+ * @param[in] first Iterator to the first element to be erased
+ * @param[in] last Iterator to the last element to be erased
+ *
+ * @return Iterator pointing to the next element of the last one
+ * @pre Iterator \e first must be in the vector's range ( Vector::Begin(), Vector::End() ).
+ * @pre Iterator \e last must be in the vector's range ( Vector::Begin(), Vector::End() ).
+ * @pre Iterator \e first must not be grater than Iterator \e last.
+ *
+ */
+ Iterator Erase( Iterator first, Iterator last )
+ {
+ DALI_ASSERT_VECTOR( ( first <= End() ) && ( first >= Begin() ) && "Iterator not inside vector" );
+ DALI_ASSERT_VECTOR( ( last <= End() ) && ( last >= Begin() ) && "Iterator not inside vector" );
+ DALI_ASSERT_VECTOR( ( first <= last ) && "first iterator greater than last" );
+
+ Iterator nextElement;
+
+ if( last == End() )
+ {
+ // Erase up to the end.
+ VectorBase::SetCount( VectorBase::Count() - ( last - first ) );
+ nextElement = End();
+ }
+ else
+ {
+ nextElement = reinterpret_cast<Iterator>( VectorAlgorithms<BaseType>::Erase( reinterpret_cast< char* >( first ),
+ reinterpret_cast< char* >( last ),
+ sizeof( ItemType ) ) );
+ }
+
+ return nextElement;
+ }
+
+ /**
* @brief Removes an element.
*
- * Does not maintain order. Swaps the element with end and
+ * Does not maintain order. Swaps the element with end and
* decreases size by one. This is much faster than Erase so use
* this in case order does not matter. Does not change capacity.
*
- * @param iterator Iterator pointing to item to remove.
+ * @SINCE_1_0.0
+ * @param[in] iterator Iterator pointing to the item to remove
+ * @pre Iterator \e iterator must be in the vector's range ( Vector::Begin(), Vector::End() - 1 ).
+ *
*/
void Remove( Iterator iterator )
{
- DALI_ASSERT_VECTOR( VectorBase::mData && "Vector is empty" );
- Iterator end = End();
- DALI_ASSERT_VECTOR( (iterator < end) && (iterator >= Begin() ) && "Iterator not inside vector" );
- Iterator last = end - 1;
- if( last != iterator )
+ DALI_ASSERT_VECTOR( (iterator < End()) && (iterator >= Begin()) && "Iterator not inside vector" );
+
+ Iterator last = End() - 1u;
+ if( last > iterator )
{
std::swap( *iterator, *last );
}
- VectorBase::SetCount( VectorBase::Count() - 1 );
+ VectorBase::SetCount( VectorBase::Count() - 1u );
}
/**
- * @brief Swap the contents of two vectors.
+ * @brief Swaps the contents of two vectors.
*
- * @param vector Vector to swap with.
+ * @SINCE_1_0.0
+ * @param[in] vector Vector to swap with
*/
void Swap( Vector& vector )
{
}
/**
- * @brief Clear the contents of the vector. Keeps its capacity.
+ * @brief Clears the contents of the vector. Keeps its capacity.
+ * @SINCE_1_0.0
*/
void Clear()
{
}
/**
- * @brief Release the memory that the vector holds.
+ * @brief Releases the memory that the vector holds.
+ * @SINCE_1_0.0
*/
void Release()
{
VectorAlgorithms<BaseType>::Release();
}
-
};
+/**
+ * @}
+ */
} // namespace Dali
#endif /* __DALI_VECTOR_H__ */
projects / platform / core / uifw / dali-core.git / blobdiff