1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82
|
#include "Serializable.h"
#include "random_graph.generated.h"
#include <utility>
#include <cstdint>
std::pair<std::uint32_t, TypeHash> random_graph_id_hashes[] = {
{ 1, TypeHash({ 0x54, 0x5e, 0xa5, 0x38, 0x46, 0x10,
0x03, 0xef, 0xdc, 0x8c, 0x81, 0xc2, 0x44, 0x53, 0x1b,
0x00, 0x3f, 0x6f, 0x26, 0xcf, 0xcc, 0xf6, 0xc0, 0x07,
0x3b, 0x32, 0x39, 0xfd, 0xed, 0xf4, 0x94, 0x46, })},
{ 2, TypeHash({ 0xee, 0xf9, 0x3e, 0x1d, 0x14,
0x48, 0x28, 0x04, 0x27, 0x7f, 0xca, 0x01, 0x72, 0x46,
0x40, 0x32, 0xd1, 0xa4, 0xfd, 0xbc, 0xc3, 0x38, 0x52,
0x40, 0x59, 0xfa, 0x1e, 0x86, 0x14, 0x54, 0xad, 0x4d, })},
};
size_t random_graph_id_hashes_length = 2;
void *allocator_b5b8eeb6f0dc0289(std::uint32_t type)
{
switch (type) {
case 1:
return ::operator new (sizeof(node));
case 2:
return ::operator new (sizeof(graph));
}
return nullptr;
}
void constructor_b5b8eeb6f0dc0289(std::uint32_t type, void *s, DeserializerStream &ds)
{
switch (type) {
case 1: {
node *temp = (node *)s;
new (temp) node(ds);
}
break;
case 2: {
graph *temp = (graph *)s;
new (temp) graph(ds);
}
break;
}
}
void rollbacker_b5b8eeb6f0dc0289(std::uint32_t type, void *s)
{
switch (type) {
case 1: {
node *temp = (node *)s;
temp->rollback_deserialization();
}
break;
case 2: {
graph *temp = (graph *)s;
temp->rollback_deserialization();
}
break;
}
}
bool is_serializable_b5b8eeb6f0dc0289(std::uint32_t type)
{
switch (type) {
case 1:
return true;
break;
case 2:
return true;
break;
}
return false;
}
std::shared_ptr<SerializableMetadata> get_metadata_b5b8eeb6f0dc0289()
{
std::shared_ptr<SerializableMetadata> ret(new SerializableMetadata);
ret->set_functions(allocator_b5b8eeb6f0dc0289,
constructor_b5b8eeb6f0dc0289, rollbacker_b5b8eeb6f0dc0289, is_serializable_b5b8eeb6f0dc0289);
for (auto &p : random_graph_id_hashes)
ret->add_type(p.first, p.second);
return ret;
}
|