unordered_tire/example/random/memory_1e5.cpp

#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <chrono>
#include <cstdlib>
using namespace std;

#include "tire.h"

const int N = 1e5;
const int M = 5e4;
const int M1 = 3;
const int M2 = 5;

struct Test {
	int a;
	short b;
	int c;
};

vector<long long> umap_times;
vector<long long> tire_times;

vector<string> data_table;
void init_data_table() {
	for (int i = 0; i < N; ++i) {
		char str[32] = "";
		int size = rand() % 30;
		for (int j = 0; j < size; ++j) {
			str[j] = (char)(rand() % 256);
		}
		str[size] = '\0';
		data_table.push_back(str);
	}
}

void umap_test() {
	const int n = data_table.size();
	unordered_map<string, Test> umap;
	for (int i = 0; i < n; ++i) {
		Test t;
		t.a = i;
		t.c = n + i;
		umap.insert({ data_table[i], t });
	}
	for (int i = N * 2; i >= 0; i -= 17) {
		size_t res = umap.erase(to_string(i + 1));
	};
	cout << "umap ";
	system("pause");
}

void tire_test() {
	const int n = data_table.size();
	Tire<Test> tire;
	for (int i = 0; i < n; ++i) {
		Test t;
		t.a = i;
		t.c = n + i;
		tire.insert(data_table[i], t);
	}
	for (int i = N * 2; i >= 0; i -= 17) {
		size_t res = tire.erase(to_string(i + 1));
	};
	cout << "tire ";
	system("pause");
}

void analysis(string name, vector<long long>& nums) {
	const int n = nums.size();
	long long maxn = LLONG_MIN, minn = LLONG_MAX;
	long long sum = 0;
	for (long long& num : nums) {
		maxn = max(maxn, num);
		minn = min(minn, num);
		sum += num;
	}
	cout << name << ": " << "maxn: " << maxn << "ms    " << "minn: " << minn << "ms    " << "avg: " << (1.0 * sum / n) << "ms    " << "sum: " << sum << "ms    " << endl;
}

void print_times(string name, vector<long long>& nums) {
	cout << name << endl;
	for (long long& num : nums) {
		cout << num << " ";
	};
	cout << endl;
}

int main() {
	init_data_table();
	// group 1
	for (int i = 0; i < M1; ++i) {
		umap_test();
		tire_test();
	}

	// group 2
	for (int i = 0; i < M1; ++i) {
		tire_test();
		umap_test();
	}
	return 0;
}