[core] don't use unordered_* collections for things we need to sort anyway
This commit is contained in:
@@ -3,9 +3,9 @@
|
||||
#include <mbgl/tile/tile_id.hpp>
|
||||
#include <mbgl/util/clip_id.hpp>
|
||||
|
||||
#include <unordered_set>
|
||||
#include <set>
|
||||
#include <vector>
|
||||
#include <unordered_map>
|
||||
#include <map>
|
||||
|
||||
namespace mbgl {
|
||||
namespace algorithm {
|
||||
@@ -17,12 +17,12 @@ private:
|
||||
void add(const CanonicalTileID &p);
|
||||
bool operator==(const Leaf &other) const;
|
||||
|
||||
std::unordered_set<CanonicalTileID> children;
|
||||
std::set<CanonicalTileID> children;
|
||||
ClipID& clip;
|
||||
};
|
||||
|
||||
uint8_t bit_offset = 0;
|
||||
std::unordered_multimap<UnwrappedTileID, Leaf> pool;
|
||||
std::multimap<UnwrappedTileID, Leaf> pool;
|
||||
|
||||
public:
|
||||
template <typename Renderable>
|
||||
|
||||
@@ -10,7 +10,7 @@ struct Renderable {
|
||||
bool used = true;
|
||||
|
||||
bool operator==(const Renderable& rhs) const {
|
||||
return clip == rhs.clip;
|
||||
return id == rhs.id && clip == rhs.clip;
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
Reference in New Issue
Block a user