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

[Graph] need suggestion
by srinivas boppu 06 Jan '12

06 Jan '12

Hello All, I need a graph structure as follows. (Here my input is a Graph which I call it as " Control Flow Graph".) On this "Control Flow Graph", I run a algorithm it creates another graph, and on that I will run again the algorithm, it will create another "Graph" and it continues until it become a "Single Node". I should be able to access all the Graphs in each stage and my original graph information should be untouched. What is the best way to do it ? Any suggestions ? (Actually, I am trying to solve one problem using "Interval Based Analysis" of Control Flow Graphs. I would like to divide the given main control flow graph into disjoint intervals. You can have a look at the following link for more information http://nptel.iitm.ac.in/courses/106108052/module9/control-flow-ana-2.pdf ) Regards, Srinivas

2 2

Boost.Date_Time - Visual C++ 6
by asif saeed 06 Jan '12

06 Jan '12

Hi, Can DateTime build on Visual C++ 6? Has somebody already done it? Can you please point me to some online step-by-step instructions, a blog post or something that can help me to accomplish this? Thanks in advance, Asif

2 3

Boost::shared::memory consistency
by Josmon Paul 06 Jan '12

06 Jan '12

4 8

[BGL] Finding the descriptor for a given vertex
by Kelvin Chung 05 Jan '12

05 Jan '12

Suppose I have the following: template <class T> class Graph { // Adapter class that I use for my purposes typedef typename boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, T> innerGraph; typedef typename boost::graph_traits<innerGraph>::vertex_descriptor VertexDescriptor; innerGraph G; public: void addVertex(const T& vertex); bool containsVertex(const T& vertex) const; void addEdge(const T& from, const T& to); // More stuff here }; The intent of this adapter class is to basically abstract out all the mentions of stuff like the descriptors and such. So a good helper function to this end would be a function that retrieves the VertexDescriptor for a given T, if it exists. Is there such a function already in the BGL, or do I have to manage that separately (ie. having an external map)?

5 7

Auto-Linking in Visual Studio 2008
by Robert Abel 05 Jan '12

05 Jan '12

Hi, I recently began using boost in a project on Windows using MS Visual Studio 9.0 2008 using CMake, i.e. the project setup is auto-generated using the correct boost libraries as link targets. In my project, I link to boost_thread*.lib, which should be the import library for boost_thread*.dll. However, when I compile the project, the I get the following linking error: > Error 43 fatal error LNK1104: cannot open file > 'libboost_thread-vc90-mt-1_48.lib' rsb-chat-1 rsb-chat-1 So it seems necessary to have the static library present as well when linking the executable. At first I thought this was the default auto-linking behavior described in the documentation, i.e. static linking. However, once all needed static libraries are supplied, the final executable still needs the dynamic boost_*.dll libraries. This did not seem right to me... Now, when I disable auto-linking using > #define BOOST_ALL_NO_LIB the linker will not try to link the static libboost_thread*.lib, but instead use the boost_thread*.lib that was defined in the project settings. I couldn't find any documentation on this specific auto-linking behavior. * Is this expected behavior? Maybe MSVS-specific behavior? * Does the presence of the static library actually preclude some dynamic linking from occurring, thus making my executable bigger? * Or does the static library basically just need to be present and auto-linking will actually not use it when it's not appropriate? * Or does auto-linking mix and match, i.e. in my original case, when I supplied the static libraries: Did it link some functions statically, while others dynamically? Thanks, Robert

3 5

[type_traits] type_with_alignment<64> on gcc
by Ioannis Papadopoulos 05 Jan '12

05 Jan '12

Hi, Is there any particular reason that type_with_alignment does not support alignment more than 32 on gcc? I am trying to create an unordered_map of objects that are aligned to cache line size (64bytes) and it fails in type_with_alignment. This small example shows it: #include <boost/tr1/unordered_map.hpp> struct __attribute__((aligned(64)) A { int i; }; int main() { std::tr1::unordered_map<int, A> umap; umap[0] = A(); return 0; } In file included from /usr/local/boost/boost_1.48/include/boost/aligned_storage.hpp:21:0, from /usr/local/boost/boost_1.48/include/boost/type_traits/aligned_storage.hpp:11, from /usr/local/boost/boost_1.48/include/boost/unordered/detail/buckets.hpp:17, from /usr/local/boost/boost_1.48/include/boost/unordered/detail/table.hpp:10, from /usr/local/boost/boost_1.48/include/boost/unordered/detail/equivalent.hpp:14, from /usr/local/boost/boost_1.48/include/boost/unordered/unordered_map.hpp:18, from /usr/local/boost/boost_1.48/include/boost/unordered_map.hpp:16, from /usr/local/boost/boost_1.48/include/boost/tr1/unordered_map.hpp:21, from test.cc:1: /usr/local/boost/boost_1.48/include/boost/type_traits/type_with_alignment.hpp: In instantiation of ‘boost::detail::type_with_alignment_imp<64ul>’: /usr/local/boost/boost_1.48/include/boost/type_traits/type_with_alignment.hpp:216:7: instantiated from ‘boost::type_with_alignment<64ul>’ /usr/local/boost/boost_1.48/include/boost/mpl/eval_if.hpp:60:31: instantiated from ‘boost::mpl::eval_if_c<false, boost::mpl::identity<boost::detail::max_align>, boost::type_with_alignment<64ul> >’ /usr/local/boost/boost_1.48/include/boost/aligned_storage.hpp:55:21: instantiated from ‘boost::detail::aligned_storage::aligned_storage_imp<128ul, 64ul>::data_t’ /usr/local/boost/boost_1.48/include/boost/aligned_storage.hpp:56:7: instantiated from ‘boost::detail::aligned_storage::aligned_storage_imp<128ul, 64ul>’ /usr/local/boost/boost_1.48/include/boost/aligned_storage.hpp:73:7: instantiated from ‘boost::aligned_storage<128ul, 64ul>’ /usr/local/boost/boost_1.48/include/boost/unordered/detail/table.hpp:281:59: instantiated from ‘boost::unordered::detail::value_base<std::pair<const int, A> >’ /usr/local/boost/boost_1.48/include/boost/unordered/detail/unique.hpp:47:12: instantiated from ‘boost::unordered::detail::ptr_node<std::pair<const int, A> >’ /usr/local/boost/boost_1.48/include/boost/unordered/detail/unique.hpp:332:40: instantiated from ‘boost::unordered::detail::table_impl<Types>::value_type& boost::unordered::detail::table_impl<Types>::operator[](const key_type&) [with Types = boost::unordered::detail::map<std::allocator<std::pair<const int, A> >, int, boost::hash<int>, std::equal_to<int> >, boost::unordered::detail::table_impl<Types>::value_type = std::pair<const int, A>, boost::unordered::detail::table_impl<Types>::key_type = int]’ /usr/local/boost/boost_1.48/include/boost/unordered/unordered_map.hpp:1007:26: instantiated from ‘boost::unordered::unordered_map<K, T, H, P, A>::mapped_type& boost::unordered::unordered_map<K, T, H, P, A>::operator[](const key_type&) [with K = int, T = A, H = boost::hash<int>, P = std::equal_to<int>, A = std::allocator<std::pair<const int, A> >, boost::unordered::unordered_map<K, T, H, P, A>::mapped_type = A, boost::unordered::unordered_map<K, T, H, P, A>::key_type = int]’ test.cc:11:9: instantiated from here /usr/local/boost/boost_1.48/include/boost/type_traits/type_with_alignment.hpp:206:1: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ /usr/local/boost/boost_1.48/include/boost/type_traits/type_with_alignment.hpp:207:1: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ Is there any easy way to avoid this problem? Thanks

2 2

boost::filesystem::path construct from iterator
by Frank Kingswood 05 Jan '12

05 Jan '12

Hi I am getting surprising build errors when attempting to create a path from iterators. For example: boost::filesystem::path path("a/b/c"); boost::filesystem::path tail(path.begin(),path.end()); fails to build on the tail constructor. The actual error is about three screenfuls so I will omit this here for now. My intention is to do something a bit more interesting, e.g. path.begin()+1 to skip the leading path component. Thanks, Frank

1 0

boost:shared_ptr destructor, SIGBUS, MIPS 64
by sumanth krishna 05 Jan '12

05 Jan '12

I am using a STL list of boost shared pointer in my code and and it randomly dumps core. Below is the code snippet and the core stack. class A () { virtual ~A(); string getsomestring(); } class B: public A { } typedef shared_ptr<A> A_ptr; class C // singelton class { public: getList(list <A_ptr>& temp_list) { list<A_ptr>::iterator itr = _inv.begin(); for( ; itr != _inv.end(); itr++ ) { temp_list.push_back( (*itr) ); } getListContent ( list<string>& str_list) { list<A_ptr>::iterator itr = _inv.begin(); for( ; itr != _inv.end(); itr++ ) { str_list.push_back( (*itr)->getsomestring() ); } } private: list <A_ptr> _inv; } main() { C *c= new C; // create an instance ( its a singleton class) // On creating an instance of C, the private member variable inventory is populated. // inventory.push_back(A_ptr(new FRU ( fvar ))) thread 1 { list<A_ptr> var1; c->getList(var1); list <string> var2; c->getListContent(var2); } // End of thread delete c; } // end of main Now this code works fine for some iterations and then dumps core with the following stack ###################### Thread 1 (Thread 0x55567f7af0 (LWP 23773)): #0 0x0000000120038ecc in boost::detail::atomic_decrement (pw=0xa) sysroot/usr/include/boost/smart_ptr/detail/sp_counted_base_gcc_mips.hpp:66 #1 0x0000000120038f44 in boost::detail::sp_counted_base::release (this=0x2) #2 0x00000001200390ac in boost::detail::shared_count::~shared_count (this=0x1200b08d8, __in_chrg=<value optimized out>) #3 0x000000012003eaf4 in boost::shared_ptr<A>::~shared_ptr (this=0x1200b08d0, __in_chrg=<value optimized out>) #4 0x000000012003eb4c in __gnu_cxx::new_allocator<boost::shared_ptr<A> >::destroy (this=0xffffeaf640, __p=0x1200b08d0) #5 0x000000012003c9e0 in std::_List_base<boost::shared_ptr<A>, std::allocator<boost::shared_ptr<A> > >::_M_clear (this=0x1200a8ee8) #6 0x000000012003b4ac in std::_List_base<boost::shared_ptr<A>, std::allocator<boost::shared_ptr<A> > >::~_List_base (this=0x1200a8ee8, __in_chrg=<value optimized out>) #7 0x000000012003a0e8 in std::list<boost::shared_ptr<A>, std::allocator<boost::shared_ptr<A> > >::~list (this=0x1200a8ee8, __in_chrg=<value optimized out>) #8 0x0000000120068b64 in C::~C (this=0x1200a8e70, __in_chrg=<value optimized out>) ###################################################### This code is cross compiled for MIPS64 arch on linux x86_64 machine and is running on a 64 bit MIPS machine. I am not sure why it is dumping core. It dumps core giving a *SIGBUS* error. Do i have to specifically handle the delete operation of the List ? I am using the default destructor for "C" class and there is no pointers in the class A and Class A also doesnt have anything in its destructor, no memory allocations are done in Class A. Any suggestions regarding this problem would be highly helpful.

2 4

boost compilation error
by Prasanth Madhavan 05 Jan '12

05 Jan '12

I have a class using boost interprocess. some of the code used in it are here http://stackoverflow.com/questions/8653207/boost-interprocess-vector-creati… and here http://stackoverflow.com/questions/8517115/inserting-a-boost-vector-inside-… when i use g++ -c and compile it, it compiles. I have another big project with whom i would like to use this class. so i added it to that project, and made changes to accomodate the new class and use it. But when i compile it, it crashes with a really big error and i have no clue what the hell is going on. Please help. I have attached a sample output from make. One more thing. Inside the project. the class compiles fine. the attached message comes in when compiling another file that has the header file of this class attached to it. stats.hpp -> this is the header to the class that uses boost manager.hpp -> this has stats.hpp included filter.cpp -> this has manager.hpp included. -- Prasanth Madhavan

1 0

Properties error reading undirected graph with "read_graphviz"
by nunofaria 05 Jan '12

05 Jan '12

Hi, I am trying to read an undirected_graph from a .dot file with read_graphviz, but I seem to some problems regarding the properties of the graph, which are *vertex_index* and *edge_weight*. /terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::dynamic_const_put_error> >' what(): Attempt to put a value into a const property map: / The code I am using is followed: *typedef property<edge_weight_t, int> EdgeWeightProperty; typedef adjacency_list<vecS, vecS, undirectedS, no_property, EdgeWeightProperty> undirected_graph; typedef property_map<undirected_graph, edge_weight_t>::type weight_map_type; typedef property_traits<weight_map_type>::value_type weight_type; typedef std::pair<int, int> edge_t; undirected_graph read_graph(std::string filename, dynamic_properties * dp) { std::ifstream in(filename.c_str()); // ... check errors in file ... undirected_graph g(0); read_graphviz(in, g, *dp, "node_id"); in.close(); return g; } int main() { boost::dynamic_properties dp; // populate graph properties by reference undirected_graph g = read_graph("test_boost_graph.dot", &dp); dp.property("node_id", get(vertex_index, g)); dp.property("w", get(edge_weight, g)); // write to cout write_graphviz_dp(cout, g, dp, "node_id"); return 0; }* I think the example is pretty simple and it should work. However I don't get much when googling the resulting error. Does someone know what's this about? Thanks in advance -- View this message in context: http://boost.2283326.n4.nabble.com/Properties-error-reading-undirected-grap… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0