std/compare.hpp: Fix compare for unordered_map

unordered_map is unordered (O.o) so it cannot be compared
by two simultaneous iterators

alib2data/src/std/compare.hpp

@@ -122,9 +122,11 @@ struct compare<unordered_map<T, R>> {
 		if(first.size() < second.size()) return -1;
 		if(first.size() > second.size()) return 1;
-		compare<std::pair<T, R>> comp;
-		for(auto iterF = first.begin(), iterS = second.begin(); iterF != first.end(); iterF++, iterS++) {
-			int res = comp(*iterF, *iterS);
+		compare<R> comp;
+		for(auto iter = first.begin(); iter != first.end(); iter++) {
+			auto search = second.find(iter->first);
+			if(search == second.end()) return -1;
+			int res = comp(iter->second, search->second);
 			if(res != 0) return res;
 		}
 		return 0;