[core] Faster access with unordered_set

The ordering won't be affected because requests are made
as they arrive and later stored on the map just for
keeping state.

1 files changed, 2 insertions, 2 deletions

diff --git a/platform/default/online_file_source.cpp b/platform/default/online_file_source.cpp
index 43c707775d..367777d623 100644
--- a/platform/default/online_file_source.cpp
+++ b/platform/default/online_file_source.cpp
@@ -16,7 +16,7 @@
 #include <algorithm>
 #include <cassert>
 #include <list>
-#include <set>
+#include <unordered_set>
 #include <unordered_map>
 
 namespace mbgl {
@@ -135,7 +135,7 @@ private:
     std::unordered_map<FileRequest*, std::unique_ptr<OnlineFileRequestImpl>> allRequests;
     std::list<FileRequest*> pendingRequestsList;
     std::unordered_map<FileRequest*, std::list<FileRequest*>::iterator> pendingRequestsMap;
-    std::set<FileRequest*> activeRequests;
+    std::unordered_set<FileRequest*> activeRequests;
 
     const std::unique_ptr<HTTPContextBase> httpContext { HTTPContextBase::createContext() };
     util::AsyncTask reachability { std::bind(&Impl::networkIsReachableAgain, this) };