Flawfinder version 2.0.10, (C) 2001-2019 David A. Wheeler.
Number of rules (primarily dangerous function names) in C/C++ ruleset: 223
Examining data/range-v3-0.11.0/cmake/aligned_new_probe.cpp
Examining data/range-v3-0.11.0/cmake/coro_test_code.cpp
Examining data/range-v3-0.11.0/cmake/concepts_test_code.cpp
Examining data/range-v3-0.11.0/example/accumulate_ints.cpp
Examining data/range-v3-0.11.0/example/any_all_none_of.cpp
Examining data/range-v3-0.11.0/example/calendar.cpp
Examining data/range-v3-0.11.0/example/comprehension_conversion.cpp
Examining data/range-v3-0.11.0/example/comprehensions.cpp
Examining data/range-v3-0.11.0/example/count.cpp
Examining data/range-v3-0.11.0/example/count_if.cpp
Examining data/range-v3-0.11.0/example/filter_transform.cpp
Examining data/range-v3-0.11.0/example/find.cpp
Examining data/range-v3-0.11.0/example/for_each_assoc.cpp
Examining data/range-v3-0.11.0/example/for_each_sequence.cpp
Examining data/range-v3-0.11.0/example/hello.cpp
Examining data/range-v3-0.11.0/example/is_sorted.cpp
Examining data/range-v3-0.11.0/example/sort_unique.cpp
Examining data/range-v3-0.11.0/include/concepts/compare.hpp
Examining data/range-v3-0.11.0/include/concepts/concepts.hpp
Examining data/range-v3-0.11.0/include/concepts/swap.hpp
Examining data/range-v3-0.11.0/include/concepts/type_traits.hpp
Examining data/range-v3-0.11.0/include/meta/meta.hpp
Examining data/range-v3-0.11.0/include/meta/meta_fwd.hpp
Examining data/range-v3-0.11.0/include/range/v3/action.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/action.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/adjacent_remove_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/concepts.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/drop.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/drop_while.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/erase.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/insert.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/join.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/push_back.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/push_front.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/remove.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/remove_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/reverse.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/shuffle.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/slice.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/sort.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/split.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/split_when.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/stable_sort.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/stride.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/take.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/take_while.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/transform.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/unique.hpp
Examining data/range-v3-0.11.0/include/range/v3/action/unstable_remove_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/adjacent_find.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/adjacent_remove_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/all_of.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/any_of.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/aux_/equal_range_n.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/aux_/lower_bound_n.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/aux_/merge_n.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/aux_/merge_n_with_buffer.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/aux_/partition_point_n.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/aux_/sort_n_with_buffer.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/aux_/upper_bound_n.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/binary_search.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/contains.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/copy.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/copy_backward.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/copy_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/copy_n.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/count.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/count_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/ends_with.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/equal.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/equal_range.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/fill.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/fill_n.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/find.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/find_end.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/find_first_of.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/find_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/find_if_not.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/for_each.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/for_each_n.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/generate.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/generate_n.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/heap_algorithm.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/inplace_merge.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/is_partitioned.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/is_sorted.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/is_sorted_until.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/lexicographical_compare.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/lower_bound.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/max.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/max_element.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/merge.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/min.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/min_element.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/minmax.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/minmax_element.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/mismatch.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/move.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/move_backward.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/none_of.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/nth_element.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/partial_sort.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/partial_sort_copy.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/partition.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/partition_copy.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/partition_point.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/permutation.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/remove.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/remove_copy.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/remove_copy_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/remove_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/replace.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/replace_copy.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/replace_copy_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/replace_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/result_types.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/reverse.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/reverse_copy.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/rotate.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/rotate_copy.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/sample.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/search.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/search_n.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/set_algorithm.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/shuffle.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/sort.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/stable_partition.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/stable_sort.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/starts_with.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/swap_ranges.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/tagspec.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/transform.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/unique.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/unique_copy.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/unstable_remove_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/algorithm/upper_bound.hpp
Examining data/range-v3-0.11.0/include/range/v3/all.hpp
Examining data/range-v3-0.11.0/include/range/v3/at.hpp
Examining data/range-v3-0.11.0/include/range/v3/back.hpp
Examining data/range-v3-0.11.0/include/range/v3/begin_end.hpp
Examining data/range-v3-0.11.0/include/range/v3/compare.hpp
Examining data/range-v3-0.11.0/include/range/v3/core.hpp
Examining data/range-v3-0.11.0/include/range/v3/data.hpp
Examining data/range-v3-0.11.0/include/range/v3/detail/adl_get.hpp
Examining data/range-v3-0.11.0/include/range/v3/detail/config.hpp
Examining data/range-v3-0.11.0/include/range/v3/detail/epilogue.hpp
Examining data/range-v3-0.11.0/include/range/v3/detail/prologue.hpp
Examining data/range-v3-0.11.0/include/range/v3/detail/range_access.hpp
Examining data/range-v3-0.11.0/include/range/v3/detail/satisfy_boost_range.hpp
Examining data/range-v3-0.11.0/include/range/v3/detail/variant.hpp
Examining data/range-v3-0.11.0/include/range/v3/detail/with_braced_init_args.hpp
Examining data/range-v3-0.11.0/include/range/v3/distance.hpp
Examining data/range-v3-0.11.0/include/range/v3/empty.hpp
Examining data/range-v3-0.11.0/include/range/v3/experimental/utility/generator.hpp
Examining data/range-v3-0.11.0/include/range/v3/experimental/view/shared.hpp
Examining data/range-v3-0.11.0/include/range/v3/front.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/arithmetic.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/bind.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/bind_back.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/comparisons.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/compose.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/concepts.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/identity.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/indirect.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/invoke.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/not_fn.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/on.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/overload.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/pipeable.hpp
Examining data/range-v3-0.11.0/include/range/v3/functional/reference_wrapper.hpp
Examining data/range-v3-0.11.0/include/range/v3/getlines.hpp
Examining data/range-v3-0.11.0/include/range/v3/index.hpp
Examining data/range-v3-0.11.0/include/range/v3/istream_range.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/access.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/basic_iterator.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/common_iterator.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/concepts.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/counted_iterator.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/default_sentinel.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/diffmax_t.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/insert_iterators.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/move_iterators.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/operations.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/reverse_iterator.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/stream_iterators.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/traits.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator/unreachable_sentinel.hpp
Examining data/range-v3-0.11.0/include/range/v3/iterator_range.hpp
Examining data/range-v3-0.11.0/include/range/v3/numeric.hpp
Examining data/range-v3-0.11.0/include/range/v3/numeric/accumulate.hpp
Examining data/range-v3-0.11.0/include/range/v3/numeric/adjacent_difference.hpp
Examining data/range-v3-0.11.0/include/range/v3/numeric/inner_product.hpp
Examining data/range-v3-0.11.0/include/range/v3/numeric/iota.hpp
Examining data/range-v3-0.11.0/include/range/v3/numeric/partial_sum.hpp
Examining data/range-v3-0.11.0/include/range/v3/range.hpp
Examining data/range-v3-0.11.0/include/range/v3/range/access.hpp
Examining data/range-v3-0.11.0/include/range/v3/range/concepts.hpp
Examining data/range-v3-0.11.0/include/range/v3/range/conversion.hpp
Examining data/range-v3-0.11.0/include/range/v3/range/dangling.hpp
Examining data/range-v3-0.11.0/include/range/v3/range/operations.hpp
Examining data/range-v3-0.11.0/include/range/v3/range/primitives.hpp
Examining data/range-v3-0.11.0/include/range/v3/range/traits.hpp
Examining data/range-v3-0.11.0/include/range/v3/range_access.hpp
Examining data/range-v3-0.11.0/include/range/v3/range_concepts.hpp
Examining data/range-v3-0.11.0/include/range/v3/range_for.hpp
Examining data/range-v3-0.11.0/include/range/v3/range_fwd.hpp
Examining data/range-v3-0.11.0/include/range/v3/range_traits.hpp
Examining data/range-v3-0.11.0/include/range/v3/size.hpp
Examining data/range-v3-0.11.0/include/range/v3/span.hpp
Examining data/range-v3-0.11.0/include/range/v3/to_container.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/addressof.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/any.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/associated_types.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/basic_iterator.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/box.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/common_iterator.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/common_tuple.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/common_type.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/compressed_pair.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/concepts.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/copy.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/counted_iterator.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/dangling.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/functional.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/get.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/in_place.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/infinity.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/invoke.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/iterator.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/iterator_concepts.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/iterator_traits.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/memory.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/move.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/nullptr_v.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/optional.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/polymorphic_cast.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/random.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/scope_exit.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/semiregular.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/semiregular_box.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/static_const.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/swap.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/tagged_pair.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/tagged_tuple.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/tuple_algorithm.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/unreachable.hpp
Examining data/range-v3-0.11.0/include/range/v3/utility/variant.hpp
Examining data/range-v3-0.11.0/include/range/v3/version.hpp
Examining data/range-v3-0.11.0/include/range/v3/view.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/addressof.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/adjacent_filter.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/adjacent_remove_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/all.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/any_view.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/bounded.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/c_str.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/cache1.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/cartesian_product.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/common.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/concat.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/const.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/counted.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/cycle.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/delimit.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/drop.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/drop_exactly.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/drop_last.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/drop_while.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/empty.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/enumerate.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/exclusive_scan.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/facade.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/filter.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/for_each.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/generate.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/generate_n.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/getlines.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/group_by.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/indices.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/indirect.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/interface.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/intersperse.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/iota.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/istream.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/join.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/linear_distribute.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/map.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/move.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/partial_sum.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/ref.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/remove.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/remove_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/repeat.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/repeat_n.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/replace.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/replace_if.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/reverse.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/sample.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/set_algorithm.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/single.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/slice.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/sliding.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/span.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/split_when.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/stride.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/subrange.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/tail.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/take.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/take_exactly.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/take_last.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/take_while.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/tokenize.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/transform.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/trim.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/unbounded.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/unique.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/view.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/zip.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/zip_with.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/chunk.hpp
Examining data/range-v3-0.11.0/include/range/v3/view/split.hpp
Examining data/range-v3-0.11.0/include/range/v3/view_adaptor.hpp
Examining data/range-v3-0.11.0/include/range/v3/view_facade.hpp
Examining data/range-v3-0.11.0/include/range/v3/view_interface.hpp
Examining data/range-v3-0.11.0/include/std/detail/associated_types.hpp
Examining data/range-v3-0.11.0/perf/counted_insertion_sort.cpp
Examining data/range-v3-0.11.0/perf/range_conversion.cpp
Examining data/range-v3-0.11.0/perf/sort_patterns.cpp
Examining data/range-v3-0.11.0/test/action/adjacent_remove_if.cpp
Examining data/range-v3-0.11.0/test/action/cont_concepts.cpp
Examining data/range-v3-0.11.0/test/action/drop.cpp
Examining data/range-v3-0.11.0/test/action/drop_while.cpp
Examining data/range-v3-0.11.0/test/action/insert.cpp
Examining data/range-v3-0.11.0/test/action/join.cpp
Examining data/range-v3-0.11.0/test/action/push_back.cpp
Examining data/range-v3-0.11.0/test/action/push_front.cpp
Examining data/range-v3-0.11.0/test/action/remove.cpp
Examining data/range-v3-0.11.0/test/action/remove_if.cpp
Examining data/range-v3-0.11.0/test/action/reverse.cpp
Examining data/range-v3-0.11.0/test/action/shuffle.cpp
Examining data/range-v3-0.11.0/test/action/slice.cpp
Examining data/range-v3-0.11.0/test/action/sort.cpp
Examining data/range-v3-0.11.0/test/action/split.cpp
Examining data/range-v3-0.11.0/test/action/stable_sort.cpp
Examining data/range-v3-0.11.0/test/action/stride.cpp
Examining data/range-v3-0.11.0/test/action/take.cpp
Examining data/range-v3-0.11.0/test/action/take_while.cpp
Examining data/range-v3-0.11.0/test/action/transform.cpp
Examining data/range-v3-0.11.0/test/action/unique.cpp
Examining data/range-v3-0.11.0/test/action/unstable_remove_if.cpp
Examining data/range-v3-0.11.0/test/algorithm/adjacent_find.cpp
Examining data/range-v3-0.11.0/test/algorithm/adjacent_remove_if.cpp
Examining data/range-v3-0.11.0/test/algorithm/all_of.cpp
Examining data/range-v3-0.11.0/test/algorithm/any_of.cpp
Examining data/range-v3-0.11.0/test/algorithm/binary_search.cpp
Examining data/range-v3-0.11.0/test/algorithm/contains.cpp
Examining data/range-v3-0.11.0/test/algorithm/copy.cpp
Examining data/range-v3-0.11.0/test/algorithm/copy_backward.cpp
Examining data/range-v3-0.11.0/test/algorithm/count.cpp
Examining data/range-v3-0.11.0/test/algorithm/count_if.cpp
Examining data/range-v3-0.11.0/test/algorithm/ends_with.cpp
Examining data/range-v3-0.11.0/test/algorithm/equal.cpp
Examining data/range-v3-0.11.0/test/algorithm/equal_range.cpp
Examining data/range-v3-0.11.0/test/algorithm/fill.cpp
Examining data/range-v3-0.11.0/test/algorithm/find.cpp
Examining data/range-v3-0.11.0/test/algorithm/find_end.cpp
Examining data/range-v3-0.11.0/test/algorithm/find_first_of.cpp
Examining data/range-v3-0.11.0/test/algorithm/find_if.cpp
Examining data/range-v3-0.11.0/test/algorithm/for_each.cpp
Examining data/range-v3-0.11.0/test/algorithm/for_each_n.cpp
Examining data/range-v3-0.11.0/test/algorithm/generate.cpp
Examining data/range-v3-0.11.0/test/algorithm/generate_n.cpp
Examining data/range-v3-0.11.0/test/algorithm/includes.cpp
Examining data/range-v3-0.11.0/test/algorithm/inplace_merge.cpp
Examining data/range-v3-0.11.0/test/algorithm/is_heap.hpp
Examining data/range-v3-0.11.0/test/algorithm/is_heap1.cpp
Examining data/range-v3-0.11.0/test/algorithm/is_heap2.cpp
Examining data/range-v3-0.11.0/test/algorithm/is_heap3.cpp
Examining data/range-v3-0.11.0/test/algorithm/is_heap4.cpp
Examining data/range-v3-0.11.0/test/algorithm/is_heap_until.hpp
Examining data/range-v3-0.11.0/test/algorithm/is_heap_until1.cpp
Examining data/range-v3-0.11.0/test/algorithm/is_heap_until2.cpp
Examining data/range-v3-0.11.0/test/algorithm/is_heap_until3.cpp
Examining data/range-v3-0.11.0/test/algorithm/is_heap_until4.cpp
Examining data/range-v3-0.11.0/test/algorithm/is_partitioned.cpp
Examining data/range-v3-0.11.0/test/algorithm/is_permutation.cpp
Examining data/range-v3-0.11.0/test/algorithm/is_sorted.cpp
Examining data/range-v3-0.11.0/test/algorithm/is_sorted_until.cpp
Examining data/range-v3-0.11.0/test/algorithm/lexicographical_compare.cpp
Examining data/range-v3-0.11.0/test/algorithm/lower_bound.cpp
Examining data/range-v3-0.11.0/test/algorithm/make_heap.cpp
Examining data/range-v3-0.11.0/test/algorithm/max.cpp
Examining data/range-v3-0.11.0/test/algorithm/max_element.cpp
Examining data/range-v3-0.11.0/test/algorithm/merge.cpp
Examining data/range-v3-0.11.0/test/algorithm/min.cpp
Examining data/range-v3-0.11.0/test/algorithm/min_element.cpp
Examining data/range-v3-0.11.0/test/algorithm/minmax.cpp
Examining data/range-v3-0.11.0/test/algorithm/minmax_element.cpp
Examining data/range-v3-0.11.0/test/algorithm/mismatch.cpp
Examining data/range-v3-0.11.0/test/algorithm/move.cpp
Examining data/range-v3-0.11.0/test/algorithm/move_backward.cpp
Examining data/range-v3-0.11.0/test/algorithm/next_permutation.cpp
Examining data/range-v3-0.11.0/test/algorithm/none_of.cpp
Examining data/range-v3-0.11.0/test/algorithm/nth_element.cpp
Examining data/range-v3-0.11.0/test/algorithm/partial_sort.cpp
Examining data/range-v3-0.11.0/test/algorithm/partial_sort_copy.cpp
Examining data/range-v3-0.11.0/test/algorithm/partition.cpp
Examining data/range-v3-0.11.0/test/algorithm/partition_copy.cpp
Examining data/range-v3-0.11.0/test/algorithm/partition_point.cpp
Examining data/range-v3-0.11.0/test/algorithm/pop_heap.cpp
Examining data/range-v3-0.11.0/test/algorithm/prev_permutation.cpp
Examining data/range-v3-0.11.0/test/algorithm/push_heap.cpp
Examining data/range-v3-0.11.0/test/algorithm/remove.cpp
Examining data/range-v3-0.11.0/test/algorithm/remove_copy.cpp
Examining data/range-v3-0.11.0/test/algorithm/remove_copy_if.cpp
Examining data/range-v3-0.11.0/test/algorithm/remove_if.cpp
Examining data/range-v3-0.11.0/test/algorithm/replace.cpp
Examining data/range-v3-0.11.0/test/algorithm/replace_copy.cpp
Examining data/range-v3-0.11.0/test/algorithm/replace_copy_if.cpp
Examining data/range-v3-0.11.0/test/algorithm/replace_if.cpp
Examining data/range-v3-0.11.0/test/algorithm/reverse.cpp
Examining data/range-v3-0.11.0/test/algorithm/reverse_copy.cpp
Examining data/range-v3-0.11.0/test/algorithm/rotate.cpp
Examining data/range-v3-0.11.0/test/algorithm/rotate_copy.cpp
Examining data/range-v3-0.11.0/test/algorithm/sample.cpp
Examining data/range-v3-0.11.0/test/algorithm/search.cpp
Examining data/range-v3-0.11.0/test/algorithm/search_n.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_difference.hpp
Examining data/range-v3-0.11.0/test/algorithm/set_difference1.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_difference2.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_difference3.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_difference4.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_difference5.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_difference6.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_intersection.hpp
Examining data/range-v3-0.11.0/test/algorithm/set_intersection1.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_intersection2.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_intersection3.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_intersection4.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_intersection5.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_intersection6.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_symmetric_difference.hpp
Examining data/range-v3-0.11.0/test/algorithm/set_symmetric_difference1.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_symmetric_difference2.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_symmetric_difference3.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_symmetric_difference4.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_symmetric_difference5.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_symmetric_difference6.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_union.hpp
Examining data/range-v3-0.11.0/test/algorithm/set_union1.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_union2.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_union3.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_union4.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_union5.cpp
Examining data/range-v3-0.11.0/test/algorithm/set_union6.cpp
Examining data/range-v3-0.11.0/test/algorithm/shuffle.cpp
Examining data/range-v3-0.11.0/test/algorithm/sort.cpp
Examining data/range-v3-0.11.0/test/algorithm/sort_heap.cpp
Examining data/range-v3-0.11.0/test/algorithm/sort_n_with_buffer.cpp
Examining data/range-v3-0.11.0/test/algorithm/stable_partition.cpp
Examining data/range-v3-0.11.0/test/algorithm/stable_sort.cpp
Examining data/range-v3-0.11.0/test/algorithm/starts_with.cpp
Examining data/range-v3-0.11.0/test/algorithm/swap_ranges.cpp
Examining data/range-v3-0.11.0/test/algorithm/transform.cpp
Examining data/range-v3-0.11.0/test/algorithm/unique.cpp
Examining data/range-v3-0.11.0/test/algorithm/unique_copy.cpp
Examining data/range-v3-0.11.0/test/algorithm/upper_bound.cpp
Examining data/range-v3-0.11.0/test/array.hpp
Examining data/range-v3-0.11.0/test/bug1322.cpp
Examining data/range-v3-0.11.0/test/bug1335.cpp
Examining data/range-v3-0.11.0/test/bug474.cpp
Examining data/range-v3-0.11.0/test/bug566.cpp
Examining data/range-v3-0.11.0/test/config.cpp
Examining data/range-v3-0.11.0/test/constexpr_core.cpp
Examining data/range-v3-0.11.0/test/debug_view.hpp
Examining data/range-v3-0.11.0/test/experimental/utility/generator.cpp
Examining data/range-v3-0.11.0/test/experimental/view/shared.cpp
Examining data/range-v3-0.11.0/test/functional/bind_back.cpp
Examining data/range-v3-0.11.0/test/iterator/basic_iterator.cpp
Examining data/range-v3-0.11.0/test/iterator/common_iterator.cpp
Examining data/range-v3-0.11.0/test/iterator/diffmax_t.cpp
Examining data/range-v3-0.11.0/test/iterator/iterator.cpp
Examining data/range-v3-0.11.0/test/iterator/reverse_iterator.cpp
Examining data/range-v3-0.11.0/test/multiple1.cpp
Examining data/range-v3-0.11.0/test/multiple2.cpp
Examining data/range-v3-0.11.0/test/numeric/accumulate.cpp
Examining data/range-v3-0.11.0/test/numeric/adjacent_difference.cpp
Examining data/range-v3-0.11.0/test/numeric/inner_product.cpp
Examining data/range-v3-0.11.0/test/numeric/iota.cpp
Examining data/range-v3-0.11.0/test/numeric/partial_sum.cpp
Examining data/range-v3-0.11.0/test/range/access.cpp
Examining data/range-v3-0.11.0/test/range/conversion.cpp
Examining data/range-v3-0.11.0/test/range/index.cpp
Examining data/range-v3-0.11.0/test/range/operations.cpp
Examining data/range-v3-0.11.0/test/simple_test.hpp
Examining data/range-v3-0.11.0/test/test_iterators.hpp
Examining data/range-v3-0.11.0/test/test_utils.hpp
Examining data/range-v3-0.11.0/test/utility/box.cpp
Examining data/range-v3-0.11.0/test/utility/common_type.cpp
Examining data/range-v3-0.11.0/test/utility/compare.cpp
Examining data/range-v3-0.11.0/test/utility/concepts.cpp
Examining data/range-v3-0.11.0/test/utility/functional.cpp
Examining data/range-v3-0.11.0/test/utility/meta.cpp
Examining data/range-v3-0.11.0/test/utility/scope_exit.cpp
Examining data/range-v3-0.11.0/test/utility/semiregular_box.cpp
Examining data/range-v3-0.11.0/test/utility/swap.cpp
Examining data/range-v3-0.11.0/test/utility/variant.cpp
Examining data/range-v3-0.11.0/test/view/adaptor.cpp
Examining data/range-v3-0.11.0/test/view/addressof.cpp
Examining data/range-v3-0.11.0/test/view/adjacent_remove_if.cpp
Examining data/range-v3-0.11.0/test/view/all.cpp
Examining data/range-v3-0.11.0/test/view/any_view.cpp
Examining data/range-v3-0.11.0/test/view/cache1.cpp
Examining data/range-v3-0.11.0/test/view/cartesian_product.cpp
Examining data/range-v3-0.11.0/test/view/chunk.cpp
Examining data/range-v3-0.11.0/test/view/common.cpp
Examining data/range-v3-0.11.0/test/view/concat.cpp
Examining data/range-v3-0.11.0/test/view/const.cpp
Examining data/range-v3-0.11.0/test/view/conversion.cpp
Examining data/range-v3-0.11.0/test/view/counted.cpp
Examining data/range-v3-0.11.0/test/view/cycle.cpp
Examining data/range-v3-0.11.0/test/view/delimit.cpp
Examining data/range-v3-0.11.0/test/view/drop.cpp
Examining data/range-v3-0.11.0/test/view/drop_exactly.cpp
Examining data/range-v3-0.11.0/test/view/drop_last.cpp
Examining data/range-v3-0.11.0/test/view/drop_while.cpp
Examining data/range-v3-0.11.0/test/view/enumerate.cpp
Examining data/range-v3-0.11.0/test/view/exclusive_scan.cpp
Examining data/range-v3-0.11.0/test/view/facade.cpp
Examining data/range-v3-0.11.0/test/view/generate.cpp
Examining data/range-v3-0.11.0/test/view/generate_n.cpp
Examining data/range-v3-0.11.0/test/view/getlines.cpp
Examining data/range-v3-0.11.0/test/view/group_by.cpp
Examining data/range-v3-0.11.0/test/view/indirect.cpp
Examining data/range-v3-0.11.0/test/view/intersperse.cpp
Examining data/range-v3-0.11.0/test/view/iota.cpp
Examining data/range-v3-0.11.0/test/view/istream.cpp
Examining data/range-v3-0.11.0/test/view/iterator_range.cpp
Examining data/range-v3-0.11.0/test/view/join.cpp
Examining data/range-v3-0.11.0/test/view/keys_value.cpp
Examining data/range-v3-0.11.0/test/view/linear_distribute.cpp
Examining data/range-v3-0.11.0/test/view/move.cpp
Examining data/range-v3-0.11.0/test/view/partial_sum.cpp
Examining data/range-v3-0.11.0/test/view/partial_sum_depr.cpp
Examining data/range-v3-0.11.0/test/view/remove.cpp
Examining data/range-v3-0.11.0/test/view/remove_if.cpp
Examining data/range-v3-0.11.0/test/view/repeat.cpp
Examining data/range-v3-0.11.0/test/view/replace.cpp
Examining data/range-v3-0.11.0/test/view/replace_if.cpp
Examining data/range-v3-0.11.0/test/view/reverse.cpp
Examining data/range-v3-0.11.0/test/view/sample.cpp
Examining data/range-v3-0.11.0/test/view/set_difference.cpp
Examining data/range-v3-0.11.0/test/view/set_intersection.cpp
Examining data/range-v3-0.11.0/test/view/set_symmetric_difference.cpp
Examining data/range-v3-0.11.0/test/view/set_union.cpp
Examining data/range-v3-0.11.0/test/view/slice.cpp
Examining data/range-v3-0.11.0/test/view/sliding.cpp
Examining data/range-v3-0.11.0/test/view/span.cpp
Examining data/range-v3-0.11.0/test/view/split.cpp
Examining data/range-v3-0.11.0/test/view/stride.cpp
Examining data/range-v3-0.11.0/test/view/subrange.cpp
Examining data/range-v3-0.11.0/test/view/tail.cpp
Examining data/range-v3-0.11.0/test/view/take.cpp
Examining data/range-v3-0.11.0/test/view/take_exactly.cpp
Examining data/range-v3-0.11.0/test/view/take_last.cpp
Examining data/range-v3-0.11.0/test/view/take_while.cpp
Examining data/range-v3-0.11.0/test/view/tokenize.cpp
Examining data/range-v3-0.11.0/test/view/transform.cpp
Examining data/range-v3-0.11.0/test/view/trim.cpp
Examining data/range-v3-0.11.0/test/view/unique.cpp
Examining data/range-v3-0.11.0/test/view/view.cpp
Examining data/range-v3-0.11.0/test/view/zip.cpp
Examining data/range-v3-0.11.0/test_package/example.cpp

FINAL RESULTS:

data/range-v3-0.11.0/include/range/v3/iterator/counted_iterator.hpp:37:16:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
        struct access
data/range-v3-0.11.0/include/range/v3/iterator/counted_iterator.hpp:79:36:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
        friend _counted_iterator_::access;
data/range-v3-0.11.0/include/range/v3/iterator/counted_iterator.hpp:114:42:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
          : current_(_counted_iterator_::access::current(i))
data/range-v3-0.11.0/include/range/v3/iterator/counted_iterator.hpp:123:44:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
            current_ = _counted_iterator_::access::current(i);
data/range-v3-0.11.0/include/range/v3/iterator/counted_iterator.hpp:285:70:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
            return ranges::iter_swap(x.current_, _counted_iterator_::access::current(y));
data/range-v3-0.11.0/include/range/v3/iterator/counted_iterator.hpp:301:58:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
            return ranges::iter_move(_counted_iterator_::access::current(i));
data/range-v3-0.11.0/include/range/v3/iterator/counted_iterator.hpp:312:58:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
            return ranges::iter_swap(_counted_iterator_::access::current(x),
data/range-v3-0.11.0/include/range/v3/iterator/counted_iterator.hpp:313:58:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
                                     _counted_iterator_::access::current(y));
data/range-v3-0.11.0/perf/counted_insertion_sort.cpp:177:18:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
    int i = std::atoi(argv[1]);
data/range-v3-0.11.0/test/algorithm/copy.cpp:66:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char buf[50];
data/range-v3-0.11.0/test/algorithm/copy.cpp:77:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char buf[50];
data/range-v3-0.11.0/test/algorithm/fill.cpp:35:5:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    char ca[n] = {0};
data/range-v3-0.11.0/test/iterator/basic_iterator.cpp:247:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char buf[10];
data/range-v3-0.11.0/test/iterator/basic_iterator.cpp:331:9:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
        char buf[10];
data/range-v3-0.11.0/example/calendar.cpp:215:20:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    decltype(auto) read() const
data/range-v3-0.11.0/example/calendar.cpp:224:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    bool equal(default_sentinel_t) const
data/range-v3-0.11.0/example/calendar.cpp:233:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    auto equal(cursor const& that) const -> CPP_ret(bool)(
data/range-v3-0.11.0/include/range/v3/algorithm/equal.hpp:54:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    RANGES_FUNC_BEGIN(equal)
data/range-v3-0.11.0/include/range/v3/algorithm/equal.hpp:69:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        constexpr bool RANGES_FUNC(equal)(I0 begin0,
data/range-v3-0.11.0/include/range/v3/algorithm/equal.hpp:94:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        constexpr bool RANGES_FUNC(equal)(I0 begin0,
data/range-v3-0.11.0/include/range/v3/algorithm/equal.hpp:127:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        constexpr bool RANGES_FUNC(equal)(Rng0 && rng0,
data/range-v3-0.11.0/include/range/v3/algorithm/equal.hpp:153:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        constexpr bool RANGES_FUNC(equal)(
data/range-v3-0.11.0/include/range/v3/algorithm/equal.hpp:168:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    RANGES_FUNC_END(equal)
data/range-v3-0.11.0/include/range/v3/algorithm/equal.hpp:172:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        using ranges::equal;
data/range-v3-0.11.0/include/range/v3/algorithm/mismatch.hpp:43:23:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    RANGES_FUNC_BEGIN(mismatch)
data/range-v3-0.11.0/include/range/v3/algorithm/mismatch.hpp:59:45:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        mismatch_result<I1, I2> RANGES_FUNC(mismatch)(I1 begin1,
data/range-v3-0.11.0/include/range/v3/algorithm/mismatch.hpp:84:45:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        mismatch_result<I1, I2> RANGES_FUNC(mismatch)(I1 begin1,
data/range-v3-0.11.0/include/range/v3/algorithm/mismatch.hpp:112:21:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        RANGES_FUNC(mismatch)(Rng1 && rng1,
data/range-v3-0.11.0/include/range/v3/algorithm/mismatch.hpp:141:21:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        RANGES_FUNC(mismatch)(Rng1 && rng1,
data/range-v3-0.11.0/include/range/v3/algorithm/mismatch.hpp:156:21:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    RANGES_FUNC_END(mismatch)
data/range-v3-0.11.0/include/range/v3/algorithm/mismatch.hpp:160:23:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        using ranges::mismatch;
data/range-v3-0.11.0/include/range/v3/algorithm/permutation.hpp:99:23:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    RANGES_FUNC_BEGIN(is_permutation)
data/range-v3-0.11.0/include/range/v3/algorithm/permutation.hpp:114:26:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool RANGES_FUNC(is_permutation)(I1 begin1,
data/range-v3-0.11.0/include/range/v3/algorithm/permutation.hpp:173:26:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool RANGES_FUNC(is_permutation)(I1 begin1,
data/range-v3-0.11.0/include/range/v3/algorithm/permutation.hpp:216:26:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool RANGES_FUNC(is_permutation)(Rng1 && rng1,
data/range-v3-0.11.0/include/range/v3/algorithm/permutation.hpp:242:26:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool RANGES_FUNC(is_permutation)(
data/range-v3-0.11.0/include/range/v3/algorithm/permutation.hpp:266:21:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    RANGES_FUNC_END(is_permutation)
data/range-v3-0.11.0/include/range/v3/algorithm/permutation.hpp:360:23:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        using ranges::is_permutation;
data/range-v3-0.11.0/include/range/v3/detail/range_access.hpp:107:44:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        static constexpr auto CPP_auto_fun(read)(Cur const &pos)
data/range-v3-0.11.0/include/range/v3/detail/range_access.hpp:109:24:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            return pos.read()
data/range-v3-0.11.0/include/range/v3/detail/range_access.hpp:132:44:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        static constexpr auto CPP_auto_fun(equal)(Cur const &pos, O const &other)
data/range-v3-0.11.0/include/range/v3/detail/range_access.hpp:134:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            return pos.equal(other)
data/range-v3-0.11.0/include/range/v3/detail/range_access.hpp:166:71:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        using cursor_reference_t = decltype(std::declval<T const &>().read());
data/range-v3-0.11.0/include/range/v3/detail/range_access.hpp:253:31:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                range_access::equal(c, s),
data/range-v3-0.11.0/include/range/v3/detail/range_access.hpp:255:35:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                    range_access::equal(c, s)), bool>>
data/range-v3-0.11.0/include/range/v3/detail/range_access.hpp:267:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                range_access::read(t)
data/range-v3-0.11.0/include/range/v3/detail/range_access.hpp:350:59:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                detail::is_lvalue_reference(range_access::read(t))
data/range-v3-0.11.0/include/range/v3/experimental/utility/generator.hpp:230:83:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            meta::if_<std::is_reference<Reference>, Reference, Reference const &> read()
data/range-v3-0.11.0/include/range/v3/experimental/utility/generator.hpp:303:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/experimental/utility/generator.hpp:319:27:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                Reference read() const
data/range-v3-0.11.0/include/range/v3/experimental/utility/generator.hpp:322:44:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                    return coro_.promise().read();
data/range-v3-0.11.0/include/range/v3/iterator/basic_iterator.hpp:76:36:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            decltype(range_access::read(std::declval<Cur const &>()));
data/range-v3-0.11.0/include/range/v3/iterator/basic_iterator.hpp:178:53:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                noexcept(reference_t_(range_access::read(std::declval<Cur const &>()))))
data/range-v3-0.11.0/include/range/v3/iterator/basic_iterator.hpp:180:38:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                return range_access::read(*cur_);
data/range-v3-0.11.0/include/range/v3/iterator/basic_iterator.hpp:593:45:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            noexcept(noexcept(range_access::read(std::declval<Cur const &>())))
data/range-v3-0.11.0/include/range/v3/iterator/basic_iterator.hpp:599:34:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            return range_access::read(pos());
data/range-v3-0.11.0/include/range/v3/iterator/basic_iterator.hpp:773:30:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        return range_access::equal(range_access::pos(left), range_access::pos(right));
data/range-v3-0.11.0/include/range/v3/iterator/basic_iterator.hpp:789:30:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        return range_access::equal(range_access::pos(left), right);
data/range-v3-0.11.0/include/range/v3/iterator/common_iterator.hpp:413:28:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            decltype(auto) read()
data/range-v3-0.11.0/include/range/v3/iterator/common_iterator.hpp:417:28:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            decltype(auto) read() const
data/range-v3-0.11.0/include/range/v3/iterator/common_iterator.hpp:425:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(cpp17_iterator_cursor const & that) const
data/range-v3-0.11.0/include/range/v3/iterator/move_iterators.hpp:392:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            auto read() const noexcept(noexcept(*std::declval<I const &>()))
data/range-v3-0.11.0/include/range/v3/iterator/move_iterators.hpp:400:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            auto equal(move_into_cursor const & that) const //
data/range-v3-0.11.0/include/range/v3/iterator/reverse_iterator.hpp:68:43:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            constexpr iter_reference_t<I> read() const
data/range-v3-0.11.0/include/range/v3/iterator/reverse_iterator.hpp:85:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            constexpr bool equal(reverse_cursor<J> const & that) const
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:63:48:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        constexpr always_<int, decltype(Adapt::read(std::declval<BaseIter const &>(),
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:134:25:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            static bool equal(I const & it0, I const & it1)
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:141:36:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        static iter_reference_t<I> read(I const & it,
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:299:86:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        template<typename A = Adapt, typename R = decltype(std::declval<A const &>().read(
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:301:11:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        R read() const noexcept(
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:302:48:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            noexcept(std::declval<A const &>().read(std::declval<BaseIter const &>())))
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:308:41:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            return this->data_.second().read(this->data_.first());
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:317:64:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                 typename = decltype(std::declval<A const &>().equal(
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:322:41:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            return this->data_.second().equal(
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:326:64:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                 typename = decltype(std::declval<A const &>().equal(
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:330:41:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            return this->data_.second().equal(this->data_.first(), that.data_.first());
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:333:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        auto equal(adaptor_cursor const & that) const
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:355:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        constexpr auto equal(adaptor_sentinel<S, A> const & that) const
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:403:53:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            using R = decltype(this->data_.second().read(this->data_.first()));
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:418:66:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                 typename R = decltype(std::declval<A const &>().read(
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:431:48:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                     std::declval<A const &>().read(std::declval<BaseIter const &>())),
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:434:39:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            std::declval<A const &>().read(std::declval<BaseIter const &>())))))
data/range-v3-0.11.0/include/range/v3/view/adaptor.hpp:443:59:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            return static_cast<X &&>(this->data_.second().read(this->data_.first()));
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:209:25:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            virtual Ref read() const = 0;
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:227:17:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            Ref read() const
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:229:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                return view_->read();
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:235:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(any_input_cursor const &) const noexcept
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:239:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:274:25:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            virtual Ref read() const override
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:301:25:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            virtual Ref read() const = 0;
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:302:26:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            virtual bool equal(any_cursor_interface const &) const = 0;
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:347:17:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            Ref read() const override
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:351:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(Forward const & that_) const override
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:435:17:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            Ref read() const
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:438:30:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                return ptr_->read();
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:440:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(any_cursor const & that) const
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:443:39:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                return !ptr_ || ptr_->equal(*that.ptr_);
data/range-v3-0.11.0/include/range/v3/view/any_view.hpp:445:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(any_sentinel const & that) const
data/range-v3-0.11.0/include/range/v3/view/cache1.hpp:98:35:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            range_value_t<Rng> && read() const
data/range-v3-0.11.0/include/range/v3/view/cache1.hpp:112:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(cursor const & that) const
data/range-v3-0.11.0/include/range/v3/view/cache1.hpp:116:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(sentinel const & that) const
data/range-v3-0.11.0/include/range/v3/view/cartesian_product.hpp:332:68:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            common_tuple<range_reference_t<constify_if<Views>>...> read() const
data/range-v3-0.11.0/include/range/v3/view/cartesian_product.hpp:340:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/cartesian_product.hpp:344:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(cursor const & that) const
data/range-v3-0.11.0/include/range/v3/view/chunk.hpp:137:28:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            constexpr auto read(iterator_t<CRng> const & it) const
data/range-v3-0.11.0/include/range/v3/view/chunk.hpp:281:32:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                constexpr bool equal(default_sentinel_t) const noexcept
data/range-v3-0.11.0/include/range/v3/view/chunk.hpp:285:61:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                constexpr iter_reference_t<iterator_t<Rng>> read() const
data/range-v3-0.11.0/include/range/v3/view/chunk.hpp:338:34:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            constexpr inner_view read() const
data/range-v3-0.11.0/include/range/v3/view/chunk.hpp:348:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            constexpr bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/concat.hpp:283:23:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            reference read() const
data/range-v3-0.11.0/include/range/v3/view/concat.hpp:294:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            auto equal(cursor const & pos) const //
data/range-v3-0.11.0/include/range/v3/view/concat.hpp:302:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(sentinel<IsConst> const & pos) const
data/range-v3-0.11.0/include/range/v3/view/const.hpp:58:24:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            reference_ read(iterator_t<CRng> const & it) const
data/range-v3-0.11.0/include/range/v3/view/cycle.hpp:111:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            auto CPP_auto_fun(read)()(const)
data/range-v3-0.11.0/include/range/v3/view/cycle.hpp:117:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            auto equal(cursor const & pos) const //
data/range-v3-0.11.0/include/range/v3/view/enumerate.hpp:47:22:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                Size read() const
data/range-v3-0.11.0/include/range/v3/view/enumerate.hpp:55:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                bool equal(cursor const & that) const
data/range-v3-0.11.0/include/range/v3/view/exclusive_scan.hpp:96:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            T read(iterator_t<CRng> const &) const
data/range-v3-0.11.0/include/range/v3/view/generate.hpp:58:25:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            result_t && read() const
data/range-v3-0.11.0/include/range/v3/view/generate_n.hpp:58:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/generate_n.hpp:62:25:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            result_t && read() const
data/range-v3-0.11.0/include/range/v3/view/getlines.hpp:55:27:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            std::string & read() const noexcept
data/range-v3-0.11.0/include/range/v3/view/getlines.hpp:59:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/getlines.hpp:63:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(cursor that) const
data/range-v3-0.11.0/include/range/v3/view/group_by.hpp:102:25:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            subrange<I> read() const
data/range-v3-0.11.0/include/range/v3/view/group_by.hpp:107:39:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            subrange<iterator_t<Rng>> read() const
data/range-v3-0.11.0/include/range/v3/view/group_by.hpp:120:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/group_by.hpp:124:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(cursor const & that) const
data/range-v3-0.11.0/include/range/v3/view/indirect.hpp:58:41:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            constexpr auto CPP_auto_fun(read)(iterator_t<CRng> const &it)(const)
data/range-v3-0.11.0/include/range/v3/view/intersperse.hpp:98:42:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            constexpr range_value_t<Rng> read(iterator_t<CRng> const & it) const
data/range-v3-0.11.0/include/range/v3/view/intersperse.hpp:103:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            constexpr auto equal(iterator_t<CRng> const & it0,
data/range-v3-0.11.0/include/range/v3/view/iota.hpp:198:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            From read() const
data/range-v3-0.11.0/include/range/v3/view/iota.hpp:211:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/iota.hpp:216:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            auto equal(cursor const & that) const //
data/range-v3-0.11.0/include/range/v3/view/iota.hpp:366:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            From read() const
data/range-v3-0.11.0/include/range/v3/view/iota.hpp:374:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(sentinel const & that) const
data/range-v3-0.11.0/include/range/v3/view/iota.hpp:379:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            auto equal(cursor const & that) const //
data/range-v3-0.11.0/include/range/v3/view/istream.hpp:55:19:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            Val & read() const noexcept
data/range-v3-0.11.0/include/range/v3/view/istream.hpp:59:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/istream.hpp:63:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(cursor that) const
data/range-v3-0.11.0/include/range/v3/view/join.hpp:239:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            constexpr bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/join.hpp:244:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            constexpr auto equal(cursor const & that) const //
data/range-v3-0.11.0/include/range/v3/view/join.hpp:278:41:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            constexpr auto CPP_auto_fun(read)()(const)
data/range-v3-0.11.0/include/range/v3/view/join.hpp:456:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/join.hpp:477:23:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            reference read() const
data/range-v3-0.11.0/include/range/v3/view/linear_distribute.hpp:46:25:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            constexpr T read() const noexcept
data/range-v3-0.11.0/include/range/v3/view/linear_distribute.hpp:50:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            constexpr bool equal(default_sentinel_t) const noexcept
data/range-v3-0.11.0/include/range/v3/view/linear_distribute.hpp:54:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            constexpr bool equal(linear_distribute_view const & other) const noexcept
data/range-v3-0.11.0/include/range/v3/view/move.hpp:53:44:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            range_rvalue_reference_t<CRng> read(iterator_t<CRng> const & it) const
data/range-v3-0.11.0/include/range/v3/view/partial_sum.hpp:113:42:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            constexpr range_value_t<Rng> read() const
data/range-v3-0.11.0/include/range/v3/view/partial_sum.hpp:130:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            constexpr bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/partial_sum.hpp:135:36:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            constexpr bool CPP_fun(equal)(cursor const & that)(const //
data/range-v3-0.11.0/include/range/v3/view/repeat.hpp:59:25:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            Val const & read() const noexcept
data/range-v3-0.11.0/include/range/v3/view/repeat.hpp:63:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(cursor const & that) const
data/range-v3-0.11.0/include/range/v3/view/repeat_n.hpp:61:25:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            Val const & read() const
data/range-v3-0.11.0/include/range/v3/view/repeat_n.hpp:65:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            constexpr bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/repeat_n.hpp:69:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(cursor const & that) const
data/range-v3-0.11.0/include/range/v3/view/sample.hpp:149:36:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            range_reference_t<Rng> read() const
data/range-v3-0.11.0/include/range/v3/view/sample.hpp:153:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/set_algorithm.hpp:179:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            auto CPP_auto_fun(read)()(const)
data/range-v3-0.11.0/include/range/v3/view/set_algorithm.hpp:190:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            auto equal(set_difference_cursor const & that) const //
data/range-v3-0.11.0/include/range/v3/view/set_algorithm.hpp:198:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/set_algorithm.hpp:356:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            auto CPP_auto_fun(read)()(const)
data/range-v3-0.11.0/include/range/v3/view/set_algorithm.hpp:368:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            auto equal(set_intersection_cursor const & that) const //
data/range-v3-0.11.0/include/range/v3/view/set_algorithm.hpp:376:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/set_algorithm.hpp:554:28:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            reference_type read() const noexcept(noexcept(*it1_) && noexcept(*it2_))
data/range-v3-0.11.0/include/range/v3/view/set_algorithm.hpp:570:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            auto equal(set_union_cursor const & that) const //
data/range-v3-0.11.0/include/range/v3/view/set_algorithm.hpp:578:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/set_algorithm.hpp:776:28:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            reference_type read() const noexcept(noexcept(*it1_) && noexcept(*it2_))
data/range-v3-0.11.0/include/range/v3/view/set_algorithm.hpp:804:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            auto equal(set_symmetric_difference_cursor const & that) const
data/range-v3-0.11.0/include/range/v3/view/set_algorithm.hpp:812:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/sliding.hpp:206:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            auto read(iterator_t<Rng> const & it) const
data/range-v3-0.11.0/include/range/v3/view/sliding.hpp:280:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            auto read(iterator_t<Rng> const & it) const
data/range-v3-0.11.0/include/range/v3/view/sliding.hpp:332:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            auto read(iterator_t<CRng> const & it) const
data/range-v3-0.11.0/include/range/v3/view/span.hpp:317:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            return ranges::equal(*this, that);
data/range-v3-0.11.0/include/range/v3/view/split_when.hpp:85:24:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            reference_ read() const
data/range-v3-0.11.0/include/range/v3/view/split_when.hpp:109:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(default_sentinel_t) const
data/range-v3-0.11.0/include/range/v3/view/split_when.hpp:113:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(cursor const & that) const
data/range-v3-0.11.0/include/range/v3/view/transform.hpp:136:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            auto CPP_auto_fun(read)(iterator_t<CRng> it)(const)
data/range-v3-0.11.0/include/range/v3/view/transform.hpp:293:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            auto CPP_auto_fun(read)()(const)
data/range-v3-0.11.0/include/range/v3/view/transform.hpp:304:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            auto equal(cursor const & that) const //
data/range-v3-0.11.0/include/range/v3/view/transform.hpp:314:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(sentinel<Const> const & s) const
data/range-v3-0.11.0/include/range/v3/view/zip_with.hpp:229:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            auto CPP_auto_fun(read)()(const)
data/range-v3-0.11.0/include/range/v3/view/zip_with.hpp:239:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            auto equal(cursor const & that) const //
data/range-v3-0.11.0/include/range/v3/view/zip_with.hpp:253:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            bool equal(sentinel<Const> const & s) const
data/range-v3-0.11.0/perf/range_conversion.cpp:35:52:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            return !ranges::empty(word) && ranges::equal(word, word | views::reverse);
data/range-v3-0.11.0/perf/range_conversion.cpp:50:52:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            return !ranges::empty(word) && ranges::equal(word, word | views::reverse);
data/range-v3-0.11.0/test/action/shuffle.cpp:36:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(v, v2));
data/range-v3-0.11.0/test/action/shuffle.cpp:41:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(equal(v, v2));
data/range-v3-0.11.0/test/action/shuffle.cpp:49:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(v, v2));
data/range-v3-0.11.0/test/action/sort.cpp:50:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(equal(v, v2));
data/range-v3-0.11.0/test/action/stable_sort.cpp:64:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(equal(v, v2));
data/range-v3-0.11.0/test/action/unique.cpp:41:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(equal(v, views::ints(1,100)));
data/range-v3-0.11.0/test/algorithm/copy.cpp:32:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    return ranges::equal(b, a);
data/range-v3-0.11.0/test/algorithm/copy.cpp:51:16:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(std::equal(a, a + size(a), out));
data/range-v3-0.11.0/test/algorithm/copy.cpp:54:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!std::equal(a, a + size(a), out));
data/range-v3-0.11.0/test/algorithm/copy.cpp:59:16:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(std::equal(a, a + size(a), out));
data/range-v3-0.11.0/test/algorithm/copy.cpp:70:81:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
        CHECK(res3.in == std::next(begin(str), static_cast<std::ptrdiff_t>(std::strlen(sz))));
data/range-v3-0.11.0/test/algorithm/copy.cpp:71:38:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
        CHECK(res3.out == buf + std::strlen(sz));
data/range-v3-0.11.0/test/algorithm/copy.cpp:82:38:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
        CHECK(res3.out == buf + std::strlen(sz));
data/range-v3-0.11.0/test/algorithm/copy_backward.cpp:35:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(std::equal(a, a + size(a), out));
data/range-v3-0.11.0/test/algorithm/copy_backward.cpp:43:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(std::equal(a, a + size(a), out));
data/range-v3-0.11.0/test/algorithm/copy_backward.cpp:52:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(std::equal(a, a + size(a), out));
data/range-v3-0.11.0/test/algorithm/copy_backward.cpp:62:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(std::equal(a, a + size(a), out));
data/range-v3-0.11.0/test/algorithm/copy_backward.cpp:70:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(std::equal(a, a + size(a), out));
data/range-v3-0.11.0/test/algorithm/equal.cpp:35:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(equal(InputIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:50:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(InputIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:85:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(equal(make_subrange(InputIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:88:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(equal(make_subrange(InputIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:92:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(equal(make_subrange(RandomAccessIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:96:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(equal(make_subrange(RandomAccessIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:100:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(InputIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:103:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(InputIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:107:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:111:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:115:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(InputIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:119:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:123:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:212:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(equal(make_subrange(InputIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:216:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(equal(make_subrange(InputIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:221:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(equal(make_subrange(RandomAccessIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:226:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(equal(make_subrange(RandomAccessIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:233:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(InputIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:240:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:247:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:253:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(InputIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:257:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(InputIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:262:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:267:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(!equal(make_subrange(RandomAccessIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/equal.cpp:291:27:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    static_assert(ranges::equal(IL{}, IL{}), "");
data/range-v3-0.11.0/test/algorithm/is_permutation.cpp:716:23:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::is_permutation(ForwardIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/is_permutation.cpp:739:23:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::is_permutation(ForwardIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/is_permutation.cpp:762:23:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::is_permutation(ranges::make_subrange(ForwardIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/is_permutation.cpp:766:23:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::is_permutation(ranges::make_subrange(ForwardIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/is_permutation.cpp:770:23:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::is_permutation(ranges::make_subrange(ForwardIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/is_permutation.cpp:774:23:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::is_permutation(ranges::make_subrange(ForwardIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/is_permutation.cpp:785:23:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::is_permutation(ranges::make_subrange(ForwardIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/is_permutation.cpp:790:23:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::is_permutation(ranges::make_subrange(ForwardIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/is_permutation.cpp:795:23:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::is_permutation(ranges::make_subrange(ForwardIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/is_permutation.cpp:800:23:  [1] (buffer) is_permutation:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::is_permutation(ranges::make_subrange(ForwardIterator<const int*>(ia),
data/range-v3-0.11.0/test/algorithm/mismatch.cpp:38:19:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(ranges::mismatch(Iter(ia), Sent(ia + sa), Iter(ib)) ==
data/range-v3-0.11.0/test/algorithm/mismatch.cpp:61:19:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(ranges::mismatch(rng1, Iter(ib)) ==
data/range-v3-0.11.0/test/algorithm/mismatch.cpp:63:23:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    auto r1 = ranges::mismatch(std::move(rng1), Iter(ib));
data/range-v3-0.11.0/test/algorithm/mismatch.cpp:68:19:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(ranges::mismatch(rng2,rng3) ==
data/range-v3-0.11.0/test/algorithm/mismatch.cpp:70:23:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    auto r2 = ranges::mismatch(std::move(rng2), std::move(rng3));
data/range-v3-0.11.0/test/algorithm/mismatch.cpp:73:23:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    auto r3 = ranges::mismatch(rng2, std::move(rng3));
data/range-v3-0.11.0/test/algorithm/mismatch.cpp:76:23:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    auto r4 = ranges::mismatch(std::move(rng2), rng3);
data/range-v3-0.11.0/test/algorithm/mismatch.cpp:81:19:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(ranges::mismatch(rng4,rng5) ==
data/range-v3-0.11.0/test/algorithm/mismatch.cpp:85:19:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(ranges::mismatch(rng6,Iter(ib),std::equal_to<int>()) ==
data/range-v3-0.11.0/test/algorithm/mismatch.cpp:89:19:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(ranges::mismatch(rng7,rng8,std::equal_to<int>()) ==
data/range-v3-0.11.0/test/algorithm/mismatch.cpp:93:19:  [1] (buffer) mismatch:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    CHECK(ranges::mismatch(rng9,rng10,std::equal_to<int>()) ==
data/range-v3-0.11.0/test/algorithm/sample.cpp:66:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, c));
data/range-v3-0.11.0/test/algorithm/sample.cpp:73:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/sample.cpp:74:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(b, c));
data/range-v3-0.11.0/test/algorithm/sample.cpp:81:27:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(ranges::equal(a, c));
data/range-v3-0.11.0/test/algorithm/sample.cpp:96:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/sample.cpp:103:27:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/sample.cpp:110:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/sample.cpp:111:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(b, c));
data/range-v3-0.11.0/test/algorithm/sample.cpp:119:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, c));
data/range-v3-0.11.0/test/algorithm/sample.cpp:133:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/sample.cpp:140:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(b, c));
data/range-v3-0.11.0/test/algorithm/sample.cpp:141:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/sample.cpp:168:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, c));
data/range-v3-0.11.0/test/algorithm/sample.cpp:175:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/sample.cpp:176:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(b, c));
data/range-v3-0.11.0/test/algorithm/sample.cpp:183:27:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(ranges::equal(a, c));
data/range-v3-0.11.0/test/algorithm/sample.cpp:198:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/sample.cpp:205:27:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/sample.cpp:212:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/sample.cpp:213:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(b, c));
data/range-v3-0.11.0/test/algorithm/sample.cpp:221:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, c));
data/range-v3-0.11.0/test/algorithm/sample.cpp:235:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/sample.cpp:242:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(b, c));
data/range-v3-0.11.0/test/algorithm/sample.cpp:243:28:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/shuffle.cpp:43:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/shuffle.cpp:46:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/shuffle.cpp:49:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::equal(a, c));
data/range-v3-0.11.0/test/algorithm/shuffle.cpp:50:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(!ranges::equal(b, c));
data/range-v3-0.11.0/test/algorithm/shuffle.cpp:60:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/shuffle.cpp:63:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/shuffle.cpp:66:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/shuffle.cpp:67:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(!ranges::equal(b, c));
data/range-v3-0.11.0/test/algorithm/shuffle.cpp:71:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(!ranges::equal(a, c));
data/range-v3-0.11.0/test/algorithm/shuffle.cpp:79:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(!ranges::equal(a, c));
data/range-v3-0.11.0/test/algorithm/shuffle.cpp:82:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(!ranges::equal(b, c));
data/range-v3-0.11.0/test/algorithm/shuffle.cpp:83:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/algorithm/shuffle.cpp:91:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(!ranges::equal(a, b));
data/range-v3-0.11.0/test/array.hpp:198:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        return ranges::equal(x.elems_, x.elems_ + N, y.elems_);
data/range-v3-0.11.0/test/iterator/basic_iterator.cpp:57:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        auto read() const -> decltype(*it_)
data/range-v3-0.11.0/test/iterator/basic_iterator.cpp:129:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        auto read() const -> decltype(*it_)
data/range-v3-0.11.0/test/iterator/basic_iterator.cpp:136:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool equal(cursor<J> const & that) const
data/range-v3-0.11.0/test/iterator/basic_iterator.cpp:296:20:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        value_type read() const
data/range-v3-0.11.0/test/iterator/basic_iterator.cpp:312:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool equal(cursor const & that) const
data/range-v3-0.11.0/test/iterator/basic_iterator.cpp:398:19:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        reference read() const
data/range-v3-0.11.0/test/iterator/basic_iterator.cpp:418:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool equal(zip1_cursor const & that) const
data/range-v3-0.11.0/test/iterator/basic_iterator.cpp:478:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        auto read() const -> decltype(*it_)
data/range-v3-0.11.0/test/iterator/basic_iterator.cpp:485:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool equal(cursor<J> const & that) const
data/range-v3-0.11.0/test/iterator/basic_iterator.cpp:574:17:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            int read() const
data/range-v3-0.11.0/test/iterator/common_iterator.cpp:24:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        int read() const { return 0; }
data/range-v3-0.11.0/test/iterator/common_iterator.cpp:44:13:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        int read() const { return 42; }
data/range-v3-0.11.0/test/numeric/iota.cpp:39:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::equal(ia, ir));
data/range-v3-0.11.0/test/numeric/iota.cpp:46:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::equal(ia, ir));
data/range-v3-0.11.0/test/range/index.cpp:41:27:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(ranges::equal(ranges::views::c_str(e.what()),
data/range-v3-0.11.0/test/range/index.cpp:52:27:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(ranges::equal(ranges::views::c_str(e.what()),
data/range-v3-0.11.0/test/range/index.cpp:69:27:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(ranges::equal(ranges::views::c_str(e.what()),
data/range-v3-0.11.0/test/range/index.cpp:80:27:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(ranges::equal(ranges::views::c_str(e.what()),
data/range-v3-0.11.0/test/range/index.cpp:97:27:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(ranges::equal(ranges::views::c_str(e.what()),
data/range-v3-0.11.0/test/range/index.cpp:108:27:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            CHECK(ranges::equal(ranges::views::c_str(e.what()),
data/range-v3-0.11.0/test/view/adaptor.cpp:67:46:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        ranges::range_reference_t<BidiRange> read(base_iterator_t it) const
data/range-v3-0.11.0/test/view/addressof.cpp:59:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        int &read() const noexcept
data/range-v3-0.11.0/test/view/addressof.cpp:63:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool equal(default_sentinel_t) const
data/range-v3-0.11.0/test/view/addressof.cpp:105:15:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        int &&read() const noexcept;
data/range-v3-0.11.0/test/view/addressof.cpp:106:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool equal(default_sentinel_t) const;
data/range-v3-0.11.0/test/view/facade.cpp:34:21:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        int const & read() const
data/range-v3-0.11.0/test/view/facade.cpp:38:14:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        bool equal(cursor const &that) const
data/range-v3-0.11.0/test/view/linear_distribute.cpp:54:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::equal(frng, il, float_eq));
data/range-v3-0.11.0/test/view/sample.cpp:26:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(!ranges::equal(rng, tmp));
data/range-v3-0.11.0/test/view/sample.cpp:29:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        CHECK(ranges::equal(rng, tmp));
data/range-v3-0.11.0/test_package/example.cpp:24:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    char const & read() const { return *sz_; }
data/range-v3-0.11.0/test_package/example.cpp:25:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    bool equal(default_sentinel_t) const { return *sz_ == '\0'; }

ANALYSIS SUMMARY:

Hits = 321
Lines analyzed = 98716 in approximately 2.44 seconds (40535 lines/second)
Physical Source Lines of Code (SLOC) = 74109
Hits@level = [0]   1 [1] 307 [2]   6 [3]   0 [4]   8 [5]   0
Hits@level+ = [0+] 322 [1+] 321 [2+]  14 [3+]   8 [4+]   8 [5+]   0
Hits/KSLOC@level+ = [0+] 4.34495 [1+] 4.33146 [2+] 0.188911 [3+] 0.107949 [4+] 0.107949 [5+]   0
Dot directories skipped = 3 (--followdotdir overrides)
Minimum risk level = 1
Not every hit is necessarily a security vulnerability.
There may be other security vulnerabilities; review your code!
See 'Secure Programming HOWTO'
(https://dwheeler.com/secure-programs) for more information.