From 7d1c689f1e0e18575b37fcc8b6b4e3a9a58ad373 Mon Sep 17 00:00:00 2001
From: Adam Sawicki <adam.sawicki@amd.com>
Date: Tue, 12 Sep 2017 20:57:27 +0200
Subject: [PATCH] Fixes for Linux compilation (not everything fixed yet).

---
 src/vk_mem_alloc.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/vk_mem_alloc.h b/src/vk_mem_alloc.h
index c6dab4b..fcee4aa 100644
--- a/src/vk_mem_alloc.h
+++ b/src/vk_mem_alloc.h
@@ -1226,7 +1226,7 @@ remove them if not needed.
 #include <cassert> // for assert
 #include <algorithm> // for min, max
 #include <mutex> // for std::mutex
-#include <atomic> // for std::atomic_int64_t
+#include <atomic> // for std::atomic_uint32_t
 
 #if !defined(_WIN32)
     #include <malloc.h> // for aligned_alloc()
@@ -1977,7 +1977,7 @@ template<typename CmpLess, typename VectorT>
 bool VmaVectorRemoveSorted(VectorT& vector, const typename VectorT::value_type& value)
 {
     CmpLess comparator;
-    VectorT::iterator it = VmaBinaryFindFirstNotLess(
+    typename VectorT::iterator it = VmaBinaryFindFirstNotLess(
         vector.data(),
         vector.data() + vector.size(),
         value,
@@ -1995,7 +1995,7 @@ template<typename CmpLess, typename VectorT>
 size_t VmaVectorFindSorted(const VectorT& vector, const typename VectorT::value_type& value)
 {
     CmpLess comparator;
-    VectorT::iterator it = VmaBinaryFindFirstNotLess(
+    typename VectorT::iterator it = VmaBinaryFindFirstNotLess(
         vector.data(),
         vector.data() + vector.size(),
         value,