@@ -201,7 +201,7 @@ struct RoNodeMethods
201201 template <class U =Impl>
202202 C4_ALWAYS_INLINE auto get () RYML_NOEXCEPT -> _C4_IF_MUTABLE(NodeData*) { return ((Impl const *)this )->readable () ? tree__->get (id__) : nullptr ; }
203203
204- C4_ALWAYS_INLINE NodeType type () const RYML_NOEXCEPT { _C4RR (); return tree_->type (id_); } /* *< Forward to @ref Tree::type_str (). Node must be readable. */
204+ C4_ALWAYS_INLINE NodeType type () const RYML_NOEXCEPT { _C4RR (); return tree_->type (id_); } /* *< Forward to @ref Tree::type (). Node must be readable. */
205205 C4_ALWAYS_INLINE const char * type_str () const RYML_NOEXCEPT { _C4RR (); return tree_->type_str (id_); } /* *< Forward to @ref Tree::type_str(). Node must be readable. */
206206
207207 C4_ALWAYS_INLINE csubstr key () const RYML_NOEXCEPT { _C4RR (); return tree_->key (id_); } /* *< Forward to @ref Tree::key(). Node must be readable. */
@@ -310,12 +310,12 @@ struct RoNodeMethods
310310 C4_ALWAYS_INLINE bool has_child (ConstImpl const & n) const RYML_NOEXCEPT { _C4RR (); return n.readable () ? tree_->has_child (id_, n.m_id ) : false ; } /* *< Forward to @ref Tree::has_child(). Node must be readable. */
311311 C4_ALWAYS_INLINE bool has_child (id_type node) const RYML_NOEXCEPT { _C4RR (); return tree_->has_child (id_, node); } /* *< Forward to @ref Tree::has_child(). Node must be readable. */
312312 C4_ALWAYS_INLINE bool has_child (csubstr name) const RYML_NOEXCEPT { _C4RR (); return tree_->has_child (id_, name); } /* *< Forward to @ref Tree::has_child(). Node must be readable. */
313- C4_ALWAYS_INLINE bool has_children () const RYML_NOEXCEPT { _C4RR (); return tree_->has_children (id_); } /* *< Forward to @ref Tree::has_child (). Node must be readable. */
313+ C4_ALWAYS_INLINE bool has_children () const RYML_NOEXCEPT { _C4RR (); return tree_->has_children (id_); } /* *< Forward to @ref Tree::has_children (). Node must be readable. */
314314
315315 C4_ALWAYS_INLINE bool has_sibling (ConstImpl const & n) const RYML_NOEXCEPT { _C4RR (); return n.readable () ? tree_->has_sibling (id_, n.m_id ) : false ; } /* *< Forward to @ref Tree::has_sibling(). Node must be readable. */
316316 C4_ALWAYS_INLINE bool has_sibling (id_type node) const RYML_NOEXCEPT { _C4RR (); return tree_->has_sibling (id_, node); } /* *< Forward to @ref Tree::has_sibling(). Node must be readable. */
317317 C4_ALWAYS_INLINE bool has_sibling (csubstr name) const RYML_NOEXCEPT { _C4RR (); return tree_->has_sibling (id_, name); } /* *< Forward to @ref Tree::has_sibling(). Node must be readable. */
318- C4_ALWAYS_INLINE bool has_other_siblings () const RYML_NOEXCEPT { _C4RR (); return tree_->has_other_siblings (id_); } /* *< Forward to @ref Tree::has_sibling (). Node must be readable. */
318+ C4_ALWAYS_INLINE bool has_other_siblings () const RYML_NOEXCEPT { _C4RR (); return tree_->has_other_siblings (id_); } /* *< Forward to @ref Tree::has_other_siblings (). Node must be readable. */
319319
320320 RYML_DEPRECATED (" use has_other_siblings()" ) bool has_siblings () const RYML_NOEXCEPT { _C4RR (); return tree_->has_siblings (id_); }
321321
@@ -349,8 +349,8 @@ struct RoNodeMethods
349349 C4_ALWAYS_INLINE ConstImpl child (id_type pos) const RYML_NOEXCEPT { _C4RR (); return {tree_, tree_->child (id_, pos)}; } /* *< Forward to @ref Tree::child(). Node must be readable. */
350350
351351 template <class U =Impl>
352- C4_ALWAYS_INLINE auto find_child (csubstr name) RYML_NOEXCEPT -> _C4_IF_MUTABLE(Impl) { _C4RR (); return {tree__, tree__->find_child (id__, name)}; } /* *< Forward to @ref Tree::first_child (). Node must be readable. */
353- C4_ALWAYS_INLINE ConstImpl find_child (csubstr name) const RYML_NOEXCEPT { _C4RR (); return {tree_, tree_->find_child (id_, name)}; } /* *< Forward to @ref Tree::first_child (). Node must be readable. */
352+ C4_ALWAYS_INLINE auto find_child (csubstr name) RYML_NOEXCEPT -> _C4_IF_MUTABLE(Impl) { _C4RR (); return {tree__, tree__->find_child (id__, name)}; } /* *< Forward to @ref Tree::find_child (). Node must be readable. */
353+ C4_ALWAYS_INLINE ConstImpl find_child (csubstr name) const RYML_NOEXCEPT { _C4RR (); return {tree_, tree_->find_child (id_, name)}; } /* *< Forward to @ref Tree::find_child (). Node must be readable. */
354354
355355 template <class U =Impl>
356356 C4_ALWAYS_INLINE auto prev_sibling () RYML_NOEXCEPT -> _C4_IF_MUTABLE(Impl) { _C4RR (); return {tree__, tree__->prev_sibling (id__)}; } /* *< Forward to @ref Tree::prev_sibling(). Node must be readable. */
0 commit comments