@@ -795,9 +795,9 @@ void Pattern::parse(
795
795
bol_ = false ;
796
796
bool quote = false ;
797
797
#ifdef WITH_TREE_DFA
798
- DFA::State *t = tfa_.start ();
798
+ DFA::State *r = tfa_.start ();
799
799
#else
800
- Tree::Node *t = tfa_.root ();
800
+ Tree::Node *r = tfa_.root ();
801
801
#endif
802
802
while (loc < end)
803
803
{
@@ -830,29 +830,29 @@ void Pattern::parse(
830
830
c = lowercase (c);
831
831
}
832
832
#ifdef WITH_TREE_DFA
833
- DFA::State::Edges::iterator i = t ->edges .find (c);
834
- if (i == t ->edges .end ())
833
+ DFA::State::Edges::iterator i = r ->edges .find (c);
834
+ if (i == r ->edges .end ())
835
835
{
836
836
if (last_state == NULL )
837
- last_state = t ; // t points to the tree DFA start state
837
+ last_state = r ; // r points to the tree DFA root ( start state)
838
838
DFA::State *target_state = last_state = last_state->next = tfa_.state ();
839
- t ->edges [c] = DFA::State::Edge (c, target_state);
840
- t = target_state;
839
+ r ->edges [c] = DFA::State::Edge (c, target_state);
840
+ r = target_state;
841
841
++eno_;
842
842
++vno_;
843
843
if (vno_ > DFA::MAX_STATES)
844
844
error (regex_error::exceeds_limits, loc);
845
845
}
846
846
else
847
847
{
848
- t = i->second .second ;
848
+ r = i->second .second ;
849
849
}
850
850
#else
851
- t = tfa_.edge (t , c);
851
+ r = tfa_.edge (r , c);
852
852
#endif
853
853
}
854
- if (t ->accept == 0 )
855
- t ->accept = choice;
854
+ if (r ->accept == 0 )
855
+ r ->accept = choice;
856
856
#ifdef WITH_TREE_DFA
857
857
acc_.resize (choice, false );
858
858
acc_[choice - 1 ] = true ;
@@ -1165,12 +1165,12 @@ void Pattern::parse3(
1165
1165
}
1166
1166
else if (c == ' {' ) // {n,m} repeat min n times to max m
1167
1167
{
1168
- size_t k = 0 ;
1168
+ size_t d = 0 ;
1169
1169
for (Location i = 0 ; i < 7 && std::isdigit (c = at (++loc)); ++i)
1170
- k = 10 * k + (c - ' 0' );
1171
- if (k > Position::MAXITER)
1170
+ d = 10 * d + (c - ' 0' );
1171
+ if (d > Position::MAXITER)
1172
1172
error (regex_error::exceeds_limits, loc);
1173
- Iter n = static_cast <Iter>(k );
1173
+ Iter n = static_cast <Iter>(d );
1174
1174
Iter m = n;
1175
1175
bool unlimited = false ;
1176
1176
if (at (loc) == ' ,' )
@@ -2378,9 +2378,9 @@ void Pattern::compile_transition(
2378
2378
error (regex_error::exceeds_limits, loc);
2379
2379
state->heads .insert (l);
2380
2380
}
2381
- Lookahead k = n;
2381
+ Lookahead l = n;
2382
2382
n += static_cast <Lookahead>(i->second .size ());
2383
- if (n < k )
2383
+ if (n < l )
2384
2384
error (regex_error::exceeds_limits, loc);
2385
2385
}
2386
2386
}
@@ -2402,9 +2402,9 @@ void Pattern::compile_transition(
2402
2402
error (regex_error::exceeds_limits, loc);
2403
2403
state->tails .insert (l);
2404
2404
}
2405
- Lookahead k = n;
2405
+ Lookahead l = n;
2406
2406
n += static_cast <Lookahead>(i->second .size ());
2407
- if (n < k )
2407
+ if (n < l )
2408
2408
error (regex_error::exceeds_limits, loc);
2409
2409
}
2410
2410
}
@@ -3049,9 +3049,9 @@ void Pattern::encode_dfa(DFA::State *start)
3049
3049
void Pattern::gencode_dfa (const DFA::State *start) const
3050
3050
{
3051
3051
#ifndef WITH_NO_CODEGEN
3052
- for (std::vector<std::string>::const_iterator i = opt_.f .begin (); i != opt_.f .end (); ++i )
3052
+ for (std::vector<std::string>::const_iterator it = opt_.f .begin (); it != opt_.f .end (); ++it )
3053
3053
{
3054
- const std::string& filename = *i ;
3054
+ const std::string& filename = *it ;
3055
3055
size_t len = filename.length ();
3056
3056
if ((len > 2 && filename.compare (len - 2 , 2 , " .h" ) == 0 )
3057
3057
|| (len > 3 && filename.compare (len - 3 , 3 , " .hh" ) == 0 )
@@ -3521,9 +3521,9 @@ void Pattern::gencode_dfa_closure(FILE *file, const DFA::State *state, int nest,
3521
3521
void Pattern::graph_dfa (const DFA::State *start) const
3522
3522
{
3523
3523
#ifndef WITH_NO_CODEGEN
3524
- for (std::vector<std::string>::const_iterator i = opt_.f .begin (); i != opt_.f .end (); ++i )
3524
+ for (std::vector<std::string>::const_iterator it = opt_.f .begin (); it != opt_.f .end (); ++it )
3525
3525
{
3526
- const std::string& filename = *i ;
3526
+ const std::string& filename = *it ;
3527
3527
size_t len = filename.length ();
3528
3528
if ((len > 3 && filename.compare (len - 3 , 3 , " .gv" ) == 0 )
3529
3529
|| (len > 4 && filename.compare (len - 4 , 4 , " .dot" ) == 0 ))
@@ -3694,9 +3694,9 @@ void Pattern::export_code() const
3694
3694
#ifndef WITH_NO_CODEGEN
3695
3695
if (nop_ == 0 )
3696
3696
return ;
3697
- for (std::vector<std::string>::const_iterator i = opt_.f .begin (); i != opt_.f .end (); ++i )
3697
+ for (std::vector<std::string>::const_iterator it = opt_.f .begin (); it != opt_.f .end (); ++it )
3698
3698
{
3699
- const std::string& filename = *i ;
3699
+ const std::string& filename = *it ;
3700
3700
size_t len = filename.length ();
3701
3701
if ((len > 2 && filename.compare (len - 2 , 2 , " .h" ) == 0 )
3702
3702
|| (len > 3 && filename.compare (len - 3 , 3 , " .hh" ) == 0 )
@@ -4586,7 +4586,7 @@ void Pattern::gen_match_hfa(DFA::State *start)
4586
4586
{
4587
4587
HFA::HashRanges& set_ranges = hfa_.hashes [level][next->first ->index ];
4588
4588
HFA::HashRanges& get_ranges = next->second ;
4589
- for (size_t offset = std::max (HFA::MAX_CHAIN - 1 , level) + 1 - HFA::MAX_CHAIN; offset <= level; ++offset)
4589
+ for (size_t offset = std::max< size_t > (HFA::MAX_CHAIN - 1 , level) + 1 - HFA::MAX_CHAIN; offset <= level; ++offset)
4590
4590
set_ranges[offset].swap (get_ranges[offset]);
4591
4591
}
4592
4592
}
@@ -4635,7 +4635,7 @@ bool Pattern::gen_match_hfa_transitions(size_t level, size_t& max_level, DFA::St
4635
4635
Char lo = edge.lo ();
4636
4636
Char hi = edge.hi ();
4637
4637
DBGLOG (" %zu HFA %p: %u..%u -> %p" , level, state, lo, hi, next_state);
4638
- for (size_t offset = std::max (HFA::MAX_CHAIN - 1 , level) + 1 - HFA::MAX_CHAIN; offset < level; ++offset)
4638
+ for (size_t offset = std::max< size_t > (HFA::MAX_CHAIN - 1 , level) + 1 - HFA::MAX_CHAIN; offset < level; ++offset)
4639
4639
{
4640
4640
DBGLOGN (" offset%3zu" , offset);
4641
4641
HFA::HashRange& next_hashes = hashes[next_state][offset];
0 commit comments