diff --git a/cfg/std.cfg b/cfg/std.cfg
index 2aad9a38c..c1f3b7b45 100644
--- a/cfg/std.cfg
+++ b/cfg/std.cfg
@@ -4020,9 +4020,25 @@ The obsolete function 'gets' is called. With 'gets' you'll get a buffer overrun
+
+
+ false
+
+
+
+
+
+
+
+
+
+
+
+
+
@@ -4042,7 +4058,30 @@ The obsolete function 'gets' is called. With 'gets' you'll get a buffer overrun
-
+
+
+ false
+
+
+
+
+
+
+
+
+
+
+ 0:
+
+
+
+
+
+
+
+
+
+
false
@@ -4060,6 +4099,10 @@ The obsolete function 'gets' is called. With 'gets' you'll get a buffer overrun
+
+
+
+
false
@@ -4076,6 +4119,24 @@ The obsolete function 'gets' is called. With 'gets' you'll get a buffer overrun
+
+
+
+
+ false
+
+
+
+
+
+
+
+
+
+
+
+
+
malloc
calloc
diff --git a/lib/checkstl.cpp b/lib/checkstl.cpp
index 181c30e22..e320e8fdc 100644
--- a/lib/checkstl.cpp
+++ b/lib/checkstl.cpp
@@ -275,19 +275,19 @@ void CheckStl::mismatchingContainersError(const Token *tok)
}
static const std::set algorithm2 = make_container< std::set >() // func(begin1, end1
- << "adjacent_find" << "all_of" << "any_of" << "binary_search" << "copy" << "copy_if" << "count" << "count_if" << "equal" << "equal_range"
- << "find" << "find_if" << "find_if_not" << "for_each" << "generate" << "is_heap" << "is_heap_until" << "is_partitioned"
- << "is_permutation" << "is_sorted" << "is_sorted_until" << "lower_bound" << "make_heap" << "max_element" << "minmax_element"
- << "min_element" << "mismatch" << "move" << "move_backward" << "next_permutation" << "none_of" << "partition" << "partition_copy"
- << "partition_point" << "pop_heap" << "prev_permutation" << "push_heap" << "random_shuffle" << "remove" << "remove_copy"
- << "remove_copy_if" << "remove_if" << "replace" << "replace_copy" << "replace_copy_if" << "replace_if" << "reverse" << "reverse_copy"
- << "search_n" << "shuffle" << "sort" << "sort_heap" << "stable_partition" << "stable_sort" << "swap_ranges" << "transform" << "unique"
- << "unique_copy" << "upper_bound" << "string" << "wstring" << "u16string" << "u32string";
+ << "binary_search" << "copy" << "copy_if" << "equal_range"
+ << "generate" << "is_heap" << "is_heap_until" << "is_partitioned"
+ << "is_permutation" << "is_sorted" << "is_sorted_until" << "lower_bound" << "make_heap" << "max_element" << "minmax_element"
+ << "min_element" << "mismatch" << "move" << "move_backward" << "next_permutation" << "partition" << "partition_copy"
+ << "partition_point" << "pop_heap" << "prev_permutation" << "push_heap" << "random_shuffle" << "remove" << "remove_copy"
+ << "remove_copy_if" << "remove_if" << "replace" << "replace_copy" << "replace_copy_if" << "replace_if" << "reverse" << "reverse_copy"
+ << "shuffle" << "sort" << "sort_heap" << "stable_partition" << "stable_sort" << "swap_ranges" << "transform" << "unique"
+ << "unique_copy" << "upper_bound" << "string" << "wstring" << "u16string" << "u32string";
static const std::set algorithm22 = make_container< std::set >() // func(begin1 << end1 << begin2 << end2
- << "find_end" << "find_first_of" << "includes" << "lexicographical_compare" << "merge" << "partial_sort_copy"
- << "search" << "set_difference" << "set_intersection" << "set_symmetric_difference" << "set_union";
+ << "includes" << "lexicographical_compare" << "merge" << "partial_sort_copy"
+ << "set_difference" << "set_intersection" << "set_symmetric_difference" << "set_union";
static const std::set algorithm1x1 = make_container< std::set >() // func(begin1 << x << end1
- << "inplace_merge" << "nth_element" << "partial_sort" << "rotate" << "rotate_copy";
+ << "nth_element" << "partial_sort" << "rotate" << "rotate_copy";
static const std::string iteratorBeginFuncPattern = "begin|cbegin|rbegin|crbegin";
static const std::string iteratorEndFuncPattern = "end|cend|rend|crend";