boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-31 20:22:09 +00:00
Code Issues Projects Releases Wiki Activity

VC++ fixes

Browse Source 
[SVN r7786]
This commit is contained in:
Jeremy Siek
2000-09-24 00:41:40 +00:00
parent 7551468610
commit 7aa653d605
3 changed files with 135 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
docs/known_problems.html Normal file
View File

@@ -0,0 +1,44 @@
<HTML>
<!--
-- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
--
-- Permission to use, copy, modify, distribute and sell this software
-- and its documentation for any purpose is hereby granted without fee,
-- provided that the above copyright notice appears in all copies and
-- that both that copyright notice and this permission notice appear
-- in supporting documentation. We make no
-- representations about the suitability of this software for any
-- purpose. It is provided "as is" without express or implied warranty.
-->
<Head>
<Title>Known Problems</Title>
<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
ALINK="#ff0000">
<IMG SRC="../../../c++boost.gif"
ALT="C++ Boost">
<BR Clear>
<h1>Known Problems</h1>
<ol>
<li>Visual C++ internal compiler error in adjacency_list.cpp and edge_plugin.cpp</li>
</ol>
<br>
<HR>
<TABLE>
<TR valign=top>
<TD nowrap>Copyright &copy 2000</TD><TD>
<A HREF=http://www.boost.org/people/jeremy_siek.htm>Jeremy Siek</A>,
Univ.of Notre Dame (<A
HREF="mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</A>)<br>
<A HREF=http://www.lsc.nd.edu/~llee1>Lie-Quan Lee</A>, Univ.of Notre Dame (<A HREF="mailto:llee1@lsc.nd.edu">llee1@lsc.nd.edu</A>)<br>
<A HREF=http://www.lsc.nd.edu/~lums>Andrew Lumsdaine</A>,
Univ.of Notre Dame (<A
HREF="mailto:lums@lsc.nd.edu">lums@lsc.nd.edu</A>)
</TD></TR></TABLE>
</BODY>
</HTML>

47
docs/trouble_shooting.html Normal file
View File

@@ -0,0 +1,47 @@
<HTML>
<!--
-- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
--
-- Permission to use, copy, modify, distribute and sell this software
-- and its documentation for any purpose is hereby granted without fee,
-- provided that the above copyright notice appears in all copies and
-- that both that copyright notice and this permission notice appear
-- in supporting documentation. We make no
-- representations about the suitability of this software for any
-- purpose. It is provided "as is" without express or implied warranty.
-->
<Head>
<Title>Boost Graph Library: Trouble Shooting</Title>
<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
ALINK="#ff0000">
<IMG SRC="../../../c++boost.gif"
ALT="C++ Boost">
<BR Clear>
<h1>Trouble Shooting</h1>
<pre>
error C2784: 'T __cdecl source(struct std::pair<T,T>,const G &)' : could not deduce template argument for 'struct std::pair<_T1,_T1>' from 'class boost::detail::bidir_edge<struct boost::bidirectional_tag,unsigned int>'
</pre>
VC++ does not support Koenig Lookup, therefore you need to refer to functions defined in the boost namespace
using the <tt>boost::</tt> prefix, i.e., <tt>boost::source(e, g)</tt> instead of <tt>source(e, g)</tt>.
<br>
<HR>
<TABLE>
<TR valign=top>
<TD nowrap>Copyright &copy 2000</TD><TD>
<A HREF=http://www.boost.org/people/jeremy_siek.htm>Jeremy Siek</A>,
Univ.of Notre Dame (<A
HREF="mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</A>)<br>
<A HREF=http://www.lsc.nd.edu/~llee1>Lie-Quan Lee</A>, Univ.of Notre Dame (<A HREF="mailto:llee1@lsc.nd.edu">llee1@lsc.nd.edu</A>)<br>
<A HREF=http://www.lsc.nd.edu/~lums>Andrew Lumsdaine</A>,
Univ.of Notre Dame (<A
HREF="mailto:lums@lsc.nd.edu">lums@lsc.nd.edu</A>)
</TD></TR></TABLE>
</BODY>
</HTML>

55
include/boost/graph/detail/adjacency_list.hpp
View File

@@ -41,6 +41,9 @@
// REVISION HISTORY:
//
// $Log$
// Revision 1.12 2000/09/24 00:41:39 jsiek
// VC++ fixes
//
// Revision 1.11 2000/09/22 07:11:07 jsiek
// reorganized graph/detail/adjacency_list.hpp to handle g++
// inline friend in namespace bug and VC++ no Koenig lookup
@@ -439,9 +442,10 @@ namespace boost {
typename Config::vertex_descriptor v)
{
typedef typename Config::graph_type graph_type;
typedef typename Config::StoredEdge StoredEdge;
graph_type& g = static_cast<graph_type&>(g_);
typename Config::OutEdgeList& el = g.out_edge_list(u);
boost::erase(el, typename Config::StoredEdge(v));
boost::erase(el, StoredEdge(v));
}
// O(V + E) for allow_parallel_edges
@@ -452,10 +456,11 @@ namespace boost {
typename Config::vertex_descriptor u)
{
typedef typename Config::graph_type graph_type;
typedef typename Config::StoredEdge StoredEdge;
graph_type& g = static_cast<graph_type&>(g_);
typename Config::vertex_iterator vi, viend;
for (boost::tie(vi, viend) = vertices(g); vi != viend; ++vi)
boost::erase(g.out_edge_list(*vi), typename Config::StoredEdge(u));
boost::erase(g.out_edge_list(*vi), StoredEdge(u));
g.out_edge_list(u).clear();
// clear() should be a req of Sequence and AssociativeContainer,
// or maybe just Container
@@ -481,20 +486,30 @@ namespace boost {
add_edge(directed_graph_helper<Config>& g_,
typename Config::vertex_descriptor u,
typename Config::vertex_descriptor v,
const typename Config::edge_plugin_type& p
= typename Config::edge_plugin_type())
const typename Config::edge_plugin_type& p)
{
typedef typename Config::edge_descriptor edge_descriptor;
typedef typename Config::graph_type graph_type;
typedef typename Config::StoredEdge StoredEdge;
graph_type& g = static_cast<graph_type&>(g_);
typename Config::OutEdgeList::iterator i;
bool inserted;
boost::tie(i, inserted) = boost::push(g.out_edge_list(u),
typename Config::StoredEdge(v, p));
StoredEdge(v, p));
return std::make_pair(edge_descriptor(u, v, (*i).get_plugin()),
inserted);
}
// Did not use default argument here because that
// causes Visual C++ to get confused.
template <class Config>
inline std::pair<typename Config::edge_descriptor, bool>
add_edge(directed_graph_helper<Config>& g_,
typename Config::vertex_descriptor u,
typename Config::vertex_descriptor v)
{
typename Config::edge_plugin_type p;
return add_edge(g_, u, v, p);
}
//=========================================================================
// Undirected Graph Helper Class
@@ -612,6 +627,15 @@ namespace boost {
}
return std::make_pair(edge_descriptor(u,v), false);
}
template <class Config>
inline std::pair<typename Config::edge_descriptor, bool>
add_edge(undirected_graph_helper<Config>& g_,
typename Config::vertex_descriptor u,
typename Config::vertex_descriptor v)
{
typename Config::edge_plugin_type p;
return add_edge(g_, u, v, p);
}
// O(1)
template <class Config>
inline typename Config::degree_size_type
@@ -721,8 +745,7 @@ namespace boost {
add_edge(bidirectional_graph_helper_with_plugin<Config>& g_,
typename Config::vertex_descriptor u,
typename Config::vertex_descriptor v,
const typename Config::edge_plugin_type& p
= typename Config::edge_plugin_type())
const typename Config::edge_plugin_type& p)
{
typedef typename Config::graph_type graph_type;
graph_type& g = static_cast<graph_type&>(g_);
@@ -744,6 +767,15 @@ namespace boost {
return std::make_pair(edge_descriptor(u,v), false);
}
}
template <class Config>
inline std::pair<typename Config::edge_descriptor, bool>
add_edge(bidirectional_graph_helper_with_plugin<Config>& g_,
typename Config::vertex_descriptor u,
typename Config::vertex_descriptor v)
{
typename Config::edge_plugin_type p;
return add_edge(g_, u, v, p);
}
// O(1)
template <class Config>
inline typename Config::degree_size_type
@@ -968,9 +1000,9 @@ namespace boost {
const adj_list_helper<Config, Base>& g_)
{
typedef typename Config::graph_type Graph;
typedef typename Config::edge_parallel_category Cat;
const Graph& g = static_cast<const Graph&>(g_);
return g_.edge_dispatch(g, u, v,
typename Config::edge_parallel_category());
return g_.edge_dispatch(g, u, v, Cat());
}
template <class Config, class Base>
inline std::pair<typename Config::in_edge_iterator,
@@ -1294,8 +1326,9 @@ namespace boost {
template <class Graph, class Config, class Base>
inline void remove_vertex(vec_adj_list_impl<Graph, Config, Base>& g_,
typename Config::vertex_descriptor v) {
typedef typename Config::directed_category Cat;
Graph& g = static_cast<Graph&>(g_);
remove_vertex_dispatch(g, v, typename Config::directed_category());
remove_vertex_dispatch(g, v, Cat());
}
// O(1)
template <class Graph, class Config, class Base>