make cppcheck suppressions file-level so line shifts don't break ci

Author: Cameron Custer

tests/.config/.cppcheck_suppression_list

@@ -4,61 +4,56 @@ functionConst
 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
-unusedScopedObject:library_checker_aizu_tests/trees/centroid_path_dist.test.cpp:29
-unusedScopedObject:library_checker_aizu_tests/trees/edge_cd_lca.test.cpp:20
-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
-negativeContainerIndex:../library/strings/suffix_array/burrows_wheeler.hpp:50
-useStlAlgorithm:../kactl/content/numerical/FastFourierTransform.h:53
-useStlAlgorithm:../library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp:58
-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.hpp:13
-shadowFunction:../kactl/content/graph/BinaryLifting.h:17
-unknownMacro:../kactl/content/graph/BinaryLifting.h:18
-constParameter:../kactl/content/graph/BinaryLifting.h:29
-constParameter:../library/data_structures/wavelet_merge/merge_sort_tree.hpp:28
-constParameter:../library/data_structures/wavelet_merge/merge_sort_tree.hpp:41
-constParameter:../library/data_structures/wavelet_merge/merge_sort_tree_updates.hpp:50
-constParameter:../library/data_structures/wavelet_merge/merge_sort_tree_updates.hpp:55
-constParameter:../library/data_structures/wavelet_merge/merge_sort_tree_updates.hpp:59
-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_checker_aizu_tests/data_structures/rmq_inc.test.cpp:11
-variableScope:../kactl/content/number-theory/Factor.h:55
-syntaxError:../library/math/n_choose_k/pascals_identity.hpp:4
-syntaxError:../library/math/prime_sieve/calc_sieve.hpp:6
-syntaxError:../library/math/prime_sieve/calc_linear_sieve.hpp:6
-syntaxError:../library/loops/chooses.hpp:7
-syntaxError:../library/loops/quotients.hpp:10
-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
-knownConditionTrueFalse:../library/strings/suffix_array/suffix_array.hpp:62
-knownConditionTrueFalse:../library/strings/suffix_array/suffix_array_short.hpp:34
-knownConditionTrueFalse:../library/dsu/kruskal_tree.hpp:13
-knownConditionTrueFalse:../library/dsu/dsu.hpp:11
-knownConditionTrueFalse:../library/dsu/dsu_weighted.hpp:29
-constVariable:../kactl/content/numerical/NumberTheoreticTransform.h:30
-constVariable:../kactl/content/graph/CompressTree.h:20
-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_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
-containerOutOfBounds:../library/data_structures_[l,r)/uncommon/permutation_tree.hpp:85
+unusedStructMember:../library/flow/dinic.hpp
+unusedStructMember:../library/strings/suffix_array/find/match.hpp
+unusedScopedObject:library_checker_aizu_tests/trees/centroid_path_dist.test.cpp
+unusedScopedObject:library_checker_aizu_tests/trees/edge_cd_lca.test.cpp
+unusedScopedObject:library_checker_aizu_tests/trees/cd_jump_on_tree.test.cpp
+arrayIndexOutOfBoundsCond:library_checker_aizu_tests/math/linear_prime_sieve.test.cpp
+negativeContainerIndex:../library/strings/suffix_array/burrows_wheeler.hpp
+useStlAlgorithm:../kactl/content/numerical/FastFourierTransform.h
+useStlAlgorithm:../library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp
+useStlAlgorithm:../library/math/matrix_related/row_reduce.hpp
+useStlAlgorithm:../library/math/count_paths/count_paths_triangle.hpp
+useStlAlgorithm:../library/math/matrix_related/xor_basis_unordered.hpp
+shadowFunction:../kactl/content/graph/BinaryLifting.h
+unknownMacro:../kactl/content/graph/BinaryLifting.h
+constParameter:../kactl/content/graph/BinaryLifting.h
+constParameter:../library/data_structures/wavelet_merge/merge_sort_tree.hpp
+constParameter:../library/data_structures/wavelet_merge/merge_sort_tree_updates.hpp
+constParameter:../library/data_structures/wavelet_merge/wavelet_tree_updates.hpp
+constParameter:../hackpack-cpp/content/number-theory/ModInt.h
+constParameter:library_checker_aizu_tests/data_structures/rmq_inc.test.cpp
+variableScope:../kactl/content/number-theory/Factor.h
+syntaxError:../library/math/n_choose_k/pascals_identity.hpp
+syntaxError:../library/math/prime_sieve/calc_sieve.hpp
+syntaxError:../library/math/prime_sieve/calc_linear_sieve.hpp
+syntaxError:../library/loops/chooses.hpp
+syntaxError:../library/loops/quotients.hpp
+syntaxError:../library/loops/submasks.hpp
+syntaxError:../library/loops/supermasks.hpp
+syntaxError:../library/math/prime_sieve/mobius.hpp
+syntaxError:../library/trees/lca_rmq/iterate_subtree.hpp
+knownConditionTrueFalse:../library/strings/suffix_array/suffix_array.hpp
+knownConditionTrueFalse:../library/strings/suffix_array/suffix_array_short.hpp
+knownConditionTrueFalse:../library/dsu/kruskal_tree.hpp
+knownConditionTrueFalse:../library/dsu/dsu.hpp
+knownConditionTrueFalse:../library/dsu/dsu_weighted.hpp
+constVariable:../kactl/content/numerical/NumberTheoreticTransform.h
+constVariable:../kactl/content/graph/CompressTree.h
+constVariableReference:../kactl/content/graph/CompressTree.h
+constVariableReference:../library/flow/min_cost_max_flow.hpp
+constVariableReference:library_checker_aizu_tests/graphs/connected_components_of_complement_graph.test.cpp
+constVariableReference:library_checker_aizu_tests/handmade_tests/dsu_size.test.cpp
+constVariableReference:../library/trees/centroid_decomp_uncommon/count_paths_per_length.hpp
+constVariablePointer:../kactl/content/numerical/FastFourierTransform.h
+cstyleCast:../kactl/content/numerical/FastFourierTransform.h
+derefInvalidIterator:library_checker_aizu_tests/handmade_tests/n_choose_k.test.cpp
+unreadVariable:library_checker_aizu_tests/handmade_tests/permutation_tree_small.test.cpp
+uninitvar:library_checker_aizu_tests/handmade_tests/seg_tree_find_small.test.cpp
+unusedFunction:../kactl/content/data-structures/UnionFind.h
+unusedFunction:../kactl/content/number-theory/ModPow.h
+unusedFunction:../kactl/stress-tests/utilities/genTree.h
+containerOutOfBounds:../library/data_structures_[l,r)/uncommon/permutation_tree.hpp
 ctuOneDefinitionRuleViolation:../library/data_structures_[l,r)/bit.hpp
-ctuOneDefinitionRuleViolation:../library/data_structures_[l,r)/lazy_seg_tree.hpp:4
+ctuOneDefinitionRuleViolation:../library/data_structures_[l,r)/lazy_seg_tree.hpp