this module makes me so outraged and stupid. why do you export details functions and other junk? It completely breaks on wasm

benchmark/0011.containers/deque/.test_prop.toml

@@ -0,0 +1,2 @@
+["0003.insert_range"]
+ignore = true

benchmark/0011.containers/deque/0003.insert_range/fast_io.cc

@@ -0,0 +1,33 @@
+#include <fast_io.h>
+#include <fast_io_driver/timer.h>
+#include <fast_io_dsal/deque.h>
+#include <cstddef>
+
+int main()
+{
+	fast_io::timer tm(u8"fast_io::deque");
+	fast_io::deque<std::size_t> dq;
+	constexpr std::size_t n{50000};
+
+	{
+		fast_io::timer t(u8"insert_range_index");
+		for (std::size_t i{}; i != n; ++i)
+		{
+			::std::size_t dqsz{dq.size()};
+			std::size_t pos = dqsz ? (i % dqsz) : 0;
+			std::size_t tmp[4]{i, i + 1, i + 2, i + 3};
+			dq.insert_range_index(pos, tmp);
+		}
+	}
+
+	std::size_t sum{};
+	{
+		fast_io::timer t(u8"loop");
+		for (auto const e : dq)
+		{
+			sum += e;
+		}
+	}
+
+	fast_io::io::perrln("sum=", sum);
+}

benchmark/0011.containers/deque/0003.insert_range/std.cc

@@ -0,0 +1,33 @@
+#include <fast_io.h>
+#include <fast_io_driver/timer.h>
+#include <deque>
+#include <cstddef>
+
+int main()
+{
+	fast_io::timer tm(u8"std::deque");
+	::std::deque<std::size_t> dq;
+	constexpr std::size_t n{50000};
+
+	{
+		fast_io::timer t(u8"insert_range");
+		for (std::size_t i{}; i != n; ++i)
+		{
+			::std::size_t dqsz{dq.size()};
+			std::size_t pos = dqsz ? (i % dqsz) : 0;
+			std::size_t tmp[4]{i, i + 1, i + 2, i + 3};
+			dq.insert_range(dq.cbegin() + pos, tmp);
+		}
+	}
+
+	std::size_t sum{};
+	{
+		fast_io::timer t(u8"loop");
+		for (auto const e : dq)
+		{
+			sum += e;
+		}
+	}
+
+	fast_io::io::perrln("sum=", sum);
+}

benchmark/0011.containers/deque/0005.indexing/fast_io.cc

@@ -0,0 +1,26 @@
+#include <fast_io.h>
+#include <fast_io_driver/timer.h>
+#include <fast_io_dsal/deque.h>
+
+int main()
+{
+	::fast_io::timer tm(u8"fast_io::deque");
+	::fast_io::deque<std::size_t> deq;
+	constexpr std::size_t n{100000000};
+	{
+		::fast_io::timer tm1(u8"push_back");
+		for (std::size_t i{}; i != n; ++i)
+		{
+			deq.push_back(i);
+		}
+	}
+	::std::size_t sum{};
+	{
+		::fast_io::timer tm1(u8"indexing loop");
+		for (::std::size_t i{}, sz{deq.size()}; i != sz; ++i)
+		{
+			sum += deq[i];
+		}
+	}
+	::fast_io::io::perrln("sum=", sum);
+}

benchmark/0011.containers/deque/0005.indexing/fast_io_index_unchecked.cc

@@ -0,0 +1,26 @@
+#include <fast_io.h>
+#include <fast_io_driver/timer.h>
+#include <fast_io_dsal/deque.h>
+
+int main()
+{
+	::fast_io::timer tm(u8"fast_io::deque unchecked");
+	::fast_io::deque<std::size_t> deq;
+	constexpr std::size_t n{100000000};
+	{
+		::fast_io::timer tm1(u8"push_back");
+		for (std::size_t i{}; i != n; ++i)
+		{
+			deq.push_back(i);
+		}
+	}
+	::std::size_t sum{};
+	{
+		::fast_io::timer tm1(u8"indexing unchecked loop");
+		for (::std::size_t i{}, sz{deq.size()}; i != sz; ++i)
+		{
+			sum += deq.index_unchecked(i);
+		}
+	}
+	::fast_io::io::perrln("sum=", sum);
+}

benchmark/0011.containers/deque/0005.indexing/fast_io_vec.cc

@@ -0,0 +1,26 @@
+#include <fast_io.h>
+#include <fast_io_driver/timer.h>
+#include <fast_io_dsal/vector.h>
+
+int main()
+{
+	::fast_io::timer tm(u8"fast_io::vector");
+	::fast_io::vector<std::size_t> vec;
+	constexpr std::size_t n{100000000};
+	{
+		::fast_io::timer tm1(u8"push_back");
+		for (std::size_t i{}; i != n; ++i)
+		{
+			vec.push_back(i);
+		}
+	}
+	::std::size_t sum{};
+	{
+		::fast_io::timer tm1(u8"indexing loop");
+		for (::std::size_t i{}, sz{vec.size()}; i != sz; ++i)
+		{
+			sum += vec[i];
+		}
+	}
+	::fast_io::io::perrln("sum=", sum);
+}

benchmark/0011.containers/deque/0005.indexing/fast_io_vec_reserve.cc

@@ -0,0 +1,27 @@
+#include <fast_io.h>
+#include <fast_io_driver/timer.h>
+#include <fast_io_dsal/vector.h>
+
+int main()
+{
+	::fast_io::timer tm(u8"fast_io::vector reserve");
+	::fast_io::vector<std::size_t> vec;
+	constexpr std::size_t n{100000000};
+	vec.reserve(n);
+	{
+		fast_io::timer tm1(u8"push_back");
+		for (std::size_t i{}; i != n; ++i)
+		{
+			vec.push_back(i);
+		}
+	}
+	::std::size_t sum{};
+	{
+		fast_io::timer tm1(u8"indexing loop");
+		for (::std::size_t i{}, sz{vec.size()}; i != sz; ++i)
+		{
+			sum += vec[i];
+		}
+	}
+	::fast_io::io::perrln("sum=", sum);
+}

benchmark/0011.containers/deque/0005.indexing/fast_io_vec_unchecked.cc

@@ -0,0 +1,27 @@
+#include <fast_io.h>
+#include <fast_io_driver/timer.h>
+#include <fast_io_dsal/vector.h>
+
+int main()
+{
+	::fast_io::timer tm(u8"fast_io::vector unchecked");
+	::fast_io::vector<std::size_t> vec;
+	constexpr std::size_t n{100000000};
+	vec.reserve(n);
+	{
+		fast_io::timer tm1(u8"push_back_unchecked");
+		for (std::size_t i{}; i != n; ++i)
+		{
+			vec.push_back_unchecked(i);
+		}
+	}
+	::std::size_t sum{};
+	{
+		fast_io::timer tm1(u8"indexing unchecked loop");
+		for (::std::size_t i{}, sz{vec.size()}; i != sz; ++i)
+		{
+			sum += vec.index_unchecked(i);
+		}
+	}
+	::fast_io::io::perrln("sum=", sum);
+}

benchmark/0011.containers/deque/0005.indexing/std.cc

@@ -0,0 +1,26 @@
+#include <fast_io.h>
+#include <fast_io_driver/timer.h>
+#include <deque>
+
+int main()
+{
+	fast_io::timer tm(u8"std::deque");
+	::std::deque<std::size_t> deq;
+	constexpr std::size_t n{100000000};
+	{
+		fast_io::timer tm1(u8"push_back");
+		for (std::size_t i{}; i != n; ++i)
+		{
+			deq.push_back(i);
+		}
+	}
+	::std::size_t sum{};
+	{
+		fast_io::timer tm1(u8"indexing loop");
+		for (::std::size_t i{}, sz{deq.size()}; i != sz; ++i)
+		{
+			sum += deq[i];
+		}
+	}
+	::fast_io::io::perrln("sum=", sum);
+}

benchmark/0011.containers/deque/0006.sort/fast_io.cc

@@ -0,0 +1,35 @@
+#include <fast_io.h>
+#include <fast_io_driver/timer.h>
+#include <fast_io_dsal/deque.h>
+#include <algorithm>
+#include <random>
+
+int main()
+{
+	constexpr std::size_t n{1000000};
+	::std::mt19937_64 eng;
+	::std::uniform_int_distribution<::std::size_t> dis(0, SIZE_MAX);
+
+	::fast_io::timer tm(u8"fast_io::deque");
+	::fast_io::deque<std::size_t> deq;
+	{
+		::fast_io::timer tm1(u8"push_back");
+		for (std::size_t i{}; i != n; ++i)
+		{
+			deq.push_back(dis(eng));
+		}
+	}
+	{
+		::fast_io::timer tm1(u8"sort");
+		::std::ranges::sort(deq);
+	}
+	::std::size_t sum{};
+	{
+		::fast_io::timer tm1(u8"loop");
+		for (auto const &e : deq)
+		{
+			sum += e;
+		}
+	}
+	::fast_io::io::perrln("sum=", sum);
+}

benchmark/0011.containers/deque/0006.sort/fast_io_vec.cc

@@ -0,0 +1,35 @@
+#include <fast_io.h>
+#include <fast_io_driver/timer.h>
+#include <fast_io_dsal/vector.h>
+#include <algorithm>
+#include <random>
+
+int main()
+{
+	constexpr std::size_t n{1000000};
+	::std::mt19937_64 eng;
+	::std::uniform_int_distribution<::std::size_t> dis(0, SIZE_MAX);
+
+	::fast_io::timer tm(u8"fast_io::vector");
+	::fast_io::vector<std::size_t> deq;
+	{
+		::fast_io::timer tm1(u8"push_back");
+		for (std::size_t i{}; i != n; ++i)
+		{
+			deq.push_back(dis(eng));
+		}
+	}
+	{
+		::fast_io::timer tm1(u8"sort");
+		::std::ranges::sort(deq);
+	}
+	::std::size_t sum{};
+	{
+		::fast_io::timer tm1(u8"loop");
+		for (auto const &e : deq)
+		{
+			sum += e;
+		}
+	}
+	::fast_io::io::perrln("sum=", sum);
+}

benchmark/0011.containers/deque/0006.sort/std.cc

@@ -0,0 +1,35 @@
+#include <fast_io.h>
+#include <fast_io_driver/timer.h>
+#include <deque>
+#include <algorithm>
+#include <random>
+
+int main()
+{
+	constexpr std::size_t n{1000000};
+	::std::mt19937_64 eng;
+	::std::uniform_int_distribution<::std::size_t> dis(0, SIZE_MAX);
+
+	::fast_io::timer tm(u8"std::deque");
+	::std::deque<std::size_t> deq;
+	{
+		::fast_io::timer tm1(u8"push_back");
+		for (std::size_t i{}; i != n; ++i)
+		{
+			deq.push_back(dis(eng));
+		}
+	}
+	{
+		::fast_io::timer tm1(u8"sort");
+		::std::ranges::sort(deq);
+	}
+	::std::size_t sum{};
+	{
+		::fast_io::timer tm1(u8"loop");
+		for (auto const &e : deq)
+		{
+			sum += e;
+		}
+	}
+	::fast_io::io::perrln("sum=", sum);
+}