#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#include "../../utilities/fast_io.hpp"
#include <cassert>
#include <array>
#include <cstdio>
#include <iomanip>
#include <limits>
#include <poll.h>
#include <random>
#include <signal.h>
#include <sstream>
#include <string>
#include <sys/wait.h>
#include <unistd.h>
#include <utility>
#include <vector>
void test_fast_input() {
std::FILE* file = std::tmpfile();
assert(file != nullptr);
std::fputs(
" -123 456 token Z 1 -12.5 6.25e2 "
"-170141183460469231731687303715884105728 "
"340282366920938463463374607431768211455\n",
file
);
std::rewind(file);
m1une::utilities::FastInput input(file);
int a;
unsigned int b;
std::string s;
char c;
bool flag;
double decimal;
long double exponent;
__int128_t signed_wide;
__uint128_t unsigned_wide;
assert(input.read(
a, b, s, c, flag, decimal, exponent, signed_wide, unsigned_wide
));
assert(a == -123);
assert(b == 456);
assert(s == "token");
assert(c == 'Z');
assert(flag);
assert(decimal == -12.5);
assert(exponent == 625.0L);
__int128_t signed_minimum = -(__int128_t(1) << 126);
signed_minimum *= 2;
assert(signed_wide == signed_minimum);
assert(unsigned_wide == ~__uint128_t(0));
std::fclose(file);
}
void test_large_string_io() {
const std::string large(m1une::utilities::FastInput::buffer_size + 123, 'x');
std::FILE* input_file = std::tmpfile();
assert(input_file != nullptr);
assert(std::fwrite(large.data(), 1, large.size(), input_file) == large.size());
std::fputs(" tail", input_file);
std::rewind(input_file);
m1une::utilities::FastInput input(input_file);
std::string actual, tail;
input >> actual >> tail;
assert(actual == large);
assert(tail == "tail");
std::fclose(input_file);
std::FILE* output_file = std::tmpfile();
assert(output_file != nullptr);
{
m1une::utilities::FastOutput output(output_file);
output << large;
}
assert(std::ftell(output_file) == long(large.size()));
std::rewind(output_file);
std::string written(large.size(), '\0');
assert(std::fread(written.data(), 1, written.size(), output_file) == written.size());
assert(written == large);
std::fclose(output_file);
}
void test_pipe_input_does_not_wait_for_eof() {
int request[2];
int response[2];
assert(::pipe(request) == 0);
assert(::pipe(response) == 0);
const pid_t child = ::fork();
assert(child >= 0);
if (child == 0) {
::close(request[1]);
::close(response[0]);
std::FILE* stream = ::fdopen(request[0], "r");
if (stream == nullptr) _exit(1);
m1une::utilities::FastInput input(stream);
int value;
const bool ok = input.read(value) && value == 123456789;
if (ok) {
const char byte = 'x';
if (::write(response[1], &byte, 1) != 1) _exit(1);
}
std::fclose(stream);
::close(response[1]);
_exit(ok ? 0 : 1);
}
::close(request[0]);
::close(response[1]);
const char query[] = "123456789\n";
assert(
::write(request[1], query, sizeof(query) - 1)
== ssize_t(sizeof(query) - 1)
);
pollfd event;
event.fd = response[0];
event.events = POLLIN;
event.revents = 0;
const int ready = ::poll(&event, 1, 1000);
::close(request[1]);
if (ready <= 0) ::kill(child, SIGKILL);
int status;
assert(::waitpid(child, &status, 0) == child);
assert(ready == 1);
assert((event.revents & POLLIN) != 0);
char byte;
assert(::read(response[0], &byte, 1) == 1);
assert(byte == 'x');
assert(WIFEXITED(status) && WEXITSTATUS(status) == 0);
::close(response[0]);
}
void test_fast_output() {
std::FILE* file = std::tmpfile();
assert(file != nullptr);
{
m1une::utilities::FastOutput output(file);
output.println("answer", -42, 17u);
output.println(false);
output.set_fixed(2);
output.println(1.25);
__int128_t signed_minimum = -(__int128_t(1) << 126);
signed_minimum *= 2;
output.println(signed_minimum);
output.println(~__uint128_t(0));
output.flush();
}
std::rewind(file);
char buffer[256];
std::size_t length = std::fread(buffer, 1, sizeof(buffer), file);
std::string result(buffer, buffer + length);
assert(
result
== "answer -42 17\n0\n1.25\n"
"-170141183460469231731687303715884105728\n"
"340282366920938463463374607431768211455\n"
);
std::fclose(file);
}
void test_output_flush_reaches_pipe() {
int descriptors[2];
assert(::pipe(descriptors) == 0);
std::FILE* stream = ::fdopen(descriptors[1], "w");
assert(stream != nullptr);
{
m1une::utilities::FastOutput output(stream);
output << "? 987654321\n";
output.flush();
pollfd event;
event.fd = descriptors[0];
event.events = POLLIN;
event.revents = 0;
assert(::poll(&event, 1, 1000) == 1);
assert((event.revents & POLLIN) != 0);
const char expected[] = "? 987654321\n";
char actual[sizeof(expected) - 1];
assert(
::read(descriptors[0], actual, sizeof(actual))
== ssize_t(sizeof(actual))
);
assert(std::string(actual, actual + sizeof(actual)) == expected);
}
std::fclose(stream);
::close(descriptors[0]);
}
void test_stream_operators_ranges_and_pairs() {
std::FILE* input_file = std::tmpfile();
assert(input_file != nullptr);
std::fputs(
"2 3 1 2 3 4 5 6 label 7 8 9 10 11 12 13 14",
input_file
);
std::rewind(input_file);
int h, w;
m1une::utilities::FastInput input(input_file);
input >> h >> w;
std::vector<std::vector<int>> matrix(h, std::vector<int>(w));
input >> matrix;
assert(matrix[0][0] == 1);
assert(matrix[1][2] == 6);
std::pair<std::string, int> item;
input >> item;
assert(item.first == "label");
assert(item.second == 7);
std::vector<std::pair<int, int>> pairs(2);
input >> pairs;
const std::pair<int, int> expected_first(8, 9);
const std::pair<int, int> expected_second(10, 11);
assert(pairs[0] == expected_first);
assert(pairs[1] == expected_second);
std::pair<std::vector<int>, int> grouped;
grouped.first.resize(2);
input >> grouped;
assert(grouped.first[0] == 12);
assert(grouped.first[1] == 13);
assert(grouped.second == 14);
std::fclose(input_file);
std::FILE* output_file = std::tmpfile();
assert(output_file != nullptr);
{
m1une::utilities::FastOutput output(output_file);
output << "matrix\n" << matrix << '\n';
output << item << '\n';
output << pairs << '\n';
output << grouped << '\n';
output.set_range_separator('\n');
output << pairs << '\n';
output.set_range_separator(' ');
output << grouped.first << '\n';
output.flush();
}
std::rewind(output_file);
char buffer[128];
std::size_t length = std::fread(buffer, 1, sizeof(buffer), output_file);
std::string result(buffer, buffer + length);
assert(
result
== "matrix\n1 2 3\n4 5 6\nlabel 7\n8 9 10 11\n12 13 14\n"
"8 9\n10 11\n12 13\n"
);
std::fclose(output_file);
}
template <class Function>
std::string capture_output(Function function) {
std::FILE* file = std::tmpfile();
assert(file != nullptr);
{
m1une::utilities::FastOutput output(file);
function(output);
}
std::rewind(file);
std::string result;
char buffer[4096];
while (const std::size_t length = std::fread(buffer, 1, sizeof(buffer), file)) {
result.append(buffer, length);
}
std::fclose(file);
return result;
}
void test_aligned_output() {
const std::vector<std::vector<int>> matrix = {
{1, -20, 300}, {4000, 5, -6}, {}, {7}
};
const auto original = matrix;
assert(capture_output([&](auto& output) {
output << "aligned\n";
output.println_aligned(matrix);
output << matrix << '\n';
output.set_range_separator(',');
output.write_aligned(matrix);
output << '!';
output.println_aligned(std::vector<std::vector<int>>{});
}) == "aligned\n 1 -20 300\n4000 5 -6\n\n 7\n"
"1 -20 300\n4000 5 -6\n\n7\n"
" 1,-20,300\n4000, 5, -6\n\n 7!\n");
assert(matrix == original);
const std::vector<std::vector<double>> decimals = {
{1.25, -0.5}, {100, 20.125}
};
assert(capture_output([&](auto& output) {
output.set_fixed(2);
output.println_aligned(decimals);
output.set_general(3);
output.println_aligned(decimals);
}) == " 1.25 -0.50\n100.00 20.12\n1.25 -0.5\n 100 20.1\n");
const std::vector<std::vector<std::string>> words = {
{"x", "long"}, {"word", "y"}
};
const std::vector<std::vector<bool>> flags = {
{true, false}, {false, true}
};
const int array[2][2] = { {1, 200}, {-30, 4} };
const std::array<std::array<char, 2>, 2> chars = {
std::array<char, 2>{'a', 'b'}, std::array<char, 2>{'c', 'd'}
};
const std::vector<std::vector<std::pair<int, int>>> pairs = {
{std::pair<int, int>(1, 2)}, {std::pair<int, int>(100, -3)}
};
assert(capture_output([&](auto& output) {
output.println_aligned(words);
output.println_aligned(flags);
output.println_aligned(array);
output.println_aligned(chars);
output.println_aligned(pairs);
}) == " x long\nword y\n1 0\n0 1\n 1 200\n-30 4\na b\nc d\n"
" 1 2\n100 -3\n");
__int128_t minimum = -(__int128_t(1) << 126);
minimum *= 2;
const std::vector<std::vector<__int128_t>> wide = { {minimum}, {0} };
const std::vector<std::vector<__uint128_t>> unsigned_wide = {
{~__uint128_t(0)}, {1}
};
assert(capture_output([&](auto& output) {
output.println_aligned(wide);
output.println_aligned(unsigned_wide);
}) == "-170141183460469231731687303715884105728\n"
+ std::string(39, ' ') + "0\n"
+ "340282366920938463463374607431768211455\n"
+ std::string(38, ' ') + "1\n");
const std::string large(m1une::utilities::FastOutput::buffer_size + 123, 'x');
const std::vector<std::vector<std::string>> long_cells = { {large}, {"y"} };
assert(capture_output([&](auto& output) {
output.println_aligned(long_cells);
output.println(123456789);
}) == large + '\n' + std::string(large.size() - 1, ' ') + "y\n123456789\n");
}
void test_random_aligned_output() {
std::mt19937 random(20261005);
for (int trial = 0; trial < 200; ++trial) {
std::vector<std::vector<int>> matrix(random() % 9);
std::vector<int> widths(8);
for (auto& row : matrix) {
row.resize(random() % 9);
for (std::size_t j = 0; j < row.size(); ++j) {
row[j] = int(random() % 2000001) - 1000000;
if (random() % 10 == 0) row[j] = std::numeric_limits<int>::min();
widths[j] = std::max(widths[j], int(std::to_string(row[j]).size()));
}
}
std::ostringstream expected;
for (std::size_t i = 0; i < matrix.size(); ++i) {
if (i != 0) expected << '\n';
for (std::size_t j = 0; j < matrix[i].size(); ++j) {
if (j != 0) expected << ' ';
expected << std::setw(widths[j]) << matrix[i][j];
}
}
assert(capture_output([&](auto& output) {
output.write_aligned(matrix);
}) == expected.str());
}
}
int main() {
test_fast_input();
test_large_string_io();
test_pipe_input_does_not_wait_for_eof();
test_fast_output();
test_output_flush_reaches_pipe();
test_stream_operators_ranges_and_pairs();
test_aligned_output();
test_random_aligned_output();
m1une::utilities::FastInput input;
m1une::utilities::FastOutput output;
long long a, b;
input >> a >> b;
output << a + b << '\n';
}
#line 1 "verify/utilities/fast_io.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#line 1 "utilities/fast_io.hpp"
#include <algorithm>
#include <array>
#include <cerrno>
#include <charconv>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cstring>
#include <iterator>
#include <string>
#include <sys/stat.h>
#include <type_traits>
#include <utility>
#include <unistd.h>
#include <vector>
namespace m1une {
namespace utilities {
struct FastOutput;
namespace internal {
// Shared with the convenience helpers in template.hpp.
inline FastOutput* standard_output_instance = nullptr;
// Detect std::begin(x), std::end(x).
template <class T, class = void>
struct is_range : std::false_type {};
template <class T>
struct is_range<T, std::void_t<
decltype(std::begin(std::declval<T&>())),
decltype(std::end(std::declval<T&>()))
>> : std::true_type {};
template <class T>
inline constexpr bool is_range_v = is_range<T>::value;
template <class T>
using range_reference_t = decltype(*std::begin(std::declval<T&>()));
template <class T>
using range_value_t = std::remove_cv_t<std::remove_reference_t<range_reference_t<T>>>;
template <class T, class = void>
struct range_stored_value {
using type = range_value_t<T>;
};
template <class T>
struct range_stored_value<T, std::void_t<typename std::remove_cv_t<std::remove_reference_t<T>>::value_type>> {
using type = typename std::remove_cv_t<std::remove_reference_t<T>>::value_type;
};
template <class T>
using range_stored_value_t = typename range_stored_value<T>::type;
// Treat strings and C strings as scalar output objects, not as ranges.
template <class T>
struct is_char_array : std::false_type {};
template <class T, std::size_t N>
struct is_char_array<T[N]>
: std::bool_constant<std::is_same_v<std::remove_cv_t<T>, char>> {};
template <class T>
struct is_string_like
: std::bool_constant<
std::is_same_v<std::decay_t<T>, std::string>
|| std::is_same_v<std::decay_t<T>, const char*>
|| std::is_same_v<std::decay_t<T>, char*>
|| is_char_array<std::remove_reference_t<T>>::value
> {};
template <class T>
inline constexpr bool is_string_like_v = is_string_like<T>::value;
// ModInt-like type: x.val() is printable, and x can be assigned from long long.
template <class T, class = void>
struct has_val_method : std::false_type {};
template <class T>
struct has_val_method<T, std::void_t<decltype(std::declval<const T&>().val())>>
: std::true_type {};
template <class T>
inline constexpr bool has_val_method_v = has_val_method<T>::value;
template <class T, class = void>
struct has_static_mod_raw : std::false_type {};
template <class T>
struct has_static_mod_raw<
T, std::void_t<decltype(T::mod()), decltype(T::raw(std::declval<uint32_t>()))>>
: std::true_type {};
template <class T>
inline constexpr bool has_static_mod_raw_v = has_static_mod_raw<T>::value;
// libstdc++ before GCC 16 does not classify __int128 as an integral type in
// strict ISO modes such as -std=c++23. Keep the fast-I/O interface independent
// of that implementation detail.
template <class T>
inline constexpr bool is_integral_v =
std::is_integral_v<T>
|| std::is_same_v<std::remove_cv_t<T>, __int128_t>
|| std::is_same_v<std::remove_cv_t<T>, __uint128_t>;
template <class T>
inline constexpr bool is_signed_v =
std::is_signed_v<T>
|| std::is_same_v<std::remove_cv_t<T>, __int128_t>;
template <class T>
struct make_unsigned {
using type = std::make_unsigned_t<T>;
};
template <>
struct make_unsigned<__int128_t> {
using type = __uint128_t;
};
template <>
struct make_unsigned<__uint128_t> {
using type = __uint128_t;
};
template <class T>
using make_unsigned_t = typename make_unsigned<std::remove_cv_t<T>>::type;
} // namespace internal
struct FastInput {
static constexpr int buffer_size = 1 << 20;
private:
std::FILE* _stream;
char _buffer[buffer_size];
int _position;
int _length;
int _file_descriptor;
bool _streaming;
bool refill() {
_position = 0;
if (_streaming) {
ssize_t length;
do {
length = ::read(_file_descriptor, _buffer, buffer_size);
} while (length < 0 && errno == EINTR);
if (length <= 0) {
_length = 0;
return false;
}
_length = int(length);
} else {
_length = int(std::fread(_buffer, 1, buffer_size, _stream));
}
return _length != 0;
}
template <class T>
bool read_integer_from_stream(T& value) {
if (!skip_spaces()) return false;
int c = read_char_raw();
bool negative = false;
if (c == '-') {
negative = true;
c = read_char_raw();
}
if constexpr (internal::is_signed_v<T>) {
T result = 0;
while ('0' <= c && c <= '9') {
result = negative ? result * 10 - (c - '0')
: result * 10 + (c - '0');
c = read_char_raw();
}
value = result;
} else {
T result = 0;
while ('0' <= c && c <= '9') {
result = result * 10 + T(c - '0');
c = read_char_raw();
}
value = negative ? T(0) - result : result;
}
return true;
}
bool prepare_number() {
if (_length - _position >= 64) return true;
const int remaining = _length - _position;
if (remaining > 0) std::memmove(_buffer, _buffer + _position, remaining);
const int added = int(std::fread(_buffer + remaining, 1, buffer_size - remaining, _stream));
_position = 0;
_length = remaining + added;
if (_length < buffer_size) _buffer[_length] = '\0';
return _length != 0;
}
public:
explicit FastInput(std::FILE* stream = stdin)
: _stream(stream),
_position(0),
_length(0),
_file_descriptor(::fileno(stream)),
_streaming([&] {
struct stat status;
return _file_descriptor >= 0
&& ::fstat(_file_descriptor, &status) == 0
&& !S_ISREG(status.st_mode);
}()) {}
FastInput(const FastInput&) = delete;
FastInput& operator=(const FastInput&) = delete;
int read_char_raw() {
if (_position == _length && !refill()) return EOF;
return _buffer[_position++];
}
bool skip_spaces() {
int c = read_char_raw();
while (c != EOF && c <= ' ') c = read_char_raw();
if (c == EOF) return false;
--_position;
return true;
}
bool read(char& value) {
if (!skip_spaces()) return false;
value = char(read_char_raw());
return true;
}
bool read(std::string& value) {
if (!skip_spaces()) return false;
value.clear();
while (true) {
const int begin = _position;
while (_position < _length &&
static_cast<unsigned char>(_buffer[_position]) > ' ') {
++_position;
}
value.append(_buffer + begin, _position - begin);
if (_position < _length) {
++_position;
return true;
}
if (!refill()) return true;
}
}
bool read(bool& value) {
int x;
if (!read(x)) return false;
value = x != 0;
return true;
}
template <class T>
std::enable_if_t<
internal::is_integral_v<T>
&& !std::is_same_v<std::remove_cv_t<T>, bool>
&& !std::is_same_v<std::remove_cv_t<T>, char>,
bool
>
read(T& value) {
if (_streaming) return read_integer_from_stream(value);
if (!prepare_number()) return false;
int c = static_cast<unsigned char>(_buffer[_position++]);
while (c <= ' ') c = static_cast<unsigned char>(_buffer[_position++]);
bool negative = false;
if (c == '-') {
negative = true;
c = static_cast<unsigned char>(_buffer[_position++]);
}
if constexpr (internal::is_signed_v<T>) {
T result = 0;
while ('0' <= c && c <= '9') {
const int first = c - '0';
const int second = static_cast<unsigned char>(_buffer[_position]) - '0';
if (0 <= second && second <= 9) {
result = negative ? result * 100 - (first * 10 + second)
: result * 100 + (first * 10 + second);
++_position;
} else {
result = negative ? result * 10 - first : result * 10 + first;
}
c = static_cast<unsigned char>(_buffer[_position++]);
}
value = result;
} else {
T result = 0;
while ('0' <= c && c <= '9') {
const unsigned first = unsigned(c - '0');
const int second = static_cast<unsigned char>(_buffer[_position]) - '0';
if (0 <= second && second <= 9) {
result = result * 100 + T(first * 10 + unsigned(second));
++_position;
} else {
result = result * 10 + T(first);
}
c = static_cast<unsigned char>(_buffer[_position++]);
}
value = negative ? T(0) - result : result;
}
if (_position > _length) _position = _length;
return true;
}
template <class T>
std::enable_if_t<std::is_floating_point_v<T>, bool>
read(T& value) {
if (!skip_spaces()) return false;
int c = read_char_raw();
bool negative = false;
if (c == '-' || c == '+') {
negative = c == '-';
c = read_char_raw();
}
long double result = 0;
while ('0' <= c && c <= '9') {
result = result * 10 + (c - '0');
c = read_char_raw();
}
if (c == '.') {
long double place = 0.1L;
c = read_char_raw();
while ('0' <= c && c <= '9') {
result += (c - '0') * place;
place *= 0.1L;
c = read_char_raw();
}
}
if (c == 'e' || c == 'E') {
c = read_char_raw();
bool exponent_negative = false;
if (c == '-' || c == '+') {
exponent_negative = c == '-';
c = read_char_raw();
}
int exponent = 0;
while ('0' <= c && c <= '9') {
exponent = exponent * 10 + (c - '0');
c = read_char_raw();
}
long double scale = 1;
long double power = 10;
while (exponent > 0) {
if (exponent & 1) scale *= power;
power *= power;
exponent >>= 1;
}
result = exponent_negative ? result / scale : result * scale;
}
value = static_cast<T>(negative ? -result : result);
return true;
}
template <class T>
std::enable_if_t<
internal::has_val_method_v<T>
&& !internal::is_integral_v<T>
&& !internal::is_range_v<T>,
bool
>
read(T& value) {
long long x;
if (!read(x)) return false;
if constexpr (internal::has_static_mod_raw_v<T>) {
if (x >= 0 && uint64_t(x) < uint64_t(T::mod())) {
value = T::raw(uint32_t(x));
} else {
value = T(x);
}
} else {
value = T(x);
}
return true;
}
template <class First, class Second>
bool read(std::pair<First, Second>& value) {
if (!read(value.first)) return false;
return read(value.second);
}
template <class Range>
std::enable_if_t<
internal::is_range_v<Range>
&& !internal::is_string_like_v<Range>,
bool
>
read(Range& range) {
using StoredValue = internal::range_stored_value_t<Range>;
constexpr bool nested = internal::is_range_v<StoredValue>
&& !internal::is_string_like_v<StoredValue>;
for (auto&& value : range) {
if constexpr (std::is_same_v<StoredValue, bool> && !nested) {
bool x;
if (!read(x)) return false;
value = x;
} else {
if (!read(value)) return false;
}
}
return true;
}
template <class First, class Second, class... Rest>
bool read(First& first, Second& second, Rest&... rest) {
if (!read(first)) return false;
return read(second, rest...);
}
template <class T>
FastInput& operator>>(T& value) {
if (!read(value)) std::abort();
return *this;
}
};
struct FastOutput {
static constexpr int buffer_size = 1 << 20;
private:
inline static const auto digit_quads = [] {
std::array<char, 40000> result{};
for (int i = 0; i < 10000; i++) {
int value = i;
for (int j = 3; j >= 0; j--) {
result[4 * i + j] = char('0' + value % 10);
value /= 10;
}
}
return result;
}();
std::FILE* _stream;
char _buffer[buffer_size];
int _position;
int _precision;
std::chars_format _float_format;
char _range_separator;
std::string* _capture = nullptr;
template <class T>
std::string format_cell(const T& value) {
std::string result;
struct CaptureGuard {
std::string*& target;
std::string* previous;
~CaptureGuard() { target = previous; }
} guard{_capture, _capture};
_capture = &result;
write(value);
return result;
}
template <class Matrix>
void write_aligned_matrix(const Matrix& matrix) {
std::vector<std::vector<std::string>> rows;
std::vector<std::size_t> widths;
for (const auto& row : matrix) {
auto& cells = rows.emplace_back();
std::size_t column = 0;
for (const auto& value : row) {
cells.push_back(format_cell(value));
if (column == widths.size()) widths.push_back(0);
widths[column] = std::max(widths[column], cells.back().size());
++column;
}
}
bool first = true;
for (const auto& row : rows) {
if (!first) write_char('\n');
first = false;
for (std::size_t column = 0; column < row.size(); ++column) {
if (column != 0) write_char(_range_separator);
for (std::size_t padding = row[column].size();
padding < widths[column]; ++padding) {
write_char(' ');
}
write(row[column]);
}
}
}
public:
explicit FastOutput(std::FILE* stream = stdout)
: _stream(stream),
_position(0),
_precision(6),
_float_format(std::chars_format::general),
_range_separator(' ') {
if (_stream == stdout
&& internal::standard_output_instance == nullptr) {
internal::standard_output_instance = this;
}
}
FastOutput(const FastOutput&) = delete;
FastOutput& operator=(const FastOutput&) = delete;
~FastOutput() {
flush();
if (internal::standard_output_instance == this) {
internal::standard_output_instance = nullptr;
}
}
void flush() {
if (_position != 0) {
std::fwrite(_buffer, 1, _position, _stream);
_position = 0;
}
std::fflush(_stream);
}
void write_char(char c) {
if (_capture != nullptr) {
_capture->push_back(c);
return;
}
if (_position == buffer_size) flush();
_buffer[_position++] = c;
}
void write(const char* s) {
while (*s != '\0') write_char(*s++);
}
void write(const std::string& s) {
if (_capture != nullptr) {
_capture->append(s);
return;
}
std::size_t position = 0;
while (position < s.size()) {
if (_position == buffer_size) flush();
const std::size_t copied =
std::min<std::size_t>(buffer_size - _position, s.size() - position);
std::memcpy(_buffer + _position, s.data() + position, copied);
_position += int(copied);
position += copied;
}
}
void write(char c) {
write_char(c);
}
void write(bool value) {
write_char(value ? '1' : '0');
}
template <class T>
std::enable_if_t<std::is_floating_point_v<T>>
write(T value) {
char digits[128];
auto [end, error] = std::to_chars(
digits,
digits + sizeof(digits),
value,
_float_format,
_precision
);
if (error != std::errc()) std::abort();
for (const char* pointer = digits; pointer != end; pointer++) {
write_char(*pointer);
}
}
template <class T>
std::enable_if_t<
internal::is_integral_v<T>
&& !std::is_same_v<std::remove_cv_t<T>, bool>
&& !std::is_same_v<std::remove_cv_t<T>, char>
>
write(T value) {
using Raw = std::remove_cv_t<T>;
using Unsigned = internal::make_unsigned_t<Raw>;
Unsigned magnitude;
if constexpr (internal::is_signed_v<Raw>) {
if (value < 0) {
write_char('-');
magnitude = Unsigned(0) - Unsigned(value);
} else {
magnitude = Unsigned(value);
}
} else {
magnitude = value;
}
if (magnitude == 0) {
write_char('0');
return;
}
unsigned chunks[16];
int count = 0;
while (magnitude >= 10000) {
const Unsigned quotient = magnitude / 10000;
chunks[count++] = unsigned(magnitude - quotient * 10000);
magnitude = quotient;
}
if (_capture == nullptr && _position > buffer_size - 64) flush();
char captured[64];
char* const begin = _capture != nullptr ? captured : _buffer + _position;
char* destination = begin;
const unsigned leading = unsigned(magnitude);
const char* first = digit_quads.data() + 4 * leading;
int skip = leading < 10 ? 3 : leading < 100 ? 2 : leading < 1000 ? 1 : 0;
for (; skip < 4; skip++) *destination++ = first[skip];
while (count--) {
const char* digits = digit_quads.data() + 4 * chunks[count];
std::memcpy(destination, digits, 4);
destination += 4;
}
if (_capture != nullptr) {
_capture->append(begin, destination - begin);
} else {
_position += int(destination - begin);
}
}
template <class T>
std::enable_if_t<
internal::has_val_method_v<T>
&& !internal::is_integral_v<T>
&& !internal::is_range_v<T>
>
write(const T& value) {
write(value.val());
}
template <class First, class Second>
void write(const std::pair<First, Second>& value) {
write(value.first);
write_char(' ');
write(value.second);
}
template <class Range>
std::enable_if_t<
internal::is_range_v<Range>
&& !internal::is_string_like_v<Range>
>
write(const Range& range) {
using StoredValue = internal::range_stored_value_t<const Range>;
constexpr bool nested = internal::is_range_v<StoredValue>
&& !internal::is_string_like_v<StoredValue>;
bool first = true;
for (const auto& value : range) {
if (!first) write_char(nested ? '\n' : _range_separator);
first = false;
if constexpr (std::is_same_v<StoredValue, bool> && !nested) {
write(static_cast<bool>(value));
} else {
write(value);
}
}
}
template <class First, class... Rest>
void print(const First& first, const Rest&... rest) {
write(first);
((write_char(' '), write(rest)), ...);
}
void println() {
write_char('\n');
}
void set_precision(int precision) {
_precision = precision;
}
void set_fixed(int precision = 6) {
_float_format = std::chars_format::fixed;
_precision = precision;
}
void set_general(int precision = 6) {
_float_format = std::chars_format::general;
_precision = precision;
}
void set_range_separator(char separator) {
_range_separator = separator;
}
template <class Matrix>
void write_aligned(const Matrix& matrix) {
using Row = internal::range_stored_value_t<const Matrix>;
using Cell = internal::range_stored_value_t<const Row>;
static_assert(internal::is_range_v<Row> && !internal::is_string_like_v<Row>,
"write_aligned requires a two-dimensional range");
static_assert(!internal::is_range_v<Cell> || internal::is_string_like_v<Cell>,
"write_aligned requires scalar cells");
write_aligned_matrix(matrix);
}
template <class Matrix>
void println_aligned(const Matrix& matrix) {
write_aligned(matrix);
write_char('\n');
}
template <class... Args>
void println(const Args&... args) {
print(args...);
write_char('\n');
}
template <class T>
FastOutput& operator<<(const T& value) {
write(value);
return *this;
}
};
} // namespace utilities
} // namespace m1une
#line 4 "verify/utilities/fast_io.test.cpp"
#include <cassert>
#line 8 "verify/utilities/fast_io.test.cpp"
#include <iomanip>
#include <limits>
#include <poll.h>
#include <random>
#include <signal.h>
#include <sstream>
#line 15 "verify/utilities/fast_io.test.cpp"
#include <sys/wait.h>
#line 19 "verify/utilities/fast_io.test.cpp"
void test_fast_input() {
std::FILE* file = std::tmpfile();
assert(file != nullptr);
std::fputs(
" -123 456 token Z 1 -12.5 6.25e2 "
"-170141183460469231731687303715884105728 "
"340282366920938463463374607431768211455\n",
file
);
std::rewind(file);
m1une::utilities::FastInput input(file);
int a;
unsigned int b;
std::string s;
char c;
bool flag;
double decimal;
long double exponent;
__int128_t signed_wide;
__uint128_t unsigned_wide;
assert(input.read(
a, b, s, c, flag, decimal, exponent, signed_wide, unsigned_wide
));
assert(a == -123);
assert(b == 456);
assert(s == "token");
assert(c == 'Z');
assert(flag);
assert(decimal == -12.5);
assert(exponent == 625.0L);
__int128_t signed_minimum = -(__int128_t(1) << 126);
signed_minimum *= 2;
assert(signed_wide == signed_minimum);
assert(unsigned_wide == ~__uint128_t(0));
std::fclose(file);
}
void test_large_string_io() {
const std::string large(m1une::utilities::FastInput::buffer_size + 123, 'x');
std::FILE* input_file = std::tmpfile();
assert(input_file != nullptr);
assert(std::fwrite(large.data(), 1, large.size(), input_file) == large.size());
std::fputs(" tail", input_file);
std::rewind(input_file);
m1une::utilities::FastInput input(input_file);
std::string actual, tail;
input >> actual >> tail;
assert(actual == large);
assert(tail == "tail");
std::fclose(input_file);
std::FILE* output_file = std::tmpfile();
assert(output_file != nullptr);
{
m1une::utilities::FastOutput output(output_file);
output << large;
}
assert(std::ftell(output_file) == long(large.size()));
std::rewind(output_file);
std::string written(large.size(), '\0');
assert(std::fread(written.data(), 1, written.size(), output_file) == written.size());
assert(written == large);
std::fclose(output_file);
}
void test_pipe_input_does_not_wait_for_eof() {
int request[2];
int response[2];
assert(::pipe(request) == 0);
assert(::pipe(response) == 0);
const pid_t child = ::fork();
assert(child >= 0);
if (child == 0) {
::close(request[1]);
::close(response[0]);
std::FILE* stream = ::fdopen(request[0], "r");
if (stream == nullptr) _exit(1);
m1une::utilities::FastInput input(stream);
int value;
const bool ok = input.read(value) && value == 123456789;
if (ok) {
const char byte = 'x';
if (::write(response[1], &byte, 1) != 1) _exit(1);
}
std::fclose(stream);
::close(response[1]);
_exit(ok ? 0 : 1);
}
::close(request[0]);
::close(response[1]);
const char query[] = "123456789\n";
assert(
::write(request[1], query, sizeof(query) - 1)
== ssize_t(sizeof(query) - 1)
);
pollfd event;
event.fd = response[0];
event.events = POLLIN;
event.revents = 0;
const int ready = ::poll(&event, 1, 1000);
::close(request[1]);
if (ready <= 0) ::kill(child, SIGKILL);
int status;
assert(::waitpid(child, &status, 0) == child);
assert(ready == 1);
assert((event.revents & POLLIN) != 0);
char byte;
assert(::read(response[0], &byte, 1) == 1);
assert(byte == 'x');
assert(WIFEXITED(status) && WEXITSTATUS(status) == 0);
::close(response[0]);
}
void test_fast_output() {
std::FILE* file = std::tmpfile();
assert(file != nullptr);
{
m1une::utilities::FastOutput output(file);
output.println("answer", -42, 17u);
output.println(false);
output.set_fixed(2);
output.println(1.25);
__int128_t signed_minimum = -(__int128_t(1) << 126);
signed_minimum *= 2;
output.println(signed_minimum);
output.println(~__uint128_t(0));
output.flush();
}
std::rewind(file);
char buffer[256];
std::size_t length = std::fread(buffer, 1, sizeof(buffer), file);
std::string result(buffer, buffer + length);
assert(
result
== "answer -42 17\n0\n1.25\n"
"-170141183460469231731687303715884105728\n"
"340282366920938463463374607431768211455\n"
);
std::fclose(file);
}
void test_output_flush_reaches_pipe() {
int descriptors[2];
assert(::pipe(descriptors) == 0);
std::FILE* stream = ::fdopen(descriptors[1], "w");
assert(stream != nullptr);
{
m1une::utilities::FastOutput output(stream);
output << "? 987654321\n";
output.flush();
pollfd event;
event.fd = descriptors[0];
event.events = POLLIN;
event.revents = 0;
assert(::poll(&event, 1, 1000) == 1);
assert((event.revents & POLLIN) != 0);
const char expected[] = "? 987654321\n";
char actual[sizeof(expected) - 1];
assert(
::read(descriptors[0], actual, sizeof(actual))
== ssize_t(sizeof(actual))
);
assert(std::string(actual, actual + sizeof(actual)) == expected);
}
std::fclose(stream);
::close(descriptors[0]);
}
void test_stream_operators_ranges_and_pairs() {
std::FILE* input_file = std::tmpfile();
assert(input_file != nullptr);
std::fputs(
"2 3 1 2 3 4 5 6 label 7 8 9 10 11 12 13 14",
input_file
);
std::rewind(input_file);
int h, w;
m1une::utilities::FastInput input(input_file);
input >> h >> w;
std::vector<std::vector<int>> matrix(h, std::vector<int>(w));
input >> matrix;
assert(matrix[0][0] == 1);
assert(matrix[1][2] == 6);
std::pair<std::string, int> item;
input >> item;
assert(item.first == "label");
assert(item.second == 7);
std::vector<std::pair<int, int>> pairs(2);
input >> pairs;
const std::pair<int, int> expected_first(8, 9);
const std::pair<int, int> expected_second(10, 11);
assert(pairs[0] == expected_first);
assert(pairs[1] == expected_second);
std::pair<std::vector<int>, int> grouped;
grouped.first.resize(2);
input >> grouped;
assert(grouped.first[0] == 12);
assert(grouped.first[1] == 13);
assert(grouped.second == 14);
std::fclose(input_file);
std::FILE* output_file = std::tmpfile();
assert(output_file != nullptr);
{
m1une::utilities::FastOutput output(output_file);
output << "matrix\n" << matrix << '\n';
output << item << '\n';
output << pairs << '\n';
output << grouped << '\n';
output.set_range_separator('\n');
output << pairs << '\n';
output.set_range_separator(' ');
output << grouped.first << '\n';
output.flush();
}
std::rewind(output_file);
char buffer[128];
std::size_t length = std::fread(buffer, 1, sizeof(buffer), output_file);
std::string result(buffer, buffer + length);
assert(
result
== "matrix\n1 2 3\n4 5 6\nlabel 7\n8 9 10 11\n12 13 14\n"
"8 9\n10 11\n12 13\n"
);
std::fclose(output_file);
}
template <class Function>
std::string capture_output(Function function) {
std::FILE* file = std::tmpfile();
assert(file != nullptr);
{
m1une::utilities::FastOutput output(file);
function(output);
}
std::rewind(file);
std::string result;
char buffer[4096];
while (const std::size_t length = std::fread(buffer, 1, sizeof(buffer), file)) {
result.append(buffer, length);
}
std::fclose(file);
return result;
}
void test_aligned_output() {
const std::vector<std::vector<int>> matrix = {
{1, -20, 300}, {4000, 5, -6}, {}, {7}
};
const auto original = matrix;
assert(capture_output([&](auto& output) {
output << "aligned\n";
output.println_aligned(matrix);
output << matrix << '\n';
output.set_range_separator(',');
output.write_aligned(matrix);
output << '!';
output.println_aligned(std::vector<std::vector<int>>{});
}) == "aligned\n 1 -20 300\n4000 5 -6\n\n 7\n"
"1 -20 300\n4000 5 -6\n\n7\n"
" 1,-20,300\n4000, 5, -6\n\n 7!\n");
assert(matrix == original);
const std::vector<std::vector<double>> decimals = {
{1.25, -0.5}, {100, 20.125}
};
assert(capture_output([&](auto& output) {
output.set_fixed(2);
output.println_aligned(decimals);
output.set_general(3);
output.println_aligned(decimals);
}) == " 1.25 -0.50\n100.00 20.12\n1.25 -0.5\n 100 20.1\n");
const std::vector<std::vector<std::string>> words = {
{"x", "long"}, {"word", "y"}
};
const std::vector<std::vector<bool>> flags = {
{true, false}, {false, true}
};
const int array[2][2] = { {1, 200}, {-30, 4} };
const std::array<std::array<char, 2>, 2> chars = {
std::array<char, 2>{'a', 'b'}, std::array<char, 2>{'c', 'd'}
};
const std::vector<std::vector<std::pair<int, int>>> pairs = {
{std::pair<int, int>(1, 2)}, {std::pair<int, int>(100, -3)}
};
assert(capture_output([&](auto& output) {
output.println_aligned(words);
output.println_aligned(flags);
output.println_aligned(array);
output.println_aligned(chars);
output.println_aligned(pairs);
}) == " x long\nword y\n1 0\n0 1\n 1 200\n-30 4\na b\nc d\n"
" 1 2\n100 -3\n");
__int128_t minimum = -(__int128_t(1) << 126);
minimum *= 2;
const std::vector<std::vector<__int128_t>> wide = { {minimum}, {0} };
const std::vector<std::vector<__uint128_t>> unsigned_wide = {
{~__uint128_t(0)}, {1}
};
assert(capture_output([&](auto& output) {
output.println_aligned(wide);
output.println_aligned(unsigned_wide);
}) == "-170141183460469231731687303715884105728\n"
+ std::string(39, ' ') + "0\n"
+ "340282366920938463463374607431768211455\n"
+ std::string(38, ' ') + "1\n");
const std::string large(m1une::utilities::FastOutput::buffer_size + 123, 'x');
const std::vector<std::vector<std::string>> long_cells = { {large}, {"y"} };
assert(capture_output([&](auto& output) {
output.println_aligned(long_cells);
output.println(123456789);
}) == large + '\n' + std::string(large.size() - 1, ' ') + "y\n123456789\n");
}
void test_random_aligned_output() {
std::mt19937 random(20261005);
for (int trial = 0; trial < 200; ++trial) {
std::vector<std::vector<int>> matrix(random() % 9);
std::vector<int> widths(8);
for (auto& row : matrix) {
row.resize(random() % 9);
for (std::size_t j = 0; j < row.size(); ++j) {
row[j] = int(random() % 2000001) - 1000000;
if (random() % 10 == 0) row[j] = std::numeric_limits<int>::min();
widths[j] = std::max(widths[j], int(std::to_string(row[j]).size()));
}
}
std::ostringstream expected;
for (std::size_t i = 0; i < matrix.size(); ++i) {
if (i != 0) expected << '\n';
for (std::size_t j = 0; j < matrix[i].size(); ++j) {
if (j != 0) expected << ' ';
expected << std::setw(widths[j]) << matrix[i][j];
}
}
assert(capture_output([&](auto& output) {
output.write_aligned(matrix);
}) == expected.str());
}
}
int main() {
test_fast_input();
test_large_string_io();
test_pipe_input_does_not_wait_for_eof();
test_fast_output();
test_output_flush_reaches_pipe();
test_stream_operators_ranges_and_pairs();
test_aligned_output();
test_random_aligned_output();
m1une::utilities::FastInput input;
m1une::utilities::FastOutput output;
long long a, b;
input >> a >> b;
output << a + b << '\n';
}
verify/utilities/fast_io.test.cpp