// Matrix Construct // // Copyright (C) Matrix Construct Developers, Authors & Contributors // Copyright (C) 2016-2018 Jason Volk // // Permission to use, copy, modify, and/or distribute this software for any // purpose with or without fee is hereby granted, provided that the above // copyright notice and this permission notice is present in all copies. The // full license for this software is available in the LICENSE file. #pragma once #define HAVE_IRCD_JSON_TUPLE_H #include "property.h" namespace ircd { namespace json { /// All tuple templates inherit from this non-template type for tagging. struct tuple_base { // EBO tag }; /// A compile-time construct to describe a JSON object's members and types. /// /// Member access by name is O(1) because of recursive constexpr function /// inlining when translating a name to the index number which is then used /// as the template argument to std::get() for the value. /// /// Here we represent a JSON object with a named tuple, allowing the programmer /// to create a structure specifying all of the potentially valid members of the /// object. Thus at runtime, the tuple only carries around its values like a /// `struct`. Unlike a `struct`, the tuple is abstractly iterable and we have /// implemented logic operating on all JSON tuples regardless of their makeup /// without any effort from a developer when creating a new tuple. /// /// The member structure for the tuple is called `property` because json::member /// is already used to pair together runtime oriented json::values. /// /// Create and use a tuple to efficiently extract members from a json::object. /// The tuple will populate its own members during a single-pass iteration of /// the JSON input. /// /// But remember, the tuple carries very little information for you at runtime /// which may make it difficult to represent all JS phenomena like "undefined" /// and "null". /// template struct tuple :std::tuple ,tuple_base { struct keys; using tuple_type = std::tuple; using super_type = tuple; static constexpr size_t size(); operator json::value() const; operator crh::sha256::buf() const; template tuple(const tuple &); tuple(const json::object &); tuple(const json::iov &); tuple(const std::initializer_list &); tuple() = default; }; template constexpr bool is_tuple() { return std::is_base_of::value; } template using enable_if_tuple = typename std::enable_if(), R>::type; template using enable_if_tuple_and = typename std::enable_if() && test(), R>::type; template using tuple_type = typename tuple::tuple_type; template using tuple_size = std::tuple_size>; template using tuple_element = typename std::tuple_element>::type; template using tuple_value_type = typename tuple_element::value_type; template auto & stdcast(const tuple &o) { return static_cast(o); } template auto & stdcast(tuple &o) { return static_cast(o); } template constexpr enable_if_tuple size() { return tuple_size::value; } template constexpr enable_if_tuple key() { return tuple_element::key; } template enable_if_tuple key(const tuple &t) { return std::get(t).key; } } // namespace json } // namespace ircd #include "indexof.h" namespace ircd { namespace json { template enable_if_tuple &> val(tuple &t) { return static_cast &>(std::get(t)); } template enable_if_tuple &> val(const tuple &t) { return static_cast &>(std::get(t)); } template constexpr bool key_exists(const string_view &key) { return indexof(key) < size(); } } // namespace json } // namespace ircd #include "get.h" #include "at.h" #include "for_each.h" #include "until.h" #include "set.h" namespace ircd { namespace json { template tuple::tuple(const json::object &object) { std::for_each(std::begin(object), std::end(object), [this] (const auto &member) { set(*this, member.first, member.second); }); } template tuple::tuple(const json::iov &iov) { std::for_each(std::begin(iov), std::end(iov), [this] (const auto &member) { set(*this, member.first, member.second); }); } template tuple::tuple(const std::initializer_list &members) { std::for_each(std::begin(members), std::end(members), [this] (const auto &member) { set(*this, member.first, member.second); }); } template template tuple::tuple(const tuple &t) { for_each(t, [this] (const auto &key, const auto &val) { set(*this, key, val); }); } template constexpr size_t tuple::size() { return std::tuple_size(); } template constexpr auto _key_transform(it_a it, const it_b end, closure&& lambda) { for(size_t i(0); i < tuple::size() && it != end; ++i) { *it = lambda(key()); ++it; } return it; } template constexpr auto _key_transform(it_a it, const it_b end) { for(size_t i(0); i < tuple::size() && it != end; ++i) { *it = key(); ++it; } return it; } template auto _key_transform(const tuple &tuple, it_a it, const it_b end) { for_each(tuple, [&it, &end] (const auto &key, const auto &val) { if(it != end) { *it = key; ++it; } }); return it; } } // namespace json } // namespace ircd #include "keys.h" namespace ircd { namespace json { template auto _member_transform_if(const tuple &tuple, it_a it, const it_b end, closure&& lambda) { until(tuple, [&it, &end, &lambda] (const auto &key, auto&& val) { if(it == end) return false; if(lambda(*it, key, val)) ++it; return true; }); return it; } template auto _member_transform(const tuple &tuple, it_a it, const it_b end, closure&& lambda) { return _member_transform_if(tuple, it, end, [&lambda] (auto&& ret, const auto &key, auto&& val) { ret = lambda(key, val); return true; }); } template auto _member_transform(const tuple &tuple, it_a it, const it_b end) { return _member_transform(tuple, it, end, [] (auto&& ret, const auto &key, auto&& val) -> member { return { key, val }; }); } template size_t serialized(const tuple &t) { constexpr const size_t member_count { tuple::size() }; std::array sizes {0}; const auto e{_member_transform_if(t, begin(sizes), end(sizes), [] (auto &ret, const string_view &key, auto&& val) { const json::value value(val); if(!defined(value)) return false; ret = 1 + key.size() + 1 + 1 + serialized(value) + 1; return true; })}; // Subtract one to get the final size when an extra comma is // accumulated on non-empty objects. const auto overhead { 1 + std::all_of(begin(sizes), e, is_zero{}) }; return std::accumulate(begin(sizes), e, size_t(overhead)); } template size_t serialized(const tuple *const &b, const tuple *const &e) { size_t ret(1 + (b == e)); return std::accumulate(b, e, ret, [] (size_t ret, const tuple &t) { return ret += serialized(t) + 1; }); } template string_view stringify(mutable_buffer &buf, const tuple &tuple) { std::array members; const auto e{_member_transform_if(tuple, begin(members), end(members), [] (auto &ret, const string_view &key, auto&& val) { json::value value(val); if(!defined(value)) return false; ret = member { key, std::move(value) }; return true; })}; return stringify(buf, begin(members), e); } template string_view stringify(mutable_buffer &buf, const tuple *b, const tuple *e) { const auto start(begin(buf)); consume(buf, copy(buf, "["_sv)); if(b != e) { stringify(buf, *b); for(++b; b != e; ++b) { consume(buf, copy(buf, ","_sv)); stringify(buf, *b); } } consume(buf, copy(buf, "]"_sv)); return { start, begin(buf) }; } template std::ostream & operator<<(std::ostream &s, const tuple &t) { s << json::strung(t); return s; } template tuple::operator crh::sha256::buf() const { //TODO: XXX const auto preimage { json::strung(*this) }; return crh::sha256::buf { [&preimage](auto &buf) { sha256{buf, const_buffer{preimage}}; } }; } template tuple::operator json::value() const { json::value ret; ret.type = OBJECT; ret.create_string(serialized(*this), [this] (mutable_buffer buffer) { stringify(buffer, *this); }); return ret; } } // namespace json } // namespace ircd