diegoripley/tippecanoe
1
0
Fork 0
mirror of https://github.com/felt/tippecanoe.git synced 2026-10-06 10:25:41 +02:00
Code Issues Packages Projects Releases Wiki Activity

Use a set instead of a map to reduce needless memory overhead

Browse Source
This commit is contained in:
Eric Fischer
2014-11-06 11:29:11 -08:00
parent ea292def47
commit 575a24b095
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
tile.cc
+3 -2
View File
@@ -4,6 +4,7 @@
#include <stack> #include <stack>
#include <vector> #include <vector>
#include <map> #include <map>
#include <set>
#include <algorithm> #include <algorithm>
#include <stdio.h> #include <stdio.h>
#include <unistd.h> #include <unistd.h>
@@ -351,7 +352,7 @@ long long write_tile(struct index *start, struct index *end, char *metabase, uns
struct pool keys, values; struct pool keys, values;
pool_init(&keys, 0); pool_init(&keys, 0);
pool_init(&values, 0); pool_init(&values, 0);
std::map<long long, int> dup; std::set<long long> dup;
double interval = 1; double interval = 1;
double seq = 0; double seq = 0;
@@ -375,7 +376,7 @@ long long write_tile(struct index *start, struct index *end, char *metabase, uns
if (dup.count(i->fpos) != 0) { if (dup.count(i->fpos) != 0) {
continue; continue;
} }
dup.insert(std::pair<long long, int>(i->fpos, 1)); dup.insert(i->fpos);
} }
int t = i->type; int t = i->type;