dx_key_value_tree.h File Reference

#include "dx_common.h"
#include "dx_iterator.h"
#include <memory>
#include <set>
#include <string>
#include <type_traits>
#include <vector>

Include dependency graph for dx_key_value_tree.h:

This graph shows which files directly or indirectly include this file:

Classes
struct	dx::is_dx_iterator<type_t, std::void_t<typename type_t::dx_iterator_tag>>
struct	dx::is_dx_iterator<type_t, typename>
struct	dx::is_initializer_list<std::initializer_list<type_t>>
struct	dx::is_initializer_list<type_t>
struct	dx::is_smart_pointer<std::shared_ptr<type_t>>
struct	dx::is_smart_pointer<std::unique_ptr<type_t, deleter_t>>
struct	dx::is_smart_pointer<std::weak_ptr<type_t>>
struct	dx::is_smart_pointer<type_t>
struct	dx::is_string_container<type_t, bool>
struct	dx::is_string_container<type_t, false>
struct	dx::is_string_container<type_t, false>::probe<t, std::void_t<typename t::value_type, decltype(t(std::declval<std::set<std::string>::iterator>(), std::declval<std::set<std::string>::iterator>()))>>
struct	dx::is_string_container<type_t, false>::probe<t, typename>
class	dx::key_value_tree<tree_t>
	hierarchical key/value navigation over a flat persistent store More...
class	dx::key_value_tree<tree_t>::iterator
	the node's immediate children as nodes of their own, named by tree_t::children() - what a range-for over a node walks More...
struct	dx::key_value_tree_enabled<tree_t, value_t, std::void_t<decltype(tree_t::template enabled<value_t>())>>
struct	dx::key_value_tree_enabled<tree_t, value_t, typename>

Namespaces
namespace	dx
	dynax driver framework interface namespace

Variables
template<typename type_t>
constexpr bool	dx::is_dx_iterator_v= is_dx_iterator<type_t>::value
template<typename type_t>
constexpr bool	dx::is_initializer_list_v= is_initializer_list<type_t>::value
template<typename type_t>
constexpr bool	dx::is_smart_pointer_v= is_smart_pointer<type_t>::value
template<typename type_t>
constexpr bool	dx::is_string_container_v= is_string_container<type_t>::value