/* 
 * File:   container_traits_issue.cpp
 * Author: erdem
 *
 * Created on September 8, 2016, 3:09 PM
 */

#include <deque>

#include <boost/pending/container_traits.hpp>

namespace boost {
  // If contents of the graph_details namespace below are put inside 
  // boost/pending/graph_traits.hpp, compile succeeds,
  namespace graph_detail 
  {
    struct deque_tag :
      virtual public random_access_container_tag,
      virtual public back_insertion_sequence_tag { };

    template <class T, class Alloc>
    deque_tag container_category(const std::deque<T,Alloc>&) { 
      return deque_tag(); 
    }

    template <class T, class Alloc>
    unstable_tag iterator_stability(const std::deque<T,Alloc>&) { 
      return unstable_tag(); 
    }

    template <class T, class Alloc>
    struct container_traits< std::deque<T,Alloc> > {
      typedef deque_tag category;
      typedef unstable_tag iterator_stability;
    };
    
  } //ns: graph_detail
} // ns: boost

#include <boost/graph/adjacency_list.hpp>

namespace boost {
  struct dequeS;
  
  template <class T>
  struct container_gen<dequeS, T> {
    typedef std::deque<T> type;
  };
  
  template <>
  struct parallel_edge_traits<dequeS> { 
    typedef allow_parallel_edge_tag type;
  };
  
  namespace detail {
    template <>
    struct is_random_access<dequeS> {
      enum { value = true };
      typedef mpl::true_ type;
    };
  }    
}

int main(int argc, char** argv) {
  using namespace boost;
  typedef adjacency_list<dequeS, dequeS, undirectedS> graph_t;
  graph_t g(2);
  boost::add_edge(0ul, 1ul, g);
  return 0;
}