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/dlib-19.10/examples/face_landmark_detection_ex.cpp
Examining data/dlib-19.10/examples/krls_filter_ex.cpp
Examining data/dlib-19.10/examples/krls_ex.cpp
Examining data/dlib-19.10/examples/dnn_mmod_find_cars_ex.cpp
Examining data/dlib-19.10/examples/server_iostream_ex.cpp
Examining data/dlib-19.10/examples/dnn_inception_ex.cpp
Examining data/dlib-19.10/examples/empirical_kernel_map_ex.cpp
Examining data/dlib-19.10/examples/dnn_semantic_segmentation_train_ex.cpp
Examining data/dlib-19.10/examples/learning_to_track_ex.cpp
Examining data/dlib-19.10/examples/thread_pool_ex.cpp
Examining data/dlib-19.10/examples/server_http_ex.cpp
Examining data/dlib-19.10/examples/svm_sparse_ex.cpp
Examining data/dlib-19.10/examples/bayes_net_ex.cpp
Examining data/dlib-19.10/examples/dir_nav_ex.cpp
Examining data/dlib-19.10/examples/dnn_mmod_ex.cpp
Examining data/dlib-19.10/examples/svm_pegasos_ex.cpp
Examining data/dlib-19.10/examples/mpc_ex.cpp
Examining data/dlib-19.10/examples/sockstreambuf_ex.cpp
Examining data/dlib-19.10/examples/using_custom_kernels_ex.cpp
Examining data/dlib-19.10/examples/svm_rank_ex.cpp
Examining data/dlib-19.10/examples/rvm_regression_ex.cpp
Examining data/dlib-19.10/examples/file_to_code_ex.cpp
Examining data/dlib-19.10/examples/timer_ex.cpp
Examining data/dlib-19.10/examples/webcam_face_pose_ex.cpp
Examining data/dlib-19.10/examples/multiclass_classification_ex.cpp
Examining data/dlib-19.10/examples/one_class_classifiers_ex.cpp
Examining data/dlib-19.10/examples/parallel_for_ex.cpp
Examining data/dlib-19.10/examples/dnn_semantic_segmentation_ex.h
Examining data/dlib-19.10/examples/kcentroid_ex.cpp
Examining data/dlib-19.10/examples/sequence_segmenter_ex.cpp
Examining data/dlib-19.10/examples/custom_trainer_ex.cpp
Examining data/dlib-19.10/examples/bayes_net_from_disk_ex.cpp
Examining data/dlib-19.10/examples/surf_ex.cpp
Examining data/dlib-19.10/examples/least_squares_ex.cpp
Examining data/dlib-19.10/examples/hough_transform_ex.cpp
Examining data/dlib-19.10/examples/dnn_imagenet_ex.cpp
Examining data/dlib-19.10/examples/threaded_object_ex.cpp
Examining data/dlib-19.10/examples/integrate_function_adapt_simp_ex.cpp
Examining data/dlib-19.10/examples/matrix_ex.cpp
Examining data/dlib-19.10/examples/graph_labeling_ex.cpp
Examining data/dlib-19.10/examples/queue_ex.cpp
Examining data/dlib-19.10/examples/gui_api_ex.cpp
Examining data/dlib-19.10/examples/thread_function_ex.cpp
Examining data/dlib-19.10/examples/multithreaded_object_ex.cpp
Examining data/dlib-19.10/examples/member_function_pointer_ex.cpp
Examining data/dlib-19.10/examples/config_reader_ex.cpp
Examining data/dlib-19.10/examples/dnn_metric_learning_ex.cpp
Examining data/dlib-19.10/examples/dnn_mmod_dog_hipsterizer.cpp
Examining data/dlib-19.10/examples/train_shape_predictor_ex.cpp
Examining data/dlib-19.10/examples/quantum_computing_ex.cpp
Examining data/dlib-19.10/examples/bridge_ex.cpp
Examining data/dlib-19.10/examples/video_tracking_ex.cpp
Examining data/dlib-19.10/examples/max_cost_assignment_ex.cpp
Examining data/dlib-19.10/examples/dnn_introduction2_ex.cpp
Examining data/dlib-19.10/examples/dnn_mmod_find_cars2_ex.cpp
Examining data/dlib-19.10/examples/dnn_imagenet_train_ex.cpp
Examining data/dlib-19.10/examples/compress_stream_ex.cpp
Examining data/dlib-19.10/examples/rvm_ex.cpp
Examining data/dlib-19.10/examples/optimization_ex.cpp
Examining data/dlib-19.10/examples/object_detector_ex.cpp
Examining data/dlib-19.10/examples/dnn_mmod_train_find_cars_ex.cpp
Examining data/dlib-19.10/examples/dnn_semantic_segmentation_ex.cpp
Examining data/dlib-19.10/examples/mlp_ex.cpp
Examining data/dlib-19.10/examples/bayes_net_gui_ex.cpp
Examining data/dlib-19.10/examples/object_detector_advanced_ex.cpp
Examining data/dlib-19.10/examples/assignment_learning_ex.cpp
Examining data/dlib-19.10/examples/iosockstream_ex.cpp
Examining data/dlib-19.10/examples/svm_struct_ex.cpp
Examining data/dlib-19.10/examples/krr_classification_ex.cpp
Examining data/dlib-19.10/examples/pipe_ex_2.cpp
Examining data/dlib-19.10/examples/rank_features_ex.cpp
Examining data/dlib-19.10/examples/fhog_object_detector_ex.cpp
Examining data/dlib-19.10/examples/matrix_expressions_ex.cpp
Examining data/dlib-19.10/examples/model_selection_ex.cpp
Examining data/dlib-19.10/examples/logger_ex_2.cpp
Examining data/dlib-19.10/examples/xml_parser_ex.cpp
Examining data/dlib-19.10/examples/sockets_ex.cpp
Examining data/dlib-19.10/examples/bsp_ex.cpp
Examining data/dlib-19.10/examples/running_stats_ex.cpp
Examining data/dlib-19.10/examples/face_detection_ex.cpp
Examining data/dlib-19.10/examples/fhog_ex.cpp
Examining data/dlib-19.10/examples/dnn_metric_learning_on_images_ex.cpp
Examining data/dlib-19.10/examples/logger_ex.cpp
Examining data/dlib-19.10/examples/std_allocator_ex.cpp
Examining data/dlib-19.10/examples/kkmeans_ex.cpp
Examining data/dlib-19.10/examples/threads_ex.cpp
Examining data/dlib-19.10/examples/dnn_face_recognition_ex.cpp
Examining data/dlib-19.10/examples/svm_ex.cpp
Examining data/dlib-19.10/examples/krr_regression_ex.cpp
Examining data/dlib-19.10/examples/random_cropper_ex.cpp
Examining data/dlib-19.10/examples/pipe_ex.cpp
Examining data/dlib-19.10/examples/image_ex.cpp
Examining data/dlib-19.10/examples/linear_manifold_regularizer_ex.cpp
Examining data/dlib-19.10/examples/3d_point_cloud_ex.cpp
Examining data/dlib-19.10/examples/sequence_labeler_ex.cpp
Examining data/dlib-19.10/examples/dnn_mmod_face_detection_ex.cpp
Examining data/dlib-19.10/examples/svm_c_ex.cpp
Examining data/dlib-19.10/examples/sqlite_ex.cpp
Examining data/dlib-19.10/examples/dnn_introduction_ex.cpp
Examining data/dlib-19.10/examples/svr_ex.cpp
Examining data/dlib-19.10/examples/train_object_detector.cpp
Examining data/dlib-19.10/examples/logger_custom_output_ex.cpp
Examining data/dlib-19.10/tools/convert_dlib_nets_to_caffe/main.cpp
Examining data/dlib-19.10/tools/python/src/object_detection.cpp
Examining data/dlib-19.10/tools/python/src/image.cpp
Examining data/dlib-19.10/tools/python/src/indexing.h
Examining data/dlib-19.10/tools/python/src/face_recognition.cpp
Examining data/dlib-19.10/tools/python/src/correlation_tracker.cpp
Examining data/dlib-19.10/tools/python/src/cnn_face_detector.cpp
Examining data/dlib-19.10/tools/python/src/svm_struct.cpp
Examining data/dlib-19.10/tools/python/src/simple_object_detector.h
Examining data/dlib-19.10/tools/python/src/shape_predictor.h
Examining data/dlib-19.10/tools/python/src/svm_c_trainer.cpp
Examining data/dlib-19.10/tools/python/src/global_optimization.cpp
Examining data/dlib-19.10/tools/python/src/decision_functions.cpp
Examining data/dlib-19.10/tools/python/src/rectangles.cpp
Examining data/dlib-19.10/tools/python/src/other.cpp
Examining data/dlib-19.10/tools/python/src/matrix.cpp
Examining data/dlib-19.10/tools/python/src/opaque_types.h
Examining data/dlib-19.10/tools/python/src/serialize_object_detector.h
Examining data/dlib-19.10/tools/python/src/vector.cpp
Examining data/dlib-19.10/tools/python/src/image_dataset_metadata.cpp
Examining data/dlib-19.10/tools/python/src/simple_object_detector_py.h
Examining data/dlib-19.10/tools/python/src/numpy_returns.cpp
Examining data/dlib-19.10/tools/python/src/dlib.cpp
Examining data/dlib-19.10/tools/python/src/cca.cpp
Examining data/dlib-19.10/tools/python/src/shape_predictor.cpp
Examining data/dlib-19.10/tools/python/src/svm_rank_trainer.cpp
Examining data/dlib-19.10/tools/python/src/basic.cpp
Examining data/dlib-19.10/tools/python/src/gui.cpp
Examining data/dlib-19.10/tools/python/src/numpy_returns_stub.cpp
Examining data/dlib-19.10/tools/python/src/testing_results.h
Examining data/dlib-19.10/tools/python/src/sequence_segmenter.cpp
Examining data/dlib-19.10/tools/python/src/conversion.h
Examining data/dlib-19.10/tools/archive/train_face_5point_model.cpp
Examining data/dlib-19.10/tools/imglab/src/main.cpp
Examining data/dlib-19.10/tools/imglab/src/convert_idl.h
Examining data/dlib-19.10/tools/imglab/src/common.cpp
Examining data/dlib-19.10/tools/imglab/src/convert_idl.cpp
Examining data/dlib-19.10/tools/imglab/src/flip_dataset.h
Examining data/dlib-19.10/tools/imglab/src/cluster.h
Examining data/dlib-19.10/tools/imglab/src/common.h
Examining data/dlib-19.10/tools/imglab/src/convert_pascal_xml.h
Examining data/dlib-19.10/tools/imglab/src/convert_pascal_v1.h
Examining data/dlib-19.10/tools/imglab/src/convert_pascal_v1.cpp
Examining data/dlib-19.10/tools/imglab/src/cluster.cpp
Examining data/dlib-19.10/tools/imglab/src/metadata_editor.cpp
Examining data/dlib-19.10/tools/imglab/src/metadata_editor.h
Examining data/dlib-19.10/tools/imglab/src/flip_dataset.cpp
Examining data/dlib-19.10/tools/imglab/src/convert_pascal_xml.cpp
Examining data/dlib-19.10/tools/htmlify/to_xml_example/test.cpp
Examining data/dlib-19.10/tools/htmlify/to_xml.cpp
Examining data/dlib-19.10/tools/htmlify/htmlify.cpp
Examining data/dlib-19.10/tools/htmlify/to_xml.h
Examining data/dlib-19.10/dlib/sequence.h
Examining data/dlib-19.10/dlib/tokenizer/tokenizer_kernel_1.h
Examining data/dlib-19.10/dlib/tokenizer/tokenizer_kernel_c.h
Examining data/dlib-19.10/dlib/tokenizer/tokenizer_kernel_1.cpp
Examining data/dlib-19.10/dlib/tokenizer/tokenizer_kernel_abstract.h
Examining data/dlib-19.10/dlib/geometry/rectangle_abstract.h
Examining data/dlib-19.10/dlib/geometry/drectangle_abstract.h
Examining data/dlib-19.10/dlib/geometry/border_enumerator.h
Examining data/dlib-19.10/dlib/geometry/point_transforms.h
Examining data/dlib-19.10/dlib/geometry/vector_abstract.h
Examining data/dlib-19.10/dlib/geometry/drectangle.h
Examining data/dlib-19.10/dlib/geometry/rectangle.h
Examining data/dlib-19.10/dlib/geometry/vector.h
Examining data/dlib-19.10/dlib/geometry/point_transforms_abstract.h
Examining data/dlib-19.10/dlib/geometry/border_enumerator_abstract.h
Examining data/dlib-19.10/dlib/reference_counter.h
Examining data/dlib-19.10/dlib/image_io.h
Examining data/dlib-19.10/dlib/sockets/windows.h
Examining data/dlib-19.10/dlib/sockets/sockets_kernel_1.cpp
Examining data/dlib-19.10/dlib/sockets/sockets_extensions.h
Examining data/dlib-19.10/dlib/sockets/sockets_kernel_abstract.h
Examining data/dlib-19.10/dlib/sockets/sockets_kernel_2.h
Examining data/dlib-19.10/dlib/sockets/sockets_extensions.cpp
Examining data/dlib-19.10/dlib/sockets/posix.h
Examining data/dlib-19.10/dlib/sockets/sockets_extensions_abstract.h
Examining data/dlib-19.10/dlib/sockets/sockets_kernel_1.h
Examining data/dlib-19.10/dlib/sockets/sockets_kernel_2.cpp
Examining data/dlib-19.10/dlib/matlab/mex_wrapper.cpp
Examining data/dlib-19.10/dlib/matlab/subprocess_stream.h
Examining data/dlib-19.10/dlib/matlab/example_mex_function.cpp
Examining data/dlib-19.10/dlib/matlab/example_mex_struct.cpp
Examining data/dlib-19.10/dlib/matlab/call_matlab.h
Examining data/dlib-19.10/dlib/matlab/subprocess_stream.cpp
Examining data/dlib-19.10/dlib/matlab/example_mex_class.cpp
Examining data/dlib-19.10/dlib/matlab/example_mex_callback.cpp
Examining data/dlib-19.10/dlib/hash_set/hash_set_kernel_abstract.h
Examining data/dlib-19.10/dlib/hash_set/hash_set_kernel_1.h
Examining data/dlib-19.10/dlib/hash_set/hash_set_kernel_c.h
Examining data/dlib-19.10/dlib/memory_manager.h
Examining data/dlib-19.10/dlib/misc_api.h
Examining data/dlib-19.10/dlib/gui_core/windows.h
Examining data/dlib-19.10/dlib/gui_core/gui_core_kernel_2.cpp
Examining data/dlib-19.10/dlib/gui_core/gui_core_kernel_2.h
Examining data/dlib-19.10/dlib/gui_core/gui_core_kernel_1.h
Examining data/dlib-19.10/dlib/gui_core/xlib.h
Examining data/dlib-19.10/dlib/gui_core/gui_core_kernel_1.cpp
Examining data/dlib-19.10/dlib/gui_core/gui_core_kernel_abstract.h
Examining data/dlib-19.10/dlib/entropy_encoder_model/entropy_encoder_model_kernel_1.h
Examining data/dlib-19.10/dlib/entropy_encoder_model/entropy_encoder_model_kernel_6.h
Examining data/dlib-19.10/dlib/entropy_encoder_model/entropy_encoder_model_kernel_2.h
Examining data/dlib-19.10/dlib/entropy_encoder_model/entropy_encoder_model_kernel_5.h
Examining data/dlib-19.10/dlib/entropy_encoder_model/entropy_encoder_model_kernel_3.h
Examining data/dlib-19.10/dlib/entropy_encoder_model/entropy_encoder_model_kernel_abstract.h
Examining data/dlib-19.10/dlib/entropy_encoder_model/entropy_encoder_model_kernel_c.h
Examining data/dlib-19.10/dlib/entropy_encoder_model/entropy_encoder_model_kernel_4.h
Examining data/dlib-19.10/dlib/test/reference_counter.cpp
Examining data/dlib-19.10/dlib/test/elastic_net.cpp
Examining data/dlib-19.10/dlib/test/ranking.cpp
Examining data/dlib-19.10/dlib/test/image.cpp
Examining data/dlib-19.10/dlib/test/parse.cpp
Examining data/dlib-19.10/dlib/test/correlation_tracker.cpp
Examining data/dlib-19.10/dlib/test/static_set.cpp
Examining data/dlib-19.10/dlib/test/sockets.cpp
Examining data/dlib-19.10/dlib/test/main.cpp
Examining data/dlib-19.10/dlib/test/std_vector_c.cpp
Examining data/dlib-19.10/dlib/test/metaprogramming.cpp
Examining data/dlib-19.10/dlib/test/matrix3.cpp
Examining data/dlib-19.10/dlib/test/serialize.cpp
Examining data/dlib-19.10/dlib/test/bigint.cpp
Examining data/dlib-19.10/dlib/test/binary_search_tree_mm2.cpp
Examining data/dlib-19.10/dlib/test/scan_image.cpp
Examining data/dlib-19.10/dlib/test/conditioning_class.cpp
Examining data/dlib-19.10/dlib/test/any_function.cpp
Examining data/dlib-19.10/dlib/test/directed_graph.cpp
Examining data/dlib-19.10/dlib/test/example_args.cpp
Examining data/dlib-19.10/dlib/test/sockets2.cpp
Examining data/dlib-19.10/dlib/test/binary_search_tree.h
Examining data/dlib-19.10/dlib/test/byte_orderer.cpp
Examining data/dlib-19.10/dlib/test/cmd_line_parser_wchar_t.cpp
Examining data/dlib-19.10/dlib/test/one_vs_all_trainer.cpp
Examining data/dlib-19.10/dlib/test/rand.cpp
Examining data/dlib-19.10/dlib/test/gui/main.cpp
Examining data/dlib-19.10/dlib/test/find_max_factor_graph_nmplp.cpp
Examining data/dlib-19.10/dlib/test/array.cpp
Examining data/dlib-19.10/dlib/test/conditioning_class_c.cpp
Examining data/dlib-19.10/dlib/test/config_reader.cpp
Examining data/dlib-19.10/dlib/test/matrix_eig.cpp
Examining data/dlib-19.10/dlib/test/kernel_matrix.cpp
Examining data/dlib-19.10/dlib/test/create_iris_datafile.h
Examining data/dlib-19.10/dlib/test/sparse_vector.cpp
Examining data/dlib-19.10/dlib/test/svr_linear_trainer.cpp
Examining data/dlib-19.10/dlib/test/opt_qp_solver.cpp
Examining data/dlib-19.10/dlib/test/bsp.cpp
Examining data/dlib-19.10/dlib/test/svm_struct.cpp
Examining data/dlib-19.10/dlib/test/learning_to_track.cpp
Examining data/dlib-19.10/dlib/test/sammon.cpp
Examining data/dlib-19.10/dlib/test/one_vs_one_trainer.cpp
Examining data/dlib-19.10/dlib/test/queue.cpp
Examining data/dlib-19.10/dlib/test/hash_set.cpp
Examining data/dlib-19.10/dlib/test/string.cpp
Examining data/dlib-19.10/dlib/test/base64.cpp
Examining data/dlib-19.10/dlib/test/random_forest.cpp
Examining data/dlib-19.10/dlib/test/checkerboard.h
Examining data/dlib-19.10/dlib/test/threads.cpp
Examining data/dlib-19.10/dlib/test/set.cpp
Examining data/dlib-19.10/dlib/test/member_function_pointer.cpp
Examining data/dlib-19.10/dlib/test/fhog.cpp
Examining data/dlib-19.10/dlib/test/iosockstream.cpp
Examining data/dlib-19.10/dlib/test/bridge.cpp
Examining data/dlib-19.10/dlib/test/least_squares.cpp
Examining data/dlib-19.10/dlib/test/global_optimization.cpp
Examining data/dlib-19.10/dlib/test/hash.cpp
Examining data/dlib-19.10/dlib/test/compress_stream.cpp
Examining data/dlib-19.10/dlib/test/tester.cpp
Examining data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp
Examining data/dlib-19.10/dlib/test/hog_image.cpp
Examining data/dlib-19.10/dlib/test/example.cpp
Examining data/dlib-19.10/dlib/test/svm_c_linear.cpp
Examining data/dlib-19.10/dlib/test/binary_search_tree_kernel_2a.cpp
Examining data/dlib-19.10/dlib/test/cublas.cpp
Examining data/dlib-19.10/dlib/test/sequence_labeler.cpp
Examining data/dlib-19.10/dlib/test/numerical_integration.cpp
Examining data/dlib-19.10/dlib/test/matrix.cpp
Examining data/dlib-19.10/dlib/test/hash_table.cpp
Examining data/dlib-19.10/dlib/test/clustering.cpp
Examining data/dlib-19.10/dlib/test/sequence.cpp
Examining data/dlib-19.10/dlib/test/create_iris_datafile.cpp
Examining data/dlib-19.10/dlib/test/trust_region.cpp
Examining data/dlib-19.10/dlib/test/object_detector.cpp
Examining data/dlib-19.10/dlib/test/isotonic_regression.cpp
Examining data/dlib-19.10/dlib/test/sliding_buffer.cpp
Examining data/dlib-19.10/dlib/test/find_optimal_parameters.cpp
Examining data/dlib-19.10/dlib/test/kmeans.cpp
Examining data/dlib-19.10/dlib/test/optimization_test_functions.h
Examining data/dlib-19.10/dlib/test/active_learning.cpp
Examining data/dlib-19.10/dlib/test/bayes_nets.cpp
Examining data/dlib-19.10/dlib/test/svm_c_linear_dcd.cpp
Examining data/dlib-19.10/dlib/test/entropy_encoder_model.cpp
Examining data/dlib-19.10/dlib/test/md5.cpp
Examining data/dlib-19.10/dlib/test/entropy_coder.cpp
Examining data/dlib-19.10/dlib/test/graph.cpp
Examining data/dlib-19.10/dlib/test/matrix4.cpp
Examining data/dlib-19.10/dlib/test/find_max_factor_graph_viterbi.cpp
Examining data/dlib-19.10/dlib/test/dnn.cpp
Examining data/dlib-19.10/dlib/test/optimization.cpp
Examining data/dlib-19.10/dlib/test/type_safe_union.cpp
Examining data/dlib-19.10/dlib/test/cmd_line_parser.cpp
Examining data/dlib-19.10/dlib/test/pixel.cpp
Examining data/dlib-19.10/dlib/test/hash_map.cpp
Examining data/dlib-19.10/dlib/test/matrix_lu.cpp
Examining data/dlib-19.10/dlib/test/array2d.cpp
Examining data/dlib-19.10/dlib/test/pyramid_down.cpp
Examining data/dlib-19.10/dlib/test/cca.cpp
Examining data/dlib-19.10/dlib/test/blas_bindings/blas_bindings_scal_axpy.cpp
Examining data/dlib-19.10/dlib/test/blas_bindings/vector.cpp
Examining data/dlib-19.10/dlib/test/blas_bindings/blas_bindings_dot.cpp
Examining data/dlib-19.10/dlib/test/blas_bindings/blas_bindings_ger.cpp
Examining data/dlib-19.10/dlib/test/blas_bindings/blas_bindings_gemv.cpp
Examining data/dlib-19.10/dlib/test/blas_bindings/blas_bindings_gemm.cpp
Examining data/dlib-19.10/dlib/test/kcentroid.cpp
Examining data/dlib-19.10/dlib/test/statistics.cpp
Examining data/dlib-19.10/dlib/test/data_io.cpp
Examining data/dlib-19.10/dlib/test/lz77_buffer.cpp
Examining data/dlib-19.10/dlib/test/tester.h
Examining data/dlib-19.10/dlib/test/svm_multiclass_linear.cpp
Examining data/dlib-19.10/dlib/test/graph_cuts.cpp
Examining data/dlib-19.10/dlib/test/parallel_for.cpp
Examining data/dlib-19.10/dlib/test/any.cpp
Examining data/dlib-19.10/dlib/test/timer.cpp
Examining data/dlib-19.10/dlib/test/stack.cpp
Examining data/dlib-19.10/dlib/test/max_sum_submatrix.cpp
Examining data/dlib-19.10/dlib/test/read_write_mutex.cpp
Examining data/dlib-19.10/dlib/test/optimization_test_functions.cpp
Examining data/dlib-19.10/dlib/test/tuple.cpp
Examining data/dlib-19.10/dlib/test/ekm_and_lisf.cpp
Examining data/dlib-19.10/dlib/test/lspi.cpp
Examining data/dlib-19.10/dlib/test/max_cost_assignment.cpp
Examining data/dlib-19.10/dlib/test/rls.cpp
Examining data/dlib-19.10/dlib/test/conditioning_class.h
Examining data/dlib-19.10/dlib/test/svm.cpp
Examining data/dlib-19.10/dlib/test/discriminant_pca.cpp
Examining data/dlib-19.10/dlib/test/tokenizer.cpp
Examining data/dlib-19.10/dlib/test/static_map.cpp
Examining data/dlib-19.10/dlib/test/sldf.cpp
Examining data/dlib-19.10/dlib/test/geometry.cpp
Examining data/dlib-19.10/dlib/test/map.cpp
Examining data/dlib-19.10/dlib/test/matrix_chol.cpp
Examining data/dlib-19.10/dlib/test/assignment_learning.cpp
Examining data/dlib-19.10/dlib/test/mpc.cpp
Examining data/dlib-19.10/dlib/test/pipe.cpp
Examining data/dlib-19.10/dlib/test/matrix2.cpp
Examining data/dlib-19.10/dlib/test/binary_search_tree_mm1.cpp
Examining data/dlib-19.10/dlib/test/multithreaded_object.cpp
Examining data/dlib-19.10/dlib/test/oca.cpp
Examining data/dlib-19.10/dlib/test/probabilistic.cpp
Examining data/dlib-19.10/dlib/test/disjoint_subsets.cpp
Examining data/dlib-19.10/dlib/test/linear_manifold_regularizer.cpp
Examining data/dlib-19.10/dlib/test/sequence_segmenter.cpp
Examining data/dlib-19.10/dlib/test/vectorstream.cpp
Examining data/dlib-19.10/dlib/test/crc32.cpp
Examining data/dlib-19.10/dlib/test/binary_search_tree_kernel_1a.cpp
Examining data/dlib-19.10/dlib/test/graph_labeler.cpp
Examining data/dlib-19.10/dlib/test/empirical_kernel_map.cpp
Examining data/dlib-19.10/dlib/test/thread_pool.cpp
Examining data/dlib-19.10/dlib/test/is_same_object.cpp
Examining data/dlib-19.10/dlib/test/filtering.cpp
Examining data/dlib-19.10/dlib/test/face.cpp
Examining data/dlib-19.10/dlib/test/smart_pointers.cpp
Examining data/dlib-19.10/dlib/test/fft.cpp
Examining data/dlib-19.10/dlib/test/disjoint_subsets_sized.cpp
Examining data/dlib-19.10/dlib/test/sockstreambuf.cpp
Examining data/dlib-19.10/dlib/test/cmd_line_parser.h
Examining data/dlib-19.10/dlib/test/matrix_qr.cpp
Examining data/dlib-19.10/dlib/directed_graph/directed_graph_kernel_1.h
Examining data/dlib-19.10/dlib/directed_graph/directed_graph_kernel_abstract.h
Examining data/dlib-19.10/dlib/unicode.h
Examining data/dlib-19.10/dlib/logger/logger_config_file.h
Examining data/dlib-19.10/dlib/logger/logger_kernel_1.h
Examining data/dlib-19.10/dlib/logger/logger_config_file.cpp
Examining data/dlib-19.10/dlib/logger/logger_kernel_abstract.h
Examining data/dlib-19.10/dlib/logger/extra_logger_headers.cpp
Examining data/dlib-19.10/dlib/logger/extra_logger_headers.h
Examining data/dlib-19.10/dlib/logger/logger_kernel_1.cpp
Examining data/dlib-19.10/dlib/config_reader/config_reader_kernel_1.h
Examining data/dlib-19.10/dlib/config_reader/config_reader_thread_safe_1.h
Examining data/dlib-19.10/dlib/config_reader/config_reader_kernel_abstract.h
Examining data/dlib-19.10/dlib/config_reader/config_reader_thread_safe_abstract.h
Examining data/dlib-19.10/dlib/bigint.h
Examining data/dlib-19.10/dlib/java/swig_api.h
Examining data/dlib-19.10/dlib/java/java_array.h
Examining data/dlib-19.10/dlib/simd.h
Examining data/dlib-19.10/dlib/byte_orderer.h
Examining data/dlib-19.10/dlib/static_set.h
Examining data/dlib-19.10/dlib/base64.h
Examining data/dlib-19.10/dlib/is_kind.h
Examining data/dlib-19.10/dlib/filtering/rls_filter_abstract.h
Examining data/dlib-19.10/dlib/filtering/rls_filter.h
Examining data/dlib-19.10/dlib/filtering/kalman_filter_abstract.h
Examining data/dlib-19.10/dlib/filtering/kalman_filter.h
Examining data/dlib-19.10/dlib/filtering/kalman_filter.cpp
Examining data/dlib-19.10/dlib/threads.h
Examining data/dlib-19.10/dlib/graph_utils/graph_utils.h
Examining data/dlib-19.10/dlib/graph_utils/find_k_nearest_neighbors_lsh.h
Examining data/dlib-19.10/dlib/graph_utils/sample_pair_abstract.h
Examining data/dlib-19.10/dlib/graph_utils/find_k_nearest_neighbors_lsh_abstract.h
Examining data/dlib-19.10/dlib/graph_utils/graph_utils_abstract.h
Examining data/dlib-19.10/dlib/graph_utils/ordered_sample_pair_abstract.h
Examining data/dlib-19.10/dlib/graph_utils/edge_list_graphs_abstract.h
Examining data/dlib-19.10/dlib/graph_utils/sample_pair.h
Examining data/dlib-19.10/dlib/graph_utils/function_objects_abstract.h
Examining data/dlib-19.10/dlib/graph_utils/edge_list_graphs.h
Examining data/dlib-19.10/dlib/graph_utils/ordered_sample_pair.h
Examining data/dlib-19.10/dlib/graph_utils/function_objects.h
Examining data/dlib-19.10/dlib/disjoint_subsets/disjoint_subsets_sized.h
Examining data/dlib-19.10/dlib/disjoint_subsets/disjoint_subsets_sized_abstract.h
Examining data/dlib-19.10/dlib/disjoint_subsets/disjoint_subsets.h
Examining data/dlib-19.10/dlib/disjoint_subsets/disjoint_subsets_abstract.h
Examining data/dlib-19.10/dlib/bayes_utils/bayes_utils_abstract.h
Examining data/dlib-19.10/dlib/bayes_utils/bayes_utils.h
Examining data/dlib-19.10/dlib/string.h
Examining data/dlib-19.10/dlib/timing.h
Examining data/dlib-19.10/dlib/entropy_decoder/entropy_decoder_kernel_c.h
Examining data/dlib-19.10/dlib/entropy_decoder/entropy_decoder_kernel_2.cpp
Examining data/dlib-19.10/dlib/entropy_decoder/entropy_decoder_kernel_1.cpp
Examining data/dlib-19.10/dlib/entropy_decoder/entropy_decoder_kernel_2.h
Examining data/dlib-19.10/dlib/entropy_decoder/entropy_decoder_kernel_1.h
Examining data/dlib-19.10/dlib/entropy_decoder/entropy_decoder_kernel_abstract.h
Examining data/dlib-19.10/dlib/entropy_decoder_model.h
Examining data/dlib-19.10/dlib/type_safe_union/type_safe_union_kernel.h
Examining data/dlib-19.10/dlib/type_safe_union/type_safe_union_kernel_abstract.h
Examining data/dlib-19.10/dlib/static_set/static_set_compare_1.h
Examining data/dlib-19.10/dlib/static_set/static_set_kernel_c.h
Examining data/dlib-19.10/dlib/static_set/static_set_kernel_abstract.h
Examining data/dlib-19.10/dlib/static_set/static_set_compare_abstract.h
Examining data/dlib-19.10/dlib/static_set/static_set_kernel_1.h
Examining data/dlib-19.10/dlib/binary_search_tree.h
Examining data/dlib-19.10/dlib/cpp_tokenizer.h
Examining data/dlib-19.10/dlib/static_map.h
Examining data/dlib-19.10/dlib/svm/sort_basis_vectors.h
Examining data/dlib-19.10/dlib/svm/svr_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/svr_trainer.h
Examining data/dlib-19.10/dlib/svm/structural_svm_problem_threaded_abstract.h
Examining data/dlib-19.10/dlib/svm/one_vs_all_decision_function.h
Examining data/dlib-19.10/dlib/svm/structural_object_detection_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/svr_linear_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/cross_validate_assignment_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/roc_trainer.h
Examining data/dlib-19.10/dlib/svm/null_trainer.h
Examining data/dlib-19.10/dlib/svm/svm_c_ekm_trainer.h
Examining data/dlib-19.10/dlib/svm/svm_c_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/kkmeans_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_svm_problem_abstract.h
Examining data/dlib-19.10/dlib/svm/svm_c_linear_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/rls_abstract.h
Examining data/dlib-19.10/dlib/svm/one_vs_one_decision_function.h
Examining data/dlib-19.10/dlib/svm/cross_validate_track_association_trainer.h
Examining data/dlib-19.10/dlib/svm/cross_validate_sequence_labeler.h
Examining data/dlib-19.10/dlib/svm/sparse_kernel_abstract.h
Examining data/dlib-19.10/dlib/svm/svm_c_trainer.h
Examining data/dlib-19.10/dlib/svm/function.h
Examining data/dlib-19.10/dlib/svm/rr_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/cross_validate_multiclass_trainer.h
Examining data/dlib-19.10/dlib/svm/kcentroid_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_svm_graph_labeling_problem.h
Examining data/dlib-19.10/dlib/svm/svm_rank_trainer.h
Examining data/dlib-19.10/dlib/svm/one_vs_one_trainer.h
Examining data/dlib-19.10/dlib/svm/structural_svm_assignment_problem.h
Examining data/dlib-19.10/dlib/svm/empirical_kernel_map_abstract.h
Examining data/dlib-19.10/dlib/svm/svm_rank_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/kernel_matrix_abstract.h
Examining data/dlib-19.10/dlib/svm/sparse_kernel.h
Examining data/dlib-19.10/dlib/svm/svm_c_ekm_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/function_abstract.h
Examining data/dlib-19.10/dlib/svm/svm_multiclass_linear_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/simplify_linear_decision_function.h
Examining data/dlib-19.10/dlib/svm/svm_c_linear_trainer.h
Examining data/dlib-19.10/dlib/svm/structural_svm_distributed.h
Examining data/dlib-19.10/dlib/svm/structural_svm_sequence_labeling_problem_abstract.h
Examining data/dlib-19.10/dlib/svm/kernel_matrix.h
Examining data/dlib-19.10/dlib/svm/track_association_function_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_graph_labeling_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/sparse_vector_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_svm_graph_labeling_problem_abstract.h
Examining data/dlib-19.10/dlib/svm/multiclass_tools_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_sequence_segmentation_trainer.h
Examining data/dlib-19.10/dlib/svm/kernel.h
Examining data/dlib-19.10/dlib/svm/sequence_labeler_abstract.h
Examining data/dlib-19.10/dlib/svm/cross_validate_object_detection_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/kcentroid_overloads.h
Examining data/dlib-19.10/dlib/svm/rvm.h
Examining data/dlib-19.10/dlib/svm/rbf_network_abstract.h
Examining data/dlib-19.10/dlib/svm/feature_ranking.h
Examining data/dlib-19.10/dlib/svm/ranking_tools_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_assignment_trainer.h
Examining data/dlib-19.10/dlib/svm/rls.h
Examining data/dlib-19.10/dlib/svm/cross_validate_track_association_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/num_nonnegative_weights.h
Examining data/dlib-19.10/dlib/svm/cross_validate_object_detection_trainer.h
Examining data/dlib-19.10/dlib/svm/kcentroid.h
Examining data/dlib-19.10/dlib/svm/krls_abstract.h
Examining data/dlib-19.10/dlib/svm/sequence_segmenter_abstract.h
Examining data/dlib-19.10/dlib/svm/assignment_function.h
Examining data/dlib-19.10/dlib/svm/svm_threaded.h
Examining data/dlib-19.10/dlib/svm/rr_trainer.h
Examining data/dlib-19.10/dlib/svm/pegasos_abstract.h
Examining data/dlib-19.10/dlib/svm/cross_validate_sequence_labeler_abstract.h
Examining data/dlib-19.10/dlib/svm/one_vs_all_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/roc_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_sequence_labeling_trainer.h
Examining data/dlib-19.10/dlib/svm/one_vs_one_decision_function_abstract.h
Examining data/dlib-19.10/dlib/svm/svm_threaded_abstract.h
Examining data/dlib-19.10/dlib/svm/null_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/multiclass_tools.h
Examining data/dlib-19.10/dlib/svm/structural_svm_problem.h
Examining data/dlib-19.10/dlib/svm/rbf_network.h
Examining data/dlib-19.10/dlib/svm/sequence_segmenter.h
Examining data/dlib-19.10/dlib/svm/kkmeans.h
Examining data/dlib-19.10/dlib/svm/cross_validate_graph_labeling_trainer.h
Examining data/dlib-19.10/dlib/svm/feature_ranking_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_sequence_labeling_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_object_detection_trainer.h
Examining data/dlib-19.10/dlib/svm/structural_svm_distributed_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_graph_labeling_trainer.h
Examining data/dlib-19.10/dlib/svm/one_vs_all_trainer.h
Examining data/dlib-19.10/dlib/svm/svm.h
Examining data/dlib-19.10/dlib/svm/svm_nu_trainer.h
Examining data/dlib-19.10/dlib/svm/linearly_independent_subset_finder.h
Examining data/dlib-19.10/dlib/svm/structural_assignment_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/cross_validate_regression_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/svm_one_class_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/simplify_linear_decision_function_abstract.h
Examining data/dlib-19.10/dlib/svm/svm_nu_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_svm_object_detection_problem.h
Examining data/dlib-19.10/dlib/svm/null_df.h
Examining data/dlib-19.10/dlib/svm/svm_c_linear_dcd_trainer.h
Examining data/dlib-19.10/dlib/svm/krr_trainer.h
Examining data/dlib-19.10/dlib/svm/krls.h
Examining data/dlib-19.10/dlib/svm/one_vs_one_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/ranking_tools.h
Examining data/dlib-19.10/dlib/svm/structural_svm_problem_threaded.h
Examining data/dlib-19.10/dlib/svm/active_learning_abstract.h
Examining data/dlib-19.10/dlib/svm/cross_validate_assignment_trainer.h
Examining data/dlib-19.10/dlib/svm/cross_validate_multiclass_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/reduced.h
Examining data/dlib-19.10/dlib/svm/svr_linear_trainer.h
Examining data/dlib-19.10/dlib/svm/cross_validate_sequence_segmenter_abstract.h
Examining data/dlib-19.10/dlib/svm/cross_validate_sequence_segmenter.h
Examining data/dlib-19.10/dlib/svm/structural_sequence_segmentation_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_track_association_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/sort_basis_vectors_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_svm_assignment_problem_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_svm_object_detection_problem_abstract.h
Examining data/dlib-19.10/dlib/svm/track_association_function.h
Examining data/dlib-19.10/dlib/svm/assignment_function_abstract.h
Examining data/dlib-19.10/dlib/svm/cross_validate_regression_trainer.h
Examining data/dlib-19.10/dlib/svm/reduced_abstract.h
Examining data/dlib-19.10/dlib/svm/sparse_vector.h
Examining data/dlib-19.10/dlib/svm/kernel_abstract.h
Examining data/dlib-19.10/dlib/svm/svm_c_linear_dcd_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/svm_multiclass_linear_trainer.h
Examining data/dlib-19.10/dlib/svm/sequence_labeler.h
Examining data/dlib-19.10/dlib/svm/linearly_independent_subset_finder_abstract.h
Examining data/dlib-19.10/dlib/svm/empirical_kernel_map.h
Examining data/dlib-19.10/dlib/svm/structural_track_association_trainer.h
Examining data/dlib-19.10/dlib/svm/one_vs_all_decision_function_abstract.h
Examining data/dlib-19.10/dlib/svm/rvm_abstract.h
Examining data/dlib-19.10/dlib/svm/cross_validate_graph_labeling_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/krr_trainer_abstract.h
Examining data/dlib-19.10/dlib/svm/structural_svm_sequence_labeling_problem.h
Examining data/dlib-19.10/dlib/svm/pegasos.h
Examining data/dlib-19.10/dlib/svm/svm_abstract.h
Examining data/dlib-19.10/dlib/svm/svm_one_class_trainer.h
Examining data/dlib-19.10/dlib/svm/active_learning.h
Examining data/dlib-19.10/dlib/quantum_computing/quantum_computing.h
Examining data/dlib-19.10/dlib/quantum_computing/quantum_computing_abstract.h
Examining data/dlib-19.10/dlib/float_details.h
Examining data/dlib-19.10/dlib/uintn.h
Examining data/dlib-19.10/dlib/entropy_encoder_model.h
Examining data/dlib-19.10/dlib/dir_nav.h
Examining data/dlib-19.10/dlib/stack_trace.cpp
Examining data/dlib-19.10/dlib/iosockstream/iosockstream_abstract.h
Examining data/dlib-19.10/dlib/iosockstream/iosockstream.h
Examining data/dlib-19.10/dlib/bsp/bsp.cpp
Examining data/dlib-19.10/dlib/bsp/bsp_abstract.h
Examining data/dlib-19.10/dlib/bsp/bsp.h
Examining data/dlib-19.10/dlib/graph_cuts.h
Examining data/dlib-19.10/dlib/control/mpc.h
Examining data/dlib-19.10/dlib/control/approximate_linear_models.h
Examining data/dlib-19.10/dlib/control/lspi.h
Examining data/dlib-19.10/dlib/control/mpc_abstract.h
Examining data/dlib-19.10/dlib/control/approximate_linear_models_abstract.h
Examining data/dlib-19.10/dlib/control/lspi_abstract.h
Examining data/dlib-19.10/dlib/hash_map.h
Examining data/dlib-19.10/dlib/pixel.h
Examining data/dlib-19.10/dlib/numerical_integration.h
Examining data/dlib-19.10/dlib/sync_extension/sync_extension_kernel_abstract.h
Examining data/dlib-19.10/dlib/sync_extension/sync_extension_kernel_1.h
Examining data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.h
Examining data/dlib-19.10/dlib/dir_nav/windows.h
Examining data/dlib-19.10/dlib/dir_nav/dir_nav_extensions_abstract.h
Examining data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_abstract.h
Examining data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_1.h
Examining data/dlib-19.10/dlib/dir_nav/dir_nav_extensions.cpp
Examining data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.cpp
Examining data/dlib-19.10/dlib/dir_nav/dir_nav_extensions.h
Examining data/dlib-19.10/dlib/dir_nav/posix.h
Examining data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_1.cpp
Examining data/dlib-19.10/dlib/std_allocator.h
Examining data/dlib-19.10/dlib/matrix/matrix_subexp.h
Examining data/dlib-19.10/dlib/matrix/matrix_generic_image.h
Examining data/dlib-19.10/dlib/matrix/matrix_math_functions.h
Examining data/dlib-19.10/dlib/matrix/matrix_utilities.h
Examining data/dlib-19.10/dlib/matrix/matrix_expressions.h
Examining data/dlib-19.10/dlib/matrix/matrix_la.h
Examining data/dlib-19.10/dlib/matrix/matrix_assign.h
Examining data/dlib-19.10/dlib/matrix/cblas_constants.h
Examining data/dlib-19.10/dlib/matrix/matrix_exp_abstract.h
Examining data/dlib-19.10/dlib/matrix/matrix_conj_trans.h
Examining data/dlib-19.10/dlib/matrix/matrix_math_functions_abstract.h
Examining data/dlib-19.10/dlib/matrix/matrix_abstract.h
Examining data/dlib-19.10/dlib/matrix/matrix_conv_abstract.h
Examining data/dlib-19.10/dlib/matrix/matrix_qr.h
Examining data/dlib-19.10/dlib/matrix/matrix_mat.h
Examining data/dlib-19.10/dlib/matrix/matrix_fft.h
Examining data/dlib-19.10/dlib/matrix/matrix_read_from_istream.h
Examining data/dlib-19.10/dlib/matrix/matrix_assign_fwd.h
Examining data/dlib-19.10/dlib/matrix/matrix_blas_bindings.h
Examining data/dlib-19.10/dlib/matrix/matrix_fwd.h
Examining data/dlib-19.10/dlib/matrix/matrix_op.h
Examining data/dlib-19.10/dlib/matrix/matrix_utilities_abstract.h
Examining data/dlib-19.10/dlib/matrix/matrix_trsm.h
Examining data/dlib-19.10/dlib/matrix/matrix_conv.h
Examining data/dlib-19.10/dlib/matrix/matrix_mat_abstract.h
Examining data/dlib-19.10/dlib/matrix/matrix_fft_abstract.h
Examining data/dlib-19.10/dlib/matrix/symmetric_matrix_cache_abstract.h
Examining data/dlib-19.10/dlib/matrix/matrix_data_layout.h
Examining data/dlib-19.10/dlib/matrix/symmetric_matrix_cache.h
Examining data/dlib-19.10/dlib/matrix/matrix_lu.h
Examining data/dlib-19.10/dlib/matrix/matrix_data_layout_abstract.h
Examining data/dlib-19.10/dlib/matrix/matrix_la_abstract.h
Examining data/dlib-19.10/dlib/matrix/matrix_default_mul.h
Examining data/dlib-19.10/dlib/matrix/matrix_exp.h
Examining data/dlib-19.10/dlib/matrix/matrix.h
Examining data/dlib-19.10/dlib/matrix/matrix_cholesky.h
Examining data/dlib-19.10/dlib/matrix/matrix_eigenvalue.h
Examining data/dlib-19.10/dlib/matrix/lapack/geqrf.h
Examining data/dlib-19.10/dlib/matrix/lapack/syevr.h
Examining data/dlib-19.10/dlib/matrix/lapack/gesdd.h
Examining data/dlib-19.10/dlib/matrix/lapack/potrf.h
Examining data/dlib-19.10/dlib/matrix/lapack/geev.h
Examining data/dlib-19.10/dlib/matrix/lapack/getrf.h
Examining data/dlib-19.10/dlib/matrix/lapack/gesvd.h
Examining data/dlib-19.10/dlib/matrix/lapack/fortran_id.h
Examining data/dlib-19.10/dlib/matrix/lapack/syev.h
Examining data/dlib-19.10/dlib/matrix/lapack/gees.h
Examining data/dlib-19.10/dlib/matrix/lapack/pbtrf.h
Examining data/dlib-19.10/dlib/matrix/lapack/ormqr.h
Examining data/dlib-19.10/dlib/matrix/matrix_subexp_abstract.h
Examining data/dlib-19.10/dlib/rand.h
Examining data/dlib-19.10/dlib/memory_manager/memory_manager_kernel_abstract.h
Examining data/dlib-19.10/dlib/memory_manager/memory_manager_kernel_2.h
Examining data/dlib-19.10/dlib/memory_manager/memory_manager_kernel_1.h
Examining data/dlib-19.10/dlib/memory_manager/memory_manager_kernel_3.h
Examining data/dlib-19.10/dlib/disjoint_subsets.h
Examining data/dlib-19.10/dlib/image_transforms.h
Examining data/dlib-19.10/dlib/directed_graph.h
Examining data/dlib-19.10/dlib/graph.h
Examining data/dlib-19.10/dlib/mlp/mlp_kernel_abstract.h
Examining data/dlib-19.10/dlib/mlp/mlp_kernel_c.h
Examining data/dlib-19.10/dlib/mlp/mlp_kernel_1.h
Examining data/dlib-19.10/dlib/global_optimization/find_max_global_abstract.h
Examining data/dlib-19.10/dlib/global_optimization/find_max_global.h
Examining data/dlib-19.10/dlib/global_optimization/upper_bound_function.h
Examining data/dlib-19.10/dlib/global_optimization/global_function_search.cpp
Examining data/dlib-19.10/dlib/global_optimization/global_function_search_abstract.h
Examining data/dlib-19.10/dlib/global_optimization/upper_bound_function_abstract.h
Examining data/dlib-19.10/dlib/global_optimization/global_function_search.h
Examining data/dlib-19.10/dlib/static_map/static_map_kernel_c.h
Examining data/dlib-19.10/dlib/static_map/static_map_kernel_1.h
Examining data/dlib-19.10/dlib/static_map/static_map_kernel_abstract.h
Examining data/dlib-19.10/dlib/metaprogramming.h
Examining data/dlib-19.10/dlib/control.h
Examining data/dlib-19.10/dlib/sort.h
Examining data/dlib-19.10/dlib/rand/rand_kernel_1.h
Examining data/dlib-19.10/dlib/rand/rand_kernel_abstract.h
Examining data/dlib-19.10/dlib/rand/mersenne_twister.h
Examining data/dlib-19.10/dlib/cmd_line_parser/get_option_abstract.h
Examining data/dlib-19.10/dlib/cmd_line_parser/cmd_line_parser_check_1.h
Examining data/dlib-19.10/dlib/cmd_line_parser/cmd_line_parser_kernel_1.h
Examining data/dlib-19.10/dlib/cmd_line_parser/cmd_line_parser_kernel_c.h
Examining data/dlib-19.10/dlib/cmd_line_parser/get_option.h
Examining data/dlib-19.10/dlib/cmd_line_parser/cmd_line_parser_kernel_abstract.h
Examining data/dlib-19.10/dlib/cmd_line_parser/cmd_line_parser_check_c.h
Examining data/dlib-19.10/dlib/cmd_line_parser/cmd_line_parser_print_1.h
Examining data/dlib-19.10/dlib/image_loader/jpeg_loader.h
Examining data/dlib-19.10/dlib/image_loader/png_loader.h
Examining data/dlib-19.10/dlib/image_loader/png_loader.cpp
Examining data/dlib-19.10/dlib/image_loader/image_loader.h
Examining data/dlib-19.10/dlib/image_loader/load_image.h
Examining data/dlib-19.10/dlib/image_loader/png_loader_abstract.h
Examining data/dlib-19.10/dlib/image_loader/jpeg_loader.cpp
Examining data/dlib-19.10/dlib/image_loader/load_image_abstract.h
Examining data/dlib-19.10/dlib/image_loader/jpeg_loader_abstract.h
Examining data/dlib-19.10/dlib/image_loader/image_loader_abstract.h
Examining data/dlib-19.10/dlib/array.h
Examining data/dlib-19.10/dlib/graph_cuts/graph_labeler.h
Examining data/dlib-19.10/dlib/graph_cuts/min_cut.h
Examining data/dlib-19.10/dlib/graph_cuts/graph_labeler_abstract.h
Examining data/dlib-19.10/dlib/graph_cuts/min_cut_abstract.h
Examining data/dlib-19.10/dlib/graph_cuts/general_potts_problem.h
Examining data/dlib-19.10/dlib/graph_cuts/find_max_factor_graph_potts_abstract.h
Examining data/dlib-19.10/dlib/graph_cuts/find_max_factor_graph_potts.h
Examining data/dlib-19.10/dlib/graph_cuts/general_flow_graph.h
Examining data/dlib-19.10/dlib/smart_pointers.h
Examining data/dlib-19.10/dlib/threads/read_write_mutex_extension_abstract.h
Examining data/dlib-19.10/dlib/threads/threaded_object_extension.cpp
Examining data/dlib-19.10/dlib/threads/windows.h
Examining data/dlib-19.10/dlib/threads/multithreaded_object_extension.cpp
Examining data/dlib-19.10/dlib/threads/thread_pool_extension_abstract.h
Examining data/dlib-19.10/dlib/threads/threaded_object_extension.h
Examining data/dlib-19.10/dlib/threads/parallel_for_extension.h
Examining data/dlib-19.10/dlib/threads/thread_function_extension.h
Examining data/dlib-19.10/dlib/threads/multithreaded_object_extension.h
Examining data/dlib-19.10/dlib/threads/auto_mutex_extension_abstract.h
Examining data/dlib-19.10/dlib/threads/threads_kernel_abstract.h
Examining data/dlib-19.10/dlib/threads/rsignaler_extension_abstract.h
Examining data/dlib-19.10/dlib/threads/parallel_for_extension_abstract.h
Examining data/dlib-19.10/dlib/threads/async.cpp
Examining data/dlib-19.10/dlib/threads/threads_kernel_shared.cpp
Examining data/dlib-19.10/dlib/threads/threads_kernel_2.h
Examining data/dlib-19.10/dlib/threads/threads_kernel_1.h
Examining data/dlib-19.10/dlib/threads/async_abstract.h
Examining data/dlib-19.10/dlib/threads/rmutex_extension.h
Examining data/dlib-19.10/dlib/threads/auto_mutex_extension.h
Examining data/dlib-19.10/dlib/threads/thread_pool_extension.cpp
Examining data/dlib-19.10/dlib/threads/read_write_mutex_extension.h
Examining data/dlib-19.10/dlib/threads/threaded_object_extension_abstract.h
Examining data/dlib-19.10/dlib/threads/thread_specific_data_extension_abstract.h
Examining data/dlib-19.10/dlib/threads/create_new_thread_extension_abstract.h
Examining data/dlib-19.10/dlib/threads/rmutex_extension_abstract.h
Examining data/dlib-19.10/dlib/threads/thread_pool_extension.h
Examining data/dlib-19.10/dlib/threads/auto_unlock_extension_abstract.h
Examining data/dlib-19.10/dlib/threads/create_new_thread_extension.h
Examining data/dlib-19.10/dlib/threads/auto_unlock_extension.h
Examining data/dlib-19.10/dlib/threads/multithreaded_object_extension_abstract.h
Examining data/dlib-19.10/dlib/threads/thread_function_extension_abstract.h
Examining data/dlib-19.10/dlib/threads/threads_kernel.h
Examining data/dlib-19.10/dlib/threads/threads_kernel_1.cpp
Examining data/dlib-19.10/dlib/threads/posix.h
Examining data/dlib-19.10/dlib/threads/threads_kernel_shared.h
Examining data/dlib-19.10/dlib/threads/rsignaler_extension.h
Examining data/dlib-19.10/dlib/threads/thread_specific_data_extension.h
Examining data/dlib-19.10/dlib/threads/async.h
Examining data/dlib-19.10/dlib/threads/threads_kernel_2.cpp
Examining data/dlib-19.10/dlib/set/set_compare_1.h
Examining data/dlib-19.10/dlib/set/set_kernel_abstract.h
Examining data/dlib-19.10/dlib/set/set_kernel_1.h
Examining data/dlib-19.10/dlib/set/set_compare_abstract.h
Examining data/dlib-19.10/dlib/set/set_kernel_c.h
Examining data/dlib-19.10/dlib/global_optimization.h
Examining data/dlib-19.10/dlib/manifold_regularization/linear_manifold_regularizer_abstract.h
Examining data/dlib-19.10/dlib/manifold_regularization/linear_manifold_regularizer.h
Examining data/dlib-19.10/dlib/tokenizer.h
Examining data/dlib-19.10/dlib/lsh.h
Examining data/dlib-19.10/dlib/smart_pointers/shared_ptr.h
Examining data/dlib-19.10/dlib/smart_pointers/weak_ptr.h
Examining data/dlib-19.10/dlib/smart_pointers/shared_ptr_thread_safe.h
Examining data/dlib-19.10/dlib/smart_pointers/shared_ptr_thread_safe_abstract.h
Examining data/dlib-19.10/dlib/smart_pointers/scoped_ptr.h
Examining data/dlib-19.10/dlib/smart_pointers/weak_ptr_abstract.h
Examining data/dlib-19.10/dlib/smart_pointers/shared_ptr_abstract.h
Examining data/dlib-19.10/dlib/map.h
Examining data/dlib-19.10/dlib/sqlite.h
Examining data/dlib-19.10/dlib/any/any_function_impl.h
Examining data/dlib-19.10/dlib/any/any_abstract.h
Examining data/dlib-19.10/dlib/any/any_trainer.h
Examining data/dlib-19.10/dlib/any/any_function_impl2.h
Examining data/dlib-19.10/dlib/any/any_function_abstract.h
Examining data/dlib-19.10/dlib/any/any_function.h
Examining data/dlib-19.10/dlib/any/any_decision_function_abstract.h
Examining data/dlib-19.10/dlib/any/any_trainer_abstract.h
Examining data/dlib-19.10/dlib/any/any.h
Examining data/dlib-19.10/dlib/any/any_decision_function.h
Examining data/dlib-19.10/dlib/entropy_encoder.h
Examining data/dlib-19.10/dlib/crc32.h
Examining data/dlib-19.10/dlib/vectorstream.h
Examining data/dlib-19.10/dlib/python/pybind_utils.h
Examining data/dlib-19.10/dlib/python/numpy.h
Examining data/dlib-19.10/dlib/python/pyassert.h
Examining data/dlib-19.10/dlib/python/serialize_pickle.h
Examining data/dlib-19.10/dlib/python/numpy_image.h
Examining data/dlib-19.10/dlib/entropy_decoder.h
Examining data/dlib-19.10/dlib/sliding_buffer/sliding_buffer_kernel_c.h
Examining data/dlib-19.10/dlib/sliding_buffer/circular_buffer.h
Examining data/dlib-19.10/dlib/sliding_buffer/sliding_buffer_kernel_1.h
Examining data/dlib-19.10/dlib/sliding_buffer/circular_buffer_abstract.h
Examining data/dlib-19.10/dlib/sliding_buffer/sliding_buffer_kernel_abstract.h
Examining data/dlib-19.10/dlib/byte_orderer/byte_orderer_kernel_1.h
Examining data/dlib-19.10/dlib/byte_orderer/byte_orderer_kernel_abstract.h
Examining data/dlib-19.10/dlib/graph_utils.h
Examining data/dlib-19.10/dlib/optimization/optimization_oca.h
Examining data/dlib-19.10/dlib/optimization/max_cost_assignment.h
Examining data/dlib-19.10/dlib/optimization/find_max_parse_cky_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_search_strategies_abstract.h
Examining data/dlib-19.10/dlib/optimization/find_max_factor_graph_nmplp_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_least_squares.h
Examining data/dlib-19.10/dlib/optimization/max_sum_submatrix.h
Examining data/dlib-19.10/dlib/optimization/find_max_parse_cky.h
Examining data/dlib-19.10/dlib/optimization/optimization_solve_qp2_using_smo_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_search_strategies.h
Examining data/dlib-19.10/dlib/optimization/find_max_factor_graph_viterbi_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_solve_qp3_using_smo.h
Examining data/dlib-19.10/dlib/optimization/isotonic_regression.h
Examining data/dlib-19.10/dlib/optimization/elastic_net_abstract.h
Examining data/dlib-19.10/dlib/optimization/find_optimal_parameters.h
Examining data/dlib-19.10/dlib/optimization/isotonic_regression_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_solve_qp2_using_smo.h
Examining data/dlib-19.10/dlib/optimization/find_optimal_parameters_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization.h
Examining data/dlib-19.10/dlib/optimization/optimization_bobyqa.h
Examining data/dlib-19.10/dlib/optimization/optimization_trust_region.h
Examining data/dlib-19.10/dlib/optimization/optimization_solve_qp_using_smo_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_oca_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_line_search_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_line_search.h
Examining data/dlib-19.10/dlib/optimization/elastic_net.h
Examining data/dlib-19.10/dlib/optimization/find_max_factor_graph_viterbi.h
Examining data/dlib-19.10/dlib/optimization/max_sum_submatrix_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_solve_qp_using_smo.h
Examining data/dlib-19.10/dlib/optimization/optimization_solve_qp3_using_smo_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_least_squares_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_bobyqa_abstract.h
Examining data/dlib-19.10/dlib/optimization/max_cost_assignment_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_stop_strategies.h
Examining data/dlib-19.10/dlib/optimization/find_max_factor_graph_nmplp.h
Examining data/dlib-19.10/dlib/optimization/optimization_trust_region_abstract.h
Examining data/dlib-19.10/dlib/optimization/optimization_stop_strategies_abstract.h
Examining data/dlib-19.10/dlib/cmake_utils/test_for_cpp11/cpp11_test.cpp
Examining data/dlib-19.10/dlib/cmake_utils/test_for_neon/neon_test.cpp
Examining data/dlib-19.10/dlib/compress_stream/compress_stream_kernel_abstract.h
Examining data/dlib-19.10/dlib/compress_stream/compress_stream_kernel_1.h
Examining data/dlib-19.10/dlib/compress_stream/compress_stream_kernel_3.h
Examining data/dlib-19.10/dlib/compress_stream/compress_stream_kernel_2.h
Examining data/dlib-19.10/dlib/logger.h
Examining data/dlib-19.10/dlib/lzp_buffer/lzp_buffer_kernel_2.h
Examining data/dlib-19.10/dlib/lzp_buffer/lzp_buffer_kernel_c.h
Examining data/dlib-19.10/dlib/lzp_buffer/lzp_buffer_kernel_1.h
Examining data/dlib-19.10/dlib/lzp_buffer/lzp_buffer_kernel_abstract.h
Examining data/dlib-19.10/dlib/lsh/hashes.h
Examining data/dlib-19.10/dlib/lsh/create_random_projection_hash_abstract.h
Examining data/dlib-19.10/dlib/lsh/hashes_abstract.h
Examining data/dlib-19.10/dlib/lsh/projection_hash_abstract.h
Examining data/dlib-19.10/dlib/lsh/create_random_projection_hash.h
Examining data/dlib-19.10/dlib/lsh/projection_hash.h
Examining data/dlib-19.10/dlib/mlp.h
Examining data/dlib-19.10/dlib/tuple/tuple_abstract.h
Examining data/dlib-19.10/dlib/tuple/tuple.h
Examining data/dlib-19.10/dlib/hash.h
Examining data/dlib-19.10/dlib/svm_threaded.h
Examining data/dlib-19.10/dlib/binary_search_tree/binary_search_tree_kernel_1.h
Examining data/dlib-19.10/dlib/binary_search_tree/binary_search_tree_kernel_c.h
Examining data/dlib-19.10/dlib/binary_search_tree/binary_search_tree_kernel_abstract.h
Examining data/dlib-19.10/dlib/binary_search_tree/binary_search_tree_kernel_2.h
Examining data/dlib-19.10/dlib/timeout/timeout_abstract.h
Examining data/dlib-19.10/dlib/timeout/timeout.h
Examining data/dlib-19.10/dlib/memory_manager_global/memory_manager_global_kernel_1.h
Examining data/dlib-19.10/dlib/memory_manager_global/memory_manager_global_kernel_abstract.h
Examining data/dlib-19.10/dlib/time_this.h
Examining data/dlib-19.10/dlib/sockets.h
Examining data/dlib-19.10/dlib/statistics/sammon.h
Examining data/dlib-19.10/dlib/statistics/image_feature_sampling.h
Examining data/dlib-19.10/dlib/statistics/average_precision_abstract.h
Examining data/dlib-19.10/dlib/statistics/statistics_abstract.h
Examining data/dlib-19.10/dlib/statistics/average_precision.h
Examining data/dlib-19.10/dlib/statistics/sammon_abstract.h
Examining data/dlib-19.10/dlib/statistics/dpca.h
Examining data/dlib-19.10/dlib/statistics/lda.h
Examining data/dlib-19.10/dlib/statistics/running_gradient.h
Examining data/dlib-19.10/dlib/statistics/vector_normalizer_frobmetric.h
Examining data/dlib-19.10/dlib/statistics/random_subset_selector.h
Examining data/dlib-19.10/dlib/statistics/statistics.h
Examining data/dlib-19.10/dlib/statistics/cca.h
Examining data/dlib-19.10/dlib/statistics/vector_normalizer_frobmetric_abstract.h
Examining data/dlib-19.10/dlib/statistics/image_feature_sampling_abstract.h
Examining data/dlib-19.10/dlib/statistics/cca_abstract.h
Examining data/dlib-19.10/dlib/statistics/dpca_abstract.h
Examining data/dlib-19.10/dlib/statistics/lda_abstract.h
Examining data/dlib-19.10/dlib/statistics/random_subset_selector_abstract.h
Examining data/dlib-19.10/dlib/statistics/running_gradient_abstract.h
Examining data/dlib-19.10/dlib/timer/timer_heavy.h
Examining data/dlib-19.10/dlib/timer/timer_abstract.h
Examining data/dlib-19.10/dlib/timer/timer.h
Examining data/dlib-19.10/dlib/timer/timer.cpp
Examining data/dlib-19.10/dlib/bit_stream/bit_stream_multi_c.h
Examining data/dlib-19.10/dlib/bit_stream/bit_stream_kernel_1.cpp
Examining data/dlib-19.10/dlib/bit_stream/bit_stream_kernel_c.h
Examining data/dlib-19.10/dlib/bit_stream/bit_stream_multi_abstract.h
Examining data/dlib-19.10/dlib/bit_stream/bit_stream_multi_1.h
Examining data/dlib-19.10/dlib/bit_stream/bit_stream_kernel_1.h
Examining data/dlib-19.10/dlib/bit_stream/bit_stream_kernel_abstract.h
Examining data/dlib-19.10/dlib/entropy_encoder/entropy_encoder_kernel_1.cpp
Examining data/dlib-19.10/dlib/entropy_encoder/entropy_encoder_kernel_abstract.h
Examining data/dlib-19.10/dlib/entropy_encoder/entropy_encoder_kernel_2.h
Examining data/dlib-19.10/dlib/entropy_encoder/entropy_encoder_kernel_c.h
Examining data/dlib-19.10/dlib/entropy_encoder/entropy_encoder_kernel_1.h
Examining data/dlib-19.10/dlib/entropy_encoder/entropy_encoder_kernel_2.cpp
Examining data/dlib-19.10/dlib/lzp_buffer.h
Examining data/dlib-19.10/dlib/image_processing.h
Examining data/dlib-19.10/dlib/test_for_odr_violations.cpp
Examining data/dlib-19.10/dlib/cpp_tokenizer/cpp_tokenizer_kernel_abstract.h
Examining data/dlib-19.10/dlib/cpp_tokenizer/cpp_tokenizer_kernel_1.h
Examining data/dlib-19.10/dlib/cpp_tokenizer/cpp_tokenizer_kernel_c.h
Examining data/dlib-19.10/dlib/windows_magic.h
Examining data/dlib-19.10/dlib/crc32/crc32_kernel_1.h
Examining data/dlib-19.10/dlib/crc32/crc32_kernel_abstract.h
Examining data/dlib-19.10/dlib/interfaces/cmd_line_parser_option.h
Examining data/dlib-19.10/dlib/interfaces/enumerable.h
Examining data/dlib-19.10/dlib/interfaces/map_pair.h
Examining data/dlib-19.10/dlib/interfaces/remover.h
Examining data/dlib-19.10/dlib/pipe.h
Examining data/dlib-19.10/dlib/bigint/bigint_kernel_1.h
Examining data/dlib-19.10/dlib/bigint/bigint_kernel_abstract.h
Examining data/dlib-19.10/dlib/bigint/bigint_kernel_2.cpp
Examining data/dlib-19.10/dlib/bigint/bigint_kernel_1.cpp
Examining data/dlib-19.10/dlib/bigint/bigint_kernel_c.h
Examining data/dlib-19.10/dlib/bigint/bigint_kernel_2.h
Examining data/dlib-19.10/dlib/enable_if.h
Examining data/dlib-19.10/dlib/statistics.h
Examining data/dlib-19.10/dlib/image_transforms/edge_detector.h
Examining data/dlib-19.10/dlib/image_transforms/edge_detector_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/morphological_operations.h
Examining data/dlib-19.10/dlib/image_transforms/thresholding_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/assign_image.h
Examining data/dlib-19.10/dlib/image_transforms/assign_image_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/spatial_filtering.h
Examining data/dlib-19.10/dlib/image_transforms/fhog_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/fhog.h
Examining data/dlib-19.10/dlib/image_transforms/image_pyramid_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/hough_transform.h
Examining data/dlib-19.10/dlib/image_transforms/random_cropper.h
Examining data/dlib-19.10/dlib/image_transforms/morphological_operations_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/image_pyramid.h
Examining data/dlib-19.10/dlib/image_transforms/random_color_transform.h
Examining data/dlib-19.10/dlib/image_transforms/integral_image_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/segment_image_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/lbp.h
Examining data/dlib-19.10/dlib/image_transforms/spatial_filtering_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/thresholding.h
Examining data/dlib-19.10/dlib/image_transforms/colormaps_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/random_cropper_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/hough_transform_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/integral_image.h
Examining data/dlib-19.10/dlib/image_transforms/equalize_histogram_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/equalize_histogram.h
Examining data/dlib-19.10/dlib/image_transforms/segment_image.h
Examining data/dlib-19.10/dlib/image_transforms/draw_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/interpolation_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/label_connected_blobs_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/lbp_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/random_color_transform_abstract.h
Examining data/dlib-19.10/dlib/image_transforms/draw.h
Examining data/dlib-19.10/dlib/image_transforms/interpolation.h
Examining data/dlib-19.10/dlib/image_transforms/colormaps.h
Examining data/dlib-19.10/dlib/image_transforms/label_connected_blobs.h
Examining data/dlib-19.10/dlib/numeric_constants.h
Examining data/dlib-19.10/dlib/image_processing/object_detector.h
Examining data/dlib-19.10/dlib/image_processing/scan_image_boxes_abstract.h
Examining data/dlib-19.10/dlib/image_processing/correlation_tracker_abstract.h
Examining data/dlib-19.10/dlib/image_processing/box_overlap_testing.h
Examining data/dlib-19.10/dlib/image_processing/detection_template_tools.h
Examining data/dlib-19.10/dlib/image_processing/shape_predictor.h
Examining data/dlib-19.10/dlib/image_processing/remove_unobtainable_rectangles_abstract.h
Examining data/dlib-19.10/dlib/image_processing/scan_image_custom_abstract.h
Examining data/dlib-19.10/dlib/image_processing/shape_predictor_trainer.h
Examining data/dlib-19.10/dlib/image_processing/setup_hashed_features.h
Examining data/dlib-19.10/dlib/image_processing/shape_predictor_trainer_abstract.h
Examining data/dlib-19.10/dlib/image_processing/generic_image.h
Examining data/dlib-19.10/dlib/image_processing/full_object_detection_abstract.h
Examining data/dlib-19.10/dlib/image_processing/shape_predictor_abstract.h
Examining data/dlib-19.10/dlib/image_processing/scan_image_abstract.h
Examining data/dlib-19.10/dlib/image_processing/detection_template_tools_abstract.h
Examining data/dlib-19.10/dlib/image_processing/box_overlap_testing_abstract.h
Examining data/dlib-19.10/dlib/image_processing/scan_fhog_pyramid.h
Examining data/dlib-19.10/dlib/image_processing/full_object_detection.h
Examining data/dlib-19.10/dlib/image_processing/correlation_tracker.h
Examining data/dlib-19.10/dlib/image_processing/frontal_face_detector.h
Examining data/dlib-19.10/dlib/image_processing/scan_image_pyramid.h
Examining data/dlib-19.10/dlib/image_processing/scan_image_boxes.h
Examining data/dlib-19.10/dlib/image_processing/scan_image_pyramid_tools.h
Examining data/dlib-19.10/dlib/image_processing/scan_image_custom.h
Examining data/dlib-19.10/dlib/image_processing/scan_image.h
Examining data/dlib-19.10/dlib/image_processing/remove_unobtainable_rectangles.h
Examining data/dlib-19.10/dlib/image_processing/setup_hashed_features_abstract.h
Examining data/dlib-19.10/dlib/image_processing/frontal_face_detector_abstract.h
Examining data/dlib-19.10/dlib/image_processing/render_face_detections_abstract.h
Examining data/dlib-19.10/dlib/image_processing/render_face_detections.h
Examining data/dlib-19.10/dlib/image_processing/scan_image_pyramid_abstract.h
Examining data/dlib-19.10/dlib/image_processing/object_detector_abstract.h
Examining data/dlib-19.10/dlib/image_processing/scan_fhog_pyramid_abstract.h
Examining data/dlib-19.10/dlib/image_processing/scan_image_pyramid_tools_abstract.h
Examining data/dlib-19.10/dlib/member_function_pointer/member_function_pointer_kernel_abstract.h
Examining data/dlib-19.10/dlib/member_function_pointer/make_mfp.h
Examining data/dlib-19.10/dlib/member_function_pointer/member_function_pointer_kernel_1.h
Examining data/dlib-19.10/dlib/member_function_pointer/make_mfp_abstract.h
Examining data/dlib-19.10/dlib/python.h
Examining data/dlib-19.10/dlib/data_io/mnist.h
Examining data/dlib-19.10/dlib/data_io/mnist_abstract.h
Examining data/dlib-19.10/dlib/data_io/load_image_dataset_abstract.h
Examining data/dlib-19.10/dlib/data_io/libsvm_io.h
Examining data/dlib-19.10/dlib/data_io/mnist.cpp
Examining data/dlib-19.10/dlib/data_io/image_dataset_metadata.cpp
Examining data/dlib-19.10/dlib/data_io/image_dataset_metadata.h
Examining data/dlib-19.10/dlib/data_io/load_image_dataset.h
Examining data/dlib-19.10/dlib/data_io/libsvm_io_abstract.h
Examining data/dlib-19.10/dlib/tuple.h
Examining data/dlib-19.10/dlib/all/source.cpp
Examining data/dlib-19.10/dlib/bound_function_pointer/bound_function_pointer_kernel_1.h
Examining data/dlib-19.10/dlib/bound_function_pointer/bound_function_pointer_kernel_abstract.h
Examining data/dlib-19.10/dlib/memory_manager_stateless/memory_manager_stateless_kernel_2.h
Examining data/dlib-19.10/dlib/memory_manager_stateless/memory_manager_stateless_kernel_abstract.h
Examining data/dlib-19.10/dlib/memory_manager_stateless/memory_manager_stateless_kernel_1.h
Examining data/dlib-19.10/dlib/bound_function_pointer.h
Examining data/dlib-19.10/dlib/filtering.h
Examining data/dlib-19.10/dlib/bridge.h
Examining data/dlib-19.10/dlib/stl_checked.h
Examining data/dlib-19.10/dlib/bayes_utils.h
Examining data/dlib-19.10/dlib/queue.h
Examining data/dlib-19.10/dlib/server.h
Examining data/dlib-19.10/dlib/gui_widgets/canvas_drawing_abstract.h
Examining data/dlib-19.10/dlib/gui_widgets/fonts_abstract.h
Examining data/dlib-19.10/dlib/gui_widgets/base_widgets.h
Examining data/dlib-19.10/dlib/gui_widgets/canvas_drawing.h
Examining data/dlib-19.10/dlib/gui_widgets/drawable_abstract.h
Examining data/dlib-19.10/dlib/gui_widgets/widgets.h
Examining data/dlib-19.10/dlib/gui_widgets/fonts.h
Examining data/dlib-19.10/dlib/gui_widgets/style.h
Examining data/dlib-19.10/dlib/gui_widgets/fonts.cpp
Examining data/dlib-19.10/dlib/gui_widgets/widgets.cpp
Examining data/dlib-19.10/dlib/gui_widgets/style.cpp
Examining data/dlib-19.10/dlib/gui_widgets/drawable.h
Examining data/dlib-19.10/dlib/gui_widgets/nativefont.h
Examining data/dlib-19.10/dlib/gui_widgets/widgets_abstract.h
Examining data/dlib-19.10/dlib/gui_widgets/drawable.cpp
Examining data/dlib-19.10/dlib/gui_widgets/canvas_drawing.cpp
Examining data/dlib-19.10/dlib/gui_widgets/style_abstract.h
Examining data/dlib-19.10/dlib/gui_widgets/base_widgets.cpp
Examining data/dlib-19.10/dlib/gui_widgets/base_widgets_abstract.h
Examining data/dlib-19.10/dlib/optimization.h
Examining data/dlib-19.10/dlib/opencv/to_open_cv_abstract.h
Examining data/dlib-19.10/dlib/opencv/to_open_cv.h
Examining data/dlib-19.10/dlib/opencv/cv_image_abstract.h
Examining data/dlib-19.10/dlib/opencv/cv_image.h
Examining data/dlib-19.10/dlib/opencv.h
Examining data/dlib-19.10/dlib/graph_utils_threaded.h
Examining data/dlib-19.10/dlib/sockstreambuf.h
Examining data/dlib-19.10/dlib/random_forest.h
Examining data/dlib-19.10/dlib/noncopyable.h
Examining data/dlib-19.10/dlib/entropy_decoder_model/entropy_decoder_model_kernel_1.h
Examining data/dlib-19.10/dlib/entropy_decoder_model/entropy_decoder_model_kernel_4.h
Examining data/dlib-19.10/dlib/entropy_decoder_model/entropy_decoder_model_kernel_abstract.h
Examining data/dlib-19.10/dlib/entropy_decoder_model/entropy_decoder_model_kernel_5.h
Examining data/dlib-19.10/dlib/entropy_decoder_model/entropy_decoder_model_kernel_2.h
Examining data/dlib-19.10/dlib/entropy_decoder_model/entropy_decoder_model_kernel_6.h
Examining data/dlib-19.10/dlib/entropy_decoder_model/entropy_decoder_model_kernel_3.h
Examining data/dlib-19.10/dlib/md5/md5_kernel_1.cpp
Examining data/dlib-19.10/dlib/md5/md5_kernel_1.h
Examining data/dlib-19.10/dlib/md5/md5_kernel_abstract.h
Examining data/dlib-19.10/dlib/sqlite/sqlite_abstract.h
Examining data/dlib-19.10/dlib/sqlite/sqlite.h
Examining data/dlib-19.10/dlib/sqlite/sqlite_tools_abstract.h
Examining data/dlib-19.10/dlib/sqlite/sqlite_tools.h
Examining data/dlib-19.10/dlib/unicode/unicode.h
Examining data/dlib-19.10/dlib/unicode/unicode_abstract.h
Examining data/dlib-19.10/dlib/unicode/unicode.cpp
Examining data/dlib-19.10/dlib/stack.h
Examining data/dlib-19.10/dlib/svm.h
Examining data/dlib-19.10/dlib/memory_manager_stateless.h
Examining data/dlib-19.10/dlib/hash_set.h
Examining data/dlib-19.10/dlib/stl_checked/std_vector_c_abstract.h
Examining data/dlib-19.10/dlib/stl_checked/std_vector_c.h
Examining data/dlib-19.10/dlib/conditioning_class/conditioning_class_kernel_2.h
Examining data/dlib-19.10/dlib/conditioning_class/conditioning_class_kernel_abstract.h
Examining data/dlib-19.10/dlib/conditioning_class/conditioning_class_kernel_4.h
Examining data/dlib-19.10/dlib/conditioning_class/conditioning_class_kernel_3.h
Examining data/dlib-19.10/dlib/conditioning_class/conditioning_class_kernel_1.h
Examining data/dlib-19.10/dlib/conditioning_class/conditioning_class_kernel_c.h
Examining data/dlib-19.10/dlib/image_keypoint/surf_abstract.h
Examining data/dlib-19.10/dlib/image_keypoint/hashed_feature_image_abstract.h
Examining data/dlib-19.10/dlib/image_keypoint/poly_image_abstract.h
Examining data/dlib-19.10/dlib/image_keypoint/fine_hog_image_abstract.h
Examining data/dlib-19.10/dlib/image_keypoint/binned_vector_feature_image.h
Examining data/dlib-19.10/dlib/image_keypoint/nearest_neighbor_feature_image_abstract.h
Examining data/dlib-19.10/dlib/image_keypoint/draw_surf_points_abstract.h
Examining data/dlib-19.10/dlib/image_keypoint/draw_surf_points.h
Examining data/dlib-19.10/dlib/image_keypoint/hog.h
Examining data/dlib-19.10/dlib/image_keypoint/hessian_pyramid.h
Examining data/dlib-19.10/dlib/image_keypoint/build_separable_poly_filters.h
Examining data/dlib-19.10/dlib/image_keypoint/hog_abstract.h
Examining data/dlib-19.10/dlib/image_keypoint/binned_vector_feature_image_abstract.h
Examining data/dlib-19.10/dlib/image_keypoint/fine_hog_image.h
Examining data/dlib-19.10/dlib/image_keypoint/nearest_neighbor_feature_image.h
Examining data/dlib-19.10/dlib/image_keypoint/hessian_pyramid_abstract.h
Examining data/dlib-19.10/dlib/image_keypoint/surf.h
Examining data/dlib-19.10/dlib/image_keypoint/hashed_feature_image.h
Examining data/dlib-19.10/dlib/image_keypoint/poly_image.h
Examining data/dlib-19.10/dlib/set.h
Examining data/dlib-19.10/dlib/platform.h
Examining data/dlib-19.10/dlib/sequence/sequence_kernel_1.h
Examining data/dlib-19.10/dlib/sequence/sequence_kernel_2.h
Examining data/dlib-19.10/dlib/sequence/sequence_compare_abstract.h
Examining data/dlib-19.10/dlib/sequence/sequence_kernel_c.h
Examining data/dlib-19.10/dlib/sequence/sequence_compare_1.h
Examining data/dlib-19.10/dlib/sequence/sequence_kernel_abstract.h
Examining data/dlib-19.10/dlib/sequence/sequence_sort_1.h
Examining data/dlib-19.10/dlib/sequence/sequence_sort_2.h
Examining data/dlib-19.10/dlib/sequence/sequence_sort_abstract.h
Examining data/dlib-19.10/dlib/ref.h
Examining data/dlib-19.10/dlib/numerical_integration/integrate_function_adapt_simpson.h
Examining data/dlib-19.10/dlib/numerical_integration/integrate_function_adapt_simpson_abstract.h
Examining data/dlib-19.10/dlib/assert.h
Examining data/dlib-19.10/dlib/member_function_pointer.h
Examining data/dlib-19.10/dlib/lz77_buffer/lz77_buffer_kernel_abstract.h
Examining data/dlib-19.10/dlib/lz77_buffer/lz77_buffer_kernel_1.h
Examining data/dlib-19.10/dlib/lz77_buffer/lz77_buffer_kernel_2.h
Examining data/dlib-19.10/dlib/lz77_buffer/lz77_buffer_kernel_c.h
Examining data/dlib-19.10/dlib/image_keypoint.h
Examining data/dlib-19.10/dlib/sliding_buffer.h
Examining data/dlib-19.10/dlib/quantum_computing.h
Examining data/dlib-19.10/dlib/smart_pointers_thread_safe.h
Examining data/dlib-19.10/dlib/xml_parser.h
Examining data/dlib-19.10/dlib/dnn.h
Examining data/dlib-19.10/dlib/timer.h
Examining data/dlib-19.10/dlib/string/string.h
Examining data/dlib-19.10/dlib/string/string_abstract.h
Examining data/dlib-19.10/dlib/iosockstream.h
Examining data/dlib-19.10/dlib/stack/stack_kernel_abstract.h
Examining data/dlib-19.10/dlib/stack/stack_kernel_1.h
Examining data/dlib-19.10/dlib/stack/stack_kernel_c.h
Examining data/dlib-19.10/dlib/gui_core.h
Examining data/dlib-19.10/dlib/base64/base64_kernel_1.h
Examining data/dlib-19.10/dlib/base64/base64_kernel_abstract.h
Examining data/dlib-19.10/dlib/base64/base64_kernel_1.cpp
Examining data/dlib-19.10/dlib/config_reader.h
Examining data/dlib-19.10/dlib/pipe/pipe_kernel_1.h
Examining data/dlib-19.10/dlib/pipe/pipe_kernel_abstract.h
Examining data/dlib-19.10/dlib/geometry.h
Examining data/dlib-19.10/dlib/cpp_pretty_printer.h
Examining data/dlib-19.10/dlib/bridge/bridge.h
Examining data/dlib-19.10/dlib/bridge/bridge_abstract.h
Examining data/dlib-19.10/dlib/md5.h
Examining data/dlib-19.10/dlib/manifold_regularization.h
Examining data/dlib-19.10/dlib/linker.h
Examining data/dlib-19.10/dlib/console_progress_indicator.h
Examining data/dlib-19.10/dlib/hash_map/hash_map_kernel_c.h
Examining data/dlib-19.10/dlib/hash_map/hash_map_kernel_abstract.h
Examining data/dlib-19.10/dlib/hash_map/hash_map_kernel_1.h
Examining data/dlib-19.10/dlib/http_client/http_client.cpp
Examining data/dlib-19.10/dlib/http_client/http_client.h
Examining data/dlib-19.10/dlib/http_client/http_client_abstract.h
Examining data/dlib-19.10/dlib/cpp_pretty_printer/cpp_pretty_printer_kernel_2.h
Examining data/dlib-19.10/dlib/cpp_pretty_printer/cpp_pretty_printer_kernel_abstract.h
Examining data/dlib-19.10/dlib/cpp_pretty_printer/cpp_pretty_printer_kernel_1.h
Examining data/dlib-19.10/dlib/sockstreambuf/sockstreambuf_unbuffered.cpp
Examining data/dlib-19.10/dlib/sockstreambuf/sockstreambuf_unbuffered.h
Examining data/dlib-19.10/dlib/sockstreambuf/sockstreambuf_abstract.h
Examining data/dlib-19.10/dlib/sockstreambuf/sockstreambuf.h
Examining data/dlib-19.10/dlib/sockstreambuf/sockstreambuf.cpp
Examining data/dlib-19.10/dlib/gui_widgets.h
Examining data/dlib-19.10/dlib/compress_stream.h
Examining data/dlib-19.10/dlib/timeout.h
Examining data/dlib-19.10/dlib/map/map_kernel_c.h
Examining data/dlib-19.10/dlib/map/map_kernel_abstract.h
Examining data/dlib-19.10/dlib/map/map_kernel_1.h
Examining data/dlib-19.10/dlib/server/server_iostream.cpp
Examining data/dlib-19.10/dlib/server/server_kernel.cpp
Examining data/dlib-19.10/dlib/server/server_iostream.h
Examining data/dlib-19.10/dlib/server/server_kernel_abstract.h
Examining data/dlib-19.10/dlib/server/server_http.cpp
Examining data/dlib-19.10/dlib/server/server_http_abstract.h
Examining data/dlib-19.10/dlib/server/server_http.h
Examining data/dlib-19.10/dlib/server/server_iostream_abstract.h
Examining data/dlib-19.10/dlib/server/server_kernel.h
Examining data/dlib-19.10/dlib/graph/graph_kernel_abstract.h
Examining data/dlib-19.10/dlib/graph/graph_kernel_1.h
Examining data/dlib-19.10/dlib/conditioning_class.h
Examining data/dlib-19.10/dlib/lz77_buffer.h
Examining data/dlib-19.10/dlib/config.h
Examining data/dlib-19.10/dlib/sync_extension.h
Examining data/dlib-19.10/dlib/general_hash/general_hash.h
Examining data/dlib-19.10/dlib/general_hash/count_bits.h
Examining data/dlib-19.10/dlib/general_hash/hash.h
Examining data/dlib-19.10/dlib/general_hash/count_bits_abstract.h
Examining data/dlib-19.10/dlib/general_hash/murmur_hash3_abstract.h
Examining data/dlib-19.10/dlib/general_hash/random_hashing_abstract.h
Examining data/dlib-19.10/dlib/general_hash/hash_abstract.h
Examining data/dlib-19.10/dlib/general_hash/murmur_hash3.h
Examining data/dlib-19.10/dlib/general_hash/random_hashing.h
Examining data/dlib-19.10/dlib/set_utils.h
Examining data/dlib-19.10/dlib/bit_stream.h
Examining data/dlib-19.10/dlib/stack_trace.h
Examining data/dlib-19.10/dlib/queue/queue_kernel_1.h
Examining data/dlib-19.10/dlib/queue/queue_kernel_c.h
Examining data/dlib-19.10/dlib/queue/queue_sort_1.h
Examining data/dlib-19.10/dlib/queue/queue_kernel_2.h
Examining data/dlib-19.10/dlib/queue/queue_sort_abstract.h
Examining data/dlib-19.10/dlib/queue/queue_kernel_abstract.h
Examining data/dlib-19.10/dlib/dnn/solvers_abstract.h
Examining data/dlib-19.10/dlib/dnn/utilities.h
Examining data/dlib-19.10/dlib/dnn/utilities_abstract.h
Examining data/dlib-19.10/dlib/dnn/input_abstract.h
Examining data/dlib-19.10/dlib/dnn/solvers.h
Examining data/dlib-19.10/dlib/dnn/layers_abstract.h
Examining data/dlib-19.10/dlib/dnn/cudnn_dlibapi.cpp
Examining data/dlib-19.10/dlib/dnn/loss_abstract.h
Examining data/dlib-19.10/dlib/dnn/trainer.h
Examining data/dlib-19.10/dlib/dnn/gpu_data.h
Examining data/dlib-19.10/dlib/dnn/tensor.h
Examining data/dlib-19.10/dlib/dnn/tensor_tools.cpp
Examining data/dlib-19.10/dlib/dnn/core.h
Examining data/dlib-19.10/dlib/dnn/validation.h
Examining data/dlib-19.10/dlib/dnn/cublas_dlibapi.h
Examining data/dlib-19.10/dlib/dnn/cuda_utils.h
Examining data/dlib-19.10/dlib/dnn/cublas_dlibapi.cpp
Examining data/dlib-19.10/dlib/dnn/curand_dlibapi.h
Examining data/dlib-19.10/dlib/dnn/input.h
Examining data/dlib-19.10/dlib/dnn/cpu_dlib.cpp
Examining data/dlib-19.10/dlib/dnn/layers.h
Examining data/dlib-19.10/dlib/dnn/cpu_dlib.h
Examining data/dlib-19.10/dlib/dnn/loss.h
Examining data/dlib-19.10/dlib/dnn/cusolver_dlibapi.h
Examining data/dlib-19.10/dlib/dnn/cudnn_dlibapi.h
Examining data/dlib-19.10/dlib/dnn/curand_dlibapi.cpp
Examining data/dlib-19.10/dlib/dnn/tensor_abstract.h
Examining data/dlib-19.10/dlib/dnn/cuda_data_ptr.h
Examining data/dlib-19.10/dlib/dnn/gpu_data_abstract.h
Examining data/dlib-19.10/dlib/dnn/core_abstract.h
Examining data/dlib-19.10/dlib/dnn/tensor_tools.h
Examining data/dlib-19.10/dlib/dnn/cuda_data_ptr.cpp
Examining data/dlib-19.10/dlib/dnn/trainer_abstract.h
Examining data/dlib-19.10/dlib/dnn/cuda_errors.h
Examining data/dlib-19.10/dlib/dnn/gpu_data.cpp
Examining data/dlib-19.10/dlib/dnn/cuda_dlib.h
Examining data/dlib-19.10/dlib/serialize.h
Examining data/dlib-19.10/dlib/vectorstream/vectorstream_abstract.h
Examining data/dlib-19.10/dlib/vectorstream/vectorstream.h
Examining data/dlib-19.10/dlib/vectorstream/unserialize.h
Examining data/dlib-19.10/dlib/vectorstream/unserialize_abstract.h
Examining data/dlib-19.10/dlib/matrix.h
Examining data/dlib-19.10/dlib/sparse_vector.h
Examining data/dlib-19.10/dlib/data_io.h
Examining data/dlib-19.10/dlib/linker/linker_kernel_1.cpp
Examining data/dlib-19.10/dlib/linker/linker_kernel_1.h
Examining data/dlib-19.10/dlib/linker/linker_kernel_abstract.h
Examining data/dlib-19.10/dlib/simd/simd4i.h
Examining data/dlib-19.10/dlib/simd/simd8i.h
Examining data/dlib-19.10/dlib/simd/simd8f.h
Examining data/dlib-19.10/dlib/simd/simd4f.h
Examining data/dlib-19.10/dlib/simd/simd_check.h
Examining data/dlib-19.10/dlib/hash_table/hash_table_kernel_2.h
Examining data/dlib-19.10/dlib/hash_table/hash_table_kernel_c.h
Examining data/dlib-19.10/dlib/hash_table/hash_table_kernel_abstract.h
Examining data/dlib-19.10/dlib/hash_table/hash_table_kernel_1.h
Examining data/dlib-19.10/dlib/image_saver/save_png.cpp
Examining data/dlib-19.10/dlib/image_saver/dng_shared.h
Examining data/dlib-19.10/dlib/image_saver/image_saver_abstract.h
Examining data/dlib-19.10/dlib/image_saver/save_jpeg_abstract.h
Examining data/dlib-19.10/dlib/image_saver/image_saver.h
Examining data/dlib-19.10/dlib/image_saver/save_png.h
Examining data/dlib-19.10/dlib/image_saver/save_png_abstract.h
Examining data/dlib-19.10/dlib/image_saver/save_jpeg.cpp
Examining data/dlib-19.10/dlib/image_saver/save_jpeg.h
Examining data/dlib-19.10/dlib/algs.h
Examining data/dlib-19.10/dlib/set_utils/set_utils_abstract.h
Examining data/dlib-19.10/dlib/set_utils/set_utils.h
Examining data/dlib-19.10/dlib/memory_manager_global.h
Examining data/dlib-19.10/dlib/misc_api/windows.h
Examining data/dlib-19.10/dlib/misc_api/misc_api_kernel_1.h
Examining data/dlib-19.10/dlib/misc_api/misc_api_kernel_abstract.h
Examining data/dlib-19.10/dlib/misc_api/misc_api_kernel_2.h
Examining data/dlib-19.10/dlib/misc_api/misc_api_shared.h
Examining data/dlib-19.10/dlib/misc_api/misc_api_kernel_2.cpp
Examining data/dlib-19.10/dlib/misc_api/posix.h
Examining data/dlib-19.10/dlib/misc_api/misc_api_kernel_1.cpp
Examining data/dlib-19.10/dlib/array2d.h
Examining data/dlib-19.10/dlib/xml_parser/xml_parser_kernel_interfaces.h
Examining data/dlib-19.10/dlib/xml_parser/xml_parser_kernel_abstract.h
Examining data/dlib-19.10/dlib/xml_parser/xml_parser_kernel_1.h
Examining data/dlib-19.10/dlib/any.h
Examining data/dlib-19.10/dlib/test_for_odr_violations.h
Examining data/dlib-19.10/dlib/array2d/array2d_generic_image.h
Examining data/dlib-19.10/dlib/array2d/array2d_kernel_abstract.h
Examining data/dlib-19.10/dlib/array2d/serialize_pixel_overloads.h
Examining data/dlib-19.10/dlib/array2d/array2d_kernel.h
Examining data/dlib-19.10/dlib/hash_table.h
Examining data/dlib-19.10/dlib/unordered_pair.h
Examining data/dlib-19.10/dlib/array/array_kernel_abstract.h
Examining data/dlib-19.10/dlib/array/array_tools.h
Examining data/dlib-19.10/dlib/array/array_tools_abstract.h
Examining data/dlib-19.10/dlib/array/array_kernel.h
Examining data/dlib-19.10/dlib/reference_counter/reference_counter_kernel_1.h
Examining data/dlib-19.10/dlib/reference_counter/reference_counter_kernel_abstract.h
Examining data/dlib-19.10/dlib/error.h
Examining data/dlib-19.10/dlib/bits/c++config.h
Examining data/dlib-19.10/dlib/clustering.h
Examining data/dlib-19.10/dlib/bsp.h
Examining data/dlib-19.10/dlib/clustering/chinese_whispers_abstract.h
Examining data/dlib-19.10/dlib/clustering/bottom_up_cluster.h
Examining data/dlib-19.10/dlib/clustering/chinese_whispers.h
Examining data/dlib-19.10/dlib/clustering/spectral_cluster.h
Examining data/dlib-19.10/dlib/clustering/spectral_cluster_abstract.h
Examining data/dlib-19.10/dlib/clustering/modularity_clustering.h
Examining data/dlib-19.10/dlib/clustering/modularity_clustering_abstract.h
Examining data/dlib-19.10/dlib/clustering/bottom_up_cluster_abstract.h
Examining data/dlib-19.10/dlib/random_forest/random_forest_regression.h
Examining data/dlib-19.10/dlib/random_forest/random_forest_regression_abstract.h
Examining data/dlib-19.10/dlib/cmd_line_parser.h
Examining data/dlib-19.10/dlib/type_safe_union.h

FINAL RESULTS:

data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.h:385:36:  [5] (race) readlink:
  This accepts filename arguments; if an attacker can move those files or
  change the link content, a race condition results. Also, it does not
  terminate with ASCII NUL. (CWE-362, CWE-20). Reconsider approach.
                    ssize_t temp = readlink((path+data->d_name).c_str(),buf,sizeof(buf));
data/dlib-19.10/dlib/gui_widgets/nativefont.h:349:30:  [4] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf.
                        p += sprintf(fontset, "-*-*-%s-%c-normal--%d-*-*-*-%c",
data/dlib-19.10/dlib/gui_widgets/nativefont.h:352:29:  [4] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf.
                            sprintf(p, ",-*-*-%s-%c-normal--%d-*-*-*-m",
data/dlib-19.10/dlib/gui_widgets/nativefont.h:361:25:  [4] (buffer) strcpy:
  Does not check for buffer overflows when copying to destination [MS-banned]
  (CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
  easily misused).
                        strcpy(fontset_prev, fontset);
data/dlib-19.10/dlib/matlab/mex_wrapper.cpp:4922:21:  [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.
    MEX_CLASS_NAME* access(uint64 item) // convert numeric ID to pointer to object that can be used.
data/dlib-19.10/dlib/matlab/mex_wrapper.cpp:5095:53:  [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.
                MEX_CLASS_NAME* ptr = class_factory.access(ptr_int);
data/dlib-19.10/dlib/matlab/mex_wrapper.cpp:5111:53:  [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.
                MEX_CLASS_NAME* ptr = class_factory.access(ptr_int);
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:424:13:  [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.
        if (access(program_name, F_OK))
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:426:13:  [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.
        if (access(program_name, X_OK))
data/dlib-19.10/dlib/reference_counter/reference_counter_kernel_1.h:53:29:  [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.
            inline const T& access (
data/dlib-19.10/dlib/reference_counter/reference_counter_kernel_1.h:230:5:  [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.
    access (
data/dlib-19.10/dlib/reference_counter/reference_counter_kernel_abstract.h:100:22:  [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.
            const T& access (
data/dlib-19.10/dlib/svm/kernel_matrix.h:21:40:  [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.
        inline const typename T::type& access ( const matrix_exp<T>& m, long i)
data/dlib-19.10/dlib/svm/kernel_matrix.h:28:80:  [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.
        inline const typename disable_if<is_matrix<T>,typename T::type>::type& access ( const T& m, long i)
data/dlib-19.10/dlib/svm/kernel_matrix.h:36:63:  [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.
        inline typename disable_if<is_pair<T>,const T&>::type access ( const std::vector<T,alloc>& m, long i)
data/dlib-19.10/dlib/svm/kernel_matrix.h:44:63:  [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.
        inline typename disable_if<is_pair<T>,const T&>::type access ( const std_vector_c<T,alloc>& m, long i)
data/dlib-19.10/dlib/svm/kernel_matrix.h:50:57:  [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.
        inline const typename kernel_type::sample_type& access ( 
data/dlib-19.10/dlib/svm/kernel_matrix.h:134:31:  [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 kern(impl::access<K>(vect1,r), impl::access<K>(vect2,c)); 
data/dlib-19.10/dlib/svm/kernel_matrix.h:134:57:  [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 kern(impl::access<K>(vect1,r), impl::access<K>(vect2,c)); 
data/dlib-19.10/dlib/svm/kernel_matrix.h:206:31:  [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 kern(impl::access<K>(vect1,r), impl::access<K>(vect1,c)); 
data/dlib-19.10/dlib/svm/kernel_matrix.h:206:57:  [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 kern(impl::access<K>(vect1,r), impl::access<K>(vect1,c)); 
data/dlib-19.10/dlib/test/reference_counter.cpp:46:31:  [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.
                DLIB_ASSERT(a.access() == j,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:47:31:  [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.
                DLIB_ASSERT(b.access() == j+1,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:48:31:  [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.
                DLIB_ASSERT(c.access() == j+2,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:52:31:  [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.
                DLIB_ASSERT(a.access() == j,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:53:31:  [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.
                DLIB_ASSERT(b.access() == j+1,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:54:31:  [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.
                DLIB_ASSERT(c.access() == j+2,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:59:31:  [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.
                DLIB_ASSERT(a.access() == j+2,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:60:31:  [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.
                DLIB_ASSERT(b.access() == j+1,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:61:31:  [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.
                DLIB_ASSERT(c.access() == j+2,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:65:31:  [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.
                DLIB_ASSERT(a.access() == j+2,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:66:31:  [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.
                DLIB_ASSERT(b.access() == j+1,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:67:31:  [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.
                DLIB_ASSERT(c.access() == j+2,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:73:31:  [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.
                DLIB_ASSERT(a.access() == b.access(),"");
data/dlib-19.10/dlib/test/reference_counter.cpp:73:45:  [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.
                DLIB_ASSERT(a.access() == b.access(),"");
data/dlib-19.10/dlib/test/reference_counter.cpp:74:31:  [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.
                DLIB_ASSERT(a.access() == c.access(),"");
data/dlib-19.10/dlib/test/reference_counter.cpp:74:45:  [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.
                DLIB_ASSERT(a.access() == c.access(),"");
data/dlib-19.10/dlib/test/reference_counter.cpp:75:31:  [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.
                DLIB_ASSERT(c.access() == b.access(),"");
data/dlib-19.10/dlib/test/reference_counter.cpp:75:45:  [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.
                DLIB_ASSERT(c.access() == b.access(),"");
data/dlib-19.10/dlib/test/reference_counter.cpp:77:31:  [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.
                DLIB_ASSERT(a.access() == j,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:78:31:  [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.
                DLIB_ASSERT(a.access() != b.access(),"");
data/dlib-19.10/dlib/test/reference_counter.cpp:78:45:  [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.
                DLIB_ASSERT(a.access() != b.access(),"");
data/dlib-19.10/dlib/test/reference_counter.cpp:79:31:  [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.
                DLIB_ASSERT(a.access() != c.access(),"");
data/dlib-19.10/dlib/test/reference_counter.cpp:79:45:  [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.
                DLIB_ASSERT(a.access() != c.access(),"");
data/dlib-19.10/dlib/test/reference_counter.cpp:80:31:  [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.
                DLIB_ASSERT(c.access() == b.access(),"");
data/dlib-19.10/dlib/test/reference_counter.cpp:80:45:  [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.
                DLIB_ASSERT(c.access() == b.access(),"");
data/dlib-19.10/dlib/test/reference_counter.cpp:81:31:  [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.
                DLIB_ASSERT(c.access() == j+2,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:82:31:  [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.
                DLIB_ASSERT(b.access() == j+2,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:84:31:  [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.
                DLIB_ASSERT(a.access() == j,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:86:31:  [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.
                DLIB_ASSERT(a.access() == j,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:88:31:  [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.
                DLIB_ASSERT(c.access() == j+2,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:89:31:  [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.
                DLIB_ASSERT(b.access() == j+2,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:91:31:  [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.
                DLIB_ASSERT(a.access() == j+2,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:92:31:  [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.
                DLIB_ASSERT(c.access() == j,"");
data/dlib-19.10/dlib/test/reference_counter.cpp:93:31:  [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.
                DLIB_ASSERT(b.access() == j+2,"");
data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.cpp:36:13:  [3] (buffer) realpath:
  This function does not protect against buffer overflows, and some
  implementations can overflow internally (CWE-120/CWE-785!). Ensure that the
  destination buffer is at least of size MAXPATHLEN, andto protect against
  implementation problems, the input argument should also be checked to
  ensure it is no larger than MAXPATHLEN.
        if (realpath(name.c_str(),buf) == 0)
data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.cpp:90:13:  [3] (buffer) realpath:
  This function does not protect against buffer overflows, and some
  implementations can overflow internally (CWE-120/CWE-785!). Ensure that the
  destination buffer is at least of size MAXPATHLEN, andto protect against
  implementation problems, the input argument should also be checked to
  ensure it is no larger than MAXPATHLEN.
        if (realpath(state.full_name.c_str(),buf) == 0)
data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.cpp:94:13:  [3] (buffer) realpath:
  This function does not protect against buffer overflows, and some
  implementations can overflow internally (CWE-120/CWE-785!). Ensure that the
  destination buffer is at least of size MAXPATHLEN, andto protect against
  implementation problems, the input argument should also be checked to
  ensure it is no larger than MAXPATHLEN.
        if (realpath(rhs.state.full_name.c_str(),buf) == 0)
data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.cpp:116:13:  [3] (buffer) realpath:
  This function does not protect against buffer overflows, and some
  implementations can overflow internally (CWE-120/CWE-785!). Ensure that the
  destination buffer is at least of size MAXPATHLEN, andto protect against
  implementation problems, the input argument should also be checked to
  ensure it is no larger than MAXPATHLEN.
        if (realpath(name.c_str(),buf) == 0)
data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.cpp:181:13:  [3] (buffer) realpath:
  This function does not protect against buffer overflows, and some
  implementations can overflow internally (CWE-120/CWE-785!). Ensure that the
  destination buffer is at least of size MAXPATHLEN, andto protect against
  implementation problems, the input argument should also be checked to
  ensure it is no larger than MAXPATHLEN.
        if (realpath(state.full_name.c_str(),buf) == 0)
data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.cpp:185:13:  [3] (buffer) realpath:
  This function does not protect against buffer overflows, and some
  implementations can overflow internally (CWE-120/CWE-785!). Ensure that the
  destination buffer is at least of size MAXPATHLEN, andto protect against
  implementation problems, the input argument should also be checked to
  ensure it is no larger than MAXPATHLEN.
        if (realpath(rhs.state.full_name.c_str(),buf) == 0)
data/dlib-19.10/dlib/dnn/tensor.h:488:20:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                in.setstate(std::ios::badbit);
data/dlib-19.10/dlib/geometry/drectangle.h:277:16:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            in.setstate(in.rdstate() | std::ios::failbit);
data/dlib-19.10/dlib/geometry/drectangle.h:292:16:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            in.setstate(in.rdstate() | std::ios::failbit);
data/dlib-19.10/dlib/geometry/rectangle.h:341:16:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            in.setstate(in.rdstate() | std::ios::failbit);
data/dlib-19.10/dlib/geometry/rectangle.h:356:16:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            in.setstate(in.rdstate() | std::ios::failbit);
data/dlib-19.10/dlib/geometry/vector.h:1177:16:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            in.setstate(in.rdstate() | std::ios::failbit);
data/dlib-19.10/dlib/geometry/vector.h:1211:16:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            in.setstate(in.rdstate() | std::ios::failbit);
data/dlib-19.10/dlib/geometry/vector.h:1242:16:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            in.setstate(in.rdstate() | std::ios::failbit);
data/dlib-19.10/dlib/geometry/vector.h:1268:16:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            in.setstate(in.rdstate() | std::ios::failbit);
data/dlib-19.10/dlib/http_client/http_client.cpp:215:15:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            ::srand( static_cast<unsigned int>(::time(NULL)) );
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:406:28:  [3] (buffer) getenv:
  Environment variables are untrustable input if they can be set by an
  attacker. They can have any content and length, and the same variable can
  be set more than once (CWE-807, CWE-20). Check environment variables
  carefully before using them.
            char* env_fd = getenv("DLIB_SUBPROCESS_DATA_FD");
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:442:30:  [3] (buffer) getenv:
  Environment variables are untrustable input if they can be set by an
  attacker. They can have any content and length, and the same variable can
  be set more than once (CWE-807, CWE-20). Check environment variables
  carefully before using them.
            char* cudadevs = getenv("CUDA_VISIBLE_DEVICES");
data/dlib-19.10/dlib/python/serialize_pickle.h:24:3:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
T setstate(py::tuple state)
data/dlib-19.10/dlib/serialize.h:297:21:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                out.setstate(std::ios::eofbit | std::ios::badbit);
data/dlib-19.10/dlib/serialize.h:342:20:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                in.setstate(std::ios::badbit);
data/dlib-19.10/dlib/serialize.h:360:20:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                in.setstate(std::ios::badbit);
data/dlib-19.10/dlib/serialize.h:415:21:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                out.setstate(std::ios::eofbit | std::ios::badbit);
data/dlib-19.10/dlib/serialize.h:458:20:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                in.setstate(std::ios::badbit);
data/dlib-19.10/dlib/serialize.h:473:20:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                in.setstate(std::ios::badbit);
data/dlib-19.10/dlib/sockets/sockets_extensions.cpp:80:16:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            in.setstate(std::ios::badbit);
data/dlib-19.10/dlib/sockets/sockets_extensions.cpp:90:16:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            in.setstate(std::ios::badbit);
data/dlib-19.10/dlib/test/active_learning.cpp:120:29:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            random_score += random;
data/dlib-19.10/dlib/test/array2d.cpp:36:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/base64.cpp:37:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(seed);
data/dlib-19.10/dlib/test/binary_search_tree.h:43:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/compress_stream.cpp:39:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(seed);
data/dlib-19.10/dlib/test/conditioning_class.h:42:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/dnn.cpp:2301:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(1234);
data/dlib-19.10/dlib/test/dnn.cpp:2410:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(1234);
data/dlib-19.10/dlib/test/dnn.cpp:3171:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(1234);
data/dlib-19.10/dlib/test/entropy_coder.cpp:229:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<int>(time(0)));
data/dlib-19.10/dlib/test/entropy_coder.cpp:332:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(seed1 );
data/dlib-19.10/dlib/test/entropy_coder.cpp:356:17:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
                srand(seed2 );
data/dlib-19.10/dlib/test/entropy_coder.cpp:434:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/entropy_coder.cpp:454:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(seed);
data/dlib-19.10/dlib/test/entropy_encoder_model.cpp:43:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/hash_map.cpp:36:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/hash_set.cpp:37:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/hash_table.cpp:36:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/lz77_buffer.cpp:38:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/lz77_buffer.cpp:378:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/lz77_buffer.cpp:455:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/map.cpp:38:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/matrix2.cpp:581:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(423452);
data/dlib-19.10/dlib/test/matrix2.cpp:623:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(423452);
data/dlib-19.10/dlib/test/matrix2.cpp:664:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(423452);
data/dlib-19.10/dlib/test/matrix2.cpp:708:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(423452);
data/dlib-19.10/dlib/test/matrix2.cpp:746:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(423452);
data/dlib-19.10/dlib/test/matrix2.cpp:775:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(423452);
data/dlib-19.10/dlib/test/matrix2.cpp:806:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(53434);
data/dlib-19.10/dlib/test/matrix2.cpp:832:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(11234);
data/dlib-19.10/dlib/test/matrix2.cpp:859:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(53934);
data/dlib-19.10/dlib/test/matrix2.cpp:883:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(53234);
data/dlib-19.10/dlib/test/matrix2.cpp:906:13:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            srand(53234);
data/dlib-19.10/dlib/test/queue.cpp:43:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/sequence.cpp:37:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/set.cpp:36:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/stack.cpp:37:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/static_map.cpp:40:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/test/static_set.cpp:40:9:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        srand(static_cast<unsigned int>(time(0)));
data/dlib-19.10/dlib/threads/async.cpp:25:28:  [3] (buffer) getenv:
  Environment variables are untrustable input if they can be set by an
  attacker. They can have any content and length, and the same variable can
  be set more than once (CWE-807, CWE-20). Check environment variables
  carefully before using them.
                char* nt = getenv("DLIB_NUM_THREADS");
data/dlib-19.10/examples/queue_ex.cpp:38:5:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    srand(time(0));
data/dlib-19.10/examples/svm_pegasos_ex.cpp:71:5:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    srand(time(0));
data/dlib-19.10/examples/svm_sparse_ex.cpp:63:5:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
    srand(time(0));
data/dlib-19.10/tools/python/src/basic.cpp:159:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/basic.cpp:169:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/basic.cpp:179:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/basic.cpp:191:49:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<range_type>, &setstate<range_type>));
data/dlib-19.10/tools/python/src/basic.cpp:204:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/basic.cpp:214:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/basic.cpp:225:48:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<pair_type>, &setstate<pair_type>));
data/dlib-19.10/tools/python/src/basic.cpp:249:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/basic.cpp:259:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/basic.cpp:269:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/decision_functions.cpp:48:46:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<df_type>, &setstate<df_type>));
data/dlib-19.10/tools/python/src/decision_functions.cpp:103:46:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<df_type>, &setstate<df_type>));
data/dlib-19.10/tools/python/src/face_recognition.cpp:242:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/matrix.cpp:208:53:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<matrix<double>>, &setstate<matrix<double>>));
data/dlib-19.10/tools/python/src/object_detection.cpp:343:46:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
           .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/object_detection.cpp:372:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/rectangles.cpp:145:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/rectangles.cpp:169:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/rectangles.cpp:208:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/rectangles.cpp:255:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/rectangles.cpp:264:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/sequence_segmenter.cpp:794:55:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<segmenter_params>, &setstate<segmenter_params>));
data/dlib-19.10/tools/python/src/sequence_segmenter.cpp:801:53:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<segmenter_type>, &setstate<segmenter_type>));
data/dlib-19.10/tools/python/src/sequence_segmenter.cpp:810:53:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<segmenter_test>, &setstate<segmenter_test>));
data/dlib-19.10/tools/python/src/shape_predictor.cpp:179:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/shape_predictor.cpp:214:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/shape_predictor.cpp:237:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/svm_rank_trainer.cpp:129:64:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<ranking_pair<sample_type>>, &setstate<ranking_pair<sample_type>>));
data/dlib-19.10/tools/python/src/svm_rank_trainer.cpp:135:64:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<ranking_pair<sparse_vect>>, &setstate<ranking_pair<sparse_vect>>));
data/dlib-19.10/tools/python/src/svm_rank_trainer.cpp:141:52:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<ranking_pairs>, &setstate<ranking_pairs>));
data/dlib-19.10/tools/python/src/svm_rank_trainer.cpp:147:59:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<sparse_ranking_pairs>, &setstate<sparse_ranking_pairs>));
data/dlib-19.10/tools/python/src/vector.cpp:160:41:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<cv>, &setstate<cv>));
data/dlib-19.10/tools/python/src/vector.cpp:172:47:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
            .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/tools/python/src/vector.cpp:180:43:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
        .def(py::pickle(&getstate<type>, &setstate<type>));
data/dlib-19.10/dlib/algs.h:842:36:  [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.
    struct _two_bytes_##testname { char a[2]; };                                                       \
data/dlib-19.10/dlib/algs.h:1062:13:  [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 data[size]; 
data/dlib-19.10/dlib/assert.h:102:37:  [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.
        DLIB_NO_WARN_UNUSED typedef char BOOST_JOIN(DLIB_CTA, __LINE__)[::dlib::compile_time_assert<(bool)(expression)>::value] 
data/dlib-19.10/dlib/assert.h:105:37:  [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.
        DLIB_NO_WARN_UNUSED typedef char BOOST_JOIN(DLIB_AAST, __LINE__)[::dlib::assert_are_same_type<type1,type2>::value] 
data/dlib-19.10/dlib/assert.h:108:37:  [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.
        DLIB_NO_WARN_UNUSED typedef char BOOST_JOIN(DLIB_AANST, __LINE__)[::dlib::assert_are_not_same_type<type1,type2>::value] 
data/dlib-19.10/dlib/assert.h:191:33:  [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.
    DLIB_NO_WARN_UNUSED typedef char BOOST_JOIN(DAHSL2_,__LINE__)[sizeof(BOOST_JOIN(DAHSL_,__LINE__))]; 
data/dlib-19.10/dlib/base64/base64_kernel_1.cpp:172:18:  [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.
        unsigned char inbuf[3];
data/dlib-19.10/dlib/base64/base64_kernel_1.cpp:173:18:  [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.
        unsigned char outbuf[4];
data/dlib-19.10/dlib/base64/base64_kernel_1.cpp:319:18:  [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.
        unsigned char inbuf[4];
data/dlib-19.10/dlib/base64/base64_kernel_1.cpp:320:18:  [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.
        unsigned char outbuf[3];
data/dlib-19.10/dlib/bridge/bridge.h:415:29:  [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[1000];
data/dlib-19.10/dlib/compress_stream/compress_stream_kernel_3.h:166:26:  [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.
        mutable unsigned char buffer[9];  
data/dlib-19.10/dlib/data_io/mnist.cpp:27:18:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
            fin1.open((folder_name + "/train-images.idx3-ubyte").c_str(), ios::binary);
data/dlib-19.10/dlib/data_io/mnist.cpp:33:18:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
            fin2.open((folder_name + "/train-labels.idx1-ubyte").c_str(), ios::binary);
data/dlib-19.10/dlib/data_io/mnist.cpp:39:18:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
            fin3.open((folder_name + "/t10k-images.idx3-ubyte").c_str(), ios::binary);
data/dlib-19.10/dlib/data_io/mnist.cpp:45:18:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
            fin4.open((folder_name + "/t10k-labels.idx1-ubyte").c_str(), ios::binary);
data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_1.cpp:35: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[3000];
data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_1.cpp:110: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[3000];
data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.cpp:35: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[PATH_MAX];
data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.cpp:88: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[PATH_MAX];
data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.cpp:115: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[PATH_MAX];
data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.cpp:179: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[PATH_MAX];
data/dlib-19.10/dlib/dir_nav/dir_nav_kernel_2.h:384:21:  [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[PATH_MAX];
data/dlib-19.10/dlib/dnn/cpu_dlib.cpp:2152:23:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                    ::memcpy(dest_p, src_p, block_size * sizeof(float));
data/dlib-19.10/dlib/dnn/cuda_data_ptr.cpp:38:14:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        void memcpy(
data/dlib-19.10/dlib/dnn/cuda_data_ptr.cpp:51:14:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        void memcpy(
data/dlib-19.10/dlib/dnn/cuda_data_ptr.h:56:14:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        void memcpy(
data/dlib-19.10/dlib/dnn/cuda_data_ptr.h:69:14:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        void memcpy(
data/dlib-19.10/dlib/dnn/cuda_data_ptr.h:122:25:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            friend void memcpy(
data/dlib-19.10/dlib/dnn/cuda_data_ptr.h:129:21:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                    memcpy(dest.data(), src.pdata);
data/dlib-19.10/dlib/dnn/cuda_data_ptr.h:132:25:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            friend void memcpy(
data/dlib-19.10/dlib/dnn/cuda_data_ptr.h:141:21:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                    memcpy(src.pdata, dest.data());
data/dlib-19.10/dlib/dnn/gpu_data.cpp:21:10:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
    void memcpy (
data/dlib-19.10/dlib/dnn/gpu_data.cpp:30:9:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        memcpy(dest,0, src, 0, src.size());
data/dlib-19.10/dlib/dnn/gpu_data.cpp:33:10:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
    void memcpy (
data/dlib-19.10/dlib/dnn/gpu_data.h:210:10:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
    void memcpy (gpu_data& dest, const gpu_data& src);
data/dlib-19.10/dlib/dnn/gpu_data.h:212:10:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
    void memcpy (
data/dlib-19.10/dlib/dnn/gpu_data.h:222:17:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
    inline void memcpy (gpu_data& dest, const gpu_data& src)
data/dlib-19.10/dlib/dnn/gpu_data.h:227:14:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        std::memcpy(dest.host_write_only(), src.host(), sizeof(float)*src.size());
data/dlib-19.10/dlib/dnn/gpu_data.h:230:17:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
    inline void memcpy (
data/dlib-19.10/dlib/dnn/gpu_data.h:254:22:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                std::memcpy(dest.host_write_only(), src.host()+src_offset, sizeof(float)*num);
data/dlib-19.10/dlib/dnn/gpu_data.h:256:22:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                std::memcpy(dest.host()+dest_offset, src.host()+src_offset, sizeof(float)*num);
data/dlib-19.10/dlib/dnn/gpu_data_abstract.h:220:10:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
    void memcpy (
data/dlib-19.10/dlib/dnn/gpu_data_abstract.h:236:10:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
    void memcpy (
data/dlib-19.10/dlib/dnn/tensor.h:184:21:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        friend void memcpy (
data/dlib-19.10/dlib/dnn/tensor.h:190:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            memcpy(dest.data(), dest.get_alias_offset(),  
data/dlib-19.10/dlib/dnn/tensor.h:325:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            memcpy(*this, item);
data/dlib-19.10/dlib/dnn/tensor.h:330:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            memcpy(*this, item);
data/dlib-19.10/dlib/dnn/tensor_abstract.h:333:10:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
    void memcpy (
data/dlib-19.10/dlib/dnn/tensor_tools.h:1642:21:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                    memcpy(accum_buffer, *accessible_groups[i][0]);
data/dlib-19.10/dlib/dnn/tensor_tools.h:1650:21:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                    memcpy(*accessible_groups[i][0], total_avg);
data/dlib-19.10/dlib/dnn/tensor_tools.h:1661:21:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                    memcpy(*g[i], *g[0]); 
data/dlib-19.10/dlib/dnn/trainer.h:790:29:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                            memcpy(t, *reference_params[j]);
data/dlib-19.10/dlib/error.h:242:20:  [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.
            static char buf[2000];
data/dlib-19.10/dlib/general_hash/murmur_hash3.h:70:9:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        memcpy(&temp, p+i, 4);
data/dlib-19.10/dlib/general_hash/murmur_hash3.h:97:9:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        memcpy(&temp, p+i, 8);
data/dlib-19.10/dlib/gui_core/gui_core_kernel_2.cpp:803:33:  [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 buffer[2];
data/dlib-19.10/dlib/gui_core/gui_core_kernel_2.cpp:1617:13:  [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 fontset[256];
data/dlib-19.10/dlib/gui_core/gui_core_kernel_2.cpp:1619:13:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
            sprintf(fontset, "-*-*-medium-r-normal--%lu-*-*-*-", native_font_height);
data/dlib-19.10/dlib/gui_widgets/nativefont.h:307:17:  [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 fontset_prev[256];
data/dlib-19.10/dlib/gui_widgets/nativefont.h:346:21:  [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 fontset[256];
data/dlib-19.10/dlib/http_client/http_client.cpp:118: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[21] = { 0 };
data/dlib-19.10/dlib/http_client/http_client.cpp:122:9:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
        sprintf(buf, "%ld", header_value);
data/dlib-19.10/dlib/http_client/http_client.cpp:153: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[21] = { 0 };
data/dlib-19.10/dlib/http_client/http_client.cpp:157:9:  [2] (buffer) sprintf:
  Does not check for buffer overflows (CWE-120). Use sprintf_s, snprintf, or
  vsnprintf. Risk is low because the source has a constant maximum length.
        sprintf(buf, "%ld", cookie_value);
data/dlib-19.10/dlib/http_client/http_client.cpp:409:34:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
                    FILE *fp = ::fopen(fnames->second.c_str(), "rb");
data/dlib-19.10/dlib/http_client/http_client.cpp:578:13:  [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[512];
data/dlib-19.10/dlib/http_client/http_client.cpp:656:43:  [2] (integer) atol:
  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).
                            bytes_total = atol( header_value.c_str() );
data/dlib-19.10/dlib/image_loader/image_loader.h:61:22:  [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.
            unsigned char buf[100];
data/dlib-19.10/dlib/image_loader/image_loader.h:164:34:  [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.
                        unsigned char red[palette_size];
data/dlib-19.10/dlib/image_loader/image_loader.h:165:34:  [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.
                        unsigned char green[palette_size];
data/dlib-19.10/dlib/image_loader/image_loader.h:166:34:  [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.
                        unsigned char blue[palette_size];
data/dlib-19.10/dlib/image_loader/image_loader.h:202:42:  [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.
                                unsigned char pixels[8];
data/dlib-19.10/dlib/image_loader/image_loader.h:239:34:  [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.
                        unsigned char red[palette_size];
data/dlib-19.10/dlib/image_loader/image_loader.h:240:34:  [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.
                        unsigned char green[palette_size];
data/dlib-19.10/dlib/image_loader/image_loader.h:241:34:  [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.
                        unsigned char blue[palette_size];
data/dlib-19.10/dlib/image_loader/image_loader.h:316:34:  [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.
                        unsigned char red[palette_size];
data/dlib-19.10/dlib/image_loader/image_loader.h:317:34:  [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.
                        unsigned char green[palette_size];
data/dlib-19.10/dlib/image_loader/image_loader.h:318:34:  [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.
                        unsigned char blue[palette_size];
data/dlib-19.10/dlib/image_loader/jpeg_loader.cpp:95:20:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        FILE *fp = fopen( filename, "rb" );
data/dlib-19.10/dlib/image_loader/load_image.h:37:13:  [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 buffer[9];
data/dlib-19.10/dlib/image_loader/png_loader.cpp:118:20:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        FILE *fp = fopen( filename, "rb" );
data/dlib-19.10/dlib/image_saver/save_jpeg.cpp:62:25:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        FILE* outfile = fopen(filename.c_str(), "wb");
data/dlib-19.10/dlib/image_saver/save_jpeg.cpp:124:25:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        FILE* outfile = fopen(filename.c_str(), "wb");
data/dlib-19.10/dlib/image_saver/save_png.cpp:42:18:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
            fp = fopen(file_name.c_str(), "wb");
data/dlib-19.10/dlib/image_transforms/random_color_transform.h:126:18:  [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.
        unsigned char rtable[256];
data/dlib-19.10/dlib/image_transforms/random_color_transform.h:127:18:  [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.
        unsigned char gtable[256];
data/dlib-19.10/dlib/image_transforms/random_color_transform.h:128:18:  [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.
        unsigned char btable[256];
data/dlib-19.10/dlib/iosockstream/iosockstream.h:42:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
            open(addr); 
data/dlib-19.10/dlib/iosockstream/iosockstream.h:51:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
            open(addr, timeout); 
data/dlib-19.10/dlib/iosockstream/iosockstream.h:59:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        void open (
data/dlib-19.10/dlib/iosockstream/iosockstream.h:79:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        void open (
data/dlib-19.10/dlib/iosockstream/iosockstream.h:115:25:  [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 junk[100];
data/dlib-19.10/dlib/iosockstream/iosockstream_abstract.h:81:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        void open (
data/dlib-19.10/dlib/iosockstream/iosockstream_abstract.h:98:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        void open (
data/dlib-19.10/dlib/linker/linker_kernel_1.cpp:161: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[200];
data/dlib-19.10/dlib/linker/linker_kernel_1.cpp:289: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[200];
data/dlib-19.10/dlib/logger/logger_kernel_1.h:46: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 name[20];
data/dlib-19.10/dlib/logger/logger_kernel_abstract.h:44: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 name[20];
data/dlib-19.10/dlib/matlab/mex_wrapper.cpp:1118:17:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                memcpy(mxGetPr(plhs), &item(0,0), item.size()*sizeof(double));
data/dlib-19.10/dlib/matlab/mex_wrapper.cpp:1147:17:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                memcpy(mxGetPr(plhs), &item(0,0), item.size()*sizeof(float));
data/dlib-19.10/dlib/matlab/mex_wrapper.cpp:4978: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 ch[20];
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:77:21:  [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[1024];
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:134:21:  [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[1024];
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:276:22:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                std::memcpy(pptr(),s,static_cast<size_t>(num));
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:282:22:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                std::memcpy(pptr(),s,static_cast<size_t>(space_left));
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:295:26:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                    std::memcpy(pptr(),s,static_cast<size_t>(num_left));
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:367:26:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                    std::memcpy(s, gptr(), static_cast<size_t>(n));
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:381:22:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                std::memcpy(s, gptr(), num);
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:408:20:  [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).
            return atoi(env_fd);
data/dlib-19.10/dlib/md5/md5_kernel_1.cpp:253:18:  [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.
        unsigned char output[16];
data/dlib-19.10/dlib/md5/md5_kernel_1.cpp:420:18:  [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.
        unsigned char output[16];
data/dlib-19.10/dlib/md5/md5_kernel_1.cpp:461:18:  [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.
        unsigned char temp[64];
data/dlib-19.10/dlib/memory_manager/memory_manager_kernel_1.h:56:13:  [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 item[sizeof(T)];
data/dlib-19.10/dlib/memory_manager/memory_manager_kernel_2.h:60:13:  [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 item[sizeof(T)];
data/dlib-19.10/dlib/memory_manager/memory_manager_kernel_3.h:65:13:  [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 item[sizeof(T)];
data/dlib-19.10/dlib/misc_api/misc_api_kernel_1.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[1024];
data/dlib-19.10/dlib/misc_api/misc_api_kernel_2.cpp:47: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[1024];
data/dlib-19.10/dlib/serialize.h:273:22:  [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.
            unsigned char buf[9];
data/dlib-19.10/dlib/serialize.h:328:22:  [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.
            unsigned char buf[8];
data/dlib-19.10/dlib/serialize.h:401:22:  [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.
            unsigned char buf[9];
data/dlib-19.10/dlib/serialize.h:445:22:  [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.
            unsigned char buf[8];
data/dlib-19.10/dlib/serialize.h:1654: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 file_header[4] = {0,0,0,0};
data/dlib-19.10/dlib/sockets/sockets_extensions.cpp:322:13:  [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 junk[100];
data/dlib-19.10/dlib/sockets/sockets_kernel_1.cpp:109:13:  [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 temp[NI_MAXHOST];
data/dlib-19.10/dlib/sockets/sockets_kernel_2.cpp:63:13:  [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 temp[MAXHOSTNAMELEN];
data/dlib-19.10/dlib/sockets/sockets_kernel_2.cpp:113:17:  [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 temp[16];
data/dlib-19.10/dlib/sockets/sockets_kernel_2.cpp:170:13:  [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 temp[NI_MAXHOST];
data/dlib-19.10/dlib/sockets/sockets_kernel_2.cpp:680: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 foreign_ip[16];
data/dlib-19.10/dlib/sockets/sockets_kernel_2.cpp:686: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 temp_local_ip[16];
data/dlib-19.10/dlib/sockets/sockets_kernel_2.cpp:1027: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 temp_used_local_ip[16];
data/dlib-19.10/dlib/sockstreambuf/sockstreambuf.cpp:55:18:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            std::memcpy(pptr(),s,static_cast<size_t>(num));
data/dlib-19.10/dlib/sockstreambuf/sockstreambuf.cpp:61:18:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            std::memcpy(pptr(),s,static_cast<size_t>(space_left));
data/dlib-19.10/dlib/sockstreambuf/sockstreambuf.cpp:74:22:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                std::memcpy(pptr(),s,static_cast<size_t>(num_left));
data/dlib-19.10/dlib/sockstreambuf/sockstreambuf.cpp:151:22:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                std::memcpy(s, gptr(), static_cast<size_t>(n));
data/dlib-19.10/dlib/sockstreambuf/sockstreambuf.cpp:165:18:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            std::memcpy(s, gptr(), num);
data/dlib-19.10/dlib/sqlite/sqlite.h:59:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
            open(file);
data/dlib-19.10/dlib/sqlite/sqlite.h:68:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        void open (
data/dlib-19.10/dlib/sqlite/sqlite_abstract.h:75:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        void open (
data/dlib-19.10/dlib/svm/num_nonnegative_weights.h:27:13:  [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 a[2]; 
data/dlib-19.10/dlib/test/byte_orderer.cpp:40:26:  [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.
                unsigned char b[4];
data/dlib-19.10/dlib/test/dnn.cpp:538:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            memcpy(A, truth);
data/dlib-19.10/dlib/test/dnn.cpp:544:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            memcpy(A, truth);
data/dlib-19.10/dlib/test/dnn.cpp:551:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            memcpy(A, truth);
data/dlib-19.10/dlib/test/dnn.cpp:557:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            memcpy(A, truth);
data/dlib-19.10/dlib/test/dnn.cpp:563:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            memcpy(A, truth);
data/dlib-19.10/dlib/test/dnn.cpp:569:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            memcpy(A, truth);
data/dlib-19.10/dlib/test/dnn.cpp:592:17:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                memcpy(aA, aB);
data/dlib-19.10/dlib/test/dnn.cpp:600:17:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                memcpy(aA, aB);
data/dlib-19.10/dlib/test/dnn.cpp:614:17:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                memcpy(aA, aB);
data/dlib-19.10/dlib/test/dnn.cpp:622:17:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                memcpy(aA, aB);
data/dlib-19.10/dlib/test/dnn.cpp:635:17:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                memcpy(aA, aB);
data/dlib-19.10/dlib/test/dnn.cpp:643:17:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                memcpy(aA, aB);
data/dlib-19.10/dlib/test/dnn.cpp:655:17:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                memcpy(aA, aB);
data/dlib-19.10/dlib/test/dnn.cpp:663:17:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                memcpy(aA, aB);
data/dlib-19.10/dlib/test/graph_cuts.cpp:843:13:  [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[sizeof(idx)];
data/dlib-19.10/dlib/test/graph_cuts.cpp:844:13:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
            memcpy(buf,&idx,sizeof(idx));
data/dlib-19.10/dlib/test/main.cpp:77:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
                fout.open("debug.txt",ios::app);
data/dlib-19.10/dlib/test/main.cpp:79:22:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
                fout.open("debug.txt");
data/dlib-19.10/dlib/test/serialize.cpp:977: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[6];
data/dlib-19.10/dlib/test/serialize.cpp:988: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 buf2[6];
data/dlib-19.10/dlib/test/sockets.cpp:58:13:  [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[100];
data/dlib-19.10/dlib/test/sockets2.cpp:155:25:  [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[buf_size];
data/dlib-19.10/dlib/test/vectorstream.cpp:117: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 sbuf[100];
data/dlib-19.10/dlib/timing.h:88:20:  [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.
            static char buf[TIME_SLOTS][NAME_LENGTH] = {{0}};
data/dlib-19.10/dlib/unicode/unicode.h:559:17:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
            fin.open(file_name,mode);
data/dlib-19.10/dlib/unicode/unicode.h:571:17:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
            fin.open(file_name.c_str(),mode);
data/dlib-19.10/dlib/unicode/unicode.h:576:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        void open(
data/dlib-19.10/dlib/unicode/unicode.h:581:13:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
            open(file_name.c_str(),mode);
data/dlib-19.10/dlib/unicode/unicode.h:584:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        void open (
data/dlib-19.10/dlib/unicode/unicode.h:591:17:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
            fin.open(file_name,mode);
data/dlib-19.10/dlib/unicode/unicode_abstract.h:194:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        void open(
data/dlib-19.10/dlib/unicode/unicode_abstract.h:205:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        void open (
data/dlib-19.10/dlib/vectorstream/unserialize.h:68:26:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                    std::memcpy(s, &buffer[read_pos], num);
data/dlib-19.10/dlib/vectorstream/vectorstream.h:106:26:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
                    std::memcpy(s, &buffer[read_pos], num);
data/dlib-19.10/examples/logger_custom_output_ex.cpp:27:14:  [2] (misc) open:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
        fout.open("my_log_file.txt");
data/dlib-19.10/tools/python/src/numpy_returns.cpp:45:9:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        memcpy(outdata, image_data(crop), rows * width_step(crop));
data/dlib-19.10/tools/python/src/numpy_returns.cpp:89:9:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
        memcpy(outdata, image_data(chip), rows * width_step(chip));
data/dlib-19.10/tools/python/src/numpy_returns.cpp:116:5:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
    memcpy(outdata, image_data(chip), num_rows(chip) * width_step(chip));
data/dlib-19.10/dlib/array2d/serialize_pixel_overloads.h:82:20:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                in.read((char*)&item[0][0], sizeof(rgb_pixel)*item.size());
data/dlib-19.10/dlib/array2d/serialize_pixel_overloads.h:152:20:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                in.read((char*)&item[0][0], sizeof(bgr_pixel)*item.size());
data/dlib-19.10/dlib/array2d/serialize_pixel_overloads.h:222:20:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                in.read((char*)&item[0][0], sizeof(hsi_pixel)*item.size());
data/dlib-19.10/dlib/array2d/serialize_pixel_overloads.h:292:20:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                in.read((char*)&item[0][0], sizeof(rgb_alpha_pixel)*item.size());
data/dlib-19.10/dlib/array2d/serialize_pixel_overloads.h:357:20:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                in.read((char*)&item[0][0], sizeof(unsigned char)*item.size());
data/dlib-19.10/dlib/bit_stream/bit_stream_kernel_1.cpp:138:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read (
data/dlib-19.10/dlib/bit_stream/bit_stream_kernel_1.h:82:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        bool read (
data/dlib-19.10/dlib/bit_stream/bit_stream_kernel_abstract.h:142:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        bool read (
data/dlib-19.10/dlib/bit_stream/bit_stream_kernel_c.h:37:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        bool read (
data/dlib-19.10/dlib/bit_stream/bit_stream_kernel_c.h:150:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read (
data/dlib-19.10/dlib/bit_stream/bit_stream_kernel_c.h:163:33:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        return bit_stream_base::read(bit);
data/dlib-19.10/dlib/bit_stream/bit_stream_multi_1.h:84:23:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            if (this->read(bit) == false)
data/dlib-19.10/dlib/bridge/bridge.h:403:36:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                                in.read((char*)&code, sizeof(code));
data/dlib-19.10/dlib/bridge/bridge.h:416:41:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                            while (con->read(buf, sizeof(buf)) > 0) ;
data/dlib-19.10/dlib/data_io/mnist.cpp:57:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        fin1.read((char*)&magic, sizeof(magic));  bo.big_to_host(magic);
data/dlib-19.10/dlib/data_io/mnist.cpp:58:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        fin1.read((char*)&num, sizeof(num));  bo.big_to_host(num);
data/dlib-19.10/dlib/data_io/mnist.cpp:59:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        fin1.read((char*)&nr, sizeof(nr));  bo.big_to_host(nr);
data/dlib-19.10/dlib/data_io/mnist.cpp:60:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        fin1.read((char*)&nc, sizeof(nc));  bo.big_to_host(nc);
data/dlib-19.10/dlib/data_io/mnist.cpp:64:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        fin2.read((char*)&magic, sizeof(magic));  bo.big_to_host(magic);
data/dlib-19.10/dlib/data_io/mnist.cpp:65:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        fin2.read((char*)&num2, sizeof(num2));  bo.big_to_host(num2);
data/dlib-19.10/dlib/data_io/mnist.cpp:69:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        fin3.read((char*)&magic, sizeof(magic));  bo.big_to_host(magic);
data/dlib-19.10/dlib/data_io/mnist.cpp:70:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        fin3.read((char*)&num3, sizeof(num3));  bo.big_to_host(num3);
data/dlib-19.10/dlib/data_io/mnist.cpp:71:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        fin3.read((char*)&nr, sizeof(nr));  bo.big_to_host(nr);
data/dlib-19.10/dlib/data_io/mnist.cpp:72:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        fin3.read((char*)&nc, sizeof(nc));  bo.big_to_host(nc);
data/dlib-19.10/dlib/data_io/mnist.cpp:76:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        fin4.read((char*)&magic, sizeof(magic));  bo.big_to_host(magic);
data/dlib-19.10/dlib/data_io/mnist.cpp:77:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        fin4.read((char*)&num4, sizeof(num4));  bo.big_to_host(num4);
data/dlib-19.10/dlib/data_io/mnist.cpp:95:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            fin1.read((char*)&training_images[i](0,0), nr*nc);
data/dlib-19.10/dlib/data_io/mnist.cpp:100:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            fin2.read(&l, 1);
data/dlib-19.10/dlib/data_io/mnist.cpp:107:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            fin3.read((char*)&testing_images[i](0,0), nr*nc);
data/dlib-19.10/dlib/data_io/mnist.cpp:112:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            fin4.read(&l, 1);
data/dlib-19.10/dlib/dir_nav/dir_nav_extensions.h:86: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.
            return std::equal(ending.begin(), ending.end(), f.name().end()-ending.size());
data/dlib-19.10/dlib/gui_widgets/nativefont.h:76:28:  [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).
                len = (int)strlen(str);
data/dlib-19.10/dlib/gui_widgets/nativefont.h:88:28:  [1] (buffer) wcslen:
  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).
                len = (int)wcslen(str);
data/dlib-19.10/dlib/gui_widgets/nativefont.h:129:28:  [1] (buffer) wcslen:
  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).
                len = (int)wcslen((wchar_t *)str);
data/dlib-19.10/dlib/http_client/http_client.cpp:478:22:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            postBody.read(&c, 1);
data/dlib-19.10/dlib/http_client/http_client.cpp:585:41:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            while ( (bytes_read = conn->read(buf, 512)) > 0 )
data/dlib-19.10/dlib/image_loader/load_image.h:38:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            file.read((char*)buffer, 8);
data/dlib-19.10/dlib/iosockstream/iosockstream.h:117:37:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                        while (con->read(junk,sizeof(junk)) > 0);
data/dlib-19.10/dlib/linker/linker_kernel_1.cpp:166:24:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            status = a.read(buf,sizeof(buf));
data/dlib-19.10/dlib/linker/linker_kernel_1.cpp:294:24:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            status = b.read(buf,sizeof(buf));
data/dlib-19.10/dlib/logger/extra_logger_headers.cpp:28:23:  [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).
        size_t size = strlen(buf);
data/dlib-19.10/dlib/logger/logger_kernel_1.h:36:13:  [1] (buffer) strncpy:
  Easily used incorrectly; doesn't always \0-terminate or check for invalid
  pointers [MS-banned] (CWE-120).
            strncpy(name,name_,19);
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:78:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                    int num = read(fd_printf,buf, sizeof(buf)-1);
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:135:31:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                    int num = read(fd_printf,buf, sizeof(buf)-1);
data/dlib-19.10/dlib/matlab/subprocess_stream.cpp:340:23:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            int num = read(fd,in_buffer+max_putback, in_buffer_size-max_putback);
data/dlib-19.10/dlib/matlab/subprocess_stream.h:48:16:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            in.read((char*)&item(0,0), sizeof(T)*item.size());
data/dlib-19.10/dlib/matrix/matrix.h:1971:16:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            in.read((char*)&item(0,0), sizeof(item(0,0))*item.size());
data/dlib-19.10/dlib/matrix/matrix_utilities.h:3255:69:  [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 disable_if<is_complex<typename EXP1::type>,bool>::type equal (
data/dlib-19.10/dlib/matrix/matrix_utilities.h:3282:68:  [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 enable_if<is_complex<typename EXP1::type>,bool>::type equal (
data/dlib-19.10/dlib/matrix/matrix_utilities_abstract.h:729: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 (
data/dlib-19.10/dlib/matrix/matrix_utilities_abstract.h:747: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 (
data/dlib-19.10/dlib/misc_api/misc_api_kernel_2.cpp:31:19:  [1] (obsolete) usleep:
  This C routine is considered obsolete (as opposed to the shell command by
  the same name). The interaction of this function with SIGALRM and other
  timer functions such as sleep(), alarm(), setitimer(), and nanosleep() is
  unspecified (CWE-676). Use nanosleep(2) or setitimer(2) instead.
                ::usleep(remaining*1000);
data/dlib-19.10/dlib/misc_api/misc_api_kernel_2.cpp:35:15:  [1] (obsolete) usleep:
  This C routine is considered obsolete (as opposed to the shell command by
  the same name). The interaction of this function with SIGALRM and other
  timer functions such as sleep(), alarm(), setitimer(), and nanosleep() is
  unspecified (CWE-676). Use nanosleep(2) or setitimer(2) instead.
            ::usleep(milliseconds*1000);
data/dlib-19.10/dlib/misc_api/misc_api_kernel_2.cpp:38:11:  [1] (obsolete) usleep:
  This C routine is considered obsolete (as opposed to the shell command by
  the same name). The interaction of this function with SIGALRM and other
  timer functions such as sleep(), alarm(), setitimer(), and nanosleep() is
  unspecified (CWE-676). Use nanosleep(2) or setitimer(2) instead.
        ::usleep(milliseconds*1000);
data/dlib-19.10/dlib/serialize.h:1086:20:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                in.read(&item[0], item.size());
data/dlib-19.10/dlib/serialize.h:1123:20:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                in.read((char*)&item[0], item.size());
data/dlib-19.10/dlib/serialize.h:1196:16:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            in.read(&item[0],size);
data/dlib-19.10/dlib/serialize.h:1423:16:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            in.read(array, size);
data/dlib-19.10/dlib/serialize.h:1431:16:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            in.read(array, size);
data/dlib-19.10/dlib/serialize.h:1582:18:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            fin->read(file_header,4);
data/dlib-19.10/dlib/serialize.h:1744:12:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        in.read((char*)&size, sizeof(size));
data/dlib-19.10/dlib/serialize.h:1752:12:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        in.read(&temp[0], size);
data/dlib-19.10/dlib/server/server_http.cpp:281:20:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                in.read(&incoming.body[0],content_length);
data/dlib-19.10/dlib/server/server_http.cpp:315:20:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                in.read(&incoming.body[0],content_length);
data/dlib-19.10/dlib/sockets/sockets_extensions.cpp:324:25:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            while (con->read(junk,sizeof(junk)) > 0) ;
data/dlib-19.10/dlib/sockets/sockets_kernel_1.cpp:317:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read (
data/dlib-19.10/dlib/sockets/sockets_kernel_1.cpp:346:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read (
data/dlib-19.10/dlib/sockets/sockets_kernel_1.h:110:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        long read (
data/dlib-19.10/dlib/sockets/sockets_kernel_1.h:115:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        long read (
data/dlib-19.10/dlib/sockets/sockets_kernel_2.cpp:369:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read (
data/dlib-19.10/dlib/sockets/sockets_kernel_2.cpp:407:5:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    read (
data/dlib-19.10/dlib/sockets/sockets_kernel_2.h:134:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        long read (
data/dlib-19.10/dlib/sockets/sockets_kernel_2.h:139:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        long read (
data/dlib-19.10/dlib/sockets/sockets_kernel_abstract.h:257:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        long read (
data/dlib-19.10/dlib/sockets/sockets_kernel_abstract.h:279:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        long read (
data/dlib-19.10/dlib/sockstreambuf/sockstreambuf.cpp:121:23:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        int num = con.read(in_buffer+max_putback, in_buffer_size-max_putback);
data/dlib-19.10/dlib/sockstreambuf/sockstreambuf_unbuffered.cpp:68:21:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            if (con.read(&temp,1) != 1)
data/dlib-19.10/dlib/sockstreambuf/sockstreambuf_unbuffered.cpp:98:21:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            if (con.read(&temp,1) != 1)
data/dlib-19.10/dlib/sockstreambuf/sockstreambuf_unbuffered.cpp:154:30:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            int status = con.read(s,static_cast<int>(n));
data/dlib-19.10/dlib/svm/empirical_kernel_map.h:230: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.
                DLIB_ASSERT(dlib::equal((*this)[i], target[i]), 
data/dlib-19.10/dlib/svm/rvm.h:372: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.
                    if (equal(prev_alpha, alpha, eps) && equal(prev_weights, weights, eps))
data/dlib-19.10/dlib/svm/rvm.h:372:58:  [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.
                    if (equal(prev_alpha, alpha, eps) && equal(prev_weights, weights, eps))
data/dlib-19.10/dlib/svm/rvm.h:783: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.
                    if (equal(prev_alpha, alpha, eps) && equal(prev_weights, weights, eps))
data/dlib-19.10/dlib/svm/rvm.h:783:58:  [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.
                    if (equal(prev_alpha, alpha, eps) && equal(prev_weights, weights, eps))
data/dlib-19.10/dlib/test/discriminant_pca.cpp:19: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.
    using dlib::equal;
data/dlib-19.10/dlib/test/discriminant_pca.cpp:64: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.
            DLIB_TEST(equal(mat*trans(mat), identity_matrix<double>(4)));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:67: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.
            DLIB_TEST(equal(mat*trans(mat), identity_matrix<double>(mat.nr())));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:71: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.
            DLIB_TEST(equal(mat*trans(mat), identity_matrix<double>(4)));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:85: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.
                DLIB_TEST(equal(mat*trans(mat), identity_matrix<double>(4)));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:89: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.
                DLIB_TEST(equal(mat*trans(mat), identity_matrix<double>(3)));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:113: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.
            DLIB_TEST(equal(dpca.dpca_matrix(), dpca2.dpca_matrix(), 1e-10));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:114: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.
            DLIB_TEST(equal(mat, dpca2.dpca_matrix(1), 1e-10));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:115: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.
            DLIB_TEST(equal(dpca.dpca_matrix(1), mat, 1e-10));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:126: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.
            DLIB_TEST(equal(mat, dpca3.dpca_matrix(1), 1e-10));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:160: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.
            DLIB_TEST(equal(mat*trans(mat), identity_matrix<double>(4)));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:170: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.
            DLIB_TEST(equal(mat*trans(mat), identity_matrix<double>(3)));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:202: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.
            DLIB_TEST(equal(mat*trans(mat), identity_matrix<double>(4)));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:213: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.
            DLIB_TEST(equal(mat*trans(mat), identity_matrix<double>(2)));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:261: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.
            DLIB_TEST(equal(mat, sum_dpca.dpca_matrix(1), 1e-10));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:262: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.
            DLIB_TEST(equal(mat*trans(mat), identity_matrix<double>(4)));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:274: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.
            DLIB_TEST(equal(mat*trans(mat), identity_matrix<double>(2)));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:275: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.
            DLIB_TEST_MSG(equal(mat, mat2=sum_dpca.dpca_matrix(1), 1e-9), max(abs(mat - mat2)));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:282: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.
            DLIB_TEST(equal(mat*trans(mat), identity_matrix<double>(4)));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:294: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.
            DLIB_TEST(equal(mat*trans(mat), identity_matrix<double>(3)));
data/dlib-19.10/dlib/test/discriminant_pca.cpp:295: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.
            DLIB_TEST(equal(mat, sum_dpca.dpca_matrix(1)));
data/dlib-19.10/dlib/test/dnn.cpp:1125:19:  [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.
        DLIB_TEST(equal(mat(dest),mat(dest2)));
data/dlib-19.10/dlib/test/dnn.cpp:1128:19:  [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.
        DLIB_TEST(equal(mat(dest),mat(dest2)));
data/dlib-19.10/dlib/test/dnn.cpp:1136:19:  [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.
        DLIB_TEST(equal(mat(dest),mat(dest2)));
data/dlib-19.10/dlib/test/dnn.cpp:1144:19:  [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.
        DLIB_TEST(equal(mat(dest),mat(dest2)));
data/dlib-19.10/dlib/test/dnn.cpp:1153:19:  [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.
        DLIB_TEST(equal(mat(dest),mat(dest2)));
data/dlib-19.10/dlib/test/dnn.cpp:1157:19:  [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.
        DLIB_TEST(equal(mat(dest),mat(dest2)));
data/dlib-19.10/dlib/test/dnn.cpp:1161:19:  [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.
        DLIB_TEST(equal(mat(dest),mat(dest2)));
data/dlib-19.10/dlib/test/dnn.cpp:1169: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.
            DLIB_TEST(equal(mat(dest),mat(dest2)));
data/dlib-19.10/dlib/test/dnn.cpp:1173: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.
            DLIB_TEST(equal(mat(dest),mat(dest2)));
data/dlib-19.10/dlib/test/dnn.cpp:1184:19:  [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.
        DLIB_TEST(equal(mat(dest),mat(dest2)));
data/dlib-19.10/dlib/test/dnn.cpp:1195:19:  [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.
        DLIB_TEST(equal(mat(dest),mat(dest2)));
data/dlib-19.10/dlib/test/dnn.cpp:1202:19:  [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.
        DLIB_TEST(equal(mat(src),mat(src2)));
data/dlib-19.10/dlib/test/ekm_and_lisf.cpp:248: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.
                        DLIB_TEST(equal(lisf[lisf.size()-1], samples[i]));
data/dlib-19.10/dlib/test/ekm_and_lisf.cpp:260:33:  [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.
                DLIB_TEST(dlib::equal(lisf.get_kernel_matrix(), kernel_matrix(kern, lisf), 1e-8));
data/dlib-19.10/dlib/test/ekm_and_lisf.cpp:261:33:  [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.
                DLIB_TEST(dlib::equal(lisf.get_inv_kernel_marix(), inv(kernel_matrix(kern, lisf.get_dictionary())), 1e-8));
data/dlib-19.10/dlib/test/ekm_and_lisf.cpp:289:33:  [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.
                DLIB_TEST(dlib::equal(kernel_matrix(kern, samples), kernel_matrix(linear_kernel<sample_type>(), proj_samples), 1e-5));
data/dlib-19.10/dlib/test/empirical_kernel_map.cpp:227:37:  [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.
                    DLIB_TEST(dlib::equal(ekm2[i] , samples[i]));
data/dlib-19.10/dlib/test/empirical_kernel_map.cpp:355:37:  [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.
                    DLIB_TEST(dlib::equal(ekm[i] , samples1[i]));
data/dlib-19.10/dlib/test/entropy_coder.cpp:73:23:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            while (in.read((char*)&ch,1))
data/dlib-19.10/dlib/test/filtering.cpp:116:19:  [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.
        DLIB_TEST(equal(kf.get_observation_model() , H));
data/dlib-19.10/dlib/test/filtering.cpp:117:19:  [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.
        DLIB_TEST(equal(kf.get_transition_model() , A));
data/dlib-19.10/dlib/test/filtering.cpp:118:19:  [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.
        DLIB_TEST(equal(kf.get_measurement_noise() , R));
data/dlib-19.10/dlib/test/filtering.cpp:119:19:  [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.
        DLIB_TEST(equal(kf.get_process_noise() , pn));
data/dlib-19.10/dlib/test/filtering.cpp:120:19:  [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.
        DLIB_TEST(equal(kf.get_current_estimation_error_covariance() , identity_matrix(pn)));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:72: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.
            DLIB_TEST(equal(K, kernel_matrix(kern, vect1, vect2)));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:73: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.
            DLIB_TEST(equal(K, kernel_matrix(kern, mat(vect1), mat(vect2))));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:84: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.
            DLIB_TEST(equal(K, kernel_matrix(kern, vect2, vect1)));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:85: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.
            DLIB_TEST(equal(K, tmp(kernel_matrix(kern, vect2, vect1))));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:86: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.
            DLIB_TEST(equal(K, kernel_matrix(kern, mat(vect2), mat(vect1))));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:97: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.
            DLIB_TEST(equal(K, kernel_matrix(kern, vect1, vect1)));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:98: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.
            DLIB_TEST(equal(K, tmp(kernel_matrix(kern, vect1, vect1))));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:99: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.
            DLIB_TEST(equal(K, kernel_matrix(kern, vect1)));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:100: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.
            DLIB_TEST(equal(K, tmp(kernel_matrix(kern, vect1))));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:101: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.
            DLIB_TEST(equal(K, kernel_matrix(kern, mat(vect1), mat(vect1))));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:102: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.
            DLIB_TEST(equal(K, tmp(kernel_matrix(kern, mat(vect1), mat(vect1)))));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:103: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.
            DLIB_TEST(equal(K, kernel_matrix(kern, mat(vect1))));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:104: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.
            DLIB_TEST(equal(K, tmp(kernel_matrix(kern, mat(vect1)))));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:115: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.
            DLIB_TEST(equal(K, kernel_matrix(kern, vect1, samp)));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:116: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.
            DLIB_TEST(equal(K, kernel_matrix(kern, mat(vect1), samp)));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:127: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.
            DLIB_TEST(equal(K, kernel_matrix(kern, samp, vect1)));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:128: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.
            DLIB_TEST(equal(K, kernel_matrix(kern, samp, mat(vect1))));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:129: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.
            DLIB_TEST(equal(K, tmp(kernel_matrix(kern, samp, vect1))));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:130: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.
            DLIB_TEST(equal(K, tmp(kernel_matrix(kern, samp, mat(vect1)))));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:139: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.
            DLIB_TEST(equal(samp2, kernel_matrix(kern, vect1, samp)));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:142: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.
            DLIB_TEST(equal(samp3, trans(kernel_matrix(kern, samp, vect2))));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:146: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.
            DLIB_TEST(equal(samp2, 2*kernel_matrix(kern, vect1, samp)));
data/dlib-19.10/dlib/test/kernel_matrix.cpp:149: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.
            DLIB_TEST(equal(samp3, 2*trans(kernel_matrix(kern, samp, vect2))));
data/dlib-19.10/dlib/test/matrix.cpp:86: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:87: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.
            DLIB_TEST((equal(round_zeros(m*mi,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:88: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix(m))));
data/dlib-19.10/dlib/test/matrix.cpp:89: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.
            DLIB_TEST((equal(round_zeros(m*mi,0.000001) , identity_matrix(m))));
data/dlib-19.10/dlib/test/matrix.cpp:94: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:95: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.
            DLIB_TEST((equal(round_zeros(m*mi,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:96: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix(m))));
data/dlib-19.10/dlib/test/matrix.cpp:97: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.
            DLIB_TEST((equal(round_zeros(m*mi,0.000001) , identity_matrix(m))));
data/dlib-19.10/dlib/test/matrix.cpp:103: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:104: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.
            DLIB_TEST((equal(round_zeros(m*mi,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:105: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix(m))));
data/dlib-19.10/dlib/test/matrix.cpp:106: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.
            DLIB_TEST((equal(round_zeros(m*mi,0.000001) , identity_matrix(m))));
data/dlib-19.10/dlib/test/matrix.cpp:111: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:112: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.
            DLIB_TEST((equal(round_zeros(m*mi,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:113: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix(m))));
data/dlib-19.10/dlib/test/matrix.cpp:114: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.
            DLIB_TEST((equal(round_zeros(m*mi,0.000001) , identity_matrix(m))));
data/dlib-19.10/dlib/test/matrix.cpp:120: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:121: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.
            DLIB_TEST((equal(round_zeros(m*mi,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:122: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix(m))));
data/dlib-19.10/dlib/test/matrix.cpp:123: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.
            DLIB_TEST((equal(round_zeros(m*mi,0.000001) , identity_matrix(m))));
data/dlib-19.10/dlib/test/matrix.cpp:140: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:158: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:177: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:197: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix<double,2>())));
data/dlib-19.10/dlib/test/matrix.cpp:217: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix<double,2>())));
data/dlib-19.10/dlib/test/matrix.cpp:237: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix<double,2>())));
data/dlib-19.10/dlib/test/matrix.cpp:257: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.
            DLIB_TEST((equal(round_zeros(mi*m,0.000001) , identity_matrix<double,2>())));
data/dlib-19.10/dlib/test/matrix.cpp:523: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.
            DLIB_TEST((equal(round_zeros(mi*cos(exp(mat(m))),0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:524: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.
            DLIB_TEST((equal(round_zeros(cos(exp(mat(m)))*mi,0.000001) , identity_matrix<double,5>())));
data/dlib-19.10/dlib/test/matrix.cpp:716: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.
            DLIB_TEST(equal(L*trans(L), m));
data/dlib-19.10/dlib/test/matrix.cpp:718: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.
            DLIB_TEST_MSG(equal(inv(m), inv_upper_triangular(trans(L))*inv_lower_triangular((L))), "");
data/dlib-19.10/dlib/test/matrix.cpp:719: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.
            DLIB_TEST(equal(round_zeros(inv_upper_triangular(trans(L))*trans(L),1e-10), identity_matrix<double>(3), 1e-10)); 
data/dlib-19.10/dlib/test/matrix.cpp:720: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.
            DLIB_TEST(equal(round_zeros(inv_lower_triangular((L))*(L),1e-10) ,identity_matrix<double>(3),1e-10)); 
data/dlib-19.10/dlib/test/matrix.cpp:741: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.
            DLIB_TEST_MSG(equal(L*trans(L), m, 1e-10), L*trans(L)-m);
data/dlib-19.10/dlib/test/matrix.cpp:743: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.
            DLIB_TEST_MSG(equal(inv(m), inv_upper_triangular(trans(L))*inv_lower_triangular((L))), "");
data/dlib-19.10/dlib/test/matrix.cpp:744: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.
            DLIB_TEST_MSG(equal(inv(m), trans(inv_lower_triangular(L))*inv_lower_triangular((L))), ""); 
data/dlib-19.10/dlib/test/matrix.cpp:745: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.
            DLIB_TEST_MSG(equal(inv(m), trans(inv_lower_triangular(L))*trans(inv_upper_triangular(trans(L)))), "");
data/dlib-19.10/dlib/test/matrix.cpp:746: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.
            DLIB_TEST_MSG(equal(round_zeros(inv_upper_triangular(trans(L))*trans(L),1e-10) , identity_matrix<double>(6), 1e-10),
data/dlib-19.10/dlib/test/matrix.cpp:748: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.
            DLIB_TEST_MSG(equal(round_zeros(inv_lower_triangular((L))*(L),1e-10) ,identity_matrix<double>(6), 1e-10),
data/dlib-19.10/dlib/test/matrix.cpp:758: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.
            DLIB_TEST_MSG(equal(L*trans(L), m, 1e-10), L*trans(L)-m);   
data/dlib-19.10/dlib/test/matrix.cpp:759: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.
            DLIB_TEST_MSG(equal(inv(m), inv_upper_triangular(trans(L))*inv_lower_triangular((L))), "");
data/dlib-19.10/dlib/test/matrix.cpp:760: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.
            DLIB_TEST_MSG(equal(inv(m), trans(inv_lower_triangular(L))*inv_lower_triangular((L))), ""); 
data/dlib-19.10/dlib/test/matrix.cpp:761: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.
            DLIB_TEST_MSG(equal(inv(m), trans(inv_lower_triangular(L))*trans(inv_upper_triangular(trans(L)))), "");
data/dlib-19.10/dlib/test/matrix.cpp:769: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.
            DLIB_TEST_MSG(equal(L*trans(L), m, 1e-10), L*trans(L)-m);   
data/dlib-19.10/dlib/test/matrix.cpp:770: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.
            DLIB_TEST_MSG(equal(inv(m), inv_upper_triangular(trans(L))*inv_lower_triangular((L))), "");
data/dlib-19.10/dlib/test/matrix.cpp:771: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.
            DLIB_TEST_MSG(equal(inv(m), trans(inv_lower_triangular(L))*inv_lower_triangular((L))), ""); 
data/dlib-19.10/dlib/test/matrix.cpp:772: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.
            DLIB_TEST_MSG(equal(inv(m), trans(inv_lower_triangular(L))*trans(inv_upper_triangular(trans(L)))), "");
data/dlib-19.10/dlib/test/matrix.cpp:797: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.
            DLIB_TEST_MSG(equal(L*trans(L), m, 1e-10), L*trans(L)-m);
data/dlib-19.10/dlib/test/matrix.cpp:799: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.
            DLIB_TEST_MSG(equal(inv(m), inv_upper_triangular(trans(L))*inv_lower_triangular((L))), ""); 
data/dlib-19.10/dlib/test/matrix.cpp:800: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.
            DLIB_TEST_MSG(equal(round_zeros(inv_upper_triangular(trans(L))*trans(L),1e-10) , identity_matrix<double>(6), 1e-10),
data/dlib-19.10/dlib/test/matrix.cpp:802: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.
            DLIB_TEST_MSG(equal(round_zeros(inv_lower_triangular((L))*(L),1e-10) ,identity_matrix<double>(6), 1e-10),
data/dlib-19.10/dlib/test/matrix.cpp:812:33:  [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.
            DLIB_TEST_MSG(dlib::equal(inv_upper_triangular(m), inv(m),1e-10), inv_upper_triangular(m)-inv(m));
data/dlib-19.10/dlib/test/matrix.cpp:813:33:  [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.
            DLIB_TEST_MSG(dlib::equal(inv_lower_triangular(trans(m)), inv(trans(m)),1e-10), inv_lower_triangular(trans(m))-inv(trans(m)));
data/dlib-19.10/dlib/test/matrix.cpp:837: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.
            DLIB_TEST_MSG(equal(trans(a)*a , tmp(trans(a)*a), 1e-11),max(abs(trans(a)*a - tmp(trans(a)*a))));
data/dlib-19.10/dlib/test/matrix.cpp:838: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.
            DLIB_TEST_MSG(equal(trans(b)*b , tmp(trans(b)*b), 1e-3f),max(abs(trans(b)*b - tmp(trans(b)*b))));
data/dlib-19.10/dlib/test/matrix.cpp:1216: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.
            DLIB_TEST(equal(m1, m2));
data/dlib-19.10/dlib/test/matrix.cpp:1221: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.
            DLIB_TEST(equal(m1, m2));
data/dlib-19.10/dlib/test/matrix.cpp:1256: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.
            DLIB_TEST(equal(reciprocal(m), mr));
data/dlib-19.10/dlib/test/matrix.cpp:1257: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.
            DLIB_TEST(equal(reciprocal_max(m), mr_max));
data/dlib-19.10/dlib/test/matrix.cpp:1474: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.
            DLIB_TEST(equal(colm(a,0) , m*b));
data/dlib-19.10/dlib/test/matrix.cpp:1477: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.
            DLIB_TEST(equal(rowm(a,0) , trans(m*b)));
data/dlib-19.10/dlib/test/matrix.cpp:1478: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.
            DLIB_TEST(!equal(rowm(a,0) , m*b));
data/dlib-19.10/dlib/test/matrix.cpp:1487: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.
            DLIB_TEST(equal(colm(a,0) , m*b));
data/dlib-19.10/dlib/test/matrix.cpp:1490: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.
            DLIB_TEST(equal(rowm(a,0) , trans(m*b)));
data/dlib-19.10/dlib/test/matrix.cpp:1491: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.
            DLIB_TEST(!equal(rowm(a,0) , m*b));
data/dlib-19.10/dlib/test/matrix2.cpp:177:19:  [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.
        DLIB_TEST(equal(trans(mat(stdv))*mat(stdv), trans(v)*v));
data/dlib-19.10/dlib/test/matrix2.cpp:178:19:  [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.
        DLIB_TEST(equal(trans(mat(stdv))*mat(stdv), tmp(trans(v)*v)));
data/dlib-19.10/dlib/test/matrix2.cpp:187:19:  [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.
        DLIB_TEST(equal(trans(mat(stdv_c))*mat(stdv_c), trans(v)*v));
data/dlib-19.10/dlib/test/matrix2.cpp:196:19:  [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.
        DLIB_TEST(equal(trans(mat(arr))*mat(arr), trans(v)*v));
data/dlib-19.10/dlib/test/matrix2.cpp:238:19:  [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.
        DLIB_TEST(equal(round(10000*m3*inv(m3))/10000 , identity_matrix<double,3>()));
data/dlib-19.10/dlib/test/matrix2.cpp:239:19:  [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.
        DLIB_TEST(equal(round(10000*dm3*inv(m3))/10000 , identity_matrix<double,3>()));
data/dlib-19.10/dlib/test/matrix2.cpp:240:19:  [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.
        DLIB_TEST(equal(round(10000*dm3*inv(dm3))/10000 , identity_matrix<double,3>()));
data/dlib-19.10/dlib/test/matrix2.cpp:241:19:  [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.
        DLIB_TEST(equal(round(10000*m3*inv(dm3))/10000 , identity_matrix<double,3>()));
data/dlib-19.10/dlib/test/matrix2.cpp:242:19:  [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.
        DLIB_TEST(equal(round(10000*tmp(m3*inv(m3)))/10000 , identity_matrix<double,3>()));
data/dlib-19.10/dlib/test/matrix2.cpp:243:19:  [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.
        DLIB_TEST(equal(round(10000*tmp(dm3*inv(m3)))/10000 , identity_matrix<double,3>()));
data/dlib-19.10/dlib/test/matrix2.cpp:244:19:  [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.
        DLIB_TEST(equal(round(10000*tmp(dm3*inv(dm3)))/10000 , identity_matrix<double,3>()));
data/dlib-19.10/dlib/test/matrix2.cpp:245:19:  [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.
        DLIB_TEST(equal(round(10000*tmp(m3*inv(dm3)))/10000 , identity_matrix<double,3>()));
data/dlib-19.10/dlib/test/matrix2.cpp:269:19:  [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.
        DLIB_TEST(equal(muniform3/3 , muniform1));
data/dlib-19.10/dlib/test/matrix2.cpp:378: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.
            DLIB_TEST(equal(dlib::clamp(x, l, u) , out));
data/dlib-19.10/dlib/test/matrix2.cpp:380: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.
            DLIB_TEST(!equal(dlib::clamp(x, l, u) , out));
data/dlib-19.10/dlib/test/matrix2.cpp:382: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.
            DLIB_TEST(!equal(dlib::clamp(x, l, u) , out));
data/dlib-19.10/dlib/test/matrix2.cpp:386: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.
            DLIB_TEST(equal(dlib::clamp(x, l, u) , out));
data/dlib-19.10/dlib/test/matrix2.cpp:390: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.
            DLIB_TEST(equal(dlib::clamp(x, l, u) , out));
data/dlib-19.10/dlib/test/matrix2.cpp:394: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.
            DLIB_TEST(equal(dlib::clamp(x, l, u) , out));
data/dlib-19.10/dlib/test/matrix2.cpp:404:19:  [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.
        DLIB_TEST(equal(inv(dm7),  inv(m7)));
data/dlib-19.10/dlib/test/matrix2.cpp:410:19:  [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.
        DLIB_TEST(equal(diag(dm7) , diag(m7)));
data/dlib-19.10/dlib/test/matrix2.cpp:411:19:  [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.
        DLIB_TEST(equal(trans(dm7) , trans(m7)));
data/dlib-19.10/dlib/test/matrix2.cpp:412:19:  [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.
        DLIB_TEST(equal(abs(dm7) , abs(m7)));
data/dlib-19.10/dlib/test/matrix2.cpp:413:19:  [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.
        DLIB_TEST(equal(round(dm7) , round(m7)));
data/dlib-19.10/dlib/test/matrix2.cpp:606: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.
            using dlib::equal;
data/dlib-19.10/dlib/test/matrix2.cpp:648: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.
            using dlib::equal;
data/dlib-19.10/dlib/test/matrix2.cpp:690: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.
            using dlib::equal;
data/dlib-19.10/dlib/test/matrix2.cpp:971: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.
            DLIB_TEST(equal(reciprocal(m) , m2));
data/dlib-19.10/dlib/test/matrix2.cpp:979: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.
            DLIB_TEST(equal(reciprocal(m) , m2));
data/dlib-19.10/dlib/test/matrix3.cpp:788: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.
            DLIB_TEST(equal(a, b));
data/dlib-19.10/dlib/test/matrix3.cpp:789: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.
            DLIB_TEST(equal(-a, c));
data/dlib-19.10/dlib/test/matrix3.cpp:794: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.
            DLIB_TEST(equal(2*a, b));
data/dlib-19.10/dlib/test/matrix3.cpp:795: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.
            DLIB_TEST(equal(-2*a, c));
data/dlib-19.10/dlib/test/matrix3.cpp:800: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.
            DLIB_TEST(equal(4*a, b));
data/dlib-19.10/dlib/test/matrix3.cpp:801: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.
            DLIB_TEST(equal(-4*a, c));
data/dlib-19.10/dlib/test/matrix3.cpp:810: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.
            DLIB_TEST(equal(2*a, b));
data/dlib-19.10/dlib/test/matrix3.cpp:811: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.
            DLIB_TEST(equal(-2*a, c));
data/dlib-19.10/dlib/test/matrix3.cpp:1051: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.
            DLIB_TEST_MSG(equal(m1,m2),  m1 << "\n***********\n" << m2);
data/dlib-19.10/dlib/test/matrix3.cpp:1056: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.
                DLIB_TEST_MSG(equal(m1,m3),  m1 << "\n***********\n" << m3);
data/dlib-19.10/dlib/test/matrix4.cpp:41: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.
            DLIB_TEST(equal( m*diagm(v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:42: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.
            DLIB_TEST(equal( scale_columns(m,v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:44: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.
            DLIB_TEST(equal( diagm(v)*m , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:45: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.
            DLIB_TEST(equal( scale_rows(m,v) , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:52: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.
            DLIB_TEST(equal( m*diagm(v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:53: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.
            DLIB_TEST(equal( scale_columns(m,v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:55: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.
            DLIB_TEST(equal( diagm(v)*m , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:56: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.
            DLIB_TEST(equal( scale_rows(m,v) , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.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.
            DLIB_TEST(equal( m*diagm(v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:64: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.
            DLIB_TEST(equal( scale_columns(m,v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:66: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.
            DLIB_TEST(equal( diagm(v)*m , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:67: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.
            DLIB_TEST(equal( scale_rows(m,v) , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:74: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.
            DLIB_TEST(equal( m*diagm(v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:75: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.
            DLIB_TEST(equal( scale_columns(m,v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:77: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.
            DLIB_TEST(equal( diagm(v)*m , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:78: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.
            DLIB_TEST(equal( scale_rows(m,v) , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:86: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.
            DLIB_TEST(equal( m*diagm(v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:87: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.
            DLIB_TEST(equal( scale_columns(m,v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:89: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.
            DLIB_TEST(equal( diagm(v)*m , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:90: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.
            DLIB_TEST(equal( scale_rows(m,v) , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:97: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.
            DLIB_TEST(equal( m*diagm(v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:98: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.
            DLIB_TEST(equal( scale_columns(m,v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:100: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.
            DLIB_TEST(equal( diagm(v)*m , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:101: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.
            DLIB_TEST(equal( scale_rows(m,v) , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:109: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.
            DLIB_TEST(equal( m*diagm(v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:110: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.
            DLIB_TEST(equal( scale_columns(m,v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:112: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.
            DLIB_TEST(equal( diagm(v)*m , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:113: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.
            DLIB_TEST(equal( scale_rows(m,v) , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:120: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.
            DLIB_TEST(equal( m*diagm(v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:121: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.
            DLIB_TEST(equal( scale_columns(m,v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:123: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.
            DLIB_TEST(equal( diagm(v)*m , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:124: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.
            DLIB_TEST(equal( scale_rows(m,v) , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:132: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.
            DLIB_TEST(equal( m*diagm(v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:133: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.
            DLIB_TEST(equal( scale_columns(m,v) , m*tmp(diagm(v)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:135: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.
            DLIB_TEST(equal( diagm(v)*m , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:136: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.
            DLIB_TEST(equal( scale_rows(m,v) , tmp(diagm(v))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:144: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.
            DLIB_TEST(equal( m*diagm(v1) , m*tmp(diagm(v1)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:145: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.
            DLIB_TEST(equal( scale_columns(m,v1) , m*tmp(diagm(v1)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:147: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.
            DLIB_TEST(equal( diagm(v2)*m , tmp(diagm(v2))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:148: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.
            DLIB_TEST(equal( scale_rows(m,v2) , tmp(diagm(v2))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:156: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.
            DLIB_TEST(equal( m*diagm(v1) , m*tmp(diagm(v1)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:157: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.
            DLIB_TEST(equal( scale_columns(m,v1) , m*tmp(diagm(v1)) ));
data/dlib-19.10/dlib/test/matrix4.cpp:159: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.
            DLIB_TEST(equal( diagm(v2)*m , tmp(diagm(v2))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:160: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.
            DLIB_TEST(equal( scale_rows(m,v2) , tmp(diagm(v2))*m )); 
data/dlib-19.10/dlib/test/matrix4.cpp:389: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.
            DLIB_TEST(equal(inv(diagm(d)) + m , tmp(diagm(di)) + m));
data/dlib-19.10/dlib/test/matrix4.cpp:390: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.
            DLIB_TEST(equal(m + inv(diagm(d)) , tmp(diagm(di)) + m));
data/dlib-19.10/dlib/test/matrix4.cpp:417: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.
            DLIB_TEST(equal(inv(diagm(d)) , diagm(di)));
data/dlib-19.10/dlib/test/matrix4.cpp:418: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.
            DLIB_TEST(equal(inv(diagm(d)) , diagm(di)));
data/dlib-19.10/dlib/test/matrix4.cpp:419: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.
            DLIB_TEST(equal(inv(diagm(d))*m , tmp(diagm(di))*m));
data/dlib-19.10/dlib/test/matrix4.cpp:420: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.
            DLIB_TEST(equal(m*inv(diagm(d)) , m*tmp(diagm(di))));
data/dlib-19.10/dlib/test/matrix4.cpp:422: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.
            DLIB_TEST_MSG(equal(inv(diagm(d)) + m , tmp(diagm(di)) + m), 
data/dlib-19.10/dlib/test/matrix4.cpp:424: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.
            DLIB_TEST(equal(m + inv(diagm(d)) , tmp(diagm(di)) + m));
data/dlib-19.10/dlib/test/matrix4.cpp:452: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.
            DLIB_TEST(equal(inv(diagm(d)) , diagm(di)));
data/dlib-19.10/dlib/test/matrix4.cpp:453: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.
            DLIB_TEST(equal(inv(diagm(d)) , diagm(di)));
data/dlib-19.10/dlib/test/matrix4.cpp:454: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.
            DLIB_TEST(equal(inv(diagm(d))*m , tmp(diagm(di))*m));
data/dlib-19.10/dlib/test/matrix4.cpp:455: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.
            DLIB_TEST(equal(m*inv(diagm(d)) , m*tmp(diagm(di))));
data/dlib-19.10/dlib/test/matrix4.cpp:457: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.
            DLIB_TEST(equal(inv(diagm(d)) + m , tmp(diagm(di)) + m));
data/dlib-19.10/dlib/test/matrix4.cpp:458: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.
            DLIB_TEST(equal(m + inv(diagm(d)) , tmp(diagm(di)) + m));
data/dlib-19.10/dlib/test/matrix4.cpp:486: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.
            DLIB_TEST(equal(inv(diagm(d)) , diagm(di)));
data/dlib-19.10/dlib/test/matrix4.cpp:487: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.
            DLIB_TEST(equal(inv(diagm(d)) , diagm(di)));
data/dlib-19.10/dlib/test/matrix4.cpp:488: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.
            DLIB_TEST(equal(inv(diagm(d))*m , tmp(diagm(di))*m));
data/dlib-19.10/dlib/test/matrix4.cpp:489: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.
            DLIB_TEST(equal(m*inv(diagm(d)) , m*tmp(diagm(di))));
data/dlib-19.10/dlib/test/matrix4.cpp:491: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.
            DLIB_TEST(equal(inv(diagm(d)) + m , tmp(diagm(di)) + m));
data/dlib-19.10/dlib/test/matrix4.cpp:492: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.
            DLIB_TEST(equal(m + inv(diagm(d)) , tmp(diagm(di)) + m));
data/dlib-19.10/dlib/test/matrix4.cpp:533: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.
            DLIB_TEST_MSG(equal(pointwise_multiply(d1*trans(d2), m) , diagm(d1)*m*diagm(d2)),
data/dlib-19.10/dlib/test/matrix4.cpp:536: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.
            DLIB_TEST(equal(pointwise_multiply(d1*trans(d2), m) , diagm(d1)*(m*diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:537: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.
            DLIB_TEST(equal(pointwise_multiply(d1*trans(d2), m) , (diagm(d1)*m)*diagm(d2)));
data/dlib-19.10/dlib/test/matrix4.cpp:539: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans(reciprocal(d2)), m) , inv(diagm(d1))*m*inv(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:540: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans(reciprocal(d2)), m) , inv(diagm(d1))*(m*inv(diagm(d2)))));
data/dlib-19.10/dlib/test/matrix4.cpp:541: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans(reciprocal(d2)), m) , (inv(diagm(d1))*m)*inv(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:543: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans((d2)), m) , inv(diagm(d1))*m*(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:544: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans((d2)), m) , inv(diagm(d1))*(m*(diagm(d2)))));
data/dlib-19.10/dlib/test/matrix4.cpp:545: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans((d2)), m) , (inv(diagm(d1))*m)*(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:547: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.
            DLIB_TEST(equal(pointwise_multiply((d1)*trans(reciprocal(d2)), m) , (diagm(d1))*m*inv(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:548: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.
            DLIB_TEST(equal(pointwise_multiply((d1)*trans(reciprocal(d2)), m) , (diagm(d1))*(m*inv(diagm(d2)))));
data/dlib-19.10/dlib/test/matrix4.cpp:549: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.
            DLIB_TEST(equal(pointwise_multiply((d1)*trans(reciprocal(d2)), m) , ((diagm(d1))*m)*inv(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:558: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.
            DLIB_TEST(equal(pointwise_multiply(d1*trans(d2), m) , diagm(d1)*m*diagm(d2)));
data/dlib-19.10/dlib/test/matrix4.cpp:559: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.
            DLIB_TEST(equal(pointwise_multiply(d1*trans(d2), m) , diagm(d1)*(m*diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:560: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.
            DLIB_TEST(equal(pointwise_multiply(d1*trans(d2), m) , (diagm(d1)*m)*diagm(d2)));
data/dlib-19.10/dlib/test/matrix4.cpp:562: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans(reciprocal(d2)), m) , inv(diagm(d1))*m*inv(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:563: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans(reciprocal(d2)), m) , inv(diagm(d1))*(m*inv(diagm(d2)))));
data/dlib-19.10/dlib/test/matrix4.cpp:564: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans(reciprocal(d2)), m) , (inv(diagm(d1))*m)*inv(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:566: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans((d2)), m) , inv(diagm(d1))*m*(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:567: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans((d2)), m) , inv(diagm(d1))*(m*(diagm(d2)))));
data/dlib-19.10/dlib/test/matrix4.cpp:568: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans((d2)), m) , (inv(diagm(d1))*m)*(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:570: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.
            DLIB_TEST(equal(pointwise_multiply((d1)*trans(reciprocal(d2)), m) , (diagm(d1))*m*inv(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:571: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.
            DLIB_TEST(equal(pointwise_multiply((d1)*trans(reciprocal(d2)), m) , (diagm(d1))*(m*inv(diagm(d2)))));
data/dlib-19.10/dlib/test/matrix4.cpp:572: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.
            DLIB_TEST(equal(pointwise_multiply((d1)*trans(reciprocal(d2)), m) , ((diagm(d1))*m)*inv(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:581: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.
            DLIB_TEST(equal(pointwise_multiply(d1*trans(d2), m) , diagm(d1)*m*diagm(d2)));
data/dlib-19.10/dlib/test/matrix4.cpp:582: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.
            DLIB_TEST(equal(pointwise_multiply(d1*trans(d2), m) , diagm(d1)*(m*diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:583: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.
            DLIB_TEST(equal(pointwise_multiply(d1*trans(d2), m) , (diagm(d1)*m)*diagm(d2)));
data/dlib-19.10/dlib/test/matrix4.cpp:585: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans(reciprocal(d2)), m) , inv(diagm(d1))*m*inv(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:586: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans(reciprocal(d2)), m) , inv(diagm(d1))*(m*inv(diagm(d2)))));
data/dlib-19.10/dlib/test/matrix4.cpp:587: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans(reciprocal(d2)), m) , (inv(diagm(d1))*m)*inv(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:589: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans((d2)), m) , inv(diagm(d1))*m*(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:590: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans((d2)), m) , inv(diagm(d1))*(m*(diagm(d2)))));
data/dlib-19.10/dlib/test/matrix4.cpp:591: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.
            DLIB_TEST(equal(pointwise_multiply(reciprocal(d1)*trans((d2)), m) , (inv(diagm(d1))*m)*(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:593: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.
            DLIB_TEST(equal(pointwise_multiply((d1)*trans(reciprocal(d2)), m) , (diagm(d1))*m*inv(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:594: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.
            DLIB_TEST(equal(pointwise_multiply((d1)*trans(reciprocal(d2)), m) , (diagm(d1))*(m*inv(diagm(d2)))));
data/dlib-19.10/dlib/test/matrix4.cpp:595: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.
            DLIB_TEST(equal(pointwise_multiply((d1)*trans(reciprocal(d2)), m) , ((diagm(d1))*m)*inv(diagm(d2))));
data/dlib-19.10/dlib/test/matrix4.cpp:605: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.
                DLIB_TEST(equal(1.0/m , reciprocal(m)));
data/dlib-19.10/dlib/test/matrix4.cpp:606: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.
                DLIB_TEST(equal(0.0/m , zeros_matrix<double>(3,4)));
data/dlib-19.10/dlib/test/matrix4.cpp:642: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.
            DLIB_TEST(equal(A,B));
data/dlib-19.10/dlib/test/matrix_chol.cpp:95: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.
        DLIB_TEST_MSG(equal(m*test.solve(m2), m2,eps),max(abs(m*test.solve(m2)- m2)));
data/dlib-19.10/dlib/test/matrix_chol.cpp:97: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.
        DLIB_TEST_MSG(equal(m*test.solve(m2), m2,eps),max(abs(m*test.solve(m2)- m2)));
data/dlib-19.10/dlib/test/matrix_chol.cpp:99: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.
        DLIB_TEST_MSG(equal(m*test.solve(m2), m2,eps),max(abs(m*test.solve(m2)- m2)));
data/dlib-19.10/dlib/test/matrix_chol.cpp:101: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.
        DLIB_TEST_MSG(equal(m*test.solve(col), col,eps),max(abs(m*test.solve(m2)- m2)));
data/dlib-19.10/dlib/test/matrix_eig.cpp:76:19:  [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.
        DLIB_TEST(equal(real(test.get_eigenvalues()), test.get_real_eigenvalues(), eps)); 
data/dlib-19.10/dlib/test/matrix_eig.cpp:77:19:  [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.
        DLIB_TEST(equal(imag(test.get_eigenvalues()), test.get_imag_eigenvalues(), eps)); 
data/dlib-19.10/dlib/test/matrix_eig.cpp:78:19:  [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.
        DLIB_TEST(equal(real(diag(test.get_d())), test.get_real_eigenvalues(), eps)); 
data/dlib-19.10/dlib/test/matrix_eig.cpp:79:19:  [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.
        DLIB_TEST(equal(imag(diag(test.get_d())), test.get_imag_eigenvalues(), eps)); 
data/dlib-19.10/dlib/test/matrix_eig.cpp:125: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.
            DLIB_TEST(equal(V*trans(V), identity_matrix<type>(test.dim()), eps));
data/dlib-19.10/dlib/test/matrix_eig.cpp:126: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.
            DLIB_TEST(equal(m , V*D*trans(V), eps));
data/dlib-19.10/dlib/test/matrix_eig.cpp:131: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.
            DLIB_TEST_MSG(equal(m , V*D*inv(V), eps), max(abs(m - V*D*inv(V))));
data/dlib-19.10/dlib/test/matrix_lu.cpp:101: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.
            DLIB_TEST_MSG(equal(m*test.solve(m2), m2,eps),max(abs(m*test.solve(m2)- m2)));
data/dlib-19.10/dlib/test/matrix_lu.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.
            DLIB_TEST_MSG(equal(m*test.solve(m2), m2,eps),max(abs(m*test.solve(m2)- m2)));
data/dlib-19.10/dlib/test/matrix_lu.cpp:105: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.
            DLIB_TEST_MSG(equal(m*test.solve(m2), m2,eps),max(abs(m*test.solve(m2)- m2)));
data/dlib-19.10/dlib/test/matrix_lu.cpp:107: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.
            DLIB_TEST_MSG(equal(m*test.solve(col), col,eps),max(abs(m*test.solve(m2)- m2)));
data/dlib-19.10/dlib/test/matrix_qr.cpp:96: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.
            DLIB_TEST_MSG(equal(m*test.solve(m2), m2,eps),max(abs(m*test.solve(m2)- m2)));
data/dlib-19.10/dlib/test/matrix_qr.cpp:98: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.
            DLIB_TEST_MSG(equal(m*test.solve(m2), m2,eps),max(abs(m*test.solve(m2)- m2)));
data/dlib-19.10/dlib/test/matrix_qr.cpp:100: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.
            DLIB_TEST_MSG(equal(m*test.solve(m2), m2,eps),max(abs(m*test.solve(m2)- m2)));
data/dlib-19.10/dlib/test/matrix_qr.cpp:102: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.
            DLIB_TEST_MSG(equal(m*test.solve(col), col,eps),max(abs(m*test.solve(m2)- m2)));
data/dlib-19.10/dlib/test/matrix_qr.cpp:106:33:  [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.
            DLIB_TEST_MSG(dlib::equal(pinv(m), test.solve(identity_matrix<type>(m.nr())), eps), 
data/dlib-19.10/dlib/test/optimization.cpp:180:33:  [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.
            DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:189:33:  [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.
            DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:204:33:  [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.
            DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:214:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:224:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:234:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:247:33:  [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.
            DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:257:33:  [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.
            DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:267:33:  [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.
            DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:277:33:  [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.
            DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:286:33:  [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.
            DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:334:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-1),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:344:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-1),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:354:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-1),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:364:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-1),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:377:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-3),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:403:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:413:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:423:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:433:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:444:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:454:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:464:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:475:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:485:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:495:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:508:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:534:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-7),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:544:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-7),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:554:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-7),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:564:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-7),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:575:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-4),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:585:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-4),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:595:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-4),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:605:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-4),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:620:33:  [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.
            DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:646:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-7),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:655:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-7),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:664:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-7),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:674:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-7),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:687:29:  [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.
        DLIB_TEST_MSG(dlib::equal(x,opt, 1e-5),opt-x);
data/dlib-19.10/dlib/test/optimization.cpp:884:29:  [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.
            DLIB_TEST(dlib::equal(der_rosen(m) , derivative(rosen)(m),1e-5));
data/dlib-19.10/dlib/test/optimization.cpp:900:29:  [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.
            DLIB_TEST(dlib::equal(der_rosen(m) , derivative(rosen)(m),1e-5));
data/dlib-19.10/dlib/test/ranking.cpp:184:19:  [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.
        DLIB_TEST(equal(test_ranking_function(df, samples), res));
data/dlib-19.10/dlib/test/ranking.cpp:186:19:  [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.
        DLIB_TEST(equal(test_ranking_function(trainer.train(samples[1]), samples), res));
data/dlib-19.10/dlib/test/ranking.cpp:197:19:  [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.
        DLIB_TEST(equal(test_ranking_function(df, samples), res));
data/dlib-19.10/dlib/test/ranking.cpp:208:19:  [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.
        DLIB_TEST(equal(test_ranking_function(df, samples), res));
data/dlib-19.10/dlib/test/ranking.cpp:217:19:  [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.
        DLIB_TEST(equal(cross_validate_ranking_trainer(trainer, samples,4) , res));
data/dlib-19.10/dlib/test/ranking.cpp:262:19:  [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.
        DLIB_TEST(equal(test_ranking_function(df, samples), res));
data/dlib-19.10/dlib/test/ranking.cpp:264:19:  [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.
        DLIB_TEST(equal(test_ranking_function(trainer.train(samples[1]), samples), res));
data/dlib-19.10/dlib/test/ranking.cpp:278:19:  [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.
        DLIB_TEST(equal(test_ranking_function(df, samples), res));
data/dlib-19.10/dlib/test/ranking.cpp:292:19:  [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.
        DLIB_TEST(equal(test_ranking_function(df, samples), res));
data/dlib-19.10/dlib/test/ranking.cpp:301:19:  [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.
        DLIB_TEST(equal(cross_validate_ranking_trainer(trainer, samples,4) , res) );
data/dlib-19.10/dlib/test/ranking.cpp:391:19:  [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.
        DLIB_TEST(equal(acc1,res));
data/dlib-19.10/dlib/test/ranking.cpp:399:19:  [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.
        DLIB_TEST(equal(acc2,res));
data/dlib-19.10/dlib/test/sockets.cpp:59:34:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            while ((status = con.read(buf,sizeof(buf))) > 0)
data/dlib-19.10/dlib/test/sockets2.cpp:72:22:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                con->read(&ch, 1);
data/dlib-19.10/dlib/test/sockets2.cpp:157:47:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
                        int status = cons[i]->read(buf, buf_size, timeout_to_use);
data/dlib-19.10/dlib/test/sockets2.cpp:161: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.
                            DLIB_TEST(equal(buf, buf+status, data_to_send.begin()+bytes_received[i]));
data/dlib-19.10/dlib/test/sockstreambuf.cpp:166:16:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            in.read(&ch,1);
data/dlib-19.10/dlib/test/sockstreambuf.cpp:185:16:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            in.read((char*)&n,sizeof(n));
data/dlib-19.10/dlib/test/sockstreambuf.cpp:189:12:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        in.read(bigbuf,1000000);
data/dlib-19.10/dlib/test/sparse_vector.cpp:189: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.
                DLIB_TEST(equal(a-b, subtract(a,b)));
data/dlib-19.10/dlib/test/sparse_vector.cpp:190: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.
                DLIB_TEST(equal(a+b, add(a,b)));
data/dlib-19.10/dlib/test/sparse_vector.cpp:191: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.
                DLIB_TEST(equal(a-(b+b), subtract(a,b+b)));
data/dlib-19.10/dlib/test/sparse_vector.cpp:192: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.
                DLIB_TEST(equal(a+b+b, add(a,b+b)));
data/dlib-19.10/dlib/test/statistics.cpp:82: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.
                DLIB_TEST(std::equal(r1.begin(), r1.end(), r2.begin()));
data/dlib-19.10/dlib/test/statistics.cpp:93: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.
                DLIB_TEST(std::equal(r1.begin(), r1.end(), r2.begin()));
data/dlib-19.10/dlib/test/statistics.cpp:271: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.
                    DLIB_TEST(equal(mean(mat(vects)), cov.mean()));
data/dlib-19.10/dlib/test/statistics.cpp:272: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.
                    DLIB_TEST_MSG(equal(covariance(mat(vects)), cov.covariance()),
data/dlib-19.10/dlib/test/statistics.cpp:298: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.
                    DLIB_TEST(equal(mean(mat(vects)), (cov+cov2).mean()));
data/dlib-19.10/dlib/test/statistics.cpp:299: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.
                    DLIB_TEST_MSG(equal(covariance(mat(vects)), (cov+cov2).covariance()),
data/dlib-19.10/dlib/test/statistics.cpp:700: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.
            DLIB_TEST(equal(normalizer.transform(), normalizer2.transform()));
data/dlib-19.10/dlib/test/statistics.cpp:701: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.
            DLIB_TEST(equal(normalizer.transformed_means(), normalizer2.transformed_means()));
data/dlib-19.10/dlib/test/svm.cpp:555: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.
        DLIB_TEST(dlib::equal(derivative(obj)(y) , der(obj.x,y), 1e-5));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.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.
                DLIB_TEST(equal(c1 , c2));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:53: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.
                DLIB_TEST(equal(colm(m1,i) , c2));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:54: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.
                DLIB_TEST(equal(c1 , colm(m2,i)));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:55: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.
                DLIB_TEST(equal(colm(m1,i) , colm(m2,i)));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:77: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.
            DLIB_TEST(equal(c1_0, c2_0));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:78: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.
            DLIB_TEST(equal(c1_1, c2_1));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:79: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.
            DLIB_TEST(equal(c1_2, c2_2));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:80: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.
            DLIB_TEST(equal(c1_3, c2_3));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:81: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.
            DLIB_TEST(equal(c1_4, c2_4));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:82: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.
            DLIB_TEST(equal(c1_5, c2_5));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:99: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.
                DLIB_TEST(equal(r1 , r2));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:100: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.
                DLIB_TEST(equal(rowm(m1,i) , r2));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:101: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.
                DLIB_TEST(equal(r1 , rowm(m2,i)));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:102: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.
                DLIB_TEST(equal(rowm(m1,i) , rowm(m2,i)));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:124: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.
            DLIB_TEST(equal(r1_0, r2_0));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:125: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.
            DLIB_TEST(equal(r1_1, r2_1));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:126: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.
            DLIB_TEST(equal(r1_2, r2_2));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:127: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.
            DLIB_TEST(equal(r1_3, r2_3));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:128: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.
            DLIB_TEST(equal(r1_4, r2_4));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:129: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.
            DLIB_TEST(equal(r1_5, r2_5));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:144: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.
            DLIB_TEST(equal(c1 , c2));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:145: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.
            DLIB_TEST(equal(diag(m1) , c2));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:146: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.
            DLIB_TEST(equal(c1 , diag(m2)));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:147: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.
            DLIB_TEST(equal(diag(m1) , diag(m2)));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:162: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.
            DLIB_TEST(equal(symmetric_matrix_cache<float>(m, csize), matrix_cast<float>(m)));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:163: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.
            DLIB_TEST(equal(symmetric_matrix_cache<double>(m, csize), matrix_cast<double>(m)));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:170: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.
                DLIB_TEST(equal(colm(symmetric_matrix_cache<float>(m, csize),i), colm(matrix_cast<float>(m),i)));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:171: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.
                DLIB_TEST(equal(rowm(symmetric_matrix_cache<float>(m, csize),i), rowm(matrix_cast<float>(m),i)));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:173: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.
                DLIB_TEST(equal(colm(symmetric_matrix_cache<float>(m, csize),i), trans(rowm(matrix_cast<float>(m),i))));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:174: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.
                DLIB_TEST(equal(rowm(symmetric_matrix_cache<float>(m, csize),i), trans(colm(matrix_cast<float>(m),i))));
data/dlib-19.10/dlib/test/symmetric_matrix_cache.cpp:178: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.
            DLIB_TEST(equal(diag(symmetric_matrix_cache<float>(m,csize)), diag(matrix_cast<float>(m))));
data/dlib-19.10/dlib/test/vectorstream.cpp:118:11:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        s.read(sbuf, sizeof(sbuf));
data/dlib-19.10/dlib/timing.h:93:17:  [1] (buffer) strncpy:
  Easily used incorrectly; doesn't always \0-terminate or check for invalid
  pointers [MS-banned] (CWE-120).
                strncpy(buf[i], name, NAME_LENGTH-1);
data/dlib-19.10/examples/sockets_ex.cpp:31:20:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
        while (con.read(&ch,1) > 0)
data/dlib-19.10/examples/webcam_face_pose_ex.cpp:63:22:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
            if (!cap.read(temp))
data/dlib-19.10/tools/htmlify/to_xml.cpp:51: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.
            if ( std::equal(endings[i].begin(), endings[i].end(), f.name().end()-endings[i].size()))

ANALYSIS SUMMARY:

Hits = 828
Lines analyzed = 464593 in approximately 10.97 seconds (42355 lines/second)
Physical Source Lines of Code (SLOC) = 292794
Hits@level = [0]   5 [1] 490 [2] 179 [3] 104 [4]  54 [5]   1
Hits@level+ = [0+] 833 [1+] 828 [2+] 338 [3+] 159 [4+]  55 [5+]   1
Hits/KSLOC@level+ = [0+] 2.845 [1+] 2.82793 [2+] 1.1544 [3+] 0.543044 [4+] 0.187845 [5+] 0.00341537
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.