[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [creduce-dev] unifdef

Sure, here is an example that comes with Boost::graph 1.59. Clang compiles this cleanly as provided but if you add one include at the first line you'll get mysterious template errors starting with:

>clang++ -std=c++11 -fsyntax-only incremental_components.cpp
In file included from incremental_components.cpp:17:
In file included from boost/graph/incremental_components.hpp:20:
In file included from boost/pending/disjoint_sets.hpp:16:
boost/pending/detail/disjoint_sets.hpp:59:7: error: no matching function for call to 'get'
  if (get(rank, i) > get(rank, j))

Moving the include after all other includes compiles OK again.
OTOH, g++ 4.9.3 accepts this code with the include in *either* location. 
If creduce can handle such code automatically it would be really great as manually+creducing such examples is no fun.
I'd like to see the final result...

2015-10-31 22:17 GMT+02:00 John Regehr <regehr@cs.utah.edu>:
Yaron, thanks for sharing!  I think you are describing a more difficult reduction than any I have attempted.

First, every interestingness test was slow to compile, about 10s.


Second, Boost-using code and Boost-headers usually include many more
includes than actually required for a specific example. We are talking
about very large preprocessed files. Preprocessing the Boost::log
example sinks_async.cpp results in 8.7MB file on my system. Once
preprocessed they are not quickly reduced and it's much more efficient
to  reduce one #include line rather than reducing the resulting huge
preprocessed code - which may not be needed at all.

Ok, this makes sense.

Finally, the Boost usage of templates, inheritance and macros (with
non-preprocessed code) is very (too?) complex to automatically reduce
and required manual help anyhow. Helping the reduce process is feasible
only while the source is still human-readable and small.

Got it.

With the Boost::log example I used creduce mostly for deleting the
includes, most of them were *not* required at every include depth, then
manually copying the remaining include files text into the main include,
in part or in whole (judgement call). It took about a day work to reduce
this example.

Well that isn't very much fun.  It would be nice for C-Reduce to be able to automate more of this-- can you point me at some test cases?  I can probably make some time to work on this.


// Adding this include results in error: no matching function for call to 'get'.
#include <boost/graph/reverse_graph.hpp>

// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
// Copyright 2009 Trustees of Indiana University.
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek, Michael Hansen
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <iostream>
#include <vector>

#include <boost/foreach.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graph_utility.hpp>
#include <boost/graph/incremental_components.hpp>
#include <boost/pending/disjoint_sets.hpp>


  This example shows how to use the disjoint set data structure
  to compute the connected components of an undirected, changing

  Sample output:

  An undirected graph:
  0 <--> 1 4 
  1 <--> 0 4 
  2 <--> 5 
  3 <--> 
  4 <--> 1 0 
  5 <--> 2 

  representative[0] = 1
  representative[1] = 1
  representative[2] = 5
  representative[3] = 3
  representative[4] = 1
  representative[5] = 5

  component 0 contains: 4 1 0 
  component 1 contains: 3 
  component 2 contains: 5 2 


using namespace boost;

int main(int argc, char* argv[]) 
  typedef adjacency_list <vecS, vecS, undirectedS> Graph;
  typedef graph_traits<Graph>::vertex_descriptor Vertex;
  typedef graph_traits<Graph>::vertices_size_type VertexIndex;

  const int VERTEX_COUNT = 6;
  Graph graph(VERTEX_COUNT);

  std::vector<VertexIndex> rank(num_vertices(graph));
  std::vector<Vertex> parent(num_vertices(graph));

  typedef VertexIndex* Rank;
  typedef Vertex* Parent;

  disjoint_sets<Rank, Parent> ds(&rank[0], &parent[0]);

  initialize_incremental_components(graph, ds);
  incremental_components(graph, ds);

  graph_traits<Graph>::edge_descriptor edge;
  bool flag;

  boost::tie(edge, flag) = add_edge(0, 1, graph);

  boost::tie(edge, flag) = add_edge(1, 4, graph);

  boost::tie(edge, flag) = add_edge(4, 0, graph);

  boost::tie(edge, flag) = add_edge(2, 5, graph);
  std::cout << "An undirected graph:" << std::endl;
  print_graph(graph, get(boost::vertex_index, graph));
  std::cout << std::endl;
  BOOST_FOREACH(Vertex current_vertex, vertices(graph)) {
    std::cout << "representative[" << current_vertex << "] = " <<
      ds.find_set(current_vertex) << std::endl;

  std::cout << std::endl;

  typedef component_index<VertexIndex> Components;

  // NOTE: Because we're using vecS for the graph type, we're
  // effectively using identity_property_map for a vertex index map.
  // If we were to use listS instead, the index map would need to be
  // explicitly passed to the component_index constructor.
  Components components(parent.begin(), parent.end());

  // Iterate through the component indices
  BOOST_FOREACH(VertexIndex current_index, components) {
    std::cout << "component " << current_index << " contains: ";

    // Iterate through the child vertex indices for [current_index]
    BOOST_FOREACH(VertexIndex child_index,
                  components[current_index]) {
      std::cout << child_index << " ";

    std::cout << std::endl;

  return (0);