ceph/src/boost/libs/graph/doc/trouble_shooting.html

   1 <HTML>
   2 <!--
   3      Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
   4
   5      Distributed under the Boost Software License, Version 1.0.
   6      (See accompanying file LICENSE_1_0.txt or copy at
   7      http://www.boost.org/LICENSE_1_0.txt)
   8   -->
   9 <Head>
  10 <Title>Boost Graph Library: Trouble Shooting</Title>
  11 <BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
  12         ALINK="#ff0000">
  13 <IMG SRC="../../../boost.png"
  14      ALT="C++ Boost" width="277" height="86">
  15
  16 <BR Clear>
  17
  18     <h1>Trouble Shooting</h1>
  19
  20 <hr>
  21
  22 With GNU C++, if you see the following error message:
  23 <pre>
  24 boost/type_traits/arithmetic_traits.hpp:243: template instantiation depth exceeds maximum of 17
  25 boost/type_traits/arithmetic_traits.hpp:243:  (use -ftemplate-depth-NN to increase the maximum)
  26 </pre>
  27 then you need to do as the error message advises and increase the
  28 template instantiation depth. Passing the flag
  29 <tt>-ftemplate-depth-30</tt> to g++ usually does the trick.
  30
  31
  32 <hr>
  33 <pre>
  34 error C2784: 'T __cdecl source(struct std::pair<T,T>,const G &)' :
  35 could not deduce template argument for 'struct std::pair<_T1,_T1>' from
  36  'class boost::detail::bidir_edge<struct boost::bidirectional_tag,unsigned int>'
  37 </pre>
  38
  39 <p>
  40 VC++ does not support Koenig Lookup, therefore you need to refer to functions defined in the boost namespace
  41 using the <tt>boost::</tt> prefix, i.e., <tt>boost::source(e, g)</tt> instead of <tt>source(e, g)</tt>.
  42
  43 <hr>
  44 <pre>
  45 ../../..\boost/property_map.hpp(283) : error C2678: binary '[' : no operator defined
  46  which takes a left-hand operand of type 'const struct boost::adj_list_edge_property_map<struct
  47  boost::bidirectional_tag,struct boost::property<enum boost::edge_weight_t,int,struct
  48  boost::no_property>,unsigned int,enum boost::edge_weight_t>' (or there is no acceptable conversion)
  49 </pre>
  50
  51 <p>There is a VC++ bug that appears when using <tt>get(property,
  52 graph, edge)</tt>. A workaround is to use <tt>get(get(property,
  53 graph), edge)</tt> instead. <i>Note that <tt>boost/property_map.hpp</tt> has
  54 now been moved to <tt>boost/property_map/property_map.hpp</tt>.
  55
  56 <hr>
  57
  58 <pre>
  59 C:\Program Files\Microsoft Visual Studio\VC98\INCLUDE\xmemory(59) : fatal
  60 error C1001: INTERNAL COMPILER ERROR
  61         (compiler file 'msc1.cpp', line 1786)
  62 </pre>
  63
  64 <p>There can be many reasons for this error, but sometimes it is
  65 caused by using the flag <tt>/Gm</tt> (minimal rebuild). As this flag
  66 is not really necessary, it is a good idea to turn it off.
  67
  68 <p>
  69 Another reason for the error can be the use of the named-parameter
  70 interface for many of the BGL algorithms. Try using the non
  71 named-parameter version of the algorithm instead (see the HTML docs
  72 for the algorithm in question).
  73
  74 <p>
  75 Yet another reason can be the use of the <tt>get()</tt> function of
  76 the <a href"PropertyGraph.html">PropertyGraph</a> interface. Instead
  77 of using the <tt>get()</tt> function in a complex expression, always
  78 declare a property map variable first:
  79 <pre>
  80 property_map&lt;graph_t, edge_weight_t&gt;::type w_map = get(edge_weight, g);
  81 // use w_map ...
  82 </pre>
  83
  84 <hr>
  85
  86 <pre>
  87 V:\3rdPARTY\SXL\INCLUDE\xlocnum(309) : error C2587: '_U' : illegal
  88  use of local variable as default parameter
  89 </pre>
  90 <p>
  91 Workaround from Andreas Scherer:<br>
  92 That's the usual problem with MSVC-- 6.0 sp[34] when compiling some
  93 (or all?) of the BGL examples.  You can't use the DLL version of the
  94 run-time system.  I succeeded in compiling file_dependencies.cpp after
  95 switching to ``[Debug] Multithreaded'' (section ``Code Generation'' on
  96 page ``C/C++'' in the ``Project Settings'').
  97
  98 <p>
  99 Another reason for this error is when the iterator constructor of an
 100 <tt>adjacency_list</tt> is used. The workaround is to use
 101 <tt>add_edge()</tt> instead. Replace something like this:
 102 <pre>
 103 Graph g(edge_array, edge_array + n_edges, N);
 104 </pre>
 105 with something like this:
 106 <pre>
 107 Graph g(N);
 108 for (std::size_t j = 0; j < n_edges; ++j)
 109   add_edge(edge_array[j].first, edge_array[j].second, g);
 110 </pre>
 111
 112 <hr>
 113
 114 <br>
 115 <HR>
 116 <TABLE>
 117 <TR valign=top>
 118 <TD nowrap>Copyright &copy; 2000-2001</TD><TD>
 119 <A HREF="http://www.boost.org/people/jeremy_siek.htm">Jeremy Siek</A>,
 120 Indiana University (<A
 121 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 122 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
 123 <A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 124 Indiana University (<A
 125 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 126 </TD></TR></TABLE>
 127
 128 </BODY>
 129 </HTML>