- Boost-users - lists.preview.boost.org

Re: [Boost-users] [BGL] there is no in_edges() function for adjacency_matrix<>
by Dmitry Bufistov 07 Feb '06

07 Feb '06

> > >--- Dmitry Bufistov wrote: > > >>But what about >>boost::adjacency_matrix<boost::directedS>? >> >> > >No, that too has to be >boost::adjacency_matrix<boost::bidirectionalS>. > > Unfortunately this doesn't help( > > > >>Where I can read your answer before I recieve >>e-mail? >> >> > >Try <http://lists.boost.org/Archives/boost-users/> > > > I can see my post's here http://lists.boost.org/boost-users/2006/02/date.php but I can't reply on them( > Cheers! > Cromwell D. Enage > Thanks for the reply. 2 Doug, Now I also can't use template <typename MutableGraph> bool read_graphviz(std::istream& in, MutableGraph& graph, dynamic_properties& dp, std::string const& node_id = "node_id") ; function for the same type. I think because of following declaractions in "adjacency_matrix.hpp" ////////////////////////////////////////////////// template <typename D, typename VP, typename EP, typename GP, typename A> inline typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor add_vertex(adjacency_matrix<D,VP,EP,GP,A>& g) { // UNDER CONSTRUCTION assert(false); return *vertices(g).first; } template <typename D, typename VP, typename EP, typename GP, typename A> inline typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor add_vertex(const VP& vp, adjacency_matrix<D,VP,EP,GP,A>& g) { // UNDER CONSTRUCTION assert(false); return *vertices(g).first; } template <typename D, typename VP, typename EP, typename GP, typename A> inline void remove_vertex(typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor u, adjacency_matrix<D,VP,EP,GP,A>& g) { // UNDER CONSTRUCTION assert(false); } //////////////////////////////////////////////////////////// Will it be also implemented or how I can read my graph? Many thanks for the reply, --dima

2 1

[filesystem] Other reasons for directory_iterator to crash?
by Paul Giaccone 07 Feb '06

07 Feb '06

I am iterating over the subdirectories in a directory. The code I have for this has always worked up until now, but now it is crashing when I create the iterator (ask "What did you change?" if you like; the answer is "If I knew that..."). My question is: what can cause the creation of an iterator to crash? Looking at the documentation, directory_iterator(my_path) throws if !exists(my_path), which is fair enough. This check is already in my code, however, and does not report that the path does not exist. Here is a (revised) segment of my code: const char* source_directory = getenv(MYENVVAR); if ((source_directory == NULL) || (source_directory[0] == '\0')) { return false; } boost::filesystem::path dir_path(source_directory, boost::filesystem::native); boost::filesystem::directory_iterator end_iterator; if (!exists(dir_path)) { return false; } boost::filesystem::directory_iterator dir_iterator(dir_path); //CRASH while (dir_iterator != end_iterator) { //do whatever I do here dir_iterator++; } The program crashes where indicated. The path exists. I've tried replacing the const char* at the beginning with a std::string (then using .c_str() where appropriate) but this makes no difference. So, apart from the path not existing, how else can directory_iterator(dir_path) cause an error? Incidental info: This works fine in Windows (albeit with a different path); this code builds a shared object for use in Shake, meaning I can't use gdb; I am working with gcc 3.2.3 and Boost 1.33.1. Paul

1 1

Cross compiling
by David Charles Todd 07 Feb '06

07 Feb '06

We're using boost, and I'm tasked with getting it working on an embedded board, via BlueCat linux. The BlueCat envorinment is its own little world, meant to make it exceptionally easy to build things for the target. Because of this, they violate a few expectations for a cross-compile environment. One of these is that their compiler looks for headers in the wrong place for boost. What I am trying to figure out is how to tell the boost build process to append a path onto the list of include search paths. setting HDRS, either in the environment or on the bjam invocation line doesn't seem to help. I guess it's not propagating down? Thanks in advance for your advice.

3 2

Re: [Boost-users] stopping a boost::thread
by Frank Hess 07 Feb '06

07 Feb '06

On Monday 06 February 2006 04:37 pm, boost-users-request(a)lists.boost.org wrote: > Date: Mon, 6 Feb 2006 20:28:49 +0000 (UTC) > From: xargon <pankaj.daga(a)gmail.com> > Subject: [Boost-users] stopping a boost::thread > To: boost-users(a)lists.boost.org > Message-ID: <loom.20060206T212759-680(a)post.gmane.org> > Content-Type: text/plain; charset=us-ascii > > Hi everyone, > > I am trying to use the boost multithreading library. I am having a > problem as the join() function for the thread never returns. I am using > a boolean variable to indicate when the thread should stop running. > Here is basically a stub of what I am doing: > > > //........................................ > bool m_RunThread = false; It's because m_RunThread isn't volatile. -- Frank

2 2

serialisation::archive - no test for eof after reading from istream?!
by Oliver.Kowalke＠infineon.com 07 Feb '06

07 Feb '06

Hello, I don't know why in basic_test_iprimitive::load the stream isn't tested for eof or fail after reading from it? In my case I get a string-resize-exception thrown because it is not tested for eof or fail after 'is >> t' (text_iarchive_impl.ipp line 48; size is not initialized and contains a to huge number which causes a resize exception on line 55). This was raised from the stream which was connected to a socket. The peer has closed the socket and the read operation on the socket has returned EOF.

1 0

[Boost][Tuples] Compilation error VC7.1 w/ enum in namespace
by Marc Viala 07 Feb '06

07 Feb '06

Hi, I've just tried to define a boost::tuples::tuple with an enum in a namespace, see code hereafter: \code namespace adv { namespace rbt { enum MyType { Type_1, Type_2 } ; } } boost::tuples::tuple<size_t, adv::rbt::MyType> t ; \endcode But during the compilation step, I've got an error w/ BOOST 1.33.1 and VC7.1 like that: "error MyType not defined". Remark: If the enum is not defined in a namespace, there are no compilation errors. Is there any workaround to deals with this compilation error? Thanks in advance Marc Viala mailto:mviala@acticm.com <mailto:mviala@acticm.com>

2 1

iostreams::indirect_streambuf -> sync_impl returning integer?
by Oliver.Kowalke＠infineon.com 07 Feb '06

07 Feb '06

Hello, wouldn't it be better if indirect_streambuf::sync_impl returns a integer? In device::write I want to indicate that no character can be written to the external source via returning EOF (external device == socket -> peer has closed socket) instead throwing an exception. Regards, Oliver

1 0

[BGL] Problem implementing dijkstra
by Thomas Gelzhaeuser 07 Feb '06

07 Feb '06

Hello everyone. I've got a small problem when trying to use the dijkstra-shortest-path algorithm. The error reported by the compiler is: 'void put<void*,void*>(T *,ptrdiff_t,const V &)' : cannot convert parameter 2 from 'void *' to 'ptrdiff_t' Can anyone give me a hint what I am missing? Thanks. Thomas. I made up a small example with the compiler error I receive (VS2005) >>>>>>>>> problem.cpp #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graph_traits.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/properties.hpp> #include <vector> //defining vertex properties typedef boost::property<boost::vertex_name_t, std::string> VName; typedef boost::property<boost::vertex_index_t, int, VName> VIndex; typedef boost::property<boost::vertex_index_t, int, VIndex> VertexProperties; //defining edge properties typedef boost::property<boost::edge_weight_t, int> EdgeProperties; typedef boost::adjacency_list <boost::listS, boost::listS, boost::directedS, VertexProperties, EdgeProperties> PespGraph_t; typedef boost::graph_traits < PespGraph_t >::vertex_descriptor Pesp_Vertex; typedef boost::graph_traits < PespGraph_t >::edge_descriptor Pesp_Edge; int main(int argc, char* argv[]) { PespGraph_t g; Pesp_Vertex v1, v2; v1 = boost::add_vertex(g); boost::put(boost::vertex_name, g, v1, "Vertex 1"); boost::put(boost::vertex_index, g, v1, 1); v2 = boost::add_vertex(g); boost::put(boost::vertex_name, g, v2, "Vertex 2"); boost::put(boost::vertex_index, g, v2, 2); Pesp_Edge e; bool inserted; tie(e,inserted) = boost::add_edge(v1, v2, g); boost::put(boost::edge_weight, g, e, 10); std::vector<Pesp_Vertex> pred(boost::num_vertices(g)); std::vector<int> dist(boost::num_vertices(g)); dijkstra_shortest_paths(g, v1, boost::predecessor_map(&pred[0])); return 0; } >>>>>>>>> compiler output 1>------ Build started: Project: playground, Configuration: Debug Win32 ------ 1>Compiling... 1>problem.cpp 1>c:\boost\include\boost-1_33_1\boost\graph\dijkstra_shortest_paths.hpp(251) : error C2664: 'void put<void*,void*>(T *,ptrdiff_t,const V &)' : cannot convert parameter 2 from 'void *' to 'ptrdiff_t' 1> with 1> [ 1> T=void *, 1> V=void * 1> ] 1> There is no context in which this conversion is possible 1> c:\boost\include\boost-1_33_1\boost\graph\dijkstra_shortest_paths.hpp(291) : see reference to function template instantiation 'void boost::dijkstra_shortest_paths<VertexListGraph,boost::dijkstra_visitor<>,void**__w64 ,DistanceMap,WeightMap,IndexMap,std::less<_Ty>,boost::closed_plus<T>,int,int,ColorMap>(const VertexListGraph &,void *,PredecessorMap,DistanceMap,WeightMap,IndexMap,Compare,Combine,DistInf,DistZero,DijkstraVisitor,ColorMap)' being compiled 1> with 1> [ 1> VertexListGraph=PespGraph_t, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<int,std::allocator<int>>,boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>,int,int &>, 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> IndexMap=boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>, 1> _Ty=D, 1> T=D, 1> ColorMap=boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &>, 1> PredecessorMap=void **__w64 , 1> Compare=std::less<D>, 1> Combine=boost::closed_plus<D>, 1> DistInf=int, 1> DistZero=int, 1> DijkstraVisitor=boost::dijkstra_visitor<> 1> ] 1> c:\boost\include\boost-1_33_1\boost\graph\dijkstra_shortest_paths.hpp(321) : see reference to function template instantiation 'void boost::detail::dijkstra_dispatch2<VertexListGraph,boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>,WeightMap,IndexMap,Params,boost::iterator_property_map<std::_Vector _iterator<_Ty,_Alloc>,IndexMap,boost::default_color_type,boost::default_color_type &>>(const VertexListGraph &,void *,DistanceMap,WeightMap,IndexMap,const Params &,ColorMap)' being compiled 1> with 1> [ 1> VertexListGraph=PespGraph_t, 1> RandomAccessIterator=std::_Vector_iterator<int,std::allocator<int>>, 1> IndexMap=boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>, 1> T=int, 1> R=int &, 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> Params=boost::bgl_named_params<void **__w64 ,boost::vertex_predecessor_t,boost::no_property>, 1> _Ty=boost::default_color_type, 1> _Alloc=std::allocator<boost::default_color_type>, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<int,std::allocator<int>>,boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>,int,int &>, 1> ColorMap=boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &> 1> ] 1> c:\boost\include\boost-1_33_1\boost\graph\dijkstra_shortest_paths.hpp(341) : see reference to function template instantiation 'void boost::detail::dijkstra_dispatch1<VertexListGraph,boost::detail::error_property_not_found,boost::adj_list_edge_property_map<Directed,Value,Ref,Vertex,Property,Tag>,boost::adj_list_vertex_property_map<Graph,ValueType,Reference,boost::vertex_index_t>,boost::bgl_named_params<T,boost::vertex_predecessor_t,Base>,boost::detail::error_property_not_found>(const VertexListGraph &,void *,DistanceMap,WeightMap,IndexMap,const Params &,ColorMap)' being compiled 1> with 1> [ 1> VertexListGraph=PespGraph_t, 1> Directed=boost::directed_tag, 1> Value=int, 1> Ref=const int &, 1> Vertex=void *, 1> Property=const boost::property<boost::edge_weight_t,int>, 1> Tag=boost::edge_weight_t, 1> Graph=Graph, 1> ValueType=int, 1> Reference=const int &, 1> T=void **__w64 , 1> Base=boost::no_property, 1> DistanceMap=boost::detail::error_property_not_found, 1> WeightMap=boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int>,boost::edge_weight_t>, 1> IndexMap=boost::adj_list_vertex_property_map<Graph,int,const int &,boost::vertex_index_t>, 1> Params=boost::bgl_named_params<void **__w64 ,boost::vertex_predecessor_t,boost::no_property>, 1> ColorMap=boost::detail::error_property_not_found 1> ] 1> c:\dokumente und einstellungen\gelzi.mediber\eigene dateien\visual studio 2005\projects\playground\playground.cpp(43) : see reference to function template instantiation 'void boost::dijkstra_shortest_paths<PespGraph_t,void**__w64 ,boost::vertex_predecessor_t,boost::no_property>(const VertexListGraph &,void *,const boost::bgl_named_params<T,Tag,Base> &)' being compiled 1> with 1> [ 1> VertexListGraph=PespGraph_t, 1> T=void **__w64 , 1> Tag=boost::vertex_predecessor_t, 1> Base=boost::no_property 1> ] 1>playground - 1 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ==========

1 0

Boost.MultiArray bounds checking
by Frank Hess 07 Feb '06

07 Feb '06

I'm using boost 1.32, and boost::multi_array doesn't seem to provide any bounds-checked access. I'm curious if there are any plans to add a bounds-checked at() member function to complement the [] operator? Or, is there some reason it is impractical? -- Frank

3 3

Re: [Boost-users] [Review] Shmem Library
by Fred Bertsch 06 Feb '06

06 Feb '06

shmemdoc-0.9.zip and shmemlib-0.9.zip are the most recent versions of the library and documentation. They are the ones getting reviewed. -Fred > > Both documentation and the library itself can be downloaded here: > > http://tinyurl.com/9t5qy > > Which file needs to be dounloaded. There are lots of'em there. > > Gennadiy

1 0