mirror of https://github.com/PCSX2/pcsx2.git
47 lines
1.1 KiB
C++
47 lines
1.1 KiB
C++
#ifndef _C4_YML_STD_MAP_HPP_
|
|
#define _C4_YML_STD_MAP_HPP_
|
|
|
|
/** @file map.hpp write/read std::map to/from a YAML tree. */
|
|
|
|
#include "c4/yml/node.hpp"
|
|
#include <map>
|
|
|
|
namespace c4 {
|
|
namespace yml {
|
|
|
|
// std::map requires child nodes in the data
|
|
// tree hierarchy (a MAP node in ryml parlance).
|
|
// So it should be serialized via write()/read().
|
|
|
|
template<class K, class V, class Less, class Alloc>
|
|
void write(c4::yml::NodeRef *n, std::map<K, V, Less, Alloc> const& m)
|
|
{
|
|
*n |= c4::yml::MAP;
|
|
for(auto const& C4_RESTRICT p : m)
|
|
{
|
|
auto ch = n->append_child();
|
|
ch << c4::yml::key(p.first);
|
|
ch << p.second;
|
|
}
|
|
}
|
|
|
|
/** read the node members, assigning into the existing map. If a key
|
|
* is already present in the map, then its value will be
|
|
* move-assigned. */
|
|
template<class K, class V, class Less, class Alloc>
|
|
bool read(c4::yml::ConstNodeRef const& n, std::map<K, V, Less, Alloc> * m)
|
|
{
|
|
for(auto const& C4_RESTRICT ch : n)
|
|
{
|
|
K k{};
|
|
ch >> c4::yml::key(k);
|
|
ch >> (*m)[k];
|
|
}
|
|
return true;
|
|
}
|
|
|
|
} // namespace yml
|
|
} // namespace c4
|
|
|
|
#endif // _C4_YML_STD_MAP_HPP_
|