reduced testcase

testcase.ii (text/plain), 2.14 KB, created by Stephan Hartmann (RETIRED) on 2020-11-27 15:01:18 UTC

template <typename, typename _T2> struct pair {
  int first;
  _T2 second;
  template <typename _U1, typename _U2>
  constexpr pair(pair<_U1, _U2> __p) : first(), second(__p.second) {}
  template <typename _U1, typename _U2>
  constexpr pair(_U1, _U2 __y) : first(), second(__y) {}
};
struct less {};
template <typename _Tp, _Tp> struct integer_sequence {};
template <typename _Tp, _Tp _Num>
using make_integer_sequence = integer_sequence<_Tp, __integer_pack(_Num)...>;
template <long... _Idx>
using index_sequence = integer_sequence<unsigned long, _Idx...>;
template <long _Num>
using make_index_sequence = make_integer_sequence<unsigned long, _Num>;
template <typename _Tp> struct array { _Tp _M_elems; };
class BasicStringPiece {
public:
  constexpr BasicStringPiece(const char *str) : ptr_(str), length_() {}
  const char *ptr_;
  long length_;
};
struct sorted_unique_t {
} sorted_unique;
template <typename T, int N, unsigned long... I>
constexpr array<pair<const int, BasicStringPiece>>
ToArrayImpl(T (&data)[N], index_sequence<I...>) {
  return {data[I]...};
}
template <typename, typename T, int N>
constexpr array<pair<const int, BasicStringPiece>> ToArray(T (&data)[N]) {
  return ToArrayImpl(data, make_index_sequence<N>());
}
template <class> class flat_tree {
public:
  using key_compare = less;
  using container_type = array<pair<const int, BasicStringPiece>>;
  constexpr flat_tree(sorted_unique_t, container_type &&);
  container_type body_;
  [[no_unique_address]] key_compare comp_;
};
template <class Container>
constexpr flat_tree<Container>::flat_tree(sorted_unique_t,
                                          container_type &&items)
    : body_(items), comp_() {}
class flat_map : flat_tree<int> {
  using tree = flat_tree;
  tree::tree;
};
template <class, class, long, class> using fixed_flat_map = flat_map;
template <class, class, int N>
constexpr fixed_flat_map<int, BasicStringPiece, N, less>
MakeFixedFlatMap(pair<int, BasicStringPiece>(&&data)[N]) {
  using FixedFlatMap = fixed_flat_map<int, BasicStringPiece, N, less>;
  return FixedFlatMap(sorted_unique, ToArray<int>(data));
}
void Get() { static auto kSchemas = MakeFixedFlatMap<int, int>({{"", ""}}); }