Skip to content

Instantly share code, notes, and snippets.

@IncludeGuardian
Created April 10, 2023 11:30
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save IncludeGuardian/0837719e0d1162d5b50e4c8fed4d3c0d to your computer and use it in GitHub Desktop.
Save IncludeGuardian/0837719e0d1162d5b50e4c8fed4d3c0d to your computer and use it in GitHub Desktop.
---
# Visit https://includeguardian.io for updates and
# https://includeguardian.io/ci to keep your project building fast!
stats:
version: 0.0.7
command: 'includeguardian.exe --dir libs/graph --I libs/accumulators/include --I libs/algorithm/include --I libs/align/include --I libs/any/include --I libs/array/include --I libs/asio/include --I libs/assert/include --I libs/assign/include --I libs/atomic/include --I libs/beast/include --I libs/bimap/include --I libs/bind/include --I libs/callable_traits/include --I libs/chrono/include --I libs/circular_buffer/include --I libs/compatibility/include --I libs/compute/include --I libs/concept_check/include --I libs/config/include --I libs/container/include --I libs/container_hash/include --I libs/context/include --I libs/contract/include --I libs/conversion/include --I libs/convert/include --I libs/core/include --I libs/coroutine/include --I libs/coroutine2/include --I libs/crc/include --I libs/date_time/include --I libs/describe/include --I libs/detail/include --I libs/dll/include --I libs/dynamic_bitset/include --I libs/endian/include --I libs/exception/include --I libs/fiber/include --I libs/filesystem/include --I libs/flyweight/include --I libs/foreach/include --I libs/format/include --I libs/function/include --I libs/function_types/include --I libs/functional/include --I libs/fusion/include --I libs/geometry/include --I libs/gil/include --I libs/graph/include --I libs/graph_parallel/include --I libs/hana/include --I libs/headers/include --I libs/heap/include --I libs/histogram/include --I libs/hof/include --I libs/icl/include --I libs/integer/include --I libs/interprocess/include --I libs/intrusive/include --I libs/io/include --I libs/iostreams/include --I libs/iterator/include --I libs/json/include --I libs/lambda/include --I libs/lambda2/include --I libs/leaf/include --I libs/lexical_cast/include --I libs/local_function/include --I libs/locale/include --I libs/lockfree/include --I libs/log/include --I libs/logic/include --I libs/math/include --I libs/metaparse/include --I libs/move/include --I libs/mp11/include --I libs/mpi/include --I libs/mpl/include --I libs/msm/include --I libs/multi_array/include --I libs/multi_index/include --I libs/multiprecision/include --I libs/mysql/include --I libs/nowide/include --I libs/numeric/include --I libs/optional/include --I libs/outcome/include --I libs/parameter/include --I libs/parameter_python/include --I libs/pfr/include --I libs/phoenix/include --I libs/poly_collection/include --I libs/polygon/include --I libs/pool/include --I libs/predef/include --I libs/preprocessor/include --I libs/process/include --I libs/program_options/include --I libs/property_map/include --I libs/property_map_parallel/include --I libs/property_tree/include --I libs/proto/include --I libs/ptr_container/include --I libs/python/include --I libs/qvm/include --I libs/random/include --I libs/range/include --I libs/ratio/include --I libs/rational/include --I libs/regex/include --I libs/safe_numerics/include --I libs/scope_exit/include --I libs/serialization/include --I libs/signals2/include --I libs/smart_ptr/include --I libs/sort/include --I libs/spirit/include --I libs/stacktrace/include --I libs/statechart/include --I libs/static_assert/include --I libs/static_string/include --I libs/stl_interfaces/include --I libs/system/include --I libs/test/include --I libs/thread/include --I libs/throw_exception/include --I libs/timer/include --I libs/tokenizer/include --I libs/tti/include --I libs/tuple/include --I libs/type_erasure/include --I libs/type_index/include --I libs/type_traits/include --I libs/typeof/include --I libs/units/include --I libs/unordered/include --I libs/url/include --I libs/utility/include --I libs/uuid/include --I libs/variant/include --I libs/variant2/include --I libs/vmd/include --I libs/wave/include --I libs/winapi/include --I libs/xpressive/include --I libs/yap/include'
sources:
- 'libs\graph\test\adjacency_matrix_test.cpp'
- 'libs\graph\test\adj_list_cc.cpp'
- 'libs\graph\test\adj_list_edge_list_set.cpp'
- 'libs\graph\test\adj_list_invalidation.cpp'
- 'libs\graph\test\adj_list_loops.cpp'
- 'libs\graph\test\adj_matrix_cc.cpp'
- 'libs\graph\test\all_planar_input_files_test.cpp'
- 'libs\graph\test\astar_search_test.cpp'
- 'libs\graph\test\basic_planarity_test.cpp'
- 'libs\graph\test\bellman-test.cpp'
- 'libs\graph\test\betweenness_centrality_test.cpp'
- 'libs\graph\test\bfs.cpp'
- 'libs\graph\test\bfs_cc.cpp'
- 'libs\graph\test\biconnected_components_test.cpp'
- 'libs\graph\test\bidir_remove_edge.cpp'
- 'libs\graph\test\bidir_vec_remove_edge.cpp'
- 'libs\graph\test\bipartite_test.cpp'
- 'libs\graph\test\boykov_kolmogorov_max_flow_test.cpp'
- 'libs\graph\test\bron_kerbosch_all_cliques.cpp'
- 'libs\graph\test\bundled_properties.cpp'
- 'libs\graph\test\closeness_centrality.cpp'
- 'libs\graph\test\clustering_coefficient.cpp'
- 'libs\graph\test\copy.cpp'
- 'libs\graph\test\core_numbers_test.cpp'
- 'libs\graph\test\csr_graph_test.cpp'
- 'libs\graph\test\cuthill_mckee_ordering.cpp'
- 'libs\graph\test\cycle_canceling_test.cpp'
- 'libs\graph\test\cycle_ratio_tests.cpp'
- 'libs\graph\test\dag_longest_paths.cpp'
- 'libs\graph\test\degree_centrality.cpp'
- 'libs\graph\test\delete_edge.cpp'
- 'libs\graph\test\dfs.cpp'
- 'libs\graph\test\dfs_cc.cpp'
- 'libs\graph\test\dijkstra_cc.cpp'
- 'libs\graph\test\dijkstra_heap_performance.cpp'
- 'libs\graph\test\dijkstra_no_color_map_compare.cpp'
- 'libs\graph\test\dimacs.cpp'
- 'libs\graph\test\disjoint_set_test.cpp'
- 'libs\graph\test\dominator_tree_test.cpp'
- 'libs\graph\test\eccentricity.cpp'
- 'libs\graph\test\edge_list_cc.cpp'
- 'libs\graph\test\filtered_graph_cc.cpp'
- 'libs\graph\test\filtered_graph_properties_dijkstra.cpp'
- 'libs\graph\test\filter_graph_vp_test.cpp'
- 'libs\graph\test\find_flow_cost_bundled_properties_and_named_params_test.cpp'
- 'libs\graph\test\finish_edge_bug.cpp'
- 'libs\graph\test\floyd_warshall_test.cpp'
- 'libs\graph\test\generator_test.cpp'
- 'libs\graph\test\graph.cpp'
- 'libs\graph\test\graphml_test.cpp'
- 'libs\graph\test\graphviz_test.cpp'
- 'libs\graph\test\graph_concepts.cpp'
- 'libs\graph\test\grid_graph_cc.cpp'
- 'libs\graph\test\grid_graph_test.cpp'
- 'libs\graph\test\gursoy_atun_layout_test.cpp'
- 'libs\graph\test\hawick_circuits.cpp'
- 'libs\graph\test\incremental_components_test.cpp'
- 'libs\graph\test\index_graph.cpp'
- 'libs\graph\test\isomorphism.cpp'
- 'libs\graph\test\is_straight_line_draw_test.cpp'
- 'libs\graph\test\johnson-test.cpp'
- 'libs\graph\test\king_ordering.cpp'
- 'libs\graph\test\labeled_graph.cpp'
- 'libs\graph\test\layout_test.cpp'
- 'libs\graph\test\leda_graph_cc.cpp'
- 'libs\graph\test\lvalue_pmap.cpp'
- 'libs\graph\test\make_bicon_planar_test.cpp'
- 'libs\graph\test\make_connected_test.cpp'
- 'libs\graph\test\make_maximal_planar_test.cpp'
- 'libs\graph\test\mas_test.cpp'
- 'libs\graph\test\matching_test.cpp'
- 'libs\graph\test\max_flow_algorithms_bundled_properties_and_named_params.cpp'
- 'libs\graph\test\max_flow_test.cpp'
- 'libs\graph\test\mcgregor_subgraphs_test.cpp'
- 'libs\graph\test\mean_geodesic.cpp'
- 'libs\graph\test\metis_test.cpp'
- 'libs\graph\test\metric_tsp_approx.cpp'
- 'libs\graph\test\min_degree_empty.cpp'
- 'libs\graph\test\named_vertices_test.cpp'
- 'libs\graph\test\parallel_edges_loops_test.cpp'
- 'libs\graph\test\property_iter.cpp'
- 'libs\graph\test\random_matching_test.cpp'
- 'libs\graph\test\random_spanning_tree_test.cpp'
- 'libs\graph\test\rcsp_custom_vertex_id.cpp'
- 'libs\graph\test\read_propmap.cpp'
- 'libs\graph\test\reverse_graph_cc.cpp'
- 'libs\graph\test\r_c_shortest_paths_test.cpp'
- 'libs\graph\test\sequential_vertex_coloring.cpp'
- 'libs\graph\test\serialize.cpp'
- 'libs\graph\test\stanford_graph_cc.cpp'
- 'libs\graph\test\stoer_wagner_test.cpp'
- 'libs\graph\test\strong_components_test.cpp'
- 'libs\graph\test\subgraph.cpp'
- 'libs\graph\test\subgraph_add.cpp'
- 'libs\graph\test\subgraph_bundled.cpp'
- 'libs\graph\test\subgraph_props.cpp'
- 'libs\graph\test\successive_shortest_path_nonnegative_weights_test.cpp'
- 'libs\graph\test\swap.cpp'
- 'libs\graph\test\test_graphs.cpp'
- 'libs\graph\test\tiernan_all_cycles.cpp'
- 'libs\graph\test\transitive_closure_test.cpp'
- 'libs\graph\test\transitive_closure_test2.cpp'
- 'libs\graph\test\two_graphs_common_spanning_trees_test.cpp'
- 'libs\graph\test\undirected_dfs.cpp'
- 'libs\graph\test\vector_graph_cc.cpp'
- 'libs\graph\test\vf2_sub_graph_iso_test.cpp'
- 'libs\graph\test\vf2_sub_graph_iso_test_2.cpp'
- 'libs\graph\test\weighted_matching_test.cpp'
- 'libs\graph\src\graphml.cpp'
- 'libs\graph\src\read_graphviz_new.cpp'
- 'libs\graph\example\accum-compile-times.cpp'
- 'libs\graph\example\actor_clustering.cpp'
- 'libs\graph\example\adjacency_list.cpp'
- 'libs\graph\example\adjacency_list_io.cpp'
- 'libs\graph\example\adjacency_matrix.cpp'
- 'libs\graph\example\adj_list_ra_edgelist.cpp'
- 'libs\graph\example\astar-cities.cpp'
- 'libs\graph\example\astar_maze.cpp'
- 'libs\graph\example\bellman-example.cpp'
- 'libs\graph\example\bellman-ford-internet.cpp'
- 'libs\graph\example\bfs-example.cpp'
- 'libs\graph\example\bfs-example2.cpp'
- 'libs\graph\example\bfs-name-printer.cpp'
- 'libs\graph\example\bfs.cpp'
- 'libs\graph\example\bfs_neighbor.cpp'
- 'libs\graph\example\biconnected_components.cpp'
- 'libs\graph\example\bipartite_example.cpp'
- 'libs\graph\example\boost_web_graph.cpp'
- 'libs\graph\example\boykov_kolmogorov-eg.cpp'
- 'libs\graph\example\bron_kerbosch_clique_number.cpp'
- 'libs\graph\example\bron_kerbosch_print_cliques.cpp'
- 'libs\graph\example\bucket_sorter.cpp'
- 'libs\graph\example\canonical_ordering.cpp'
- 'libs\graph\example\cc-internet.cpp'
- 'libs\graph\example\city_visitor.cpp'
- 'libs\graph\example\closeness_centrality.cpp'
- 'libs\graph\example\clustering_coefficient.cpp'
- 'libs\graph\example\components_on_edgelist.cpp'
- 'libs\graph\example\connected-components.cpp'
- 'libs\graph\example\connected_components.cpp'
- 'libs\graph\example\container_gen.cpp'
- 'libs\graph\example\copy-example.cpp'
- 'libs\graph\example\csr-example.cpp'
- 'libs\graph\example\cuthill_mckee_ordering.cpp'
- 'libs\graph\example\cycle-file-dep.cpp'
- 'libs\graph\example\cycle-file-dep2.cpp'
- 'libs\graph\example\cycle_canceling_example.cpp'
- 'libs\graph\example\cycle_ratio_example.cpp'
- 'libs\graph\example\dag_shortest_paths.cpp'
- 'libs\graph\example\dave.cpp'
- 'libs\graph\example\default-constructor.cpp'
- 'libs\graph\example\default-constructor2.cpp'
- 'libs\graph\example\degree_centrality.cpp'
- 'libs\graph\example\dfs-example.cpp'
- 'libs\graph\example\dfs-parenthesis.cpp'
- 'libs\graph\example\dfs.cpp'
- 'libs\graph\example\dfs_parenthesis.cpp'
- 'libs\graph\example\dijkstra-example-listS.cpp'
- 'libs\graph\example\dijkstra-example.cpp'
- 'libs\graph\example\dijkstra-no-color-map-example.cpp'
- 'libs\graph\example\directed_graph.cpp'
- 'libs\graph\example\eccentricity.cpp'
- 'libs\graph\example\edge-connectivity.cpp'
- 'libs\graph\example\edge-function.cpp'
- 'libs\graph\example\edge-iter-constructor.cpp'
- 'libs\graph\example\edge_basics.cpp'
- 'libs\graph\example\edge_coloring.cpp'
- 'libs\graph\example\edge_connectivity.cpp'
- 'libs\graph\example\edge_iterator_constructor.cpp'
- 'libs\graph\example\edge_property.cpp'
- 'libs\graph\example\edmonds-karp-eg.cpp'
- 'libs\graph\example\exterior_properties.cpp'
- 'libs\graph\example\exterior_property_map.cpp'
- 'libs\graph\example\family_tree.cpp'
- 'libs\graph\example\fibonacci_heap.cpp'
- 'libs\graph\example\file_dependencies.cpp'
- 'libs\graph\example\filtered-copy-example.cpp'
- 'libs\graph\example\filtered_graph.cpp'
- 'libs\graph\example\filtered_graph_edge_range.cpp'
- 'libs\graph\example\filtered_vec_as_graph.cpp'
- 'libs\graph\example\fr_layout.cpp'
- 'libs\graph\example\gerdemann.cpp'
- 'libs\graph\example\girth.cpp'
- 'libs\graph\example\graph-assoc-types.cpp'
- 'libs\graph\example\graph-property-iter-eg.cpp'
- 'libs\graph\example\graph-thingie.cpp'
- 'libs\graph\example\graph.cpp'
- 'libs\graph\example\graphviz.cpp'
- 'libs\graph\example\graph_as_tree.cpp'
- 'libs\graph\example\graph_property.cpp'
- 'libs\graph\example\grid_graph_example.cpp'
- 'libs\graph\example\grid_graph_properties.cpp'
- 'libs\graph\example\hawick_circuits.cpp'
- 'libs\graph\example\implicit_graph.cpp'
- 'libs\graph\example\inclusive_mean_geodesic.cpp'
- 'libs\graph\example\incremental-components-eg.cpp'
- 'libs\graph\example\incremental_components.cpp'
- 'libs\graph\example\influence_prestige.cpp'
- 'libs\graph\example\interior_pmap_bundled.cpp'
- 'libs\graph\example\interior_property_map.cpp'
- 'libs\graph\example\in_edges.cpp'
- 'libs\graph\example\iohb.c'
- 'libs\graph\example\isomorphism.cpp'
- 'libs\graph\example\iteration_macros.cpp'
- 'libs\graph\example\iterator-property-map-eg.cpp'
- 'libs\graph\example\johnson-eg.cpp'
- 'libs\graph\example\kevin-bacon.cpp'
- 'libs\graph\example\kevin-bacon2.cpp'
- 'libs\graph\example\king_ordering.cpp'
- 'libs\graph\example\knights_tour.cpp'
- 'libs\graph\example\kruskal-example.cpp'
- 'libs\graph\example\kruskal-telephone.cpp'
- 'libs\graph\example\kuratowski_subgraph.cpp'
- 'libs\graph\example\labeled_graph.cpp'
- 'libs\graph\example\last-mod-time.cpp'
- 'libs\graph\example\leda-concept-check.cpp'
- 'libs\graph\example\leda-graph-eg.cpp'
- 'libs\graph\example\loops_dfs.cpp'
- 'libs\graph\example\make_biconnected_planar.cpp'
- 'libs\graph\example\make_connected.cpp'
- 'libs\graph\example\make_maximal_planar.cpp'
- 'libs\graph\example\matching_example.cpp'
- 'libs\graph\example\max_flow.cpp'
- 'libs\graph\example\mcgregor_subgraphs_example.cpp'
- 'libs\graph\example\mean_geodesic.cpp'
- 'libs\graph\example\miles_span.cpp'
- 'libs\graph\example\minimum_degree_ordering.cpp'
- 'libs\graph\example\min_max_paths.cpp'
- 'libs\graph\example\modify_graph.cpp'
- 'libs\graph\example\neighbor_bfs.cpp'
- 'libs\graph\example\ordered_out_edges.cpp'
- 'libs\graph\example\ospf-example.cpp'
- 'libs\graph\example\parallel-compile-time.cpp'
- 'libs\graph\example\planar_face_traversal.cpp'
- 'libs\graph\example\prim-example.cpp'
- 'libs\graph\example\prim-telephone.cpp'
- 'libs\graph\example\print-adjacent-vertices.cpp'
- 'libs\graph\example\print-edges.cpp'
- 'libs\graph\example\print-in-edges.cpp'
- 'libs\graph\example\print-out-edges.cpp'
- 'libs\graph\example\property-map-traits-eg.cpp'
- 'libs\graph\example\property_iterator.cpp'
- 'libs\graph\example\push-relabel-eg.cpp'
- 'libs\graph\example\put-get-helper-eg.cpp'
- 'libs\graph\example\quick-tour.cpp'
- 'libs\graph\example\quick_tour.cpp'
- 'libs\graph\example\reachable-loop-head.cpp'
- 'libs\graph\example\reachable-loop-tail.cpp'
- 'libs\graph\example\read_graphviz.cpp'
- 'libs\graph\example\read_write_dimacs-eg.cpp'
- 'libs\graph\example\remove_edge_if_bidir.cpp'
- 'libs\graph\example\remove_edge_if_dir.cpp'
- 'libs\graph\example\remove_edge_if_undir.cpp'
- 'libs\graph\example\reverse_graph.cpp'
- 'libs\graph\example\roget_components.cpp'
- 'libs\graph\example\r_c_shortest_paths_example.cpp'
- 'libs\graph\example\scaled_closeness_centrality.cpp'
- 'libs\graph\example\scc.cpp'
- 'libs\graph\example\simple_planarity_test.cpp'
- 'libs\graph\example\sloan_ordering.cpp'
- 'libs\graph\example\stoer_wagner.cpp'
- 'libs\graph\example\straight_line_drawing.cpp'
- 'libs\graph\example\strong-components.cpp'
- 'libs\graph\example\strong_components.cpp'
- 'libs\graph\example\subgraph.cpp'
- 'libs\graph\example\subgraph_properties.cpp'
- 'libs\graph\example\successive_shortest_path_nonnegative_weights_example.cpp'
- 'libs\graph\example\tiernan_girth_circumference.cpp'
- 'libs\graph\example\tiernan_print_cycles.cpp'
- 'libs\graph\example\topo-sort-file-dep.cpp'
- 'libs\graph\example\topo-sort-file-dep2.cpp'
- 'libs\graph\example\topo-sort-with-leda.cpp'
- 'libs\graph\example\topo-sort-with-sgb.cpp'
- 'libs\graph\example\topo-sort1.cpp'
- 'libs\graph\example\topo-sort2.cpp'
- 'libs\graph\example\topo_sort.cpp'
- 'libs\graph\example\transitive_closure.cpp'
- 'libs\graph\example\transpose-example.cpp'
- 'libs\graph\example\two_graphs_common_spanning_trees.cpp'
- 'libs\graph\example\undirected_adjacency_list.cpp'
- 'libs\graph\example\undirected_dfs.cpp'
- 'libs\graph\example\undirected_graph.cpp'
- 'libs\graph\example\vector_as_graph.cpp'
- 'libs\graph\example\vertex-name-property.cpp'
- 'libs\graph\example\vertex_basics.cpp'
- 'libs\graph\example\vf2_sub_graph_iso_example.cpp'
- 'libs\graph\example\vf2_sub_graph_iso_multi_example.cpp'
- 'libs\graph\example\visitor.cpp'
- 'libs\graph\example\weighted_matching_example.cpp'
- 'libs\graph\example\write_graphviz.cpp'
- 'libs\graph\doc\eg1-iso.cpp'
processing time: 9.275 # seconds
source count: 291
file count: 3062
include directives: 15287
# These are the stats of all the files found. This would be
# similar to the cost of a "unity build".
preprocessed:
byte count: 52768479 # 50.0 MiB
token count: 2169121
# These are the stats of all postprocessed
# translation units passed to the compiler.
postprocessed:
byte count: 6015663428 # 6.00 GiB
token count: 227372241
# These are the stats of the actual build, i.e. all
# postprocessed translation units passed to the compiler subtracting the
# cost of precompiled header:
actual:
byte count: 6015663428 # 6.00 GiB
token count: 227372241
missing files:
- LEDA/graph/graph.h
- LEDA/graph/node_array.h
- LEDA/graph/node_map.h
- boost/numeric/conversion/cast.hpp
- boost/numeric/conversion/conversion_traits.hpp
- boost/numeric/conversion/converter.hpp
- gb_basic.h
- gb_books.h
- gb_dijk.h
- gb_econ.h
- gb_flip.h
- gb_games.h
- gb_gates.h
- gb_graph.h
- gb_io.h
- gb_lisa.h
- gb_miles.h
- gb_plane.h
- gb_raman.h
- gb_rand.h
- gb_roget.h
- gb_save.h
- gb_words.h
analysis:
# Below are the files that do not have an include guard or
# include guard that is not strict enough to enable the multiple-include
# optimization where compilers will skip opening a file a second time
# for each source.
unguarded files:
time taken: 0 # seconds
results:
- file: '"boost\preprocessor\config\config.hpp"'
count: 160
- file: '"boost\assert.hpp"'
count: 116
- file: '"boost\property_map\property_map.hpp"'
count: 114
- file: '"boost\preprocessor\cat.hpp"'
count: 103
- file: '"boost\predef\make.h"'
count: 102
- file: '"boost\preprocessor\tuple\elem.hpp"'
count: 51
- file: '"boost\cstdint.hpp"'
count: 44
- file: '"boost\preprocessor\control\iif.hpp"'
count: 38
- file: '"boost\preprocessor\arithmetic\dec.hpp"'
count: 37
- file: '"boost\preprocessor\arithmetic\inc.hpp"'
count: 36
- file: '"boost\preprocessor\control\if.hpp"'
count: 34
- file: '"boost\preprocessor\config\limits.hpp"'
count: 33
- file: '"boost\random\detail\config.hpp"'
count: 33
- file: '"boost\preprocessor\tuple\rem.hpp"'
count: 32
- file: '"boost\fusion\sequence\intrinsic\begin.hpp"'
count: 31
- file: '"boost\test\detail\suppress_warnings.hpp"'
count: 30
- file: '"boost\test\detail\enable_warnings.hpp"'
count: 30
- file: '"boost\preprocessor\repetition\repeat.hpp"'
count: 27
- file: '"boost\preprocessor\repetition\enum_params.hpp"'
count: 26
- file: '"boost\mpl\aux_\include_preprocessed.hpp"'
count: 25
- file: '"boost\type_traits\detail\has_binary_operator.hpp"'
count: 25
- file: '"boost\mpl\placeholders.hpp"'
count: 22
- file: '"boost\preprocessor\repetition\enum_binary_params.hpp"'
count: 20
- file: '"boost\archive\detail\abi_prefix.hpp"'
count: 20
- file: '"boost\archive\detail\abi_suffix.hpp"'
count: 20
- file: '"boost\mpl\apply.hpp"'
count: 20
- file: '"boost\preprocessor\repetition\enum.hpp"'
count: 18
- file: '"boost\preprocessor\iteration\iterate.hpp"'
count: 18
- file: '"boost\preprocessor\punctuation\comma_if.hpp"'
count: 18
- file: '"boost\preprocessor\tuple\eat.hpp"'
count: 18
- file: '"boost\preprocessor\seq\size.hpp"'
count: 18
- file: '"boost\preprocessor\control\while.hpp"'
count: 17
- file: '"boost\preprocessor\repetition\repeat_from_to.hpp"'
count: 15
- file: '"boost\preprocessor\facilities\intercept.hpp"'
count: 15
- file: '"boost\random\detail\disable_warnings.hpp"'
count: 14
- file: '"boost\preprocessor\logical\bool.hpp"'
count: 14
- file: '"boost\preprocessor\detail\auto_rec.hpp"'
count: 14
- file: '"boost\random\detail\enable_warnings.hpp"'
count: 14
- file: '"boost\preprocessor\repetition\enum_trailing_params.hpp"'
count: 14
- file: '"boost\preprocessor\array\size.hpp"'
count: 14
- file: '"boost\mpl\apply_wrap.hpp"'
count: 13
- file: '"boost\preprocessor\seq\seq.hpp"'
count: 13
- file: '"boost\preprocessor\list\adt.hpp"'
count: 12
- file: '"boost\preprocessor\facilities\empty.hpp"'
count: 12
- file: '"boost\preprocessor\variadic\has_opt.hpp"'
count: 12
- file: '"boost\preprocessor\arithmetic\sub.hpp"'
count: 12
- file: '"boost\preprocessor\facilities\identity.hpp"'
count: 12
- file: '"boost\move\detail\config_end.hpp"'
count: 11
- file: '"boost\move\detail\config_begin.hpp"'
count: 11
- file: '"boost\preprocessor\stringize.hpp"'
count: 11
- file: '"boost\preprocessor\variadic\size.hpp"'
count: 11
- file: '"boost\preprocessor\control\expr_if.hpp"'
count: 10
- file: '"boost\preprocessor\debug\error.hpp"'
count: 10
- file: '"boost\preprocessor\seq\enum.hpp"'
count: 10
- file: '"boost\preprocessor\tuple\to_array.hpp"'
count: 9
- file: '"boost\preprocessor\seq\fold_left.hpp"'
count: 8
- file: '"boost\iterator\detail\config_undef.hpp"'
count: 8
- file: '"boost\type_traits\detail\has_prefix_operator.hpp"'
count: 8
- file: '"boost\iterator\detail\config_def.hpp"'
count: 8
- file: '"boost\preprocessor\array\elem.hpp"'
count: 8
- file: '"boost\preprocessor\tuple\size.hpp"'
count: 8
- file: '"boost\preprocessor\repetition\for.hpp"'
count: 8
- file: '"boost\predef\os\windows.h"'
count: 8
- file: '"boost\preprocessor\seq\for_each.hpp"'
count: 8
- file: '"boost\preprocessor\facilities\overload.hpp"'
count: 8
- file: '"boost\preprocessor\array\to_tuple.hpp"'
count: 8
- file: '"boost\filesystem\detail\footer.hpp"'
count: 7
- file: '"boost\fusion\container\list\cons.hpp"'
count: 7
- file: '"boost\filesystem\detail\header.hpp"'
count: 7
- file: '"boost\preprocessor\logical\compl.hpp"'
count: 7
- file: '"boost\preprocessor\logical\bitand.hpp"'
count: 7
- file: '"boost\preprocessor\comparison\not_equal.hpp"'
count: 7
- file: '"boost\preprocessor\seq\first_n.hpp"'
count: 7
- file: '"boost\predef\os\bsd.h"'
count: 7
- file: '"boost\preprocessor\comparison\equal.hpp"'
count: 7
- file: '"boost\graph\iteration_macros_undef.hpp"'
count: 7
- file: '"boost\preprocessor\repetition\enum_trailing_binary_params.hpp"'
count: 6
- file: '"boost\functional\hash.hpp"'
count: 6
- file: '"boost\mpl\bind.hpp"'
count: 6
- file: '"boost\preprocessor\comparison\greater.hpp"'
count: 6
- file: '"boost\config\abi_prefix.hpp"'
count: 6
- file: '"boost\preprocessor\array\data.hpp"'
count: 6
- file: '"boost\predef\platform\windows_uwp.h"'
count: 6
- file: '"boost\preprocessor\comparison\less_equal.hpp"'
count: 6
- file: '"boost\preprocessor\control\expr_iif.hpp"'
count: 6
- file: '"boost\config\abi_suffix.hpp"'
count: 6
- file: '"boost\preprocessor\seq\for_each_i.hpp"'
count: 6
- file: '"boost\concept\detail\concept_def.hpp"'
count: 6
- file: '"boost\concept\detail\concept_undef.hpp"'
count: 6
- file: '"boost\preprocessor\inc.hpp"'
count: 6
- file: '"boost\mpl\aux_\comparison_op.hpp"'
count: 6
- file: '"boost\preprocessor\punctuation\comma.hpp"'
count: 5
- file: '"boost\mpl\arg.hpp"'
count: 5
- file: '"boost\function\detail\maybe_include.hpp"'
count: 5
- file: '"boost\preprocessor\facilities\expand.hpp"'
count: 5
- file: '"boost\preprocessor\list\fold_right.hpp"'
count: 5
- file: '"boost\preprocessor\arithmetic\add.hpp"'
count: 5
- file: '"boost\preprocessor\logical\not.hpp"'
count: 5
- file: '"boost\preprocessor\list\fold_left.hpp"'
count: 5
- file: '"boost\multi_index\detail\ignore_wstrict_aliasing.hpp"'
count: 5
- file: '"boost\preprocessor\control\deduce_d.hpp"'
count: 5
- file: '"boost\preprocessor\array\push_back.hpp"'
count: 5
- file: '"boost\preprocessor\seq\rest_n.hpp"'
count: 5
- file: '"boost\preprocessor\tuple\to_list.hpp"'
count: 5
- file: '"boost\preprocessor\iteration\local.hpp"'
count: 5
- file: '"boost\mpl\quote.hpp"'
count: 5
- file: '"boost\mpl\aux_\arithmetic_op.hpp"'
count: 5
- file: '"boost\preprocessor\repeat.hpp"'
count: 5
- file: '"boost\preprocessor\comma_if.hpp"'
count: 5
- file: '"boost\preprocessor\repetition\enum_params_with_a_default.hpp"'
count: 5
- file: '"boost\smart_ptr\detail\operator_bool.hpp"'
count: 5
- file: '"boost\preprocessor\punctuation\is_begin_parens.hpp"'
count: 4
- file: '"boost\preprocessor\punctuation\paren.hpp"'
count: 4
- file: '"boost\preprocessor\seq\elem.hpp"'
count: 4
- file: '"boost\fusion\container\vector\vector_iterator.hpp"'
count: 4
- file: '"boost\preprocessor\list\for_each_i.hpp"'
count: 4
- file: '"boost\config\auto_link.hpp"'
count: 4
- file: '"boost\mpl\aux_\integral_wrapper.hpp"'
count: 4
- file: '"boost\function_types\components.hpp"'
count: 4
- file: '"boost\preprocessor\logical\and.hpp"'
count: 4
- file: '"boost\preprocessor\logical\bitor.hpp"'
count: 4
- file: '"boost\predef\compiler\clang.h"'
count: 4
- file: '"boost\multi_index\detail\restore_wstrict_aliasing.hpp"'
count: 4
- file: '"boost\preprocessor\seq\to_tuple.hpp"'
count: 3
- file: '"boost\predef\os\ios.h"'
count: 3
- file: '"boost\preprocessor\seq\push_back.hpp"'
count: 3
- file: '"boost\predef\os\macos.h"'
count: 3
- file: '"boost\preprocessor\tuple\reverse.hpp"'
count: 3
- file: '"boost\preprocessor\facilities\is_empty.hpp"'
count: 3
- file: '"boost\functional\hash_fwd.hpp"'
count: 3
- file: '"boost\preprocessor\arithmetic\detail\is_minimum_number.hpp"'
count: 3
- file: '"boost\mpl\inherit.hpp"'
count: 3
- file: '"boost\preprocessor\repetition\enum_trailing.hpp"'
count: 3
- file: '"boost\preprocessor\seq\detail\is_empty.hpp"'
count: 3
- file: '"boost\preprocessor\selection\max.hpp"'
count: 3
- file: '"boost\preprocessor\arithmetic\detail\is_1_number.hpp"'
count: 3
- file: '"boost\multi_index\detail\define_if_constexpr_macro.hpp"'
count: 3
- file: '"boost\preprocessor\arithmetic\detail\is_maximum_number.hpp"'
count: 3
- file: '"boost\preprocessor\slot\slot.hpp"'
count: 3
- file: '"boost\preprocessor\list\reverse.hpp"'
count: 3
- file: '"boost\preprocessor\repetition\deduce_z.hpp"'
count: 3
- file: '"boost\preprocessor\tuple\to_seq.hpp"'
count: 3
- file: '"boost\function_types\detail\pp_loop.hpp"'
count: 3
- file: '"boost\preprocessor\detail\check.hpp"'
count: 3
- file: '"boost\mpl\vector\aux_\include_preprocessed.hpp"'
count: 3
- file: '"boost\preprocessor\repetition\enum_shifted_params.hpp"'
count: 3
- file: '"boost\predef\architecture\x86.h"'
count: 3
- file: '"boost\mpl\aux_\numeric_op.hpp"'
count: 2
- file: '"boost\preprocessor\list\rest_n.hpp"'
count: 2
- file: '"boost\preprocessor\list\to_tuple.hpp"'
count: 2
- file: '"boost\move\detail\std_ns_end.hpp"'
count: 2
- file: '"boost\preprocessor\seq\detail\split.hpp"'
count: 2
- file: '"boost\function.hpp"'
count: 2
- file: '"boost\preprocessor\repetition\enum_shifted.hpp"'
count: 2
- file: '"boost\preprocessor\facilities\check_empty.hpp"'
count: 2
- file: '"boost\predef\platform.h"'
count: 2
- file: '"boost\predef.h"'
count: 2
- file: '"boost\preprocessor\tuple\enum.hpp"'
count: 2
- file: '"boost\preprocessor\detail\is_unary.hpp"'
count: 2
- file: '"boost\preprocessor\list\for_each.hpp"'
count: 2
- file: '"boost\multi_index\detail\undef_if_constexpr_macro.hpp"'
count: 2
- file: '"boost\predef\platform\windows_store.h"'
count: 2
- file: '"boost\preprocessor\seq\transform.hpp"'
count: 2
- file: '"boost\type_traits\detail\has_postfix_operator.hpp"'
count: 2
- file: '"boost\preprocessor\array\pop_back.hpp"'
count: 2
- file: '"boost\preprocessor\array\insert.hpp"'
count: 2
- file: '"boost\preprocessor\array\remove.hpp"'
count: 2
- file: '"boost\preprocessor\repetition\deduce_r.hpp"'
count: 2
- file: '"boost\preprocessor\slot\detail\shared.hpp"'
count: 2
- file: '"boost\mpl\bind_fwd.hpp"'
count: 2
- file: '"boost\preprocessor\seq\cat.hpp"'
count: 2
- file: '"boost\predef\architecture.h"'
count: 2
- file: '"boost\preprocessor\array\detail\get_data.hpp"'
count: 2
- file: '"boost\predef\platform\android.h"'
count: 2
- file: '"boost\preprocessor\logical\bitnor.hpp"'
count: 2
- file: '"boost\preprocessor\array\pop_front.hpp"'
count: 2
- file: '"boost\preprocessor\array\push_front.hpp"'
count: 2
- file: '"boost\move\detail\std_ns_begin.hpp"'
count: 2
- file: '"boost\preprocessor\detail\is_binary.hpp"'
count: 2
- file: '"boost\predef\library\c\gnu.h"'
count: 2
- file: '"boost\preprocessor\seq\reverse.hpp"'
count: 2
- file: '"boost\preprocessor\seq\push_front.hpp"'
count: 2
- file: '"boost\preprocessor\arithmetic\detail\div_base.hpp"'
count: 2
- file: '"boost\preprocessor\list\enum.hpp"'
count: 2
- file: '"boost\preprocessor\logical\bitxor.hpp"'
count: 2
- file: '"boost\preprocessor\seq\pop_back.hpp"'
count: 2
- file: '"boost\preprocessor\variadic\to_seq.hpp"'
count: 2
- file: '"boost\preprocessor\detail\split.hpp"'
count: 2
- file: '"boost\preprocessor\variadic\elem.hpp"'
count: 2
- file: '"boost\preprocessor\comparison\less.hpp"'
count: 2
- file: '"boost\preprocessor\tuple\detail\is_single_return.hpp"'
count: 2
- file: '"boost\preprocessor\array\replace.hpp"'
count: 2
- file: '"boost\preprocessor\arithmetic\mod.hpp"'
count: 2
- file: '"boost\mpl\map\aux_\include_preprocessed.hpp"'
count: 2
- file: '"boost\graph\write_dimacs.hpp"'
count: 2
- file: '"libs\graph\test\graph_type.hpp"'
count: 2
- file: '"boost\predef\platform\windows_phone.h"'
count: 2
- file: '"boost\fusion\iterator\segmented_iterator.hpp"'
count: 2
- file: '"boost\function\function0.hpp"'
count: 2
# These are components that have a header file that is not included
# by any other component and may be a candidate for removal.
unreferenced components:
time taken: 0.001 # seconds
results:
- source: '"libs\graph\test\metric_tsp_approx.cpp"'
saving: 0.54 # (%)
- source: '"libs\graph\example\fibonacci_heap.cpp"'
saving: 0.37 # (%)
- source: '"libs\graph\example\sloan_ordering.cpp"'
saving: 0.35 # (%)
- source: '"libs\graph\example\edge_connectivity.cpp"'
saving: 0.34 # (%)
- source: '"libs\graph\test\sequential_vertex_coloring.cpp"'
saving: 0.32 # (%)
- source: '"libs\graph\example\edge_coloring.cpp"'
saving: 0.32 # (%)
- source: '"libs\graph\example\iohb.c"'
saving: 0.02 # (%)
# This is a list of the most costly #include directives.
include directives:
time: 4.39 # seconds
results:
- directive: '#include <boost/graph/named_graph.hpp>'
file: '"adjacency_list.hpp"'
line: 36
saving: 6.11 # (%)
- directive: '#include <boost/xpressive/xpressive_static.hpp>'
file: '"graphviz.hpp"'
line: 35
saving: 2.77 # (%)
- directive: '#include <boost/multi_index/hashed_index.hpp>'
file: '"named_graph.hpp"'
line: 18
saving: 1.94 # (%)
- directive: '#include <boost/unordered_map.hpp>'
file: '"container_traits.hpp"'
line: 24
saving: 1.75 # (%)
- directive: '#include <boost/multi_index_container.hpp>'
file: '"named_graph.hpp"'
line: 20
saving: 1.47 # (%)
- directive: '#include <boost/graph/adjacency_list.hpp>'
file: '"undirected_graph.hpp"'
line: 10
saving: 1.27 # (%)
# This is a list of all header files that should be considered
# to not be included by other header files, but source files only
make private:
time: 4.24 # seconds
results:
- file: <intrin.h>
reference count: 3
saving: 9.74 # (%)
- file: '"boost\graph\named_graph.hpp"'
reference count: 1
saving: 6.09 # (%)
- file: '"boost\pending\container_traits.hpp"'
reference count: 4
saving: 3.82 # (%)
- file: '"boost\graph\detail\adjacency_list.hpp"'
reference count: 1
saving: 2.97 # (%)
- file: '"boost\unordered\detail\implementation.hpp"'
reference count: 2
saving: 2.71 # (%)
- file: '"boost\xpressive\xpressive_static.hpp"'
reference count: 1
saving: 2.68 # (%)
- file: '"boost\type_traits.hpp"'
reference count: 13
saving: 2.59 # (%)
- file: <complex>
reference count: 4
saving: 2.31 # (%)
- file: '"boost\unordered\unordered_map.hpp"'
reference count: 1
saving: 1.78 # (%)
- file: '"boost\multi_index\hashed_index.hpp"'
reference count: 1
saving: 1.64 # (%)
- file: '"boost\mp11\algorithm.hpp"'
reference count: 6
saving: 1.63 # (%)
- file: '"boost\unordered_map.hpp"'
reference count: 2
saving: 1.53 # (%)
- file: '"boost\unordered\unordered_set.hpp"'
reference count: 1
saving: 1.38 # (%)
- file: '"boost\mpl\boost\mpl\vector\vector20.hpp"'
reference count: 2
saving: 1.20 # (%)
- file: '"boost\graph\adjacency_list.hpp"'
reference count: 16
saving: 1.20 # (%)
# This is a list of all header files that should be considered
# to be added to the precompiled header:
pch additions:
time: 0.52 # seconds
results:
- file: <random>
saving: 28.19 # (%)
- file: <complex>
saving: 28.06 # (%)
- file: <sstream>
saving: 26.11 # (%)
- file: <iomanip>
saving: 25.62 # (%)
- file: <fstream>
saving: 25.49 # (%)
- file: <iostream>
saving: 25.25 # (%)
- file: <istream>
saving: 25.24 # (%)
- file: <ostream>
saving: 24.62 # (%)
- file: <locale>
saving: 24.16 # (%)
- file: <ios>
saving: 23.90 # (%)
- file: <streambuf>
saving: 21.02 # (%)
- file: <unordered_map>
saving: 20.67 # (%)
- file: <unordered_set>
saving: 20.52 # (%)
- file: <mutex>
saving: 18.96 # (%)
- file: <system_error>
saving: 16.41 # (%)
- file: <queue>
saving: 16.20 # (%)
- file: <string>
saving: 14.79 # (%)
- file: <stdexcept>
saving: 14.34 # (%)
- file: <bitset>
saving: 14.32 # (%)
- file: <map>
saving: 13.87 # (%)
- file: <algorithm>
saving: 13.67 # (%)
- file: <vector>
saving: 13.38 # (%)
- file: <functional>
saving: 13.37 # (%)
- file: <memory>
saving: 13.30 # (%)
- file: <set>
saving: 12.86 # (%)
- file: <list>
saving: 12.42 # (%)
- file: <stack>
saving: 11.97 # (%)
- file: <deque>
saving: 11.94 # (%)
- file: <intrin.h>
saving: 10.02 # (%)
- file: <iterator>
saving: 9.93 # (%)
- file: <tuple>
saving: 7.35 # (%)
- file: <array>
saving: 6.60 # (%)
- file: <numeric>
saving: 6.54 # (%)
- file: <atomic>
saving: 6.05 # (%)
- file: <limits>
saving: 5.52 # (%)
- file: <iosfwd>
saving: 5.21 # (%)
- file: <utility>
saving: 4.01 # (%)
- file: <typeindex>
saving: 3.93 # (%)
- file: <typeinfo>
saving: 3.89 # (%)
- file: <new>
saving: 3.83 # (%)
- file: <exception>
saving: 3.83 # (%)
- file: <type_traits>
saving: 3.51 # (%)
- file: <cwchar>
saving: 3.23 # (%)
- file: <cmath>
saving: 2.43 # (%)
- file: <wchar.h>
saving: 2.14 # (%)
- file: <cstdio>
saving: 2.11 # (%)
- file: <stdio.h>
saving: 2.09 # (%)
- file: <cstdlib>
saving: 1.32 # (%)
# This is a list of all comparatively large files that
# should be considered to be simplified or split into
# smaller parts and #includes updated:
large files:
assumed reduction: 50.00 # (%)
time: 0.05 # seconds
results: []
# This is a list of all source files that should be considered
# to be inlined into the header and then the source file removed:
inline sources:
time: 0.08 # seconds
results: []
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment