Skip to content
Snippets Groups Projects
Commit e8364286 authored by Enrico Guiraud's avatar Enrico Guiraud
Browse files

[DF][NFC] Fix typo in comment

parent 7768b4ea
No related branches found
No related tags found
No related merge requests found
...@@ -74,7 +74,6 @@ static bool ContainsLeaf(const std::set<TLeaf *> &leaves, TLeaf *leaf) ...@@ -74,7 +74,6 @@ static bool ContainsLeaf(const std::set<TLeaf *> &leaves, TLeaf *leaf)
static void UpdateList(std::set<std::string> &bNamesReg, ColumnNames_t &bNames, const std::string &branchName, static void UpdateList(std::set<std::string> &bNamesReg, ColumnNames_t &bNames, const std::string &branchName,
const std::string &friendName) const std::string &friendName)
{ {
if (!friendName.empty()) { if (!friendName.empty()) {
// In case of a friend tree, users might prepend its name/alias to the branch names // In case of a friend tree, users might prepend its name/alias to the branch names
const auto friendBName = friendName + "." + branchName; const auto friendBName = friendName + "." + branchName;
...@@ -87,7 +86,7 @@ static void UpdateList(std::set<std::string> &bNamesReg, ColumnNames_t &bNames, ...@@ -87,7 +86,7 @@ static void UpdateList(std::set<std::string> &bNamesReg, ColumnNames_t &bNames,
} }
/////////////////////////////////////////////////////////////////////////////// ///////////////////////////////////////////////////////////////////////////////
/// This overloads makes sure that the TLeaf has not been already inserted. /// This overload makes sure that the TLeaf has not been already inserted.
static void UpdateList(std::set<std::string> &bNamesReg, ColumnNames_t &bNames, const std::string &branchName, static void UpdateList(std::set<std::string> &bNamesReg, ColumnNames_t &bNames, const std::string &branchName,
const std::string &friendName, std::set<TLeaf *> &foundLeaves, TLeaf *leaf, bool allowDuplicates) const std::string &friendName, std::set<TLeaf *> &foundLeaves, TLeaf *leaf, bool allowDuplicates)
{ {
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment