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

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

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

Main thread not exiting
by developer1 31 Oct '08

31 Oct '08

Hi, I have created a thread pool library which maintains a worker thread queue and a work queue. Any Application class using this library passes functors to ThreadPool. I am using a ThreadGroup to manage all threads. I use the thread_group.join_all(), to wait for all threads to finish before the main thread exits. But on joining the threads in the thread_group, the main thread fails to exit. Am i missing something. -- View this message in context: http://www.nabble.com/Main-thread-not-exiting-tp20264225p20264225.html Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

How to find: best integer type for processor
by Daryle Walker 31 Oct '08

31 Oct '08

Is there a macro and/or typedef that will tell me bit-length used for a processor and/or the best integer type for said processor? The "int" type is supposed to be that type, and it was in the 16- and 32- bit eras. (I learned C programming with the former in the... early 1990s!) However, the powers-that-be decided, for "backwards compatibility," to freeze "int" and "long" at 32 bits and use a new type, "long long," for 64 bits, which should be the optimized integer type for 64-bit processors. (If they kept to the plan, "int" would be 64 bits, "long" either 64 or 128, "short" up to 32, and the new type will be "short short" at 16.) I want to know the best type so, when I build multi-integer arrays for various purposes, I don't pick an element type that causes a slow down, whether to focus on a fraction of a register (if the chosen type is too small) to handle two registers at once (if the chosen type is too large). -- Daryle Walker Mac, Internet, and Video Game Junkie darylew AT hotmail DOT com

9 11

[multi-index] Container of polymorphic pointers
by Daniel Dilts 31 Oct '08

31 Oct '08

I'm am using boost::multi_index to hold a set of polymorphic entities. Due to efficiency concerns, I have to be able sort the container based on actual type. I was planning on sorting based on the return result of typeid. When I try this I get errors in <functional>. I am using VC++ 2005 Standard Edition SP1. What am I doing wrong, or, what is a better way of accomplishing what I am trying to do? #ifndef ENTITIES_ENTITYCONTAINER_H_ #define ENTITIES_ENTITYCONTAINER_H_ #include <boost/multi_index_container.hpp> #include <boost/multi_index/ordered_index.hpp> #include "Entity.h" namespace Entities { struct type{}; struct extractType { typedef const type_info& result_type; result_type operator()(const Entity * r)const // operator() must be const { return typeid(*r); } }; typedef boost::multi_index::multi_index_container< Entity *, boost::multi_index::indexed_by< boost::multi_index::ordered_non_unique<boost::multi_index::tag<type>, extractType> > > EntityContainer; }; #endif

2 2

warning C4005: 'AF_IPX' : macro redefinition" +"ws2def.h" (converting from MS 6.0 to MS 2008 (9.0))
by Joseph Marks 30 Oct '08

30 Oct '08

RE: http://lists.boost.org/boost-users/2007/11/31965.php I don't see any public answer to this. What is the best solution. On another site, someone recommended: #define WIN32_LEAN_AND_MEAN And/or #define _WINSOCKAPI_ However, this solution did not work for me. Has anyone solved this problem? Thanks in Advance, Joseph [brand new to this list] The preceding e-mail message (including any attachments) contains information that may be confidential, or constitute non-public information. It is intended only for the designated recipient. If you are not the named addressee, you should not disseminate, distribute or copy this e-mail. If you have received this e-mail by mistake, please notify the sender immediately by replying to this message and delete this e-mail from your system. Use, dissemination, distribution or reproduction of this message by unintended recipients is not authorized and may be unlawful.

1 0

Problem linking boost filesystem 1_36_0 on ubuntu gcc 4.2
by Kevin Stevens 30 Oct '08

30 Oct '08

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

non-greedy regex
by Jeff Anderson 30 Oct '08

30 Oct '08

Hello, I'm using boost's regex for a school project (they encourage us to use boost) Boost 1.34 is what is available on the school computers (unless fedora 9 promotes a newer version out of testing before Tuesday.) I'm trying to use a non-greedy quantifier in a regex. Here is an example from my code: string input=string("/blog/2008/../"); string expr=string("/.*?/\\.\\./"); string replacement=string("/"); std::ostringstream stream(std::ios::out | std::ios::binary); std::ostream_iterator<char, char> stream_iterator(stream); boost::regex pattern(expr, boost::regex::perl); boost::regex_replace(stream_iterator, input.begin(), input.end(), pattern, replacement, boost::match_default | boost::format_all); string result=stream.str(); The expected output is "/blog/". I am getting "/". I've played with different arguments to the boost::regex constructor, but I can't seem to get it to output a correct result. I did notice that in the notes for the boost regex library in 1.34 that there was a bug fixed related to non-greedy quantifiers, so I'm fairly confident that I just have a problem with my own code. A tarball can be provided with a "ready-to-compile" example snippet and test case. Then again, it could just as likely be a problem with the regular expression itself, though I checked, re-checked, and double checked that this is the correct syntax for the perl mode in the boost regex library. Thanks for any input! Jeff Anderson

2 2

boost + stlport : Failed to specialize function template
by gatotkaca 30 Oct '08

30 Oct '08

Hello! I'm trying to compile following code (msvc8 + boost1.36.0 + stlport5.1.7) #include <boost/range/size.hpp> #include <iostream> #include <vector> template< class InputRng, class T > inline T accumulate( const InputRng& r, T init ) { return std::accumulate( boost::begin(r), boost::end(r), init ); } template <typename Range> typename boost::range_iterator<Range>::type::value_type mean(const Range &range, typename boost::range_iterator<Range>::type::value_type init= #ifndef BOOST_MSVC typename #endif boost::range_iterator<Range>::type::value_type()) { return typename boost::range_iterator<Range>::type::value_type( boost::accumulate(range, init)/boost::size(range)); } int main(){ std::cout << "test" << std::endl; std::vector<double> data; data.push_back(1); data.push_back(2); data.push_back(3); double m = mean(data); std::cout << m << std::endl; return 0; } It keeps giving me: error C2893: Failed to specialize function template 'boost::range_iterator<C>::type::value_type mean(const Range &,boost::range_iterator<C>::type::value_type)' ..\my works\misc\mean_range_test\testapp.cpp 35 BUT, if I remove the dependency to the STLport (and use MSVC's STL), it works fine! Unfortunately, I need this STLport to work on. I really appreciate for any helps. Thank you! Best, Dio -- View this message in context: http://www.nabble.com/boost-%2B-stlport-%3A-Failed-to-specialize-function-t… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Installing Boost.MPI [bjam]
by Raymond Wan 30 Oct '08

30 Oct '08

Hi all, I need some help with building Boost.MPI. My system is a Debian testing (lenny) system and I'm following the instructions at [lenny uses 1.35 and not 1.36]: http://www.boost.org/doc/libs/1_35_0/doc/html/mpi/getting_started.html I'm using Open MPI and I can compile and run the test implementation fine (mpi-test.cpp). So, I moved to the next step on configuring and building. My bjam is 3.1.16. I copied user-config.jam to my home directory, with the line "using mpi ;" added at the end. Then, I ran "bjam --with-mpi" in the "top-level Boost directory" [*] and I get this error: error: no Jamfile in current directory found, and no target references specified. Firstly, I'm not sure if I have everything installed... But I also don't know what the "top-level Boost directory" is. I've tried these locations: /usr/share/boost-build/ /usr/share/boost-build/build/ /usr/share/boost-build/tools/ [it had an mpi.jam file in it] /usr/include/boost/ And also replaced "using mpi ;" with "using mpi : /usr/bin/mpic++ ;". I'm currently trying this as root user, so I don't think root privileges is the problem. (bjam came with a "Hello World" example and that compiled fine; so I don't think it's something wrong with bjam.) Any help would be appreciated... Thanks! Ray

2 4

bind for_each and a range of functors
by Michael Marcin 30 Oct '08

30 Oct '08

Let's say I have a std::list of a functor with a member function virtual operator()( int, int ) Is there an easy way to call each function in this list using for_each? Intuitively I'd expect to be able to do something like: void call_each( std::list<functor>& l ) { std::for_each( l.begin(), l.end(), boost::bind(_1,5,20) ); } Thanks -- Michael Marcin

4 5

Question about Protocols and boost::asio::ip::tcp::iostream
by Charles Milutinovic 30 Oct '08

30 Oct '08

I am trying to put together a program that needs a very simple networking component, esentially just dumping a lot of data from iostreams into a socket, unformatted, and tcp::iostream looked perfect for it. I have a question about its usage though. Every example I've seen looks something like tcp::iostream s("server", "protocol"). So far I've seen "http" and "daytime" as protocols. I am wondering exactly where these constants are defined. Also, for my purposes, how hard would it be to extend a previously defined protocol (i.e. telnet) since all I really need to do is connect to a port of my choosing and dump data.

2 1

tellg() not working for boost::iostreams::filtering_istream
by Roland Bock 30 Oct '08

30 Oct '08

Hi, tellg() member function is not working for boost::iostreams::filtering_istream (see attached example). Is this a bug or a necessity? Regards, Roland

1 0

[serialization] Assertion failure with shared_ptr cycles
by Ult Mundane 30 Oct '08

30 Oct '08

Hi, I'm hitting an assert when I deserialize cycles of shared_ptr<>s. I have the following class hierarchy: Base <-- Derived Other Derived holds a shared_ptr<Other>, and Other holds a shared_ptr<Base>. I have an instance of Derived that points to an instance of Other, which in turn points back to the Derived instance (as a Base pointer). The serialization goes as expected. On deserialization, however, the Base::serialize() and Derived::serialize() are called repeatedly, crashing after the third time -- Other::serialize() is never called. This problem only happens when the cycle includes a pointer to a base class -- a straightforward a -> b -> a cycle works as expected. Has anyone else experienced this or found a workaround? It happens in both boost 1.36 and 1.37.0 beta1. I'm using gcc (3.3.5, 3.4.6, and 4.3.2). Thanks, Ult P.S. Attached is the source code illustrating the above example. Here is the output: Serializing... Derived Base Base done Other Other done Derived done Deserializing... Derived Base Base done Derived Base Base done Derived cycles: ./boost_1_37_0_beta1/libs/serialization/src/basic_iarchive.cpp:436: const boost::archive::detail::basic_pointer_iserializer* boost::archive::detail::basic_iarchive_impl::load_pointer(boost::archive::detail::basic_iarchive&, void*&, const boost::archive::detail::basic_pointer_iserializer*, const boost::archive::detail::basic_pointer_iserializer* (*)(const boost::serialization::extended_type_info&)): Assertion `new_cid == cid' failed. Aborted #include <fstream> #include <iostream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/shared_ptr.hpp> #include <boost/serialization/is_abstract.hpp> #include <boost/serialization/export.hpp> // Forward declarations class Base; class Derived; class Other; typedef boost::shared_ptr<Base> BaseRef; typedef boost::shared_ptr<Derived> DerivedRef; typedef boost::shared_ptr<Other> OtherRef; // For debug output struct Debug { Debug(const char * name) : mName(name) { std::cout << std::string(++sIndentLevel, ' ') << mName << std::endl; } ~Debug() { std::cout << std::string(sIndentLevel--, ' ') << mName << " done" << std::endl; } static int sIndentLevel; char const * mName; }; int Debug::sIndentLevel = 0; // Base class Base { public: virtual ~Base() { } template<class Archive> void serialize(Archive & ar, const unsigned int) { Debug d("Base"); } }; // Derived class Derived : public Base { public: void setOther(OtherRef other) { mOther = other; } template<class Archive> void serialize(Archive & ar, const unsigned int) { Debug d("Derived"); ar & boost::serialization::base_object<Base>(*this); // This line is executed three times before a crash on deserialzation ar & mOther; // Code after here is never executed on deserialization } OtherRef mOther; }; // Other class Other { public: void setBase(BaseRef base) { mBase = base; } template<class Archive> void serialize(Archive & ar, const unsigned int) { Debug d("Other"); ar & mBase; } BaseRef mBase; }; BOOST_CLASS_EXPORT(Derived); // main int main(int /* argc */, char * /* argv */[]) { char const * fname = "cycles.text_archive"; std::cout << std::endl << "Serializing..." << std::endl << std::endl; { DerivedRef derived(new Derived()); OtherRef other(new Other()); derived->setOther(other); other->setBase(derived); std::ofstream ofs(fname, std::ios::out | std::ios::binary); boost::archive::text_oarchive oa(ofs); oa & derived; } std::cout << std::endl << "Deserializing..." << std::endl << std::endl; { Derived derivedCopy; std::ifstream ifs(fname, std::ios::in | std::ios::binary); boost::archive::text_iarchive ia(ifs); ia & derivedCopy; } }

2 1

Bug or feature? date_time::microseconds limitations?
by athor 30 Oct '08

30 Oct '08

The boost::date_time::microseconds(...) constructor overflows the int64 size limits in intermediary calculations. The code below will reproduce the error (using VC++ 2008 and boost 1.36). ptime start(boost::gregorian::date(2000, 1, 1)); ptime end(boost::gregorian::date(2000, 5, 1)); time_duration td = end - start; ptime wrongEnd = start + microseconds(td.total_microseconds()); BOOST_CHECK_EQUAL(end, wrongEnd); The microseconds constructor takes an int64 as input and the total_microseconds is well within its range. Inside the date_time::subsecond_duration<time_duration, 1000000> the internal duration is calculated as ss*traits_type::res_adjust()/frac_of_second Since the both res_adjust() and frac_of_second have the value 1000000, the result should be ss*1 but... the intermediary value ss*res_adjust overflows the int64 causing a negative number to be returned. Question is, is this by design or is it a bug? I'm rather new to boost::date_time and was hoping to replace our current datetime types with it. We are using millisecond timestamped data over long time series (years). I guess the simple solution would be to add parentheses around (res_adjust()/frac_of_second) assuming frac_of_second always divides res_adjust. However, there are similar issues when adding 200 years worth of seconds which overflows the int32 argument (but that's not of my immediate concern). -- View this message in context: http://www.nabble.com/Bug-or-feature--date_time%3A%3Amicroseconds-limitatio… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

boost.python / bjam
by Mark Williams 30 Oct '08

30 Oct '08

Hi, is it possible to build boost.python such that the python version gets embedded in the .so name along with the compiler name, version, multithread flags, etc? For example, "libboost_python25-gcc41-mt-1_35.so" instead of "libboost_python-gcc41-mt-1_35.so" Alternatively, is it possible to build it without the embedded SONAME so that it can be renamed afterwards? Thanks in advance, Mark

2 1

Using Asio's ICMP support
by David Smith 30 Oct '08

30 Oct '08

Hi, Sorry if this is a silly question, but in Asio's ICMP support, what portion of an ICMP packet will an application supply when sending? What portion of an ICMP packet will an application retrieve when receiving? I get the impression that the whole body of the ICMP packet is supplied/retrieved (only an IP header with the ICMP protocol is prefixed). Is that the right impression? Thanks, David

1 0

Please define _WIN32_WINNT or _WIN32_WINDOWS appropriately
by Jean-Sebastien Stoezel 30 Oct '08

30 Oct '08

Hi, I am compiling Boot 1_35_0 with Visual Studio 2008 under Windows XP, and at compile time I get the following message: Please define _WIN32_WINNT or _WIN32_WINDOWS appropriately Assuming _WIN32_WINNT=0x0501 (i.e. Windows XP target) Following the advice, I then defined the following macro: _WIN32_WINNT=0x0501 However now I get the following errors: d:\program files\microsoft visual studio 9.0\vc\atlmfc\include\afxdlgs.h(235) : error C2504: 'IFileDialogEvents' : base class undefined d:\program files\microsoft visual studio 9.0\vc\atlmfc\include\afxdlgs.h(244) : error C2061: syntax error : identifier 'FDE_SHAREVIOLATION_RESPONSE' d:\program files\microsoft visual studio 9.0\vc\atlmfc\include\afxdlgs.h(246) : error C2061: syntax error : identifier 'FDE_OVERWRITE_RESPONSE' d:\program files\microsoft visual studio 9.0\vc\atlmfc\include\afxdlgs.h(249) : error C2504: 'IFileDialogControlEvents' : base class undefined What macros do really need to be defined? What values should be assigned for Windows XP? Thanks, Jean

4 8

mutex Locks!
by Wesley Khandavalli 29 Oct '08

29 Oct '08

Dear all, i am new to threading. i want to know the following. Given a shared object which is accessed by more than one process, where should we implement the mutex locking? Is it in the shared object or in the critical section of the Processes? If locking is done in process, will it work having different names for the locks in the processes? class A { .......... ........ public: execute() { ......... lock(mutex1) //write data to shared object unlock(mutex1) ......... } }; class B { .......... ........ public: execute() { ......... lock(mutex2) //write data to shared object unlock(mutex2) ......... } }; SharedObject { ........... .......... }; -- Wesley K

2 1

compile problem?
by Wenhao Xu 29 Oct '08

29 Oct '08

Hi everyone, I am a new to boost. When I compile the example of asio_timer, I have a compile error: " g++ -o test_timer test_timer.cpp -I /peter/boost/boost_1_36_0 -lboost_thread-gcc42-mt-1_36 -lboost_system-gcc42-mt-1_36 In file included from /usr/include/c++/4.2/iostream:44, from test_timer.cpp:11: /usr/include/c++/4.2/i486-linux-gnu/bits/c++config.h:149: error: expected constructor, destructor, or type conversion before ‘namespace’ Compilation exited abnormally with code 1 at Tue Oct 28 00:04:58" My compile command is: g++ -o test_timer test_timer.cpp -I /peter/boost/boost_1_36_0 -lboost_thread-gcc42-mt-1_36 -lboost_system-gcc42-mt-1_36 I cannot find the reason. Could you help me? Thanks very much. Best wishes, Wenhao // // time_t_timer.cpp // ~~~~~~~~~~~~~~~~ // // Copyright (c) 2003-2008 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // #include <boost/asio.hpp> #include <ctime> #include <iostream> struct time_t_traits { // The time type. typedef std::time_t time_type; // The duration type. struct duration_type { duration_type() : value(0) {} duration_type(std::time_t v) : value(v) {} std::time_t value; }; // Get the current time. static time_type now() { return std::time(0); } // Add a duration to a time. static time_type add(const time_type& t, const duration_type& d) { return t + d.value; } // Subtract one time from another. static duration_type subtract(const time_type& t1, const time_type& t2) { return duration_type(t1 - t2); } // Test whether one time is less than another. static bool less_than(const time_type& t1, const time_type& t2) { return t1 < t2; } // Convert to POSIX duration type. static boost::posix_time::time_duration to_posix_duration( const duration_type& d) { return boost::posix_time::seconds(d.value); } }; typedef boost::asio::basic_deadline_timer< std::time_t, time_t_traits> time_t_timer; void handle_timeout(const boost::system::error_code&) { std::cout << "handle_timeout\n"; } int main() { try { boost::asio::io_service io_service; time_t_timer timer(io_service); timer.expires_from_now(5); std::cout << "Starting synchronous wait\n"; timer.wait(); std::cout << "Finished synchronous wait\n"; timer.expires_from_now(5); std::cout << "Starting asynchronous wait\n"; timer.async_wait(handle_timeout); io_service.run(); std::cout << "Finished asynchronous wait\n"; } catch (std::exception& e) { std::cout << "Exception: " << e.what() << "\n"; } return 0; }

2 1

program_options: one-of-set option format
by Ivan Godard 29 Oct '08

29 Oct '08

The boost::program_options library appears to lack the capability for one-of-set options, i.e. one of -a, -b, or -c, but not more than one, returned as an enumeration value in a common result for all the options. Currently I have a function: template<typename T> options_description& oneOf(options_description& od, std::vector<std::string>& names, T& t); which adds options for all the names to "od", with notifiers that update "t" with the "T" enumeration value corresponding to the particular option that the parser finds present using the ordinal position in "names" as a value. However, this is somewhat unsatisfying because detected errors (missing or too many choices) don't feed into the program_options reporting system. It also does not fit with the rather nice syntax used by the program_options library for option declarations. I also looked at using an external parser as supported by program_options, but this seems low-level overkill - you get a raw string to parse, but none of the nice facilities for abbreviation, long or short forms, etc. are usable. Lastly, I considered adding the capability as a native feature of program_options, but while the library is reasonably clean it doesn't seem to be designed to support any inter-option linkages as required for reporting the result and verifying that only one of the set was present. So the question for this list: am I reinventing the wheel here and this oneOf capability already exists somewhere? If not, is there a better approach than my present purely extra-library solution? Thank you Ivan

3 2

boost bind conflicting with socket bind
by Sharad Mittal 29 Oct '08

29 Oct '08

Hello, My Socket code that contains call to "bind" to a port is conflicting with boost::bind in 1.36. It compiles fine under boost 1.34 and 1.35. Interestingly, nothing is included from boost in that file. I am using boost with mingw on Win Xp. The code snippet is as follows: int Socket::BindPort(int family, int address, int port) { sockaddr_in sa; int dwError = RERROR_SUCCESS; memset(&sa, 0, sizeof(sa)); sa.sin_family = family; sa.sin_addr.s_addr = address; sa.sin_port = htons(port); if (bind(s_, (sockaddr *)&sa, sizeof(sockaddr_in)) == SOCKET_ERROR) { dwError = RERROR_SOCKET_BIND_ERROR; LOG (LOG_ERR, "Could not bind socket to port %u", port); BAIL_ON_ERROR (dwError); } error: return dwError; } Here is what I am getting... [g++] [Socket.o]<-[Socket.cpp] E:/msys/1.0/boost/boost_1_36_0/boost/bind.hpp: In instantiation of `boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>': E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:15: instantiated from `boost::_bi::bind_t<boost::_bi::unspecified, unsigned int, boost::_bi::list2<boost::_bi::value<sockaddr*>, boost::_bi::value<unsigned int> > >' Socket.cpp:98: instantiated from here E:/msys/1.0/boost/boost_1_36_0/boost/bind.hpp:67: error: `unsigned int' is not a class, struct, or union type E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp: In instantiation of `boost::_bi::bind_t<boost::_bi::unspecified, unsigned int, boost::_bi::list2<boost::_bi::value<sockaddr*>, boost::_bi::value<unsigned int> > >': Socket.cpp:98: instantiated from here E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:15: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>' E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:18: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>' E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:24: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>' E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:30: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>' E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:36: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>' E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:45: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>' E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:51: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>' E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:59: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>' E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:65: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>' E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:74: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>' E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:80: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>' E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:87: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>' E:/msys/1.0/boost/boost_1_36_0/boost/bind/bind_template.hpp:93: error: no type named `type' in `struct boost::_bi::result_traits<boost::_bi::unspecified, unsigned int>'

2 1

[Serialization] Runtime checking of types in deserialization
by Frank Winklmeier 29 Oct '08

29 Oct '08

Hi, is there any way to check whether the class type used in deserialization is identical to the class type in the serialization? Below is a simple example, that serializes class "Data" into a text archive and deserializes this archive into class "StringData". If that happens I would like an exception to be thrown. Is this possible? Thanks for any help, Frank #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <iostream> #include <sstream> using namespace std; class Data { public: Data() { for (int i=0; i<100; i++) a[i]=i; }; int a[100]; template<class Archive> void serialize(Archive & ar, const unsigned int) { ar & a; } }; class StringData { public: StringData() {}; string s; template<class Archive> void serialize(Archive & ar, const unsigned int) { ar & s; } }; int main() { ostringstream oss; // Serialize the class const Data d1; { boost::archive::text_oarchive oa(oss); oa << d1; } // Deserialize it using the wrong type StringData d2; { istringstream iss(oss.str()); boost::archive::text_iarchive ia(iss); ia >> d2; } cout << oss.str() << endl; cout << d2.s << endl; } Output: ======= 22 serialization::archive 4 0 0 100 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

2 3

Compiling boost 1.35.0 on ppc64 suse linux
by Karthik Channakeshava 29 Oct '08

29 Oct '08

Hi, I am not able to compile a 64bit version of boost on a ppc64 bit machine with suse linux on it. Can you please point me to some information on this? Thanks in advance, Karthik

1 0

[boost.asio] reading data from serial port [newbie]
by Wojciech L.Jędruch 29 Oct '08

29 Oct '08

Hi Its my first cpp application with boost libs, therefore im asking for some help : The code is written In VS2008 and looks like this : include "stdafx.h" #include <iostream> #include <boost/asio.hpp> #include <boost/asio/serial_port.hpp> #include <boost/thread.hpp> #include <boost/system/error_code.hpp> #include <boost/system/system_error.hpp> #include <boost/bind.hpp> void handler( const boost::system::error_code& error)// Result of operation. //std::size_t bytes_transferred // Number of bytes read. { std::cout << "read" << std::endl; } int _tmain(int argc, _TCHAR* argv[]) { using namespace std; using namespace boost; char read_msg_[512]; /* All programs that use asio need to have at least one boost::asio::io_service object. */ /* This class provides access to I/O functionality. */ /* We declare an object of this type first thing in the main function. */ boost::asio::io_service io; asio::serial_port(io,"COM7"); boost::asio::serial_port::async_read_some(boost::asio::buffer(read_msg_,512) ,handler); return 0; } In line: boost::asio::serial_port::async_read_some(boost::asio::buffer(read_msg_,512) ,handler); Im getting compiler error : 1>c:\praca\visual\projekty\refernecje\refernecje\refernecje.cpp(32) : error C2352: 'boost::asio::basic_serial_port<>::async_read_some' : illegal call of non-static member function 1> c:\program files\boost\boost_1_36_0\boost\asio\basic_serial_port.hpp(595) : see declaration of 'boost::asio::basic_serial_port<>::async_read_some' Can You please explain me what is wrong ? the code is similar to that provided by boost serial port reading example. Thx in advance for help

2 1

Factory pattern ?
by Olivier Tournaire 29 Oct '08

29 Oct '08

Hi all, I am wondering if a factory exists in boost. Any answer ? Best regards, Olivier

5 9

Re: [Boost-users] boost graph library with gcc 4.2 and later (Andrew Sutton)
by Moti Freiman 29 Oct '08

29 Oct '08

Hi, Below is the details of my problem: gcc version and system: g++ (Debian 4.3.1-9) 4.3.1 I tried to compile the graph example (boost/libs/graph/example/graph.cpp) using the following command: g++ -Wall -I /cs/phd/freiman/include/boost_1_36_0 graph.cpp -o graph and got the following message about deprecated headers: ---------------------------------------- OUTPUT ------------------------------------------------- In file included from /usr/include/c++/4.3/backward/hash_set:64, from /cs/phd/freiman/include/boost_1_36_0/boost/graph/adjacency_list.hpp:22, from graph.cpp:15: /usr/include/c++/4.3/backward/backward_warning.h:33:2: warning: #warning This file includes at least one deprecated or antiquated header which may be removed without further notice at a future date. Please use a non-deprecated interface with equivalent functionality instead. For a listing of replacement headers and interfaces, consult the file backward_warning.h. To disable this warning use -Wno-deprecated. ---------------------------------------- END OF OUTPUT -------------------------------------------------- The running of this file was o.k. When I tried to compile the kolmogorov max-flow example (boost/libs/graph/example/kolmogorov-eg.cpp) using the following command: g++ -Wall -I /cs/phd/freiman/include/boost_1_36_0 kolmogorov-eg.cpp -o kolmogorov-eg I got the following: -------------------------------------- OUTPUT ------------------------------------------------------ In file included from /usr/include/c++/4.3/backward/hash_set:64, from /cs/phd/freiman/include/boost_1_36_0/boost/graph/adjacency_list.hpp:22, from kolmogorov-eg.cpp:36: /usr/include/c++/4.3/backward/backward_warning.h:33:2: warning: #warning This file includes at least one deprecated or antiquated header which may be removed without further notice at a future date. Please use a non-deprecated interface with equivalent functionality instead. For a listing of replacement headers and interfaces, consult the file backward_warning.h. To disable this warning use -Wno-deprecated. In file included from kolmogorov-eg.cpp:37: /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp: In function 'int boost::read_dimacs_max_flow(Graph&, CapacityMap, ReverseEdgeMap, typename boost::graph_traits<G>::vertex_descriptor&, typename boost::graph_traits<G>::vertex_descriptor&, std::istream&)': /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:140: error: there are no arguments to 'strcmp' that depend on a template parameter, so a declaration of 'strcmp' must be available /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:140: error: (if you use '-fpermissive', G++ will accept your code, but allowing the use of an undeclared name is deprecated) /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp: In function 'int boost::read_dimacs_max_flow(Graph&, CapacityMap, ReverseEdgeMap, typename boost::graph_traits<G>::vertex_descriptor&, typename boost::graph_traits<G>::vertex_descriptor&, std::istream&) [with Graph = main()::Graph, CapacityMap = boost::adj_list_edge_property_map<boost::directed_tag, long int, long int&, unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, boost::no_property> > >, boost::edge_capacity_t>, ReverseEdgeMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>&, unsigned int, boost::property<boost::edge_capacity_t, long int, boost::property<boost::edge_residual_capacity_t, long int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, boost::no_property> > >, boost::edge_reverse_t>]': kolmogorov-eg.cpp:93: instantiated from here /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:105: warning: deprecated conversion from string constant to 'char*' kolmogorov-eg.cpp:93: instantiated from here /cs/phd/freiman/include/boost_1_36_0/boost/graph/read_dimacs.hpp:140: error: 'strcmp' was not declared in this scope ------------------------------------ END OF OUTPUT ------------------------------------------------ which has error due to the strcmp function in line 140 in the file: read_dimacs.hpp I added the required header file (string.h) and only the warnings remain. When I tried to run this example using the following command: kolmogorov-eg < max_flow.dat I got a segmentation fault: I tried to understand where the seg. fault came from using valgrind and it runs without seg. fault but with many "invalid read" errors, that seems to come from the file read_dimacs.hpp, line 118 Using the same code with WinXP and visual studio 2003, yields no problems. Any idea? Thanks, Moti > Date: Tue, 28 Oct 2008 18:50:48 -0400 > From: "Andrew Sutton" <andrew.n.sutton(a)gmail.com> > Subject: Re: [Boost-users] boost graph library with gcc 4.2 and later > To: boost-users(a)lists.boost.org > Message-ID: > <ab7a64130810281550p9237088u1baa08fdd9160e1a(a)mail.gmail.com> > Content-Type: text/plain; charset="iso-8859-1" > > > > > I'm a newbie to boost and have a storng interest in the graph algorithms > in > > boost. > > > I tried to run both kolmogorov and edmund-karp examples and got many > > warnings due to deprecated conversions in the read_dimacs function > > When I tried to run these examples I got segmentation faults. > > Other simple program (from boost homepage) that I tried to compile and > run, > > run well. > > Is there any known issue about using boost with gcc 4 and later? > > > > You need to be more specific about the errors system that you're building > for and the errors that you're getting. Which version of Boost? Which > compiler (very specifically)? What are the warnings? Can you tell what's > causing the error? > > Andrew Sutton > andrew.n.sutton(a)gmail.com > -- __ Moti Freiman, Ph.D Student. Medical Image Processing and Computer-Assisted Surgery Laboratory. School of Computer Science and Engineering. The Hebrew University of Jerusalem Givat Ram, Jerusalem 91904, Israel Phone: +(972)-2-658-5371 (laboratory) WWW site: http://www.cs.huji.ac.il/~freiman

4 3

Boost.Date_Time Enhancement - Load of Time Zone Database via istream
by Sönke Schau 29 Oct '08

29 Oct '08

Hello, in Boost.Date_Time there is a function to load the Time Zone Database from a File. The function load_from_file takes a string as parameter which contains a local filename to load the Database from. It is sometimes desirable to load the Database from another source than a local file. To support this i suppose to add a function load and alter the existing load_from_file in the following sense void load( std::istream& ifs ) { string_type in_str; std::string buff; if(!ifs){ throw data_not_accessible(); } std::getline(ifs, buff); // first line is column headings while( std::getline(ifs, buff)) { parse_string(buff); } } void load_from_file(const std::string& pathspec) { std::ifstream ifs(pathspec.c_str()); if(!ifs){ throw data_not_accessible(pathspec); } load( ifs ); } BTW: The documentation local_time.html incorrectly states that load_from_file returns a boolean. Best regards Sönke Schau

1 0

[serialization]
by Mojmir Svoboda 29 Oct '08

29 Oct '08

hello, i wonder: how do you serialize thing like struct foo { unsigned bar : 3; }; ? i cannot take a !const reference to a bitfield, so i have to go another way round. what is the best way, please? many thanks, mojmir

1 0

Re: [Boost-users] linking to boost signal library
by Raphael 29 Oct '08

29 Oct '08

I'm having exactly the same problem. I'm trying to include boost libraries signals and regex into a 64 bit project. I guess the answer is, that the downloaded libraries are not compatible for 64 bit builds, therefore the linker errors. I believe you need to compile 64 bit versions of the libraries, but I'm new to boost myself... Actually thats what I'm working on right now. Jürgen Waser wrote: > > I'm trying to incorporate BOOST signals into my vc8 project. > I have built the dynamic libraries with the installer and set the > project dependencies accordingly. > I have written the simplest signal test code possible. > The project compiles, but when linking I get the following error: > -- View this message in context: http://www.nabble.com/linking-to-boost-signal-library-tp20213397p20223456.h… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

cmake on windows
by Emre Turkay 29 Oct '08

29 Oct '08

Hi folks, I'm trying to compile boost with cmake and MS Visual Studio 2003 on Windows. However, when I run the cmake tool I get: CMake Error at C:/Program Files/CMake 2.6/share/cmake-2.6/Modules/FindBoost.cmak e:620 (message): Unable to find the requested Boost libraries. Boost version: 1.35.0 Boost include path: C:/Program Files/boost/boost_1_35_0 The following Boost libraries could not be found: boost_signals No Boost libraries were found. You may need to set Boost_LIBRARYDIR to the directory containing Boost libraries or BOOST_ROOT to the location of Boost. Call Stack (most recent call first): CMakeLists.txt:27 (FIND_PACKAGE) -- Configuring incomplete, errors occurred! ------------------------------------------------------------------------------ The "c:/Program Files/boost/boost_1_35_0" path is correct and I have: libboost_signals-vc71-mt-1_35.lib libboost_signals-vc71-mt-gd-1_35.lib libboost_signals-vc71-mt-s-1_35.lib libboost_signals-vc71-mt-sgd-1_35.lib libboost_signals-vc71-s-1_35.lib libboost_signals-vc71-sgd-1_35.lib libboost_signals-vc80-mt-1_35.lib libboost_signals-vc80-mt-gd-1_35.lib libboost_signals-vc80-mt-s-1_35.lib libboost_signals-vc80-mt-sgd-1_35.lib libboost_signals-vc80-s-1_35.lib libboost_signals-vc80-sgd-1_35.lib libboost_signals-vc90-mt-1_35.lib libboost_signals-vc90-mt-gd-1_35.lib libboost_signals-vc90-mt-s-1_35.lib libboost_signals-vc90-mt-sgd-1_35.lib libboost_signals-vc90-s-1_35.lib libboost_signals-vc90-sgd-1_35.lib files in the "c:/Program Files/boost/boost_1_35_0/lib" path. Here is my CMakeLists file: ---------------------------- CMAKE_MINIMUM_REQUIRED(VERSION 2.6) PROJECT(test) SET(TEST_SRCS ../../Application/display_controller.cpp ../../Application/GUI.cpp ../../Application/joystick_controller.cpp ../../Application/keyboard_controller.cpp main.cpp ) SET(TEST_MOC_HDRS ../../Application/GUI.h ) SET(TEST_UIS ../../Application/GUI.ui ) SET(TEST_RCS ../../Application/GUI.qrc ) ADD_DEFINITIONS(-Wall) FIND_PACKAGE(Qt4 REQUIRED) FIND_PACKAGE(Boost REQUIRED COMPONENTS signals) IF (Boost_FOUND) INCLUDE_DIRECTORIES(${Boost_INCLUDE_DIRS}) LINK_DRIECTORIES(${Boost_LIBRARY_DIRS}) ADD_DEFINITIONS(${Boost_LIB_DIAGNOSTIC_DEFINITIONS}) ENDIF (Boost_FOUND) INCLUDE( ${QT_USE_FILE} ) QT4_ADD_RESOURCES( TEST_RC_SRCS ${TEST_RCS} ) QT4_WRAP_UI( TEST_UI_HDRS ${TEST_UIS} ) QT4_WRAP_CPP( TEST_MOC_SRCS ${TEST_MOC_HDRS} ) INCLUDE_DIRECTORIES( ${CMAKE_BINARY_DIR} ) ADD_EXECUTABLE( test ${TEST_SRCS} ${TEST_MOC_SRCS} ${TEST_RC_SRCS} ${TEST_UI_HDRS} ) TARGET_LINK_LIBRARIES(test ${QT_LIBRARIES} ${Boost_LIBRARIES}) ---------------------------- and the cmake version is "2.6-patch 2". More, this file works in ubuntu smoothly. Does someone have any idea on what may be wrong? Thanks, Emre Turkay

2 1

creating cd... or set def... with boost "filesystem"
by M 29 Oct '08

29 Oct '08

hello all --------- there is a need to creating "cd..." or "set def..." with boost "filesystem" and make it transparent to windows\linux. there is a need to create one line of "filesystem" command. i don't know if there is a "wish list" or "to do list for a future version" - but it is needed - and sooner the better. today we have (for windows): -------------------------------------------------------------------------------------------------------------------- #include "stdafx.h" #include <stdio.h> #include <windows.h> #include <string> using namespace std; #include <atlstr.h> int main(void) { FILE *fp; CString dir = L"D:/schmidt26_cpp/mpi/debug"; // construct from a LPCWSTR //Set the current directory. SetCurrentDirectory( dir ); fp = _popen("DIR", "r"); if (fp != NULL) { char buffer[BUFSIZ]; while (fgets(buffer, sizeof buffer, fp) != NULL) fputs(buffer, stdout); } return 0; } -------------------------------------------------------------------------------------------------------------------- and for linux (posix): #include<stdio.h> #include <unistd.h> int main() { // D:\schmidt26_cpp\mpi\debug if(chdir("/home/kot/Desktop") != -1) printf("Successfully changed directory to Desktop!\n"); else printf("Error changing directory!\n"); /* if(fork()) execl("/usr/bin/xterm", "-e", "/usr/bin/emacs", (char*)0); else printf("Close the pop-up window first!\n"); wait(NULL); */ return 0; } -------------------------------------------------------------------------------------------------------------------- thank's all.

2 1

Generic Image Library and premultiplied RGBA
by David Warkentin 28 Oct '08

28 Oct '08

I am trying to take advantage of the convolution capabilities of the GIL (with the numeric extension of course). I have some text that I render first using Cairo and then I pass the raw image data along to the code I'm using with the GIL with some simple glue code. This much of my code works great - I can write out a PNG using png_write_view after handing the data off to the library and it contains the rendered text as I would expect. There is a problem I've encountered, however, where the anti-aliasing pixels of the white text I have rendered against a transparent background appear dark and the blurred part of the text after convolving the image is also dark. I'm pretty sure this is due to the fact that the raw RGBA data I pass along already contains premultiplied alpha from Cairo. I'm guessing that the data is treated as if the alpha has not been premultiplied. I've been trying to figure out the best way to handle this situation and have had very little success in getting anything to work. I have recently been attempting to try one of the 2 things listed in this mailing list post by Lubomir Bourdev where he gives an example of approaches one could take to handle premultiplied RGBA data: http://lists.boost.org/Archives/boost/2006/10/112532.php. No matter what I try, however, I just keep getting endless compile errors and am probably going about it all wrong. Right now I've been trying to do something where I create types to represent premultiplied RGBA data: namespace boost { namespace gil { struct premultiplied_rgba_t : public rgba_t {}; typedef layout<premultiplied_rgba_t> premultiplied_layout_t; typedef pixel<bits8, premultiplied_layout_t> premultiplied_pixel_t; typedef image<premultiplied_pixel_t, false> premultiplied_image_t; } } ...so far this has just resulted in compile errors and I can't even begin to work on any kind of custom color conversion sort of thing that uses this new type yet (though actually I tried to once and couldn't make it work either). I'm guessing that what I need to do is either unmultiply the RGBA data first or I need to somehow get the library to work correctly with the premultiplied data. Can anyone help me figure out how to make this work? David Warkentin

1 0

boost graph library with gcc 4.2 and later
by Moti Freiman 28 Oct '08

28 Oct '08

Hi All, I'm a newbie to boost and have a storng interest in the graph algorithms in boost. I tried to run both kolmogorov and edmund-karp examples and got many warnings due to deprecated conversions in the read_dimacs function When I tried to run these examples I got segmentation faults. Other simple program (from boost homepage) that I tried to compile and run, run well. Is there any known issue about using boost with gcc 4 and later? Thanks, Moti -- __ Moti Freiman, Ph.D Student. Medical Image Processing and Computer-Assisted Surgery Laboratory. School of Computer Science and Engineering. The Hebrew University of Jerusalem Givat Ram, Jerusalem 91904, Israel Phone: +(972)-2-658-5371 (laboratory) WWW site: http://www.cs.huji.ac.il/~freiman

2 1

linking to boost signal library
by Jürgen Waser 28 Oct '08

28 Oct '08

I'm trying to incorporate BOOST signals into my vc8 project. I have built the dynamic libraries with the installer and set the project dependencies accordingly. I have written the simplest signal test code possible. The project compiles, but when linking I get the following error: 1>Linking... 1> Creating library c:\SIM\views\views\x64\Debug\viewsDebugx64.lib and object c:\SIM\views\views\x64\Debug\viewsDebugx64.exp 1>LINK : warning LNK4098: defaultlib 'LIBCMTD' conflicts with use of other libs; use /NODEFAULTLIB:library 1>Test.obj : error LNK2019: unresolved external symbol "public: __cdecl boost::signals::detail::call_notification::~call_notification(void)" (??1call_notification@detail@signals@boost@@QEAA@XZ) referenced in function "public: void __cdecl boost::signal1<void,bool,struct boost::last_value<void>,int,struct std::less<int>,class boost::function<void __cdecl(bool)> >::operator()(bool)" (??R?$signal1@X_NU?$last_value@X@boost@@HU?$less@H@std@@V?$function@$$A6AX_N@Z@2@@boost@@QEAAX_N@Z) 1>Test.obj : error LNK2019: unresolved external symbol "public: class boost::signals::detail::named_slot_map_iterator __cdecl boost::signals::detail::named_slot_map::begin(void)" (?begin@named_slot_map@detail@signals@boost@@QEAA?AVnamed_slot_map_iterator@234@XZ) referenced in function "public: void __cdecl boost::signal1<void,bool,struct boost::last_value<void>,int,struct std::less<int>,class boost::function<void __cdecl(bool)> >::operator()(bool)" (??R?$signal1@X_NU?$last_value@X@boost@@HU?$less@H@std@@V?$function@$$A6AX_N@Z@2@@boost@@QEAAX_N@Z) 1>Test.obj : error LNK2019: unresolved external symbol "public: class boost::signals::detail::named_slot_map_iterator __cdecl boost::signals::detail::named_slot_map::end(void)" (?end@named_slot_map@detail@signals@boost@@QEAA?AVnamed_slot_map_iterator@234@XZ) referenced in function "public: void __cdecl boost::signal1<void,bool,struct boost::last_value<void>,int,struct std::less<int>,class boost::function<void __cdecl(bool)> >::operator()(bool)" (??R?$signal1@X_NU?$last_value@X@boost@@HU?$less@H@std@@V?$function@$$A6AX_N@Z@2@@boost@@QEAAX_N@Z) 1>Test.obj : error LNK2019: unresolved external symbol "public: __cdecl boost::signals::detail::call_notification::call_notification(class boost::shared_ptr<class boost::signals::detail::signal_base_impl> const &)" (??0call_notification@detail@signals@boost@@QEAA@AEBV?$shared_ptr@Vsignal_base_impl@detail@signals@boost@@@3@@Z) referenced in function "public: void __cdecl boost::signal1<void,bool,struct boost::last_value<void>,int,struct std::less<int>,class boost::function<void __cdecl(bool)> >::operator()(bool)" (??R?$signal1@X_NU?$last_value@X@boost@@HU?$less@H@std@@V?$function@$$A6AX_N@Z@2@@boost@@QEAAX_N@Z) 1>c:\SIM\views\views\x64\Debug\viewsDebugx64.dll : fatal error LNK1120: 4 unresolved externals 1>Build log was saved at "file://c:\SIM\views\views\x64\Debug\BuildLog.htm" 1>views - 5 error(s), 1 warning(s) What could I be doing wrong? Thanks, Jurgen

1 0

Building boost_1.34.1 on mac os X 10.5 64 bit.
by Alain Leblanc 28 Oct '08

28 Oct '08

I'm trying to build boost 1.34.1 on mac os X 64-bit. In a previous thread someone(Vladimir Prus) gave the following suggestion: ========================================== You need to pass architecture=x86 address-model=64 in addition to the above to bjam, or you may pass architecture=combined address-model=64 ========================================== and it looks like it was fine with boost 1.36. However when I try with boost 1.34.1 I get the following message: libs/test/src/execution_monitor.cpp:1: error: CPU you selected does not support x86-64 instruction set If I remove the achitecture=x86 option then it compiles, but the resulting libraries are not 64-bit, base on the output from file libbooost-XXX.dylib. Is there anything in the 1.34.1 version preventing me from compiling in 64-bit mode? I'm using gcc 4.0.1. Thanks, Alain

3 8

[multi_index] doing insert() within iteration over equal_range() result?
by Prometheus Prometheus 28 Oct '08

28 Oct '08

Hi all, i have the following problem: i use multi_index like this std::pair<Plugins::pEvents::index::type::iterator,Plugins::pEvents::index::type::iterator> range; range = this->events.get().equal_range(boost::make_tuple(event,condition)); while(range.first!=range.second){ // CALL an event handler! this->callEventHandler(range.first); // << this shows just how it works, its not exactly my code ++range.first; } within the callEventHandler and its called functions its possible that the event handler wants to register new events which results to this: this->events.insert(eventdata); The problem is OR can be, that the insert modifies the indices which modify the range.first iterators and thus a ++range.first results in an invalid "next" element this makes sense and i think most of you know this and had this problem already Questions: Does anyone have a good idea/solution how to solve this situation correctly so that the range i received will be valid? i thought about using a second multi_index which holds the newly inserted events and after the WHILE it gets moved to the original events index, but this solution only moves the problem from one index to the second which helps a bit but doesnt really solve the problem, since i could miss newly inserted events another solution i thought of is like this range = ....equal_range(...) ; while( range.first!=range.second ){ Plugins::Event &ev = (Plugins::Event&)*range.first; // get first event if(ev.alreadycalled == false){ ev.alreadycalled = true; // this element doesnt have an index and so it shouldnt invalidate the iterator/index (right?) callEventHandler(); range= ...equal_range() ; // reinitialize the range and begin to search again! } else{ ++range.first; } } but the above solution gets slower the more events are available thx all _________________________________________________________________ Explore the seven wonders of the world http://search.msn.com/results.aspx?q=7+wonders+world&mkt=en-US&form=QBRE

2 3

Problem calling bellman_ford_shortest_paths
by Tim Keitt 27 Oct '08

27 Oct '08

I'm prototyping some code that exposes an edge_list iterator interface to a database cursor. I've defined a forward_iterator using iterator_facade and can use that to create an edge_list graph. I'm running into a problem however calling bellman_ford_shortest_paths on the graph. I get boost_bellman_ford.cpp:18: error: no matching function for call to 'bellman_ford_shortest_paths(Graph&, position_t&, edge_weight_map, long long int*, double*)' The code leading up to that looks like: position_t N = getNumVertices(); edge_iterator iter; DEBUG_MESSAGE("Contructed iterator"); Graph g(iter, iter.end()); DEBUG_MESSAGE("Constructed edge list graph"); std::vector<double> distance(N, std::numeric_limits<double>::max()); distance[0] = 0.0; std::vector<position_t> parent(N); for ( position_t i = 0; i < N; ++i ) parent[i] = i; boost::bellman_ford_shortest_paths(g, N, edge_weight_map(), &parent[0], &distance[0]); The edge iterator is linked to the database cursor on construction. The problem I am guessing is in how I define the edge_weight_map. It looks like struct edge_weight_map { typedef cost_t value_type; typedef cost_t * reference; typedef edge_t key_type; typedef boost::readable_property_map_tag category; }; boost::property_traits<edge_weight_map>::value_type get(edge_weight_map map, boost::property_traits<edge_weight_map>::key_type key) { return key.cost; } It makes no sense for me to repeatedly query the database for the edge weight, so I attach it as a third field in the edge_descriptor. The get function merely returns the third component of the edge struct. I'm sort of assuming the way I am defining the edge_weight_map is the problem. Any insights? Also, I noticed the simply constructing the edge_list graph traverses the entire iterator range. Is there some copying going on? Can I override this behavior? THK -- Timothy H. Keitt http://www.keittlab.org/

1 0

Reusing IOService Object
by Tim Pynegar 27 Oct '08

27 Oct '08

Hi, I'm having an issue starting then stopping and trying to restart a socket or rather the IOService that's being used to service that socket. The IOService and Socket are member's of my class that has a run method itself that is on a separate thread. In my class constructor the Socket is passed into the IOService constructor. The sequence is as follow's Socket.Open Socket.Bind Socket.async_recieve_from Thread Start ------ IOService.Run Socket.Close IOService.Stop ( the thread terminates due to the IOService.Run method completing ) Socket.Open Socket.Bind Socket.async_recieve_from Thread Start ------ IOService.Run This then return's immediately due to a "stopped" long in IOService ( on windows ) being set to 1. So my question is really am i trying to use these in the wrong way as in should i construct a new Socket and IOService for each time i want to start them or is there some way to reset the IOService to it's original state beyond calling IOService.Stop. Thanks, Tim.

2 1

[test] testing protected/private methods out of test suits
by M. Siebeneicher 27 Oct '08

27 Oct '08

Hello boost-users, I tried to test protected/private class methods by declaring the test-case-class as a friend of the class-to-test. The test-case-class is defined by the macro BOOST_FIXTURE_TEST_CASE(T, F). That works fine as long as I encapsulate the test-case with BOOST_AUTO_TEST_SUITE(suite_name) and BOOST_AUTO_TEST_SUITE_END(). I'm not able to define the correct friend declaration, cause the compiler . Can someone give me hint, please? the code looks like this: // test-case-class.cpp namespace foo { namespace bar { BOOST_AUTO_TEST_SUITE(suite_name) struct F { class-to-test class_to_test_instance; } . . . BOOST_FIXTURE_TEST_CASE(test-case-class, F) { F.class_to_test_instance.i; . . . } . . . BOOST_AUTO_TEST_SUITE_END() }} class-to-test.cpp namespace foo { namespace bar { . . . class class-to-test { public: friend struct test-case-class; // that's wrong // No access to protected member i friend struct suite_name::test-case-class; // this is wrong, too: compiler error, can't find foo::bar::suite_name, .... protected: int i; . . . }; }} greetz, modbom -- GMX startet ShortView.de. Hier findest Du Leute mit Deinen Interessen! Jetzt dabei sein: http://www.shortview.de/wasistshortview.php?mc=sv_ext_mf@gmx

7 8

asio:how to using iostream in blocking mode
by maosen.zhang 27 Oct '08

27 Oct '08

Hi all： In asio iostream client example: 27 tcp::iostream s(argv[1], "7777"); 28 std::string line; 29 std::getline(s, line); 30 std::cout << line << std::endl; Can I using iostream s in blocking mode? Which means std::getline will blocking to wait for data coming? Best wishes, maosen

1 0

Link error using thread library
by Phillip Jones 27 Oct '08

27 Oct '08

I'm trying to compile an inherited program, and a not so well documented one at that. Anyway, using CodeBlocks and MinGW on a Windows system, and I'm stuck on this error: ..\obj\Debug\src\GameVisualizer.o||In function `WinMain':| src\GameVisualizer.cpp|39|undefined reference to `boost::thread_group::thread_group()'| ..\obj\Debug\src\GameVisualizer.o||In function `GLOBAL__D_io_mutex1':| src\GameVisualizer.cpp|51|undefined reference to `boost::thread_group::create_thread(boost::function0<void, std::allocator<boost::function_base> > const&)'| src\GameVisualizer.cpp|51|undefined reference to `boost::thread_group::~thread_group()'| ..\obj\Debug\src\GameVisualizer.o||In function `ZN6PlayerC1Ev':| )]+0xd)||undefined reference to `boost::mutex::do_unlock()'| )]+0xd)||undefined reference to `boost::mutex::do_lock()'| (it keeps going) I assume this is a linking problem. Here's what I've done so far, I'm hoping an outside pair of eyes can see what I'm missing. Used bjam to compile the thread libraries. bjam --build-dir "D:\bin.v2" --with-thread --toolset=gcc --build-type=complete stage Then, added "boost_thread-mgw34-mt-d-1_36" to the link libraries. Verified that the linker can find the library. Yet, still getting these errors. Any pointers would be much appreciated.

1 0

[Boost-announce] [1.37.0 beta] Beta release available on SourceForge
by Olaf Peter 27 Oct '08

27 Oct '08

Hi, I've tested boost.program_options, where I get linker error: $ LANG=en g++ -DBOOST_ALL_NO_LIB -DDRIVER -O -I /usr/local/boost_1_37_0_beta1/include/boost-1_37/ cmdlineopts.cpp -o cmdlineopts -L /usr/local/boost_1_37_0_beta1/lib/ -l boost_program_options ... cmdlineopts.cpp:(.text+0x99): undefined reference to `boost::program_options::options_description::m_default_line_length' ... cmdlineopts.cpp:(.text+0x1ff): undefined reference to `boost::program_options::options_description::m_default_line_length' ... cmdlineopts.cpp:(.text+0x381): undefined reference to `boost::program_options::options_description::m_default_line_length' collect2: ld returned 1 exit status nevertheless compiled with -DBOOST_ALL_NO_LIB or -DBOOST_ALL_DYN_LINK Did I miss something? Regards, Olaf

2 1

Saving password encrypted
by Peter Barker 27 Oct '08

27 Oct '08

Hello, I can forsee a need for my application to store a password in a plain text file. Does Boost have a library to help me encrypt the password? Thank you, Pete

3 3

Is 1.36.0 already patched?
by Vincenzo Romano 27 Oct '08

27 Oct '08

Hello. I'd like to download and install 1.36.0 version but have also read about a "hot patch" that came later. Is the latest online version already patched? And, by the way, is there any up to date documentation in PDF format? Thanks in advance. -- Vincenzo Romano <Non quietis maribus nauta peritus>

2 2

Boost Graph Library - Using A*
by Daniel Esser 27 Oct '08

27 Oct '08

Hi! Does sombody know a good tutorial or code example to use the A* algorithm with simple arrays? I found an adapter in an pervious release of bgl but it seems to be outdated. Best regards Daniel

3 2

[1.37.0 beta] Beta release available on SourceForge
by Beman Dawes 26 Oct '08

26 Oct '08

1.37.0 beta 1 is available on SourceForge. See http://tinyurl.com/674rcl There is one known bug in the beta; the Getting Started Guide release number is still shown as 1.36.0. That will be fixed in the final release. There is one new library (Proto) in the release and numerous bug fixes and updates to existing libraries. The beta period will be approximately ten days. Please post bug reports to either the boost developer or user lists, but also let us hear about success stories too! Many thanks to Eric Niebler, Daniel James, Rene Rivera, Marshall Clow, the testers, and all the others who helped to get this beta release together. --Beman Dawes

4 3

[fusion] fused_procedure vs. fused_function_object
by Jeff Flinn 24 Oct '08

24 Oct '08

It appears the only difference is that fused_procedure has a void result type regardless of the adapted function's result type, where as fused_function_object's return type is that of the adapted function, is that true? What are the advantages of using fused_procedure, as it appears in my usage that fused_function_object can be used in place of fused_procedure? Awesome lib by the way! Thanks, Jeff

2 1

Installation issue: cannot pass the last test in tutorial,
by Minh Anh 24 Oct '08

24 Oct '08

Hi, I'm a novice here. Sorry if this issue has been posted already. I've searched the archived in the mailing list, and did some searches by google, but couldn't find anything relevant. I've just tried to install boost library to use with Visual Studio 2005. I followed all the steps indicated in the tutorial "getting started on Windows". Everything seems to work fine until the last step, section 6 "link your program to boost library". I did copy/paste the example in this section, and follow the instructions for the configuration. Then I built it with success. However, when I tested the program with the command line like suggested in section 6.4, but it failed. It keep saying that "the system cannot execute the specific program". The command line I used is: "C:\Documents and Settings\A_M\My documents\Visual Studio 2005\Projects\example\debug\example.exe" < "C:\jayne.txt" is this right? Btw, in doubt of a wrong step somewhere, I tried another tutorial that I found on internet at step 1, http://www.quantnet.org/forum/showthread.php?t=2221&page=2 (it's supposed to install boost for VS2008, but I thinks it should be not much different). However it didn't fix the problem. Moreover, it made the boost folder increase from around 900Mb to 8.9Gb???? Something must be wrong? Help me please, Sorry for the long post and many thanks in advance, AM. __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

3 10

[Python] Setting Python version in Visual Studio
by Tryptik 24 Oct '08

24 Oct '08

I am using boost 1_34_1 and the python module is using Python 2.5. I need to tell it to use 2.4. With bjam, there is a using directive that will link it to 2.4 - is there a pre-processor definition I can use to do this in Visual Studio? I know the boost python docs recommend using boost::jam to build python projects, but I inherited this one from someone and I do not know enough bjam to put it together quickly. Thanks -J __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

BOOST_CLASS_VERSION compiles on MSVC2005, but not on gcc
by professor rumsdiegeige 24 Oct '08

24 Oct '08

Hello, I've got a problem using BOOST_CLASS_VERSION on gcc. The following minimal code example class CHeader : boost::noncopyable { public: CHeader() {PosX_ = 1.0;}; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & PosX_; }; double PosX_; }; works for me both on gcc and on MSVC2005. However, if I add BOOST_CLASS_VERSION(CHeader, 1) then the code only compiles on MSVC2005, but not on gcc. GCC complains about an incorrect syntax here, without being more specific. What am I doing wrong? Thank you for your help, Regards S. Lorentz __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

does Boost.MultiArray work with Boost.MPI?
by Tom Smith 24 Oct '08

24 Oct '08

Dear All, I am trying to write some parallel code using Boost.MPI? I also want to use the class Boost.MultiArray. My question is: does Boost.MultiArray support parallel computation? If not, which class should I use instead for multi-d array operations. Thanks a lot! best wishes Tom

2 1

[ublas] bounded_vector redundant storage of size. (is this a bug?)
by johanngoetz 24 Oct '08

24 Oct '08

for small vectors (geometry vectors is what I have in mind) the bounded_vector and bounded_matrix look promising. Indeed, if I was only dealing with a handful of vectors at a time, this would be ideal. However, I am creating a fieldmap (of a magnetic field, say) which maps 3D vectors (position) to 3D vectors (the field). The likely size of this map is around a million points. This should correspond to 6 million numbers stored. However, if I have something like: std::map< ublas::bounded_vector<int, 3>, ublas::bounded_vector<float, 3> > Then the size is actually 8 million numbers stored since I am storing the size of each of the bounded_vectors. While access time to the map is still very fast, I find that reading in or creating such maps takes much more time than should be required. It seems to me that the advantage of having the size as a template parameter is: not needing to store it as a member variable. Therefore I would like to say this is a bug (do I have agreement?). Unfortunately, the only solution for ublas::bounded_vector I can think of would be a complete reimplementation of ublas::vector just with the size as a template parameter instead of a member variable. but maybe I don't know enough to suggest the proper way to handle such situations. Of course the same applies to ublas::bounded_matrix but the effect there is not as big and it is hard to imagine off-hand a huge array of matrices. --- Johann -- View this message in context: http://www.nabble.com/-ublas--bounded_vector-redundant-storage-of-size.-%28… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

XML optional field
by Emanuele Rocci 23 Oct '08

23 Oct '08

Hi AllI would like to build a configuration file for my application in XML.The Configuration files includes also optional sectionsi.e. there might be properties that are not required to be defined by the user. If I use BOOST serialization to load this file, the XML format seems to me that forces every field of the XML field to be REQUIRED. Do you know if with Boost serialization for XML there is some mechanismallowing or handling optional Xml field? Kind RegardsManu _________________________________________________________________ Tutto il mondo MSN a portata di clic! http://toolbar.msn.com/overview.aspx?loc=it-it

7 13

Boost 1.36 portability issues on FreeBSD 6.x?
by Alexander Sack 23 Oct '08

23 Oct '08

Hello: I have a FreeBSD 6.1 amd64 box and I'm running into various issues building boost on my platform. In no particular order: - libboost_prg_exec_monitor checks for a lot of optional signal codes (execution_monitor.ipp file) that FreeBSD 6.1 does not support AND FreeBSD 7 supports somewhat. I'm talking about the XSI codes for SIGCHLD, SIGILL, etc. in my /usr/include/sys/signal.h (amd64 tree but is also a problem on my x86 branch): e.g. #define ILL_ILLOPC 1 /* [XSI] illegal opcode */ #define ILL_ILLTRP 2 /* [XSI] illegal trap */ #define ILL_PRVOPC 3 /* [XSI] privileged opcode */ #define ILL_ILLOPN 4 /* [XSI] illegal operand -NOTIMP */ #define ILL_ILLADR 5 /* [XSI] illegal addressing mode -NOTIMP */ #define ILL_PRVREG 6 /* [XSI] privileged register -NOTIMP */ #define ILL_COPROC 7 /* [XSI] coprocessor error -NOTIMP */ #define ILL_BADSTK 8 /* [XSI] internal stack error -NOTIMP */ #define CLD_EXITED What's the best thing to do here? I've actually compiled against FreeBSD 7's signal.h just to get me through this but the fact is the kernel (trap.c) does not set these codes. Will this cause Boost to crap out on me during runtime? If so, is there a workaround since this seems like a real bug in portability? - SIGPOLL is not defined, its SIGIO (I can work around this) - The Boost build when doing its standard tests sets up the LD_LIBRARY_PATH on my box as: LD_LIBRARY_PATH=/usr/bin:/usr/lib:/usr/lib32:/usr/lib64 - ICU for FreeBSD is in /usr/include/local which causes the build.jam stuff to miss autodetecting it On a 64-bit machine, adding /usr/lib32 BREAKS not only the test but most natively compiled binaries - I had to move /usr/lib32 and rename it for some of the tests to work (like boost_std_no_locale) etc. I started a thread on Boost-Build but got no replies. I'm just wondering how portable the latest release of Boost is on FreeBSD? Btw, there are several files I had to patch within boost to even get it to build relatively far (and I haven't tried python support just yet). The current BSD port is 1.34 and has been that for a long time (there was a 1.35 release at some point in beta testing) but I would like to update it to 1.36 but need some guidance on the above. Any guidance would be much appreciated... Thanks! -aps

3 8

[phoenix] or [lamdba] Operating on containers of smart pointers.
by Raindog 23 Oct '08

23 Oct '08

I ran into a problem while cleaning up some old code. What I wanted to do was replace explicit for loops with some stl algorithms or BOOST_FOREACH. Below is the original function: |//in header file: ..snip typedef std::vector<Loki::SmartPtr<ADTChunk> > chunk_vec_t chunk_vec_t chunks; ..snip //in source file: uint32_t ADT::get_connectivity_data( std::vector< std::vector<uint8_t> > &output ) { output.resize(chunks.size()); for(chunk_vec_t::iterator it = chunks.begin(); it < chunks.end(); ++it) { uint32_t success = (*it)->get_connectivity_data(output[it-chunks.begin()]); } return TRUE; } I asked on a separate website for some possibilities of replacing this code with boost::lambda, and the following almost correct suggestion was given to replace the loop: ||std::for_each( chunks.begin(), chunks.end(), bind( &chunk_vec_t::value::type::get_connectivity_data, _1, output[ std::distance( _1, chunks.begn() ] ) ); The problem is that the above obviously does not compile, so I made some changes and came up with this: ||std::for_each( chunks.begin(), chunks.end(), bind( &chunk_vec_t::value_type::StoredType::get_connectivity_data, _1, output[ std::distance( &_1, &chunks[0] ) ] ) ); The problem with the above is that "||&chunk_vec_t::value_type::StoredType::get_connectivity_data|" causes the VC9 compiler to crash =( So I made this change: |std::for_each( chunks.begin(), chunks.end(), bind( &ADTChunk::get_connectivity_data, _1, output[ std::distance( _1, chunks.begin() ) ] ) ); But now I get an error with the call to std::distance not being able to discern the arguments due to ambiguity. Next I thought that I might be able to use zip_iterator to assist in dealing with both of the containers, and then I realized it used tuples, which then made me thing that extracting the iterators from the tuples is going to take a lot of boiler plate code itself. Which led me to settle with the following code that is concise and easily readable but will only work if chunks is a vector essentially: BOOST_FOREACH(chunk_vec_t::value_type it, chunks) { output[std::distance(&it, &chunks[0])] = it->get_connectivity_data(); } So, my final question is, given my above attempts, is there a way to do what the 1st and 5th(the one immediately above this line) code snippets do in a straight-forward manner using either boost::lambda, or, since it will be replaced eventually by phoenix v3, with phoenix v2? Thanks! | | |

4 5

compile problem of boost::accumulators
by Ivy Ye 23 Oct '08

23 Oct '08

hi, I am a newbie in this forum. I just installed boost and want to solve some statistic problems. My system is Windows Vista and compiler is MSVC 6.0 At first I try to compile the "hello world" program in the boost::accumulators user guide page, but I got some compiler errors: The program is #include <iostream> #include <boost/accumulators/accumulators.hpp> #include <boost/accumulators/statistics/stats.hpp> #include <boost/accumulators/statistics/mean.hpp> #include <boost/accumulators/statistics/moment.hpp> using namespace boost::accumulators; int main() { // Define an accumulator set for calculating the mean and the // 2nd moment ... accumulator_set<double, stats<tag::mean, tag::moment<2> > > acc; // push in some data ... acc(1.2); acc(2.3); acc(3.4); acc(4.5); // Display the results ... std::cout << "Mean: " << mean(acc) << std::endl; std::cout << "Moment: " << moment<2>(acc) << std::endl; return 0; } The error I get from compiler is s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(43) : error C2989: 'tag<T>' : template class has already been defined as a non-template class s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(43) : error C2908: explicit specialization; 'tag<T>' has already been instantiated from the primary template s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(43) : error C2988: unrecognizable template declaration/definition s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(48) : error C2989: 'tag<T>' : template class has already been defined as a non-template class s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(43) : see declaration of 'tag<T>' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(48) : error C2908: explicit specialization; 'tag<T>' has already been instantiated from the primary template s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(48) : error C2988: unrecognizable template declaration/definition s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(53) : error C2989: 'tag<T>' : template class has already been defined as a non-template class s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(48) : see declaration of 'tag<T>' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(53) : error C2908: explicit specialization; 'tag<T>' has already been instantiated from the primary template s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(53) : error C2988: unrecognizable template declaration/definition s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(107) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(107) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(108) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(108) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(109) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(109) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(110) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(110) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(111) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(111) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(112) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(112) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(113) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(113) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(114) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(114) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(115) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(115) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(116) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(116) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(117) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(117) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(119) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(119) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(120) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(120) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(121) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(121) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(122) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(122) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(123) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(123) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(124) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(124) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(126) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(127) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(128) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(129) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(137) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(139) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(141) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(143) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(145) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(147) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(149) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(151) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\numeric\functional_fwd.hpp(198) : error C2039: 'type' : is not a member of 'lazy_disable_if<struct boost::is_const<T>,struct ?? :: ?? >' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(82) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(82) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(98) : error C2182: '__formal' : illegal use of type 'void' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(120) : error C2039: 'apply' : is not a member of 'mpl' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(120) : error C2143: syntax error : missing ';' before '<' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(120) : error C2501: 'apply' : missing storage-class or type specifiers s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(120) : error C2059: syntax error : ';' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(120) : error C2059: syntax error : '<' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(120) : error C2039: 'type' : is not a member of '`global namespace'' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(124) : error C2039: 'apply' : is not a member of 'mpl' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(124) : error C2039: 'type' : is not a member of '`global namespace'' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(127) : error C2954: template definitions cannot nest s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(128) : error C2039: 'apply' : is not a member of 'mpl' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(128) : error C2143: syntax error : missing ';' before '<' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(128) : error C2501: 'apply' : missing storage-class or type specifiers s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(128) : error C2086: 'apply' : redefinition s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(128) : error C2059: syntax error : ';' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(128) : error C2059: syntax error : '<' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(128) : error C2039: 'type' : is not a member of '`global namespace'' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2039: 'apply' : is not a member of 'mpl' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2039: 'type' : is not a member of '`global namespace'' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2954: template definitions cannot nest s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2039: 'apply' : is not a member of 'mpl' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2143: syntax error : missing ';' before '<' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2501: 'apply' : missing storage-class or type specifiers s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2086: 'apply' : redefinition s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2059: syntax error : ';' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2059: syntax error : '<' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2039: 'type' : is not a member of '`global namespace'' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2039: 'apply' : is not a member of 'mpl' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2039: 'type' : is not a member of '`global namespace'' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2954: template definitions cannot nest s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2039: 'apply' : is not a member of 'mpl' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2143: syntax error : missing ';' before '<' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2501: 'apply' : missing storage-class or type specifiers s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2086: 'apply' : redefinition s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2059: syntax error : ';' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2059: syntax error : '<' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2039: 'type' : is not a member of '`global namespace'' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2039: 'apply' : is not a member of 'mpl' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2039: 'type' : is not a member of '`global namespace'' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2954: template definitions cannot nest s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2039: 'apply' : is not a member of 'mpl' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2143: syntax error : missing ';' before '<' s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : error C2501: 'apply' : missing storage-class or type specifiers s:\program files\boost\boost_1_36_0\boost\accumulators\accumulators_fwd.hpp(154) : fatal error C1003: error count exceeds 100; stopping compilation Error executing cl.exe. accExam.obj - 102 error(s), 0 warning(s) --------------------------- can someone tell me what is wrong? Many thanks, Ivy

4 3

[Spirit] Closure arg2 compiler error
by Anders Dalvander 23 Oct '08

23 Oct '08

Hi, I get a compiler error (cannot convert from 'const phoenix::nil_t' to 'int') when using arg2 of a two value closure. arg1 works fine, but not arg2. I don't understand what I have done wrong. Visual Studio 2005 SP1 boost 1.36.0 Anyone got any ideas? Best regards, Anders Dalvander Output: Compiling... SpiritClosureTest.cpp d:\prog\boost_1_36_0\boost\spirit\home\classic\phoenix\operators.hpp(446) : error C2440: '=' : cannot convert from 'const phoenix::nil_t' to 'int' No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called d:\prog\boost_1_36_0\boost\spirit\home\classic\phoenix\operators.hpp(446) : while compiling class template member function 'int &phoenix::binary_operator<TagT,T0,T1>::eval(T0 &,const T1 &)' with [ TagT=phoenix::assign_op, T0=int, T1=phoenix::nil_t ] d:\prog\boost_1_36_0\boost\spirit\home\classic\phoenix\operators.hpp(1017) : see reference to class template instantiation 'phoenix::binary_operator<TagT,T0,T1>' being compiled with [ TagT=phoenix::assign_op, T0=int, T1=phoenix::nil_t ] d:\prog\boost_1_36_0\boost\spirit\home\classic\phoenix\composite.hpp(237) : see reference to class template instantiation 'phoenix::assign_op::result<T0,T1>' being compiled with [ T0=int, T1=phoenix::nil_t ] d:\prog\boost_1_36_0\boost\spirit\home\classic\phoenix\composite.hpp(267) : see reference to class template instantiation 'phoenix::composite2_result<OperationT,TupleT,A,B>' being compiled with [ OperationT=phoenix::assign_op, TupleT=phoenix::tuple<>, A=phoenix::actor<phoenix::closure_member<0,phoenix::closure<int,int,phoenix::nil_t>>>, B=phoenix::actor<phoenix::argument<0>> ] d:\prog\boost_1_36_0\boost\spirit\home\classic\phoenix\actor.hpp(122) : see reference to class template instantiation 'phoenix::composite<OperationT,A,B,C>::result<TupleT>' being compiled with [ OperationT=phoenix::assign_op, A=phoenix::actor<phoenix::closure_member<0,phoenix::closure<int,int,phoenix::nil_t>>>, B=phoenix::actor<phoenix::argument<0>>, C=phoenix::as_actor<phoenix::nil_t>::type, TupleT=phoenix::tuple<> ] d:\prog\boost_1_36_0\boost\spirit\home\classic\phoenix\actor.hpp(133) : see reference to class template instantiation 'phoenix::actor_result<ActorT,TupleT>' being compiled with [ ActorT=phoenix::composite<phoenix::assign_op,phoenix::actor<phoenix::closure_member<0,phoenix::closure<int,int,phoenix::nil_t>>>,phoenix::actor<phoenix::argument<0>>,phoenix::as_actor<phoenix::nil_t>::type>, TupleT=phoenix::tuple<> ] c:\documents and settings\anders\my documents\visual studio 2005\projects\spiritclosuretest\spiritclosuretest\spiritclosuretest.cpp(25) : see reference to class template instantiation 'phoenix::actor<BaseT>' being compiled with [ BaseT=phoenix::composite<phoenix::assign_op,phoenix::actor<phoenix::closure_member<0,phoenix::closure<int,int,phoenix::nil_t>>>,phoenix::actor<phoenix::argument<0>>,phoenix::as_actor<phoenix::nil_t>::type> ] c:\documents and settings\anders\my documents\visual studio 2005\projects\spiritclosuretest\spiritclosuretest\spiritclosuretest.cpp(16) : while compiling class template member function 'my_grammar::definition<ScannerT>::definition(const my_grammar &)' with [ ScannerT=boost::spirit::scanner<> ] d:\prog\boost_1_36_0\boost\spirit\home\classic\core\non_terminal\impl\grammar.ipp(279) : see reference to class template instantiation 'my_grammar::definition<ScannerT>' being compiled with [ ScannerT=boost::spirit::scanner<> ] d:\prog\boost_1_36_0\boost\spirit\home\classic\core\non_terminal\impl\grammar.ipp(298) : see reference to function template instantiation 'void boost::spirit::impl::call_helper<0>::do_<result_t,definition_t,ScannerT>(RT &,DefinitionT &,const ScannerT &)' being compiled with [ ScannerT=boost::spirit::scanner<>, RT=result_t, DefinitionT=definition_t ] d:\prog\boost_1_36_0\boost\spirit\home\classic\core\non_terminal\grammar.hpp(55) : see reference to function template instantiation 'boost::spirit::match<boost::spirit::nil_t> boost::spirit::impl::grammar_parser_parse<0,my_grammar,boost::spirit::parser_context<>,ScannerT>(const boost::spirit::grammar<DerivedT> *,const ScannerT &)' being compiled with [ ScannerT=boost::spirit::scanner<>, DerivedT=my_grammar ] d:\prog\boost_1_36_0\boost\spirit\home\classic\core\non_terminal\grammar.hpp(65) : see reference to function template instantiation 'boost::spirit::match<boost::spirit::nil_t> boost::spirit::grammar<DerivedT>::parse_main<ScannerT>(const ScannerT &) const' being compiled with [ DerivedT=my_grammar, ScannerT=boost::spirit::scanner<> ] d:\prog\boost_1_36_0\boost\spirit\home\classic\core\impl\parser.ipp(30) : see reference to function template instantiation 'boost::spirit::match<boost::spirit::nil_t> boost::spirit::grammar<DerivedT>::parse<boost::spirit::scanner<>>(const ScannerT &) const' being compiled with [ DerivedT=my_grammar, ScannerT=boost::spirit::scanner<> ] d:\prog\boost_1_36_0\boost\spirit\home\classic\core\impl\parser.ipp(47) : see reference to function template instantiation 'boost::spirit::parse_info<IteratorT> boost::spirit::parse<const CharT*,DerivedT>(const IteratorT &,const IteratorT &,const boost::spirit::parser<DerivedT> &)' being compiled with [ IteratorT=const char *, CharT=char, DerivedT=my_grammar ] c:\documents and settings\anders\my documents\visual studio 2005\projects\spiritclosuretest\spiritclosuretest\spiritclosuretest.cpp(54) : see reference to function template instantiation 'boost::spirit::parse_info<IteratorT> boost::spirit::parse<char,DerivedT>(const CharT *,const boost::spirit::parser<DerivedT> &)' being compiled with [ IteratorT=const char *, DerivedT=my_grammar, CharT=char ] Source: #include <boost/spirit.hpp> #include <boost/spirit/phoenix/primitives.hpp> #include <iostream> struct result_closure : boost::spirit::closure<result_closure, int, int> { member1 res1; member2 res2; }; struct my_grammar : boost::spirit::grammar<my_grammar> { template <typename ScannerT> struct definition { explicit definition(const my_grammar& self) { using boost::spirit::ch_p; using boost::spirit::uint_p; using phoenix::var; using phoenix::arg1; using phoenix::arg2; exp = uint_p[exp.res1 = arg1] >> ch_p('-') >> uint_p[exp.res2 = arg1] ; root = exp[var(self.i) = arg2] // compiler error here if using arg2. ; // arg1 works fine though. } boost::spirit::rule<ScannerT, result_closure::context_t> exp; boost::spirit::rule<ScannerT> root; const boost::spirit::rule<ScannerT>& start() const { return root; } }; my_grammar(int& i_) : i(i_) { } int& i; }; int main() { int i; my_grammar g(i); if (parse("1-2", g).full) { std::cout << i << "\n"; } }

2 1

Asio timer - how to restart it?
by Peleg 23 Oct '08

23 Oct '08

Hello, I'm writing an Asio based serial port communication application. I've tried to use Asio timer as receive time out timer. The implementation consist of restarting the timer each time the receive event is called, , so it'll trigger only after time out duration with no receive event. The problem is that when I try to restart the timer, using expires_from_now(), the timer immediately triggers. I've written a simplified code that demonstrate this problem: #include <iostream> #include <boost/asio.hpp> #include <boost/thread.hpp> #include <boost/date_time/posix_time/posix_time.hpp> using namespace std; using namespace boost::posix_time; void delay(int sec) { boost::posix_time::ptime expire_time = second_clock::local_time() + boost::posix_time::seconds(sec); while(second_clock::local_time() < expire_time) ; } void on_time_out(const boost::system::error_code& ) { cout << second_clock::local_time() <<" Time out!" << endl; } int main() { boost::asio::io_service io; cout << second_clock::local_time() << " Starting timer" << endl; boost::asio::deadline_timer timer(io, boost::posix_time::seconds(5)); boost::thread thread(boost::bind(&boost::asio::io_service::run, &io)); timer.async_wait(on_time_out); delay(3); cout << second_clock::local_time() << " Restarting timer" << endl; timer.expires_from_now(boost::posix_time::seconds(5)); delay(12); return 0; } This code results the following output: 2008-Oct-23 13:22:59 Starting timer 2008-Oct-23 13:23:02 Restarting timer 2008-Oct-23 13:23:02 Time out! As you can see to on_time_out() is called immediately after expires_from_now() call, with no actual time out. How do I restart to timer in the right way? Thanks, Peleg -- View this message in context: http://www.nabble.com/Asio-timer---how-to-restart-it--tp20128401p20128401.h… Sent from the Boost - Users mailing list archive at Nabble.com.

4 6

question on boost::interprocess
by Markos.Perrakis＠tsx.com 23 Oct '08

23 Oct '08

I have created a shared memory segment with the boost::interprocess library and have created and populated a boost::interprocess::map in that segment. The key for the map is the boost::interprocess::string class. If I want to search for an element in the map I obviously have to supply the key for the element. Here is what I do: { std::string key; // assign here a value to key string object const Char_Alloc char_alloc( (shared_memory_segment_obj.get_segment_manager() ) ); boost::interprocess::string some_string( char_alloc ); some_string.assign( key.c_str() ); } where Char_Alloc is a suitable shared memory allocator for plain characters. As you can see from the code the key (the some_string object) for the map is created in local memory (in-process memory) but the contents of the string are allocated in shared memory. If two threads access this shared memory segment and execute the above code at the same time, is this thread safe? Will the two concurrent assign() statements use the same location in shared memory and cause overlaps? Or is the shared memory allocator smart enough to synchronize the two assign() calls and execute them sequencially? In case the shared memory allocator is not smart enough to guarantee synchronization can I use a boost::interprocess mutex for thread synchronization? Regards, Markos Perrakis -------------------------------------- NOTICE OF CONFIDENTIALITY This e-mail, including all materials contained in or attached to this e-mail, contains proprietary and confidential information solely for the internal use of the intended recipient. If you have received this email in error, please notify us immediately by return e-mail or otherwise and ensure that it is permanently deleted from your systems, and do not print, copy, distribute or read its contents. AVIS DE CONFIDENTIALIT� Le pr�sent courriel, y compris tous les documents qu'il contient ou qui y sont joints, renferme des renseignements exclusifs et confidentiels destin�s uniquement � l'usage interne du destinataire pr�vu. Si vous avez re�u le pr�sent courriel par erreur, veuillez nous aviser imm�diatement, notamment par retour de courriel, et vous assurer qu'il est supprim� de fa�on permanente de vos syst�mes; veuillez �galement vous abstenir d'imprimer, de copier, de distribuer ou de lire son contenu.

2 1

Boost.Asio uses not specified WSAGetLastError
by Yakov Olkhovskiy 23 Oct '08

23 Oct '08

I just have found that Boost.Asio returns wrapped WSAGetLastError code even on successfully executed ::connect (didn't check it for other functions). There is a problem with Norton Personal Firewall - looks like it performs some operation after successful connection and doesn't restore error variable in the DLL. As result on a second (and further) program's run WSAGetLastError returns code 2 (The system cannot find the file specified). After removing record of the program from "Norton Internet Security->Norton Internet Security->Personal Firewall->Program control" list, the program works once and then again returns error on further runs. Actually it looks like as an Asio fault, because WSAGetLastError is not specified on successful function execution.

1 1

[Graph] Dijkstra algorithms checks edge weight is positive: loss of generality ?
by Tristram Gräbener 23 Oct '08

23 Oct '08

Hello, I'm not very familiar yet with all boost::graph internals, but there is something that bothers me: I use a special weight_map (cost functions of my own), providing my own distance_combine. So WeightMap::value_type is CostFunction and DistanceMap::value_type is float The dijkstra algorithm checks if an edge has a positive weight ( boost/graph/dijkstra_shortest_paths.hpp lines 121 & 122 with version 1.36.0). However, it uses the distance_compare parameters where "argument types that match the value type of the DistanceMap property map" So it tries to compare my cost function against a float (which of course is not possible). Of course this test garanties the optimality of the algorithm, but it restricts the use to have the weight_map and the distance_map of the same type. Did I miss how to use custom weight_maps, or is it some special case that wasn't thought of ? For now I just commented out the check Thank you ! PS: a more general optimality condition is (sufficient, but I'm not sure if it's necessary) : the combine function has to be non decreasing : for a node u, and edge e = (u,v), the distance_map d and the weight map w distance_compare(d[u], distance_combine(d[u], w[e]) ) has to be true

2 5

Can not compile a program that uses typeof package by gcc?
by Peng Yu 23 Oct '08

23 Oct '08

Hi, The program below this email does not compile with gcc 4.1.2. g++ (GCC) 4.1.2 20061115 (prerelease) (Debian 4.1.1-21) Copyright (C) 2006 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. I understand that I should ask on the gcc mailing list first, as gcc says it is own bug. But I want to make sure it is not become the typeof package uses some too advanced compiler features. Can somebody let me know if the following code can be compiled by a more recent version of gcc or some other compiler? Thanks, Peng #include <boost/typeof/typeof.hpp> #include <iostream> namespace A { template <typename T> class X { public: X() { } X(T t) : _t(t) { } const T &the_t() const { return _t; } private: T _t; }; template <typename T1, typename T2> struct multiply_traits; template <typename T1, typename T2> struct multiply_traits<X<T1>, T2> { typedef X<T1> result_type; }; template <typename T1, typename T2> typename multiply_traits<X<T1>, T2>::result_type operator*(const X<T1> &x, const T2 &t) { return X<T1>(x.the_t() * t); } } namespace B { template <typename T> class Y { public: Y(T t) : _t(t) { } const T &the_t() const { return _t; } private: T _t; }; template <typename T1, typename T2> //Y<typename multiply_traits<T1, T2>::result_type> operator*(const Y<T1> &y, const T2 &t) { //Y<T1> operator*(const Y<T1> &y, const T2 &t) { Y<BOOST_TYPEOF(T1() * T2())> operator*(const Y<T1> &y, const T2 &t) { return Y<T1>(y.the_t() * t); } } int main () { A::X<int> x(2); B::Y<A::X<int> > y(x); std::cout << (x * 3).the_t() << std::endl; std::cout << (y * 5).the_t().the_t() << std::endl; }

3 24

Fatal Error error 1001: F1001 Internal code generator error
by Estanislao Chapel 23 Oct '08

23 Oct '08

Hi I have a problem I don't know how to solve. I want to try an example from an article from Dr. Dobbs 'The Boost.Threads Library'. When I try to compile it I get a "Fatal Error error 1001: F1001 Internal code generator error". I need your help. I'm stuck with this problem. I use CodeGear(tm) RAD Studio 2007 Version 11.0.2902.10471 in a Windows XP SP3 and Boost 1.3.6.0 I have built Boos with complete option to use the libs in debug builds. The code is as follows: ****************************************************************** #pragma hdrstop #include <boost/thread/thread.hpp> #include <boost/thread/mutex.hpp> #include <boost/bind.hpp> #include <iostream> boost::mutex io_mutex; void count(int id); void count(int id) { for (int i = 0; i < 10; ++i) { boost::mutex::scoped_lock lock(io_mutex); std::cout << id << ": " << i << std::endl; } } #pragma argsused int main(int argc, char* argv[]) { boost::thread thrd1( boost::bind(&count, 1)); <= here occurs the F1001 fatal error boost::thread thrd2( boost::bind(&count, 2)); thrd1.join(); thrd2.join(); return 0; } ********************************************************************** The Output is: Genereringen startade 2008-10-23 11:11:15. __________________________________________________ Projekt C:\Documents and Settings\e-echapel\My Documents\RAD Studio\Projects\ThreadsLab\MutexLab1.cbproj (MakeOne mål): Mål _MakeOne: Mål BccCompile: c:\program files\codegear\rad studio\5.0\bin\bcc32.exe -D_DEBUG;NO_STRICT -D_RTLDLL;_NO_VCL -I"C:\Program Files\boost\boost_1_36_0";"c:\program files\codegear\rad studio\5.0\include";"c:\program files\codegear\rad studio\5.0\include\dinkumware";"c:\program files\codegear\rad studio\5.0\include\vcl";ThreadsLab;"c:\program files\codegear\rad studio\5.0\include\Indy10";"c:\program files\codegear\rad studio\5.0\RaveReports\Lib";C:\boost\include -y -v -vi- -k -r- -c -tWC -tWM -H=Debug\MutexLab1.pch -oDebug\MutexLab1.obj -w-par -Od -vi- -v MutexLab1.cpp MutexLab1.cpp(28,47): Fatal Error error 1001: F1001 Internal code generator error Genereringen av målet BccCompile i projektet MutexLab1.cbproj misslyckades. Genereringen av målet _MakeOne i projektet MutexLab1.cbproj misslyckades. Projektgenereringen av MutexLab1.cbproj misslyckades. Genereringen misslyckades. MutexLab1.cpp(28,47): Fatal Error error 1001: F1001 Internal code generator error 0 varningar 1 fel Förfluten tid: 00:00:01.12 *********************************************************************************** Misslyckades = failed varningar = warnings fel = error Thanks in advance Regards Estanislao

1 0

Anyone with Wind River compiler/MQX RTOS (embedded system) experience?
by Boris 23 Oct '08

23 Oct '08

Does anyone use any Boost libraries with the Wind River compiler on MQX RTOS and can share his experience? Boris

1 0

Using parse_config_file from program_options
by Arthur Carlsson 23 Oct '08

23 Oct '08

Hi! When I try to use the parse_config_file() function from the program_options library I get a link error saying (built on OS X 10.5): Undefined symbols: "boost::program_options::basic_parsed_options<char> boost::program_options::parse_config_file<char>(std::basic_istream<char, std::char_traits<char> >&, boost::program_options::options_description const&, bool)", referenced from: _main in main.cc.o ld: symbol(s) not found Taking a closer look at the code I discovered that the function is declared as a template in boost/program_options/parsers.hpp but is defined in boost/libs/program_options/src/parsers.cpp. Is this really valid? I've thought that templated functions need to be defined along with the declaration as the template arguments need to be evaluated at compile time. Or am I missing something? Thanks in advance! Arthur

2 2

tcp::sockets non-copyable, and threads
by Lindley M French 22 Oct '08

22 Oct '08

I'm trying to design a basic server, and I figured now would be a good time to get familiar with what Boost has to offer. However, I've already encountered a difficulty: boost::asio::ip::tcp::sockets are non-copyable. Therefore, I cannot simply acceptor.accept(socket), and then spawn a boost::thread on an object that uses that socket! If I pass a reference or pointer the socket must remain in scope, so it will need to by dynamically allocated....which doesn't seem right to me. I figure I'm probably missing something fundamental on the way boost is intended to work. Anyone care to enlighten me?

3 2

Is there a FFT wrapper in boost?
by Peng Yu 22 Oct '08

22 Oct '08

Hi, FFTW is the fastest FFT library. But its interface is in C. I'm wondering if there is any ongoing project on FFT. Thanks, Peng

7 9

Simple Filesystem Library Build and Usage
by df.trash 22 Oct '08

22 Oct '08

Using: Boost 1.36 Want to build static Filesystem Library for Windows and Linux. Right now I want to make sure the build is successful with the compilers we are using. I am a noobie with Boost and BJam, and am having difficulties building a test application for testing. Unfortunately, I'm dusting off my programming hat and learning to use all the appropriate tools again like compilers etc. I have read through much of the Boost instructions but still cannot seem to get the Filesystem library compiled as a static library and working with practical examples. Question: What is the simplest way to build a library to be used by my other source code out of the Filesystem Library on both Windows and Unix systems? And what is the simplest way to test that build? My first test is on Windows XP with Visual Studio Express 2005. *Attempt 1: *Create App with Visual Studio 2005 I ran the following from main Boost directory on the command line to create the library files: bjam debug --with-filesystem stage I then started a new Win32 Console Application in Visual Studio with the file_size.cpp test example. Under "Additional Include Directories" I put: "C:\Program Files\boost_1_36_0";"C:\Program Files\boost_1_36_0\stage\lib" I then tried to build the solution, and received the following error: LINK : fatal error LNK1104: cannot open file 'uuid.lib' *Attempt 2:* Create App with BJam I navigated to \libs\filesystem\src and created a Jamfile with the following: lib test : operations.cpp path.cpp portability.cpp utf8_codecvt_facet.cpp : <variant>debug <link>static ; I ran bjam in this folder which created a library: libtest-vc80-mt-gd-1_36.lib I copied the file to \libs\filesystem\example and created a Jamfile there with the following: exe FilesystemTest : file_size.cpp libtest-vc80-mt-gd-1_36.lib ; After running bjam in this folder, I received severael unresolved symbol erros like the following: file_size.obj : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::get_system_category(void)" (?get_system_category@system @boost@@YAABVerror_category@12@XZ) referenced in function "public: __thiscall boost::system::error_code::error_code(void)" (??0error_code@system@boost@@QAE@XZ) Any help would be much appreciated!

2 1

[graph] how to setup the mutable_queue?
by Fu Jie Huang 22 Oct '08

22 Oct '08

Hi, i'm trying to write a demo of prim/dijkstra algorithm (without using the stock code in BGL). but i'm lost at how to set up the priority queue with key updates (mutable queue, that is). how do i set up the distance map? or should the distance be the property of each vertex? and internally, how is distances of vertices maintained? thanks

1 0

Need help with using Boost::Serialization on AmD64, Windows, MSVC 8.0
by Sahib Aulakh 22 Oct '08

22 Oct '08

I am building boost using the following command; this is done from the command window of MSVC 2005. \boost-jam-3.1.16-1-ntx86\bjam --build-dir=c:\boost-build --toolset=msvc --build-type=complete --address-model=64 The intention is to build for amd64 target. Is this the right command? Should toolset be specified as "msvc-8.0_64"? I am trying to use serialization library but keep getting linker errors like the following: 1>d:\source\ux_a_2\private\frontend\fex\search\searchconfigcontainer.obj : error LNK2019: unresolved external symbol "public: __cdecl boost::archive::basic_binary_oprimitive<class boost::archive::binary_oarchive,char,struct std::char_traits<char> >::~basic_binary_oprimitive<class boost::archive::binary_oarchive,char,struct std::char_traits<char> >(void)" (??1?$basic_binary_oprimitive@Vbinary_oarchive@archive@boost@@DU?$char_traits@D@std@@@archive@boost@@QEAA@XZ) referenced in function "public: __cdecl boost::archive::binary_oarchive_impl<class boost::archive::binary_oarchive,char,struct std::char_traits<char> >::~binary_oarchive_impl<class boost::archive::binary_oarchive,char,struct std::char_traits<char> >(void)" (??1?$binary_oarchive_impl@Vbinary_oarchive@archive@boost@@DU?$char_traits@D@std@@@archive@boost@@QEAA@XZ) There seems to be some internet chatter related to this at http://www.nabble.com/using-boost-in-x64-app-td19804910.html. However, I have been unable to make this thing work. If I create a standalone project in VC and use serialization code then it works all fine; however, the standalone code was written in 32bit mode. I will appreciate any clues anyone can provide. Thanks.

2 3

Help with split_iterator, iterator_range and strings
by Jeffrey C. Jacobs 22 Oct '08

22 Oct '08

I am trying to write an adaptor function that takes a string and a list of character delimiters and populates an output iterator with the result. Specifically, this is what I have: using boost::algorithm::make_split_iterator; using boost::algorithm::split_iterator; using boost::iterator_range; using boost::copy_range; using boost::algorithm::is_any_of; using boost::algorithm::token_finder; template <typename E, typename T, typename A, typename D, typename OutIt> inline OutIt split_and_copy(const std::basic_string<E, T, A> &source, const D &delimeters, OutIt out) { typedef std::basic_string<E, T, A> mystring; typedef split_iterator<mystring::const_iterator> SplitIt; typedef iterator_range<mystring::const_iterator> RangeIt; const SplitIt b = make_split_iterator(source, token_finder(is_any_of(delimeters))); const SplitIt e; return std::transform(b, e, out, copy_range<mystring, RangeIt>); } This compiles but strikes me as a bit verbose. I mean, am I missing something visa-vi the proper interaction of split_iterator, iterator_range and the container they are splitting and making a range of? I believe since b is a split_iterator type, that *b is of type iterator_range, is this not correct? The templates would be as I listed for SplitIt and RangeIt, as I understand it. Now, originally I was hoping there would be an automatic conversion back from iterator_range to the ranged container, which would make a copy of the elements in the range and stick them into a container of the original type (in this case, string). Is there no conversion from iterator_range<mystring::const_iterator> back to mystring? You see, originally, I wanted to write: std::copy(b, e, out); But it seems there is no way around using std::transform with an explicit conversion from RangeIt to mystring with copy_range. Or am I wrong in that assumption? No, I don't want to use the split function since I don't want to populate the whole container, just write my entries to an output iterator; it's generic in that sense to allow for ostream_iterator or back_inserters or whatever. Also, is there some way to not have to explicitly provide the copy_range input type since that type is already known to be the same type as *b and *e? Thanks for any insight you might be able to offer! Jeffrey -- "Scan not a friend with a microscopic glass; you know his faults so let his foibles pass." -- Victorian Proverb, likely Sir Frank Crisp, 1st Baronet of Bungay ~,-;` The TimeHorse

1 0

Is there a spatialIndex in boost?
by Peng Yu 22 Oct '08

22 Oct '08

Hi, Some message mentioned spatialindex. I'm wondering where the package homepage is at? Thanks, Peng

2 3

Is there a way to generate the library names used by auto_link.hpp
by Patrick Harris 22 Oct '08

22 Oct '08

I'd like to be able to use the generated library names to automatically add a linker delay load option but the auto_link.hpp file undefs the lib name and some of the other defines used. Is there a supported way of getting the generated names other than duplicating and customising bits of the auto_link.hpp file? Thanks

2 2

[graph] Newbie question: iterator shows vertices not added, always lo .. hi
by Chris Lott 21 Oct '08

21 Oct '08

Hi, I am new to the Boost graph library and trying to learn from examples in the documentation. I would like to ask about the simple vertex iterator's behavior. Below is sample code. In a nutshell, the program adds some edges to a Boost graph, then prints the vertices. The vertex numbers added are not contiguous: the loop basically adds edges between vertices 0, 1, 2, 6, and 7; no edges are added for vertices 3, 4, 5. Then I use a vertex iterator to show tine in- and out-degree of each vertex. My expectation was that the iterator would only show me the vertices for which I added edges, but instead it shows vertices from 0..7, essentially from the low value to the high value. This seems to be a feature, but I don't know where to look to find an explanation. Perhaps this behavior is dictated by my choices of data structures vecS? So far I have been relying on the online documentation, which I find to be quite difficult to use. For example, the web site doesn't seem to have a comprehensive index to Boost generic types and functions, just that alone would be an enormous help. Is the Boost book is (substantially?) better than using the online docs, or is it just the same content on paper? Please advise, thanks for your help. chris... -------- [code] #include <iostream> // for std::cout #include <utility> // for std::pair #include <algorithm> // for std::for_each #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> int /* GraphExample_ */ main(int,char*[]) { // create a typedef for the Graph type typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS> Graph; // Make convenient labels for the vertices enum { A, B, C, X, Y, Z, D, E, N }; const int num_vertices = N; typedef std::pair<int, int> Edge; Edge edge_array[] = { Edge(A,B), Edge(A,D), Edge(C,A), Edge(D,C), Edge(C,E), Edge(B,D), Edge(D,E) }; const int num_edges = sizeof(edge_array)/sizeof(edge_array[0]); // Declare a graph object with the specified number of vertices. Graph g(num_vertices); // add the edges to the graph object // Each vertex is an integer. for (int i = 0; i < num_edges; ++i) boost::add_edge(edge_array[i].first, edge_array[i].second, g); // Iterate through the vertices and print them out. // This iterator seems to be simply 0.. (largest vertex number). // Some vertices were never added as part of any edge, yet the // loop below shows them anyhow. typedef boost::graph_traits<Graph>::vertex_iterator vertex_iter; std::pair<vertex_iter, vertex_iter> vp; for (vp = vertices(g); vp.first != vp.second; ++vp.first) { vertex_iter iter = vp.first; boost::graph_traits<Graph>::vertex_descriptor v = *iter; int in = boost::in_degree(v, g); std::cout << "Vertex " << v << " has in degree " << in << std::endl; int out = boost::out_degree(v, g); std::cout << "Vertex " << v << " has out degree " << out << std::endl; } return 0; } [/code]

2 1

[mutli_index] class reference available? / How to detect insertion failures
by Nick Martin 21 Oct '08

21 Oct '08

I recently discovered the boost multi_index library. It appears to be an incredible resource that I am really looking forward to using. Unfortunately, I have been frustrated by the documentation and unable to get much usable code written. The bulk of the information that has been helpful to me is in the examples. Branching out beyond what is specifically done in an example has proven to be difficult for me because of a lack of reference documentation. I am not an expert in reading templatized and type-defed code, so reading the headers themselves has been very time consuming. That led me to wonder if Doxygen-like documentation is available? For instance, the Asio library has a very nice reference available http://www.boost.org/doc/libs/1_36_0/doc/html/boost_asio/reference.html Looking at the TCP socket's connect method leads you here: http://www.boost.org/doc/libs/1_36_0/doc/html/boost_asio/reference/basic_st… Here I can see the parameters and return types and in general figure out how to use this class. Contrast that with multi_index. There doesn't appear to be comprehensive class reference documentation. I only figured out how to do simple tasks like inserting new items into the container by looking at the examples ( http://www.boost.org/doc/libs/1_36_0/libs/multi_index/example/basic.cpp) My specific question (which the examples don't seem to cover) is how to tell when insertion fails. What if the new item's unique key constraint fails? I have had many other, seemingly simple questions that I would hope could be answered in minutes or seconds that have turned into hours of trial and error and combing through example programs. What other resources are out there that I refer to in order to use this great library? Thanks, Nick

6 10

How can I use unique_ptr with container and string in boost::interprocess?
by blp330 21 Oct '08

21 Oct '08

Hi, I have a complex data structure that wants to put into shared memory. In STL way it should be: list<tuple<string, string, map<string, string>>> As you can see, there are a lot of strings which will be put into shared memory. My current way to a string into a container is (I use list<string> as a example): typedef allocator<char, managed_windows_shared_memory::segment_manager> CharAllocator; typedef basic_string<char, std::char_traits<char>, CharAllocator> SharedMemoryString; typedef allocator<SharedMemoryString, managed_windows_shared_memory::segment_manager> PushValueAllocator; typedef list<PushValue, PushValueAllocator> PushQueue; In this way, I always must construct a SharedMemoryString first then put it into container: SharedMemoryString mStr(charAlloc); mStr = "some stirng..."; queue->push_back(mStr); In my understanding, this will cost twice memory allocations to store this string into shared memory. First time is mStr = "some string...", second time is that mStr is put into list container, then mStr's memory will be destructed after leaving the scope. This means if the string length is 1KB, my shared memory size at least must be 2 * 1KB + container overhead. This seems stupid because twice memory allocation and copy operation. So, I want to use unique_ptr to solve this problem. I try: typedef managed_unique_ptr<SharedMemoryString, managed_windows_shared_memory>::type StringUniquePtr; typedef allocator<StringUniquePtr, managed_windows_shared_memory::segment_manager> PushValueAllocator; typedef list<PushValue, PushValueAllocator> PushQueue; SharedMemoryString* mStr = new SharedMemoryString(charAlloc); *mStr = "some stirng..."; queue->push_back(StringUniquePtr(make_managed_unique_ptr(mStr, segment))); But it can't compile... :( I have no idea to make unique_ptr to work with string in container in boost::interprocess. How do I make this work? Thank you very much. -- View this message in context: http://www.nabble.com/How-can-I-use-unique_ptr-with-container-and-string-in… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Re: [Boost-users] [graph] Newbie question: iterator shows vertices not added, always lo .. hi
by Cooprider, Nathan (US SSA) 21 Oct '08

21 Oct '08

Let me start off by saying I'm fairly new as well, but I won't let that stop me from putting my foot in my mouth: > Perhaps this behavior is dictated by my choices of data structures vecS? This would be my guess as well. Did you try using a different structure to see if the behavior changes? > Is the Boost book is (substantially?) better than using the online docs, > or is it just the same content on paper? I found the BGL book to be helpful to a certain degree. The walkthroughs and examples seem easier to follow, and the index and table of contents are helpful to have at one's fingertips. Unfortunately, it is a bit old and so some important features are not covered in the book at all (property bundles, subgraphs). For those you have to rely on the online documentation. Nathan

1 0

Re: [Boost-users] Boost [Asio] Problem with POST Request and async_read
by anti00Zero 21 Oct '08

21 Oct '08

I Found the problem myself. The problem was transfer_at_least(1). I should write the hole content to the thhp server and after this I should read. With transfer_at_least(1) I wrote some content and want to read again from the server. But the server wants to recieve more content. >Hello. > >I've wrote a SSL Proxy and have a big problem. >I use a HTTP Client in bei Proxy to communicate with my HTTP Server. >HTTP Client and HTTP Server are localhost. A SSL Browser should call my local SSL Proxy and internal >a HTTP Client communicate with my HTTP Server. >If the SSL Brower sends a POST request to my proxy, I have a problem. > >This is my code: > >async_write(m_HTTPSocket, buffer(m_sSSLRequestBuffer), > transfer_at_least(1), > boost::bind(&CSession::HandleHTTPWriteRequest, this, placeholders::error)); > >void CSession::HandleHTTPWriteRequest(const error_code& error) >{ > if (!error) > { > async_read(m_HTTPSocket, buffer(m_HTTPResponse, >MAX_HTTPRESPONSE_BUFFER_LENGTH), > transfer_at_least(1), > boost::bind(&CSession::HandleHTTPReadResponse, this, placeholders::error, > placeholders::bytes_transferred)); > } > else if(error != error::eof) > { > SendErrorToSSL(error); > } >} > >void CSession::HandleHTTPReadResponse(const error_code& error, size_t iTransferredBytes) >{ > if(!error) > { > >The error is boost::asio::error::connection_aborted (10053 (WSAECONNABORTED)). If I don't use my >SSL Proxy the HTTP Browser works correct. > >I use Visual Studio 2005 with Boost 1.36 > >Thanks for help. -- GMX startet ShortView.de. Hier findest Du Leute mit Deinen Interessen! Jetzt dabei sein: http://www.shortview.de/wasistshortview.php?mc=sv_ext_mf@gmx

1 0

error when using boost::thread_group
by Meng Yu 21 Oct '08

21 Oct '08

Dear all, I delted the boost folder carelessly,so I had to rebuild boost1_33_1. after i build bjam,I can compile ,run the thread.cpp in /boost_1_33_1/libs/thread/example/ but,when I compile and run the thread_group.cpp,I got these message: (gdb) bt #0 ~function0 (this=0xbffaacd0) at function_template.hpp:313 #1 0x080497c6 in main (argc=1, argv=0xbffaada4) at thread_group.cpp:17 (gdb) step Program received signal SIGSEGV, Segmentation fault. [Switching to Thread -1208067152 (LWP 29013)] 0x08049c57 in boost::detail::function::void_function_invoker0<void (*)(), void>::invoke (function_ptr= {obj_ptr = 0xb7fe53af, const_obj_ptr = 0xb7fe53af, func_ptr = 0xb7fe53af, data = "?}) at function_template.hpp:103 103 BOOST_FUNCTION_RETURN(f(BOOST_FUNCTION_ARGS)); and I got the same message when I use thread_group my system version :Linux version 2.6.9-5.EL ( bhcompile(a)decompose.build.redhat.com) (gcc version 3.4.3 20041212 (Red Hat 3.4.3-9.EL4)) boost:1.33.1

1 0

[Proto] Extracting types of sub-expression in transform
by Ivan Godard 21 Oct '08

21 Oct '08

Eric Niebler wrote: Anybody who understands van Wijngaarden grammars can help by explaining them to me in small words. :-) A van Wijngaarden Grammar definition for some target language (Algol68 in this case) is essentially an executable program written in a text substitution language i.e. VWG itself. If a candidate program purportedly written in the language defined by the grammar (Algol68) is submitted to an interpreter for the VWG language definition and the result is the empty string then the submitted program is well formed according to the grammar. If the result of the exercise is not the empty string then the submitted program contains an error. The content of the left-over string (if one happens) is a clue about what was wrong in the submitted program, but practical compilers do not just run the submitted program against the grammar and tell you the result if any. Instead, the grammar is turned into a more conventional parser (automatically one hopes) so that actions can be performed as the grammar engine does the substitutions. These actions kick out the intermediate code for conventional middle- and back-ends. Note that such a parser is not pure syntax - because the VWG grammar embeds type and semantic constraints as well as syntactic ones, the actions can contain type and semantic behavior as well as conventional ASTs (Abstract Syntax Trees) - no separate bug-ridden semantic pass is needed. You can validly see the VWG definitional mechanism as merely writing a canonical compiler for the target language and then using that compiler for the definition. The advantage of writing this compiler in VWG instead of say C is the brevity and rigor of the grammar representation. However, VWG does not remove the fundamental ontological paradox involved in language definition and indeed involved in mathematics itself, where the problem of axioms remains since the Greeks. Ivan p.s. a tutorial for two-level Grammars is at http://homepages.cwi.nl/~steven/vw.html, but the surface syntax (of the Grammar) is somewhat different from that used in the Report. p.p.s. Also note that VWG is only a notational device for language definition; it still leaves the definition of the language itself up to the designer. Consequently designing a practical language remains. Thus it is trivial to write a VWG grammar that contains free non-terminals such that the syntax check of a candidate program in the defined language is equivalent to the halting problem. You thought gcc was slow? As a practical matter Algol68 was carefully defined to be LL(1) and compilable by a one-pass compiler with single-symbol lookahead, but that was the choice of the designers and not required by VWG. Would that C had been so designed! :-)

2 1

[Boost.Python] Can't work out what an extractor does
by Kirit Sælensminde 21 Oct '08

21 Oct '08

I've been puzzling around about how to deal with converting my string type to/from Python. I've managed to get one part of the puzzle solved, but can't work out from the documentation what the other part is. The code I have so far is this: namespace { struct to_pystr { static PyObject *convert( const fostlib::string &s ) { std::wstring u( fostlib::coerce< std::wstring >( s ) ); return PyUnicode_FromWideChar( u.c_str(), u.length() ); } static PyTypeObject const* get_pytype() { return &PyUnicode_Type; } }; } BOOST_PYTHON_MODULE( crypto ) { using namespace boost::python; // fostlib::string fostlib::sha1( const fostlib::string& ) def( "sha1", fostlib::sha1 ); implicitly_convertible< fostlib::native_string, fostlib::string >(); to_python_converter< fostlib::string, to_pystr, false >(); } This works ok if the Python type is str, but it doesn't work for unicode strings: Boost.Python.ArgumentError: Python argument types in crypto.sha1(unicode) did not match C++ signature: sha1(fostlib::string) What I guess I need is some way to wrap the Python call PyUnicode_FromObject in order to construct my string type, probably from PyObject, but certainly from unicode. From the documentation at [1] it isn't at all clear what actually needs to be done -- I can't even tell from that what the function signature I need to code to is. I think this [2] is relevant, but can't work out in what way -- no mention is made of where the reference object comes from and nor is there an example of the implementation of a simple extractor concept -- the internal implementations of the ones given on the page are far from illuminating. [1]http://www.boost.org/doc/libs/1_36_0/libs/python/doc/v2/Extractor.html [2]http://www.boost.org/doc/libs/1_36_0/libs/python/doc/v2/lvalue_from_pytyp… It looks like there's some good emails linked from this page [3], but unfortunately the links to the Python list archives are broken. [3]http://www.boost.org/doc/libs/1_36_0/libs/python/doc/internals.html I did think about exposing my string class, but the __unicode__ operator doesn't seem to be supported. Adding it to the relevant Boost.Python headers doesn't appear to be enough to get it working and I don't think that is the right way to do this either. So, basically, I guess there ought to be a fairly simple way to add this sort of type conversion into the Boost.Python type registry, but it appears to be undocumented and I can't see anything for this in the examples or the tests in the library either. K

1 0

end of line continuation for parse_config_file function
by Muktipada Behera 21 Oct '08

21 Oct '08

namespace po = boost::program_options does parse_config_file function support an end-of-line continuation using the backslash character '\' in INI file. One should be able to specify libraries as follows: ink_library = tc300c10v10v_hs_levelshifter_worst.db_Tj125_pg \ tc300c10v12v_hs_levelshifter_worst.db_Tj125_pg \ tc300c10v_hs_worst.db_Tj125_pg:tc300c10v_lp_worst.db_Tj125_pg Similarly, always_on_signals as: always_on_signals = tb.u_top.uSD_BLK.tmp31,\ tb.u_top.uSD_BLK.tmp32, \ tb.u_top.uSD_BLK.out3 Besides readability, we may run into issues due to number of characters per line allowed without support for backslash. Any help will be appreaciated. Regards, -mukti __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

1 0

Segmentation fault when using std::string in stl::maps in shared memory
by hamsinv 21 Oct '08

21 Oct '08

Hello All, I have been trying boost library for sharing stl::maps using shared memory. I am able to run the example code on sharing stl::maps successfully. It uses int-float pair to store in map. I have to store std::string-int pair. Writing into the map, works fine, yet reading the same from a different process results in Segmentation fault. Both the Process are as follows: Process1.cpp --------------------- ////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2006-2007. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/interprocess for documentation. // ////////////////////////////////////////////////////////////////////////////// #include <iostream.h> #include "boost/interprocess/detail/config_begin.hpp" #include "boost/interprocess/detail/workaround.hpp" //[doc_map #include "boost/interprocess/managed_shared_memory.hpp" #include "boost/interprocess/containers/map.hpp" #include "boost/interprocess/allocators/allocator.hpp" #include <functional> #include <utility> int main () { using namespace boost::interprocess; shared_memory_object::remove("MySharedMemory"); try{ managed_shared_memory segment (create_only ,"MySharedMemory" //segment name ,65536); //segment size in bytes typedef int KeyType; typedef std::string MappedType; typedef std::pair<const int, std::string> ValueType; typedef allocator<ValueType, managed_shared_memory::segment_manager> ShmemAllocator; typedef map<KeyType, MappedType, std::less<KeyType>, ShmemAllocator> MyMap; ShmemAllocator alloc_inst (segment.get_segment_manager()); MyMap *mymap = segment.construct<MyMap>("MyMap") //object name (std::less<int>() //first ctor parameter ,alloc_inst); //second ctor parameter //Insert data in the map for(int i = 0; i < 10; ++i){ cout<<"I value is: "<<i<<endl; mymap->insert(std::pair<const int,std::string>(i,"Hello")); } mymap = segment.find<MyMap>("MyMap").first; cout<<"Shared memory map created"<< mymap<<endl; for( MyMap::iterator it = mymap->begin();it != mymap->end();++it) { cout<<"key: "<<(*it).first<<" Value: "<<(*it).second<<endl; } } catch(...){ shared_memory_object::remove("MySharedMemory"); throw; } return 0; } Process2.cpp -------------------- ////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2006-2007. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/interprocess for documentation. // ////////////////////////////////////////////////////////////////////////////// #include <iostream.h> #include "boost/interprocess/detail/config_begin.hpp" #include "boost/interprocess/detail/workaround.hpp" //[doc_map #include "boost/interprocess/managed_shared_memory.hpp" #include "boost/interprocess/containers/map.hpp" #include "boost/interprocess/allocators/allocator.hpp" #include <functional> #include <utility> int main () { using namespace boost::interprocess; try{ managed_shared_memory segment (open_only ,"MySharedMemory" //segment name ); typedef int KeyType; typedef std::string MappedType; typedef std::pair<const int, std::string> ValueType; typedef allocator<ValueType, managed_shared_memory::segment_manager> ShmemAllocator; typedef map<KeyType, MappedType, std::less<KeyType>, ShmemAllocator> MyMap; MyMap *mymap = segment.find<MyMap>("MyMap").first; //object name for( MyMap::iterator it = mymap->begin();it != mymap->end();++it) { cout<<"key: "<<(*it).first<<" Value: "<<(*it).second<<endl; } } catch(...){ shared_memory_object::remove("MySharedMemory"); throw; } return 0; } Could anyone please tell me what's going wrong and how can i use std::string as key and int as value. Thank you. -- View this message in context: http://www.nabble.com/Segmentation-fault-when-using-std%3A%3Astring-in-stl%… Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

How does BOOST_TYPEOF works?
by Peng Yu 21 Oct '08

21 Oct '08

Hi, I tried to read the source code to figure out how BOOST_TYPEOF works. But I still don't understand how it works. Can somebody tell me how it works? Thanks, Peng

2 1

Multi-Array indexing
by todd keeler 20 Oct '08

20 Oct '08

Hi, I'd like to understand how the Boost Multi-array implements multiple indexing using the regular square bracket operator. I've waded through the template code for a few hours, from what I understand, there's a nested bunch of sub-arrays which leads to a final object which offers a reference into the data array. I still can't figure out, however, how it solves this problem: Consider a Multi-Array A with dimension 3, Calling A[ i ][ j ][ k ] requires a call to A[ i ] which returns a Subarray, S1 The subarray gets indexed S1[ j ] and another subarray S2 is returned. however S2[k] doesn't return a subarray, but a reference to the data in the multiarray. However, S1 and S2 are the same object (subarray), hence require the same overloaded operator, returning the same type. making this unfeasible. Therefore, the only way I can think to eliminate this dilemma is to have a different object type for every dimension. I'm not sure if this is what Multi-array does, but I'd sure like to know how it's done . Thanks Todd

3 2

[Proto] Extracting types of sub-expression in transform
by Ivan Godard 20 Oct '08

20 Oct '08

Various comments: http://en.wikipedia.org/wiki/Algol68: I don't see any discussion there of van Wijngaarden grammars, or even anything that is recognizable as a formal grammar. What am I supposed to be looking at on that page? The Wikipedia Algol68 article is a reasonable brief informal introduction. It does not mention VWG; I cited it so you could see what VWG was used to define, and so you would have a more congenial starting point than the Algol68 definition itself. http://burks.brighton.ac.uk/burks/language/other/a68rr/rrtoc.htm I see a large table of contents there. Care to narrow it down for me? This citation is the formal definition. The discussion of the definition mechanism is chapter 1. Chapters 2-9 are the language proper; 10-11 are what a modern language would call the "standard library" and in this context can be ignored; and 12 is tabular summary material that appears to have been omitted from the document. The whole report is <10% the size of of the C++ standard /without/ its standard library, and for a richer language than C++ at that. In consequence the definition is extremely dense semantically. For example, Algol68 permits slicing (a generalization of subscripting) a multidimensional array so that the result is an array of the same or less dimension that is a regular partial alias of the original. For example, given a rectangular matrix you can apply a slicing operation that yields the tridiagonal of the original, which then can be manipulated as an array in its own right. The /whole /formal definition of this capability (including syntax, type and semantic definition) is this gem in VWG (from 5.3.2.1 in the cite): a) *REFETY MODE1 NEST slice*{5D <http://burks.brighton.ac.uk/burks/language/other/a68rr/rr5.htm#51D> } * : weak REFLEXETY ROWS1 of MODE1 NEST PRIMARY*{5D <http://burks.brighton.ac.uk/burks/language/other/a68rr/rr5.htm#51D> } *, ROWS1 leaving EMPTY NEST indexer*{b,c,-}* STYLE bracket, where (REFETY) is derived from (REFLEXETY)*{531b,c <http://burks.brighton.ac.uk/burks/language/other/a68rr/rr53.htm#5311b> ,-}*; where (MODE1) is (ROWS2 of MODE2), weak REFLEXETY ROWS1 of MODE2 NEST PRIMARY*{5D <http://burks.brighton.ac.uk/burks/language/other/a68rr/rr5.htm#51D> } *, ROWS1 leaving ROWS2 NEST indexer*{b,d,-}* STYLE bracket, where (REFETY) is derived from (REFLEXETY)*{531b,c <http://burks.brighton.ac.uk/burks/language/other/a68rr/rr53.htm#5311b> ,-}*. * The rest of the section comprises a few non-terminal definitions that are used in the above, examples of each production rule, and a (perhaps) helpful narrative comment to explain the lot: {A *subscript* decreases the number of dimensions by one, but a *trimmer* leaves it unchanged. In rule a, *'ROWS1'* reflects the number of *trimscripts* in the *slice*, and *'ROWS2'* the number of these which are *trimmers* or *revised-lower-bound-options*. If the value to be sliced is a name, then the yield of the *slice* is also a name. Moreover, if the mode of the former name is *'reference to flexible ROWS1 of MODE'*, then that yield is a transient name (see 2.1.3.6.c <http://burks.brighton.ac.uk/burks/language/other/a68rr/rr213.htm#2136c> ).} Note that Algol68 dates from the days when Fortran II was the preeminent language for such things; C did not exist; object orientation was known only in an obscure simulation language; and even the notion of structured programming was not yet fully worked out. If you really want to pursue this then I strongly recommend that you start with Lindsey & van der Meulen (Lindsey, C.H. and van der Meulen, S.G., /Informal Introduction to ALGOL 68/, North-Holland, 1971). It is well written and clear, and you will know far more about language design and definition than perhaps you really wanted when you have finished it. As for my own contribution: How badly do you want to see something like this in Boost? Badly enough to jump in and get your hands dirty with some code? Maybe you could help me to add two-level grammar support to Proto. the answer is not badly enough to do it myself, and you (or anyone) have /much /to do even before deciding to actually try. Yes, I'll help, but I have no capacity to hand-hold. However, by all means jump in: Well, is there room for *yet another guy* in this stuff cause I'm really interested to get somethign out of this. However, the boost list is probably not the right place. You can reach me directly through /ivan at ootbcomp dot com/. Google has a lot on both Algol68 and van Wijngaarden grammars. Have fun :-) Ivan

3 2

Boost Graph Layout with Fixed Nodes
by Donovan Parks 20 Oct '08

20 Oct '08

Hello, I wish to layout a graph using a force-directed layout algorithm, but where a few of the nodes are fixed. That is, there is a subset of nodes that have a predetermined position that must be maintained. Is it possible to achieve such behavior using one of the boost graph layout algorithms? I have been over the documentation for each and my conclusion would be that such behavior is not possible. Has anyone tried this before? Can anyone point me to some resources that aim to achieve this sort of layout? Any and all suggestions welcomed. Thanks. Regards, Donovan

1 0

Can not compile a program that uses typeof, package by gcc?
by Ivan Godard 20 Oct '08

20 Oct '08

Peng asked: Can somebody let me know if the following code can be compiled by a more recent version of gcc or some other compiler? The gcc folks themselves use the EDG front end to check bug reports against gcc/g++. The EDG front end is used by Intel's ICC compiler and many others. There is a great online service through which you can try your code against this compiler: http://www.comeaucomputing.com/tryitout/ I heavily use this Comeau service, not only for actual gcc bugs (I've reported a ton) but also to make progress when the bug is between my ears and gcc is not being helpful. The EDG diagnostic quality is way beyond gcc - they even do a better job of the cryptic error message stacks from template metaprogramming. Ivan

1 0