From 9ee7facf01a76860ce253188a6a254a0a39941cf Mon Sep 17 00:00:00 2001
From: Thomas Applencourt <apl@anl.gov>
Date: Wed, 24 Jul 2024 18:28:31 +0000
Subject: [PATCH] consistancy

---
 xprof/btx_tally.hpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/xprof/btx_tally.hpp b/xprof/btx_tally.hpp
index 95902238..2f123b66 100644
--- a/xprof/btx_tally.hpp
+++ b/xprof/btx_tally.hpp
@@ -147,7 +147,7 @@ auto aggregate_by_name(std::unordered_map<std::tuple<T...>, TC> &m) {
 */
 
 // Base case to stop recursion
-inline void _get_uniq_tally(std::set<std::tuple<>>, std::vector<size_t> &) {}
+inline void _get_uniq_tally(std::set<std::tuple<>> &, std::vector<size_t> &) {}
 // General recursive case
 template <class... T> void _get_uniq_tally(std::set<std::tuple<T...>> &s, std::vector<size_t> &v) {
   v.push_back(s.size());
@@ -157,7 +157,7 @@ template <class... T> void _get_uniq_tally(std::set<std::tuple<T...>> &s, std::v
     s_reduced.insert(make_tuple_without_last(t));
   _get_uniq_tally(s_reduced, v);
 }
-// Exposed Class
+// Exposed function
 template <class... T, class K> auto get_uniq_tally(std::unordered_map<std::tuple<T...>, K> &m) {
   // Map to Set. Can remove the last elements who is the `api name`
   typedef decltype(make_tuple_without_last(std::declval<std::tuple<T...>>())) Minusone;