-#ifndef __DALI_VECTOR_H__
-#define __DALI_VECTOR_H__
+#ifndef DALI_VECTOR_H
+#define DALI_VECTOR_H
/*
- * Copyright (c) 2018 Samsung Electronics Co., Ltd.
+ * Copyright (c) 2019 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.
* @param[in] elementSize Size to erase
* @pre Last element cannot be erased as there is nothing to move.
*/
- void Erase( uint8_t* address, SizeType elementSize );
+ void Erase( char* address, SizeType elementSize );
/**
* @brief Erases a range of elements.
* @param[in] elementSize Size of one of the elements to be erased
* @return Address pointing to the next element of the last one
*/
- uint8_t* Erase( uint8_t* first, uint8_t* last, SizeType elementSize );
+ char* Erase( char* first, char* last, SizeType elementSize );
/**
* @brief Copies a number of bytes from \e source to \e destination.
* @param[in] source Pointer to the source address
* @param[in] numberOfBytes The number of bytes to be copied
*/
- void CopyMemory( uint8_t* destination, const uint8_t* source, size_t numberOfBytes );
+ void CopyMemory( char* destination, const char* source, size_t numberOfBytes );
private:
- // not copiable as it does not know the size of elements
+ // not copyable as it does not know the size of elements
VectorBase( const VectorBase& ); ///< Undefined @SINCE_1_0.0
VectorBase& operator=( const VectorBase& ); ///< Undefined @SINCE_1_0.0
};
+/// @cond internal
/**
* @brief Vector algorithm variant for trivial types.
*
*/
void Erase( uint8_t* address, SizeType elementSize )
{
- VectorBase::Erase( address, elementSize );
+ VectorBase::Erase( reinterpret_cast< char* >( address ), elementSize );
}
/**
*/
uint8_t* Erase( uint8_t* first, uint8_t* last, SizeType elementSize )
{
- return VectorBase::Erase( first, last, elementSize );
+ return reinterpret_cast< uint8_t* >( VectorBase::Erase( reinterpret_cast< char* >( first ), reinterpret_cast< char *>( last ), elementSize ) );
}
/**
SetCount( newCount );
// Move current items to a new position inside the vector.
- CopyMemory( at + size,
- at,
+ CopyMemory( reinterpret_cast< char* >( at + size ),
+ reinterpret_cast< const char* >( at ),
( reinterpret_cast<uint8_t*>( mData ) + count * elementSize ) - at );
// Copy the given items.
- CopyMemory( at, from, size );
+ CopyMemory( reinterpret_cast< char* >( at ), reinterpret_cast< const char* >( from ), size );
}
};
+/// @endcond
+/// @cond internal
/**
* @brief Vector algorithm variant for complex types.
*
~VectorAlgorithms()
{ }
};
+/// @endcond
/**
* @brief Vector class with minimum space allocation when it's empty.
*/
} // namespace Dali
-#endif /* __DALI_VECTOR_H__ */
+#endif // DALI_VECTOR_H