rapidyaml  0.12.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_style (bool recurse=false)
 
void set_style_conditionally (NodeType type_mask, NodeType rem_style_flags, NodeType add_style_flags, bool recurse=false)
 
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(). 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
 
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...
 
NodeType key_style () const RYML_NOEXCEPT
 Forward to Tree::key_style(). More...
 
NodeType val_style () const RYML_NOEXCEPT
 Forward to Tree::val_style(). 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_children(). 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_other_siblings(). 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::find_child(). More...
 
ConstNodeRef find_child (csubstr name) const RYML_NOEXCEPT
 Forward to Tree::find_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...
 
auto ancestor_doc () RYML_NOEXCEPT -> NodeRef
 Forward to Tree::ancestor_doc(). More...
 
ConstNodeRef ancestor_doc () const RYML_NOEXCEPT
 Forward to Tree::ancestor_doc(). 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...
 
locations
Location location (Parser const &parser) const
 
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 a mutable 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:1035
bool invalid() const noexcept
true if the object is not referring to any existing or seed node.
Definition: node.hpp:1066
bool readable() const noexcept
true if the object is not invalid and not in seed state.
Definition: node.hpp:1070
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 994 of file node.hpp.

Member Typedef Documentation

◆ tree_type

Definition at line 998 of file node.hpp.

◆ base_type

◆ iterator

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

Definition at line 748 of file node.hpp.

◆ const_iterator

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

Definition at line 749 of file node.hpp.

◆ children_view

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

Definition at line 750 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 751 of file node.hpp.

Constructor & Destructor Documentation

◆ NodeRef() [1/9]

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

Definition at line 1035 of file node.hpp.

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

◆ NodeRef() [2/9]

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

Definition at line 1036 of file node.hpp.

1036 : 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 1037 of file node.hpp.

1037 : 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 1038 of file node.hpp.

1038 : 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 1039 of file node.hpp.

1039 : 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 1040 of file node.hpp.

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

◆ NodeRef() [7/9]

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

Definition at line 1041 of file node.hpp.

1041 : 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 1043 of file node.hpp.

1043 { /*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:258

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

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

References c4::yml::NONE.

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

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

References c4::yml::NONE.

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

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

References c4::yml::NONE.

◆ valid()

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

Definition at line 1072 of file node.hpp.

1072 { 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 1081 of file node.hpp.

1082  {
1083  if(m_tree == that.m_tree && m_id == that.m_id)
1084  {
1085  bool seed = is_seed();
1086  if(seed == that.is_seed())
1087  {
1088  if(seed)
1089  {
1090  return (m_seed.len == that.m_seed.len)
1091  && (m_seed.str == that.m_seed.str
1092  || m_seed == that.m_seed); // do strcmp only in the last resort
1093  }
1094  return true;
1095  }
1096  }
1097  return false;
1098  }
bool is_seed() const noexcept
true if the object is not invalid and in seed state.
Definition: node.hpp:1068

References is_seed().

◆ operator!=() [1/2]

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

Definition at line 1099 of file node.hpp.

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

References c4::operator==().

◆ operator==() [2/2]

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

Definition at line 1101 of file node.hpp.

1101 { 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 1102 of file node.hpp.

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

References c4::operator==().

◆ tree() [1/2]

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

Definition at line 1117 of file node.hpp.

1117 { return m_tree; }

◆ tree() [2/2]

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

Definition at line 1118 of file node.hpp.

1118 { return m_tree; }

◆ id()

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

Definition at line 1120 of file node.hpp.

1120 { return m_id; }

◆ create()

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

Definition at line 1129 of file node.hpp.

1129 { _apply_seed(); }

◆ change_type()

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

Definition at line 1131 of file node.hpp.

1131 { _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:940
#define _C4RR()
Definition: node.hpp:1022

References _C4RR.

◆ set_type()

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

Definition at line 1133 of file node.hpp.

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

◆ set_key()

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

Definition at line 1134 of file node.hpp.

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

References c4::yml::key().

◆ set_val()

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

Definition at line 1135 of file node.hpp.

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

◆ set_key_tag()

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

Definition at line 1136 of file node.hpp.

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

◆ set_val_tag()

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

Definition at line 1137 of file node.hpp.

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

◆ set_key_anchor()

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

Definition at line 1138 of file node.hpp.

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

◆ set_val_anchor()

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

Definition at line 1139 of file node.hpp.

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

◆ set_key_ref()

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

Definition at line 1140 of file node.hpp.

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

◆ set_val_ref()

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

Definition at line 1141 of file node.hpp.

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

◆ set_container_style()

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

Definition at line 1143 of file node.hpp.

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

References _C4RR.

◆ set_key_style()

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

Definition at line 1144 of file node.hpp.

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

References _C4RR.

◆ set_val_style()

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

Definition at line 1145 of file node.hpp.

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

References _C4RR.

◆ clear_style()

void c4::yml::NodeRef::clear_style ( bool  recurse = false)
inline

Definition at line 1146 of file node.hpp.

1146 { _C4RR(); m_tree->clear_style(m_id, recurse); }
void clear_style(id_type node, bool recurse=false)
Definition: tree.cpp:1407

References _C4RR.

◆ set_style_conditionally()

void c4::yml::NodeRef::set_style_conditionally ( NodeType  type_mask,
NodeType  rem_style_flags,
NodeType  add_style_flags,
bool  recurse = false 
)
inline

Definition at line 1147 of file node.hpp.

1151  {
1152  _C4RR(); m_tree->set_style_conditionally(m_id, type_mask, rem_style_flags, add_style_flags, recurse);
1153  }
void set_style_conditionally(id_type node, NodeType type_mask, NodeType rem_style_flags, NodeType add_style_flags, bool recurse=false)
Definition: tree.cpp:1417

References _C4RR.

◆ clear()

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

Definition at line 1157 of file node.hpp.

1158  {
1159  if(is_seed())
1160  return;
1161  m_tree->remove_children(m_id);
1162  m_tree->_clear(m_id);
1163  }
void remove_children(id_type node)
remove all the node's children, but keep the node itself
Definition: tree.cpp:918

◆ clear_key()

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

Definition at line 1165 of file node.hpp.

1166  {
1167  if(is_seed())
1168  return;
1169  m_tree->_clear_key(m_id);
1170  }

◆ clear_val()

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

Definition at line 1172 of file node.hpp.

1173  {
1174  if(is_seed())
1175  return;
1176  m_tree->_clear_val(m_id);
1177  }

◆ clear_children()

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

Definition at line 1179 of file node.hpp.

1180  {
1181  if(is_seed())
1182  return;
1183  m_tree->remove_children(m_id);
1184  }

◆ operator=() [3/8]

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

Definition at line 1186 of file node.hpp.

1187  {
1188  _apply_seed();
1189  m_tree->_add_flags(m_id, t);
1190  }

◆ operator|=()

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

Definition at line 1192 of file node.hpp.

1193  {
1194  _apply_seed();
1195  m_tree->_add_flags(m_id, t);
1196  }

◆ operator=() [4/8]

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

Definition at line 1198 of file node.hpp.

1199  {
1200  _apply_seed();
1201  _apply(v);
1202  }

◆ operator=() [5/8]

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

Definition at line 1204 of file node.hpp.

1205  {
1206  _apply_seed();
1207  _apply(v);
1208  }

◆ operator=() [6/8]

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

Definition at line 1210 of file node.hpp.

1211  {
1212  _apply_seed();
1213  _apply(csubstr{});
1214  }

◆ operator=() [7/8]

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

Definition at line 1216 of file node.hpp.

1217  {
1218  _apply_seed();
1219  _apply(v);
1220  }

◆ operator=() [8/8]

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

Definition at line 1223 of file node.hpp.

1224  {
1225  _apply_seed();
1226  csubstr sv;
1227  sv.assign<N>(v);
1228  _apply(sv);
1229  }

◆ to_arena()

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

serialize a variable to the arena

Definition at line 1240 of file node.hpp.

1241  {
1242  _RYML_ASSERT_BASIC(m_tree); // no need for valid or readable
1243  return m_tree->to_arena(s);
1244  }
csubstr to_arena(T const &a)
serialize the given variable to the tree's arena, growing it as needed to accomodate the serializatio...
Definition: tree.hpp:906

◆ set_key_serialized() [1/3]

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

Definition at line 1247 of file node.hpp.

1248  {
1249  _apply_seed();
1250  csubstr s = m_tree->to_arena(k);
1251  m_tree->_set_key(m_id, s);
1252  return s.len;
1253  }

◆ set_key_serialized() [2/3]

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

Definition at line 1254 of file node.hpp.

1255  {
1256  _apply_seed();
1257  m_tree->_set_key(m_id, csubstr{});
1258  return 0;
1259  }

◆ set_val_serialized() [1/3]

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

Definition at line 1262 of file node.hpp.

1263  {
1264  _apply_seed();
1265  csubstr s = m_tree->to_arena(v);
1266  m_tree->_set_val(m_id, s);
1267  return s.len;
1268  }

◆ set_val_serialized() [2/3]

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

Definition at line 1269 of file node.hpp.

1270  {
1271  _apply_seed();
1272  m_tree->_set_val(m_id, csubstr{});
1273  return 0;
1274  }

◆ 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:1240
void set_key(csubstr key)
Definition: node.hpp:1134

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:1135

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

1287  {
1288  // this overload is needed to prevent ambiguity (there's also
1289  // operator<< for writing a substr to a stream)
1290  _apply_seed();
1291  write(this, s);
1292  _RYML_ASSERT_VISIT_(m_tree->m_callbacks, val() == s, m_tree, m_id);
1293  return *this;
1294  }
Callbacks m_callbacks
Definition: tree.hpp:1336
void write(NodeRef *n, T const &v)
Definition: node.hpp:1632

References c4::yml::write().

◆ operator<<() [2/6]

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

Definition at line 1297 of file node.hpp.

1298  {
1299  _apply_seed();
1300  write(this, v);
1301  return *this;
1302  }

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

1307  {
1308  _apply_seed();
1309  set_key_serialized(v.k);
1310  return *this;
1311  }
size_t set_key_serialized(T const &k)
Definition: node.hpp:1247

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

1316  {
1317  _apply_seed();
1318  set_key_serialized(v.k);
1319  return *this;
1320  }

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

◆ operator<<() [5/6]

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

Definition at line 1322 of file node.hpp.

1323  {
1324  set_key_serialized(w.wrapper);
1325  return *this;
1326  }

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

1329  {
1330  set_val_serialized(w);
1331  return *this;
1332  }
size_t set_val_serialized(T const &v)
Definition: node.hpp:1262

◆ insert_child() [1/2]

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

Definition at line 1381 of file node.hpp.

1382  {
1383  _C4RR();
1384  _RYML_ASSERT_VISIT_(m_tree->m_callbacks, after.m_tree == m_tree, m_tree, m_id);
1385  NodeRef r(m_tree, m_tree->insert_child(m_id, after.m_id));
1386  return r;
1387  }
id_type insert_child(id_type parent, id_type after)
create and insert a new child of parent.
Definition: tree.hpp:704

References _C4RR.

◆ insert_child() [2/2]

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

Definition at line 1389 of file node.hpp.

1390  {
1391  _C4RR();
1392  _RYML_ASSERT_VISIT_(m_tree->m_callbacks, after.m_tree == m_tree, m_tree, m_id);
1393  NodeRef r(m_tree, m_tree->insert_child(m_id, after.m_id));
1394  r._apply(i);
1395  return r;
1396  }

References _C4RR.

◆ prepend_child() [1/2]

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

Definition at line 1398 of file node.hpp.

1399  {
1400  _C4RR();
1401  NodeRef r(m_tree, m_tree->insert_child(m_id, NONE));
1402  return r;
1403  }

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

◆ prepend_child() [2/2]

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

Definition at line 1405 of file node.hpp.

1406  {
1407  _C4RR();
1408  NodeRef r(m_tree, m_tree->insert_child(m_id, NONE));
1409  r._apply(i);
1410  return r;
1411  }

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

◆ append_child() [1/2]

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

Definition at line 1413 of file node.hpp.

1414  {
1415  _C4RR();
1416  NodeRef r(m_tree, m_tree->append_child(m_id));
1417  return r;
1418  }
id_type append_child(id_type parent)
create and insert a node as the last child of parent
Definition: tree.hpp:716

References _C4RR.

◆ append_child() [2/2]

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

Definition at line 1420 of file node.hpp.

1421  {
1422  _C4RR();
1423  NodeRef r(m_tree, m_tree->append_child(m_id));
1424  r._apply(i);
1425  return r;
1426  }

References _C4RR.

◆ insert_sibling() [1/2]

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

Definition at line 1428 of file node.hpp.

1429  {
1430  _C4RR();
1431  _RYML_ASSERT_VISIT_(m_tree->m_callbacks, after.m_tree == m_tree, m_tree, m_id);
1432  NodeRef r(m_tree, m_tree->insert_sibling(m_id, after.m_id));
1433  return r;
1434  }
id_type insert_sibling(id_type node, id_type after)
create and insert a new sibling of n. insert after "after"
Definition: tree.hpp:737

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

1437  {
1438  _C4RR();
1439  _RYML_ASSERT_VISIT_(m_tree->m_callbacks, after.m_tree == m_tree, m_tree, m_id);
1440  NodeRef r(m_tree, m_tree->insert_sibling(m_id, after.m_id));
1441  r._apply(i);
1442  return r;
1443  }

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

1446  {
1447  _C4RR();
1448  NodeRef r(m_tree, m_tree->prepend_sibling(m_id));
1449  return r;
1450  }
id_type prepend_sibling(id_type node)
create and insert a node as the first node of parent
Definition: tree.hpp:742

References _C4RR.

◆ prepend_sibling() [2/2]

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

Definition at line 1452 of file node.hpp.

1453  {
1454  _C4RR();
1455  NodeRef r(m_tree, m_tree->prepend_sibling(m_id));
1456  r._apply(i);
1457  return r;
1458  }

References _C4RR.

◆ append_sibling() [1/2]

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

Definition at line 1460 of file node.hpp.

1461  {
1462  _C4RR();
1463  NodeRef r(m_tree, m_tree->append_sibling(m_id));
1464  return r;
1465  }
id_type append_sibling(id_type node)
Definition: tree.hpp:743

References _C4RR.

◆ append_sibling() [2/2]

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

Definition at line 1467 of file node.hpp.

1468  {
1469  _C4RR();
1470  NodeRef r(m_tree, m_tree->append_sibling(m_id));
1471  r._apply(i);
1472  return r;
1473  }

References _C4RR.

◆ remove_child() [1/3]

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

Definition at line 1477 of file node.hpp.

1478  {
1479  _C4RR();
1480  _RYML_ASSERT_VISIT_(m_tree->m_callbacks, has_child(child), m_tree, m_id);
1481  _RYML_ASSERT_VISIT_(m_tree->m_callbacks, child.parent().id() == id(), m_tree, m_id);
1482  m_tree->remove(child.id());
1483  child.clear();
1484  }
void remove(id_type node)
remove an entire branch at once: ie remove the children and the node itself
Definition: tree.hpp:748
bool has_child(ConstNodeRef const &n) const RYML_NOEXCEPT
Forward to Tree::has_child().
Definition: node.hpp:313
auto child(id_type pos) RYML_NOEXCEPT -> NodeRef
Forward to Tree::child().
Definition: node.hpp:351

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

1488  {
1489  _C4RR();
1490  _RYML_ASSERT_VISIT_(m_tree->m_callbacks, pos >= 0 && pos < num_children(), m_tree, m_id);
1491  id_type child = m_tree->child(m_id, pos);
1492  _RYML_ASSERT_VISIT_(m_tree->m_callbacks, child != NONE, m_tree, m_id);
1493  m_tree->remove(child);
1494  }
id_type child(id_type node, id_type pos) const
Definition: tree.cpp:1221
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:244
id_type num_children() const RYML_NOEXCEPT
O(num_children).
Definition: node.hpp:386

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

1498  {
1499  _C4RR();
1500  id_type child = m_tree->find_child(m_id, key);
1501  _RYML_ASSERT_VISIT_(m_tree->m_callbacks, child != NONE, m_tree, m_id);
1502  m_tree->remove(child);
1503  }
id_type find_child(id_type node, csubstr const &key) const
Definition: tree.cpp:1258

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

1512  {
1513  _C4RR();
1514  m_tree->move(m_id, after.m_id);
1515  }
void move(id_type node, id_type after)
change the node's position in the parent
Definition: tree.cpp:819

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

1522  {
1523  _C4RR();
1524  if(parent.m_tree == m_tree)
1525  {
1526  m_tree->move(m_id, parent.m_id, after.m_id);
1527  }
1528  else
1529  {
1530  parent.m_tree->move(m_tree, m_id, parent.m_id, after.m_id);
1531  m_tree = parent.m_tree;
1532  }
1533  }
auto parent() RYML_NOEXCEPT -> NodeRef
Forward to Tree::parent().
Definition: node.hpp:339

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

1540  {
1541  _C4RR();
1542  _RYML_ASSERT_VISIT_(m_tree->m_callbacks, m_tree == after.m_tree || after.m_id == NONE, m_tree, m_id);
1543  id_type dup = m_tree->duplicate(m_id, m_tree->parent(m_id), after.m_id);
1544  NodeRef r(m_tree, dup);
1545  return r;
1546  }
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:959
id_type parent(id_type node) const
Definition: tree.hpp:502

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

1554  {
1555  _C4RR();
1556  _RYML_ASSERT_VISIT_(m_tree->m_callbacks, parent.m_tree == after.m_tree || after.m_id == NONE, m_tree, m_id);
1557  if(parent.m_tree == m_tree)
1558  {
1559  id_type dup = m_tree->duplicate(m_id, parent.m_id, after.m_id);
1560  NodeRef r(m_tree, dup);
1561  return r;
1562  }
1563  else
1564  {
1565  id_type dup = parent.m_tree->duplicate(m_tree, m_id, parent.m_id, after.m_id);
1566  NodeRef r(parent.m_tree, dup);
1567  return r;
1568  }
1569  }

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

1572  {
1573  _C4RR();
1574  _RYML_ASSERT_VISIT_(m_tree->m_callbacks, parent.m_tree == after.m_tree, m_tree, m_id);
1575  if(parent.m_tree == m_tree)
1576  {
1577  m_tree->duplicate_children(m_id, parent.m_id, after.m_id);
1578  }
1579  else
1580  {
1581  parent.m_tree->duplicate_children(m_tree, m_id, parent.m_id, after.m_id);
1582  }
1583  }
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:981

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

201 { 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 205 of file node.hpp.

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

◆ type()

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

Forward to Tree::type().

Node must be readable.

Definition at line 207 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 208 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 210 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 211 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 212 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 213 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 215 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 216 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 217 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 218 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 220 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 221 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 223 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 224 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 226 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 227 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 236 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 237 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 238 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 239 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 240 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 241 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 242 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 243 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 244 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 245 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 246 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 247 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 248 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 249 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 250 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 251 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 252 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 253 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 254 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 255 of file node.hpp.

◆ is_key_anchor()

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

Definition at line 257 of file node.hpp.

257 { _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 258 of file node.hpp.

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

◆ is_anchor()

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

Definition at line 259 of file node.hpp.

259 { _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 260 of file node.hpp.

260 { _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 271 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 272 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 273 of file node.hpp.

◆ key_style()

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

Forward to Tree::key_style().

Node must be readable.

Definition at line 275 of file node.hpp.

◆ val_style()

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

Forward to Tree::val_style().

Node must be readable.

Definition at line 276 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 278 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 279 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 280 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 281 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 282 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 284 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 285 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 286 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 287 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 288 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 289 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 290 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 291 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 292 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 293 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 294 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 295 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 296 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 297 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 298 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 309 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 310 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 311 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 313 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 314 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 315 of file node.hpp.

◆ has_children()

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

Forward to Tree::has_children().

Node must be readable.

Definition at line 316 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 318 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 319 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 320 of file node.hpp.

◆ has_other_siblings()

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

Forward to Tree::has_other_siblings().

Node must be readable.

Definition at line 321 of file node.hpp.

◆ has_siblings()

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

Definition at line 323 of file node.hpp.

323 { _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 335 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 336 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 339 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 340 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 343 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 344 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 347 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 348 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 351 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 352 of file node.hpp.

◆ find_child() [1/2]

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

Forward to Tree::find_child().

Node must be readable.

Definition at line 355 of file node.hpp.

◆ find_child() [2/2]

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

Forward to Tree::find_child().

Node must be readable.

Definition at line 356 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 359 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 360 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 363 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 364 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 367 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 368 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 371 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 372 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 375 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 376 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 379 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 380 of file node.hpp.

◆ ancestor_doc() [1/2]

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

Forward to Tree::ancestor_doc().

Node must be readable.

Definition at line 383 of file node.hpp.

◆ ancestor_doc() [2/2]

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

Forward to Tree::ancestor_doc().

Node must be readable.

Definition at line 384 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 386 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 387 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 388 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 389 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 390 of file node.hpp.

◆ depth_asc()

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

Definition at line 392 of file node.hpp.

392 { _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 393 of file node.hpp.

393 { _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 422 of file node.hpp.

423  {
424  _C4RR();
425  id_type ch = tree__->find_child(id__, key);
426  return ch != NONE ? Impl(tree__, ch) : Impl(tree__, id__, key);
427  }

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

449  {
450  _C4RR();
451  id_type ch = tree__->child(id__, pos);
452  return ch != NONE ? Impl(tree__, ch) : Impl(tree__, id__, pos);
453  }

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

465  {
466  _C4RR();
467  id_type ch = tree_->find_child(id_, key);
468  _RYML_ASSERT_VISIT_(tree_->m_callbacks, ch != NONE, tree_, id_);
469  return {tree_, ch};
470  }

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

482  {
483  _C4RR();
484  id_type ch = tree_->child(id_, pos);
485  _RYML_ASSERT_VISIT_(tree_->m_callbacks, ch != NONE, tree_, id_);
486  return {tree_, ch};
487  }

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

530  {
531  _RYML_CHECK_BASIC(tree_ != nullptr);
532  _RYML_CHECK_VISIT_(tree_->m_callbacks, (id_ >= 0 && id_ < tree_->capacity()), tree_, id_);
533  _RYML_CHECK_VISIT_(tree_->m_callbacks, ((Impl const*)this)->readable(), tree_, id_);
534  _RYML_CHECK_VISIT_(tree_->m_callbacks, tree_->is_map(id_), tree_, id_);
535  id_type ch = tree__->find_child(id__, key);
536  return ch != NONE ? Impl(tree__, ch) : Impl(tree__, id__, key);
537  }

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

566  {
567  _RYML_CHECK_BASIC(tree_ != nullptr);
568  const id_type cap = tree_->capacity();
569  _RYML_CHECK_VISIT_(tree_->m_callbacks, (id_ >= 0 && id_ < cap), tree_, id_);
570  _RYML_CHECK_VISIT_(tree_->m_callbacks, (pos >= 0 && pos < cap), tree_, id_);
571  _RYML_CHECK_VISIT_(tree_->m_callbacks, ((Impl const*)this)->readable(), tree_, id_);
572  _RYML_CHECK_VISIT_(tree_->m_callbacks, tree_->is_container(id_), tree_, id_);
573  id_type ch = tree__->child(id__, pos);
574  return ch != NONE ? Impl(tree__, ch) : Impl(tree__, id__, pos);
575  }

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

587  {
588  _RYML_CHECK_BASIC(tree_ != nullptr);
589  _RYML_CHECK_VISIT_(tree_->m_callbacks, (id_ >= 0 && id_ < tree_->capacity()), tree_, id_);
590  _RYML_CHECK_VISIT_(tree_->m_callbacks, ((Impl const*)this)->readable(), tree_, id_);
591  _RYML_CHECK_VISIT_(tree_->m_callbacks, tree_->is_map(id_), tree_, id_);
592  id_type ch = tree_->find_child(id_, key);
593  _RYML_CHECK_VISIT_(tree_->m_callbacks, ch != NONE, tree_, id_);
594  return {tree_, ch};
595  }

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

607  {
608  _RYML_CHECK_BASIC(tree_ != nullptr);
609  const id_type cap = tree_->capacity();
610  _RYML_CHECK_VISIT_(tree_->m_callbacks, (id_ >= 0 && id_ < cap), tree_, id_);
611  _RYML_CHECK_VISIT_(tree_->m_callbacks, (pos >= 0 && pos < cap), tree_, id_);
612  _RYML_CHECK_VISIT_(tree_->m_callbacks, ((Impl const*)this)->readable(), tree_, id_);
613  _RYML_CHECK_VISIT_(tree_->m_callbacks, tree_->is_container(id_), tree_, id_);
614  const id_type ch = tree_->child(id_, pos);
615  _RYML_CHECK_VISIT_(tree_->m_callbacks, ch != NONE, tree_, id_);
616  return {tree_, ch};
617  }

◆ location()

Location c4::yml::detail::RoNodeMethods< NodeRef , ConstNodeRef >::location ( Parser const &  parser) const
inlineinherited

Definition at line 626 of file node.hpp.

627  {
628  _C4RR();
629  return tree_->location(parser, id_);
630  }

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

643  {
644  _C4RR();
645  if( ! read((ConstImpl const&)*this, &v))
646  _RYML_ERR_VISIT_(tree_->m_callbacks, tree_, id_, "could not deserialize value");
647  return *((ConstImpl const*)this);
648  }
bool read(NodeRef const &n, T *v)
Definition: node.hpp:1644

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

655  {
656  _C4RR();
657  if( ! readkey((ConstImpl const&)*this, &v.k))
658  _RYML_ERR_VISIT_(tree_->m_callbacks, tree_, id_, "could not deserialize key");
659  return *((ConstImpl const*)this);
660  }
bool readkey(NodeRef const &n, T *v)
Definition: node.hpp:1656

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

700  {
701  deserialize_key(w.wrapper);
702  return *((ConstImpl const*)this);
703  }
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:715

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

707  {
708  deserialize_val(w);
709  return *((ConstImpl const*)this);
710  }
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:723

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

666  {
667  _C4RR();
668  ConstImpl ch = find_child(name);
669  if(!ch.readable())
670  return false;
671  ch >> *var;
672  return true;
673  }
auto find_child(csubstr name) RYML_NOEXCEPT -> NodeRef
Forward to Tree::find_child().
Definition: node.hpp:355

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

680  {
681  _C4RR();
682  ConstImpl ch = find_child(name);
683  if(ch.readable())
684  {
685  ch >> *var;
686  return true;
687  }
688  else
689  {
690  *var = fallback;
691  return false;
692  }
693  }

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

716  {
717  _C4RR();
718  return from_chars(key(), &v);
719  }
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 723 of file node.hpp.

724  {
725  _C4RR();
726  return from_chars(val(), &v);
727  };

◆ begin() [1/2]

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

get a mutable iterator to the first child.

NOT AVAILABLE for ConstNodeRef.

Definition at line 754 of file node.hpp.

◆ begin() [2/2]

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

get an iterator to the first child

Definition at line 755 of file node.hpp.

◆ cbegin()

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

get an iterator to the first child

Definition at line 756 of file node.hpp.

◆ end() [1/2]

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

get an iterator to after the last child.

NOT AVAILABLE for ConstNodeRef.

Definition at line 759 of file node.hpp.

◆ end() [2/2]

get an iterator to after the last child

get an iterator to after the last child

Definition at line 761 of file node.hpp.

◆ cend()

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

get an iterator to after the last child

get an iterator to after the last child

Definition at line 763 of file node.hpp.

◆ children() [1/2]

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

get an iterable view over children.

NOT AVAILABLE for ConstNodeRef.

Definition at line 766 of file node.hpp.

◆ children() [2/2]

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

get an iterable view over children

Definition at line 767 of file node.hpp.

◆ cchildren()

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

get an iterable view over children

Definition at line 768 of file node.hpp.

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

773  {
774  _C4RR();
775  NodeData const *nd = tree__->get(id__);
776  return (nd->m_parent != NONE) ? // does it have a parent?
777  children_view(iterator(tree__, tree_->get(nd->m_parent)->m_first_child), iterator(tree__, NONE))
778  :
779  children_view(end(), end());
780  }
detail::child_iterator< NodeRef > iterator
Definition: node.hpp:748
auto end() RYML_NOEXCEPT -> iterator
get an iterator to after the last child.
Definition: node.hpp:759
detail::children_view_< NodeRef > children_view
Definition: node.hpp:750

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

783  {
784  _C4RR();
785  NodeData const *nd = tree_->get(id_);
786  return (nd->m_parent != NONE) ? // does it have a parent?
787  const_children_view(const_iterator(tree_, tree_->get(nd->m_parent)->m_first_child), const_iterator(tree_, NONE))
788  :
790  }
detail::children_view_< ConstNodeRef > const_children_view
Definition: node.hpp:751
detail::child_iterator< ConstNodeRef > const_iterator
Definition: node.hpp:749

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

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

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

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

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

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

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

813  {
814  _C4RR();
815  return detail::_visit_stacked(*(ConstImpl const*)this, fn, indentation_level, skip_root);
816  }

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

821  {
822  _C4RR();
823  return detail::_visit_stacked(*(Impl*)this, fn, indentation_level, skip_root);
824  }

Friends And Related Function Documentation

◆ detail::RoNodeMethods< NodeRef, ConstNodeRef >

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

Definition at line 1018 of file node.hpp.


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