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/libflathashmap-0.0+git20180715.2c46874/bytell_hash_map.hpp
Examining data/libflathashmap-0.0+git20180715.2c46874/flat_hash_map.hpp
Examining data/libflathashmap-0.0+git20180715.2c46874/unordered_map.hpp

FINAL RESULTS:

data/libflathashmap-0.0+git20180715.2c46874/bytell_hash_map.hpp:162:49:  [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.
        : ByteAlloc(alloc), Hasher(hash), Equal(equal)
data/libflathashmap-0.0+git20180715.2c46874/bytell_hash_map.hpp:181:49:  [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.
        : sherwood_v8_table(bucket_count, hash, equal, alloc)
data/libflathashmap-0.0+git20180715.2c46874/bytell_hash_map.hpp:196:49:  [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.
        : sherwood_v8_table(bucket_count, hash, equal, alloc)
data/libflathashmap-0.0+git20180715.2c46874/flat_hash_map.hpp:304:50:  [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.
        : EntryAlloc(alloc), Hasher(hash), Equal(equal)
data/libflathashmap-0.0+git20180715.2c46874/flat_hash_map.hpp:322:49:  [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.
        : sherwood_v3_table(bucket_count, hash, equal, alloc)
data/libflathashmap-0.0+git20180715.2c46874/flat_hash_map.hpp:337:49:  [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.
        : sherwood_v3_table(bucket_count, hash, equal, alloc)
data/libflathashmap-0.0+git20180715.2c46874/unordered_map.hpp:79:50:  [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.
        : EntryAlloc(alloc), Hasher(hash), Equal(equal), BucketAllocator(alloc)
data/libflathashmap-0.0+git20180715.2c46874/unordered_map.hpp:97:50:  [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.
        : sherwood_v10_table(bucket_count, hash, equal, alloc)
data/libflathashmap-0.0+git20180715.2c46874/unordered_map.hpp:112:50:  [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.
        : sherwood_v10_table(bucket_count, hash, equal, alloc)

ANALYSIS SUMMARY:

Hits = 9
Lines analyzed = 3641 in approximately 0.14 seconds (25481 lines/second)
Physical Source Lines of Code (SLOC) = 3388
Hits@level = [0]   0 [1]   9 [2]   0 [3]   0 [4]   0 [5]   0
Hits@level+ = [0+]   9 [1+]   9 [2+]   0 [3+]   0 [4+]   0 [5+]   0
Hits/KSLOC@level+ = [0+] 2.65643 [1+] 2.65643 [2+]   0 [3+]   0 [4+]   0 [5+]   0
Dot directories skipped = 1 (--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.