walkero
/
cppcheck
1
0
Fork 0
Code Issues Pull Requests Projects Releases 1 Wiki Activity

Updated std.cfg

This commit is contained in:
Daniel Marjamäki 2016-11-01 15:33:17 +01:00
parent dbb999fc13
commit bd37504383
1 changed files with 29 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
cfg/std.cfg
View File

@ -4022,7 +4022,9 @@ The obsolete function 'gets' is called. With 'gets' you'll get a buffer overrun
</function>
<!-- InputIterator std::adjacent_find(InputIterator first, InputIterator last) -->
<function name="std::adjacent_find">
<use-retval/>
<noreturn>false</noreturn>
<returnValue type="iterator" container="1"/>
<arg nr="1">
<not-uninit/>
<iterator container="1" type="first"/>
@ -4106,8 +4108,10 @@ The obsolete function 'gets' is called. With 'gets' you'll get a buffer overrun
</arg>
</function>
<!-- InputIterator std::search_n(InputIterator first, InputIterator last, Size count, const T& val) -->
<function name="std::adjacent_find">
<function name="std::search_n">
<use-retval/>
<noreturn>false</noreturn>
<returnValue type="iterator" container="1"/>
<arg nr="1">
<not-uninit/>
<iterator container="1" type="first"/>
@ -4129,7 +4133,9 @@ The obsolete function 'gets' is called. With 'gets' you'll get a buffer overrun
<!-- InputIterator std::find_first_of(InputIterator first1, InputIterator last1, InputIterator first2, InputIterator last2) -->
<!-- InputIterator std::search(InputIterator first1, InputIterator last1, InputIterator first2, InputIterator last2) -->
<function name="std::find_end,std::find_first_of,std::search">
<use-retval/>
<noreturn>false</noreturn>
<returnValue type="iterator" container="1"/>
<arg nr="1">
<not-uninit/>
<iterator container="1" type="first"/>
@ -4166,10 +4172,28 @@ The obsolete function 'gets' is called. With 'gets' you'll get a buffer overrun
<iterator container="1" type="last"/>
</arg>
</function>
<!-- InputIterator std::equal(InputIterator first1, InputIterator last1, InputIterator first2) -->
<!-- InputIterator std::mismatch(InputIterator first1, InputIterator last1, InputIterator first2) -->
<!-- InputIterator std::is_permutation(InputIterator first1, InputIterator last1, InputIterator first2) -->
<function name="std::equal,std::mismatch,std::is_permutation">
<!-- bool std::equal(InputIterator first1, InputIterator last1, InputIterator first2) -->
<!-- bool std::is_permutation(InputIterator first1, InputIterator last1, InputIterator first2) -->
<function name="std::equal,std::is_permutation">
<use-retval/>
<noreturn>false</noreturn>
<returnValue type="bool"/>
<arg nr="1">
<not-uninit/>
<iterator container="1" type="first"/>
</arg>
<arg nr="2">
<not-uninit/>
<iterator container="1" type="last"/>
</arg>
<arg nr="3">
<not-uninit/>
<iterator container="2" type="first"/>
</arg>
</function>
<!-- pair<InputIterator1, InputIterator2> std::mismatch(InputIterator first1, InputIterator last1, InputIterator first2) -->
<function name="std::mismatch">
<use-retval/>
<noreturn>false</noreturn>
<arg nr="1">
<not-uninit/>