feat: Arraylist, fast new container to add front and back

[mehah]

Arraylist is a very fast container for adding to the front and back, it uses two vectors to do this juggling and doesn't allow you to remove the front, as it is slow, use std::deque for this case.

Benchmark
loop: 99999

loop: 999999

constexpr size_t LOOP = 999999;

Benchmark bm;
for (size_t i = 0; i < 999; i++) {
	stdext::arraylist<uint32_t> list;
	list.reserve(LOOP);

	for (size_t d = 0; d < LOOP; d++) {
		if (d % 2) {
			list.emplace_front(d);
		} else {
			list.emplace_back(d);
		}
	}
	for (const auto &v : list) { }
}

g_logger().info("stdext::arraylist + reserve: {}ms", bm.duration());

bm.reset();
bm.start();

for (size_t i = 0; i < 999; i++) {
	stdext::arraylist<uint32_t> list;
	for (size_t d = 0; d < LOOP; d++) {
		if (d % 2) {
			list.emplace_front(d);
		} else {
			list.emplace_back(d);
		}
	}
	for (const auto &v : list) { }
}

g_logger().info("stdext::arraylist: {}ms", bm.duration());

bm.reset();
bm.start();

for (size_t i = 0; i < 999; i++) {
	std::list<uint32_t> list;
	for (size_t d = 0; d < LOOP; d++) {
		if (d % 2) {
			list.emplace_front(d);
		} else {
			list.emplace_back(d);
		}
	}
	for (const auto &v : list) { }
}

g_logger().info("std::list: {}ms", bm.duration());

bm.reset();
bm.start();

for (size_t i = 0; i < 999; i++) {
	std::deque<uint32_t> list;
	for (size_t d = 0; d < LOOP; d++) {
		if (d % 2) {
			list.emplace_front(d);
		} else {
			list.emplace_back(d);
		}
	}
	for (const auto &v : list) { }
}

g_logger().info("std::deque: {}ms", bm.duration());

g_logger().info("--- stdext::arraylist vs std::forward_list vs std::list vs std::deque --- (push_front)");

bm.reset();
bm.start();

for (size_t i = 0; i < 999; i++) {
	stdext::arraylist<uint32_t> list;
	list.reserve(LOOP);
	for (size_t d = 0; d < LOOP; d++) {
		list.emplace_front(d);
	}
	for (const auto &v : list) { }
}

g_logger().info("stdext::arraylist + reserve: {}ms", bm.duration());

bm.reset();
bm.start();

for (size_t i = 0; i < 999; i++) {
	stdext::arraylist<uint32_t> arraylist;
	for (size_t d = 0; d < LOOP; d++) {
		arraylist.emplace_front(d);
	}
	for (const auto &v : arraylist) { }
}

g_logger().info("stdext::arraylist: {}ms", bm.duration());

bm.reset();
bm.start();

for (size_t i = 0; i < 999; i++) {
	std::forward_list<uint32_t> list;
	for (size_t d = 0; d < LOOP; d++) {
		list.emplace_front(d);
	}
	for (const auto &v : list) { }
}

g_logger().info("std::forward_list: {}ms", bm.duration());

bm.reset();
bm.start();

for (size_t i = 0; i < 999; i++) {
	std::list<uint32_t> list;
	for (size_t d = 0; d < LOOP; d++) {
		list.emplace_front(d);
	}
	for (const auto &v : list) { }
}

g_logger().info("std::list: {}ms", bm.duration());

bm.reset();
bm.start();

for (size_t i = 0; i < 999; i++) {
	std::deque<uint32_t> list;
	for (size_t d = 0; d < LOOP; d++) {
		list.emplace_front(d);
	}
	for (const auto &v : list) { }
}

g_logger().info("std::deque: {}ms", bm.duration());

Validating Content

constexpr size_t LOOP = 999999;
stdext::arraylist<uint32_t> arraylist;
arraylist.reserve(LOOP);

for (size_t d = 0; d < LOOP; d++) {
	if (d % 2) {
		arraylist.emplace_front(d);
	} else {
		arraylist.emplace_back(d);
	}
}

std::deque<uint32_t> deque;
for (size_t d = 0; d < LOOP; d++) {
	if (d % 2) {
		deque.emplace_front(d);
	} else {
		deque.emplace_back(d);
	}
}

for (size_t i = 0; i < LOOP; i++) {
	if (arraylist[i] != deque[i]) {
		g_logger().info("NOT EQUAL");
	}
}

g_logger().info("FINISHED");

[sonarqubecloud]

Kudos, SonarCloud Quality Gate passed!   

0 Bugs
0 Vulnerabilities
0 Security Hotspots
0 Code Smells

0.0% Coverage
0.0% Duplication