rapidyaml  0.9.0
parse and emit YAML, and do it fast
c4::yml::NodeRef Class Reference

A reference to a node in an existing yaml tree, offering a more convenient API than the index-based API used in the tree. More...

#include <node.hpp>

Inheritance diagram for c4::yml::NodeRef:
c4::yml::detail::RoNodeMethods< NodeRef, ConstNodeRef >

Public Types

using tree_type = Tree
 
using base_type = detail::RoNodeMethods< NodeRef, ConstNodeRef >
 

Public Member Functions

construction
 NodeRef () noexcept
 
 NodeRef (Tree &t) noexcept
 
 NodeRef (Tree *t) noexcept
 
 NodeRef (Tree *t, id_type id) noexcept
 
 NodeRef (Tree *t, id_type id, id_type seed_pos) noexcept
 
 NodeRef (Tree *t, id_type id, csubstr seed_key) noexcept
 
 NodeRef (std::nullptr_t) noexcept
 
void _clear_seed () noexcept
 
assignment
 NodeRef (NodeRef const &) noexcept=default
 
 NodeRef (NodeRef &&) noexcept=default
 
NodeRefoperator= (NodeRef const &) noexcept=default
 
NodeRefoperator= (NodeRef &&) noexcept=default
 
state_queries
bool invalid () const noexcept
 true if the object is not referring to any existing or seed node. More...
 
bool is_seed () const noexcept
 true if the object is not invalid and in seed state. More...
 
bool readable () const noexcept
 true if the object is not invalid and not in seed state. More...
 
bool valid () const
 
comparisons
bool operator== (NodeRef const &that) const
 
bool operator!= (NodeRef const &that) const
 
bool operator== (ConstNodeRef const &that) const
 
bool operator!= (ConstNodeRef const &that) const
 
node_property_getters
Treetree () noexcept
 
Tree const * tree () const noexcept
 
id_type id () const noexcept
 
node_modifiers
void create ()
 
void change_type (NodeType t)
 
void set_type (NodeType t)
 
void set_key (csubstr key)
 
void set_val (csubstr val)
 
void set_key_tag (csubstr key_tag)
 
void set_val_tag (csubstr val_tag)
 
void set_key_anchor (csubstr key_anchor)
 
void set_val_anchor (csubstr val_anchor)
 
void set_key_ref (csubstr key_ref)
 
void set_val_ref (csubstr val_ref)
 
void set_container_style (NodeType_e style)
 
void set_key_style (NodeType_e style)
 
void set_val_style (NodeType_e style)
 
void clear ()
 
void clear_key ()
 
void clear_val ()
 
void clear_children ()
 
void operator= (NodeType_e t)
 
void operator|= (NodeType_e t)
 
void operator= (NodeInit const &v)
 
void operator= (NodeScalar const &v)
 
void operator= (std::nullptr_t)
 
void operator= (csubstr v)
 
template<size_t N>
void operator= (const char(&v)[N])
 
serialization
template<class T >
csubstr to_arena (T const &s)
 serialize a variable to the arena More...
 
template<class T >
size_t set_key_serialized (T const &k)
 
size_t set_key_serialized (std::nullptr_t)
 
template<class T >
size_t set_val_serialized (T const &v)
 
size_t set_val_serialized (std::nullptr_t)
 
size_t set_key_serialized (fmt::const_base64_wrapper w)
 encode a blob as base64 into the tree's arena, then assign the result to the node's key More...
 
size_t set_val_serialized (fmt::const_base64_wrapper w)
 encode a blob as base64 into the tree's arena, then assign the result to the node's val More...
 
NodeRefoperator<< (csubstr s)
 serialize a variable, then assign the result to the node's val More...
 
template<class T >
NodeRefoperator<< (T const &v)
 
template<class T >
NodeRefoperator<< (Key< const T > const &v)
 serialize a variable, then assign the result to the node's key More...
 
template<class T >
NodeRefoperator<< (Key< T > const &v)
 serialize a variable, then assign the result to the node's key More...
 
NodeRefoperator<< (Key< fmt::const_base64_wrapper > w)
 
NodeRefoperator<< (fmt::const_base64_wrapper w)
 
modification of hierarchy
NodeRef insert_child (NodeRef after)
 
NodeRef insert_child (NodeInit const &i, NodeRef after)
 
NodeRef prepend_child ()
 
NodeRef prepend_child (NodeInit const &i)
 
NodeRef append_child ()
 
NodeRef append_child (NodeInit const &i)
 
NodeRef insert_sibling (ConstNodeRef const &after)
 
NodeRef insert_sibling (NodeInit const &i, ConstNodeRef const &after)
 
NodeRef prepend_sibling ()
 
NodeRef prepend_sibling (NodeInit const &i)
 
NodeRef append_sibling ()
 
NodeRef append_sibling (NodeInit const &i)
 
void remove_child (NodeRef &child)
 
void remove_child (id_type pos)
 remove the nth child of this node More...
 
void remove_child (csubstr key)
 remove a child by name More...
 
void move (ConstNodeRef const &after)
 change the node's position within its parent, placing it after after. More...
 
void move (NodeRef const &parent, ConstNodeRef const &after)
 move the node to a different parent (which may belong to a different tree), placing it after after. More...
 
NodeRef duplicate (ConstNodeRef const &after) const
 duplicate the current node somewhere within its parent, and place it after the node after. More...
 
NodeRef duplicate (NodeRef const &parent, ConstNodeRef const &after) const
 duplicate the current node somewhere into a different parent (possibly from a different tree), and place it after the node after. More...
 
void duplicate_children (NodeRef const &parent, ConstNodeRef const &after) const
 
node property getters
NodeData const * get () const RYML_NOEXCEPT
 returns the data or null when the id is NONE More...
 
auto get () RYML_NOEXCEPT -> NodeData *
 returns the data or null when the id is NONE More...
 
NodeType type () const RYML_NOEXCEPT
 Forward to Tree::type_str(). More...
 
const char * type_str () const RYML_NOEXCEPT
 Forward to Tree::type_str(). More...
 
csubstr key () const RYML_NOEXCEPT
 Forward to Tree::key(). More...
 
csubstr key_tag () const RYML_NOEXCEPT
 Forward to Tree::key_tag(). More...
 
csubstr key_ref () const RYML_NOEXCEPT
 Forward to Tree::key_ref(). More...
 
csubstr key_anchor () const RYML_NOEXCEPT
 Forward to Tree::key_anchor(). More...
 
csubstr val () const RYML_NOEXCEPT
 Forward to Tree::val(). More...
 
csubstr val_tag () const RYML_NOEXCEPT
 Forward to Tree::val_tag(). More...
 
csubstr val_ref () const RYML_NOEXCEPT
 Forward to Tree::val_ref(). More...
 
csubstr val_anchor () const RYML_NOEXCEPT
 Forward to Tree::val_anchor(). More...
 
NodeScalar const & keysc () const RYML_NOEXCEPT
 Forward to Tree::keysc(). More...
 
NodeScalar const & valsc () const RYML_NOEXCEPT
 Forward to Tree::valsc(). More...
 
bool key_is_null () const RYML_NOEXCEPT
 Forward to Tree::key_is_null(). More...
 
bool val_is_null () const RYML_NOEXCEPT
 Forward to Tree::val_is_null(). More...
 
bool is_key_unfiltered () const noexcept
 Forward to Tree::is_key_unfiltered(). More...
 
bool is_val_unfiltered () const noexcept
 Forward to Tree::is_val_unfiltered(). More...
 
node type predicates
bool empty () const RYML_NOEXCEPT
 Forward to Tree::empty(). More...
 
bool is_stream () const RYML_NOEXCEPT
 Forward to Tree::is_stream(). More...
 
bool is_doc () const RYML_NOEXCEPT
 Forward to Tree::is_doc(). More...
 
bool is_container () const RYML_NOEXCEPT
 Forward to Tree::is_container(). More...
 
bool is_map () const RYML_NOEXCEPT
 Forward to Tree::is_map(). More...
 
bool is_seq () const RYML_NOEXCEPT
 Forward to Tree::is_seq(). More...
 
bool has_val () const RYML_NOEXCEPT
 Forward to Tree::has_val(). More...
 
bool has_key () const RYML_NOEXCEPT
 Forward to Tree::has_key(). More...
 
bool is_val () const RYML_NOEXCEPT
 Forward to Tree::is_val(). More...
 
bool is_keyval () const RYML_NOEXCEPT
 Forward to Tree::is_keyval(). More...
 
bool has_key_tag () const RYML_NOEXCEPT
 Forward to Tree::has_key_tag(). More...
 
bool has_val_tag () const RYML_NOEXCEPT
 Forward to Tree::has_val_tag(). More...
 
bool has_key_anchor () const RYML_NOEXCEPT
 Forward to Tree::has_key_anchor(). More...
 
bool has_val_anchor () const RYML_NOEXCEPT
 Forward to Tree::has_val_anchor(). More...
 
bool has_anchor () const RYML_NOEXCEPT
 Forward to Tree::has_anchor(). More...
 
bool is_key_ref () const RYML_NOEXCEPT
 Forward to Tree::is_key_ref(). More...
 
bool is_val_ref () const RYML_NOEXCEPT
 Forward to Tree::is_val_ref(). More...
 
bool is_ref () const RYML_NOEXCEPT
 Forward to Tree::is_ref(). More...
 
bool parent_is_seq () const RYML_NOEXCEPT
 Forward to Tree::parent_is_seq(). More...
 
bool parent_is_map () const RYML_NOEXCEPT
 Forward to Tree::parent_is_map(). More...
 
bool is_key_anchor () const noexcept
 
bool is_val_hanchor () const noexcept
 
bool is_anchor () const noexcept
 
bool is_anchor_or_ref () const noexcept
 
node container+scalar style predicates
bool type_has_any (NodeType_e bits) const RYML_NOEXCEPT
 Forward to Tree::type_has_any(). More...
 
bool type_has_all (NodeType_e bits) const RYML_NOEXCEPT
 Forward to Tree::type_has_all(). More...
 
bool type_has_none (NodeType_e bits) const RYML_NOEXCEPT
 Forward to Tree::type_has_none(). More...
 
bool is_container_styled () const RYML_NOEXCEPT
 Forward to Tree::is_container_styled(). More...
 
bool is_block () const RYML_NOEXCEPT
 Forward to Tree::is_block(). More...
 
bool is_flow_sl () const RYML_NOEXCEPT
 Forward to Tree::is_flow_sl(). More...
 
bool is_flow_ml () const RYML_NOEXCEPT
 Forward to Tree::is_flow_ml(). More...
 
bool is_flow () const RYML_NOEXCEPT
 Forward to Tree::is_flow(). More...
 
bool is_key_styled () const RYML_NOEXCEPT
 Forward to Tree::is_key_styled(). More...
 
bool is_val_styled () const RYML_NOEXCEPT
 Forward to Tree::is_val_styled(). More...
 
bool is_key_literal () const RYML_NOEXCEPT
 Forward to Tree::is_key_literal(). More...
 
bool is_val_literal () const RYML_NOEXCEPT
 Forward to Tree::is_val_literal(). More...
 
bool is_key_folded () const RYML_NOEXCEPT
 Forward to Tree::is_key_folded(). More...
 
bool is_val_folded () const RYML_NOEXCEPT
 Forward to Tree::is_val_folded(). More...
 
bool is_key_squo () const RYML_NOEXCEPT
 Forward to Tree::is_key_squo(). More...
 
bool is_val_squo () const RYML_NOEXCEPT
 Forward to Tree::is_val_squo(). More...
 
bool is_key_dquo () const RYML_NOEXCEPT
 Forward to Tree::is_key_dquo(). More...
 
bool is_val_dquo () const RYML_NOEXCEPT
 Forward to Tree::is_val_dquo(). More...
 
bool is_key_plain () const RYML_NOEXCEPT
 Forward to Tree::is_key_plain(). More...
 
bool is_val_plain () const RYML_NOEXCEPT
 Forward to Tree::is_val_plain(). More...
 
bool is_key_quoted () const RYML_NOEXCEPT
 Forward to Tree::is_key_quoted(). More...
 
bool is_val_quoted () const RYML_NOEXCEPT
 Forward to Tree::is_val_quoted(). More...
 
bool is_quoted () const RYML_NOEXCEPT
 Forward to Tree::is_quoted(). More...
 
hierarchy predicates
bool is_root () const RYML_NOEXCEPT
 Forward to Tree::is_root(). More...
 
bool has_parent () const RYML_NOEXCEPT
 Forward to Tree::has_parent() Node must be readable. More...
 
bool is_ancestor (ConstNodeRef const &ancestor) const RYML_NOEXCEPT
 Forward to Tree::is_ancestor() Node must be readable. More...
 
bool has_child (ConstNodeRef const &n) const RYML_NOEXCEPT
 Forward to Tree::has_child(). More...
 
bool has_child (id_type node) const RYML_NOEXCEPT
 Forward to Tree::has_child(). More...
 
bool has_child (csubstr name) const RYML_NOEXCEPT
 Forward to Tree::has_child(). More...
 
bool has_children () const RYML_NOEXCEPT
 Forward to Tree::has_child(). More...
 
bool has_sibling (ConstNodeRef const &n) const RYML_NOEXCEPT
 Forward to Tree::has_sibling(). More...
 
bool has_sibling (id_type node) const RYML_NOEXCEPT
 Forward to Tree::has_sibling(). More...
 
bool has_sibling (csubstr name) const RYML_NOEXCEPT
 Forward to Tree::has_sibling(). More...
 
bool has_other_siblings () const RYML_NOEXCEPT
 Forward to Tree::has_sibling(). More...
 
bool has_siblings () const RYML_NOEXCEPT
 
hierarchy getters
auto doc (id_type i) RYML_NOEXCEPT -> NodeRef
 Forward to Tree::doc(). More...
 
ConstNodeRef doc (id_type i) const RYML_NOEXCEPT
 Forward to Tree::doc(). More...
 
auto parent () RYML_NOEXCEPT -> NodeRef
 Forward to Tree::parent(). More...
 
ConstNodeRef parent () const RYML_NOEXCEPT
 Forward to Tree::parent(). More...
 
auto first_child () RYML_NOEXCEPT -> NodeRef
 Forward to Tree::first_child(). More...
 
ConstNodeRef first_child () const RYML_NOEXCEPT
 Forward to Tree::first_child(). More...
 
auto last_child () RYML_NOEXCEPT -> NodeRef
 Forward to Tree::last_child(). More...
 
ConstNodeRef last_child () const RYML_NOEXCEPT
 Forward to Tree::last_child(). More...
 
auto child (id_type pos) RYML_NOEXCEPT -> NodeRef
 Forward to Tree::child(). More...
 
ConstNodeRef child (id_type pos) const RYML_NOEXCEPT
 Forward to Tree::child(). More...
 
auto find_child (csubstr name) RYML_NOEXCEPT -> NodeRef
 Forward to Tree::first_child(). More...
 
ConstNodeRef find_child (csubstr name) const RYML_NOEXCEPT
 Forward to Tree::first_child(). More...
 
auto prev_sibling () RYML_NOEXCEPT -> NodeRef
 Forward to Tree::prev_sibling(). More...
 
ConstNodeRef prev_sibling () const RYML_NOEXCEPT
 Forward to Tree::prev_sibling(). More...
 
auto next_sibling () RYML_NOEXCEPT -> NodeRef
 Forward to Tree::next_sibling(). More...
 
ConstNodeRef next_sibling () const RYML_NOEXCEPT
 Forward to Tree::next_sibling(). More...
 
auto first_sibling () RYML_NOEXCEPT -> NodeRef
 Forward to Tree::first_sibling(). More...
 
ConstNodeRef first_sibling () const RYML_NOEXCEPT
 Forward to Tree::first_sibling(). More...
 
auto last_sibling () RYML_NOEXCEPT -> NodeRef
 Forward to Tree::last_sibling(). More...
 
ConstNodeRef last_sibling () const RYML_NOEXCEPT
 Forward to Tree::last_sibling(). More...
 
auto sibling (id_type pos) RYML_NOEXCEPT -> NodeRef
 Forward to Tree::sibling(). More...
 
ConstNodeRef sibling (id_type pos) const RYML_NOEXCEPT
 Forward to Tree::sibling(). More...
 
auto find_sibling (csubstr name) RYML_NOEXCEPT -> NodeRef
 Forward to Tree::find_sibling(). More...
 
ConstNodeRef find_sibling (csubstr name) const RYML_NOEXCEPT
 Forward to Tree::find_sibling(). More...
 
id_type num_children () const RYML_NOEXCEPT
 O(num_children). More...
 
id_type num_siblings () const RYML_NOEXCEPT
 O(num_children). More...
 
id_type num_other_siblings () const RYML_NOEXCEPT
 O(num_siblings). More...
 
id_type child_pos (ConstNodeRef const &n) const RYML_NOEXCEPT
 O(num_children). More...
 
id_type sibling_pos (ConstNodeRef const &n) const RYML_NOEXCEPT
 O(num_siblings). More...
 
id_type depth_asc () const RYML_NOEXCEPT
 
id_type depth_desc () const RYML_NOEXCEPT
 O(log(num_nodes)). More...
 
square_brackets

O(num_nodes).

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

operator[]

auto operator[] (csubstr key) RYML_NOEXCEPT -> NodeRef
 Find child by key; complexity is O(num_children). More...
 
auto operator[] (id_type pos) RYML_NOEXCEPT -> NodeRef
 Find child by position; complexity is O(pos). More...
 
ConstNodeRef operator[] (csubstr key) const RYML_NOEXCEPT
 Find a child by key; complexity is O(num_children). More...
 
ConstNodeRef operator[] (id_type pos) const RYML_NOEXCEPT
 Find a child by position; complexity is O(pos). More...
 
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).

auto at (csubstr key) -> NodeRef
 Find child by key; complexity is O(num_children). More...
 
auto at (id_type pos) -> NodeRef
 Find child by position; complexity is O(pos). More...
 
ConstNodeRef at (csubstr key) const
 Get a child by name, with error checking; complexity is O(num_children). More...
 
ConstNodeRef at (id_type pos) const
 Get a child by position, with error checking; complexity is O(pos). More...
 
deserialization
ConstNodeRef const & operator>> (T &v) const
 deserialize the node's val to the given variable, forwarding to the user-overrideable read() function. More...
 
ConstNodeRef 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) More...
 
bool get_if (csubstr name, T *var) const
 look for a child by name, if it exists assign to var. More...
 
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. More...
 
deserialization_base64
ConstNodeRef const & operator>> (Key< fmt::base64_wrapper > w) const
 deserialize the node's key as base64. More...
 
ConstNodeRef const & operator>> (fmt::base64_wrapper w) const
 deserialize the node's val as base64. More...
 
size_t deserialize_key (fmt::base64_wrapper v) const
 decode the base64-encoded key and assign the decoded blob to the given buffer/ More...
 
size_t deserialize_val (fmt::base64_wrapper v) const
 decode the base64-encoded key and assign the decoded blob to the given buffer/ More...
 

Friends

struct detail::RoNodeMethods< NodeRef, ConstNodeRef >
 

iteration

using iterator = detail::child_iterator< NodeRef >
 
using const_iterator = detail::child_iterator< ConstNodeRef >
 
using children_view = detail::children_view_< NodeRef >
 
using const_children_view = detail::children_view_< ConstNodeRef >
 
auto begin () RYML_NOEXCEPT -> iterator
 get an iterator to the first child More...
 
const_iterator begin () const RYML_NOEXCEPT
 get an iterator to the first child More...
 
const_iterator cbegin () const RYML_NOEXCEPT
 get an iterator to the first child More...
 
auto end () RYML_NOEXCEPT -> iterator
 get an iterator to after the last child More...
 
const_iterator end () const RYML_NOEXCEPT
 get an iterator to after the last child More...
 
const_iterator cend () const RYML_NOEXCEPT
 get an iterator to after the last child More...
 
auto children () RYML_NOEXCEPT -> children_view
 get an iterable view over children More...
 
const_children_view children () const RYML_NOEXCEPT
 get an iterable view over children More...
 
const_children_view cchildren () const RYML_NOEXCEPT
 get an iterable view over children More...
 
auto siblings () RYML_NOEXCEPT -> children_view
 get an iterable view over all siblings (including the calling node) More...
 
const_children_view siblings () const RYML_NOEXCEPT
 get an iterable view over all siblings (including the calling node) More...
 
const_children_view csiblings () const RYML_NOEXCEPT
 get an iterable view over all siblings (including the calling node) More...
 
bool visit (Visitor fn, id_type indentation_level=0, bool skip_root=true) const RYML_NOEXCEPT
 visit every child node calling fn(node) More...
 
auto visit (Visitor fn, id_type indentation_level=0, bool skip_root=true) RYML_NOEXCEPT -> bool
 visit every child node calling fn(node) More...
 
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) More...
 
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) More...
 

Detailed Description

A reference to a node in an existing yaml tree, offering a more convenient API than the index-based API used in the tree.

Unlike its imutable ConstNodeRef peer, a NodeRef can be used to mutate the tree, both by writing to existing nodes and by creating new nodes to subsequently write to. Semantically, a NodeRef object can be in one of three states:

invalid := not pointing at anything
readable := points at an existing tree/node
seed := points at an existing tree, and the node
may come to exist, if we write to it.

So both readable and seed are states where the node is also valid.

Tree t = parse_in_arena("{a: b}");
NodeRef invalid; // not pointing at anything.
NodeRef readable = t["a"]; // also valid, because "a" exists
NodeRef seed = t["none"]; // also valid, but is seed because "none" is not in the map
NodeRef() noexcept
Definition: node.hpp:1020
bool invalid() const noexcept
true if the object is not referring to any existing or seed node.
Definition: node.hpp:1051
bool readable() const noexcept
true if the object is not invalid and not in seed state.
Definition: node.hpp:1055
void parse_in_arena(Parser *parser, csubstr filename, csubstr yaml, Tree *t, id_type node_id)
(1) parse YAML into an existing tree node. The filename will be used in any error messages arising du...
Definition: parse.cpp:91

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 owners's responsibility to verify that an existing node is readable before subsequently using it to read from the tree.

Warning
The lifetime of the tree must be larger than that of this object. It is up to the user to ensure that this happens.

Definition at line 979 of file node.hpp.

Member Typedef Documentation

◆ tree_type

Definition at line 983 of file node.hpp.

◆ base_type

◆ iterator

using c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::iterator = detail::child_iterator<NodeRef >
inherited

Definition at line 725 of file node.hpp.

◆ const_iterator

using c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::const_iterator = detail::child_iterator<ConstNodeRef >
inherited

Definition at line 726 of file node.hpp.

◆ children_view

using c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::children_view = detail::children_view_<NodeRef >
inherited

Definition at line 727 of file node.hpp.

◆ const_children_view

using c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::const_children_view = detail::children_view_<ConstNodeRef >
inherited

Definition at line 728 of file node.hpp.

Constructor & Destructor Documentation

◆ NodeRef() [1/9]

c4::yml::NodeRef::NodeRef ( )
inlinenoexcept

Definition at line 1020 of file node.hpp.

1020 : m_tree(nullptr), m_id(NONE), m_seed() { _clear_seed(); }
void _clear_seed() noexcept
Definition: node.hpp:1028
@ NONE
an index to none
Definition: common.hpp:260

◆ NodeRef() [2/9]

c4::yml::NodeRef::NodeRef ( Tree t)
inlinenoexcept

Definition at line 1021 of file node.hpp.

1021 : m_tree(&t), m_id(t .root_id()), m_seed() { _clear_seed(); }

◆ NodeRef() [3/9]

c4::yml::NodeRef::NodeRef ( Tree t)
inlinenoexcept

Definition at line 1022 of file node.hpp.

1022 : m_tree(t ), m_id(t->root_id()), m_seed() { _clear_seed(); }

◆ NodeRef() [4/9]

c4::yml::NodeRef::NodeRef ( Tree t,
id_type  id 
)
inlinenoexcept

Definition at line 1023 of file node.hpp.

1023 : m_tree(t), m_id(id), m_seed() { _clear_seed(); }

◆ NodeRef() [5/9]

c4::yml::NodeRef::NodeRef ( Tree t,
id_type  id,
id_type  seed_pos 
)
inlinenoexcept

Definition at line 1024 of file node.hpp.

1024 : m_tree(t), m_id(id), m_seed() { m_seed.str = nullptr; m_seed.len = (size_t)seed_pos; }

◆ NodeRef() [6/9]

c4::yml::NodeRef::NodeRef ( Tree t,
id_type  id,
csubstr  seed_key 
)
inlinenoexcept

Definition at line 1025 of file node.hpp.

1025 : m_tree(t), m_id(id), m_seed(seed_key) {}

◆ NodeRef() [7/9]

c4::yml::NodeRef::NodeRef ( std::nullptr_t  )
inlinenoexcept

Definition at line 1026 of file node.hpp.

1026 : m_tree(nullptr), m_id(NONE), m_seed() {}

◆ NodeRef() [8/9]

c4::yml::NodeRef::NodeRef ( NodeRef const &  )
defaultnoexcept

◆ NodeRef() [9/9]

c4::yml::NodeRef::NodeRef ( NodeRef &&  )
defaultnoexcept

Member Function Documentation

◆ _clear_seed()

void c4::yml::NodeRef::_clear_seed ( )
inlinenoexcept

Definition at line 1028 of file node.hpp.

1028 { /*do the following manually or an assert is triggered: */ m_seed.str = nullptr; m_seed.len = npos; }
@ npos
a null string position
Definition: common.hpp:267

References c4::yml::npos.

◆ operator=() [1/8]

NodeRef& c4::yml::NodeRef::operator= ( NodeRef const &  )
defaultnoexcept

◆ operator=() [2/8]

NodeRef& c4::yml::NodeRef::operator= ( NodeRef &&  )
defaultnoexcept

◆ invalid()

bool c4::yml::NodeRef::invalid ( ) const
inlinenoexcept

true if the object is not referring to any existing or seed node.

See also
the doc for NodeRef

Definition at line 1051 of file node.hpp.

1051 { return m_tree == nullptr || m_id == NONE; }

References c4::yml::NONE.

Referenced by c4::yml::parse_in_arena(), c4::yml::parse_in_place(), c4::yml::parse_json_in_arena(), c4::yml::parse_json_in_place(), sample::sample_create_trees(), and sample::sample_quick_overview().

◆ is_seed()

bool c4::yml::NodeRef::is_seed ( ) const
inlinenoexcept

true if the object is not invalid and in seed state.

See also
the doc for NodeRef

Definition at line 1053 of file node.hpp.

1053 { return (m_tree != nullptr && m_id != NONE) && (m_seed.str != nullptr || m_seed.len != (size_t)NONE); }

References c4::yml::NONE.

Referenced by operator==(), sample::sample_create_trees(), and sample::sample_quick_overview().

◆ readable()

bool c4::yml::NodeRef::readable ( ) const
inlinenoexcept

true if the object is not invalid and not in seed state.

See also
the doc for NodeRef

Definition at line 1055 of file node.hpp.

1055 { return (m_tree != nullptr && m_id != NONE) && (m_seed.str == nullptr && m_seed.len == (size_t)NONE); }

References c4::yml::NONE.

Referenced by sample::sample_quick_overview().

◆ valid()

bool c4::yml::NodeRef::valid ( ) const
inline

Definition at line 1057 of file node.hpp.

1057 { return m_tree != nullptr && m_id != NONE; }

References c4::yml::NONE.

◆ operator==() [1/2]

bool c4::yml::NodeRef::operator== ( NodeRef const &  that) const
inline

Definition at line 1066 of file node.hpp.

1067  {
1068  if(m_tree == that.m_tree && m_id == that.m_id)
1069  {
1070  bool seed = is_seed();
1071  if(seed == that.is_seed())
1072  {
1073  if(seed)
1074  {
1075  return (m_seed.len == that.m_seed.len)
1076  && (m_seed.str == that.m_seed.str
1077  || m_seed == that.m_seed); // do strcmp only in the last resort
1078  }
1079  return true;
1080  }
1081  }
1082  return false;
1083  }
bool is_seed() const noexcept
true if the object is not invalid and in seed state.
Definition: node.hpp:1053

References is_seed().

◆ operator!=() [1/2]

bool c4::yml::NodeRef::operator!= ( NodeRef const &  that) const
inline

Definition at line 1084 of file node.hpp.

1084 { return ! this->operator==(that); }
bool operator==(NodeRef const &that) const
Definition: node.hpp:1066

References c4::operator==().

◆ operator==() [2/2]

bool c4::yml::NodeRef::operator== ( ConstNodeRef const &  that) const
inline

Definition at line 1086 of file node.hpp.

1086 { return m_tree == that.m_tree && m_id == that.m_id && !is_seed(); }

References c4::yml::ConstNodeRef::m_id, and c4::yml::ConstNodeRef::m_tree.

◆ operator!=() [2/2]

bool c4::yml::NodeRef::operator!= ( ConstNodeRef const &  that) const
inline

Definition at line 1087 of file node.hpp.

1087 { return ! this->operator==(that); }

References c4::operator==().

◆ tree() [1/2]

Tree* c4::yml::NodeRef::tree ( )
inlinenoexcept

Definition at line 1102 of file node.hpp.

1102 { return m_tree; }

Referenced by c4::yml::parse_in_arena(), c4::yml::parse_in_place(), c4::yml::parse_json_in_arena(), and c4::yml::parse_json_in_place().

◆ tree() [2/2]

Tree const* c4::yml::NodeRef::tree ( ) const
inlinenoexcept

Definition at line 1103 of file node.hpp.

1103 { return m_tree; }

◆ id()

id_type c4::yml::NodeRef::id ( ) const
inlinenoexcept

◆ create()

void c4::yml::NodeRef::create ( )
inline

Definition at line 1114 of file node.hpp.

1114 { _apply_seed(); }

◆ change_type()

void c4::yml::NodeRef::change_type ( NodeType  t)
inline

Definition at line 1116 of file node.hpp.

1116 { _C4RR(); m_tree->change_type(m_id, t); }
bool change_type(id_type node, NodeType type)
change the type of the node to one of MAP, SEQ or VAL.
Definition: tree.cpp:873
#define _C4RR()
Definition: node.hpp:1007

References _C4RR.

◆ set_type()

void c4::yml::NodeRef::set_type ( NodeType  t)
inline

Definition at line 1118 of file node.hpp.

1118 { _apply_seed(); m_tree->_set_flags(m_id, t); }

◆ set_key()

void c4::yml::NodeRef::set_key ( csubstr  key)
inline

Definition at line 1119 of file node.hpp.

1119 { _apply_seed(); m_tree->_set_key(m_id, key); }
csubstr key() const RYML_NOEXCEPT
Forward to Tree::key().
Definition: node.hpp:207

References c4::yml::key().

Referenced by set_key_serialized().

◆ set_val()

void c4::yml::NodeRef::set_val ( csubstr  val)
inline

Definition at line 1120 of file node.hpp.

1120 { _apply_seed(); m_tree->_set_val(m_id, val); }
csubstr val() const RYML_NOEXCEPT
Forward to Tree::val().
Definition: node.hpp:212

Referenced by set_val_serialized().

◆ set_key_tag()

void c4::yml::NodeRef::set_key_tag ( csubstr  key_tag)
inline

Definition at line 1121 of file node.hpp.

1121 { _apply_seed(); m_tree->set_key_tag(m_id, key_tag); }
void set_key_tag(id_type node, csubstr tag)
Definition: tree.hpp:538
csubstr key_tag() const RYML_NOEXCEPT
Forward to Tree::key_tag().
Definition: node.hpp:208

◆ set_val_tag()

void c4::yml::NodeRef::set_val_tag ( csubstr  val_tag)
inline

Definition at line 1122 of file node.hpp.

1122 { _apply_seed(); m_tree->set_val_tag(m_id, val_tag); }
void set_val_tag(id_type node, csubstr tag)
Definition: tree.hpp:539
csubstr val_tag() const RYML_NOEXCEPT
Forward to Tree::val_tag().
Definition: node.hpp:213

◆ set_key_anchor()

void c4::yml::NodeRef::set_key_anchor ( csubstr  key_anchor)
inline

Definition at line 1123 of file node.hpp.

1123 { _apply_seed(); m_tree->set_key_anchor(m_id, key_anchor); }
void set_key_anchor(id_type node, csubstr anchor)
Definition: tree.hpp:541
csubstr key_anchor() const RYML_NOEXCEPT
Forward to Tree::key_anchor().
Definition: node.hpp:210

◆ set_val_anchor()

void c4::yml::NodeRef::set_val_anchor ( csubstr  val_anchor)
inline

Definition at line 1124 of file node.hpp.

1124 { _apply_seed(); m_tree->set_val_anchor(m_id, val_anchor); }
void set_val_anchor(id_type node, csubstr anchor)
Definition: tree.hpp:542
csubstr val_anchor() const RYML_NOEXCEPT
Forward to Tree::val_anchor().
Definition: node.hpp:215

◆ set_key_ref()

void c4::yml::NodeRef::set_key_ref ( csubstr  key_ref)
inline

Definition at line 1125 of file node.hpp.

1125 { _apply_seed(); m_tree->set_key_ref(m_id, key_ref); }
void set_key_ref(id_type node, csubstr ref)
Definition: tree.hpp:543
csubstr key_ref() const RYML_NOEXCEPT
Forward to Tree::key_ref().
Definition: node.hpp:209

◆ set_val_ref()

void c4::yml::NodeRef::set_val_ref ( csubstr  val_ref)
inline

Definition at line 1126 of file node.hpp.

1126 { _apply_seed(); m_tree->set_val_ref(m_id, val_ref); }
void set_val_ref(id_type node, csubstr ref)
Definition: tree.hpp:544
csubstr val_ref() const RYML_NOEXCEPT
Forward to Tree::val_ref().
Definition: node.hpp:214

◆ set_container_style()

void c4::yml::NodeRef::set_container_style ( NodeType_e  style)
inline

Definition at line 1128 of file node.hpp.

1128 { _C4RR(); m_tree->set_container_style(m_id, style); }
void set_container_style(id_type node, NodeType_e style)
Definition: tree.hpp:515

References _C4RR.

◆ set_key_style()

void c4::yml::NodeRef::set_key_style ( NodeType_e  style)
inline

Definition at line 1129 of file node.hpp.

1129 { _C4RR(); m_tree->set_key_style(m_id, style); }
void set_key_style(id_type node, NodeType_e style)
Definition: tree.hpp:516

References _C4RR.

◆ set_val_style()

void c4::yml::NodeRef::set_val_style ( NodeType_e  style)
inline

Definition at line 1130 of file node.hpp.

1130 { _C4RR(); m_tree->set_val_style(m_id, style); }
void set_val_style(id_type node, NodeType_e style)
Definition: tree.hpp:517

References _C4RR.

◆ clear()

void c4::yml::NodeRef::clear ( )
inline

Definition at line 1134 of file node.hpp.

1135  {
1136  if(is_seed())
1137  return;
1138  m_tree->remove_children(m_id);
1139  m_tree->_clear(m_id);
1140  }
void remove_children(id_type node)
remove all the node's children, but keep the node itself
Definition: tree.cpp:857

Referenced by remove_child().

◆ clear_key()

void c4::yml::NodeRef::clear_key ( )
inline

Definition at line 1142 of file node.hpp.

1143  {
1144  if(is_seed())
1145  return;
1146  m_tree->_clear_key(m_id);
1147  }

◆ clear_val()

void c4::yml::NodeRef::clear_val ( )
inline

Definition at line 1149 of file node.hpp.

1150  {
1151  if(is_seed())
1152  return;
1153  m_tree->_clear_val(m_id);
1154  }

◆ clear_children()

void c4::yml::NodeRef::clear_children ( )
inline

Definition at line 1156 of file node.hpp.

1157  {
1158  if(is_seed())
1159  return;
1160  m_tree->remove_children(m_id);
1161  }

◆ operator=() [3/8]

void c4::yml::NodeRef::operator= ( NodeType_e  t)
inline

Definition at line 1163 of file node.hpp.

1164  {
1165  _apply_seed();
1166  m_tree->_add_flags(m_id, t);
1167  }

◆ operator|=()

void c4::yml::NodeRef::operator|= ( NodeType_e  t)
inline

Definition at line 1169 of file node.hpp.

1170  {
1171  _apply_seed();
1172  m_tree->_add_flags(m_id, t);
1173  }

◆ operator=() [4/8]

void c4::yml::NodeRef::operator= ( NodeInit const &  v)
inline

Definition at line 1175 of file node.hpp.

1176  {
1177  _apply_seed();
1178  _apply(v);
1179  }

◆ operator=() [5/8]

void c4::yml::NodeRef::operator= ( NodeScalar const &  v)
inline

Definition at line 1181 of file node.hpp.

1182  {
1183  _apply_seed();
1184  _apply(v);
1185  }

◆ operator=() [6/8]

void c4::yml::NodeRef::operator= ( std::nullptr_t  )
inline

Definition at line 1187 of file node.hpp.

1188  {
1189  _apply_seed();
1190  _apply(csubstr{});
1191  }

◆ operator=() [7/8]

void c4::yml::NodeRef::operator= ( csubstr  v)
inline

Definition at line 1193 of file node.hpp.

1194  {
1195  _apply_seed();
1196  _apply(v);
1197  }

◆ operator=() [8/8]

template<size_t N>
void c4::yml::NodeRef::operator= ( const char(&)  v[N])
inline

Definition at line 1200 of file node.hpp.

1201  {
1202  _apply_seed();
1203  csubstr sv;
1204  sv.assign<N>(v);
1205  _apply(sv);
1206  }

◆ to_arena()

template<class T >
csubstr c4::yml::NodeRef::to_arena ( T const &  s)
inline

serialize a variable to the arena

Definition at line 1217 of file node.hpp.

1218  {
1219  RYML_ASSERT(m_tree); // no need for valid or readable
1220  return m_tree->to_arena(s);
1221  }
auto to_arena(T const &a) -> typename std::enable_if< std::is_floating_point< T >::value, csubstr >::type
serialize the given floating-point variable to the tree's arena, growing it as needed to accomodate t...
Definition: tree.hpp:805

Referenced by set_key_serialized(), and set_val_serialized().

◆ set_key_serialized() [1/3]

template<class T >
size_t c4::yml::NodeRef::set_key_serialized ( T const &  k)
inline

Definition at line 1224 of file node.hpp.

1225  {
1226  _apply_seed();
1227  csubstr s = m_tree->to_arena(k);
1228  m_tree->_set_key(m_id, s);
1229  return s.len;
1230  }

◆ set_key_serialized() [2/3]

size_t c4::yml::NodeRef::set_key_serialized ( std::nullptr_t  )
inline

Definition at line 1231 of file node.hpp.

1232  {
1233  _apply_seed();
1234  m_tree->_set_key(m_id, csubstr{});
1235  return 0;
1236  }

◆ set_val_serialized() [1/3]

template<class T >
size_t c4::yml::NodeRef::set_val_serialized ( T const &  v)
inline

Definition at line 1239 of file node.hpp.

1240  {
1241  _apply_seed();
1242  csubstr s = m_tree->to_arena(v);
1243  m_tree->_set_val(m_id, s);
1244  return s.len;
1245  }

Referenced by sample::sample_tree_arena(), and c4::yml::write().

◆ set_val_serialized() [2/3]

size_t c4::yml::NodeRef::set_val_serialized ( std::nullptr_t  )
inline

Definition at line 1246 of file node.hpp.

1247  {
1248  _apply_seed();
1249  m_tree->_set_val(m_id, csubstr{});
1250  return 0;
1251  }

◆ set_key_serialized() [3/3]

size_t c4::yml::NodeRef::set_key_serialized ( fmt::const_base64_wrapper  w)

encode a blob as base64 into the tree's arena, then assign the result to the node's key

Returns
the size of base64-encoded blob

Definition at line 13 of file node.cpp.

14 {
15  _apply_seed();
16  csubstr encoded = this->to_arena(w);
17  this->set_key(encoded);
18  return encoded.len;
19 }
csubstr to_arena(T const &s)
serialize a variable to the arena
Definition: node.hpp:1217
void set_key(csubstr key)
Definition: node.hpp:1119

References set_key(), and to_arena().

◆ set_val_serialized() [3/3]

size_t c4::yml::NodeRef::set_val_serialized ( fmt::const_base64_wrapper  w)

encode a blob as base64 into the tree's arena, then assign the result to the node's val

Returns
the size of base64-encoded blob

Definition at line 21 of file node.cpp.

22 {
23  _apply_seed();
24  csubstr encoded = this->to_arena(w);
25  this->set_val(encoded);
26  return encoded.len;
27 }
void set_val(csubstr val)
Definition: node.hpp:1120

References set_val(), and to_arena().

◆ operator<<() [1/6]

NodeRef& c4::yml::NodeRef::operator<< ( csubstr  s)
inline

serialize a variable, then assign the result to the node's val

Definition at line 1263 of file node.hpp.

1264  {
1265  // this overload is needed to prevent ambiguity (there's also
1266  // operator<< for writing a substr to a stream)
1267  _apply_seed();
1268  write(this, s);
1269  _RYML_CB_ASSERT(m_tree->m_callbacks, val() == s);
1270  return *this;
1271  }
Callbacks m_callbacks
Definition: tree.hpp:1313
void write(NodeRef *n, T const &v)
Definition: node.hpp:1609

References c4::yml::write().

◆ operator<<() [2/6]

template<class T >
NodeRef& c4::yml::NodeRef::operator<< ( T const &  v)
inline

Definition at line 1274 of file node.hpp.

1275  {
1276  _apply_seed();
1277  write(this, v);
1278  return *this;
1279  }

References c4::yml::write().

◆ operator<<() [3/6]

template<class T >
NodeRef& c4::yml::NodeRef::operator<< ( Key< const T > const &  v)
inline

serialize a variable, then assign the result to the node's key

Definition at line 1283 of file node.hpp.

1284  {
1285  _apply_seed();
1286  set_key_serialized(v.k);
1287  return *this;
1288  }
size_t set_key_serialized(T const &k)
Definition: node.hpp:1224

References c4::yml::Key< K >::k.

◆ operator<<() [4/6]

template<class T >
NodeRef& c4::yml::NodeRef::operator<< ( Key< T > const &  v)
inline

serialize a variable, then assign the result to the node's key

Definition at line 1292 of file node.hpp.

1293  {
1294  _apply_seed();
1295  set_key_serialized(v.k);
1296  return *this;
1297  }

References c4::yml::Key< K >::k.

◆ operator<<() [5/6]

NodeRef& c4::yml::NodeRef::operator<< ( Key< fmt::const_base64_wrapper w)
inline

Definition at line 1299 of file node.hpp.

1300  {
1301  set_key_serialized(w.wrapper);
1302  return *this;
1303  }

References c4::yml::Key< fmt::const_base64_wrapper >::wrapper.

◆ operator<<() [6/6]

NodeRef& c4::yml::NodeRef::operator<< ( fmt::const_base64_wrapper  w)
inline

Definition at line 1305 of file node.hpp.

1306  {
1307  set_val_serialized(w);
1308  return *this;
1309  }
size_t set_val_serialized(T const &v)
Definition: node.hpp:1239

◆ insert_child() [1/2]

NodeRef c4::yml::NodeRef::insert_child ( NodeRef  after)
inline

Definition at line 1358 of file node.hpp.

1359  {
1360  _C4RR();
1361  _RYML_CB_ASSERT(m_tree->m_callbacks, after.m_tree == m_tree);
1362  NodeRef r(m_tree, m_tree->insert_child(m_id, after.m_id));
1363  return r;
1364  }
id_type insert_child(id_type parent, id_type after)
create and insert a new child of parent.
Definition: tree.hpp:623

References _C4RR.

◆ insert_child() [2/2]

NodeRef c4::yml::NodeRef::insert_child ( NodeInit const &  i,
NodeRef  after 
)
inline

Definition at line 1366 of file node.hpp.

1367  {
1368  _C4RR();
1369  _RYML_CB_ASSERT(m_tree->m_callbacks, after.m_tree == m_tree);
1370  NodeRef r(m_tree, m_tree->insert_child(m_id, after.m_id));
1371  r._apply(i);
1372  return r;
1373  }

References _C4RR.

◆ prepend_child() [1/2]

NodeRef c4::yml::NodeRef::prepend_child ( )
inline

Definition at line 1375 of file node.hpp.

1376  {
1377  _C4RR();
1378  NodeRef r(m_tree, m_tree->insert_child(m_id, NONE));
1379  return r;
1380  }

References _C4RR, and c4::yml::NONE.

◆ prepend_child() [2/2]

NodeRef c4::yml::NodeRef::prepend_child ( NodeInit const &  i)
inline

Definition at line 1382 of file node.hpp.

1383  {
1384  _C4RR();
1385  NodeRef r(m_tree, m_tree->insert_child(m_id, NONE));
1386  r._apply(i);
1387  return r;
1388  }

References _C4RR, and c4::yml::NONE.

◆ append_child() [1/2]

NodeRef c4::yml::NodeRef::append_child ( )
inline

Definition at line 1390 of file node.hpp.

1391  {
1392  _C4RR();
1393  NodeRef r(m_tree, m_tree->append_child(m_id));
1394  return r;
1395  }
id_type append_child(id_type parent)
create and insert a node as the last child of parent
Definition: tree.hpp:635

References _C4RR.

Referenced by sample::sample_base64(), sample::sample_create_trees(), sample::sample_float_precision(), sample::sample_lightning_overview(), sample::sample_parse_reuse_tree(), sample::sample_quick_overview(), c4::yml::write(), and sample::write().

◆ append_child() [2/2]

NodeRef c4::yml::NodeRef::append_child ( NodeInit const &  i)
inline

Definition at line 1397 of file node.hpp.

1398  {
1399  _C4RR();
1400  NodeRef r(m_tree, m_tree->append_child(m_id));
1401  r._apply(i);
1402  return r;
1403  }

References _C4RR.

◆ insert_sibling() [1/2]

NodeRef c4::yml::NodeRef::insert_sibling ( ConstNodeRef const &  after)
inline

Definition at line 1405 of file node.hpp.

1406  {
1407  _C4RR();
1408  _RYML_CB_ASSERT(m_tree->m_callbacks, after.m_tree == m_tree);
1409  NodeRef r(m_tree, m_tree->insert_sibling(m_id, after.m_id));
1410  return r;
1411  }
id_type insert_sibling(id_type node, id_type after)
create and insert a new sibling of n. insert after "after"
Definition: tree.hpp:656

References _C4RR, c4::yml::ConstNodeRef::m_id, and c4::yml::ConstNodeRef::m_tree.

◆ insert_sibling() [2/2]

NodeRef c4::yml::NodeRef::insert_sibling ( NodeInit const &  i,
ConstNodeRef const &  after 
)
inline

Definition at line 1413 of file node.hpp.

1414  {
1415  _C4RR();
1416  _RYML_CB_ASSERT(m_tree->m_callbacks, after.m_tree == m_tree);
1417  NodeRef r(m_tree, m_tree->insert_sibling(m_id, after.m_id));
1418  r._apply(i);
1419  return r;
1420  }

References _C4RR, c4::yml::ConstNodeRef::m_id, and c4::yml::ConstNodeRef::m_tree.

◆ prepend_sibling() [1/2]

NodeRef c4::yml::NodeRef::prepend_sibling ( )
inline

Definition at line 1422 of file node.hpp.

1423  {
1424  _C4RR();
1425  NodeRef r(m_tree, m_tree->prepend_sibling(m_id));
1426  return r;
1427  }
id_type prepend_sibling(id_type node)
create and insert a node as the first node of parent
Definition: tree.hpp:661

References _C4RR.

◆ prepend_sibling() [2/2]

NodeRef c4::yml::NodeRef::prepend_sibling ( NodeInit const &  i)
inline

Definition at line 1429 of file node.hpp.

1430  {
1431  _C4RR();
1432  NodeRef r(m_tree, m_tree->prepend_sibling(m_id));
1433  r._apply(i);
1434  return r;
1435  }

References _C4RR.

◆ append_sibling() [1/2]

NodeRef c4::yml::NodeRef::append_sibling ( )
inline

Definition at line 1437 of file node.hpp.

1438  {
1439  _C4RR();
1440  NodeRef r(m_tree, m_tree->append_sibling(m_id));
1441  return r;
1442  }
id_type append_sibling(id_type node)
Definition: tree.hpp:662

References _C4RR.

◆ append_sibling() [2/2]

NodeRef c4::yml::NodeRef::append_sibling ( NodeInit const &  i)
inline

Definition at line 1444 of file node.hpp.

1445  {
1446  _C4RR();
1447  NodeRef r(m_tree, m_tree->append_sibling(m_id));
1448  r._apply(i);
1449  return r;
1450  }

References _C4RR.

◆ remove_child() [1/3]

void c4::yml::NodeRef::remove_child ( NodeRef child)
inline

Definition at line 1454 of file node.hpp.

1455  {
1456  _C4RR();
1457  _RYML_CB_ASSERT(m_tree->m_callbacks, has_child(child));
1458  _RYML_CB_ASSERT(m_tree->m_callbacks, child.parent().id() == id());
1459  m_tree->remove(child.id());
1460  child.clear();
1461  }
void remove(id_type node)
remove an entire branch at once: ie remove the children and the node itself
Definition: tree.hpp:667
bool has_child(ConstNodeRef const &n) const RYML_NOEXCEPT
Forward to Tree::has_child().
Definition: node.hpp:307
auto child(id_type pos) RYML_NOEXCEPT -> NodeRef
Forward to Tree::child().
Definition: node.hpp:345

References _C4RR, clear(), id(), and c4::yml::detail::RoNodeMethods< Impl, ConstImpl >::parent().

◆ remove_child() [2/3]

void c4::yml::NodeRef::remove_child ( id_type  pos)
inline

remove the nth child of this node

Definition at line 1464 of file node.hpp.

1465  {
1466  _C4RR();
1467  _RYML_CB_ASSERT(m_tree->m_callbacks, pos >= 0 && pos < num_children());
1468  id_type child = m_tree->child(m_id, pos);
1469  _RYML_CB_ASSERT(m_tree->m_callbacks, child != NONE);
1470  m_tree->remove(child);
1471  }
id_type child(id_type node, id_type pos) const
Definition: tree.cpp:1154
RYML_ID_TYPE id_type
The type of a node id in the YAML tree; to override the default type, define the macro RYML_ID_TYPE t...
Definition: common.hpp:253
id_type num_children() const RYML_NOEXCEPT
O(num_children).
Definition: node.hpp:376

References _C4RR, and c4::yml::NONE.

◆ remove_child() [3/3]

void c4::yml::NodeRef::remove_child ( csubstr  key)
inline

remove a child by name

Definition at line 1474 of file node.hpp.

1475  {
1476  _C4RR();
1477  id_type child = m_tree->find_child(m_id, key);
1478  _RYML_CB_ASSERT(m_tree->m_callbacks, child != NONE);
1479  m_tree->remove(child);
1480  }
id_type find_child(id_type node, csubstr const &key) const
Definition: tree.cpp:1192

References _C4RR, c4::yml::key(), and c4::yml::NONE.

◆ move() [1/2]

void c4::yml::NodeRef::move ( ConstNodeRef const &  after)
inline

change the node's position within its parent, placing it after after.

To move to the first position in the parent, simply pass an empty or default-constructed reference like this: n.move({}).

Definition at line 1488 of file node.hpp.

1489  {
1490  _C4RR();
1491  m_tree->move(m_id, after.m_id);
1492  }
void move(id_type node, id_type after)
change the node's position in the parent
Definition: tree.cpp:782

References _C4RR, and c4::yml::ConstNodeRef::m_id.

◆ move() [2/2]

void c4::yml::NodeRef::move ( NodeRef const &  parent,
ConstNodeRef const &  after 
)
inline

move the node to a different parent (which may belong to a different tree), placing it after after.

When the destination parent is in a new tree, then this node's tree pointer is reset to the tree of the parent node.

Definition at line 1498 of file node.hpp.

1499  {
1500  _C4RR();
1501  if(parent.m_tree == m_tree)
1502  {
1503  m_tree->move(m_id, parent.m_id, after.m_id);
1504  }
1505  else
1506  {
1507  parent.m_tree->move(m_tree, m_id, parent.m_id, after.m_id);
1508  m_tree = parent.m_tree;
1509  }
1510  }
auto parent() RYML_NOEXCEPT -> NodeRef
Forward to Tree::parent().
Definition: node.hpp:333

References _C4RR, c4::yml::ConstNodeRef::m_id, and c4::yml::Tree::move().

◆ duplicate() [1/2]

NodeRef c4::yml::NodeRef::duplicate ( ConstNodeRef const &  after) const
inline

duplicate the current node somewhere within its parent, and place it after the node after.

To place into the first position of the parent, simply pass an empty or default-constructed reference like this: n.move({}).

Definition at line 1516 of file node.hpp.

1517  {
1518  _C4RR();
1519  _RYML_CB_ASSERT(m_tree->m_callbacks, m_tree == after.m_tree || after.m_id == NONE);
1520  id_type dup = m_tree->duplicate(m_id, m_tree->parent(m_id), after.m_id);
1521  NodeRef r(m_tree, dup);
1522  return r;
1523  }
id_type duplicate(id_type node, id_type new_parent, id_type after)
recursively duplicate a node from this tree into a new parent, placing it after one of its children
Definition: tree.cpp:892
id_type parent(id_type node) const
Definition: tree.hpp:457

References _C4RR, c4::yml::ConstNodeRef::m_id, c4::yml::ConstNodeRef::m_tree, and c4::yml::NONE.

◆ duplicate() [2/2]

NodeRef c4::yml::NodeRef::duplicate ( NodeRef const &  parent,
ConstNodeRef const &  after 
) const
inline

duplicate the current node somewhere into a different parent (possibly from a different tree), and place it after the node after.

To place into the first position of the parent, simply pass an empty or default-constructed reference like this: n.move({}).

Definition at line 1530 of file node.hpp.

1531  {
1532  _C4RR();
1533  _RYML_CB_ASSERT(m_tree->m_callbacks, parent.m_tree == after.m_tree || after.m_id == NONE);
1534  if(parent.m_tree == m_tree)
1535  {
1536  id_type dup = m_tree->duplicate(m_id, parent.m_id, after.m_id);
1537  NodeRef r(m_tree, dup);
1538  return r;
1539  }
1540  else
1541  {
1542  id_type dup = parent.m_tree->duplicate(m_tree, m_id, parent.m_id, after.m_id);
1543  NodeRef r(parent.m_tree, dup);
1544  return r;
1545  }
1546  }

References _C4RR, c4::yml::Tree::duplicate(), c4::yml::ConstNodeRef::m_id, c4::yml::ConstNodeRef::m_tree, and c4::yml::NONE.

◆ duplicate_children()

void c4::yml::NodeRef::duplicate_children ( NodeRef const &  parent,
ConstNodeRef const &  after 
) const
inline

Definition at line 1548 of file node.hpp.

1549  {
1550  _C4RR();
1551  _RYML_CB_ASSERT(m_tree->m_callbacks, parent.m_tree == after.m_tree);
1552  if(parent.m_tree == m_tree)
1553  {
1554  m_tree->duplicate_children(m_id, parent.m_id, after.m_id);
1555  }
1556  else
1557  {
1558  parent.m_tree->duplicate_children(m_tree, m_id, parent.m_id, after.m_id);
1559  }
1560  }
id_type duplicate_children(id_type node, id_type parent, id_type after)
recursively duplicate the node's children (but not the node)
Definition: tree.cpp:914

References _C4RR, c4::yml::Tree::duplicate_children(), c4::yml::ConstNodeRef::m_id, and c4::yml::ConstNodeRef::m_tree.

◆ get() [1/2]

NodeData const* c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::get ( ) const
inlineinherited

returns the data or null when the id is NONE

Definition at line 199 of file node.hpp.

199 { return ((Impl const*)this)->readable() ? tree_->get(id_) : nullptr; }

◆ get() [2/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::get ( ) -> NodeData*
inlineinherited

returns the data or null when the id is NONE

Definition at line 202 of file node.hpp.

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

◆ type()

NodeType c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::type ( ) const
inlineinherited

Forward to Tree::type_str().

Node must be readable.

Definition at line 204 of file node.hpp.

◆ type_str()

const char* c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::type_str ( ) const
inlineinherited

Forward to Tree::type_str().

Node must be readable.

Definition at line 205 of file node.hpp.

◆ key()

csubstr c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::key ( ) const
inlineinherited

Forward to Tree::key().

Node must be readable.

Definition at line 207 of file node.hpp.

◆ key_tag()

csubstr c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::key_tag ( ) const
inlineinherited

Forward to Tree::key_tag().

Node must be readable.

Definition at line 208 of file node.hpp.

◆ key_ref()

csubstr c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::key_ref ( ) const
inlineinherited

Forward to Tree::key_ref().

Node must be readable.

Definition at line 209 of file node.hpp.

◆ key_anchor()

csubstr c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::key_anchor ( ) const
inlineinherited

Forward to Tree::key_anchor().

Node must be readable.

Definition at line 210 of file node.hpp.

◆ val()

csubstr c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::val ( ) const
inlineinherited

Forward to Tree::val().

Node must be readable.

Definition at line 212 of file node.hpp.

◆ val_tag()

csubstr c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::val_tag ( ) const
inlineinherited

Forward to Tree::val_tag().

Node must be readable.

Definition at line 213 of file node.hpp.

◆ val_ref()

csubstr c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::val_ref ( ) const
inlineinherited

Forward to Tree::val_ref().

Node must be readable.

Definition at line 214 of file node.hpp.

◆ val_anchor()

csubstr c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::val_anchor ( ) const
inlineinherited

Forward to Tree::val_anchor().

Node must be readable.

Definition at line 215 of file node.hpp.

◆ keysc()

NodeScalar const& c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::keysc ( ) const
inlineinherited

Forward to Tree::keysc().

Node must be readable.

Definition at line 217 of file node.hpp.

◆ valsc()

NodeScalar const& c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::valsc ( ) const
inlineinherited

Forward to Tree::valsc().

Node must be readable.

Definition at line 218 of file node.hpp.

◆ key_is_null()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::key_is_null ( ) const
inlineinherited

Forward to Tree::key_is_null().

Node must be readable.

Definition at line 220 of file node.hpp.

◆ val_is_null()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::val_is_null ( ) const
inlineinherited

Forward to Tree::val_is_null().

Node must be readable.

Definition at line 221 of file node.hpp.

◆ is_key_unfiltered()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_key_unfiltered ( ) const
inlinenoexceptinherited

Forward to Tree::is_key_unfiltered().

Node must be readable.

Definition at line 223 of file node.hpp.

◆ is_val_unfiltered()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_val_unfiltered ( ) const
inlinenoexceptinherited

Forward to Tree::is_val_unfiltered().

Node must be readable.

Definition at line 224 of file node.hpp.

◆ empty()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::empty ( ) const
inlineinherited

Forward to Tree::empty().

Node must be readable.

Definition at line 233 of file node.hpp.

◆ is_stream()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_stream ( ) const
inlineinherited

Forward to Tree::is_stream().

Node must be readable.

Definition at line 234 of file node.hpp.

◆ is_doc()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_doc ( ) const
inlineinherited

Forward to Tree::is_doc().

Node must be readable.

Definition at line 235 of file node.hpp.

◆ is_container()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_container ( ) const
inlineinherited

Forward to Tree::is_container().

Node must be readable.

Definition at line 236 of file node.hpp.

◆ is_map()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_map ( ) const
inlineinherited

Forward to Tree::is_map().

Node must be readable.

Definition at line 237 of file node.hpp.

◆ is_seq()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_seq ( ) const
inlineinherited

Forward to Tree::is_seq().

Node must be readable.

Definition at line 238 of file node.hpp.

◆ has_val()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_val ( ) const
inlineinherited

Forward to Tree::has_val().

Node must be readable.

Definition at line 239 of file node.hpp.

◆ has_key()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_key ( ) const
inlineinherited

Forward to Tree::has_key().

Node must be readable.

Definition at line 240 of file node.hpp.

◆ is_val()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_val ( ) const
inlineinherited

Forward to Tree::is_val().

Node must be readable.

Definition at line 241 of file node.hpp.

◆ is_keyval()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_keyval ( ) const
inlineinherited

Forward to Tree::is_keyval().

Node must be readable.

Definition at line 242 of file node.hpp.

◆ has_key_tag()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_key_tag ( ) const
inlineinherited

Forward to Tree::has_key_tag().

Node must be readable.

Definition at line 243 of file node.hpp.

◆ has_val_tag()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_val_tag ( ) const
inlineinherited

Forward to Tree::has_val_tag().

Node must be readable.

Definition at line 244 of file node.hpp.

◆ has_key_anchor()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_key_anchor ( ) const
inlineinherited

Forward to Tree::has_key_anchor().

Node must be readable.

Definition at line 245 of file node.hpp.

◆ has_val_anchor()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_val_anchor ( ) const
inlineinherited

Forward to Tree::has_val_anchor().

Node must be readable.

Definition at line 246 of file node.hpp.

◆ has_anchor()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_anchor ( ) const
inlineinherited

Forward to Tree::has_anchor().

Node must be readable.

Definition at line 247 of file node.hpp.

◆ is_key_ref()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_key_ref ( ) const
inlineinherited

Forward to Tree::is_key_ref().

Node must be readable.

Definition at line 248 of file node.hpp.

◆ is_val_ref()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_val_ref ( ) const
inlineinherited

Forward to Tree::is_val_ref().

Node must be readable.

Definition at line 249 of file node.hpp.

◆ is_ref()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_ref ( ) const
inlineinherited

Forward to Tree::is_ref().

Node must be readable.

Definition at line 250 of file node.hpp.

◆ parent_is_seq()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::parent_is_seq ( ) const
inlineinherited

Forward to Tree::parent_is_seq().

Node must be readable.

Definition at line 251 of file node.hpp.

◆ parent_is_map()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::parent_is_map ( ) const
inlineinherited

Forward to Tree::parent_is_map().

Node must be readable.

Definition at line 252 of file node.hpp.

◆ is_key_anchor()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_key_anchor ( ) const
inlinenoexceptinherited

Definition at line 254 of file node.hpp.

254 { _C4RR(); return tree_->has_key_anchor(id_); }

◆ is_val_hanchor()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_val_hanchor ( ) const
inlinenoexceptinherited

Definition at line 255 of file node.hpp.

255 { _C4RR(); return tree_->has_val_anchor(id_); }

◆ is_anchor()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_anchor ( ) const
inlinenoexceptinherited

Definition at line 256 of file node.hpp.

256 { _C4RR(); return tree_->has_anchor(id_); }

◆ is_anchor_or_ref()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_anchor_or_ref ( ) const
inlinenoexceptinherited

Definition at line 257 of file node.hpp.

257 { _C4RR(); return tree_->is_anchor_or_ref(id_); }

◆ type_has_any()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::type_has_any ( NodeType_e  bits) const
inlineinherited

Forward to Tree::type_has_any().

Node must be readable.

Definition at line 268 of file node.hpp.

◆ type_has_all()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::type_has_all ( NodeType_e  bits) const
inlineinherited

Forward to Tree::type_has_all().

Node must be readable.

Definition at line 269 of file node.hpp.

◆ type_has_none()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::type_has_none ( NodeType_e  bits) const
inlineinherited

Forward to Tree::type_has_none().

Node must be readable.

Definition at line 270 of file node.hpp.

◆ is_container_styled()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_container_styled ( ) const
inlineinherited

Forward to Tree::is_container_styled().

Node must be readable.

Definition at line 272 of file node.hpp.

◆ is_block()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_block ( ) const
inlineinherited

Forward to Tree::is_block().

Node must be readable.

Definition at line 273 of file node.hpp.

◆ is_flow_sl()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_flow_sl ( ) const
inlineinherited

Forward to Tree::is_flow_sl().

Node must be readable.

Definition at line 274 of file node.hpp.

◆ is_flow_ml()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_flow_ml ( ) const
inlineinherited

Forward to Tree::is_flow_ml().

Node must be readable.

Definition at line 275 of file node.hpp.

◆ is_flow()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_flow ( ) const
inlineinherited

Forward to Tree::is_flow().

Node must be readable.

Definition at line 276 of file node.hpp.

◆ is_key_styled()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_key_styled ( ) const
inlineinherited

Forward to Tree::is_key_styled().

Node must be readable.

Definition at line 278 of file node.hpp.

◆ is_val_styled()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_val_styled ( ) const
inlineinherited

Forward to Tree::is_val_styled().

Node must be readable.

Definition at line 279 of file node.hpp.

◆ is_key_literal()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_key_literal ( ) const
inlineinherited

Forward to Tree::is_key_literal().

Node must be readable.

Definition at line 280 of file node.hpp.

◆ is_val_literal()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_val_literal ( ) const
inlineinherited

Forward to Tree::is_val_literal().

Node must be readable.

Definition at line 281 of file node.hpp.

◆ is_key_folded()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_key_folded ( ) const
inlineinherited

Forward to Tree::is_key_folded().

Node must be readable.

Definition at line 282 of file node.hpp.

◆ is_val_folded()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_val_folded ( ) const
inlineinherited

Forward to Tree::is_val_folded().

Node must be readable.

Definition at line 283 of file node.hpp.

◆ is_key_squo()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_key_squo ( ) const
inlineinherited

Forward to Tree::is_key_squo().

Node must be readable.

Definition at line 284 of file node.hpp.

◆ is_val_squo()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_val_squo ( ) const
inlineinherited

Forward to Tree::is_val_squo().

Node must be readable.

Definition at line 285 of file node.hpp.

◆ is_key_dquo()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_key_dquo ( ) const
inlineinherited

Forward to Tree::is_key_dquo().

Node must be readable.

Definition at line 286 of file node.hpp.

◆ is_val_dquo()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_val_dquo ( ) const
inlineinherited

Forward to Tree::is_val_dquo().

Node must be readable.

Definition at line 287 of file node.hpp.

◆ is_key_plain()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_key_plain ( ) const
inlineinherited

Forward to Tree::is_key_plain().

Node must be readable.

Definition at line 288 of file node.hpp.

◆ is_val_plain()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_val_plain ( ) const
inlineinherited

Forward to Tree::is_val_plain().

Node must be readable.

Definition at line 289 of file node.hpp.

◆ is_key_quoted()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_key_quoted ( ) const
inlineinherited

Forward to Tree::is_key_quoted().

Node must be readable.

Definition at line 290 of file node.hpp.

◆ is_val_quoted()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_val_quoted ( ) const
inlineinherited

Forward to Tree::is_val_quoted().

Node must be readable.

Definition at line 291 of file node.hpp.

◆ is_quoted()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_quoted ( ) const
inlineinherited

Forward to Tree::is_quoted().

Node must be readable.

Definition at line 292 of file node.hpp.

◆ is_root()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_root ( ) const
inlineinherited

Forward to Tree::is_root().

Node must be readable.

Definition at line 303 of file node.hpp.

◆ has_parent()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_parent ( ) const
inlineinherited

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

Definition at line 304 of file node.hpp.

◆ is_ancestor()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::is_ancestor ( ConstNodeRef const &  ancestor) const
inlineinherited

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

Definition at line 305 of file node.hpp.

◆ has_child() [1/3]

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_child ( ConstNodeRef const &  n) const
inlineinherited

Forward to Tree::has_child().

Node must be readable.

Definition at line 307 of file node.hpp.

◆ has_child() [2/3]

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_child ( id_type  node) const
inlineinherited

Forward to Tree::has_child().

Node must be readable.

Definition at line 308 of file node.hpp.

◆ has_child() [3/3]

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_child ( csubstr  name) const
inlineinherited

Forward to Tree::has_child().

Node must be readable.

Definition at line 309 of file node.hpp.

◆ has_children()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_children ( ) const
inlineinherited

Forward to Tree::has_child().

Node must be readable.

Definition at line 310 of file node.hpp.

◆ has_sibling() [1/3]

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_sibling ( ConstNodeRef const &  n) const
inlineinherited

Forward to Tree::has_sibling().

Node must be readable.

Definition at line 312 of file node.hpp.

◆ has_sibling() [2/3]

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_sibling ( id_type  node) const
inlineinherited

Forward to Tree::has_sibling().

Node must be readable.

Definition at line 313 of file node.hpp.

◆ has_sibling() [3/3]

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_sibling ( csubstr  name) const
inlineinherited

Forward to Tree::has_sibling().

Node must be readable.

Definition at line 314 of file node.hpp.

◆ has_other_siblings()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_other_siblings ( ) const
inlineinherited

Forward to Tree::has_sibling().

Node must be readable.

Definition at line 315 of file node.hpp.

◆ has_siblings()

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::has_siblings ( ) const
inlineinherited

Definition at line 317 of file node.hpp.

317 { _C4RR(); return tree_->has_siblings(id_); }

◆ doc() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::doc ( id_type  i) -> NodeRef
inlineinherited

Forward to Tree::doc().

Node must be readable.

Definition at line 329 of file node.hpp.

◆ doc() [2/2]

Forward to Tree::doc().

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

Definition at line 330 of file node.hpp.

◆ parent() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::parent ( ) -> Impl
inlineinherited

Forward to Tree::parent().

Node must be readable.

Definition at line 333 of file node.hpp.

◆ parent() [2/2]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::parent ( ) const
inlineinherited

Forward to Tree::parent().

Node must be readable.

Definition at line 334 of file node.hpp.

◆ first_child() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::first_child ( ) -> Impl
inlineinherited

Forward to Tree::first_child().

Node must be readable.

Definition at line 337 of file node.hpp.

◆ first_child() [2/2]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::first_child ( ) const
inlineinherited

Forward to Tree::first_child().

Node must be readable.

Definition at line 338 of file node.hpp.

◆ last_child() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::last_child ( ) -> Impl
inlineinherited

Forward to Tree::last_child().

Node must be readable.

Definition at line 341 of file node.hpp.

◆ last_child() [2/2]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::last_child ( ) const
inlineinherited

Forward to Tree::last_child().

Node must be readable.

Definition at line 342 of file node.hpp.

◆ child() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::child ( id_type  pos) -> NodeRef
inlineinherited

Forward to Tree::child().

Node must be readable.

Definition at line 345 of file node.hpp.

◆ child() [2/2]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::child ( id_type  pos) const
inlineinherited

Forward to Tree::child().

Node must be readable.

Definition at line 346 of file node.hpp.

◆ find_child() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::find_child ( csubstr  name) -> NodeRef
inlineinherited

Forward to Tree::first_child().

Node must be readable.

Definition at line 349 of file node.hpp.

◆ find_child() [2/2]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::find_child ( csubstr  name) const
inlineinherited

Forward to Tree::first_child().

Node must be readable.

Definition at line 350 of file node.hpp.

◆ prev_sibling() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::prev_sibling ( ) -> Impl
inlineinherited

Forward to Tree::prev_sibling().

Node must be readable.

Definition at line 353 of file node.hpp.

◆ prev_sibling() [2/2]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::prev_sibling ( ) const
inlineinherited

Forward to Tree::prev_sibling().

Node must be readable.

Definition at line 354 of file node.hpp.

◆ next_sibling() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::next_sibling ( ) -> Impl
inlineinherited

Forward to Tree::next_sibling().

Node must be readable.

Definition at line 357 of file node.hpp.

◆ next_sibling() [2/2]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::next_sibling ( ) const
inlineinherited

Forward to Tree::next_sibling().

Node must be readable.

Definition at line 358 of file node.hpp.

◆ first_sibling() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::first_sibling ( ) -> Impl
inlineinherited

Forward to Tree::first_sibling().

Node must be readable.

Definition at line 361 of file node.hpp.

◆ first_sibling() [2/2]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::first_sibling ( ) const
inlineinherited

Forward to Tree::first_sibling().

Node must be readable.

Definition at line 362 of file node.hpp.

◆ last_sibling() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::last_sibling ( ) -> Impl
inlineinherited

Forward to Tree::last_sibling().

Node must be readable.

Definition at line 365 of file node.hpp.

◆ last_sibling() [2/2]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::last_sibling ( ) const
inlineinherited

Forward to Tree::last_sibling().

Node must be readable.

Definition at line 366 of file node.hpp.

◆ sibling() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::sibling ( id_type  pos) -> NodeRef
inlineinherited

Forward to Tree::sibling().

Node must be readable.

Definition at line 369 of file node.hpp.

◆ sibling() [2/2]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::sibling ( id_type  pos) const
inlineinherited

Forward to Tree::sibling().

Node must be readable.

Definition at line 370 of file node.hpp.

◆ find_sibling() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::find_sibling ( csubstr  name) -> NodeRef
inlineinherited

Forward to Tree::find_sibling().

Node must be readable.

Definition at line 373 of file node.hpp.

◆ find_sibling() [2/2]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::find_sibling ( csubstr  name) const
inlineinherited

Forward to Tree::find_sibling().

Node must be readable.

Definition at line 374 of file node.hpp.

◆ num_children()

id_type c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::num_children ( ) const
inlineinherited

O(num_children).

Forward to Tree::num_children().

Definition at line 376 of file node.hpp.

◆ num_siblings()

id_type c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::num_siblings ( ) const
inlineinherited

O(num_children).

Forward to Tree::num_siblings().

Definition at line 377 of file node.hpp.

◆ num_other_siblings()

id_type c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::num_other_siblings ( ) const
inlineinherited

O(num_siblings).

Forward to Tree::num_other_siblings().

Definition at line 378 of file node.hpp.

◆ child_pos()

id_type c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::child_pos ( ConstNodeRef const &  n) const
inlineinherited

O(num_children).

Forward to Tree::child_pos().

Definition at line 379 of file node.hpp.

◆ sibling_pos()

id_type c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::sibling_pos ( ConstNodeRef const &  n) const
inlineinherited

O(num_siblings).

Forward to Tree::sibling_pos().

Definition at line 380 of file node.hpp.

◆ depth_asc()

id_type c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::depth_asc ( ) const
inlineinherited

Definition at line 382 of file node.hpp.

382 { _C4RR(); return tree_->depth_asc(id_); } /** O(log(num_nodes)). Forward to Tree::depth_asc(). Node must be readable. */

◆ depth_desc()

id_type c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::depth_desc ( ) const
inlineinherited

O(log(num_nodes)).

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

Definition at line 383 of file node.hpp.

383 { _C4RR(); return tree_->depth_desc(id_); } /** O(num_nodes). Forward to Tree::depth_desc(). Node must be readable. */

◆ operator[]() [1/4]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::operator[] ( csubstr  key) -> NodeRef
inlineinherited

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 412 of file node.hpp.

413  {
414  _C4RR();
415  id_type ch = tree__->find_child(id__, key);
416  return ch != NONE ? Impl(tree__, ch) : Impl(tree__, id__, key);
417  }

◆ operator[]() [2/4]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::operator[] ( id_type  pos) -> NodeRef
inlineinherited

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 438 of file node.hpp.

439  {
440  _C4RR();
441  id_type ch = tree__->child(id__, pos);
442  return ch != NONE ? Impl(tree__, ch) : Impl(tree__, id__, pos);
443  }

◆ operator[]() [3/4]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::operator[] ( csubstr  key) const
inlineinherited

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 454 of file node.hpp.

455  {
456  _C4RR();
457  id_type ch = tree_->find_child(id_, key);
458  _RYML_CB_ASSERT(tree_->m_callbacks, ch != NONE);
459  return {tree_, ch};
460  }

◆ operator[]() [4/4]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::operator[] ( id_type  pos) const
inlineinherited

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 471 of file node.hpp.

472  {
473  _C4RR();
474  id_type ch = tree_->child(id_, pos);
475  _RYML_CB_ASSERT(tree_->m_callbacks, ch != NONE);
476  return {tree_, ch};
477  }

◆ at() [1/4]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::at ( csubstr  key) -> NodeRef
inlineinherited

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 519 of file node.hpp.

520  {
521  RYML_CHECK(tree_ != nullptr);
522  _RYML_CB_CHECK(tree_->m_callbacks, (id_ >= 0 && id_ < tree_->capacity()));
523  _RYML_CB_CHECK(tree_->m_callbacks, ((Impl const*)this)->readable());
524  _RYML_CB_CHECK(tree_->m_callbacks, tree_->is_map(id_));
525  id_type ch = tree__->find_child(id__, key);
526  return ch != NONE ? Impl(tree__, ch) : Impl(tree__, id__, key);
527  }

◆ at() [2/4]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::at ( id_type  pos) -> NodeRef
inlineinherited

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 555 of file node.hpp.

556  {
557  RYML_CHECK(tree_ != nullptr);
558  const id_type cap = tree_->capacity();
559  _RYML_CB_CHECK(tree_->m_callbacks, (id_ >= 0 && id_ < cap));
560  _RYML_CB_CHECK(tree_->m_callbacks, (pos >= 0 && pos < cap));
561  _RYML_CB_CHECK(tree_->m_callbacks, ((Impl const*)this)->readable());
562  _RYML_CB_CHECK(tree_->m_callbacks, tree_->is_container(id_));
563  id_type ch = tree__->child(id__, pos);
564  return ch != NONE ? Impl(tree__, ch) : Impl(tree__, id__, pos);
565  }

◆ at() [3/4]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::at ( csubstr  key) const
inlineinherited

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 576 of file node.hpp.

577  {
578  RYML_CHECK(tree_ != nullptr);
579  _RYML_CB_CHECK(tree_->m_callbacks, (id_ >= 0 && id_ < tree_->capacity()));
580  _RYML_CB_CHECK(tree_->m_callbacks, ((Impl const*)this)->readable());
581  _RYML_CB_CHECK(tree_->m_callbacks, tree_->is_map(id_));
582  id_type ch = tree_->find_child(id_, key);
583  _RYML_CB_CHECK(tree_->m_callbacks, ch != NONE);
584  return {tree_, ch};
585  }

◆ at() [4/4]

ConstNodeRef c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::at ( id_type  pos) const
inlineinherited

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 596 of file node.hpp.

597  {
598  RYML_CHECK(tree_ != nullptr);
599  const id_type cap = tree_->capacity();
600  _RYML_CB_CHECK(tree_->m_callbacks, (id_ >= 0 && id_ < cap));
601  _RYML_CB_CHECK(tree_->m_callbacks, (pos >= 0 && pos < cap));
602  _RYML_CB_CHECK(tree_->m_callbacks, ((Impl const*)this)->readable());
603  _RYML_CB_CHECK(tree_->m_callbacks, tree_->is_container(id_));
604  const id_type ch = tree_->child(id_, pos);
605  _RYML_CB_CHECK(tree_->m_callbacks, ch != NONE);
606  return {tree_, ch};
607  }

◆ operator>>() [1/4]

ConstNodeRef const& c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::operator>> ( T &  v) const
inlineinherited

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

Definition at line 619 of file node.hpp.

620  {
621  _C4RR();
622  if( ! read((ConstImpl const&)*this, &v))
623  _RYML_CB_ERR(tree_->m_callbacks, "could not deserialize value");
624  return *((ConstImpl const*)this);
625  }
bool read(NodeRef const &n, T *v)
Definition: node.hpp:1621

◆ operator>>() [2/4]

ConstNodeRef const& c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::operator>> ( Key< T >  v) const
inlineinherited

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 631 of file node.hpp.

632  {
633  _C4RR();
634  if( ! readkey((ConstImpl const&)*this, &v.k))
635  _RYML_CB_ERR(tree_->m_callbacks, "could not deserialize key");
636  return *((ConstImpl const*)this);
637  }
bool readkey(NodeRef const &n, T *v)
Definition: node.hpp:1633

◆ operator>>() [3/4]

ConstNodeRef const& c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::operator>> ( Key< fmt::base64_wrapper w) const
inlineinherited

deserialize the node's key as base64.

lightweight wrapper over deserialize_key()

Definition at line 676 of file node.hpp.

677  {
678  deserialize_key(w.wrapper);
679  return *((ConstImpl const*)this);
680  }
size_t deserialize_key(fmt::base64_wrapper v) const
decode the base64-encoded key and assign the decoded blob to the given buffer/
Definition: node.hpp:692

◆ operator>>() [4/4]

ConstNodeRef const& c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::operator>> ( fmt::base64_wrapper  w) const
inlineinherited

deserialize the node's val as base64.

lightweight wrapper over deserialize_val()

Definition at line 683 of file node.hpp.

684  {
685  deserialize_val(w);
686  return *((ConstImpl const*)this);
687  }
size_t deserialize_val(fmt::base64_wrapper v) const
decode the base64-encoded key and assign the decoded blob to the given buffer/
Definition: node.hpp:700

◆ get_if() [1/2]

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::get_if ( csubstr  name,
T *  var 
) const
inlineinherited

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

return true if the child existed.

Definition at line 642 of file node.hpp.

643  {
644  _C4RR();
645  ConstImpl ch = find_child(name);
646  if(!ch.readable())
647  return false;
648  ch >> *var;
649  return true;
650  }
auto find_child(csubstr name) RYML_NOEXCEPT -> NodeRef
Forward to Tree::first_child().
Definition: node.hpp:349

◆ get_if() [2/2]

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::get_if ( csubstr  name,
T *  var,
T const &  fallback 
) const
inlineinherited

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 656 of file node.hpp.

657  {
658  _C4RR();
659  ConstImpl ch = find_child(name);
660  if(ch.readable())
661  {
662  ch >> *var;
663  return true;
664  }
665  else
666  {
667  *var = fallback;
668  return false;
669  }
670  }

◆ deserialize_key()

size_t c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::deserialize_key ( fmt::base64_wrapper  v) const
inlineinherited

decode the base64-encoded key and assign the decoded blob to the given buffer/

Returns
the size of base64-decoded blob

Definition at line 692 of file node.hpp.

693  {
694  _C4RR();
695  return from_chars(key(), &v);
696  }
bool from_chars(ryml::csubstr buf, vec2< T > *v)

◆ deserialize_val()

size_t c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::deserialize_val ( fmt::base64_wrapper  v) const
inlineinherited

decode the base64-encoded key and assign the decoded blob to the given buffer/

Returns
the size of base64-decoded blob

Definition at line 700 of file node.hpp.

701  {
702  _C4RR();
703  return from_chars(val(), &v);
704  };

◆ begin() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::begin ( ) -> iterator
inlineinherited

get an iterator to the first child

Definition at line 732 of file node.hpp.

732 { _C4RR(); return iterator(tree__, tree__->first_child(id__)); }
detail::child_iterator< NodeRef > iterator
Definition: node.hpp:725

◆ begin() [2/2]

const_iterator c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::begin ( ) const
inlineinherited

get an iterator to the first child

Definition at line 734 of file node.hpp.

734 { _C4RR(); return const_iterator(tree_, tree_->first_child(id_)); }
detail::child_iterator< ConstNodeRef > const_iterator
Definition: node.hpp:726

◆ cbegin()

const_iterator c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::cbegin ( ) const
inlineinherited

get an iterator to the first child

Definition at line 736 of file node.hpp.

736 { _C4RR(); return const_iterator(tree_, tree_->first_child(id_)); }

◆ end() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::end ( ) -> iterator
inlineinherited

get an iterator to after the last child

Definition at line 740 of file node.hpp.

740 { _C4RR(); return iterator(tree__, NONE); }

◆ end() [2/2]

get an iterator to after the last child

Definition at line 742 of file node.hpp.

742 { _C4RR(); return const_iterator(tree_, NONE); }

◆ cend()

const_iterator c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::cend ( ) const
inlineinherited

get an iterator to after the last child

Definition at line 744 of file node.hpp.

744 { _C4RR(); return const_iterator(tree_, tree_->first_child(id_)); }

◆ children() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::children ( ) -> children_view
inlineinherited

get an iterable view over children

Definition at line 748 of file node.hpp.

748 { _C4RR(); return children_view(begin(), end()); }
auto end() RYML_NOEXCEPT -> iterator
get an iterator to after the last child
Definition: node.hpp:740
auto begin() RYML_NOEXCEPT -> iterator
get an iterator to the first child
Definition: node.hpp:732
detail::children_view_< NodeRef > children_view
Definition: node.hpp:727

◆ children() [2/2]

const_children_view c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::children ( ) const
inlineinherited

get an iterable view over children

Definition at line 750 of file node.hpp.

750 { _C4RR(); return const_children_view(begin(), end()); }
detail::children_view_< ConstNodeRef > const_children_view
Definition: node.hpp:728

◆ cchildren()

const_children_view c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::cchildren ( ) const
inlineinherited

get an iterable view over children

Definition at line 752 of file node.hpp.

752 { _C4RR(); return const_children_view(begin(), end()); }

◆ siblings() [1/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::siblings ( ) -> children_view
inlineinherited

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

Definition at line 756 of file node.hpp.

757  {
758  _C4RR();
759  NodeData const *nd = tree__->get(id__);
760  return (nd->m_parent != NONE) ? // does it have a parent?
761  children_view(iterator(tree__, tree_->get(nd->m_parent)->m_first_child), iterator(tree__, NONE))
762  :
763  children_view(end(), end());
764  }

◆ siblings() [2/2]

const_children_view c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::siblings ( ) const
inlineinherited

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

Definition at line 766 of file node.hpp.

767  {
768  _C4RR();
769  NodeData const *nd = tree_->get(id_);
770  return (nd->m_parent != NONE) ? // does it have a parent?
771  const_children_view(const_iterator(tree_, tree_->get(nd->m_parent)->m_first_child), const_iterator(tree_, NONE))
772  :
774  }

◆ csiblings()

const_children_view c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::csiblings ( ) const
inlineinherited

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

Definition at line 776 of file node.hpp.

776 { return siblings(); }
auto siblings() RYML_NOEXCEPT -> children_view
get an iterable view over all siblings (including the calling node)
Definition: node.hpp:756

◆ visit() [1/2]

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::visit ( Visitor  fn,
id_type  indentation_level = 0,
bool  skip_root = true 
) const
inlineinherited

visit every child node calling fn(node)

Definition at line 780 of file node.hpp.

781  {
782  _C4RR();
783  return detail::_visit(*(ConstImpl const*)this, fn, indentation_level, skip_root);
784  }

◆ visit() [2/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::visit ( Visitor  fn,
id_type  indentation_level = 0,
bool  skip_root = true 
) -> bool
inlineinherited

visit every child node calling fn(node)

Definition at line 787 of file node.hpp.

789  {
790  _C4RR();
791  return detail::_visit(*(Impl*)this, fn, indentation_level, skip_root);
792  }

◆ visit_stacked() [1/2]

bool c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::visit_stacked ( Visitor  fn,
id_type  indentation_level = 0,
bool  skip_root = true 
) const
inlineinherited

visit every child node calling fn(node, level)

Definition at line 796 of file node.hpp.

797  {
798  _C4RR();
799  return detail::_visit_stacked(*(ConstImpl const*)this, fn, indentation_level, skip_root);
800  }

◆ visit_stacked() [2/2]

auto c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::visit_stacked ( Visitor  fn,
id_type  indentation_level = 0,
bool  skip_root = true 
) -> bool
inlineinherited

visit every child node calling fn(node, level)

Definition at line 803 of file node.hpp.

805  {
806  _C4RR();
807  return detail::_visit_stacked(*(Impl*)this, fn, indentation_level, skip_root);
808  }

Friends And Related Function Documentation

◆ detail::RoNodeMethods< NodeRef, ConstNodeRef >

friend struct detail::RoNodeMethods< NodeRef, ConstNodeRef >
friend

Definition at line 1003 of file node.hpp.


The documentation for this class was generated from the following files: