|
|
| NodeType | type () const RYML_NOEXCEPT |
| | Forward to Tree::type(). 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...
|
| |
|
| 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 | type_has_any (type_bits bits) const RYML_NOEXCEPT |
| | Forward to Tree::type_has_any(). More...
|
| |
| bool | type_has_all (type_bits bits) const RYML_NOEXCEPT |
| | Forward to Tree::type_has_all(). More...
|
| |
| bool | type_has_none (type_bits 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 () const RYML_NOEXCEPT |
| | Forward to Tree::is_flow(). 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_ml1(). More...
|
| |
| bool | is_flow_ml1 () const RYML_NOEXCEPT |
| | Forward to Tree::is_flow_ml1(). More...
|
| |
| bool | is_flow_mln () const RYML_NOEXCEPT |
| | Forward to Tree::is_flow_mln(). More...
|
| |
| bool | is_flow_mlx () const RYML_NOEXCEPT |
| | Forward to Tree::is_flow_mlx(). More...
|
| |
| bool | has_flow_space () const RYML_NOEXCEPT |
| | Forward to Tree::has_flow_space(). 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...
|
| |
|
| 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 (ConstImpl const &ancestor) const RYML_NOEXCEPT |
| | Forward to Tree::is_ancestor() Node must be readable. More...
|
| |
| bool | has_child (ConstImpl 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 (ConstImpl 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...
|
| |
|
| 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 (ConstImpl const &n) const RYML_NOEXCEPT |
| | O(num_children). More...
|
| |
| id_type | sibling_pos (ConstImpl 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...
|
| |
|
O(num_nodes).
Forward to Tree::depth_desc(). Node must be readable.
|
| Location | location (Parser const &parser) const |
| |
|
These methods raise an error if the deserialization failed or optionally if the node is not readable.
|
| template<class T > |
| void | load (T *v, bool check_readable=true) const |
| | (1) deserialize the node's contents (val or container) to the given variable, forwarding to the user-overrideable read() function, which can be for ConstNodeRef (see Read from ConstNodeRef) or for tree+id (see Read from Tree). More...
|
| |
| template<class Wrapper > |
| void | load (Wrapper const &wrapper, bool check_readable=true) const |
| | (2) like (1), but for wrapper tag types such as c4::fmt::base64() More...
|
| |
| template<class T > |
| void | load_key (T *k, bool check_readable=true) const |
| | (1) deserialize the node's key (necessarily a scalar) to the given variable, forwarding to the user-overrideable read_key() function, which can be for ConstNodeRef (see Read from ConstNodeRef) or for tree+id (see Read from Tree). More...
|
| |
| template<class Wrapper > |
| void | load_key (Wrapper const &wrapper, bool check_readable=true) const |
| | (2) like (1), but for wrapper tag types such as c4::fmt::base64() More...
|
| |
|
| template<class T > |
| ReadResult | deserialize (T *v) const |
| | (1) deserialize the node's contents (val or container) to the given variable, forwarding to the user-overrideable read() function (see Read from ConstNodeRef). More...
|
| |
| template<class Wrapper > |
| ReadResult | deserialize (Wrapper const &wrapper) const |
| | (2) like (1), but for wrapper tag types such as c4::fmt::base64() More...
|
| |
| template<class T > |
| ReadResult | deserialize_key (T *v) const |
| | (1) deserialize the node's key (necessarily a scalar) to the given variable, forwarding to the user-overrideable read_key() function (see Read from ConstNodeRef). More...
|
| |
| template<class Wrapper > |
| ReadResult | deserialize_key (Wrapper const &wrapper) const |
| | (2) like (1), but for wrapper tag types such as c4::fmt::base64() More...
|
| |
|
| template<class T > |
| ReadResult | deserialize_child (csubstr child_key, T *v) const |
| | (1) find a child by name and deserialize its contents to the given variable (ie call .deserialize() on the child if it exists). More...
|
| |
| template<class T > |
| ReadResult | deserialize_child (csubstr child_key, T *v, T const &fallback) const |
| | (2) like (1), but assign from fallback if no such child exists. More...
|
| |
| template<class Wrapper > |
| ReadResult | deserialize_child (csubstr child_key, Wrapper const &v) const |
| | (3) like (1), but for wrapper tag types such as c4::fmt::base64() More...
|
| |
| template<class T > |
| ReadResult | deserialize_child (id_type child_pos, T *v) const |
| | (1) find a child by position and deserialize its contents to the given variable (ie call .deserialize() on the child if it exists). More...
|
| |
| template<class T > |
| ReadResult | deserialize_child (id_type child_pos, T *v, T const &fallback) const |
| | (2) like (1), but assign from fallback if no such child exists More...
|
| |
| template<class Wrapper > |
| ReadResult | deserialize_child (id_type child_pos, Wrapper const &wrapper) const |
| | (3) like (1), but for wrapper tag types such as c4::fmt::base64() More...
|
| |
|
| template<class T > |
| Impl const & | operator>> (T &v) const |
| |
| template<class T > |
| Impl const & | operator>> (T const &wrapper) const |
| |
| template<class T > |
| Impl const & | operator>> (Key< T > const &v) const |
| |
template<class Impl, class ConstImpl>
struct c4::yml::detail::RoNodeMethods< Impl, ConstImpl >
a CRTP base providing read-only methods for ConstNodeRef and NodeRef
Definition at line 152 of file node.hpp.