coping over changes which fixed cppcheck

Author: lrvideckis

tests/.config/.cppcheck_suppression_list

@@ -3,19 +3,12 @@ missingIncludeSystem
 functionConst
 assertWithSideEffect
 unknownMacro
+constParameterReference
 unusedStructMember:../library/flow/min_cost_max_flow.hpp
+unusedStructMember:../library/flow/dinic.hpp:15
 unusedStructMember:../library/strings/suffix_array/find/match.hpp:10
-unusedStructMember:../library/trees/tree_lift/tree_lift.hpp:17
-unusedStructMember:../library/trees/ladder_decomposition/linear_kth_par.hpp:17
-unusedStructMember:../library/data_structures/dsu/dsu_bipartite.hpp:9
-unusedStructMember:../library/trees/linear_lca.hpp:15
-unusedScopedObject:../library/trees/centroid_decomp_uncommon/count_paths_per_length.hpp:12
-unusedScopedObject:library_checker_aizu_tests/cd_asserts.hpp:6
-unusedScopedObject:../library/trees/centroid_decomp_uncommon/count_paths_per_node.hpp:14
 unusedScopedObject:library_checker_aizu_tests/trees/centroid_path_dist.test.cpp:29
-unusedScopedObject:../library/trees/edge_centroid_decomp_uncommon/count_paths_per_length.hpp:13
 unusedScopedObject:library_checker_aizu_tests/trees/edge_cd_lca.test.cpp:20
-unusedScopedObject:library_checker_aizu_tests/trees/edge_cd_reroot_dp.test.cpp:49
 unusedScopedObject:library_checker_aizu_tests/trees/cd_jump_on_tree.test.cpp:20
 unusedScopedObject:library_checker_aizu_tests/trees/cd_jump_on_tree.test.cpp:58
 arrayIndexOutOfBoundsCond:library_checker_aizu_tests/math/linear_prime_sieve.test.cpp:17
@@ -25,6 +18,7 @@ useStlAlgorithm:../library/graphs/strongly_connected_components/add_edges_strong
 useStlAlgorithm:../library/math/matrix_related/row_reduce.hpp:28
 useStlAlgorithm:../library/math/count_paths/count_paths_triangle.hpp:24
 useStlAlgorithm:../library/math/matrix_related/xor_basis_unordered_intersection.hpp:10
+useStlAlgorithm:../library/math/matrix_related/xor_basis_unordered.hpp:16
 shadowFunction:../kactl/content/graph/BinaryLifting.h:17
 unknownMacro:../kactl/content/graph/BinaryLifting.h:18
 constParameter:../kactl/content/graph/BinaryLifting.h:29
@@ -36,10 +30,6 @@ constParameter:../library/data_structures/wavelet_merge/merge_sort_tree_updates.
 constParameter:../library/data_structures/wavelet_merge/wavelet_tree_updates.hpp:49
 constParameter:../library/data_structures/wavelet_merge/wavelet_tree_updates.hpp:53
 constParameter:../hackpack-cpp/content/number-theory/ModInt.h:45
-constParameter:../library/data_structures/deque_op/deque.hpp:10
-constParameter:../library/data_structures/deque_op/queue_only.hpp:29
-constParameter:../library/data_structures/uncommon/priority_queue_of_updates.hpp:43
-constParameter:../library/math/matrix_related/row_reduce.hpp:17
 constParameter:library_checker_aizu_tests/data_structures/rmq_inc.test.cpp:11
 variableScope:../kactl/content/number-theory/Factor.h:47
 syntaxError:../library/math/n_choose_k/pascals_identity.hpp:4
@@ -51,8 +41,23 @@ syntaxError:../library/loops/submasks.hpp:7
 syntaxError:../library/loops/supermasks.hpp:8
 syntaxError:../library/math/prime_sieve/mobius.hpp:6
 syntaxError:../library/trees/lca_rmq/iterate_subtree.hpp:6
-constVariable:../kactl/content/graph/CompressTree.h:20
 knownConditionTrueFalse:../library/strings/suffix_array/suffix_array.hpp:62
 knownConditionTrueFalse:../library/strings/suffix_array/suffix_array_short.hpp:29
+knownConditionTrueFalse:../library/data_structures/dsu/kruskal_tree.hpp:15
 constVariable:../kactl/content/numerical/NumberTheoreticTransform.h:30
+constVariable:../kactl/content/graph/CompressTree.h:20
 functionStatic:../library/monotonic_stack/monotonic_stack.hpp:10
+constVariableReference:../kactl/content/graph/CompressTree.h:20
+constVariableReference:../library/flow/min_cost_max_flow.hpp:43
+constVariableReference:library_checker_aizu_tests/graphs/connected_components_of_complement_graph.test.cpp:21
+constVariableReference:library_checker_aizu_tests/handmade_tests/dsu_size.test.cpp:39
+constVariableReference:../library/trees/centroid_decomp_uncommon/count_paths_per_length.hpp:34
+constVariablePointer:../kactl/content/numerical/FastFourierTransform.h:39
+cstyleCast:../kactl/content/numerical/FastFourierTransform.h:39
+derefInvalidIterator:../library/data_structures/uncommon/linear_rmq.hpp:28
+derefInvalidIterator:library_checker_aizu_tests/handmade_tests/n_choose_k.test.cpp:13
+unreadVariable:library_checker_aizu_tests/handmade_tests/permutation_tree_small.test.cpp:12
+uninitvar:library_checker_aizu_tests/handmade_tests/seg_tree_find_small.test.cpp:41
+unusedFunction:../kactl/content/data-structures/UnionFind.h:14
+unusedFunction:../kactl/content/number-theory/ModPow.h:13
+unusedFunction:../kactl/stress-tests/utilities/genTree.h:49