size_t over int on BinSearchArrayMap
This commit is contained in:
@@ -56,12 +56,12 @@ namespace OpenVulkano
|
|||||||
|
|
||||||
Pair& FindPair(const K key)
|
Pair& FindPair(const K key)
|
||||||
{
|
{
|
||||||
int low = 0;
|
size_t low = 0;
|
||||||
int high = m_data.size() - 1;
|
size_t high = m_data.size() - 1;
|
||||||
|
|
||||||
while (low <= high)
|
while (low <= high)
|
||||||
{
|
{
|
||||||
int mid = low + (high - low) / 2;
|
size_t mid = low + (high - low) / 2;
|
||||||
|
|
||||||
if (m_data[mid].first == key)
|
if (m_data[mid].first == key)
|
||||||
{
|
{
|
||||||
|
|||||||
Reference in New Issue
Block a user