From 4a1f4360f90635f22f3eabddfb42ea6d989bfaf4 Mon Sep 17 00:00:00 2001 From: lespeholt Date: Mon, 19 May 2014 19:46:50 +0200 Subject: [PATCH] Renaming bug fix leftmost_leaf_in_the_subtree -> leftmost_leaf --- include/sdsl/cst_iterators.hpp | 2 +- include/sdsl/cst_sada.hpp | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/include/sdsl/cst_iterators.hpp b/include/sdsl/cst_iterators.hpp index dfe36bc33..e531a44aa 100644 --- a/include/sdsl/cst_iterators.hpp +++ b/include/sdsl/cst_iterators.hpp @@ -218,7 +218,7 @@ class cst_bottom_up_const_forward_iterator: public std::iteratorroot()) { // if no next right sibling exist m_v = m_cst->parent(m_v); // go to parent } else { // if next right sibling exist - m_v = m_cst->leftmost_leaf_in_the_subtree(w); // go to leaftmost leaf in the subtree of w + m_v = m_cst->leftmost_leaf(w); // go to leaftmost leaf in the subtree of w } return *this; } diff --git a/include/sdsl/cst_sada.hpp b/include/sdsl/cst_sada.hpp index 6c33ad38f..22e7d4a41 100644 --- a/include/sdsl/cst_sada.hpp +++ b/include/sdsl/cst_sada.hpp @@ -264,7 +264,7 @@ class cst_sada const_bottom_up_iterator begin_bottom_up()const { if (0 == m_bp.size()) // special case: tree is uninitialized return end_bottom_up(); - return const_bottom_up_iterator(this, leftmost_leaf_in_the_subtree(root())); + return const_bottom_up_iterator(this, leftmost_leaf(root())); } //! Returns an iterator to the element after the last element of a bottom-up traversal of the tree.