/*
- * Copyright (c) 2015 Samsung Electronics Co., Ltd.
+ * Copyright (c) 2018 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.
* limitations under the License.
*/
-#include "uniform-map.h"
+// CLASS HEADER
+#include <dali/internal/update/common/uniform-map.h>
namespace Dali
{
}
}
-// @todo MESH_REWORK Benchmark and test
-// The uniform map can never grow beyond the limits of GL - so really, the
-// map size is likely to be small; if retaining an unsorted map proves to be
-// slow, then it should be changed to perform an insertion sort.
void UniformMap::Add( UniformPropertyMapping* newMap )
{
UniformPropertyMapping::Hash nameHash = CalculateHash( newMap->uniformName );
return NULL;
}
-unsigned int UniformMap::Count() const
+UniformMap::SizeType UniformMap::Count() const
{
- return mUniformMaps.Count();
+ return static_cast<UniformMap::SizeType>( mUniformMaps.Count() );
}
-const UniformPropertyMapping& UniformMap::operator[]( unsigned int index ) const
+const UniformPropertyMapping& UniformMap::operator[]( UniformMap::SizeType index ) const
{
return *mUniformMaps[index];
}