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

This commit is contained in:
Eric Fischer 2014-11-06 11:29:11 -08:00
parent ea292def47
commit 575a24b095

View File

@ -4,6 +4,7 @@
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <stdio.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;
pool_init(&keys, 0);
pool_init(&values, 0);
std::map<long long, int> dup;
std::set<long long> dup;
double interval = 1;
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) {
continue;
}
dup.insert(std::pair<long long, int>(i->fpos, 1));
dup.insert(i->fpos);
}
int t = i->type;