- Boost-users - lists.boost.org

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

Meaning of "unspecified" arguments (scoped_lock constructors)
by Mark Reginald James 31 Oct '08

31 Oct '08

Hello, I haven't been able to discover the meaning of "unspecified" in things like scoped_lock constructor parameters: http://www.boost.org/doc/libs/1_36_0/doc/html/boost/interprocess/scoped_loc… I'm trying to lock a scoped lock only if the mutex is not null. It looks like I need to use one of these "unspecified" constructors to assign the mutex but not lock it, so that I can then lock it in an "if" statement if the mutex is not null. I'd be grateful for any help.

3 3

[boost::pool] using many pools in the application
by Roman Shmelev 31 Oct '08

31 Oct '08

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!

2 2

[graph] predecessor_recorder and VertexList=listS
by trashing＠gmx.net 31 Oct '08

31 Oct '08

Hello list members, I've following graph: typedef adjacency_list<vecS, listS, bidirectionalS, property<vertex_distance_t, unsigned int, VertexContainer >, cPose> BGLGraph typedef graph_traits<BGLGraph>::vertex_descriptor BGLVertexDescriptor; with VertexList=listS, two vertex properties (distance map and a bundled property VertexContainer) and a bundled edge property cPose. Now I try to create a predecessor map with the predecessor_recorder but I'm not able to create a map that obtains the predecessor informations. I know I can't use std::vector<BGLVertexDescriptor> like the example (http://www.boost.org/doc/libs/1_35_0/libs/graph/example/bfs.cpp) because I use VertexList=listS. HenceI tried std::map<BGLVertexDescriptor, BGLVertexDescriptor> but this leads to another compiler error. What I'm doing wrong? greetz, Manuel -- Ist Ihr Browser Vista-kompatibel? Jetzt die neuesten Browser-Versionen downloaden: http://www.gmx.net/de/go/browser

2 1

[Graph] newbie to graph
by Lior Weizman 31 Oct '08

31 Oct '08

I am a newbie to boost. I am trying to build a graph and to compute the max_flow using boost/graph/kolomogorov_max_flow.hpp. Blow is 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> int main() { using namespace boost; typedef adjacency_list_traits<vecS, vecS, directedS> Traits; typedef adjacency_list<vecS, vecS, directedS, property<vertex_name_t, std::string>, property<edge_capacity_t, long, property<edge_residual_capacity_t, long, property<edge_reverse_t, Traits::edge_descriptor> > > > Graph; typedef graph_traits <Graph>::edge_descriptor edge_descriptor; typedef Traits::vertex_descriptor vertex_descriptor; typedef std::pair<edge_descriptor, bool> EdgePair; typedef std::pair<int,int> Pair; Graph g; long flow; property_map<Graph, vertex_name_t>::type name = get(vertex_name, g); property_map<Graph, edge_capacity_t>::type capacity = get(edge_capacity, g); property_map<Graph, edge_reverse_t>::type rev = get(edge_reverse, g); property_map<Graph, edge_residual_capacity_t>::type residual_capacity = get(edge_residual_capacity, g); 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); put(capacity,edge_from_first.first,1); for (int i = 1; i < 5; ++i){ edge_desc_obj=add_edge(edge_array[i].first, edge_array[i].second,g); put(capacity,edge_desc_obj.first,i+1); } EdgePair edge_to_last=add_edge(edge_array[5].first,edge_array[5].second,g); put(capacity,edge_to_last.first,4); char str[2]; for (int i=0;i<5;++i) { sprintf(str,"%d",i); put(name,i,str); } 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_output.txt 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. Calling the example "libs/graph/example/kolmogorov-eg.cpp" with the dimacs output above as input, also works fine. This fact leads me to the assumption that my graph is fine. Does anyone know what is wrong with my graph when I perform a direct call to kolmogorov_max_flow? Thanks, Lior

2 1

auto_link.hpp
by Ryan McConnehey 31 Oct '08

31 Oct '08

Currently, the auto_link.hpp helps users declare a library in their header files. For example: #define BOOST_LIB_NAME boostlibrary #define BOOST_AUTO_LINK_NOMANGLE #include <boost/config/auto_link.hpp> The header file that declares this will search the library include path for a boostlibrary.lib. This is great if all versions of one's libraries have the same name. This would mean the libraries would need to be separated into different folders. To be able to place all of the versions of a library into the same folder, one would need to turn the mangling off and search for the library. The header would then be as follows: #define BOOST_LIB_NAME boostlibrary #include <boost/config/auto_link.hpp> This means one would rely on how boost mangles the name of the library. For the most part, I don't mind how this is done, however, I would like to specify my own version number for the library. Is there a way to do this or do I need to copy the entire file into my own directory and replace BOOST_LIB_VERSION with another define for my library? Ryan

2 2

Asio Protocol Decoder interfaces/templates
by Rodrigo Madera 31 Oct '08

31 Oct '08

Hello all, I was wondering if Boost Asio has any plans to have a structure such as Apache MINA's xxxEncoder/xxxDecoder (which are for Java). This kind of interface (for those who don't know them yet) allow you to write code such as: (Warning: very bad {and simplistic} example ahead) class commands::echo : public message_decoder { somewhere("echo"); } class commands::cls : public message_decoder { somewhere("cls"); } ... class commands::exit : public message_decoder { somewhere("exit"); } class my_protocol_decoder : public protocol_decoder { ctor() { add(echo); add(cls); ... add(exit); } }; And that would give us a nice protocol decoder that we can plug into a family of "decoding-friendly" classes. Apache MINA does a great job doing this and maybe there is something that can be extracted into Boost Asio. Please tell me what you think or if I'm completely mad to want this or even if I'm asking on the wrong place. Thank you all!! Rodrigo Madera =o)

2 5