59 lines
1.5 KiB
C++
59 lines
1.5 KiB
C++
#include <cstdio>
|
|
#include <cstdlib>
|
|
#include <iostream>
|
|
#include <string>
|
|
|
|
#include "mph_map.h"
|
|
|
|
using std::make_pair;
|
|
using std::string;
|
|
using cxxmph::mph_map;
|
|
|
|
int main(int argc, char** argv) {
|
|
mph_map<int64_t, int64_t> b;
|
|
int32_t num_keys = 1000*10;
|
|
for (int i = 0; i < num_keys; ++i) {
|
|
b.insert(make_pair(i, i));
|
|
}
|
|
for (int i = 0; i < num_keys; ++i) {
|
|
auto it = b.find(i);
|
|
if (it == b.end()) {
|
|
std::cerr << "Failed to find " << i << std::endl;
|
|
exit(-1);
|
|
}
|
|
if (it->first != it->second || it->first != i) {
|
|
std::cerr << "Found " << it->first << " looking for " << i << std::endl;
|
|
exit(-1);
|
|
}
|
|
}
|
|
mph_map<string, int> h;
|
|
h.insert(std::make_pair("-1",-1));
|
|
mph_map<string, int>::const_iterator it;
|
|
for (it = h.begin(); it != h.end(); ++it) {
|
|
if (it->second != -1) exit(-1);
|
|
}
|
|
int32_t num_valid = 100;
|
|
for (int i = 0; i < num_valid; ++i) {
|
|
char buf[10];
|
|
snprintf(buf, 10, "%d", i);
|
|
h.insert(std::make_pair(buf, i));
|
|
}
|
|
for (int j = 0; j < 100; ++j) {
|
|
for (int i = 1000; i > 0; --i) {
|
|
char buf[10];
|
|
snprintf(buf, 10, "%d", i - 1);
|
|
auto it = h.find(buf);
|
|
if (i < num_valid && it->second != i - 1) exit(-1);
|
|
}
|
|
}
|
|
for (int j = 0; j < 100; ++j) {
|
|
for (int i = 1000; i > 0; --i) {
|
|
char buf[10];
|
|
int key = i*100 - 1;
|
|
snprintf(buf, 10, "%d", key);
|
|
auto it = h.find(buf);
|
|
if (key < num_valid && it->second != key) exit(-1);
|
|
}
|
|
}
|
|
}
|