2022-12-19 14:37:51 +00:00
|
|
|
[info]
|
2023-05-23 22:26:38 +01:00
|
|
|
type_name = "folly::sorted_vector_map"
|
2022-12-19 14:37:51 +00:00
|
|
|
ctype = "MAP_SEQ_TYPE"
|
|
|
|
header = "folly/sorted_vector_types.h"
|
2023-07-25 17:14:59 +01:00
|
|
|
stub_template_params = [2,3]
|
2023-05-23 22:26:38 +01:00
|
|
|
|
|
|
|
# Old:
|
|
|
|
typeName = "folly::sorted_vector_map<"
|
2022-12-19 14:37:51 +00:00
|
|
|
ns = ["namespace std", "folly::sorted_vector_map"]
|
2023-05-23 22:26:38 +01:00
|
|
|
numTemplateParams = 2
|
2022-12-19 14:37:51 +00:00
|
|
|
replaceTemplateParamIndex = []
|
|
|
|
|
|
|
|
[codegen]
|
|
|
|
decl = """
|
|
|
|
template <class Key, class Value, class Compare, class Allocator, class GrowthPolicy, class Container>
|
|
|
|
void getSizeType(const %1%<Key, Value, Compare, Allocator, GrowthPolicy, Container> &container, size_t& returnArg);
|
|
|
|
"""
|
|
|
|
|
|
|
|
func = """
|
|
|
|
template <class Key, class Value, class Compare, class Allocator, class GrowthPolicy, class Container>
|
|
|
|
void getSizeType(const %1%<Key, Value, Compare, Allocator, GrowthPolicy, Container> &container, size_t& returnArg)
|
|
|
|
{
|
|
|
|
SAVE_SIZE(sizeof(%1%<Key,Value,Compare,Allocator,GrowthPolicy,Container>));
|
|
|
|
|
|
|
|
SAVE_DATA((uintptr_t)&container);
|
|
|
|
SAVE_DATA((uintptr_t)container.capacity());
|
|
|
|
SAVE_DATA((uintptr_t)container.size());
|
|
|
|
|
|
|
|
SAVE_SIZE((container.capacity() - container.size()) * (sizeof(Key) + sizeof(Value)));
|
|
|
|
|
|
|
|
for (auto const& it : container)
|
|
|
|
{
|
|
|
|
getSizeType(it.first, returnArg);
|
|
|
|
getSizeType(it.second, returnArg);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
"""
|
2023-08-16 20:40:36 +01:00
|
|
|
|
|
|
|
traversal_func = '''
|
|
|
|
auto tail = returnArg.write((uintptr_t)&container)
|
|
|
|
.write(container.capacity())
|
|
|
|
.write(container.size());
|
|
|
|
|
|
|
|
for (const auto& kv : container) {
|
2023-11-16 15:34:03 +00:00
|
|
|
tail = tail.delegate([&ctx, &kv](auto ret) {
|
|
|
|
auto start = maybeCaptureKey<captureKeys, Ctx, T0>(ctx, kv.first, ret);
|
|
|
|
auto next = start.delegate([&ctx, &kv](typename TypeHandler<Ctx, T0>::type ret) {
|
|
|
|
return OIInternal::getSizeType<Ctx>(ctx, kv.first, ret);
|
2023-08-16 20:40:36 +01:00
|
|
|
});
|
2023-11-16 15:34:03 +00:00
|
|
|
return OIInternal::getSizeType<Ctx>(ctx, kv.second, next);
|
2023-08-16 20:40:36 +01:00
|
|
|
});
|
|
|
|
}
|
|
|
|
|
|
|
|
return tail.finish();
|
|
|
|
'''
|
|
|
|
|
|
|
|
[[codegen.processor]]
|
|
|
|
type = "types::st::VarInt<DB>"
|
|
|
|
func = "el.pointer = std::get<ParsedData::VarInt>(d.val).value;"
|
|
|
|
|
|
|
|
[[codegen.processor]]
|
|
|
|
type = "types::st::VarInt<DB>"
|
|
|
|
func = '''
|
|
|
|
el.container_stats.emplace(result::Element::ContainerStats{ .capacity = std::get<ParsedData::VarInt>(d.val).value });
|
|
|
|
'''
|
|
|
|
|
|
|
|
[[codegen.processor]]
|
2023-09-27 21:46:19 +01:00
|
|
|
type = '''
|
|
|
|
std::conditional_t<captureKeys,
|
|
|
|
types::st::List<DB, types::st::Pair<DB,
|
2023-11-15 19:28:21 +00:00
|
|
|
typename CaptureKeyHandler<Ctx, T0>::type,
|
2023-09-27 21:46:19 +01:00
|
|
|
types::st::Pair<DB,
|
2023-11-15 19:28:21 +00:00
|
|
|
typename TypeHandler<Ctx, T0>::type,
|
|
|
|
typename TypeHandler<Ctx, T1>::type>>>,
|
2023-09-27 21:46:19 +01:00
|
|
|
types::st::List<DB, types::st::Pair<DB,
|
2023-11-15 19:28:21 +00:00
|
|
|
typename TypeHandler<Ctx, T0>::type,
|
|
|
|
typename TypeHandler<Ctx, T1>::type>>>
|
2023-09-27 21:46:19 +01:00
|
|
|
'''
|
2023-08-16 20:40:36 +01:00
|
|
|
func = '''
|
|
|
|
using element_type = std::pair<T0, T1>;
|
|
|
|
|
|
|
|
static constexpr std::array<inst::Field, 2> entryFields{
|
2023-11-15 19:28:21 +00:00
|
|
|
make_field<Ctx, T0>("key"),
|
|
|
|
make_field<Ctx, T1>("value"),
|
2023-08-16 20:40:36 +01:00
|
|
|
};
|
2023-11-15 19:28:21 +00:00
|
|
|
static constexpr auto processors = maybeCaptureKeysProcessor<captureKeys, Ctx, T0>();
|
2023-08-25 18:36:42 +01:00
|
|
|
static constexpr auto entry = inst::Field {
|
2023-08-16 20:40:36 +01:00
|
|
|
sizeof(element_type),
|
|
|
|
sizeof(element_type) - sizeof(T0) - sizeof(T1),
|
|
|
|
"[]",
|
2023-08-24 13:42:12 +01:00
|
|
|
std::array<std::string_view, 0>{},
|
2023-08-16 20:40:36 +01:00
|
|
|
entryFields,
|
2023-09-27 21:46:19 +01:00
|
|
|
processors,
|
2024-01-15 16:23:10 +00:00
|
|
|
entryFields[0].is_primitive && entryFields[1].is_primitive,
|
2023-08-16 20:40:36 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
auto list = std::get<ParsedData::List>(d.val);
|
|
|
|
el.container_stats->length = list.length;
|
|
|
|
el.exclusive_size += (el.container_stats->capacity - el.container_stats->length) * sizeof(element_type);
|
|
|
|
|
|
|
|
for (size_t i = 0; i < list.length; i++)
|
2023-09-14 16:09:23 +01:00
|
|
|
stack_ins(entry);
|
2023-08-16 20:40:36 +01:00
|
|
|
'''
|