Merge branch 'remove-redundant-typenames' of https://github.com/Shara…

…fMohamed/log-surgeon into remove-redundant-typenames
y-scope · Jan 6, 2025 · b4d25bb · b4d25bb
2 parents beb59aa + 68ed2b1
commit b4d25bb
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 4 deletions.
diff --git a/src/log_surgeon/finite_automata/RegexDFAStatePair.hpp b/src/log_surgeon/finite_automata/RegexDFAStatePair.hpp
@@ -27,7 +27,6 @@ class RegexDFAStatePair {
               m_state2(state2) {};
 
     /**
-     * Used for ordering in a set by considering the states' addresses.
      * @param rhs
      * @return Whether `m_state1` in lhs has a lower address than in rhs, or if they're equal,
      * whether `m_state2` in lhs has a lower address than in rhs.
@@ -73,7 +72,7 @@ auto RegexDFAStatePair<DFAState>::get_reachable_pairs(
         auto next_state1 = m_state1->next(i);
         auto next_state2 = m_state2->next(i);
         if (next_state1 != nullptr && next_state2 != nullptr) {
-            RegexDFAStatePair reachable_pair{next_state1, next_state2};
+            RegexDFAStatePair const reachable_pair{next_state1, next_state2};
             if (visited_pairs.count(reachable_pair) == 0) {
                 unvisited_pairs.insert(reachable_pair);
             }

diff --git a/src/log_surgeon/finite_automata/RegexNFAState.hpp b/src/log_surgeon/finite_automata/RegexNFAState.hpp
@@ -88,8 +88,8 @@ class RegexNFAState {
     auto get_tree_transitions() -> Tree const& { return m_tree_transitions; }
 
     /**
-     Add `dest_state` to `m_bytes_transitions` if all values in interval are a byte, otherwise add
-     `dest_state` to `m_tree_transitions`.
+     * Add `dest_state` to `m_bytes_transitions` if all values in interval are a byte, otherwise add
+     * `dest_state` to `m_tree_transitions`.
      * @param interval
      * @param dest_state
      */