Skip to content
Snippets Groups Projects
Commit aa605d1f authored by Jan Trávníček's avatar Jan Trávníček
Browse files

fix 4 jenkins variable shadow error

parent 1acc27da
No related branches found
No related tags found
No related merge requests found
...@@ -193,14 +193,14 @@ void PrefixRankedNonlinearPattern < SymbolType, RankType >::setContent ( std::ve ...@@ -193,14 +193,14 @@ void PrefixRankedNonlinearPattern < SymbolType, RankType >::setContent ( std::ve
   
template < class SymbolType, class RankType > template < class SymbolType, class RankType >
void PrefixRankedNonlinearPattern < SymbolType, RankType >::arityChecksum ( const std::vector < std::ranked_symbol < SymbolType, RankType > > & data ) { void PrefixRankedNonlinearPattern < SymbolType, RankType >::arityChecksum ( const std::vector < std::ranked_symbol < SymbolType, RankType > > & data ) {
int arityChecksum = 1; int arityChecksumAcc = 1;
   
for ( const std::ranked_symbol < SymbolType, RankType > & symbol : data ) { for ( const std::ranked_symbol < SymbolType, RankType > & symbol : data ) {
arityChecksum += symbol.getRank ( ).getData ( ); arityChecksumAcc += symbol.getRank ( ).getData ( );
arityChecksum -= 1; arityChecksumAcc -= 1;
} }
   
if ( arityChecksum != 0 ) throw TreeException ( "The string does not form a tree" ); if ( arityChecksumAcc != 0 ) throw TreeException ( "The string does not form a tree" );
} }
   
template < class SymbolType, class RankType > template < class SymbolType, class RankType >
......
...@@ -165,14 +165,14 @@ void PrefixRankedPattern < SymbolType, RankType >::setContent ( std::vector < st ...@@ -165,14 +165,14 @@ void PrefixRankedPattern < SymbolType, RankType >::setContent ( std::vector < st
   
template < class SymbolType, class RankType > template < class SymbolType, class RankType >
void PrefixRankedPattern < SymbolType, RankType >::arityChecksum ( const std::vector < std::ranked_symbol < SymbolType, RankType > > & data ) { void PrefixRankedPattern < SymbolType, RankType >::arityChecksum ( const std::vector < std::ranked_symbol < SymbolType, RankType > > & data ) {
int arityChecksum = 1; int arityChecksumAcc = 1;
   
for ( const std::ranked_symbol < SymbolType, RankType > & symbol : data ) { for ( const std::ranked_symbol < SymbolType, RankType > & symbol : data ) {
arityChecksum += symbol.getRank ( ).getData ( ); arityChecksumAcc += symbol.getRank ( ).getData ( );
arityChecksum -= 1; arityChecksumAcc -= 1;
} }
   
if ( arityChecksum != 0 ) throw TreeException ( "The string does not form a tree" ); if ( arityChecksumAcc != 0 ) throw TreeException ( "The string does not form a tree" );
} }
   
template < class SymbolType, class RankType > template < class SymbolType, class RankType >
......
...@@ -152,14 +152,14 @@ void PrefixRankedTree < SymbolType, RankType >::setContent ( std::vector < std:: ...@@ -152,14 +152,14 @@ void PrefixRankedTree < SymbolType, RankType >::setContent ( std::vector < std::
   
template < class SymbolType, class RankType > template < class SymbolType, class RankType >
void PrefixRankedTree < SymbolType, RankType >::arityChecksum ( const std::vector < std::ranked_symbol < SymbolType, RankType > > & data ) { void PrefixRankedTree < SymbolType, RankType >::arityChecksum ( const std::vector < std::ranked_symbol < SymbolType, RankType > > & data ) {
int arityChecksum = 1; int arityChecksumAcc = 1;
   
for ( const std::ranked_symbol < SymbolType, RankType > & symbol : data ) { for ( const std::ranked_symbol < SymbolType, RankType > & symbol : data ) {
arityChecksum += symbol.getRank ( ).getData ( ); arityChecksumAcc += symbol.getRank ( ).getData ( );
arityChecksum -= 1; arityChecksumAcc -= 1;
} }
   
if ( arityChecksum != 0 ) throw TreeException ( "The string does not form a tree" ); if ( arityChecksumAcc != 0 ) throw TreeException ( "The string does not form a tree" );
} }
   
template < class SymbolType, class RankType > template < class SymbolType, class RankType >
......
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