rapidyaml 0.15.1
parse and emit YAML, and do it fast
Loading...
Searching...
No Matches
c4::yml::detail::RoNodeMethods< Impl, ConstImpl > Struct Template Reference

#include <node.hpp>

Public Member Functions

node property getters
NodeData const * get () const RYML_NOEXCEPT
 returns the data or null when the id is NONE
template<class U = Impl>
auto get () RYML_NOEXCEPT -> NodeData *
 returns the data or null when the id is NONE
NodeType type () const RYML_NOEXCEPT
 Forward to Tree::type().
const char * type_str () const RYML_NOEXCEPT
 Forward to Tree::type_str().
csubstr key () const RYML_NOEXCEPT
 Forward to Tree::key().
csubstr key_tag () const RYML_NOEXCEPT
 Forward to Tree::key_tag().
csubstr key_ref () const RYML_NOEXCEPT
 Forward to Tree::key_ref().
csubstr key_anchor () const RYML_NOEXCEPT
 Forward to Tree::key_anchor().
csubstr val () const RYML_NOEXCEPT
 Forward to Tree::val().
csubstr val_tag () const RYML_NOEXCEPT
 Forward to Tree::val_tag().
csubstr val_ref () const RYML_NOEXCEPT
 Forward to Tree::val_ref().
csubstr val_anchor () const RYML_NOEXCEPT
 Forward to Tree::val_anchor().
NodeScalar const & keysc () const RYML_NOEXCEPT
 Forward to Tree::keysc().
NodeScalar const & valsc () const RYML_NOEXCEPT
 Forward to Tree::valsc().
bool key_is_null () const RYML_NOEXCEPT
 Forward to Tree::key_is_null().
bool val_is_null () const RYML_NOEXCEPT
 Forward to Tree::val_is_null().
bool is_key_unfiltered () const noexcept
 Forward to Tree::is_key_unfiltered().
bool is_val_unfiltered () const noexcept
 Forward to Tree::is_val_unfiltered().
node type predicates
bool empty () const RYML_NOEXCEPT
 Forward to Tree::empty().
bool is_stream () const RYML_NOEXCEPT
 Forward to Tree::is_stream().
bool is_doc () const RYML_NOEXCEPT
 Forward to Tree::is_doc().
bool is_container () const RYML_NOEXCEPT
 Forward to Tree::is_container().
bool is_map () const RYML_NOEXCEPT
 Forward to Tree::is_map().
bool is_seq () const RYML_NOEXCEPT
 Forward to Tree::is_seq().
bool has_val () const RYML_NOEXCEPT
 Forward to Tree::has_val().
bool has_key () const RYML_NOEXCEPT
 Forward to Tree::has_key().
bool is_val () const RYML_NOEXCEPT
 Forward to Tree::is_val().
bool is_keyval () const RYML_NOEXCEPT
 Forward to Tree::is_keyval().
bool has_key_tag () const RYML_NOEXCEPT
 Forward to Tree::has_key_tag().
bool has_val_tag () const RYML_NOEXCEPT
 Forward to Tree::has_val_tag().
bool has_key_anchor () const RYML_NOEXCEPT
 Forward to Tree::has_key_anchor().
bool has_val_anchor () const RYML_NOEXCEPT
 Forward to Tree::has_val_anchor().
bool has_anchor () const RYML_NOEXCEPT
 Forward to Tree::has_anchor().
bool is_key_ref () const RYML_NOEXCEPT
 Forward to Tree::is_key_ref().
bool is_val_ref () const RYML_NOEXCEPT
 Forward to Tree::is_val_ref().
bool is_ref () const RYML_NOEXCEPT
 Forward to Tree::is_ref().
bool parent_is_seq () const RYML_NOEXCEPT
 Forward to Tree::parent_is_seq().
bool parent_is_map () const RYML_NOEXCEPT
 Forward to Tree::parent_is_map().
bool is_key_anchor () const noexcept
bool is_val_hanchor () const noexcept
bool is_anchor () const noexcept
bool is_anchor_or_ref () const noexcept
style predicates
bool type_has_any (NodeType_e bits) const RYML_NOEXCEPT
 Forward to Tree::type_has_any().
bool type_has_all (NodeType_e bits) const RYML_NOEXCEPT
 Forward to Tree::type_has_all().
bool type_has_none (NodeType_e bits) const RYML_NOEXCEPT
 Forward to Tree::type_has_none().
NodeType key_style () const RYML_NOEXCEPT
 Forward to Tree::key_style().
NodeType val_style () const RYML_NOEXCEPT
 Forward to Tree::val_style().
bool is_container_styled () const RYML_NOEXCEPT
 Forward to Tree::is_container_styled().
bool is_block () const RYML_NOEXCEPT
 Forward to Tree::is_block().
bool is_flow () const RYML_NOEXCEPT
 Forward to Tree::is_flow().
bool is_flow_sl () const RYML_NOEXCEPT
 Forward to Tree::is_flow_sl().
bool is_flow_ml () const RYML_NOEXCEPT
 Forward to Tree::is_flow_ml1().
bool is_flow_ml1 () const RYML_NOEXCEPT
 Forward to Tree::is_flow_ml1().
bool is_flow_mln () const RYML_NOEXCEPT
 Forward to Tree::is_flow_mln().
bool is_flow_mlx () const RYML_NOEXCEPT
 Forward to Tree::is_flow_mlx().
bool has_flow_space () const RYML_NOEXCEPT
 Forward to Tree::has_flow_space().
bool is_key_styled () const RYML_NOEXCEPT
 Forward to Tree::is_key_styled().
bool is_val_styled () const RYML_NOEXCEPT
 Forward to Tree::is_val_styled().
bool is_key_literal () const RYML_NOEXCEPT
 Forward to Tree::is_key_literal().
bool is_val_literal () const RYML_NOEXCEPT
 Forward to Tree::is_val_literal().
bool is_key_folded () const RYML_NOEXCEPT
 Forward to Tree::is_key_folded().
bool is_val_folded () const RYML_NOEXCEPT
 Forward to Tree::is_val_folded().
bool is_key_squo () const RYML_NOEXCEPT
 Forward to Tree::is_key_squo().
bool is_val_squo () const RYML_NOEXCEPT
 Forward to Tree::is_val_squo().
bool is_key_dquo () const RYML_NOEXCEPT
 Forward to Tree::is_key_dquo().
bool is_val_dquo () const RYML_NOEXCEPT
 Forward to Tree::is_val_dquo().
bool is_key_plain () const RYML_NOEXCEPT
 Forward to Tree::is_key_plain().
bool is_val_plain () const RYML_NOEXCEPT
 Forward to Tree::is_val_plain().
bool is_key_quoted () const RYML_NOEXCEPT
 Forward to Tree::is_key_quoted().
bool is_val_quoted () const RYML_NOEXCEPT
 Forward to Tree::is_val_quoted().
bool is_quoted () const RYML_NOEXCEPT
 Forward to Tree::is_quoted().
hierarchy predicates
bool is_root () const RYML_NOEXCEPT
 Forward to Tree::is_root().
bool has_parent () const RYML_NOEXCEPT
 Forward to Tree::has_parent() Node must be readable.
bool is_ancestor (ConstImpl const &ancestor) const RYML_NOEXCEPT
 Forward to Tree::is_ancestor() Node must be readable.
bool has_child (ConstImpl const &n) const RYML_NOEXCEPT
 Forward to Tree::has_child().
bool has_child (id_type node) const RYML_NOEXCEPT
 Forward to Tree::has_child().
bool has_child (csubstr name) const RYML_NOEXCEPT
 Forward to Tree::has_child().
bool has_children () const RYML_NOEXCEPT
 Forward to Tree::has_children().
bool has_sibling (ConstImpl const &n) const RYML_NOEXCEPT
 Forward to Tree::has_sibling().
bool has_sibling (id_type node) const RYML_NOEXCEPT
 Forward to Tree::has_sibling().
bool has_sibling (csubstr name) const RYML_NOEXCEPT
 Forward to Tree::has_sibling().
bool has_other_siblings () const RYML_NOEXCEPT
 Forward to Tree::has_other_siblings().
bool has_siblings () const RYML_NOEXCEPT
hierarchy getters
template<class U = Impl>
auto doc (id_type i) RYML_NOEXCEPT -> Impl
 Forward to Tree::doc().
ConstImpl doc (id_type i) const RYML_NOEXCEPT
 Forward to Tree::doc().
template<class U = Impl>
auto parent () RYML_NOEXCEPT -> Impl
 Forward to Tree::parent().
ConstImpl parent () const RYML_NOEXCEPT
 Forward to Tree::parent().
template<class U = Impl>
auto first_child () RYML_NOEXCEPT -> Impl
 Forward to Tree::first_child().
ConstImpl first_child () const RYML_NOEXCEPT
 Forward to Tree::first_child().
template<class U = Impl>
auto last_child () RYML_NOEXCEPT -> Impl
 Forward to Tree::last_child().
ConstImpl last_child () const RYML_NOEXCEPT
 Forward to Tree::last_child().
template<class U = Impl>
auto child (id_type pos) RYML_NOEXCEPT -> Impl
 Forward to Tree::child().
ConstImpl child (id_type pos) const RYML_NOEXCEPT
 Forward to Tree::child().
template<class U = Impl>
auto find_child (csubstr name) RYML_NOEXCEPT -> Impl
 Forward to Tree::find_child().
ConstImpl find_child (csubstr name) const RYML_NOEXCEPT
 Forward to Tree::find_child().
template<class U = Impl>
auto prev_sibling () RYML_NOEXCEPT -> Impl
 Forward to Tree::prev_sibling().
ConstImpl prev_sibling () const RYML_NOEXCEPT
 Forward to Tree::prev_sibling().
template<class U = Impl>
auto next_sibling () RYML_NOEXCEPT -> Impl
 Forward to Tree::next_sibling().
ConstImpl next_sibling () const RYML_NOEXCEPT
 Forward to Tree::next_sibling().
template<class U = Impl>
auto first_sibling () RYML_NOEXCEPT -> Impl
 Forward to Tree::first_sibling().
ConstImpl first_sibling () const RYML_NOEXCEPT
 Forward to Tree::first_sibling().
template<class U = Impl>
auto last_sibling () RYML_NOEXCEPT -> Impl
 Forward to Tree::last_sibling().
ConstImpl last_sibling () const RYML_NOEXCEPT
 Forward to Tree::last_sibling().
template<class U = Impl>
auto sibling (id_type pos) RYML_NOEXCEPT -> Impl
 Forward to Tree::sibling().
ConstImpl sibling (id_type pos) const RYML_NOEXCEPT
 Forward to Tree::sibling().
template<class U = Impl>
auto find_sibling (csubstr name) RYML_NOEXCEPT -> Impl
 Forward to Tree::find_sibling().
ConstImpl find_sibling (csubstr name) const RYML_NOEXCEPT
 Forward to Tree::find_sibling().
template<class U = Impl>
auto ancestor_doc () RYML_NOEXCEPT -> Impl
 Forward to Tree::ancestor_doc().
ConstImpl ancestor_doc () const RYML_NOEXCEPT
 Forward to Tree::ancestor_doc().
id_type num_children () const RYML_NOEXCEPT
 O(num_children).
id_type num_siblings () const RYML_NOEXCEPT
 O(num_children).
id_type num_other_siblings () const RYML_NOEXCEPT
 O(num_siblings).
id_type child_pos (ConstImpl const &n) const RYML_NOEXCEPT
 O(num_children).
id_type sibling_pos (ConstImpl const &n) const RYML_NOEXCEPT
 O(num_siblings).
id_type depth_asc () const RYML_NOEXCEPT
id_type depth_desc () const RYML_NOEXCEPT
 O(log(num_nodes)).
square_brackets

O(num_nodes).

Forward to Tree::depth_desc(). Node must be readable.

operator[]

template<class U = Impl>
auto operator[] (csubstr key) RYML_NOEXCEPT -> Impl
 Find child by key; complexity is O(num_children).
template<class U = Impl>
auto operator[] (id_type pos) RYML_NOEXCEPT -> Impl
 Find child by position; complexity is O(pos).
ConstImpl operator[] (csubstr key) const RYML_NOEXCEPT
 Find a child by key; complexity is O(num_children).
ConstImpl operator[] (id_type pos) const RYML_NOEXCEPT
 Find a child by position; complexity is O(pos).
at

These functions are the analogue to operator[], with the difference that they emit an error instead of an assertion.

That is, if any of the pre or post conditions is violated, an error is always emitted (resulting in a call to the error callback).

template<class U = Impl>
auto at (csubstr key) -> Impl
 Find child by key; complexity is O(num_children).
template<class U = Impl>
auto at (id_type pos) -> Impl
 Find child by position; complexity is O(pos).
ConstImpl at (csubstr key) const
 Get a child by name, with error checking; complexity is O(num_children).
ConstImpl at (id_type pos) const
 Get a child by position, with error checking; complexity is O(pos).
locations
Location location (Parser const &parser) const
deserialization
template<class T>
ConstImpl const & operator>> (T &v) const
 deserialize the node's val to the given variable, forwarding to the user-overrideable read() function.
template<class T>
ConstImpl const & operator>> (T const &wrapper) const
template<class T>
ConstImpl const & operator>> (Key< T > v) const
 deserialize the node's key to the given variable, forwarding to the user-overrideable read() function; use key() to disambiguate; for example: node >> ryml::key(var)
template<class T>
bool get_if (csubstr name, T *var) const
 look for a child by name, if it exists assign to var.
template<class T>
bool get_if (csubstr name, T *var, T const &fallback) const
 look for a child by name, if it exists assign to var, otherwise default to fallback.

iteration

using iterator = detail::child_iterator<Impl>
using const_iterator = detail::child_iterator<ConstImpl>
using children_view = detail::children_view_<Impl>
using const_children_view = detail::children_view_<ConstImpl>
template<class U = Impl>
auto begin () RYML_NOEXCEPT -> iterator
 get a mutable iterator to the first child.
const_iterator begin () const RYML_NOEXCEPT
 get an iterator to the first child
const_iterator cbegin () const RYML_NOEXCEPT
 get an iterator to the first child
template<class U = Impl>
auto end () RYML_NOEXCEPT -> iterator
 get an iterator to after the last child.
const_iterator end () const RYML_NOEXCEPT
 get an iterator to after the last child
const_iterator cend () const RYML_NOEXCEPT
 get an iterator to after the last child
template<class U = Impl>
auto children () RYML_NOEXCEPT -> children_view
 get an iterable view over children.
const_children_view children () const RYML_NOEXCEPT
 get an iterable view over children
const_children_view cchildren () const RYML_NOEXCEPT
 get an iterable view over children
template<class U = Impl>
auto siblings () RYML_NOEXCEPT -> children_view
 get an iterable view over all siblings (including the calling node)
const_children_view siblings () const RYML_NOEXCEPT
 get an iterable view over all siblings (including the calling node)
const_children_view csiblings () const RYML_NOEXCEPT
 get an iterable view over all siblings (including the calling node)
template<class Visitor>
bool visit (Visitor fn, id_type indentation_level=0, bool skip_root=true) const RYML_NOEXCEPT
 visit every child node calling fn(node)
template<class Visitor, class U = Impl>
auto visit (Visitor fn, id_type indentation_level=0, bool skip_root=true) RYML_NOEXCEPT -> bool
 visit every child node calling fn(node)
template<class Visitor>
bool visit_stacked (Visitor fn, id_type indentation_level=0, bool skip_root=true) const RYML_NOEXCEPT
 visit every child node calling fn(node, level)
template<class Visitor, class U = Impl>
auto visit_stacked (Visitor fn, id_type indentation_level=0, bool skip_root=true) RYML_NOEXCEPT -> bool
 visit every child node calling fn(node, level)

Detailed Description

template<class Impl, class ConstImpl>
struct c4::yml::detail::RoNodeMethods< Impl, ConstImpl >

Definition at line 175 of file node.hpp.

Member Typedef Documentation

◆ iterator

template<class Impl, class ConstImpl>
using c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::iterator = detail::child_iterator<Impl>

Definition at line 725 of file node.hpp.

◆ const_iterator

template<class Impl, class ConstImpl>
using c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::const_iterator = detail::child_iterator<ConstImpl>

Definition at line 726 of file node.hpp.

◆ children_view

template<class Impl, class ConstImpl>
using c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::children_view = detail::children_view_<Impl>

Definition at line 727 of file node.hpp.

◆ const_children_view

template<class Impl, class ConstImpl>
using c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::const_children_view = detail::children_view_<ConstImpl>

Definition at line 728 of file node.hpp.

Member Function Documentation

◆ get() [1/2]

template<class Impl, class ConstImpl>
NodeData const * c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::get ( ) const
inline

returns the data or null when the id is NONE

Definition at line 201 of file node.hpp.

201{ return ((Impl const*)this)->readable() ? tree_->get(id_) : nullptr; }
NodeData const * get() const RYML_NOEXCEPT
returns the data or null when the id is NONE
Definition node.hpp:201

◆ get() [2/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::get ( ) ->NodeData *
inline

returns the data or null when the id is NONE

Definition at line 205 of file node.hpp.

205{ return ((Impl const*)this)->readable() ? tree__->get(id__) : nullptr; }

◆ type()

template<class Impl, class ConstImpl>
NodeType c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::type ( ) const
inline

Forward to Tree::type().

Node must be readable.

Definition at line 207 of file node.hpp.

◆ type_str()

template<class Impl, class ConstImpl>
const char * c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::type_str ( ) const
inline

Forward to Tree::type_str().

Node must be readable.

Definition at line 208 of file node.hpp.

◆ key()

template<class Impl, class ConstImpl>
csubstr c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::key ( ) const
inline

Forward to Tree::key().

Node must be readable.

Definition at line 210 of file node.hpp.

◆ key_tag()

template<class Impl, class ConstImpl>
csubstr c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::key_tag ( ) const
inline

Forward to Tree::key_tag().

Node must be readable.

Definition at line 211 of file node.hpp.

◆ key_ref()

template<class Impl, class ConstImpl>
csubstr c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::key_ref ( ) const
inline

Forward to Tree::key_ref().

Node must be readable.

Definition at line 212 of file node.hpp.

◆ key_anchor()

template<class Impl, class ConstImpl>
csubstr c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::key_anchor ( ) const
inline

Forward to Tree::key_anchor().

Node must be readable.

Definition at line 213 of file node.hpp.

◆ val()

template<class Impl, class ConstImpl>
csubstr c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::val ( ) const
inline

Forward to Tree::val().

Node must be readable.

Definition at line 215 of file node.hpp.

◆ val_tag()

template<class Impl, class ConstImpl>
csubstr c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::val_tag ( ) const
inline

Forward to Tree::val_tag().

Node must be readable.

Definition at line 216 of file node.hpp.

◆ val_ref()

template<class Impl, class ConstImpl>
csubstr c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::val_ref ( ) const
inline

Forward to Tree::val_ref().

Node must be readable.

Definition at line 217 of file node.hpp.

◆ val_anchor()

template<class Impl, class ConstImpl>
csubstr c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::val_anchor ( ) const
inline

Forward to Tree::val_anchor().

Node must be readable.

Definition at line 218 of file node.hpp.

◆ keysc()

template<class Impl, class ConstImpl>
NodeScalar const & c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::keysc ( ) const
inline

Forward to Tree::keysc().

Node must be readable.

Definition at line 220 of file node.hpp.

◆ valsc()

template<class Impl, class ConstImpl>
NodeScalar const & c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::valsc ( ) const
inline

Forward to Tree::valsc().

Node must be readable.

Definition at line 221 of file node.hpp.

◆ key_is_null()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::key_is_null ( ) const
inline

Forward to Tree::key_is_null().

Node must be readable.

Definition at line 223 of file node.hpp.

◆ val_is_null()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::val_is_null ( ) const
inline

Forward to Tree::val_is_null().

Node must be readable.

Definition at line 224 of file node.hpp.

◆ is_key_unfiltered()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_key_unfiltered ( ) const
inlinenoexcept

Forward to Tree::is_key_unfiltered().

Node must be readable.

Definition at line 226 of file node.hpp.

◆ is_val_unfiltered()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_val_unfiltered ( ) const
inlinenoexcept

Forward to Tree::is_val_unfiltered().

Node must be readable.

Definition at line 227 of file node.hpp.

◆ empty()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::empty ( ) const
inline

Forward to Tree::empty().

Node must be readable.

Definition at line 236 of file node.hpp.

◆ is_stream()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_stream ( ) const
inline

Forward to Tree::is_stream().

Node must be readable.

Definition at line 237 of file node.hpp.

◆ is_doc()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_doc ( ) const
inline

Forward to Tree::is_doc().

Node must be readable.

Definition at line 238 of file node.hpp.

◆ is_container()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_container ( ) const
inline

Forward to Tree::is_container().

Node must be readable.

Definition at line 239 of file node.hpp.

◆ is_map()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_map ( ) const
inline

Forward to Tree::is_map().

Node must be readable.

Definition at line 240 of file node.hpp.

◆ is_seq()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_seq ( ) const
inline

Forward to Tree::is_seq().

Node must be readable.

Definition at line 241 of file node.hpp.

◆ has_val()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_val ( ) const
inline

Forward to Tree::has_val().

Node must be readable.

Definition at line 242 of file node.hpp.

◆ has_key()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_key ( ) const
inline

Forward to Tree::has_key().

Node must be readable.

Definition at line 243 of file node.hpp.

◆ is_val()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_val ( ) const
inline

Forward to Tree::is_val().

Node must be readable.

Definition at line 244 of file node.hpp.

◆ is_keyval()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_keyval ( ) const
inline

Forward to Tree::is_keyval().

Node must be readable.

Definition at line 245 of file node.hpp.

◆ has_key_tag()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_key_tag ( ) const
inline

Forward to Tree::has_key_tag().

Node must be readable.

Definition at line 246 of file node.hpp.

◆ has_val_tag()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_val_tag ( ) const
inline

Forward to Tree::has_val_tag().

Node must be readable.

Definition at line 247 of file node.hpp.

◆ has_key_anchor()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_key_anchor ( ) const
inline

Forward to Tree::has_key_anchor().

Node must be readable.

Definition at line 248 of file node.hpp.

◆ has_val_anchor()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_val_anchor ( ) const
inline

Forward to Tree::has_val_anchor().

Node must be readable.

Definition at line 249 of file node.hpp.

◆ has_anchor()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_anchor ( ) const
inline

Forward to Tree::has_anchor().

Node must be readable.

Definition at line 250 of file node.hpp.

◆ is_key_ref()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_key_ref ( ) const
inline

Forward to Tree::is_key_ref().

Node must be readable.

Definition at line 251 of file node.hpp.

◆ is_val_ref()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_val_ref ( ) const
inline

Forward to Tree::is_val_ref().

Node must be readable.

Definition at line 252 of file node.hpp.

◆ is_ref()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_ref ( ) const
inline

Forward to Tree::is_ref().

Node must be readable.

Definition at line 253 of file node.hpp.

◆ parent_is_seq()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::parent_is_seq ( ) const
inline

Forward to Tree::parent_is_seq().

Node must be readable.

Definition at line 254 of file node.hpp.

◆ parent_is_map()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::parent_is_map ( ) const
inline

Forward to Tree::parent_is_map().

Node must be readable.

Definition at line 255 of file node.hpp.

◆ is_key_anchor()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_key_anchor ( ) const
inlinenoexcept

Definition at line 257 of file node.hpp.

257{ _C4RR(); return tree_->has_key_anchor(id_); }
#define _C4RR()
Definition node.hpp:999
bool has_key_anchor() const RYML_NOEXCEPT
Forward to Tree::has_key_anchor().
Definition node.hpp:248

◆ is_val_hanchor()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_val_hanchor ( ) const
inlinenoexcept

Definition at line 258 of file node.hpp.

258{ _C4RR(); return tree_->has_val_anchor(id_); }
bool has_val_anchor() const RYML_NOEXCEPT
Forward to Tree::has_val_anchor().
Definition node.hpp:249

◆ is_anchor()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_anchor ( ) const
inlinenoexcept

Definition at line 259 of file node.hpp.

259{ _C4RR(); return tree_->has_anchor(id_); }
bool has_anchor() const RYML_NOEXCEPT
Forward to Tree::has_anchor().
Definition node.hpp:250

◆ is_anchor_or_ref()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_anchor_or_ref ( ) const
inlinenoexcept

Definition at line 260 of file node.hpp.

260{ _C4RR(); return tree_->is_anchor_or_ref(id_); }
bool is_anchor_or_ref() const noexcept
Definition node.hpp:260

◆ type_has_any()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::type_has_any ( NodeType_e bits) const
inline

Forward to Tree::type_has_any().

Node must be readable.

Definition at line 271 of file node.hpp.

◆ type_has_all()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::type_has_all ( NodeType_e bits) const
inline

Forward to Tree::type_has_all().

Node must be readable.

Definition at line 272 of file node.hpp.

◆ type_has_none()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::type_has_none ( NodeType_e bits) const
inline

Forward to Tree::type_has_none().

Node must be readable.

Definition at line 273 of file node.hpp.

◆ key_style()

template<class Impl, class ConstImpl>
NodeType c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::key_style ( ) const
inline

Forward to Tree::key_style().

Node must be readable.

Definition at line 275 of file node.hpp.

◆ val_style()

template<class Impl, class ConstImpl>
NodeType c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::val_style ( ) const
inline

Forward to Tree::val_style().

Node must be readable.

Definition at line 276 of file node.hpp.

◆ is_container_styled()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_container_styled ( ) const
inline

Forward to Tree::is_container_styled().

Node must be readable.

Definition at line 278 of file node.hpp.

◆ is_block()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_block ( ) const
inline

Forward to Tree::is_block().

Node must be readable.

Definition at line 279 of file node.hpp.

◆ is_flow()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_flow ( ) const
inline

Forward to Tree::is_flow().

Node must be readable.

Definition at line 280 of file node.hpp.

◆ is_flow_sl()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_flow_sl ( ) const
inline

Forward to Tree::is_flow_sl().

Node must be readable.

Definition at line 281 of file node.hpp.

◆ is_flow_ml()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_flow_ml ( ) const
inline

Forward to Tree::is_flow_ml1().

Node must be readable.

Definition at line 283 of file node.hpp.

◆ is_flow_ml1()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_flow_ml1 ( ) const
inline

Forward to Tree::is_flow_ml1().

Node must be readable.

Definition at line 284 of file node.hpp.

◆ is_flow_mln()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_flow_mln ( ) const
inline

Forward to Tree::is_flow_mln().

Node must be readable.

Definition at line 285 of file node.hpp.

◆ is_flow_mlx()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_flow_mlx ( ) const
inline

Forward to Tree::is_flow_mlx().

Node must be readable.

Definition at line 286 of file node.hpp.

◆ has_flow_space()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_flow_space ( ) const
inline

Forward to Tree::has_flow_space().

Node must be readable.

Definition at line 287 of file node.hpp.

◆ is_key_styled()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_key_styled ( ) const
inline

Forward to Tree::is_key_styled().

Node must be readable.

Definition at line 289 of file node.hpp.

◆ is_val_styled()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_val_styled ( ) const
inline

Forward to Tree::is_val_styled().

Node must be readable.

Definition at line 290 of file node.hpp.

◆ is_key_literal()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_key_literal ( ) const
inline

Forward to Tree::is_key_literal().

Node must be readable.

Definition at line 291 of file node.hpp.

◆ is_val_literal()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_val_literal ( ) const
inline

Forward to Tree::is_val_literal().

Node must be readable.

Definition at line 292 of file node.hpp.

◆ is_key_folded()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_key_folded ( ) const
inline

Forward to Tree::is_key_folded().

Node must be readable.

Definition at line 293 of file node.hpp.

◆ is_val_folded()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_val_folded ( ) const
inline

Forward to Tree::is_val_folded().

Node must be readable.

Definition at line 294 of file node.hpp.

◆ is_key_squo()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_key_squo ( ) const
inline

Forward to Tree::is_key_squo().

Node must be readable.

Definition at line 295 of file node.hpp.

◆ is_val_squo()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_val_squo ( ) const
inline

Forward to Tree::is_val_squo().

Node must be readable.

Definition at line 296 of file node.hpp.

◆ is_key_dquo()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_key_dquo ( ) const
inline

Forward to Tree::is_key_dquo().

Node must be readable.

Definition at line 297 of file node.hpp.

◆ is_val_dquo()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_val_dquo ( ) const
inline

Forward to Tree::is_val_dquo().

Node must be readable.

Definition at line 298 of file node.hpp.

◆ is_key_plain()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_key_plain ( ) const
inline

Forward to Tree::is_key_plain().

Node must be readable.

Definition at line 299 of file node.hpp.

◆ is_val_plain()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_val_plain ( ) const
inline

Forward to Tree::is_val_plain().

Node must be readable.

Definition at line 300 of file node.hpp.

◆ is_key_quoted()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_key_quoted ( ) const
inline

Forward to Tree::is_key_quoted().

Node must be readable.

Definition at line 301 of file node.hpp.

◆ is_val_quoted()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_val_quoted ( ) const
inline

Forward to Tree::is_val_quoted().

Node must be readable.

Definition at line 302 of file node.hpp.

◆ is_quoted()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_quoted ( ) const
inline

Forward to Tree::is_quoted().

Node must be readable.

Definition at line 303 of file node.hpp.

◆ is_root()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_root ( ) const
inline

Forward to Tree::is_root().

Node must be readable.

Definition at line 314 of file node.hpp.

◆ has_parent()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_parent ( ) const
inline

Forward to Tree::has_parent() Node must be readable.

Definition at line 315 of file node.hpp.

◆ is_ancestor()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::is_ancestor ( ConstImpl const & ancestor) const
inline

Forward to Tree::is_ancestor() Node must be readable.

Definition at line 316 of file node.hpp.

◆ has_child() [1/3]

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_child ( ConstImpl const & n) const
inline

Forward to Tree::has_child().

Node must be readable.

Definition at line 318 of file node.hpp.

◆ has_child() [2/3]

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_child ( id_type node) const
inline

Forward to Tree::has_child().

Node must be readable.

Definition at line 319 of file node.hpp.

◆ has_child() [3/3]

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_child ( csubstr name) const
inline

Forward to Tree::has_child().

Node must be readable.

Definition at line 320 of file node.hpp.

◆ has_children()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_children ( ) const
inline

Forward to Tree::has_children().

Node must be readable.

Definition at line 321 of file node.hpp.

◆ has_sibling() [1/3]

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_sibling ( ConstImpl const & n) const
inline

Forward to Tree::has_sibling().

Node must be readable.

Definition at line 323 of file node.hpp.

◆ has_sibling() [2/3]

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_sibling ( id_type node) const
inline

Forward to Tree::has_sibling().

Node must be readable.

Definition at line 324 of file node.hpp.

◆ has_sibling() [3/3]

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_sibling ( csubstr name) const
inline

Forward to Tree::has_sibling().

Node must be readable.

Definition at line 325 of file node.hpp.

◆ has_other_siblings()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_other_siblings ( ) const
inline

Forward to Tree::has_other_siblings().

Node must be readable.

Definition at line 326 of file node.hpp.

◆ has_siblings()

template<class Impl, class ConstImpl>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::has_siblings ( ) const
inline

Definition at line 328 of file node.hpp.

328{ _C4RR(); return tree_->has_siblings(id_); }
bool has_siblings() const RYML_NOEXCEPT
Definition node.hpp:328

◆ doc() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::doc ( id_type i) ->Impl
inline

Forward to Tree::doc().

Node must be readable.

Definition at line 340 of file node.hpp.

◆ doc() [2/2]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::doc ( id_type i) const
inline

Forward to Tree::doc().

Node must be readable. succeeds even when the node may have invalid or seed id

Definition at line 341 of file node.hpp.

◆ parent() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::parent ( ) ->Impl
inline

Forward to Tree::parent().

Node must be readable.

Definition at line 344 of file node.hpp.

◆ parent() [2/2]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::parent ( ) const
inline

Forward to Tree::parent().

Node must be readable.

Definition at line 345 of file node.hpp.

◆ first_child() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::first_child ( ) ->Impl
inline

Forward to Tree::first_child().

Node must be readable.

Definition at line 348 of file node.hpp.

◆ first_child() [2/2]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::first_child ( ) const
inline

Forward to Tree::first_child().

Node must be readable.

Definition at line 349 of file node.hpp.

◆ last_child() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::last_child ( ) ->Impl
inline

Forward to Tree::last_child().

Node must be readable.

Definition at line 352 of file node.hpp.

◆ last_child() [2/2]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::last_child ( ) const
inline

Forward to Tree::last_child().

Node must be readable.

Definition at line 353 of file node.hpp.

◆ child() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::child ( id_type pos) ->Impl
inline

Forward to Tree::child().

Node must be readable.

Definition at line 356 of file node.hpp.

◆ child() [2/2]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::child ( id_type pos) const
inline

Forward to Tree::child().

Node must be readable.

Definition at line 357 of file node.hpp.

◆ find_child() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::find_child ( csubstr name) ->Impl
inline

Forward to Tree::find_child().

Node must be readable.

Definition at line 360 of file node.hpp.

◆ find_child() [2/2]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::find_child ( csubstr name) const
inline

Forward to Tree::find_child().

Node must be readable.

Definition at line 361 of file node.hpp.

◆ prev_sibling() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::prev_sibling ( ) ->Impl
inline

Forward to Tree::prev_sibling().

Node must be readable.

Definition at line 364 of file node.hpp.

◆ prev_sibling() [2/2]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::prev_sibling ( ) const
inline

Forward to Tree::prev_sibling().

Node must be readable.

Definition at line 365 of file node.hpp.

◆ next_sibling() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::next_sibling ( ) ->Impl
inline

Forward to Tree::next_sibling().

Node must be readable.

Definition at line 368 of file node.hpp.

◆ next_sibling() [2/2]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::next_sibling ( ) const
inline

Forward to Tree::next_sibling().

Node must be readable.

Definition at line 369 of file node.hpp.

◆ first_sibling() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::first_sibling ( ) ->Impl
inline

Forward to Tree::first_sibling().

Node must be readable.

Definition at line 372 of file node.hpp.

◆ first_sibling() [2/2]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::first_sibling ( ) const
inline

Forward to Tree::first_sibling().

Node must be readable.

Definition at line 373 of file node.hpp.

◆ last_sibling() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::last_sibling ( ) ->Impl
inline

Forward to Tree::last_sibling().

Node must be readable.

Definition at line 376 of file node.hpp.

◆ last_sibling() [2/2]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::last_sibling ( ) const
inline

Forward to Tree::last_sibling().

Node must be readable.

Definition at line 377 of file node.hpp.

◆ sibling() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::sibling ( id_type pos) ->Impl
inline

Forward to Tree::sibling().

Node must be readable.

Definition at line 380 of file node.hpp.

◆ sibling() [2/2]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::sibling ( id_type pos) const
inline

Forward to Tree::sibling().

Node must be readable.

Definition at line 381 of file node.hpp.

◆ find_sibling() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::find_sibling ( csubstr name) ->Impl
inline

Forward to Tree::find_sibling().

Node must be readable.

Definition at line 384 of file node.hpp.

◆ find_sibling() [2/2]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::find_sibling ( csubstr name) const
inline

Forward to Tree::find_sibling().

Node must be readable.

Definition at line 385 of file node.hpp.

◆ ancestor_doc() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::ancestor_doc ( ) ->Impl
inline

Forward to Tree::ancestor_doc().

Node must be readable.

Definition at line 388 of file node.hpp.

◆ ancestor_doc() [2/2]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::ancestor_doc ( ) const
inline

Forward to Tree::ancestor_doc().

Node must be readable.

Definition at line 389 of file node.hpp.

◆ num_children()

template<class Impl, class ConstImpl>
id_type c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::num_children ( ) const
inline

O(num_children).

Forward to Tree::num_children().

Definition at line 391 of file node.hpp.

◆ num_siblings()

template<class Impl, class ConstImpl>
id_type c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::num_siblings ( ) const
inline

O(num_children).

Forward to Tree::num_siblings().

Definition at line 392 of file node.hpp.

◆ num_other_siblings()

template<class Impl, class ConstImpl>
id_type c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::num_other_siblings ( ) const
inline

O(num_siblings).

Forward to Tree::num_other_siblings().

Definition at line 393 of file node.hpp.

◆ child_pos()

template<class Impl, class ConstImpl>
id_type c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::child_pos ( ConstImpl const & n) const
inline

O(num_children).

Forward to Tree::child_pos().

Definition at line 394 of file node.hpp.

◆ sibling_pos()

template<class Impl, class ConstImpl>
id_type c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::sibling_pos ( ConstImpl const & n) const
inline

O(num_siblings).

Forward to Tree::sibling_pos().

Definition at line 395 of file node.hpp.

◆ depth_asc()

template<class Impl, class ConstImpl>
id_type c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::depth_asc ( ) const
inline

Definition at line 397 of file node.hpp.

397{ _C4RR(); return tree_->depth_asc(id_); } /** O(log(num_nodes)). Forward to Tree::depth_asc(). Node must be readable. */
id_type depth_asc() const RYML_NOEXCEPT
Definition node.hpp:397

◆ depth_desc()

template<class Impl, class ConstImpl>
id_type c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::depth_desc ( ) const
inline

O(log(num_nodes)).

Forward to Tree::depth_asc(). Node must be readable.

Definition at line 398 of file node.hpp.

398{ _C4RR(); return tree_->depth_desc(id_); } /** O(num_nodes). Forward to Tree::depth_desc(). Node must be readable. */
id_type depth_desc() const RYML_NOEXCEPT
O(log(num_nodes)).
Definition node.hpp:398

◆ operator[]() [1/4]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::operator[] ( csubstr key) ->Impl
inline

Find child by key; complexity is O(num_children).

Returns the requested node, or an object in seed state if no such child is found (see NodeRef for an explanation of what is seed state). When the object is in seed state, using it to read from the tree is UB. The seed node can be used to write to the tree provided that its create() method is called prior to writing, which happens in most modifying methods in NodeRef. It is the caller's responsibility to verify that the returned node is readable before subsequently using it to read from the tree.

Warning
the calling object must be readable. This precondition is asserted. The assertion is performed only if RYML_USE_ASSERT is set to true. As with the non-const overload, it is UB to call this method if the node is not readable.
See also
https://github.com/biojppm/rapidyaml/issues/389

Definition at line 427 of file node.hpp.

428 {
429 _C4RR();
431 return ch != NONE ? Impl(tree__, ch) : Impl(tree__, id__, key);
432 }
auto find_child(csubstr name) RYML_NOEXCEPT -> Impl
Forward to Tree::find_child().
Definition node.hpp:360
csubstr key() const RYML_NOEXCEPT
Forward to Tree::key().
Definition node.hpp:210

◆ operator[]() [2/4]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::operator[] ( id_type pos) ->Impl
inline

Find child by position; complexity is O(pos).

Returns the requested node, or an object in seed state if no such child is found (see NodeRef for an explanation of what is seed state). When the object is in seed state, using it to read from the tree is UB. The seed node can be used to write to the tree provided that its create() method is called prior to writing, which happens in most modifying methods in NodeRef. It is the caller's responsibility to verify that the returned node is readable before subsequently using it to read from the tree.

Warning
the calling object must be readable. This precondition is asserted. The assertion is performed only if RYML_USE_ASSERT is set to true. As with the non-const overload, it is UB to call this method if the node is not readable.
See also
https://github.com/biojppm/rapidyaml/issues/389

Definition at line 453 of file node.hpp.

454 {
455 _C4RR();
457 return ch != NONE ? Impl(tree__, ch) : Impl(tree__, id__, pos);
458 }
auto child(id_type pos) RYML_NOEXCEPT -> Impl
Forward to Tree::child().
Definition node.hpp:356

◆ operator[]() [3/4]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::operator[] ( csubstr key) const
inline

Find a child by key; complexity is O(num_children).

Behaves similar to the non-const overload, but further asserts that the returned node is readable (because it can never be in a seed state). The assertion is performed only if RYML_USE_ASSERT is set to true. As with the non-const overload, it is UB to use the return value if it is not valid.

See also
https://github.com/biojppm/rapidyaml/issues/389

Definition at line 469 of file node.hpp.

470 {
471 _C4RR();
473 _RYML_ASSERT_VISIT_(tree_->m_callbacks, ch != NONE, tree_, id_);
474 return {tree_, ch};
475 }

◆ operator[]() [4/4]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::operator[] ( id_type pos) const
inline

Find a child by position; complexity is O(pos).

Behaves similar to the non-const overload, but further asserts that the returned node is readable (because it can never be in a seed state). This assertion is performed only if RYML_USE_ASSERT is set to true. As with the non-const overload, it is UB to use the return value if it is not valid.

See also
https://github.com/biojppm/rapidyaml/issues/389

Definition at line 486 of file node.hpp.

487 {
488 _C4RR();
490 _RYML_ASSERT_VISIT_(tree_->m_callbacks, ch != NONE, tree_, id_);
491 return {tree_, ch};
492 }

◆ at() [1/4]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::at ( csubstr key) ->Impl
inline

Find child by key; complexity is O(num_children).

Returns the requested node, or an object in seed state if no such child is found (see NodeRef for an explanation of what is seed state). When the object is in seed state, using it to read from the tree is UB. The seed node can be subsequently used to write to the tree provided that its create() method is called prior to writing, which happens inside most mutating methods in NodeRef. It is the caller's responsibility to verify that the returned node is readable before subsequently using it to read from the tree.

Warning
This method will call the error callback (regardless of build type or of the value of RYML_USE_ASSERT) whenever any of the following preconditions is violated: a) the object is valid (points at a tree and a node), b) the calling object must be readable (must not be in seed state), c) the calling object must be pointing at a MAP node. The preconditions are similar to the non-const operator[](csubstr), but instead of using assertions, this function directly checks those conditions and calls the error callback if any of the checks fail.
Note
since it is valid behavior for the returned node to be in seed state, the error callback is not invoked when this happens.

Definition at line 534 of file node.hpp.

535 {
536 _RYML_CHECK_BASIC(tree_ != nullptr);
537 _RYML_CHECK_VISIT_(tree_->m_callbacks, (id_ >= 0 && id_ < tree_->capacity()), tree_, id_);
538 _RYML_CHECK_VISIT_(tree_->m_callbacks, ((Impl const*)this)->readable(), tree_, id_);
539 _RYML_CHECK_VISIT_(tree_->m_callbacks, tree_->is_map(id_), tree_, id_);
541 return ch != NONE ? Impl(tree__, ch) : Impl(tree__, id__, key);
542 }
bool is_map() const RYML_NOEXCEPT
Forward to Tree::is_map().
Definition node.hpp:240

◆ at() [2/4]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::at ( id_type pos) ->Impl
inline

Find child by position; complexity is O(pos).

Returns the requested node, or an object in seed state if no such child is found (see NodeRef for an explanation of what is seed state). When the object is in seed state, using it to read from the tree is UB. The seed node can be used to write to the tree provided that its create() method is called prior to writing, which happens in most modifying methods in NodeRef. It is the caller's responsibility to verify that the returned node is readable before subsequently using it to read from the tree.

Warning
This method will call the error callback (regardless of build type or of the value of RYML_USE_ASSERT) whenever any of the following preconditions is violated: a) the object is valid (points at a tree and a node), b) the calling object must be readable (must not be in seed state), c) the calling object must be pointing at a MAP node. The preconditions are similar to the non-const operator[](id_type), but instead of using assertions, this function directly checks those conditions and calls the error callback if any of the checks fail.
Note
since it is valid behavior for the returned node to be in seed state, the error callback is not invoked when this happens.

Definition at line 570 of file node.hpp.

571 {
572 _RYML_CHECK_BASIC(tree_ != nullptr);
573 const id_type cap = tree_->capacity();
574 _RYML_CHECK_VISIT_(tree_->m_callbacks, (id_ >= 0 && id_ < cap), tree_, id_);
575 _RYML_CHECK_VISIT_(tree_->m_callbacks, (pos >= 0 && pos < cap), tree_, id_);
576 _RYML_CHECK_VISIT_(tree_->m_callbacks, ((Impl const*)this)->readable(), tree_, id_);
579 return ch != NONE ? Impl(tree__, ch) : Impl(tree__, id__, pos);
580 }
bool is_container() const RYML_NOEXCEPT
Forward to Tree::is_container().
Definition node.hpp:239

◆ at() [3/4]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::at ( csubstr key) const
inline

Get a child by name, with error checking; complexity is O(num_children).

Behaves as operator[](csubstr) const, but always raises an error (even when RYML_USE_ASSERT is set to false) when the returned node does not exist, or when this node is not readable, or when it is not a map. This behaviour is similar to std::vector::at(), but the error consists in calling the error callback instead of directly raising an exception.

Definition at line 591 of file node.hpp.

592 {
593 _RYML_CHECK_BASIC(tree_ != nullptr);
594 _RYML_CHECK_VISIT_(tree_->m_callbacks, (id_ >= 0 && id_ < tree_->capacity()), tree_, id_);
595 _RYML_CHECK_VISIT_(tree_->m_callbacks, ((Impl const*)this)->readable(), tree_, id_);
596 _RYML_CHECK_VISIT_(tree_->m_callbacks, tree_->is_map(id_), tree_, id_);
598 _RYML_CHECK_VISIT_(tree_->m_callbacks, ch != NONE, tree_, id_);
599 return {tree_, ch};
600 }

◆ at() [4/4]

template<class Impl, class ConstImpl>
ConstImpl c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::at ( id_type pos) const
inline

Get a child by position, with error checking; complexity is O(pos).

Behaves as operator[](id_type) const, but always raises an error (even when RYML_USE_ASSERT is set to false) when the returned node does not exist, or when this node is not readable, or when it is not a container. This behaviour is similar to std::vector::at(), but the error consists in calling the error callback instead of directly raising an exception.

Definition at line 611 of file node.hpp.

612 {
613 _RYML_CHECK_BASIC(tree_ != nullptr);
614 const id_type cap = tree_->capacity();
615 _RYML_CHECK_VISIT_(tree_->m_callbacks, (id_ >= 0 && id_ < cap), tree_, id_);
616 _RYML_CHECK_VISIT_(tree_->m_callbacks, (pos >= 0 && pos < cap), tree_, id_);
617 _RYML_CHECK_VISIT_(tree_->m_callbacks, ((Impl const*)this)->readable(), tree_, id_);
619 const id_type ch = tree_->child(id_, pos);
620 _RYML_CHECK_VISIT_(tree_->m_callbacks, ch != NONE, tree_, id_);
621 return {tree_, ch};
622 }

◆ location()

template<class Impl, class ConstImpl>
Location c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::location ( Parser const & parser) const
inline

Definition at line 631 of file node.hpp.

632 {
633 _C4RR();
634 return tree_->location(parser, id_);
635 }
Location location(Parser const &parser) const
Definition node.hpp:631

◆ operator>>() [1/3]

template<class Impl, class ConstImpl>
template<class T>
ConstImpl const & c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::operator>> ( T & v) const
inline

deserialize the node's val to the given variable, forwarding to the user-overrideable read() function.

Definition at line 647 of file node.hpp.

648 {
649 _C4RR();
650 if( ! read((ConstImpl const&)*this, &v))
651 _RYML_ERR_VISIT_(tree_->m_callbacks, tree_, id_, "could not deserialize value");
652 return *((ConstImpl const*)this);
653 }
bool read(ConstNodeRef const &n, T *v)
Definition node.hpp:1594

◆ operator>>() [2/3]

template<class Impl, class ConstImpl>
template<class T>
ConstImpl const & c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::operator>> ( T const & wrapper) const
inline

Definition at line 655 of file node.hpp.

656 {
657 _C4RR();
658 if( ! read((ConstImpl const&)*this, wrapper))
659 _RYML_ERR_VISIT_(tree_->m_callbacks, tree_, id_, "could not deserialize value");
660 return *((ConstImpl const*)this);
661 }

◆ operator>>() [3/3]

template<class Impl, class ConstImpl>
template<class T>
ConstImpl const & c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::operator>> ( Key< T > v) const
inline

deserialize the node's key to the given variable, forwarding to the user-overrideable read() function; use key() to disambiguate; for example: node >> ryml::key(var)

Definition at line 667 of file node.hpp.

668 {
669 _C4RR();
670 if( ! readkey((ConstImpl const&)*this, &v.k))
671 _RYML_ERR_VISIT_(tree_->m_callbacks, tree_, id_, "could not deserialize key");
672 return *((ConstImpl const*)this);
673 }
bool readkey(ConstNodeRef const &n, T *v)
Definition node.hpp:1616

◆ get_if() [1/2]

template<class Impl, class ConstImpl>
template<class T>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::get_if ( csubstr name,
T * var ) const
inline

look for a child by name, if it exists assign to var.

return true if the child existed.

Definition at line 678 of file node.hpp.

679 {
680 _C4RR();
682 if(!ch.readable())
683 return false;
684 ch >> *var;
685 return true;
686 }

◆ get_if() [2/2]

template<class Impl, class ConstImpl>
template<class T>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::get_if ( csubstr name,
T * var,
T const & fallback ) const
inline

look for a child by name, if it exists assign to var, otherwise default to fallback.

return true if the child existed.

Definition at line 692 of file node.hpp.

693 {
694 _C4RR();
696 if(ch.readable())
697 {
698 ch >> *var;
699 return true;
700 }
701 else
702 {
703 *var = fallback;
704 return false;
705 }
706 }

◆ begin() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::begin ( ) ->iterator
inline

get a mutable iterator to the first child.

NOT AVAILABLE for ConstNodeRef.

Definition at line 731 of file node.hpp.

◆ begin() [2/2]

template<class Impl, class ConstImpl>
const_iterator c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::begin ( ) const
inline

get an iterator to the first child

Definition at line 732 of file node.hpp.

◆ cbegin()

template<class Impl, class ConstImpl>
const_iterator c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::cbegin ( ) const
inline

get an iterator to the first child

Definition at line 733 of file node.hpp.

◆ end() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::end ( ) ->iterator
inline

get an iterator to after the last child.

NOT AVAILABLE for ConstNodeRef.

Definition at line 736 of file node.hpp.

◆ end() [2/2]

template<class Impl, class ConstImpl>
const_iterator c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::end ( ) const
inline

get an iterator to after the last child

get an iterator to after the last child

Definition at line 738 of file node.hpp.

◆ cend()

template<class Impl, class ConstImpl>
const_iterator c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::cend ( ) const
inline

get an iterator to after the last child

get an iterator to after the last child

Definition at line 740 of file node.hpp.

◆ children() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::children ( ) ->children_view
inline

get an iterable view over children.

NOT AVAILABLE for ConstNodeRef.

Definition at line 743 of file node.hpp.

◆ children() [2/2]

template<class Impl, class ConstImpl>
const_children_view c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::children ( ) const
inline

get an iterable view over children

Definition at line 744 of file node.hpp.

◆ cchildren()

template<class Impl, class ConstImpl>
const_children_view c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::cchildren ( ) const
inline

get an iterable view over children

Definition at line 745 of file node.hpp.

◆ siblings() [1/2]

template<class Impl, class ConstImpl>
template<class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::siblings ( ) ->children_view
inline

get an iterable view over all siblings (including the calling node)

Definition at line 749 of file node.hpp.

750 {
751 _C4RR();
752 NodeData const *nd = tree__->get(id__);
753 return (nd->m_parent != NONE) ? // does it have a parent?
755 :
756 children_view(end(), end());
757 }
id_type m_first_child
Definition tree.hpp:237
detail::child_iterator< Impl > iterator
Definition node.hpp:725
auto end() RYML_NOEXCEPT -> iterator
get an iterator to after the last child.
Definition node.hpp:736
detail::children_view_< Impl > children_view
Definition node.hpp:727

◆ siblings() [2/2]

template<class Impl, class ConstImpl>
const_children_view c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::siblings ( ) const
inline

get an iterable view over all siblings (including the calling node)

Definition at line 759 of file node.hpp.

760 {
761 _C4RR();
762 NodeData const *nd = tree_->get(id_);
763 return (nd->m_parent != NONE) ? // does it have a parent?
765 :
767 }
detail::children_view_< ConstImpl > const_children_view
Definition node.hpp:728
detail::child_iterator< ConstImpl > const_iterator
Definition node.hpp:726

◆ csiblings()

template<class Impl, class ConstImpl>
const_children_view c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::csiblings ( ) const
inline

get an iterable view over all siblings (including the calling node)

Definition at line 769 of file node.hpp.

769{ return siblings(); }
const_children_view siblings() const RYML_NOEXCEPT
get an iterable view over all siblings (including the calling node)
Definition node.hpp:759

◆ visit() [1/2]

template<class Impl, class ConstImpl>
template<class Visitor>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::visit ( Visitor fn,
id_type indentation_level = 0,
bool skip_root = true ) const
inline

visit every child node calling fn(node)

Definition at line 773 of file node.hpp.

774 {
775 _C4RR();
776 return detail::_visit(*(ConstImpl const*)this, fn, indentation_level, skip_root);
777 }

◆ visit() [2/2]

template<class Impl, class ConstImpl>
template<class Visitor, class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::visit ( Visitor fn,
id_type indentation_level = 0,
bool skip_root = true )->bool
inline

visit every child node calling fn(node)

Definition at line 780 of file node.hpp.

782 {
783 _C4RR();
785 }

◆ visit_stacked() [1/2]

template<class Impl, class ConstImpl>
template<class Visitor>
bool c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::visit_stacked ( Visitor fn,
id_type indentation_level = 0,
bool skip_root = true ) const
inline

visit every child node calling fn(node, level)

Definition at line 789 of file node.hpp.

790 {
791 _C4RR();
793 }

◆ visit_stacked() [2/2]

template<class Impl, class ConstImpl>
template<class Visitor, class U = Impl>
auto c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::visit_stacked ( Visitor fn,
id_type indentation_level = 0,
bool skip_root = true )->bool
inline

visit every child node calling fn(node, level)

Definition at line 796 of file node.hpp.

798 {
799 _C4RR();
801 }

The documentation for this struct was generated from the following file:
  • /home/docs/checkouts/readthedocs.org/user_builds/rapidyaml/checkouts/v0.15.1/src/c4/yml/node.hpp