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

Boost regex does't work
by Yoshiyuki Watanabe 02 Nov '08

02 Nov '08

Hi, I'm a new user of boost. I have a trouble to use boost. I downloaded boost_1_36_0 and put it on directory where I prefer. To use with eclipse, I set the path. Property->c/c++build->settings->GCC C++ compiler->directories Some functions like boost/tokenizer or boost/lexical_cast is working well, but only the function boost/regex doesn't work. Compile is finished safely, but once I tried to run, an error is appear ,and the process stops. Undefined symbols: "boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::do_assign(char const*, char const*, unsigned int)", referenced from: boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::assign(char const*, char const*, unsigned int)in main.o ld: symbol(s) not found collect2: ld returned 1 exit status Would someone have ideas to use boost/regex on eclipse? My plattform is Mac OSX Leopard. Thanks,

2 1

Re: [Boost-users] [Graph] newbie to graph (Andrew Sutton)
by Lior Weizman 02 Nov '08

02 Nov '08

Hello, Thank you for your reply. I implemented your suggestions but the problem persists. Below is the current version of my code: --------------------------------------------------------------CODE---------------------------------------------------------------------- #include <boost/config.hpp> #include <iostream> #include <string> #include <boost/graph/kolmogorov_max_flow.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/write_dimacs.hpp> #include <boost/graph/read_dimacs.hpp> using namespace boost; struct Arc; struct Node; typedef adjacency_list<vecS,vecS,directedS,Node,Arc> Graph; struct Arc { long capacity; long residual_capacity; Graph::edge_descriptor reverse; }; struct Node { std::string name; }; int main() { typedef Graph::vertex_descriptor vertex_descriptor; typedef Graph::edge_descriptor edge_descriptor; typedef std::pair<edge_descriptor, bool> EdgePair; typedef std::pair<int,int> Pair; Graph g; property_map<Graph, long Arc::*>::type capacity = get(&Arc::capacity, g); property_map<Graph, Graph::edge_descriptor Arc::*>::type rev = get(&Arc::reverse,g); long flow; vertex_descriptor s, t; Pair edge_array[6] = { Pair(0,1), Pair(0,2), Pair(0,3), Pair(2,4), Pair(1,3), Pair(4,3), }; EdgePair edge_desc_obj; EdgePair edge_from_first=add_edge(edge_array[0].first,edge_array[0].second,g); g[edge_from_first.first].capacity=1; for (int i = 1; i < 5; ++i){ edge_desc_obj=add_edge(edge_array[i].first, edge_array[i].second,g); g[edge_desc_obj.first].capacity=i+1; } EdgePair edge_to_last=add_edge(edge_array[5].first,edge_array[5].second,g); g[edge_to_last.first].capacity=4; char str[2]; int i=0; vertex_descriptor v1=*vertices(g).first,v2=*vertices(g).second; while (v1!=v2) { sprintf(str,"%d",i); g[v1].name=str; std::cout << str; v1++; i++; } edge_descriptor from_s,to_t; from_s=edge_from_first.first; to_t=edge_to_last.first; s=source(from_s,g); t=target(to_t,g); flow = kolmogorov_max_flow(g, s, t); return 0; } -------------------------------------------------------------------END OF CODE------------------------------------------------------------------ The compilation output of the code above includes errors and can be found here: http://www.cs.huji.ac.il/~lweizm45/compile_output2.txt<http://www.cs.huji.ac.il/%7Elweizm45/compile_output2.txt> Again, if I remove the call to kolmogorv_max_flow, everyting is fine. If I replace the call to kolmogorov_max_flow with the line: write_dimacs_max_flow(g, capacity, identity_property_map(),s, t, std::cout); The output is: -------------------------------------- OUTPUT ------------------------------------------------------ c DIMACS max-flow file generated from boost::write_dimacs_max_flow p max 5 6 n 1 s n 4 t a 1 2 1 a 1 3 2 a 1 4 3 a 2 4 5 a 3 5 4 a 5 4 4 ---------------------------------------- END OF OUTPUT -------------------------------------------------- Which means that the graph was created correctly. Any suggestions? Thanks, Lior

2 1

[BGL] how to call Dijkstra
by Sandeep Gupta 02 Nov '08

02 Nov '08

Hi, I am missing something regarding the correct calling convention for Dijkstra algorithm. Here is the relevant part of the code: typedef boost::associative_property_map< std::map<Vertex, int> > intmapt; typedef boost::associative_property_map< std::map<Vertex, Vertex> > nodemapt; dijkstra_visitor<null_visitor> mynullvis; dijkstra_shortest_paths<Graph, dijkstra_visitor<null_visitor>, nodemapt, intmapt, intmapt, nodemapt, std::less<int>, std::plus<int>, std::numeric_limits<int>, std::numeric_limits<int> > (G, v, predmap, distmap, weightmap, indexmap, std::less<int>(), std::plus<int>(), std::numeric_limits<int>::max(), 0, mynullvis); I get an error as no matching function call dijkstra_shortest_paths. Appreciate some pointers as what could possibly be wrong. Thanks sandeep

2 1

boost mutex linking problem (undefined reference to mutex) on gcc and boost 1.34
by professor rumsdiegeige 02 Nov '08

02 Nov '08

Hello, I'm trying to compile a simple program with a boost::mutex in it. It compiles fine, but the linking process shipwrecks: "undefined reference to `boost::mutex::~mutex()' " I'm using ubuntu 8.04 and boost 1.34. When I try to compile the same program on MSVS 2005, it compiles, links and works fine Do I need to link explicitly to certain library? On the web I found sth. about needing to link against posix4 - but that didn't help. Any help appreciated! Regards, Sabine Lorentz

2 1

shared_ptr leaking memory and crashing / gcc 3.4.6
by Michael 01 Nov '08

01 Nov '08

Hello, I figured that shared_ptr (boost 3.4, but I don't think this is really a boost problem) will lose memory in the following example #include <boost/shared_ptr.hpp> struct X { int y; }; typedef boost::shared_ptr<X> XRef; XRef getx() { throw 0; } int main(int argc, char** argv) { while (true) { XRef myX; try { myX = getx(); } catch(...) { } } } Compile: g++ -I/usr/local/include test.C -o test On every iteration of the while loop it loses memory and after approx. 1 million iterations it dies with signal 10 or 11. Changing that pattern to try { XRef y = getx(); myX = y; } catch(...) { } fixes the problem (I assume in that case it will call shared_ptrs copy constructor instead of its assignment operator). Platform is FreeBSD 6, gcc 3.4.6. It only happens when compiled like above (without optimization). On optimization levels 2 and above (-O2) it works ok. Maybe somebody using gcc 3.4 can check if this also happens on other platforms. gcc 4 works ok without any issues, so I assume this is a compiler problem. It might still be a good idea to put a warning in the documentation about this. cheers Michael

2 4

non-deterministic state diagram
by Andrej van der Zee 01 Nov '08

01 Nov '08

Hi, I need to calculate the non-deterministic state diagram from raw data and was wondering how boost can hep me. More specific, I have many state transition sequences (lets say up to 100-thousand) that all start at state A, such as: A -> B -> D -> B -> E A -> D -> B -> C -> B A -> E -> D -> F -> D Now I want to calculate the non-deterministic state diagram with a chance for each transition, and desirable in real-time. For example, for the raw data above, the transition for A -> B is 0.33. My question is how boost can help me: * Which library is best to represent the state diagram? * Does the library help in calculation of the state diagram from raw data? Thank you, Andrej

3 4

using boost::tokenizer within boost::bimap
by Sean Farrow 01 Nov '08

01 Nov '08

Hi: I'd like to use boost::tokenizer in boost::bimap. I currently have: boost::bimaps::bimap<boost::bimaps::unordered_set_of<boost::tokenizer<bo ost::char_separator<char>>>, std::string> CodeList; I'm getting the following errors: 1>------ Build started: Project: VDux, Configuration: Release Win32 ------ 1>Compiling... 1>VDux.cpp 1>c:\program files\boost\boost/functional/hash/extensions.hpp(72) : error C2665: 'boost::hash_value' : none of the 16 overloads could convert all the argument types 1> c:\program files\boost\boost/functional/hash/hash.hpp(33): could be 'size_t boost::hash_value(bool)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(34): or 'size_t boost::hash_value(char)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(35): or 'size_t boost::hash_value(unsigned char)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(36): or 'size_t boost::hash_value(signed char)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(37): or 'size_t boost::hash_value(short)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(38): or 'size_t boost::hash_value(unsigned short)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(39): or 'size_t boost::hash_value(int)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(40): or 'size_t boost::hash_value(unsigned int)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(41): or 'size_t boost::hash_value(long)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(42): or 'size_t boost::hash_value(unsigned long)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(45): or 'size_t boost::hash_value(wchar_t)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(49): or 'size_t boost::hash_value(boost::long_long_type)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(50): or 'size_t boost::hash_value(boost::ulong_long_type)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(67): or 'size_t boost::hash_value(float)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(68): or 'size_t boost::hash_value(double)' 1> c:\program files\boost\boost/functional/hash/hash.hpp(69): or 'size_t boost::hash_value(long double)' 1> while trying to match the argument list '(const boost::tokenizer<TokenizerFunc>)' 1> with 1> [ 1> TokenizerFunc=boost::char_separator<char> 1> ] 1> c:\program files\boost\boost/functional/hash/extensions.hpp(71) : while compiling class template member function 'size_t boost::hash<T>::operator ()(const T &) const' 1> with 1> [ 1> T=boost::tokenizer<boost::char_separator<char>> 1> ] 1> c:\program files\boost\boost/concept_check.hpp(334) : see reference to class template instantiation 'boost::hash<T>' being compiled 1> with 1> [ 1> T=boost::tokenizer<boost::char_separator<char>> 1> ] 1> c:\program files\boost\boost/concept_check.hpp(317) : see reference to class template instantiation 'boost::UnaryFunction<Func,Return,Arg>' being compiled 1> with 1> [ 1> Func=boost::hash<boost::tokenizer<boost::char_separator<char>>>, 1> Return=size_t, 1> Arg=boost::tokenizer<boost::char_separator<char>> 1> ] 1> c:\program files\boost\boost/concept/detail/has_constraints.hpp(40) : see reference to class template instantiation 'boost::UnaryFunctionConcept<Func,Return,Arg>' being compiled 1> with 1> [ 1> Func=boost::hash<boost::tokenizer<boost::char_separator<char>>>, 1> Return=size_t, 1> Arg=boost::tokenizer<boost::char_separator<char>> 1> ] 1> c:\program files\boost\boost/concept/detail/msvc.hpp(52) : see reference to class template instantiation 'boost::concept::not_satisfied<Model>' being compiled 1> with 1> [ 1> Model=boost::UnaryFunctionConcept<boost::hash<boost::tokenizer<boost::ch ar_separator<char>>>,size_t,boost::tokenizer<boost::char_separator<char> >> 1> ] 1> c:\program files\boost\boost/bimap/unordered_set_of.hpp(142) : see reference to class template instantiation 'boost::concept::require<Model>' being compiled 1> with 1> [ 1> Model=boost::UnaryFunctionConcept<boost::hash<boost::tokenizer<boost::ch ar_separator<char>>>,size_t,boost::tokenizer<boost::char_separator<char> >> 1> ] 1> c:\program files\boost\boost/bimap/detail/manage_bimap_key.hpp(69) : see reference to class template instantiation 'boost::bimaps::unordered_set_of<KeyType>::lazy_concept_checked' being compiled 1> with 1> [ 1> KeyType=boost::tokenizer<boost::char_separator<char>> 1> ] 1> c:\program files\boost\boost/bimap/detail/bimap_core.hpp(90) : see reference to class template instantiation 'boost::bimaps::detail::manage_bimap_key<Type>' being compiled 1> with 1> [ 1> Type=boost::bimaps::unordered_set_of<boost::tokenizer<boost::char_separa tor<char>>> 1> ] 1> c:\program files\boost\boost/bimap/bimap.hpp(137) : see reference to class template instantiation 'boost::bimaps::detail::bimap_core<LeftSetType,RightSetType,AP1,AP2,AP3> ' being compiled 1> with 1> [ 1> LeftSetType=boost::bimaps::unordered_set_of<boost::tokenizer<boost::char _separator<char>>>, 1> RightSetType=std::string, 1> AP1=boost::mpl::na, 1> AP2=boost::mpl::na, 1> AP3=boost::mpl::na 1> ] 1> .\VDux.cpp(51) : see reference to class template instantiation 'boost::bimaps::bimap<KeyTypeA,KeyTypeB>' being compiled 1> with 1> [ 1> KeyTypeA=boost::bimaps::unordered_set_of<boost::tokenizer<boost::char_se parator<char>>>, 1> KeyTypeB=std::string 1> ] 1>Build log was saved at "file://f:\hd\work\Freedom Of Speech\V-Ware\V-Dux\Dll\Release\BuildLog.htm" 1>VDux - 1 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== using visual studio 2008. Anyone give me any pointers. Cheers Sean.

2 2

boost::serialization MIPS build
by Чинков Андрей 01 Nov '08

01 Nov '08

Hi I have to build boost::serialization library to MIPS platform using mipsel-linux-gcc, mipsel-linux-ld etc. How can I do it? Can anybody tell me what options should I change in gcc.jam, user-config.jam or other files? And it will be excellent to have the makefile like boost::regex has. Can bjam generate makefile as output? Or can anybody get me makefile for boost::serialization?

1 0

Re: [Boost-users] Problem linking boost filesystem 1_36_0 on ubuntu gcc 4.2
by Kevin Stevens 31 Oct '08

31 Oct '08

Answering my own question. Hopefully someone can google this error in the future and fix it a lot quicker than the several hours it took me.... The problem was that I was not correctly specifying the include headers. I had entered -I/path/to/boost_1_36_0/boost not -I/path/to/boost_1_36_0. I thought I had that path right because everything was compiling. What I did not take into account was that boost 1_34_1 was installed via the package manager by the administrator of the system so the include files were automatically being picked up despite me not explicitly specifying them. The interfaces I was using did not change, but the underlying code did, hence my code still compiled, but refused to link and unfortunately spit out misleading errors. -K From: Kevin Stevens Sent: Thursday, October 30, 2008 5:15 PM To: 'boost-users(a)lists.boost.org' Subject: Problem linking boost filesystem 1_36_0 on ubuntu gcc 4.2 Hello, when I am trying to link boost::filesystem into my program I am receiving link errors. I am trying to convert from boost 1_34_1 to 1_36_0- previously this built against 1_34_1 without any issue. When I link I get the following error: /home/kstevens/code/CrossingEngine/../lib/libtypes.a(Config_Constants.o): In function `boost::enable_if<boost::filesystem::is_basic_path<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >, bool>::type boost::filesystem::exists<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >(boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> const&)': /usr/include/boost/filesystem/operations.hpp:279: undefined reference to `boost::filesystem::detail::status_api(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, int&)' I did an objdump -CT on libboost_filesystem-gcc42-mt-1_36.so and got the following two functions as output but not the one the linker appears to be looking for: 000000000000c4e0 g DF .text 00000000000000e3 Base boost::filesystem::detail::status_api(std::string const&, boost::system::error_code&) 000000000000c720 g DF .text 00000000000000e3 Base boost::filesystem::detail::symlink_status_api(std::string const&, boost::system::error_code&) Could this be a bad build? Am I missing something- perhaps I need to link another file in? I built 1_36_0 myself using a default configuration other than telling it where to put the output libs. I have ensured that I am linking against and including headers from 1_36_0, and have also made a clean build. Is there anything else I should try? Thank you, -Kevin This is my code snippet that uses boost::filesystem: //Create Directory if it does not already exist. if(!boost::filesystem::exists(reportFilePath)) { cout << "output path: " << reportFilePath << " did not exist, which may indicate a different configuration than was intended, creating directory now." << endl; try { boost::filesystem::path path(reportFilePath); boost::filesystem::create_directory(path); } catch(boost::filesystem::filesystem_error e) { cout << "Error: " << e.what() << endl; } }

1 0

Re: [Boost-users] [boost::pool] using many pools in the application
by Lang Stefan 31 Oct '08

31 Oct '08

Hi, Since little help is forthcoming, here are some pointers: I did look into the pool library some time back (boost version 1.34.1) in search of a solution to some severe performance and memory management issues. In short, I was rather disappointed, for various reasons: 1. memory blocks allocated by boost::fast_pool tended to never get freed again until the end of the program, because the release mechanism was (is?) disabled. This meant my memory management problems got even worse! 2. modifying the code to enable the release mechanism didn't help - for some reason it never got called! 3. the basic method of adjusting the pool size in case it ran out of memory, was doubling it's size. This aggravated the above problems through allocating a lot more memory than was needed most of the time. In fact, when I tested it, fast_pool eventually ran out of memory at about the same time the the local member variable storing the memory increment size sufferd an overflow! I managed to fix this locally by deriving my own pool class from the existing one and overriding a method. In effect I restricted the maximum memory block size to a couple of MB. It worked for me, but wasn't sufficiently general as a fix for the library, especially as I still didn't understand all of the inner workings at that time. 4. support for the pool library seems to have been dropped several years ago, although someone did a few minor fixes a couple of months ago (I believe they were incorporated in version 1.35). Regarding your question, the general idea of the boost::pool classes are singleton pool objects that each serve any object of either a particular type (object_pool) or a particular size (all others if I understood them correctly), so depending on the kind of pool you use you get exactly one pool object per type or object size, not multiple. To fix the issues you mentioned, you (or someone else) would have to do several things: 1. fix the memory allocation so it is limited to some reasonable size (I'd suggest to add this maximumum blocksize to the parameter list either of the pool constructors or the templates) 2. fix the release mechanism. What I would do is add a usage counter to each memory block that allows for easy control of emptied blocks. They should work similar to shared pointer usage semantics. 3. Add a mechanism to monitor fill status and do some kind of garbage collection. This is where it's starting to get tricky: If you find a memory block that is almost 'empty' then you might want to shove the remaining data somewhere else - but you can't do so if someone outside your control is pointing to it! It would be possible though if you never hand out raw pointers to pooled objects, but shared pointers. But then you would need to retain a copy of each shared pointer as well. And this would be overkill for objects that take up only a few bytes each! I could go on some more - I did think about it for quite some time. But I think I already gave you a notion of what to expect. Conclusion: consider what you would need a pool for in terms of individual object size, total size, fluctuation, and so on. Then check out the boost documentation on the four pool types it provides and check whether any of the four types would match your requirements in theory. Once you're there, think again, especially in light of the missing deallocation problem: can you afford to effectively keep a chunk of memory till the end of the program, a chunk that is big enough to store the maximum amount of pooled objects and probably quite a bit more? If you can, then give it a try. If not, ... HTH, Stefan -----Ursprüngliche Nachricht----- Date: Wed, 29 Oct 2008 15:34:53 +0200 From: "Roman Shmelev" <rshmelev(a)gmail.com> Subject: [Boost-users] [boost::pool] using many pools in the application To: boost-users(a)lists.boost.org Message-ID: <ca72680f0810290634y5be3b16fuaacfdb728c33bf6a(a)mail.gmail.com> Content-Type: text/plain; charset=ISO-8859-1 Hi, Are there any thoughts if using many boost::pool objects ( from 50 to 1000 to maybe 5000 ) in my application will be efficient or not? During the "long" run my program just allocates new chunks, and the deletion of them is done in the end of the program. The reason I use boost::pool is that my simple tests showed me that boost::pool allocates memory 10x faster than standard _new_ operator. But I'm suffering that 1000 pools will cause some kind of memory fragmentation or smth like that... so maybe it will be better to use _new_ operator? I can make some another test for multiple pools, but we know that real application will act in some other way, and I cannot make a decision. P.S.:MS VS2005, XpSp2_x86, boost 1.35 (if any ideas, I'll upgrade to the newest boost version) thank you! ------------------------------

1 0