From 575a24b09561162d5051861d5148f478b5784966 Mon Sep 17 00:00:00 2001
From: Eric Fischer <enf@pobox.com>
Date: Thu, 6 Nov 2014 11:29:11 -0800
Subject: [PATCH] Use a set instead of a map to reduce needless memory overhead

---
 tile.cc | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/tile.cc b/tile.cc
index f86719d..b490a21 100644
--- a/tile.cc
+++ b/tile.cc
@@ -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;