@@ -1755,7 +1755,7 @@ void te_parser::next_token(te_parser::state* theState)
17551755 std::advance (theState->m_next , 2 );
17561756 }
17571757#else
1758- // if rotation is not availble , error if used in formula
1758+ // if rotation is not available , error if used in formula
17591759 else if ((tok == ' <' && (*theState->m_next == ' <' ) &&
17601760 (*std::next (theState->m_next ) == ' <' )) ||
17611761 (tok == ' >' && (*theState->m_next == ' >' ) &&
@@ -2208,12 +2208,12 @@ te_expr* te_parser::expr_level9(te_parser::state* theState)
22082208 return ret;
22092209 }
22102210
2211- // Higher levels of operator precendence :
2211+ // Higher levels of operator precedence :
22122212// --------------------------------------------------
22132213te_expr* te_parser::term (te_parser::state* theState)
22142214 {
22152215 /* <term> = <factor> {("*" | "/" | "%") <factor>} */
2216- // third from highest level of operator precendence
2216+ // third from highest level of operator precedence
22172217 te_expr* ret = factor (theState);
22182218
22192219 while (theState->m_type == te_parser::state::token_type::TOK_INFIX &&
@@ -2235,7 +2235,7 @@ te_expr* te_parser::term(te_parser::state* theState)
22352235te_expr* te_parser::factor (te_parser::state* theState)
22362236 {
22372237 /* <factor> = <power> {"^" <power>} */
2238- // second from highest level of operator precendence
2238+ // second from highest level of operator precedence
22392239 te_expr* ret = power (theState);
22402240
22412241 int neg{ 0 };
@@ -2282,7 +2282,7 @@ te_expr* te_parser::factor(te_parser::state* theState)
22822282te_expr* te_parser::factor (te_parser::state* theState)
22832283 {
22842284 /* <factor> = <power> {"^" <power>} */
2285- // second from highest level of operator precendence
2285+ // second from highest level of operator precedence
22862286 te_expr* ret = power (theState);
22872287
22882288 while (theState->m_type == te_parser::state::token_type::TOK_INFIX &&
@@ -2302,7 +2302,7 @@ te_expr* te_parser::factor(te_parser::state* theState)
23022302te_expr* te_parser::power (te_parser::state* theState)
23032303 {
23042304 /* <power> = {("-" | "+")} <base> */
2305- // highest level of operator precendence
2305+ // highest level of operator precedence
23062306 int theSign{ 1 };
23072307 bool bitwiseNot{ false };
23082308 while (theState->m_type == te_parser::state::token_type::TOK_INFIX &&
@@ -2566,15 +2566,15 @@ te_type te_parser::evaluate()
25662566 {
25672567 m_parseSuccess = false ;
25682568 m_errorPos = 0 ;
2569- m_lastErrorMessage = " Expression is emtpy ." ;
2569+ m_lastErrorMessage = " Expression is empty ." ;
25702570 }
25712571 m_result = (m_compiledExpression != nullptr ) ? te_eval (m_compiledExpression) : te_nan;
25722572 }
2573- catch (const std::exception& expt )
2573+ catch (const std::exception& except )
25742574 {
25752575 m_parseSuccess = false ;
25762576 m_result = te_nan;
2577- m_lastErrorMessage = expt .what ();
2577+ m_lastErrorMessage = except .what ();
25782578 }
25792579
25802580 reset_usr_resolved_if_necessary ();
@@ -2595,7 +2595,7 @@ te_parser::evaluate(const std::string_view expression) // NOLINT(-readability-id
25952595 {
25962596 m_parseSuccess = false ;
25972597 m_errorPos = 0 ;
2598- m_lastErrorMessage = " Expression is emtpy ." ;
2598+ m_lastErrorMessage = " Expression is empty ." ;
25992599 }
26002600
26012601 return te_nan;
@@ -2622,7 +2622,7 @@ std::string te_parser::list_available_functions_and_variables()
26222622// cppcheck-suppress unusedFunction
26232623std::string te_parser::info ()
26242624 {
2625- std::string sysInfo{ " tinyexpr ++ system info:\n =======================\n " };
2625+ std::string sysInfo{ " TinyExpr ++ system info:\n =======================\n " };
26262626#ifdef TE_FLOAT
26272627 sysInfo += " Data type: float\n " ;
26282628#elif defined(TE_LONG_DOUBLE)
0 commit comments