|
| 1 | +#include <ROOT/REntry.hxx> |
| 2 | +#include <ROOT/RNTupleReader.hxx> |
| 3 | + |
| 4 | +using ROOT::Experimental::REntry; |
| 5 | +using ROOT::Experimental::RNTupleReader; |
| 6 | + |
| 7 | +#include <TSystem.h> |
| 8 | + |
| 9 | +#include <cstdint> |
| 10 | +#include <filesystem> |
| 11 | +#include <fstream> |
| 12 | +#include <ostream> |
| 13 | +#include <string> |
| 14 | +#include <string_view> |
| 15 | +#include <unordered_map> |
| 16 | + |
| 17 | +using UnorderedMultimap = |
| 18 | + std::unordered_multimap<std::string, |
| 19 | + std::unordered_multimap<std::string, std::int32_t>>; |
| 20 | + |
| 21 | +static void PrintNestedUnorderedMultimapValue(const REntry &entry, |
| 22 | + std::string_view name, |
| 23 | + std::ostream &os, |
| 24 | + bool last = false) { |
| 25 | + UnorderedMultimap &item = *entry.GetPtr<UnorderedMultimap>(name); |
| 26 | + |
| 27 | + std::vector<std::pair< |
| 28 | + UnorderedMultimap::key_type, |
| 29 | + std::vector<std::pair<UnorderedMultimap::mapped_type::key_type, |
| 30 | + UnorderedMultimap::mapped_type::mapped_type>>>> |
| 31 | + itemSorted; |
| 32 | + for (auto &[key, inner] : item) { |
| 33 | + std::vector<std::pair<UnorderedMultimap::mapped_type::key_type, |
| 34 | + UnorderedMultimap::mapped_type::mapped_type>> |
| 35 | + innerSorted(inner.begin(), inner.end()); |
| 36 | + std::sort(innerSorted.begin(), innerSorted.end()); |
| 37 | + itemSorted.emplace_back(std::make_pair(key, innerSorted)); |
| 38 | + } |
| 39 | + std::sort(itemSorted.begin(), itemSorted.end()); |
| 40 | + |
| 41 | + os << " \"" << name << "\": {"; |
| 42 | + bool outerFirst = true; |
| 43 | + for (auto &[key, inner] : itemSorted) { |
| 44 | + if (outerFirst) { |
| 45 | + outerFirst = false; |
| 46 | + } else { |
| 47 | + os << ","; |
| 48 | + } |
| 49 | + os << "\n \"" << key << "\": {"; |
| 50 | + bool innerFirst = true; |
| 51 | + for (auto &[innerKey, value] : inner) { |
| 52 | + if (innerFirst) { |
| 53 | + innerFirst = false; |
| 54 | + } else { |
| 55 | + os << ","; |
| 56 | + } |
| 57 | + os << "\n \"" << innerKey << "\": " << value; |
| 58 | + } |
| 59 | + if (!inner.empty()) { |
| 60 | + os << "\n "; |
| 61 | + } |
| 62 | + os << "}"; |
| 63 | + } |
| 64 | + if (!item.empty()) { |
| 65 | + os << "\n "; |
| 66 | + } |
| 67 | + os << "}"; |
| 68 | + if (!last) { |
| 69 | + os << ","; |
| 70 | + } |
| 71 | + os << "\n"; |
| 72 | +} |
| 73 | + |
| 74 | +void read(std::string_view input = "types.unordered_multimap.nested.root", |
| 75 | + std::string_view output = "types.unordered_multimap.nested.json") { |
| 76 | + if (gSystem->Load("libNestedUnorderedMultimap") == -1) |
| 77 | + throw std::runtime_error("could not find the required ROOT dictionaries, " |
| 78 | + "please make sure to run `make` first"); |
| 79 | + |
| 80 | + std::ofstream os(std::string{output}); |
| 81 | + os << "[\n"; |
| 82 | + |
| 83 | + auto reader = RNTupleReader::Open("ntpl", input); |
| 84 | + auto &entry = reader->GetModel().GetDefaultEntry(); |
| 85 | + bool first = true; |
| 86 | + for (auto index : *reader) { |
| 87 | + reader->LoadEntry(index); |
| 88 | + |
| 89 | + if (first) { |
| 90 | + first = false; |
| 91 | + } else { |
| 92 | + os << ",\n"; |
| 93 | + } |
| 94 | + os << " {\n"; |
| 95 | + |
| 96 | + PrintNestedUnorderedMultimapValue(entry, "Index32", os); |
| 97 | + PrintNestedUnorderedMultimapValue(entry, "Index64", os); |
| 98 | + PrintNestedUnorderedMultimapValue(entry, "SplitIndex32", os); |
| 99 | + PrintNestedUnorderedMultimapValue(entry, "SplitIndex64", os, /*last=*/true); |
| 100 | + |
| 101 | + os << " }"; |
| 102 | + // Newline is intentionally missing, may need to print a comma before the |
| 103 | + // next entry. |
| 104 | + } |
| 105 | + os << "\n"; |
| 106 | + os << "]\n"; |
| 107 | +} |
0 commit comments