mirror of
https://github.com/simdjson/simdjson
synced 2026-06-08 17:27:07 +00:00
M. Bahoosh
46 lines
1.3 KiB
C++
46 lines
1.3 KiB
C++
#ifndef SIMDJSON_STD_LIST_H
|
|
#define SIMDJSON_STD_LIST_H
|
|
|
|
#ifndef SIMDJSON_SUPPORTS_DESERIALIZATION
|
|
#include "simdjson/generic/ondemand/deserialize.h"
|
|
#endif
|
|
|
|
#ifdef SIMDJSON_SUPPORTS_DESERIALIZATION
|
|
#include <list>
|
|
|
|
namespace simdjson {
|
|
|
|
template <typename T, typename AllocT, typename ValT>
|
|
error_code tag_invoke(deserialize_tag, ValT &val,
|
|
std::list<T, AllocT> &out) noexcept(false) {
|
|
|
|
// For better error messages, don't use these as constraints on
|
|
// the tag_invoke CPO.
|
|
static_assert(
|
|
deserializable<T, ValT>,
|
|
"The specified type inside the list must itself be deserializable");
|
|
static_assert(
|
|
std::is_default_constructible_v<T>,
|
|
"The specified type inside the list must default constructible.");
|
|
|
|
ondemand::array arr;
|
|
SIMDJSON_TRY(val.get_array().get(arr));
|
|
for (auto v : arr) {
|
|
if (auto const err = v.get<T>().get(out.emplace_back()); err) {
|
|
// If an error occurs, the empty element that we just inserted gets
|
|
// removed. We're not using a temp variable because if T is a heavy type,
|
|
// we want the valid path to be the fast path and the slow path be the
|
|
// path that has errors in it.
|
|
static_cast<void>(out.pop_back());
|
|
return err;
|
|
}
|
|
}
|
|
return SUCCESS;
|
|
}
|
|
|
|
} // namespace simdjson
|
|
|
|
#endif // SIMDJSON_SUPPORTS_DESERIALIZATION
|
|
|
|
#endif // SIMDJSON_STD_LIST_H
|