normal
[;{}] [*] \w+? (\+\+|\-\-) ;
UnusedDeref
style
Redundant * found, "*p++" is the same as "*(p++)".
normal
if \( ([!] )*?(strlen) \( \w+? \) ([>] [0] )*?\) {
StrlenEmptyString
performance
Using strlen() to check if a string is empty is not efficient.
normal
[;{}] [*] \w+? (\+\+|\-\-) ;
UnusedDeref
style
Redundant * found, "*p++" is the same as "*(p++)".
define
define [0-9A-Z_^a-z]*[a-z]
defineUpperCase
style
Macros must be uppercase
define
define (MIGRAPH|[^X]{7})[^X][^_]
definePrefix
style
Macros must be prefixed with MIGRAPHX_
raw
UseNamedLogicOperator
style
Use 'and' instead of &&
raw
UseNamedLogicOperator
style
Use 'and' instead of &&
raw
UseNamedLogicOperator
style
Use 'or' instead of ||
raw
UseNamedLogicOperator
style
Use 'not' instead of !
normal
UnnecessaryElseStatement
style
Else statement is not necessary.
normal
InvertedLogic
style
It is cleaner to invert the logic.
normal
InvertedLogic
style
It is cleaner to invert the logic.
normal
InvertedLogic
style
It is cleaner to invert the logic.
normal
InvertedLogic
style
It is cleaner to invert the logic.
normal
|::) )*(?:\w+|>)(?: &|\*)* (\w+) = \w+ ; \1 < \w+ ; (\1 \+\+|\+\+ \1|\1 \-\-|\-\- \1) \) { \w+ \[ \1 \] = \w+ ; }]]>
useStlAlgorithm
style
Considering using std::fill instead.
normal
|::) )*(?:\w+|>)(?: &|\*)* (\w+) = \w+ ; \1 < \w+ ; (\1 \+\+|\+\+ \1|\1 \-\-|\-\- \1) \) { \w+ \[ \1 \] = (?:\w+ :: )*\w+ \( \) ; }]]>
useStlAlgorithm
style
Considering using std::generate instead.
normal
|::) )*(?:\w+|>)(?: &|\*)* (\w+) = \w+ ; \1 < \w+ ; (\1 \+\+|\+\+ \1|\1 \-\-|\-\- \1) \) { \w+ \[ \1 \] = (?:\w+ :: )*\w+ \( \w+ \[ \1 \] \) ; }]]>
useStlAlgorithm
style
Considering using std::transform instead.
normal
|::) )*(?:\w+|>)(?: &|\*)* (\w+) = \w+ ; \1 < \w+ ; (\1 \+\+|\+\+ \1|\1 \-\-|\-\- \1) \) { \w+ \[ \1 \] = (?:\w+ :: )*\w+ \( \w+ \[ \1 \] , \w+ \[ \1 \] \) ; }]]>
useStlAlgorithm
style
Considering using std::transform instead.
normal
|::) )*(?:\w+|>)(?: &|\*)* (\w+) : (?:[^()]*(\([^()]*(?-1)*[^()]*\)))*[^)]*\) { (?:(?\w+) \+\+|\+\+ (?\w+)) ; if (\([^()]*(?-1)*[^()]*\)) { \w+ = \g{idx1}|\g{idx2} ; (?:break ; )?(?:return [^;]*; )?} }]]>
useStlAlgorithm
style
Considering using std::find or std::find_if instead.
normal
|::) )*(?:\w+|>)(?: &|\*)* (\w+) : (?:[^()]*(\([^()]*(?-1)*[^()]*\)))*[^)]*\) { if (\([^()]*(?-1)*[^()]*\)) { \w+ = (?\w) ; (?:break ; )?(?:return [^;]*; )?} (?:(\g{idx}) \+\+|\+\+ (\g{idx})) ; }]]>
useStlAlgorithm
style
Considering using std::find or std::find_if instead.
normal
|::) )*(?:\w+|>)(?: &|\*)* (\w+) : (?:[^()]*(\([^()]*(?-1)*[^()]*\)))*[^)]*\) { (?:(?\w+) \+\+|\+\+ (?\w+)) ; if (\([^()]*(?-1)*[^()]*\)) { return \g{idx1}|\g{idx2} ; } }]]>
useStlAlgorithm
style
Considering using std::find or std::find_if instead.
normal
|::) )*(?:\w+|>)(?: &|\*)* (\w+) : (?:[^()]*(\([^()]*(?-1)*[^()]*\)))*[^)]*\) { if (\([^()]*(?-1)*[^()]*\)) { return (?\w+) ; } (?:(\g{idx}) \+\+|\+\+ (\g{idx})) ; }]]>
useStlAlgorithm
style
Considering using std::find or std::find_if instead.