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

A toolset for PSP
by Bruno Lalande 29 Mar '08

29 Mar '08

Hello, Maybe this can interest somebody here. I have written a toolset to compile Boost libraries for the Sony PSP console using the unofficial SDK provided by the PS2DEV team (http://ps2dev.org) based on GCC. The toolset is itself based on the Boost's original GCC toolset. I've opened a project on SourceForge (http://boost4psp.sourceforge.net) where you can download this toolset (package boost4psp-toolset) as well as some binaries compiled for PSP (package boost4psp). Binaries provided for now are Boost.Graph, Boost.Signals and Boost.Test (my personal need was originally to use Boost.Signals on PSP). I will add some more libraries from time to time (for those that are not platform-specific, obviously). Regards Bruno

1 0

[boost.thread] Porting Windows event to boost::condition
by Raider 29 Mar '08

29 Mar '08

I'm porting WinAPI code to boost.thread. Confused converting Windows event to boost::condition... There are two threads, one waiting to another: HANDLE Event; // shared Event = CreateEvent(NULL, TRUE, FALSE, NULL); ... void Thread1() { ResetEvent(Event); MyCode::CreateThread2(); if (WaitForSingleObject(Event, 500 /*ms*/) != WAIT_OBJECT_0) ... } void Thread2() { SetEvent(Event); } My solution looks like this: boost::condition Condition; ... void Thread1() { MyCode::CreateThread2(); boost::mutex m; boost::mutex::scoped_lock l(m); if (!Condition.timed_wait(l, make500msdelay())) ... } void Thread2() { Condition.notify_all(); } Am I using boost::condition right way? Is `m' mutex nessesary? -- Raider

3 3

Passed by Reference/Value?
by Venkatraman S 29 Mar '08

29 Mar '08

Hi, How are the C++ and Python objects maintained when the context switch happens between the two - i.,e in the following example, once i create an object of Var in Python and pass it to C++ - does it pass by reference or value? The reason why i am asking is this because , we are developing a highly 'memory optimized' application and need very judicious use of the memory - and hence expect it to happen via reference. I tried to use Valgrind package and look at the dumps , but was flummoxed by the dumps - couldnt comprehend it :) Regards, -- Venkat Blog @ http://blizzardzblogs.blogspot.com

1 0

Python/C PyRun_String
by Venkatraman S 29 Mar '08

29 Mar '08

Hi All, Am using Pythong/C API for embedding. I have written a small-simple wrapper that does the low level functions and exposes the functionalities in a c++ style(i.,e the application layer doensnt use 'PyObject'). I am reading the contents of a file(Python script) and am running the same using PyRun_String; the script setups some variables in the Main Dict which i access it using the PyArg_Parse...etc etc(the standard way). This keeps running in a loop - i.,e it needs to be processed for every transaction - hence the Python wrapper is a singleton which preserves the main dict. Am stumbling on a problem wherein when i try to access a variable in Python from C as a string - this variable in python was constructed by concatenating a float with a string(using 'str'), and hence the resulting python variable is also a string. If i comment out the variable , then the program runs fine; else it(C program) throws out a segmentation fault. A clueless as to how to debug this and suitable hints would be immense help. (If required , i can share the code for this - i just didnt want to send it here) Secondly, can anyone point me to the Boost::python way of embedding - basically, i would like to know how to build/compile the program without using bjam. Regards, -- Venkat Blog @ http://blizzardzblogs.blogspot.com

1 0

boost.program_options or boost bjam build issue
by Dan Pieczynski 28 Mar '08

28 Mar '08

I had rebuilt my library using bjam because I needed a 32 bit Linux build(while on a 64 bit machine). I built the libraries and linked them into my project. I was attempting to use my local boost files, but I get an error referring to another boost include directory which is a different version. I don't specify the path being referred to in my link steps anywhere, so I'm assuming my build with bjam didn't specify a necessary define. The error I see is: main.o(.gnu.linkonce.t._ZN5boost15program_options25basic_command_line_parserIcEC1EiPPc+0x53): In function `boost::program_options::basic_command_line_parser<char>::basic_command_line_parser(int, char**)': /usr/include/boost/program_options/detail/parsers.hpp:42: undefined reference to `boost::program_options::common_command_line_parser::common_command_line_parser(std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > const&)' Where it refers to /usr/include/boost/program_options/detail/parsers.hpp while my intent was to use BOOST_ROOT=/home/dpieczynski/opt/libs/BOOST/boost_1_34_1/lib32 To build the library I defined BOOST_ROOT, then ran "./configure -prefix=lib32 -includedir=/home/dpieczynski/opt/libs/BOOST/boost_1_34_1" The library was then built with: bjam cxxflags=-m32 linkflags=-m32 cflags=-m32 architecture=x86 address-model=32 -d2 link=shared --prefix=lib32 threading=multi debug install -a What needs to be done to prevent the reference to /usr/include/boost? Thanks for your time and help. Dan Pieczynski _______________________________________________________ The information in this email or in any file attached hereto is intended only for the personal and confiden- tial use of the individual or entity to which it is addressed and may contain information that is propri- etary and confidential. If you are not the intended recipient of this message you are hereby notified that any review, dissemination, distribution or copying of this message is strictly prohibited. This communica- tion is for information purposes only and should not be regarded as an offer to sell or as a solicitation of an offer to buy any financial product. Email trans- mission cannot be guaranteed to be secure or error- free. P6070214

2 2

variant comparison operators
by Jiri Palecek 28 Mar '08

28 Mar '08

Hello, is there some deep reason why comparing variant to a nonvariant is disabled? For example: variant<int, string> v=1; assert(v==1); // doesn't compile The problem is that there are overloads for anything else than a variant, which explicitely fail to compile (via static_assert and other means). If they weren't there, everything would work (the comparison would invoke conversion constructor, and then normal variant/variant comparison. Another problem is that variant includes the == operator, but not !=, even though this could be easily achieved with boost::operators. I can send patches if that would help. Regards Jiri Palecek

2 1

Asio deadline_timer does not work when io_service::run is called from a Python thread.
by Eric Newhuis 28 Mar '08

28 Mar '08

Dr. Egon Spengler: There's something very important I forgot to tell you. Dr. Peter Venkman: What? Dr. Egon Spengler: Don't cross the streams. Apparently my deadline_timers don't work when I call io_service::run from python on Linux. Has anyone encountered this and worked around the problem?

1 1

Re: [Boost-users] nondynamic: A utility class that promotes safe programming
by Daniel Lidström 28 Mar '08

28 Mar '08

Ovanes wrote: [snip] > What do you think how this allocator will allocate the number > of these element? Actually in any possible way. > It can use new[] or new char[sizeof(T)*NumElems] or use an > own mem-manager. And the worse thing you can't make > allocator friend of your class, since users of containers can > pass their own allocators. > And despite all enumerated facts you will fail to compile, > since the function address will fail to return the pointer to > x, because it is prohibited in your case. Yes, well boost::noncopyable also prohibits something :-) The whole intent of nondynamic is to prohibit (or make difficult) dynamic allocation/pointer usage. Do you think boost::noncopyable has a valid purpose, but nondynamic is less useful? -- Daniel

4 3

Re: [Boost-users] nondynamic: A utility class that promotes safe programming
by Daniel Lidström 28 Mar '08

28 Mar '08

Hello Ovanes, Ovanes wrote: > Hello Daniel, > > I thought about such a class as well. The main disadvantage of it > is that it is impossible to use with standard containers. :( > Standard containers (e.g. std::vector) pre-allocate space for > some number of instances and use the placement new operator to > place items in the pre-allocated memory and when deriving form > nondynamic makes it impossible. As I understand it, the standard containers use the global placement new, which cannot be overridden. These lines are actually ok to do it seems: char dataIOBuffer[sizeof(DataIO)] = {0}; DataIO* inplaceCreated = ::new(dataIOBuffer)DataIO(IDataIOPtr()); Regardless of where I place (no pun intended) the placement new operator in nondynamic. -- Daniel

3 2

Re: [Boost-users] object relational mapping library
by Pavlo Korzhyk 28 Mar '08

28 Mar '08

> Very cool indeed! > > However, from a quick glance at your tutorial, it seems you could have > folded this back into Boost.Serialization by writing a sqlite3 archive. > Is there some reason you chose not to do this? The main reason is the difference between "serialization" and "persistence". Boost.Serialization is not designed for "random access" to the data files. Consider a situation when you store several structs in one XML file. Serialization doesn't provide you any means to edit or at least extract only one specific element. All you can do is load the whole file, update some entries and write the whole set back to disc. You can build your own persistence solution on top of Boost.Serialization, but you have to do it yourself. And hiberlite is a persistene library - the main idea is to provide the smart pointers to objects inside the SQLite database. We really need some sort of SQL support in Serialization, but I don't see any good way to integrate features like primary keys, queries, tables metamodel, etc. So simply adding some sqlite output will look like a new file format, and that's not what RDBMS software is built for. But I agree, an idea of sqlite3_archive is very attractive, and also very challenging. http://code.google.com/p/hiberlite/ Yours sincerely, Pavlo Korzhyk ICQ#155870780

1 0

Need help with boost.variant and apply_visitor method overloading.
by Kevin Scarr 28 Mar '08

28 Mar '08

Hi I am trying to implement a system for ensuring producers and consumers agree on the data type they are exchanging. However, I also have "general" containers which can send or receive anything (mainly routing components). Anyway, I have tried to setup the following code to implement this scheme, however When I compile code (on MSVC 2005), I see the following error: Error 1 error C3066: there are multiple ways that an object of this type can be called with these arguments; unable to recover from previous error(s); stopping compilation c:\boost-1_34_1\boost\variant\detail\apply_visitor_binary.hpp 63 I have tracked it down to the first two overloads where I am trying to connect a consumer/producer of a specific type to a general producer/consumer. What am I doing wrong? The compiler obviously thinks that it can cast a (for example) G2Consumer<t1>* into a G2Consumer<DataTypes>*, so it cannot resolve which overload to use. How can I tell it not to cast?? Thanks for your help, Kevin typedef boost::variant<t1*,t2*,t3*> DataTypes; typedef boost::variant< G2Consumer<t1>*, G2Consumer<t2>*, G2Consumer<t3>*, G2Consumer<DataTypes>* > G2ConsumerTypes; typedef boost::variant< G2Producer<t1>*, G2Producer<t2>*, G2Producer<t3>*, G2Producer<DataTypes>* > G2ProducerTypes; class doConnectConsumerToProducer : public static_visitor<> { public: template<typename T> void operator() ( G2Consumer<DataTypes>* consumer, G2Producer<T>* producer ) const { consumer->RegisterAsConsumer( *producer ); } template<typename T> void operator() ( G2Consumer<T>* consumer, G2Producer<DataTypes>* producer ) const { consumer->RegisterAsConsumer( *producer ); } template<typename T> void operator() ( G2Consumer<T>* consumer, G2Producer<T>* producer ) const { consumer->RegisterAsConsumer( *producer ); } template<typename C, typename P> void operator() ( G2Consumer<C>* consumer, G2Producer<P>* producer ) const { G2Base* c = dynamic_cast<G2Base*>(consumer); G2Base* p = dynamic_cast<G2Base*>(producer); std::ostringstream msg; msg << "Incompatible consumer(" << typeid(*c).name() << ") and producer(" << typeid(*p).name() << ") types" << std::ends; throw G2::exception( msg.str().c_str() ); } }; // Helper function to drive this above. void connectConsumerToProducer( G2ConsumerTypes& c, G2ProducerTypes& p ) { apply_visitor( doConnectConsumerToProducer(), c, p ); }

2 1

variant cast operators?
by Daniel Oberhoff 28 Mar '08

28 Mar '08

Hi, I am playing with boost::variant to introduce a more elegant property system into my current project. I was wondering why there are no cast operatorst defined for the variant types, to avoid having to type get<>: boost::variant<double,int,string> v; string s = v; is there a basic reason why this is not possible? Best Daniel

2 1

[statechart] post_event() and Boost.Bind
by Commander Pirx 28 Mar '08

28 Mar '08

Currently I don't understand why the following code dosn't compile (with VC 8.0). I simply try to bind the post_event() method from the state_machine to a function object. To illustrate the problem I've added the following code to the Camera.hpp file of the Camera example from the Statechart library: #include <boost/function.hpp> #include <boost/bind.hpp> <snip> struct Camera : sc::state_machine< Camera, NotShooting > { // @test start typedef boost::function< void( const event_base_type& ) >process_event_fun; typedef boost::function< void( const event_base_type& ) > post_event_fun; process_event_fun process_event_fun_; post_event_fun post_event_fun_; Camera() { process_event_fun_ = boost::bind( &Camera::process_event, boost::ref( *this ), _1 ); // the following line doesn't compile with VC 8.0 // post_event_fun_ = boost::bind( &Camera::post_event, boost::ref( *this ), _1 ); } // @test end bool IsMemoryAvailable() const { return true; } bool IsBatteryLow() const { return false; } }; After uncommenting the marked line the compiler produce more than 200 error messages: A function template has too few arguments. But the line above compiles very well and the process_event() method has the same signature. The post_event() method is polymorphic. But this shouldn't be a problem. Should it?

2 2

[pointer_container] and std::back_inserter
by Jeff Flinn 28 Mar '08

28 Mar '08

Are pointer_container's intended to be compatible with std::back_inserter? I've also tried calling insert and assign. I've tried: #include <boost/ptr_container/ptr_vector.hpp> #include <iterator> #include <vector> #include <memory> int main() { boost::ptr_vector<int> int_ptrs; *std::back_inserter(int_ptrs) = new int(123); *std::back_inserter(int_ptrs) = std::auto_ptr<int>(new int(456)); std::vector<int*> ptrs(1, new int(123)); int_ptrs.insert(int_ptrs.end(), ptrs.begin(), ptrs.end()); return 0; } Thanks, Jeff

3 5

Boost Pool - error: segmentation fault
by Joost Meijles 28 Mar '08

28 Mar '08

Hi All, I am trying to use the Boost Pool library, more specifically I am trying to use the singleton pool interface. Everything seems to work fine, till the moment I use it to create an object from a class containing a (STL) map, which results in a segmentation fault. Does anyone know why this happens, or how to work around it? What I find also strange is that the constructor and destructor of the class doesn't seem to be called when using the pool. Is this normal behavior? Please find below the example that causes the segmentation fault (and the not calling of the constructor/destructor issue). Thanks a lot in advance. Kind regards, Joost ========================================== class MyClass { public: int x; vector y; map z; }; int main() { typedef boost::singleton_pool myPool; MyClass * const t = (MyClass *) myPool::malloc(); t->x = 1; t->y.push_back(2); t->z.insert(make_pair(3,3));//causes segmentation fault myPool::purge_memory(); } ========================================== _________________________________________________________________ Probeer Live Search: de zoekmachine van de makers van MSN! http://www.live.com/?searchOnly=true

4 5

Build CSR graph from a file in graphviz format
by Johan Oudinet 28 Mar '08

28 Mar '08

Hi, I read the csr-example.cpp that explain how to use compressed_sparse_row_graph and output it in graphviz format (.dot), and I'd like building a csr graph from a file in DOT format. So I tried using read_graphviz but actually it doesn't work with CSR graph (see below for my code). Does someone successfully build a CSR graph from a DOT file ? Regards, //===== csr.cc ===== # include <iostream> # include <string> # include <fstream> # include <boost/graph/compressed_sparse_row_graph.hpp> # include <boost/graph/iteration_macros.hpp> # include <boost/graph/graphviz.hpp> struct Node { std::string name; }; int main () { typedef boost::compressed_sparse_row_graph<boost::directedS, Node> graph_t; // Try to read the CSR graph g from foo.dot graph_t g; std::ifstream in("foo.dot", std::ios::in); boost::dynamic_properties dp; dp.property ("node_id", boost::get (&Node::name, g)); bool status = read_graphviz(in, g, dp, "node_id"); // doesn't work, see below for the error message BGL_FORALL_VERTICES (v, g, graph_t) std::cout << g[v].name << std::endl; BGL_FORALL_EDGES (e, g, graph_t) std::cout << g[source (e, g)].name << " -> " << g[target (e, g)].name << std::endl; } //================ The error message with g++ 4.1.3: /usr/include/boost/graph/graphviz.hpp:721: error: conversion from 'boost::csr_edge_descriptor<unsigned int, unsigned int>' to non-scalar type 'std::pair<boost::csr_edge_descriptor<unsigned int, unsigned int>, bool>' requested <8==== foo.dot ===== digraph { 0 -> 3; 0 -> 4; 1 -> 3; 1 -> 4; 2 -> 3; 2 -> 4; 3 -> 4; } ================= -- Johan Oudinet

1 0

nondynamic: A utility class that promotes safe programming
by Daniel Lidström 28 Mar '08

28 Mar '08

Hi there! (I recently posted a similar message to microsoft.public.vc.language, but the response was so bad I thought I would post here instead.) I have created a utility class that I think is useful, called nondynamic. The purpose is sort of like boost::noncopyable, but I disallow any dynamic/ pointer usages. For example, & and -> are disabled. Operator new/delete as well. Let me show nondynamic: // all members are private class nondynamic { // disallow operator new static void* operator new(std::size_t); static void* operator new(std::size_t, const std::nothrow_t&) throw(); static void* operator new[](std::size_t); static void* operator new[](std::size_t, const std::nothrow_t&) throw(); // disallow operator delete static void operator delete(void*){} static void operator delete(void*, const std::nothrow_t&) throw(){} static void operator delete[](void*){} static void operator delete[](void*, const std::nothrow_t&) throw(){} // disallow address-of const nondynamic* operator&() const; /* */ nondynamic* operator&() /* */; // disallow -> const nondynamic* operator->() const; /* */ nondynamic* operator->() /* */; }; Using this class is as simple as using boost::noncopyable: struct DataIO : private nondynamic { ... }; Now you are only able to use DataIO as a value type. All other usages are disabled. I think this promotes safe programming, in that pointer usage is minimized (it seems with pointers, new/delete/null is never far away). Let me illustrate how this class can be used most effectively. I thought it would be nice to use nondynamic when you have a class hierarchy, and a factory method. Here's the base class: struct IDataIO { virtual void Write(const std::string& str) = 0; virtual void Read(char* buffer, std::size_t size) = 0; }; typedef boost::shared_ptr<IDataIO> IDataIOPtr; A sample subclass: struct SerialDataIO : IDataIO { void Write(const std::string&) { std::cout << __FUNCTION__ << std::endl; } void Read(char*, std::size_t) { std::cout << __FUNCTION__ << std::endl; } }; Here's the wrapper class that inherits from nondynamic: struct DataIO : IDataIO, private nondynamic { DataIO(IDataIOPtr dataIO) : mDataIO(dataIO) {} void Write(const std::string& str) { mDataIO->Write(str); } void Read(char* buffer, std::size_t size) { mDataIO->Read(buffer, size); } private: IDataIOPtr mDataIO; }; And finally, the factory: DataIO CreateDataIO(int i) { if( i==0 ) return IDataIOPtr(new SerialDataIO); else throw std::runtime_error("Could not create DataIO"); } Now the clients of the class hierarchy uses the wrapper, and are completely isolated from pointers: DataIO dataIO = CreateDataIO(0); dataIO.Write("Hello"); char buffer[1024]; dataIO.Read(buffer, sizeof(buffer)); It should be impossible to misuse DataIO. What do you think about nondynamic? Is it implemented correctly? Named appropriately? Useful at all? Any comments gladly accepted :-) Thanks in advance! -- Daniel

2 1

[move] How to use BOOST_LVALUE_ASSIGN?
by Terry G 28 Mar '08

28 Mar '08

How are BOOST_LVALUE_ASSIGN and BOOST_LVALUE_ASSIGN2 used? How do I know which one to use? Is David Abrahams move.hpp the best library to use for move semantics? I noticed something similar under interprocess. Is there a version of unique_ptr that works with Dave's move.hpp? If not, does it make sense to create one? Its been several years since this was a topic of discussion here. Unfortunately, I didn't need to use it then. Now I do, and C++0X is still over the horizon for a few years for embedded systems. I'm not sure, but I think the compiler I'll be using is GCC 3.4 or later. terry

1 0

intrusive_ptr and incomplete types
by gast128 27 Mar '08

27 Mar '08

Dear all. I was googling about incomplete types and smart pointers but couldn't find a definitive statement about intrusive pointers. >From the header file of intrusive_ptr it seems that it can deal with incomplete types. The constructor and destructor use the 'intrusive_ptr_add_ref' or 'intrusive_ptr_release'. If these are not invoked, use of an intrusive_ptr with incomplete types should be ok. So it seems that below example will compile: //foo.h: #include <boost/intrusive_ptr.hpp> class A; class Foo { public: Foo(); ~Foo(); //leave the dtor out, and it won't work boost::intrusive_ptr<A> m_ptr; }; //bla.cpp: #include "foo.h" void F() { Foo foo; } Is this correct? Or is my (non confirming?) compiler giving me the wrong impression. A good article about incomplete types is 'The Standard Librarian: Containers of Incomplete Types' from Austern. He states that member function which are not referenced in the client code are not checked for incomplete types. For intrusive_ptr this would be the constructor and destructor. wkr, me

2 2

Help linking to Boost in Xcode 3 debug
by Jeremy Conlin 27 Mar '08

27 Mar '08

I am using Boost program_options library. I can successfully compile my code under "Release" mode in Xcode, but under "Debug" mode there are some issues with linking. The compiler says it can't find vtables for some of the program_options stuff (see error messages pasted below). I have tried to compile my code and Boost with the same architecture (i386 only) and telling the linker to find the debug library with the linker flag OTHER_LDFLAGS = -lboost_program_options-d-1_34_1 Can someone help me to figure out why this won't link? I'm sorry if the information is too general. Thanks, Jeremy * "boost::program_options::validate(boost::any&, __gnu_debug_def::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > const&, bool*, int)", referenced from:* * boost::program_options::typed_value<bool, char>::xparse(boost::any&, __gnu_debug_def::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > const&) constin ArnoldiVsPower.o* * "boost::program_options::value_semantic_codecvt_helper<char>::parse(boost::any&, __gnu_debug_def::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > const&, bool) const", referenced from:* * vtable for boost::program_options::typed_value<bool, char>in ArnoldiVsPower.o* * vtable for boost::program_options::typed_value<unsigned long, char>in ArnoldiVsPower.o* * vtable for boost::program_options::typed_value<double, char>in ArnoldiVsPower.o* * vtable for boost::program_options::typed_value<int, char>in ArnoldiVsPower.o* * "boost::program_options::detail::cmdline::cmdline(__gnu_debug_def::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > const&)", referenced from:* * boost::program_options::basic_command_line_parser<char>::basic_command_line_parser(int, char**)in ArnoldiVsPower.o* *ld: symbol(s) not found* *collect2: ld returned 1 exit status*

1 0

Serializing Boost.Tuple
by Sohail Somani 27 Mar '08

27 Mar '08

Hi, Just thought I would share some code that serializes Boost.Tuple using Boost.Serialization: #include <boost/tuple/tuple.hpp> #include <boost/serialization/nvp.hpp> #include <boost/preprocessor/repetition.hpp> namespace boost { namespace serialization { #define GENERATE_ELEMENT_SERIALIZE(z,which,unused) \ ar & boost::serialization::make_nvp("element",t.get< which >()); #define GENERATE_TUPLE_SERIALIZE(z,nargs,unused) \ template< typename Archive, BOOST_PP_ENUM_PARAMS(nargs,typename T) > \ void serialize(Archive & ar, \ boost::tuple< BOOST_PP_ENUM_PARAMS(nargs,T) > & t, \ const unsigned int version) \ { \ BOOST_PP_REPEAT_FROM_TO(0,nargs,GENERATE_ELEMENT_SERIALIZE,~) \ } BOOST_PP_REPEAT_FROM_TO(1,10,GENERATE_TUPLE_SERIALIZE,~); }} It does not handle 0-element tuples (not sure that it should, actually!) Kudos to the insanity that produced Boost.Preprocessor. -- Sohail Somani http://uint32t.blogspot.com

2 6

object relational mapping library
by Pavlo Korzhyk 27 Mar '08

27 Mar '08

Dear List, I use Boost.Serialization in my projects. It's very useful, powerful, and cool. But it doesn't meet some of my data persistence needs. Thus, I present the C++ library for transparent object-relational mapping to SQLite3. It works similar to Java Hibernate, and its API is inspired by Boost.Serialization. http://code.google.com/p/hiberlite/ I hope some of you will find this work useful. Comments on design, usability, proposals, and contributions will be highly appreciated! Yours sincerely, Pavlo Korzhyk skype: pavlo.korzhyk ICQ#155870780

6 6

boost::python PyUnicodeUCS4_FromEncodedObject
by Venkatraman S 27 Mar '08

27 Mar '08

Hi, Am stumbling on a very rudimentary problem and am totally not able to proceed. Googling did not help me much and hence am trying to state the problem in its entirety. Any quick comments/hints would be highly helpful. Am getting the following error when i try to import the module (class) into python : $python >>> import myClass *Traceback (most recent call last): File "<stdin>", line 1, in ? ImportError: ./myClass.so: undefined symbol: PyUnicodeUCS4_FromEncodedObject * *Environment:* g++ (GCC) 4.0.0 20050519 (Red Hat 4.0.0-8) Python 2.4.3 *Other Information:* $ldd myClass.so libstdc++.so.6 => /usr/lib/libstdc++.so.6 (0x00db8000) libm.so.6 => /lib/tls/libm.so.6 (0x002b3000) libgcc_s.so.1 => /lib/libgcc_s.so.1 (0x00eb7000) libpthread.so.0 => /lib/tls/libpthread.so.0 (0x0057a000) libc.so.6 => /lib/tls/libc.so.6 (0x00b6f000) /lib/ld-linux.so.2 (0x00712000) * Files Used :* *myClass.cpp* ------------- #include <boost/python.hpp> #include <boost/python/def.hpp> #include <boost/python/tuple.hpp> #include <boost/python/dict.hpp> #include <boost/python/module.hpp> #include <boost/python/raw_function.hpp> #include <string> class Var { public: int value; std::string name; Var(std::string n) { name=n; value=10; } }; std::string processObj(boost::python::object x) { Var obj=boost::python::extract<Var>(x); return obj.name; } using namespace boost::python; BOOST_PYTHON_MODULE(myClass) { class_<Var>("Var", init<std::string>()) .def_readonly("name", &Var::name) .def_readwrite("value", &Var::value); def("processObj", processObj); } *setup.py* --------------- from distutils.core import setup from distutils.extension import Extension setup(name="myvaarg",ext_modules=[Extension("myvaarg",["sample.cpp "],libraries=["boost_python"])]) $python setup.py build -- Venkat

2 2

boost threads and Qt
by Rainer Thaden 27 Mar '08

27 Mar '08

Hi all, I have a general question regarding threads and signals with boost and Qt. I have a DLL communicating with an external device via Ethernet and a main program with a Qt-GUI for controlling the device. The communciation runs in a different thread than the main program. Qt provides signal/slots across threads, but as I understand it, I have to use the QThread library for it to work. In the DLL I use boost signals and slots and the main program also receives boost signals and then emits Qt's signals to update the GUI, etc. The reason to not use Qt in the DLL was to not force other programmers to use Qt if they want to write their own control application for the DLL. However, I am getting in trouble with synchronization of the threads now and the question is: is it possible / recommended / not recommended to mix Qt's thread API with the boost thread API? Qt provides the possibility of "delayed" signals, that is, a posted signal is queued into the event loop of a thread and, thus, serialized. Is that easily possible with boost threads? Any comments appreciated. Best regards, Rainer

3 5

Boost signals link error
by Michael Dugan 27 Mar '08

27 Mar '08

Hi I am using boost(1.34.1) signals on linux(centos5) with gcc 4.1.2. I can link to the static boost_signals-gcc41-mt library, however the following symbols seem to be missing. They all seem to be related to boost::signals::named_slot_map_iterator. Other symbols such as boost::signals::connection::~connection() are found. ../../../bin/x86_64/32/linux/g++4.1.2/release/libIceExchangeCommon.so: undefined reference to `boost::signals::detail::named_slot_map_iterator::named_slot_map_iterato r(boost::signals::detail::named_slot_map_iterator const&)' ../../../bin/x86_64/32/linux/g++4.1.2/release/libIceExchangeCommon.so: undefined reference to `boost::signals::detail::named_slot_map_iterator::operator=(boost::signa ls::detail::named_slot_map_iterator const&)' ../../../bin/x86_64/32/linux/g++4.1.2/release/libIceExchangeCommon.so: undefined reference to `boost::signals::detail::named_slot_map_iterator::dereference() const' ../../../bin/x86_64/32/linux/g++4.1.2/release/libIceExchangeCommon.so: undefined reference to `boost::signals::detail::named_slot_map_iterator::increment()' ../../../bin/x86_64/32/linux/g++4.1.2/release/libIceExchangeCommon.so: undefined reference to `boost::signals::detail::named_slot_map_iterator::equal(boost::signals:: detail::named_slot_map_iterator const&) const' collect2: ld returned 1 exit status Has anyone seen this before? Thanks in advance. Michael Schneider Trading 4th Floor, 25 Copthall Avenue London EC2R 7BP -------------------------------------------------------- Message from: Michael.Dugan(a)schneidertrading.com Message to: boost-users(a)lists.boost.org Attached files: 0 This e-mail and any files transmitted with it are confidential, may be legally privileged, and are for the sole use of the intended recipient. Copyright in this e-mail and any accompanying document created by us is owned by us. If you are not the intended recipient of this e-mail or any part of it please telephone our IT Department at the number shown above or by e-mail at info(a)schneidertrading.com. You should not use or disclose to any other person the contents of this e-mail or its attachments (if any), nor take copies. This e-mail is not a representation or warranty and is not intended nor should it be taken to create any legal relations, contractual or otherwise. Schneider Trading Associates Ltd (Registration No. 3692131) is incorporated in England and Wales and the registered office is at 25 Copthall Avenue, London EC2R 7BP. The company is authorised and regulated by the Financial Services Authority

1 0

Re: [Boost-users] Ugly warnings from BOOST_STATIC_ASSERT
by Jean-Francois Bastien 27 Mar '08

27 Mar '08

> We have this really neat and simple macro in our project: > #define compile_assert(x) typedef bool > COMPILE_ASSERT[(x) ? 1 : -1] > > Although it does what we need and serves us well, I > tried to replace > it with BOOST_STATIC_ASSERT. Unfortunately this resulted > in a lot of > ugly warnings throughout the compile: > warning: use of old-style cast > There's the following comment in the static assert header: // Note that the argument to the assert is explicitly cast to bool using old- // style casts: too many compilers currently have problems with static_cast // when used inside integral constant expressions. The solution would be to add even more defines to use old style or static casts depending on which compiler is used. JF

6 13

Pointer types that let me specify destructor functions.
by Jason Cipriani 27 Mar '08

27 Mar '08

The boost shared_ptr lets me specify my own destructor function, but shared_ptr does more than I want -- I do not need thread-safety or reference counting, and would like to avoid the associated overhead. What I really want is an std::auto_ptr that lets me specify a destructor function. Does boost have something light-weight like this? Right now I implement my own, sort of like this (with extra conversion stuff): template <class T> class auto_ptr_ex { public: typedef void (* D) (T *); // object + destructor auto_ptr_ex (T *t, D d) : t_(t), d_(d) { } // copied auto_ptr_ex's don't destroy t_ auto_ptr_ex (const auto_ptr_ex &a) : t_(a.t_), d_(NULL) { } ~auto_ptr_ex () { if (d_) d_(t_); } private: T *t_; D d_; }; It's simple enough but I try not to reinvent wheels, so I was wondering if it existed already. Thanks, Jason

2 1

GSoC Projects
by Derrick Hathaway 27 Mar '08

27 Mar '08

Hello, I wonder if some of you who may have had experience with Google's Summer of Code program could give me a little direction. I have an idea which projects I will be applying for. But I had a few questions. First of all, do I need to find a mentor who has already been accepted into the program before I apply? Or, is that part of the deciding factor for being accepted (wether or not there is a mentor for the proposed project)? There are a couple of projects listed in the Boost Wiki [http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Google_Summe…] that I am interested in applying for. I have been using the Boost libraries for a few years now and am anxious for an opportunity to give back. My senior project [http://derrickhathaway.googlepages.com/gsi_mds.tar.gz] is a market data server based upon ASIO and I'm particularly interested in the projects related to that library. I have communicated a little with Michael Dickey who is involved in the development of the Pion Network Library [http://www.pion.org/projects/pion-network-library] He is also working now with the developers of the C++ Network Library [http://sourceforge.net/projects/cpp-netlib] This is one of the GSoC projects I will be proposing/applying for. He has been very helpful, but suggested that I inquire of those who may be involved with Google Summer of Code already. Thanks in advance, Derrick

2 1

[Proto] Reminder: review will end March 28th
by Hartmut Kaiser 27 Mar '08

27 Mar '08

Hi all, this is just a gentle reminder for all intending to write a Proto review to finish it really soon. At the same time this should be understood as an encouragement for all of you still hesitating to write one because you perhaps think the library is too complicated or too exotic and you probably won't be able to write an adequate review. Please do not hesitate! Even a short review based on your experience or based on what you've read in the documentations is highly appreciated. Please consider writing your review not later than March 28th. If you won't be able to finish it in time but still intend to write a review, please contact me directly so we can work out the details. Regards Hartmut Review manager

1 0

boost::filesystem::path and Windows CreateFile()
by pashapal＠aol.com 27 Mar '08

27 Mar '08

Hi, I was hoping someone could help, cause I am stumped. I have a library that opens disk images (img, dd, raw) via a string representing the file of the disk image. I supply the string as the lead argument in the constructor of boost::filesystem::path p(pImagePath, boost::filesystem::no_check) ; It works on?all?platforms tested. However, now I want to open a physical drive directly, rather than an image file in Windows. I have looked up the string representation of drives in Win 32 and apparently //./X: , however, it does not work with the path constructor. I have tried variations with the backslash etc. Windows allows access to a drive through the CreateFile() function, can I use this somehow and convert it into a boost::path? Any idea what I am doing wrong? In essences I want to access a windows drive as a boost::filesystem::path, that I can then later use for memory mapping. Thanks , Pasha boost::filesystem::path p(pImagePath, boost::filesystem::no_check) ; It works on?all?platforms tested. However, now I want to open a physical drive directly, rather than an image file in Windows. I have looked up the string representation of drives in Win 32 and apparently //./X: , however, it does not work with the path constructor. I have tried variations with the backslash etc. Windows allows access to a drive through the CreateFile() function, can I use this somehow and convert it into a boost::path? Any idea what I am doing wrong? In essences I want to access a windows drive as a boost::filesystem::path, that I can then later use for memory mapping. Thanks , Pasha

1 0

Containers question
by James Sutherland 26 Mar '08

26 Mar '08

Fellow boost enthusiasts, I want to be able to store a set of information that contains types. For example: > template<typename T> > void register_field( const FieldID id ) > { > // need to keep a record of (T,id) > } Later on, I need to recover the type and id (T,id) for use. Any thoughts on a way to accomplish this? Thanks for any advice, James

2 3

generic data assign
by Olaf Peter 26 Mar '08

26 Mar '08

Hello, how can I make the snipped more generic in that way, that I can use it with different data members, e.g. as template argument the &actions::m_data::text data address. Then I could write e.g. set_generic<&actions::m_data::text, std::string> set_text; Thanks, Olaf ---8<--- #include <iostream> #include <string> struct data { std::string text; }; struct actions { explicit actions(data& d) : set_text( *this ), m_data( d ) { } template<typename T> struct set_generic { explicit set_generic( actions& actions ) : self( actions ) { } void operator()(const T& data) const { self.m_data.text = data; } private: actions& self; }; set_generic<std::string> set_text; set... data& m_data; }; using namespace std; int main() { data d; actions a( d ); a.set_text( "Hello" ); cout << d.text << endl; } --->8---

2 1

Re: [Boost-users] serialization and ::copyFrom
by Andrei Popa 26 Mar '08

26 Mar '08

Robert Ramey wrote: > Oh, that should be easy: > > D1 *d1p; > > ar << d1; > ar >> *d1p; > > Robert Ramey Hi,At> ar << d1;> ar >> bp; // but "bp" points already to an object of type D1I meant : "bp" is "Base* bp"So, if I call ar >> *bp; the Base::load will be called, not the derived D1:load.Actually more precisely, I intend to do solass Base { ... virtual .. } class D1 : public Base { } Base* bp1 = new D1(..some thing..); Base* bp2 = new D1(..some thing else..); ar << *bp1; ar >> *bp2; This means for all my serializable classes I have a kind of "=" operator defined. regards, Andrei _________________________________________________________________ Invite your mail contacts to join your friends list with Windows Live Spaces. It's easy! http://spaces.live.com/spacesapi.aspx?wx_action=create&wx_url=/friends.aspx…

2 1

Re: [Boost-users] serialization and ::copyFrom
by Andrei Popa 26 Mar '08

26 Mar '08

Hi, First of all, thanks for that "NEW" remark, this is an important information for me. It is not about the D2, I do not intend to copy data from an object of a type into an object of an other type. ar << d1; ar >> bp;// but "bp" points already to an object of type D1 I'm trying to read in data from archive into the object pointed by bp. Is this possible? If not. What other possibilities do I have? Any workaround? Thanks, Andrei _________________________________________________________________ Connect to the next generation of MSN Messenger http://imagine-msn.com/messenger/launch80/default.aspx?locale=en-us&source=…

2 1

Linking problem with Borland C++ 5.6
by Sergey.Tsyrulnikov＠t-systems.com 26 Mar '08

26 Mar '08

I try to compile a simple thread_group-example with Borland C++ 5.6 for Win32. I get the following link error: Error: Unresolved external 'boost::thread_group::create_thread(const boost::function0<void, std::allocator<boost::function_base> >&)' referenced from C:\BACPP\SERVICEADAPTER\SRC\SERG.OBJ I have built the boost_thread-bcb-mt-1_34_1.lib with Bjam and Borland. The examples can be created with the library. The MSVC-Variant works without errors. Link-Call: C:\Programme\Borland\CBuilder6\BIN\ILINK32 -Tpe -r -ap -Gn C:\Programme\Borland\CBuilder6\lib\C0X32.OBJ /v -L..\..\Extern\BCB582\BDP\lib -L..\ ..\Xerces\lib\BCB582 -L..\..\Boost\lib\BCB582 -L..\..\LogEngineBA\lib\BCB582 -LC:\Programme\Borland\CBuilder6\lib serg.obj /LIBPATH:..\..\Extern\BC B582\BDP\lib orb_br.lib vdlog_br.lib vport_br.lib /LIBPATH:..\..\Xerces\lib\BCB582 xerces-bor_2_7_0.lib /LIBPATH:..\..\Boost\lib\BCB582 boost_thread-b cb-mt-1_34_1.lib /LIBPATH:..\..\LogEngineBA\lib\BCB582 LogEngine.lib C:\Programme\Borland\CBuilder6\lib\import32.lib C:\Programme\Borland\CBuilder6\li b\cw32mti.lib , serg.exe Turbo Incremental Link 5.60 Copyright (c) 1997-2002 Borland Error: Unresolved external 'boost::thread_group::create_thread(const boost::function0<void, std::allocator<boost::function_base> >&)' referenced from C:\BACPP\SERVICEADAPTER\SRC\SERG.OBJ RLINK32 Version 6.00 (c) Copyright 1992-2002 Borland Software Corporation. Source: #include <iostream> #include <stdio> #include <boost/thread/thread.hpp> #include <boost/bind.hpp> #include <boost/smart_ptr.hpp> #include <vector> using namespace std ; void doCallThreads(std::string text){ printf("Start Thread .......%s\n", text); } void doCallThreadsXXX(){ printf("Start Thread .......\n"); } void doCallsWithThreads(const int countThreads){ // std::vector<boost::thread *> threads; boost::thread_group threads; for(int i = 0; i<countThreads; i++){ //threads.create_thread(boost::bind(doCallThreads, "hhh")); threads.create_thread(&doCallThreadsXXX); // threads.create_thread(&doCallThreadsXXX); printf("Thread %d gestartet\n", (i+1)); } printf("All threads started\n"); // Warten bis alle thread fertig sind threads.join_all(); printf("All threads stopped\n"); } int main(int argc, char* const* argv) { try { doCallsWithThreads(5); cout << "ENDE" << endl ; } catch(std::exception ex) { cout << "Error: " << ex.what() << endl ; throw; } catch(...) { cout << "Error" ; throw; } return 0 ; } Any idea?????

1 0

[boost] [Graph] need help on remove_vertex ....
by Bernhard Lippmann 26 Mar '08

26 Mar '08

Hi, I need some help on the remove_edge, remove_vertex functions. What is wrong with my two functions, removing edges or vertex from a graph with a given name in the coressponding property map. pls. see code snippet after calling my function a second time I get a run time error. I did the code as shown under http://www.boost.org/libs/graph/doc/adjacency_list.html but I feel the rebuild of the vectors did not work, any input is welcome Best Bernhard this is the code in the main program: // ok MyElementList.RemoveVertexByName("vss!",g, VertexNamesMap); // now the run time error ... MyElementList.RemoveVertexByName("vss!s",g, VertexNamesMap); this is the called sub routine: /*$ **************************************************************************** ** Method Name RemoveVertexByName ()... Parameters std::string AE_Name Return long , Index in Map Description remove vertex with a given name see http://www.boost.org/libs/graph/doc/adjacency_list.html for troubles **************************************************************************** ****** */ void TElementList::RemoveVertexByName(std::string elementname, TGraph &g, TVertexNameMap &VertexNamesMap) { Tvertex_iter vi, vi_end, next; tie(vi, vi_end) = vertices(g); for (next = vi; vi != vi_end; vi = next) { ++next; if (VertexNamesMap[*vi] == elementname) { remove_vertex(*vi, g); } } } /*$ **************************************************************************** ** Method Name RemoveEdgeByName () Parameters std::string AE_Name Return long , Index in Map Description Removes the edge (u,v) from the graph. void remove_edge(vertex_descriptor u, vertex_descriptor v, adjacency_list& g) void remove_edge(edge_descriptor e, adjacency_list& g) **************************************************************************** ****** */ void TElementList::RemoveEdgeByName(std::string elementname, TGraph &g, TEdgeNameMap &EdgeNamesMap) { Tedge_iter xei, xei_end; for (tie(xei, xei_end) = edges(g); xei != xei_end; ++xei) { Tedge_descriptor e = *xei; if (EdgeNamesMap[e] == elementname) { remove_edge (e,g); } // Tvertex_descriptor u = source(e, g), v = target(e, g); // if .... (option 29 } } No virus found in this outgoing message. Checked by AVG. Version: 7.5.519 / Virus Database: 269.21.8/1339 - Release Date: 22.03.2008 16:43

2 1

vertex_descriptor NULL check
by Hardik Kheskani 26 Mar '08

26 Mar '08

I am using adjacent lists and using vertex_descriptors. Is there a way to check if the vertex_descriptor is NULL or 'not assigned' yet? graph_traits < adjacent_list_graph >::vertex_descriptor vd ; can I assign this to NULL ? and can I use vd == NULL or vd != NULL ? Any help/info is greatly appreciated. Hardik True religion is real living; living with all one's soul, with all one's goodness and righteousness. -Albert Einstein I got a simple rule about everybody. If you don't treat me right shame on you! -Louis Armstrong ____________________________________________________________________________________ Be a better friend, newshound, and know-it-all with Yahoo! Mobile. Try it now. http://mobile.yahoo.com/;_ylt=Ahu06i62sR8HDtDypao8Wcj9tAcJ

2 1

[mpl] Sorting types by index
by Scott Meyers 26 Mar '08

26 Mar '08

I have an mpl::vector of all possible types I care about. It's called AllTypes. Given a sequence containing some subset of types in AllTypes, I want to order the sequence so that the types occur in the same relative order as in AllTypes. So if AllTypes is A, B, C, D, E and I'm given B, E, A I want to produce A, B, E Fundamentally, I'm sorting things based on their index in AllTypes. Well, that's what I want to be doing. What I'm really doing is getting compilation errors referring to a missing tag in my metafunction, which is called IndexOf. The code I'm using is below. I'd appreciate it if people would take a look and help me figure out why it's not working. Thanks, Scott #include <boost/mpl/sort.hpp> #include <boost/mpl/distance.hpp> #include <boost/mpl/find.hpp> using namespace boost; // return the index of type T in sequence S template<typename S, typename T> struct IndexOf { enum { value = mpl::distance<typename mpl::begin<S>::type, typename mpl::find<S, T>::type >::value }; }; int main() { using mpl::_1; using mpl::_2; typedef mpl::vector<char, short, int, long, float, double> AllTypes; typedef mpl::vector<long, char, short> Unsorted; typedef mpl::sort<Unsorted, // this call to mpl::less<IndexOf<AllTypes,_1>, // sort doesn't IndexOf<AllTypes,_2> > // compile >::type Sorted; }

3 4

Is boost a library or a framework?
by Robert Dailey 26 Mar '08

26 Mar '08

Hi, My head has been spinning lately on trying to nail down the difference between a library and a framework. One of my co-workers calls Boost a framework because it is a collaboration of components, and the fact that boost is so large makes it a framework. However, boost boasts itself as a library and I'm just wondering why it is such. One definition I read for a framework is that it has no requirement to be minimal, and boost is a fairly un-minimal library. Read the link below on an interesting conversation between the differences in a library and a framework: http://www.artima.com/forums/flat.jsp?forum=106&thread=152104

4 3

serialization and ::copyFrom
by Andrei Popa 25 Mar '08

25 Mar '08

Hi there, I have a small hierarchy of classes that are serializable. I wanted to implement in base class a ::copyFrom method that can copy any data from a pointer to "this" object. The idea behind was to save the "from" pointed object to an archive and then restore the saved data in "this". Saving the input pointer was not a problem but restoring the data in "this" object was a really problem. Since loading *this will call ::load of a base class, I created an temporary shared_ptr around "this". This way the appropriate ::load of the derived class was called. But unfortunately after executing "iarchive >> p;" the px of p doesn't point anymore to "this". I don't know why? Basic code looks like: baseClass::copyFrom (const BaseClass* from) { //save *from //restore the saved data in "this" boost::shared_ptr<baseClass> p(this, baseClass::pseudo_deleter()); iarchive >> p; } pseudo_deleter dose nothing. Does anybody know way this happen? Has anybody a better idea how to implement this method? I tried also to replace the shared_pt with shared_from_this but the results are the same. An other problem that I ignored for the moment is that the used archive should be a kind of memory stream that has no file/disk operations behind. Tia, Andrei _________________________________________________________________ News, entertainment and everything you care about at Live.com. Get it now! http://www.live.com/getstarted.aspx

2 1

Re: [Boost-users] [Mutex] behaviour??
by Sakharuk, Vlad (GMI Development) 25 Mar '08

25 Mar '08

I think u are crashing not because of mutex. The problem is here: iter.next (...) != 0 ; should be iter.next != ... end() -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Yasmina Berber Sent: Tuesday, March 11, 2008 8:05 AM To: boost-users(a)lists.boost.org Subject: [Boost-users] [Mutex] behaviour?? Hi, everybody I have a problem to understand mutex behaviour in a server client program . basically there are two threads that execute different code in two different classes but manipulate the same resource: fisrt Class is Subscriber with these members : public: ACE_Unbounded_Set<client_reference> m_set; typedef boost::recursive_mutex Mutex; typedef boost::recursive_mutex::scoped_lock Lock; Mutex mutex_set; and methods: Subscribe (client_reference) : inserts (add) a reference client to the set { ... Lock theScope( mutex_set); m_set.insert (client_reference) ... } Unsubscribe(client_reference) : removes a reference client from the set { ... Lock theScope( mutex_set); m_set.remove (client_reference) } the second class is Manager that has a shared pointer to Subscriber (SubscriberPtr) and does a specific opeartion on each client_reference inside a for loop in the method Manage() { boost::recursive_mutex::scoped_lock scoped_lock(subscriberPtr->mutex_set) for (Subscriber::Set_Iterator iter (subscriberPtr->m_set); iter.next (...) != 0 ; iter.advance ()) { specific opeartion on each client reference } } What happens is that a client can be removed (call to Unsubscribe()) by the first thread during the second one is executing manage() : the set is not well protected and this causes of course seg fault. I probably do something wrong, If you need more details please let me know. Regards. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users -------------------------------------------------------- This message w/attachments (message) may be privileged, confidential or proprietary, and if you are not an intended recipient, please notify the sender, do not use or share it and delete it. Unless specifically indicated, this message is not an offer to sell or a solicitation of any investment products or other financial product or service, an official confirmation of any transaction, or an official statement of Merrill Lynch. Subject to applicable law, Merrill Lynch may monitor, review and retain e-communications (EC) traveling through its networks/systems. The laws of the country of each sender/recipient may impact the handling of EC, and EC may be archived, supervised and produced in countries other than the country in which you are located. This message cannot be guaranteed to be secure or error-free. This message is subject to terms available at the following link: http://www.ml.com/e-communications_terms/. By messaging with Merrill Lynch you consent to the foregoing. --------------------------------------------------------

1 0

Re: [Boost-users] template int argument
by Sakharuk, Vlad (GMI Development) 25 Mar '08

25 Mar '08

Compiler does optimize it away. But it should compile it first to validate correctness of the code. Btw on "g++ (GCC) 3.4.6 20060404 (Red Hat 3.4.6-3)" I do not see those warnings. I also prefer to use: if(n==2) if(n==3)//without else. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Hicham Mouline Sent: Tuesday, March 18, 2008 2:56 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] template int argument That's what I thought... What forbids the compiler from optimizing away the test on n value, during the template instantiation process? Thanks, -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Steven Watanabe Sent: 18 March 2008 18:47 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] template int argument AMDG Hicham Mouline wrote: > hi, > > I have a template function <typename cT, typename tT, int n> { > .... > double array[n]; > > if (n==2) > binomial code > else if (n==3) > trinomial code (array[0] array[1] array[2]) > else > .... > > > compiler tries to compile the "trinomial code" code even when the > template > is instantiated with n=2, > and that gives warnings because of array[2] > > Is there a way to make the compiler ignore the non-binomial code ? > rds, You'll have to split it out into a separate function and use template specialization/overload resolution. template<int n> void do_n_specific_code(double (&array)[n]); template<typename cT, typename tT, int n> void f() { double array[n]; do_n_specific_code(array); } In Christ, Steven Watanabe _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users -------------------------------------------------------- This message w/attachments (message) may be privileged, confidential or proprietary, and if you are not an intended recipient, please notify the sender, do not use or share it and delete it. Unless specifically indicated, this message is not an offer to sell or a solicitation of any investment products or other financial product or service, an official confirmation of any transaction, or an official statement of Merrill Lynch. Subject to applicable law, Merrill Lynch may monitor, review and retain e-communications (EC) traveling through its networks/systems. The laws of the country of each sender/recipient may impact the handling of EC, and EC may be archived, supervised and produced in countries other than the country in which you are located. This message cannot be guaranteed to be secure or error-free. This message is subject to terms available at the following link: http://www.ml.com/e-communications_terms/. By messaging with Merrill Lynch you consent to the foregoing. --------------------------------------------------------

1 0

Matching wildcards
by Dilts, Daniel D. 25 Mar '08

25 Mar '08

Using Boost.Filesystem, is there a way to get a list of all of the files that match a wildcard pattern, such as image*.* ? This e-mail transmission contains information that is confidential and may be privileged. It is intended only for the addressee(s) named above. If you receive this e-mail in error, please do not read, copy or disseminate it in any manner. If you are not the intended recipient, any disclosure, copying, distribution or use of the contents of this information is prohibited. Please reply to the message immediately by informing the sender that the message was misdirected. After replying, please erase it from your computer system. Your assistance in correcting this error is appreciated.

1 0

[enable_if] Type choices
by Robert Dailey 25 Mar '08

25 Mar '08

Hi, I have a simple template function that takes one argument. For example: template< typename t_type > void foo( t_type param ) { } I want to restrict the type of t_type to a certain subset of types, such as 'char' or 'wchar_t'. If the user passes in any type other than those two types, the compiler should not be able to find an overload for foo() that matches the argument types. Note that I would also be using boost::enable_if to test this condition, however I do not see anything in type_traits or anywhere else to perform such a test. I thought of using mpl::vector to create a list of types the function would take and using enable_if to check if the type is in the container, but this seems like a lot of work. I want to see if there is a simpler, more compact solution. Thanks.

3 5

[python] Extending: Understanding ownership of pointers
by Robert Dailey 25 Mar '08

25 Mar '08

Hi, I had a bit of trouble deciding which mailing list to post this question (Python or boost). I decided to post it here since the way I'm extending is boost-specific, however the fundamental question is in regards to how Python internally handles ownership. I do not feel there is a perfect location for this question, so I hope you'll forgive the semi-off topicness of the question. Right now I'm exposing a function to Python that returns a pointer to a custom object owned by a third party library. In most cases I can manage to use boost::shared_ptr when I'm returning pointers, however since this is a third party library I cannot do this. Since the pointer I'm returning is owned and managed by another object, I gave my def() the following return policy: return_value_policy<reference_existing_object>() I simply assumed this was correct. How does Python handle the pointer to this object? Is there some documents in either boost or the python documentation that I can read to understand a little more about how Python handles object ownership when the Python objects really represent C++ pointers? Perhaps someone could give me a brief rundown on the concept. Thanks in advance.

2 3

[python] Py_Finalize(): To call, or not to call?
by Robert Dailey 25 Mar '08

25 Mar '08

Hi, I remember reading in the boost documentation a while back that Py_Finalize() should not be called when using Boost.Python to embed or extend python. I cannot find that documentation again, unfortunately. Is this a true statement or is it safe to call Py_Finalize()? If not, why can this not be called? How does Boost.Python handle finalizing the interpreter? Thanks.

2 3

serialization & registration questions
by Jerry 25 Mar '08

25 Mar '08

Is there a direct way to check if a class is registered correctly? And why would this differ when using binary/XML mediums? My binary serialization problem persists (sorry!) when using fast_binary_archive though the same works when using the XML serializer. Also I thought I'd try and see what happens when using an archive implemented from scratch according to the boost docs. Is the implementation section of the archive class reference up to date with 1.34.1 ? I was getting hard to decipher template error messages using VC++ 7.1 SP1. Thanks.

5 12

BGL: Copy constructor for Boost graphs
by Ethan Kim 25 Mar '08

25 Mar '08

Hi, I have a question on the copy constructor for boost graphs. When I make a copy G of a graph D as follows: Graph G(D); It makes a deep copy of D, correct? If so, is there a way to maintain a map from vertices in G to vertices in D, and vice versa? Or is this something I have to do manually with std::map? It seems that the copy constructor (as above) is quite time-consuming.. Thanks for any help in advance! -- Ethan DH Kim

1 0

tokenizing with xpressive
by Dilts, Daniel D. 24 Mar '08

24 Mar '08

I'm trying to tokenize lines of a file using the included static regex. I only care about the tokens indicated by s* = ... When I use the sregex_token_iterator to parse the lines, I only get the last match for s2 and s3. How should I change things so that I can get every match for s2 and s3 rather than just the last match? sregex whitespace_regex = *_s; sregex line_regex = whitespace_regex >> (s1 = +_d) >> whitespace_regex >> ( +( '\"' >> (s2 = *~as_xpr('\"')) >> '\"' >> whitespace_regex >> ':' >> whitespace_regex >> '\"' >> (s3 = *~as_xpr('\"')) >> '\"' >> whitespace_regex ) | +( '\"' >> (s2 = *~as_xpr('\"')) >> '\"' >> whitespace_regex ) ); This e-mail transmission contains information that is confidential and may be privileged. It is intended only for the addressee(s) named above. If you receive this e-mail in error, please do not read, copy or disseminate it in any manner. If you are not the intended recipient, any disclosure, copying, distribution or use of the contents of this information is prohibited. Please reply to the message immediately by informing the sender that the message was misdirected. After replying, please erase it from your computer system. Your assistance in correcting this error is appreciated.

2 1

pool allocator performance with multiple threads
by Michael Dickey 23 Mar '08

23 Mar '08

Does anyone know if the fast_pool_allocator is supposed to work in a multithreaded environment? I know that it is "thread-safe," but I'm getting some really discouraging test results from it. Namely, using fast_pool_allocator is consistently performing about 10 times SLOWER for me than new/delete whenever multiple threads are involved. I've tested and come up with the same results on three different platforms: Mac, Linux and Windows (MSVC). I get the impression that I just need to roll my own allocator if I'm using more than one thread, but I'm hoping that this is not the case. If it helps, I can put together and post some source code that demonstrates these results. Thanks, -Mike

2 1

[Filesystem] Unicode support
by David Bertrand 23 Mar '08

23 Mar '08

When compiling unicode filesystem functions, I get linking errors : Test error LNK2019: unresolved external symbol "class boost::filesystem::file_status __cdecl boost::filesystem::detail::status_api(class std::basic_string<unsigned short,struct std::char_traits<unsigned short>,class std::allocator<unsigned short> > const &,unsigned int &)" (...) I can reproduce it easily by compiling following line of code: fs::exists(L"test.gif"); The non-unicode variants links fine, it's really only the unicode stuff. Since "\libs\filesystem\test\wide_test.cpp" must be working, I assume I'm missing a compiler macro or something ? Anyone seen this already ? My setup : Windows XP SP2 MSVC 7.1 SP1 Boost 1.34.1 downloaded from boost-consulting.com This email and any attachments is confidential, may be legally privileged and is intended for the use of the addressee only. If you are not the intended recipient, please note that any use, disclosure, printing or copying of this email is strictly prohibited and may be unlawful. If received in error, please delete this email and any attachments and confirm this to the sender.

3 2

phoenix compile problems
by Olaf Peter 22 Mar '08

22 Mar '08

Hello, here my compile problem using phoenix (for use with spirit): ---8<--- template<typename ActionsT> struct tag_keyword_action { template <typename ScanT, typename Iter1T, typename Iter2T> struct result { typedef void type; }; explicit tag_keyword_action( const ActionsT& action ) : action( action ) { } template <typename ScanT, typename Iter1T, typename Iter2T> void operator()( const ScanT& scan, const Iter1T& bgn, const Iter2T& end ) const { action.on_tag( // the real action / assign class std::string( bgn, end ), scan.first.get_position().line ); } const ActionsT& action; }; template<typename ActionsT> struct ver_parser { typedef ::phoenix::function< tag_keyword_action<ActionsT> > keyword_tag_type; explicit ver_parser( const ActionsT& action ) : tag_keyword( action ) { } template <typename ScannerT> std::ptrdiff_t operator()(const ScannerT& scan, result_t& result) const { ... rule_t rule = lexeme_d[ ... ][tag_keyword( var( scan ), arg1, arg2 )] ... } const keyword_tag_type tag_keyword; }; template <typename ActionsT = parse_actions, typename ErrorHandlerT = parse_error_handler> struct grammar : sp::grammar< grammar<ActionsT, ErrorHandlerT> > { explicit grammar(const ActionsT& actions = ActionsT(), const ErrorHandlerT& handler = ErrorHandlerT()) : actions( actions ), error_handler( handler ) { } template <typename ScannerT> struct definition { ... explicit definition( const grammar& self ) : ver_p( self.actions ) { ... } ... const sp::functor_parser< ver_parser<ActionsT> > ver_p; }; ... }; --->8--- The (beautified) error message is: error: no matching function for call to 'boost::spirit::functor_parser<ver_parser<parse_actions> >::functor_parser(const parse_actions&)' candidates are: boost::spirit::functor_parser<FunctorT>::functor_parser(const FunctorT&) [with FunctorT = ver_parser<parse_actions>] boost::spirit::functor_parser<FunctorT>::functor_parser() [with FunctorT = ver_parser<parse_actions>] boost::spirit::functor_parser<ver_parser<parse_actions> >::functor_parser(const boost::spirit::functor_parser<ver_parser<parse_actions> >&) What is the correct syntax, is this way a good choice? I want to tag the keyword in the given data files with their lines to display them in a browser later. Thanks, Olaf

1 1

[lambda] Confusion!
by Robert Dailey 22 Mar '08

22 Mar '08

Hi, I have defined a global overloaded operator<<. I want to use this overloaded operator in std::for_each(), but it must be properly deduced since there are many global overloads for this operator. For example: class Stream { // This is an abstract class (cannot instantiate) }; Stream& operator<< ( Stream& stream, char data ) { stream.write( data ); return stream; } Stream& operator<< ( Stream& stream, std::vector<char>& buffer ) { using namespace boost::lambda; std::for_each( buffer.begin(), buffer.end(), var( stream ) << _1 ); // This lambda should simply be binding to the overloaded operator<< above, right? return stream; } When I compile this, MSVC9 tells me: 1>c:\program files\microsoft visual studio 9.0\vc\include\algorithm(29) : error C2064: term does not evaluate to a function taking 1 arguments 1> class does not define an 'operator()' or a user defined conversion operator to a pointer-to-function or reference-to-function that takes appropriate number of arguments What am I doing wrong? Do I need to be using boost bind instead? If so, how can I use boost.bind to map a global operator? Will it correctly deduce which overload to use?

2 5

"Assignment operator could not be generated" warnings under MSVC 2005
by Kevin Scarr 22 Mar '08

22 Mar '08

Sorry about the cross-post to asio.user, it is a more general question. I am receiving a number of warnings along the lines of the above when I compile code using boost libraries. I see the warnings with Boost.Variant, Boost.asio and others. My code compiles, and appears to work fine, however, I am always nervous about these kinds of warnings because I suspect there is something waiting to bite me. I guess I am concerned as to what in my code is causing the compiler to want to generate assignment operators. Are these warnings symptomatic of a basic mistake I am making? I know that you can't see the code, so this is only a general question. If people think this might be a real problem, I am happy to try to make a small code snippet to illustrate the problem. Thanks for being there! Kevin Some examples: Warning 3 warning C4512: 'boost::asio::detail::win_iocp_io_service::auto_work' : assignment operator could not be generated; c:\boost_1_34_1\include\boost-1_34_1\boost/asio/detail/win_iocp_io_service.hpp(574) : see declaration of 'boost::asio::detail::win_iocp_io_service::auto_work' c:\boost_1_34_1\include\boost-1_34_1\boost\asio\detail\win_iocp_io_service.hpp 588 Warning 9 warning C4512: 'boost::detail::variant::invoke_visitor<Visitor> with [Visitor=boost::detail::variant::apply_visitor_binary_unwrap<const G2::doConnectConsumerToProducer,G2::G2ProducerTypes>]' : assignment operator could not be generated; c:\boost_1_34_1\include\boost-1_34_1\boost/variant/variant.hpp(1771) : see reference to class template instantiation 'boost::detail::variant::invoke_visitor<Visitor> with [Visitor=boost::detail::variant::apply_visitor_binary_unwrap<const G2::doConnectConsumerToProducer,G2::G2ProducerTypes>]' being compiled; c:\boost_1_34_1\include\boost-1_34_1\boost/variant/detail/apply_visitor_unary.hpp(56) : see reference to function template instantiation 'void boost::variant<T0_,T1,T2>::apply_visitor<Visitor>(Visitor &) with [T0_=G2::G2Consumer<G2::buffer> *,T1=G2::G2Consumer<G2::packet> *,T2=G2::G2Consumer<G2::message> *,Visitor=boost::detail::variant::apply_visitor_binary_unwrap<const G2::doConnectConsumerToProducer,G2::G2ProducerTypes>]' being compiled; c:\boost_1_34_1\include\boost-1_34_1\boost/variant/detail/apply_visitor_binary.hpp(165) : see reference to function template instantiation 'void boost::apply_visitor<boost::detail::variant::apply_visitor_binary_unwrap<Visitor,Visitable2>,Visitable1>(boost::detail::variant::apply_visitor_binary_unwrap<Visitor,Visitable2> &,Visitable &) with [Visitor=const G2::doConnectConsumerToProducer,Visitable2=G2::G2ProducerTypes,Visitable1=G2::G2ConsumerTypes,Visitable=G2::G2ConsumerTypes]' being compiled; .\interfaces.cpp(133) : see reference to function template instantiation 'void boost::apply_visitor<G2::doConnectConsumerToProducer,G2::G2ConsumerTypes,G2::G2ProducerTypes>(const Visitor &,Visitable1 &,Visitable2 &) with [Visitor=G2::doConnectConsumerToProducer,Visitable1=G2::G2ConsumerTypes,Visitable2=G2::G2ProducerTypes]' being compiled c:\boost_1_34_1\include\boost-1_34_1\boost\variant\variant.hpp 894

5 7

boost::serialization problem with gcc 4.3.0
by bernd.speiser＠t-online.de 21 Mar '08

21 Mar '08

Hi all, I am using boost::serialization (from version 1.34.1) within a larger project and have just switched to the recent gcc 4.3.0 release. Now, everything, including serialization code, works just fine on most of our machines (ix86 under openSuSE 10.2). However, on a x86_64 system (also openSuSE 10.2), the same code produces errors: /usr/local/include/boost-1_34_1/boost/serialization/vector.hpp:126: error: redefinition of 'struct boost::serialization::implementation_level<std::vector<long int, std::allocator<long int> > >' /usr/local/include/boost-1_34_1/boost/serialization/vector.hpp:126: error: previous definition of 'struct boost::serialization::implementation_level<std::vector<long int, std::allocator<long int> > >' /usr/local/include/boost-1_34_1/boost/serialization/vector.hpp:126: error: redefinition of 'struct boost::serialization::implementation_level<std::vector<long unsigned int, std::allocator<long unsigned int> > >' /usr/local/include/boost-1_34_1/boost/serialization/vector.hpp:126: error: previous definition of 'struct boost::serialization::implementation_level<std::vector<long unsigned int, std::allocator<long unsigned int> > >' The error messages are NOT produced with boost version 1.33.1. The error occur even if I include the vector.hpp file into a piece of code which does not actually use serialization functionality. Any ideas what to do? Thanks for any help. Best regards Bernd ======================================================================= Bernd Speiser Institut für Organische Chemie Auf der Morgenstelle 18 temporary address: Auf der Morgenstelle 15 D-72076 Tübingen Germany phone: +49-7071-2976205 (office) +49-7071-2976242 (laboratory) +49-7071-2972098 (secretary) fax: +49-7071-295518 e-mail: bernd.speiser(a)uni-tuebingen.de Internet: http://www.uni-tuebingen.de/speiser =======================================================================

1 1

boost::serialization oserializer weirdness
by Jerry 21 Mar '08

21 Mar '08

Using Boost 1.34.1 with VC++ 7.1 SP1 I have existing code which serializes/de-serializes correctly to boost::archive::xml_oarchive Within the same .cpp file I'm trying to serialize instances of the same hierarchy to boost::archive::binary_oarchive using this code: // ultimate sink for serialized data std::ostringstream os; // binary format is OK as it is going onto the clipboard boost::archive::binary_oarchive oa(os); // temp storage std::vector<CDiagramEntity*> vec; // only serialize selected items for (std::vector<CDiagramEntity*>::iterator it = m_entities.begin(); it != m_entities.end(); ++it) { if ((*it)->IsSelected()) vec.push_back((*it)); } // just serialize the selected item vector (*) oa & BOOST_SERIALIZATION_NVP(vec); * - This is failing in oserializer.hpp line 417, the relevant code being: // sice true_type is valid, and this only gets made if the // pointer oserializer object has been created, this should never // fail bpos_ptr = archive_pointer_oserializer<Archive>::find(* true_type); assert(NULL != bpos_ptr); // <------------------ this assert triggered. I note the confident comment above find(). Can anyone help here? Many thanks Jerry

4 8

algorithm::string
by Elisabeth Benoit 21 Mar '08

21 Mar '08

Can someone please tell me how to use boost::algorithm::is_alnum(). I first thought I could do std::string test boost::algorithm::is_alnum(test) but obviously the function doesn't take a string as a parameter. I've been searching for an example in the doc and on the web, but niet. an example would be greatly appreciated. Elisabeth

2 1

Re: [Boost-users] Boost-users Digest, Vol 1577, Issue 3
by David Ward 21 Mar '08

21 Mar '08

BM: Great - see you Saturday. Get a kick out of life - play soccer! David -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of boost-users-request(a)lists.boost.org Sent: Thursday, March 20, 2008 8:03 PM To: boost-users(a)lists.boost.org Subject: Boost-users Digest, Vol 1577, Issue 3 Send Boost-users mailing list submissions to boost-users(a)lists.boost.org To subscribe or unsubscribe via the World Wide Web, visit http://lists.boost.org/mailman/listinfo.cgi/boost-users or, via email, send a message with subject or body 'help' to boost-users-request(a)lists.boost.org You can reach the person managing the list at boost-users-owner(a)lists.boost.org When replying, please edit your Subject line so it is more specific than "Re: Contents of Boost-users digest..." Today's Topics: 1. Re: Boost-users Digest, Vol 1577, Issue 2 (Abir Basak) 2. Re: unordered_set insert returns const_iterator ? (Abir Basak) 3. Re: Boost-users Digest, Vol 1577, Issue 2 (Daniel James) 4. [addressof] Can't obtain the address of an instance of an anonymous struct (Jean-Francois Bastien) 5. Re: [InterProcess] Compatibility with Boost multi_array (Ion Gazta?aga) 6. [boost-users][test] Problems calling ::system() (... child has exited ...) (Darren Garvey) ---------------------------------------------------------------------- Message: 1 Date: Thu, 20 Mar 2008 23:27:32 +0530 From: "Abir Basak" <abirbasak(a)gmail.com> Subject: Re: [Boost-users] Boost-users Digest, Vol 1577, Issue 2 To: boost-users(a)lists.boost.org Message-ID: <b50981650803201057h2bc805b5o5e57bf92243d749d(a)mail.gmail.com> Content-Type: text/plain; charset="iso-8859-1" > > I don't have access to that compiler. I tried running similar code in > Visual C++ 6.5 and Visual C++ express 8, and they both worked. I can > try adding something to the unit tests but that will take me a while > to work through. At the end of this email is the code I tested with, > can you try it on your compiler? If it works, I'm doing something > different to you, do you have any idea what? > > thanks, > > Daniel > > #include <boost/unordered_map.hpp> > #include <boost/tuple/tuple.hpp> > #include <iostream> > > int main() { > typedef boost::unordered_multimap<char, int> Mymap; > Mymap c1; > > c1.insert(Mymap::value_type('a', 1)); > c1.insert(Mymap::value_type('a', 2)); > c1.insert(Mymap::value_type('b', 3)); > c1.insert(Mymap::value_type('c', 4)); > > Mymap::iterator it,end; > boost::tie(it,end) = c1.equal_range('a'); > for( ; it!=end; ++it) { > std::cout<<(*it).second<<" "; > } > } Yes, MSVC 9 (i.e 2008) runs it properly, but MSVC 7.1 (2003 . NET) fails to compile it. It looks like, for some reason node_ = data::next_group(node_); from increment_group() tries to construct data, which is a typedef to BOOST_UNORDERED_TABLE_DATA even while using static function for that. just changing the statement to node_ = next_group(node_); (hash_table_impl.hpp cvs line no 301) works. so it seems, msvc 7. either doesn't support calling static function by class name typedef, or the data typedef is confused with some other (like BOOST_UNORDERED_TABLE) note node_ = BOOST_UNORDERED_TABLE_DATA::next_group(node_); also works fine. i tried to produce some simple test case for this, like class outer{ public: typedef outer outer_t; inline static void func(){} class inner{ void func1(){ outer_t::func();// func() this works;or outer::func() works } }; }; this doesn't work in msvc 7.1 but works in 9.0 . i am not sure if it is valid in standard though. The error is, E:\lib\boost\trunk\boost\unordered\detail\hash_table_impl.hpp(301): error C2039: 'hash_table_data_equivalent_keys<std::allocator<std::pair<char const ,int> > >' : is not a member of 'boost::unordered_detail::hash_table_data_equivalent_keys<Alloc>::iterat or_base' with [ Alloc=boost::unordered_detail::hash_types_equivalent_keys<std::pair<cons t char,int>,char,boost::hash<char>,std::equal_to<char>,std::allocator<std: :pair<const char,int>>>::value_allocator ] thanks abir

1 0

Re: [Boost-users] Boost-users Digest, Vol 1578, Issue 1
by Alexander Pensky 21 Mar '08

21 Mar '08

> ---------- Forwarded message ---------- > From: "Darren Garvey" <darren.garvey(a)gmail.com> > To: boost-users(a)lists.boost.org > Date: Fri, 21 Mar 2008 00:13:07 +0000 > Subject: Re: [Boost-users] boost::asio Visual Studio 8 - fatal error C1189: #error : WinSock.h has already been included > Hi Julian, > > > On 18/03/2008, Julian Cain <jolix(a)mac.com> wrote: > > I have upgraded to VS 8.0 Standard and when compiling ASIO errors on the following: > > > > 1>Unknown compiler version - please run the configure tests and report the results > > 1>C:\tor\trunk\lib\boost\boost/asio/detail/socket_types.hpp(27) : fatal error C1189: #error : WinSock.h has already been included > > > > Is this a known problem? > > > What do you mean by 'compiling asio'? It is a header-only library. :) > > The problem you're seeing is because the (old) winsock.h header has been included. Most people that see this do because they've included windows.h *before* the asio headers. > > You can get around this by defining WIN32_LEAN_AND_MEAN (something like that) before including windows.h, or just by including windows.h after everything else. > > Regards, > Darren > I've noticed the same behavior. I understand there's a workaround, but in my opinion it's still a bug. asio.hpp has a requirement that it must be #included "early enough" or else it won't compile. That's not a well-behaved header, and it's not "boost-y". Other boost components can be #included much later than <windows.h> and they will go through the whole boost/config process and re-including windows.h or winsock.h with no problems. - Alex

1 0

[1.35.0] Release Candidate 2 available
by Beman Dawes 21 Mar '08

21 Mar '08

1.35.0 Release Candidate 2 (RC2) is available at http://boost.cowic.de/rc/ RC2 fixes all of the serious issues reported for RC1. Note that links to the web site from the RC appear to be broken because the restructured web site will not go live until the actual release ships. In the meantime, the new website content is available at beta.boost.org. Please take the time to download RC2, and try to install it on your system. Kick the tires, and report any problems or issues you discover. Report by posting to either boost(a)lists.boost.org or boost-users(a)lists.boost.org. For a list of known issues, see http://svn.boost.org/trac/boost/wiki/MergeOneDotThreeFiveDotZero. Thanks, --Beman

1 0

boost::asio Visual Studio 8 - fatal error C1189: #error : WinSock.h has already been included
by Julian Cain 21 Mar '08

21 Mar '08

I have upgraded to VS 8.0 Standard and when compiling ASIO errors on the following: 1>Unknown compiler version - please run the configure tests and report the results 1>C:\tor\trunk\lib\boost\boost/asio/detail/socket_types.hpp(27) : fatal error C1189: #error : WinSock.h has already been included Is this a known problem? thanks jc

4 4

[boost-users][test] Problems calling ::system() (... child has exited ...)
by Darren Garvey 21 Mar '08

21 Mar '08

Hello all, I'm trying to use system calls in a test that uses Boost.Test. I've been trying to use Julio Merino Vidal's Boost.Process sandbox code (which I have working most of the time), but I've also tried the ::system() call too. The following super-simple test case causes the prepended error... The fact that I can't get this working makes me wonder if I'm doing something forbidden? Platform: ----------------- Using built-in specs. Target: i486-linux-gnu Configured with: ../src/configure -v --enable-languages=c,c++,fortran,objc,obj-c++,treelang --prefix=/usr --enable-shared --with-system-zlib --libexecdir=/usr/lib --without-included-gettext --enable-threads=posix --enable-nls --with-gxx-include-dir=/usr/include/c++/4.1.3 --program-suffix=-4.1--enable-__cxa_atexit --enable-clocale=gnu --enable-libstdcxx-debug --enable-mpfr --enable-checking=release i486-linux-gnu Thread model: posix gcc version 4.1.3 20070929 (prerelease) (Ubuntu 4.1.2-16ubuntu2) ----------------- Error: ----------------- Running 1 test case... unknown location(0): fatal error in "wget_test_1": child has exited; pid: 1000; uid: 11541; exit value: 0 *** 1 failure detected in test suite "wget_tests" EXIT STATUS: 201 ----------------- Program: ----------------- #define BOOST_TEST_MODULE broken #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_CASE( broken_test ) { ::system("ls"); } ----------------- Regards, Darren

1 0

[InterProcess] Compatibility with Boost multi_array
by sankar lingam 20 Mar '08

20 Mar '08

Can I create Boost multi_array in shared memory using Boost.InterProcess..? Can some one explain as to how this can be done.? I tried providing the Boost InterProcess Allocator to the Boost multi_array but it gives the expected compiler error of casting an offset<ptr> to T* , when the multi_array tries to convert return type of the allocator allocate function(which is an offset<ptr>) to T*. Can this problem be overcome by writing a custom stl compatible allocator wrapper over the interprocess allocator? Regards, Sankar

2 6

[addressof] Can't obtain the address of an instance of an anonymous struct
by Jean-Francois Bastien 20 Mar '08

20 Mar '08

We're running into an issue with addressof as described at: https://savannah.cern.ch/bugs/?33071 Basically this fails under GCC 3.4.4 as well as GCC 4.3: struct // NoName { } noName; void * fail() { return addressof(noName); } The error message is "no matching function for call to `addressof(<anonymous struct>&)'". MSVC 2005 SP1 compiles and runs this with no problem. The problem seems to be that GCC can't deduce the templated type because the struct is anonymous. I'm not sure whether this is because it's non-standard behavior that MSVC accepts and GCC doesn't or because GCC has a bug. Either way it would be nice if addressof had a workaround for the "broken" GCC versions, but I'm not sure what the best workaround would be. Axel suggested in the above link to C-style cast to char &, but this causes a problem in the (unlikely) event where operator char &() is declared in the anonymous struct. We could use template magic to see if operator char &() is declared, but I'm not very comfortable with such a huge workaround. If the discussion points towards a bug in GCC I'll file a bug report with them, but either way addressof isn't working with GCC 3.4.4 and 4.3 (at least), and it would be nice of Boost to offer a workaround.

1 0

Re: [Boost-users] Boost-users Digest, Vol 1577, Issue 2
by Abir Basak 20 Mar '08

20 Mar '08

> > I don't have access to that compiler. I tried running similar code in > Visual C++ 6.5 and Visual C++ express 8, and they both worked. I can > try adding something to the unit tests but that will take me a while > to work through. At the end of this email is the code I tested with, > can you try it on your compiler? If it works, I'm doing something > different to you, do you have any idea what? > > thanks, > > Daniel > > #include <boost/unordered_map.hpp> > #include <boost/tuple/tuple.hpp> > #include <iostream> > > int main() { > typedef boost::unordered_multimap<char, int> Mymap; > Mymap c1; > > c1.insert(Mymap::value_type('a', 1)); > c1.insert(Mymap::value_type('a', 2)); > c1.insert(Mymap::value_type('b', 3)); > c1.insert(Mymap::value_type('c', 4)); > > Mymap::iterator it,end; > boost::tie(it,end) = c1.equal_range('a'); > for( ; it!=end; ++it) { > std::cout<<(*it).second<<" "; > } > } Yes, MSVC 9 (i.e 2008) runs it properly, but MSVC 7.1 (2003 . NET) fails to compile it. It looks like, for some reason node_ = data::next_group(node_); from increment_group() tries to construct data, which is a typedef to BOOST_UNORDERED_TABLE_DATA even while using static function for that. just changing the statement to node_ = next_group(node_); (hash_table_impl.hpp cvs line no 301) works. so it seems, msvc 7. either doesn't support calling static function by class name typedef, or the data typedef is confused with some other (like BOOST_UNORDERED_TABLE) note node_ = BOOST_UNORDERED_TABLE_DATA::next_group(node_); also works fine. i tried to produce some simple test case for this, like class outer{ public: typedef outer outer_t; inline static void func(){} class inner{ void func1(){ outer_t::func();// func() this works;or outer::func() works } }; }; this doesn't work in msvc 7.1 but works in 9.0 . i am not sure if it is valid in standard though. The error is, E:\lib\boost\trunk\boost\unordered\detail\hash_table_impl.hpp(301): error C2039: 'hash_table_data_equivalent_keys<std::allocator<std::pair<char const ,int> > >' : is not a member of 'boost::unordered_detail::hash_table_data_equivalent_keys<Alloc>::iterator_base' with [ Alloc=boost::unordered_detail::hash_types_equivalent_keys<std::pair<const char,int>,char,boost::hash<char>,std::equal_to<char>,std::allocator<std::pair<const char,int>>>::value_allocator ] thanks abir

2 1

Re: [Boost-users] unordered_set insert returns const_iterator ?
by Abir Basak 20 Mar '08

20 Mar '08

> > I don't have access to that compiler. I tried running similar code in > Visual C++ 6.5 and Visual C++ express 8, and they both worked. I can > try adding something to the unit tests but that will take me a while > to work through. At the end of this email is the code I tested with, > can you try it on your compiler? If it works, I'm doing something > different to you, do you have any idea what? > > thanks, > > Daniel > > #include <boost/unordered_map.hpp> > #include <boost/tuple/tuple.hpp> > #include <iostream> > > int main() { > typedef boost::unordered_multimap<char, int> Mymap; > Mymap c1; > > c1.insert(Mymap::value_type('a', 1)); > c1.insert(Mymap::value_type('a', 2)); > c1.insert(Mymap::value_type('b', 3)); > c1.insert(Mymap::value_type('c', 4)); > > Mymap::iterator it,end; > boost::tie(it,end) = c1.equal_range('a'); > for( ; it!=end; ++it) { > std::cout<<(*it).second<<" "; > } > } Yes, MSVC 9 (i.e 2008) runs it properly, but MSVC 7.1 (2003 . NET) fails to compile it. It looks like, for some reason node_ = data::next_group(node_); from increment_group() tries to construct data, which is a typedef to BOOST_UNORDERED_TABLE_DATA even while using static function for that. just changing the statement to node_ = next_group(node_); (hash_table_impl.hpp cvs line no 301) works. so it seems, msvc 7. either doesn't support calling static function by class name typedef, or the data typedef is confused with some other (like BOOST_UNORDERED_TABLE) note node_ = BOOST_UNORDERED_TABLE_DATA::next_group(node_); also works fine. i tried to produce some simple test case for this, like class outer{ public: typedef outer outer_t; inline static void func(){} class inner{ void func1(){ outer_t::func();// func() this works;or outer::func() works } }; }; this doesn't work in msvc 7.1 but works in 9.0 . i am not sure if it is valid in standard though. The error is, E:\lib\boost\trunk\boost\unordered\detail\hash_table_impl.hpp(301): error C2039: 'hash_table_data_equivalent_keys<std::allocator<std::pair<char const ,int> > >' : is not a member of 'boost::unordered_detail::hash_table_data_equivalent_keys<Alloc>::iterator_base' with [ Alloc=boost::unordered_detail::hash_types_equivalent_keys<std::pair<const char,int>,char,boost::hash<char>,std::equal_to<char>,std::allocator<std::pair<const char,int>>>::value_allocator ] thanks (sorry for double posting ... last message subject line was wrong) abir

1 0

unordered_set insert returns const_iterator ?
by Abir Basak 20 Mar '08

20 Mar '08

Hi while i am using boost unordered_set , and insert a new key value pair, it returns the iterator as a const one. In fact when i looked at the code, the iterator is a typedef to implementation::const_iterator ... so there is no way to gen an mutable iterator from the set, including begin() and end() is it a standard behavior or i am missing something ? thanks abir

3 3

ignoring function arguments with Boost.Bind?
by Christoph Duelli 20 Mar '08

20 Mar '08

Please consider the following scenario: class Caller { public: Caller(...); typedef boost::function<void (int)> MyCallback; MyCallback callback; }; class Callee { public: Callee(); void do_it() {...}; }; Caller caller; Callee callee; // does not work as do_it does not match MyCallback caller.callback = boost::bind(&Callee::do_it, &callee, ...); The function do_it() is not interested in the arguments passed to the callback. I obviously could make the function take these arguments and just ignore them... but I was wondering: is it possible to leave do_it() as it is and work some magic with Boost.Bind that 'drops' the unwanted argument? Basically create an anonymous function object that calls callee without the argument it gets passed itself. (Similarly to Qt signals/slots: the slot may have fewer arguments than the signal.) Thank you and best regards Christoph

2 1

Re: [Boost-users] boost serialization & module boundaries
by Robert Ramey 20 Mar '08

20 Mar '08

I'm not sure from the title of the post what the question is. Never-the-less, I'll provide an answer. Up until now, there have problems when serialization code was spread accross and/or repeated in distinct runtime modules. Also, there was a problem when serialization was invoked simultaneously from different threads. Both these problems are related to the fact that the library has to keep a table of which types have the serialization code loaded. This has now been addressed in the recently checked in version in the trunk. Serialization code can be in dlls. Also code can be repeated accross DLLs. Personally, I would prefer to organize my code so that this doesn't happen but apparently some people found this inconvenient. I have tested this by hand with my VC 7.1 system. The tests consist of making separate DLLS and running the executable all from the same directory. I have been unable to figure out how to do such a thing with bjam so as far as linux is concerned its untested. Robert Ramey

1 0

Q and Embedded Systems
by Thanh Tran 19 Mar '08

19 Mar '08

I'm new to boost and would like to know if boost can be used in embedded systems. Obviously, it'll work if the system is using derivative of Linux. What if I don't have a real OS running on the system. Can I still simply fold the source code into my project and build it? I'm sure it can be done. I'm not sure how difficult it will be. Thanks. ____________________________________________________________________________________ Be a better friend, newshound, and know-it-all with Yahoo! Mobile. Try it now. http://mobile.yahoo.com/;_ylt=Ahu06i62sR8HDtDypao8Wcj9tAcJ

2 1

boost serialization & module boundaries
by Christian Widmer 19 Mar '08

19 Mar '08

Hi, I'm trying to use boost to serialize a machine learning library that I'm working with. It all worked out very conveniently, but it seems now, that I have hit a dead end. I've been looking on the net but couldn't find any information that worked for me, so here we go: The problem is, that the library consists of several modules, which are dynamically linked. For instance the class KernelMachine has a field kernel of type Kernel, which is contained in a separate module (in the sense of a shared object). The following code compiles, but when I try to serialize a CKernelMachine object I get an "unregistered_class" error. (CKernel does serialize fine, when called directly) class CKernelMachine : public CClassifier { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & boost::serialization::base_object<CClassifier>(*this); ar.register_type(static_cast<CGaussianKernel *>(NULL)); ar & kernel; std::cout << "done CKernelMachine" << std::endl; } protected: CKernel* kernel; }; I found some threads that pointed me towards BOOST_CLASS_EXPORT, but I'm not exactly sure how to use it. So my question is - is it in principle even possible to serialize across module (shared-object) boundaries. If so, how should I go about? Any pointers would be greatly appreciated. - Chris

3 7

Boost Regex - Specify multiple expressions and formats with regex_replace?
by Jeff 19 Mar '08

19 Mar '08

Dear Regex Users: I'd like to know if it is possible to check multiple expressions and specify multiple patters within a single regex_replace statement. For example, I want to replace .html extensions with .php and replace .gif with the .srf extension Match: http://localhost/index.gif replace with: http://localhost/index.srf Match: http://localhost/index.html replace with: http://localhost/index.php Can this be done within a single regex_replace statement? Although this does not work, it demonstrates what I am trying to achieve: // trying to match either condition const boost::regex sExp("(?:^(.*/)index\.html$) | (?:^(.*/)index\.gif$)"); // trying to replace according to matched extension const std::string sRewrite("$1index.php"); std::string rewrite(const std::string& s) { return boost::regex_replace(s, sExp, sRewrite, boost::match_perl | boost::format_perl | boost::format_no_copy | boost::format_all); } int main() { string s[5] = { "http://localhost/abc.png", "http://localhost/abc.jpb", "http://localhost/index.gif", "http://localhost/hambone.srf", "http://localhost/index.html" }; for(int i = 0; i < 5; ++i) { if (rewrite(s[i])!="") { cout << rewrite(s[i]) << endl; } } return 0; } I don't know if regex_replace can be used to do this or not. Thank you, Jeff

2 1

Boost.Interprocess Documentation
by Alexander Dong Back Kim 19 Mar '08

19 Mar '08

Hi all, Is there any document or resource that I can learn about Boost.Interprocess? I'm currently being interesting with Shared Memory stuff. Any suggestions or hints are welcomed. -- Alexander Dong Back Kim Australia +61 433 469 100 / Korea +82 10 6357 8840

2 1

[interprocess] shared_memory_object opened or created?
by Boris 19 Mar '08

19 Mar '08

If I instantiate a shared_memory_object with open_or_create how do I know if it was opened or created? I ask as if it was created I need to create a structure in the mapped region. If it was opened though I must not create a structure (as another program created the structure before and I might overwrite data). I ran into this problem after creating a reader and writer. They exchange data using a shared_memory_object. It would be great if I could start the two programs in any order. But currently the programs don't know which one created and which one opened the shared memory. Do I miss anything or was open_or_create added for another use case? Boris

2 3

Re: [Boost-users] [boost] Logging library review results
by John Torjo 19 Mar '08

19 Mar '08

Hi All, > I read through the submitted reviews and here is a short summary: > > Thanks to all who contributed. Now I'll know what needs to be improved - again ;) I'd like to formally ask for another review mid-end July. So, looking for a review manager - again ;) > > In the end we came to 8 negative 7 positive votes with average 4.9 grade. > Essentially opinions split right in a middle. Oh, how familiar these days ;) > > I must say this puts me in a quite a spot. The library obviously has great > potential, but quite unacceptable by many in it's current form. While > praising it's flexibility in many aspects, the reviewers expressed wide > variety of serious concerns regarding design, implementation and > documentation. > > Yup, will redo, and redo the docs as well. > The logging library submission is NOT accepted in it's current form. > > My biggest concern, as many others expressed here before, is that we do need > the logging library. So I can't be any more encouraging to John to resubmit > an updated version for review within any reasonably short time, once issues > brought during review are addressed. I am not going to list all the issues > here - you will need to look through quite detailed reviews, but I want to > emphasize most prominent ones: > > Again, I'd like to resubmit, mid-end July. > * The library would gain from clean separation of framework and solution. > What I mean here is that there should be separate > layer which defines only generic concepts and another layer for specific > solutions provided by library. My personal suggestion is to use layered > design, where each layer is more feature-rich, but more targeted. > Got it. > * Library should support wide variety of "simple cases" out of the box and > with minimal efforts required by users. *Each* usage scenario should be well > documented and supported by example. > Yes - my problem is that each person seems to have a different opinion of what "simple case". However, what I'll do is this: - have a few simple cases, and write the code for them - minimize the number of lines I write in order to meet a certain case - question: what do you think it's a reasonable number of lines, for a simple case? I'd go for 5-10 lines of code. About those simple cases : the problem is that I have my own simple cases - which might not be what you want. So, if you have your great simple case, shout! On a side-note - I'll make a couple of web pages where I'll split the work to be done. Then, you all are most welcome to comment on them. > * Library shouldn't try to be too smart. All optimizations and advanced > features should be eliminated. At least not in a review version. This > includes any kind of optimized strings or scenario based log selection. > Later on you may start adding them based on user input. > I see - ok, basically that's easier for me. So I'm down with that ;) > * I recommend to start some kind of pool for simple/common cases on the dev > list before you jump to support them. Library should clearly state that > other more advanced usage cases are supportable as well. The same > recommendation applies to the general set of supported features by the > library out of the box. > Got it. > * Macros usage should be marginally reduced. Documentation should explain > how to write them, but not force them as the only solution. > Yup, will do. > * You may consider supporting lambda like API an one of the alternatives. > That should be possible. > * Unicode support strategy needs to be fixed > Yes, it will. > * Documentation require major revision. Obviously I can't put it as a > requirement, but my personal recommendation - drop doxigen. IMO you can't > Well, I'll think about it - however, I really love doxygen. So I guess we shouldn't blame the tool for the fact that I messed up the docs. > have professional documentation based on this format. Plus it's > unnecessarily pollute your code. Boostbook and Quickbook are much more > No offense about Boostbook: http://www.boost.org/doc/html/boostbook/getting/started.html But if getting started is so complex, I tend to not use it. > attractive solutions. Also many reviewers expressed desire for more formal > tone in user's guide and reference. (Another personal comment - where did > About the formal tone in the user's guide/reference - will do. > you find word "gather" usage as noun? I personally would prefer something > like "entry") > > Where have I used it as a noun? > Yet again I'd like to express our gratitude to the John for his efforts and > hopes that he'll be able to see this library though to the eventual success. > It has great potential. > > Thanks ;) And it'll happen ;) Best, John -- http://John.Torjo.com -- C++ expert http://blog.torjo.com ... call me only if you want things done right

2 1

Question on BOOST_FOREACH
by Alexander Dong Back Kim 19 Mar '08

19 Mar '08

What header file should I have to include? I tried #include <boost/foreach.hpp> but g++ compile shows the following error. .... boost/foreach.hpp: No such file or directory In the source code file, it doesn't only include foreach.hpp but also many other boost headers. Why only this one is showing an error? Do I need to choose another header or something? Cheers, -- Alexander Dong Back Kim Australia +61 433 469 100 / Korea +82 10 6357 8840

2 1

Serialization support of Unordered Containers
by brass goowy 19 Mar '08

19 Mar '08

Shalom A possibly easier to read version of this note is here - http://www.webebenezer.net/uncontainers_mar182008 I'm happy to report that we have added serialization support for the following types from the recently accepted Unordered Containers library: unordered_set, unordered_multiset, unordered_map and unordered_multimap. I recall past discussion of names for these containers. I'm of the opinion there is room for improvement in this area and Erik Wikström points out on c.l.c++ that the containers are "ordered by the hash of the key." We are also interested in supporting the Intrusive library. It would be helpful to hear if there are trends developing in the way people use that library. Brian Wood Ebenezer Enterprises www.webebenezer.net

1 0

Re: [Boost-users] boost multiindex: trying to create a template
by Sharad Mittal 18 Mar '08

18 Mar '08

Thanks a lot Steven. That compiles fine. Do you have any online pointers/examples related to this? Sharad Steven Watanabe wrote: AMDG Sharad Mittal wrote: > I am trying to do the following in order to create a templatized data > structure which is both hashed and sequenced.. > > // typedef client_info_map::nth_index<1>::type clinfo_map_hash; > > // typedef client_info_map::nth_index<0>::type clinfo_map_list; > > * * > > This compiles fine. But when i uncomment the two index typedefs > (above), the compilation fails saying "ISO C++ forbids declaration of > `nth_index' with no type". > > Is there any other way of achieving the same result? > typedef *typename* client_info_map::*template* nth_index<1>::type clinfo_map_hash; In Christ, Steven Watanabe _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

boost multiindex: trying to create a template
by Sharad Mittal 18 Mar '08

18 Mar '08

I am trying to do the following in order to create a templatized data structure which is both hashed and sequenced.. template <class T> // class T will always have a member clientid class seq_hash_list { typedef multi_index_container < T *, indexed_by < sequenced< >, hashed_unique<member<T,nid, &T::clientid> > > > client_info_map; // typedef client_info_map::nth_index<1>::type clinfo_map_hash; // typedef client_info_map::nth_index<0>::type clinfo_map_list; public: client_info_map _clmap; }; This compiles fine. But when i uncomment the two index typedefs (above), the compilation fails saying "ISO C++ forbids declaration of `nth_index' with no type". Is there any other way of achieving the same result? Thanks, Sharad

2 1

How to print description of positional arguments with boost.program_options
by Angel Tsankov 18 Mar '08

18 Mar '08

Hello! Can I use boost.program_options to print a description, stating that a program only accepts a positional argument (position 1, name command) whose value can be install, run and uninstall. If so, how? Angel Tsankov

1 0

template int argument
by Hicham Mouline 18 Mar '08

18 Mar '08

hi, I have a template function <typename cT, typename tT, int n> { .... double array[n]; if (n==2) binomial code else if (n==3) trinomial code (array[0] array[1] array[2]) else .... compiler tries to compile the "trinomial code" code even when the template is instantiated with n=2, and that gives warnings because of array[2] Is there a way to make the compiler ignore the non-binomial code ? rds,

3 4

[boost::ublas] low level of performance with xlC
by Eloi Gaudry 18 Mar '08

18 Mar '08

I'd like to get your point of view on the following topic: runtime performance of binaries built against the IBM VisualAge c++ compilers. I've been recently investigating (with a colleague) various performance matters on a subset of platforms: Power 4 and Power 5 architecture running on different flavors of the AIX operating system, using binaries built with VisualAge C/C++ . We built and ran the boost::uBlas regression tests using either the VisualAge C/C++ v.9 or the GCC 4.0 compilers. Using similar levels of optimization, we observed that the GCC binaries were running much faster. The same tests were performed on a Linux 64-bits machine using a standard Core2 processor and GCC-4.2 and performance was again much much higher. Are we missing something here, something that could allow us to get a decent level of performance with the IBM compilers ? Thanks, Eloi -- Eloi Gaudry Free Field Technologies Axis Park Louvain-la-Neuve Rue Emile Francqui, 1 B-1435 Mont-Saint Guibert BELGIUM Company Phone: +32 10 487 959 Company Fax: +32 10 454 626

1 1

Re: [Boost-users] Error locating MSVCP80D.DLL MSVCR80D.DLL fromBoostlibraries boost-*-vc80-mt-gd-1_34_1.dll
by Erignac, Charles A 18 Mar '08

18 Mar '08

Thank you all for the replys to my enquiry. I solved my problem by installing the Service Pack 1 of VC-8.0. This update introduces a new set of runtimes (rev 762) that the loader is able to match with the Boost dlls. Oddly enough, the dependency walker (V2.2.6000) still fails to locate MSVCR80D.DLL as referenced by the version of MSVCP80D.DLL located here: c:\windows\winsxs\x86_microsoft.vc80.debugcrt_1fc8b3b9a1e18e3b_8.0.50727 .762_x-ww_5490cd9f\MSVCP80D.DLL Best regards, Charles > ______________________________________________ > From: Erignac, Charles A > Sent: Monday, March 17, 2008 10:53 > To: 'Boost-users(a)lists.boost.org' > Subject: Error locating MSVCP80D.DLL MSVCR80D.DLL from Boost > libraries boost-*-vc80-mt-gd-1_34_1.dll > > My boost dependent applications fail to start in debug mode: error > 14001. > The dependency walker cannot locate the VC-8.0 runtime dlls referenced > by the boost-*-vc80-mt-gd-1_34_1.dll libraries I build on my machine. > That is the multi-threaded debug dll runtime: MSVCP80D.DLL, > MSVCR80D.DLL. > The binary distribution I got from boost.com has the same problem. > This is related to the side-by-side configuration rather than making > sure that the runtime dlls are in my path. > A default win32 console project from VC-8.0 links fine in > multi-threaded debug dll runtime mode. > Also, a dll compiled in the VC-8.0 IDE referencing boost will resolve > the runtime correctly but the associated boost dlls won't. Thus the > dependency walker will also report unresolved runtime dlls/ > > I have re-installed VC-8.0 but without success. I also have VC-7.1 on > my machine. > > Help is greatly appreciated. > > Best regards, > Charles

1 0

Error locating MSVCP80D.DLL MSVCR80D.DLL from Boost libraries boost-*-vc80-mt-gd-1_34_1.dll
by Erignac, Charles A 18 Mar '08

18 Mar '08

My boost dependent applications fail to start in debug mode: error 14001. The dependency walker cannot locate the VC-8.0 runtime dlls referenced by the boost-*-vc80-mt-gd-1_34_1.dll libraries I build on my machine. That is the multi-threaded debug dll runtime: MSVCP80D.DLL, MSVCR80D.DLL. The binary distribution I got from boost.com has the same problem. This is related to the side-by-side configuration rather than making sure that the runtime dlls are in my path. A default win32 console project from VC-8.0 links fine in multi-threaded debug dll runtime mode. Also, a dll compiled in the VC-8.0 IDE referencing boost will resolve the runtime correctly but the associated boost dlls won't. Thus the dependency walker will also report unresolved runtime dlls/ I have re-installed VC-8.0 but without success. I also have VC-7.1 on my machine. Help is greatly appreciated. Best regards, Charles

3 2

Ugly warnings from BOOST_STATIC_ASSERT
by Erik 18 Mar '08

18 Mar '08

We have this really neat and simple macro in our project: #define compile_assert(x) typedef bool COMPILE_ASSERT[(x) ? 1 : -1] Although it does what we need and serves us well, I tried to replace it with BOOST_STATIC_ASSERT. Unfortunately this resulted in a lot of ugly warnings throughout the compile: warning: use of old-style cast Is there any chance to get this fixed?

3 4

boost/thread/detail/singleton.hpp : link error with VS 2008 and \clr option
by jean marc Mercier 18 Mar '08

18 Mar '08

Hello, I am using boost 1.34.1 and Visual C++ 2008. I use, among other boost facilities, the threaded singleton pattern included in #include <boost/thread/detail/singleton.hpp> This singleton just work fine when compiled withouth the /clr (common langage runtime) option. But, when the \clr option is active, I get 6 link error (LNK2019) : see bottom of message. At present time, the only workaround I have found is to comment the #include <boost/thread/detail/config.hpp> contained in <boost/thread/detail/singleton.hpp>. Did I misused something ? Thank you in advance for suggestions in this direction. Jean-Marc 1>libboost_thread-vc80-mt-gd-1_34_1.lib(tss.obj) : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall std::_Container_base::~_Container_base(void)" (__imp_??1_Container_base@std@@QAE@XZ) referenced in function "public: __thiscall std::_Vector_val<class boost::function1<void,void *,class std::allocator<class boost::function_base> > *,class std::allocator<class boost::function1<void,void *,class std::allocator<class boost::function_base> > *> >::~_Vector_val<class boost::function1<void,void *,class std::allocator<class boost::function_base> > *,class std::allocator<class boost::function1<void,void *,class std::allocator<class boost::function_base> > *> >(void)" (??1?$_Vector_val@PAV?$function1@XPAXV?$allocator@Vfunction_base@boost@@@std@@@boost@@V?$allocator@PAV?$function1@XPAXV?$allocator@Vfunction_base@boost@@@std@@@boost@@@std@@@std@@QAE@XZ) etc...

1 0

intrusive_ptr.hpp recursively including itself?
by framebuffer 18 Mar '08

18 Mar '08

Hello, I am using boost version 1.34. I installed prebuilt libraries and have not modified them in any way. When I try to compile the following program: #include <iostream> #include "boost/signals.hpp" void my_first_slot() { std::cout << "void my_first_slot()\n"; } class my_second_slot { public: void operator()() const { std::cout <<"void my_second_slot::operator()() const\n"; } }; int main() { boost::signal<void ()> sig; sig.connect(&my_first_slot); sig.connect(my_second_slot()); std::cout << "Emitting a signal...\n"; sig(); } I get the error: Error 1 fatal error C1014: too many include files : depth = 1024 d:\program files (x86)\boost\boost_1_34_0\boost\intrusive_ptr.hpp 1 Upon inspection I found that the intrusive_ptr.hpp is including itself. http://www.nabble.com/file/p16075513/intrusive_ptr.hpp intrusive_ptr.hpp The header of the file is as follows: #include <boost/detail/lightweight_test.hpp> #include <boost/intrusive_ptr.hpp> #include <boost/detail/atomic_count.hpp> #include <boost/config.hpp> #include <algorithm> #include <functional> When I try to use include guards it doesn't work either. I tried to find the answer in google but it seems I'm the only one having this problem. What is wrong here? Thanks. -- View this message in context: http://www.nabble.com/intrusive_ptr.hpp-recursively-including-itself--tp160… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

Boost-1.35
by Surya Kiran Gullapalli 18 Mar '08

18 Mar '08

I've recently upgraded my compiler from gcc-4.2 to gcc-4.3 and found that boost compilation is failing with an error saying undefined symbol CHAR_BIT. I've gone thru mailing list and found out this is fixed in cvs version (which is upcoming boost-1.35) Now my question is When is boost-1.35 expected? Surya

3 5

what permutation_iterator base returns
by Abir Basak 18 Mar '08

18 Mar '08

Hi, though the document says the boost permutation_iterator base returns an element iterator, but it seems actually returns the index iterator. eg, typedef std::vector<int> VI;///index iterator VI v; v+=1,3,4;///indices typedef std::vector<double> VF;///element iterator VF v1; v1+=0.5,1.5,2.5,3.5,4.5,5.5,6.5,7.5;///elements typedef boost::permutation_iterator<VF::iterator,VI::iterator> PI; PI b1 = boost::make_permutation_iterator(v1.begin(),v.begin()); PI e1 = boost::make_permutation_iterator(v1.begin(),v.end()); for(PI it = b1; it!= e1; ++it){ std::cout<<"IT "<<*it<<" B "<<*it.base()<<" "; } what i need is to compare the permutation iterator with an original iterator (i.e VF::iterator with PI like if(v1.begin()+1 == b1) or if(v1.begin()+1 == b1.base()) in this case which should return true) but i am not finding any such way to compare these two iterators .... thanks abir

1 0

Boost Selected for Google Summer of Code 2008
by Jeff Garland 18 Mar '08

18 Mar '08

For the third year in a row Boost has been selected as a mentoring organization for Google Summer of Code. If you're a student this is a great opportunity to contribute to Boost and make a few dollars over the summer. If you're interested here's some links to get you started. http://code.google.com/opensource/gsoc/2008/faqs.html http://code.google.com/soc/2008/boost/about.html We have a few project ideas at: http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Google_Summe… but, if you've got your own idea that's fine too. Best to put your ideas out on the development list for writing an application -- that's the best way to be sure the mentors think your project has merit. Here's some important dates to keep in mind: March 24: ~12 noon PDT / 19:00 UTC Student application period opens. March 31: 5:00 PM PDT / 00:00 UTC April 1, 2008 Student application deadline. Full timeline is here: http://code.google.com/opensource/gsoc/2008/faqs.html#0.1_timeline Jeff

1 0

BoostCon 2008 -- Session Announcement
by Jeff Garland 17 Mar '08

17 Mar '08

I'm happy to announce that the preliminary 2008 BoostCon program is on the web site. http://www.boostcon.com/program/sessions I'm quite pleased and excited with the program. We have tutorials and lectures on many core Boost libraries with topics including threading, serialization, networking, C++0x features, high performance generic programming, text processing, and more. We will also have a new 'Library in a Week' workshop to extend Boost.Algorithm. A new feature this year, based on feedback from last year, will be Author's Corner sessions where library authors discuss and answer questions about their libraries. And, finally, Bjarne Stroustrup with the keynote address. We hope to have the final program and schedule completed shortly. Note that while these sessions represent the bulk of the program we have a few more sessions in the works and are still looking for a couple more sessions to fill out the program. So, if you've been thinking of submitting a session please do it as soon as possible. http://www.boostcon.com/program/call-for-sessions Thanks, Jeff

1 0

Threads Don't Take Turns Under Linux (Ubuntu Gutsy Gibbon)
by Hal Vaughan 17 Mar '08

17 Mar '08

I apologize if this gets posted more than once. I found the group on GMane, tried to post, joined the email list, then tried to post several times but still have yet to see it show up. I'm learning C++ and found a tutorial on threads with Boost on Dr. Dobb's site. I've copied the code from this url: http://www.ddj.com/cpp/184401518?pgno=5 It's supposed to fill a buffer with data on one thread and remove data on the other thread. I would expect it to add data and remove at almost the same time but when I run it, it adds 10 items, then removes them, then adds ten again, and so on. It's never adding and removing in an "interleaved" fashion. I've also tried the same with simple counters where both threads count to ten, but it doesn't seem to make a difference. It seems no matter how I set it up, one thread either completes, or runs until it has to stop for a mutex, then the other thread runs. It seems that there is never a case of both threads running at the same time. I've never had trouble doing this in Perl with fork() so I'm not at all sure what could be going wrong. As I said, it's not just the program below, it seems to be any program that uses more than one thread. Am I doing something wrong or is there a setting I need to change? I'm compiling it with "g++ -lboost_thread mthrd.cpp -o mthrd && ./mthrd"; Thanks! Hal ------ #include <boost/thread/thread.hpp> #include <boost/thread/mutex.hpp> #include <boost/thread/condition.hpp> #include <iostream> const int BUF_SIZE = 10; const int ITERS = 100; boost::mutex io_mutex; class buffer { public: typedef boost::mutex::scoped_lock scoped_lock; buffer() : p(0), c(0), full(0) { } void put(int m) { scoped_lock lock(mutex); if (full == BUF_SIZE) { { boost::mutex::scoped_lock lock(io_mutex); std::cout << "Buffer is full. Waiting..." << std::endl; } while (full == BUF_SIZE) cond.wait(lock); } buf[p] = m; p = (p+1) % BUF_SIZE; ++full; cond.notify_one(); } int get() { scoped_lock lk(mutex); if (full == 0) { { boost::mutex::scoped_lock lock(io_mutex); std::cout << "Buffer is empty. Waiting..." << std::endl; } while (full == 0) cond.wait(lk); } int i = buf[c]; c = (c+1) % BUF_SIZE; --full; cond.notify_one(); return i; } private: boost::mutex mutex; boost::condition cond; unsigned int p, c, full; int buf[BUF_SIZE]; }; buffer buf; void writer() { for (int n = 0; n < ITERS; ++n) { { boost::mutex::scoped_lock lock(io_mutex); std::cout << "sending: " << n << std::endl; } buf.put(n); } } void reader() { for (int x = 0; x < ITERS; ++x) { int n = buf.get(); { boost::mutex::scoped_lock lock(io_mutex); std::cout << "received: " << n << std::endl; } } } int main(int argc, char* argv[]) { boost::thread thrd1(&reader); boost::thread thrd2(&writer); thrd1.join(); thrd2.join(); return 0; }

8 22

[tokenizer] mutable string iterator
by Christian Henning 17 Mar '08

17 Mar '08

Hi there, I would like to use the tokenizer to iterate through a string of words and reverse them. Something like this: string str( " Hello World" ); tokenizer<> tok(str); for(tokenizer<>::iterator beg=tok.begin(); beg!=tok.end();++beg) { reverse( (*beg).begin(), (*beg).end() ); } Why can't I get a mutable string iterator? Thanks, Christian

2 3

[mpl] apply is_base_and_derived to class template and deduce types
by Ares Lagae 17 Mar '08

17 Mar '08

I have a base class template "template <typename T1, typename T2> struct base {};" and a derived class "derived" that publicly derives from several instantiations from the base class template. Given a type "T1", is it possible to decide if the class "derived" is derived from a base "base<T1,X>" and deduce the unknown type "X"? Best regards, -- Ares Lagae Computer Graphics Research Group, Katholieke Universiteit Leuven http://www.cs.kuleuven.be/~ares/

2 1

Features list for v1.34
by Balasubramanyam, Shivakumar 17 Mar '08

17 Mar '08

Hi, Could someone point me to a link that provides features added or major bugs fixed for a major boost release. Currently we are using 1.32 and I would like to know if we need to upgrade to 1.34 releases. I tried in the boost.org but could not find a link. Thanks, Shiva

2 2

GraphProperty with adjacency_list cause a VC++ internal compiler error.
by Schick, Thorben (ITUC; ADITG/DFG) 17 Mar '08

17 Mar '08

Does anybody know if this will be fixed with the upcoming boost release/the new VS 9.0? Or is there some kind of workaround to solve this problem? I've already post this question, but i'm not sure if this worked...so i try again... Regards Thorben

1 0

[GIL] Where I can find docs
by Igor Mikushkin 17 Mar '08

17 Mar '08

Hello. Please tell me where I can find GIL documentation. Thanks Igor Mikushkin

3 2

Question on create_thread()
by Alexander Dong Back Kim 17 Mar '08

17 Mar '08

Hi all, I'm a new user of BOOST library. I'm creating a class that requires to do some multi threading stuff. The class I'm creating has a method... void Calculator::Calc(int value) { ... } In order to run multiple Calc() in different threads, I created another method FindResult() the implementation was... void Calculator::FindResult(int numbers) { thread_group group; boost::function<void (Calculator *, int value)> boostFunction; boostFunction = &Calculator::Calc; for(int i=0; i<3; i++) { boost::thread * th = group.create_thread(&boostFunction); } } However, it seems it doesn't work at all... Is there any idea?? Cheers, -- Alexander Dong Back Kim Australia +61 433 469 100 / Korea +82 10 6357 8840

1 0

Update for Australian DST changes.
by Brendon Oliver 16 Mar '08

16 Mar '08

Hi all, I've had to update my date_time_zonespec.csv file for this year's DST changes for Australia, copy of the file attached for anyone else needing it [all care, no responsibility, etc. etc. - the usual disclaimer :-) ] I generated this file based on the system zoneinfo database contained in FreeBSD 7.0, but that still shows last year's DST changes for Hobart - the attached file was manually updated to correct that. cheers, - Brendon. -- BOFH excuse #96: Vendor no longer supports the product 10:45:49 up 23 days, 20:28, 6 users, load average: 0.12, 0.18, 0.14

1 0

[Proto] review period extended to end March 28th
by Hartmut Kaiser 16 Mar '08

16 Mar '08

Hi all, There have been several requests to extend the Proto review period. For this reason the review now will end on March 28th. This should give you sufficient time to have a closer look at the library and to prepare a review. The original announcement follows: The review of Eric Nieblers Proto library starts today, March 1st 2008, and will end on March 14th. I really hope to see your vote and your participation in the discussions on the Boost mailing lists! --------------------------------------------------- About the library: Proto is a framework for building Domain Specific Embedded Languages in C++. It provides tools for constructing, type-checking, transforming and executing expression templates. More specifically, Proto provides: * An expression tree data structure. * Operator overloads for building the tree from an expression. * Utilities for defining the grammar to which an expression must conform. * An extensible mechanism for immediately executing an expression template. * An extensible set of tree transformations to apply to expression trees. * A mechanism for giving expressions additional behaviors and members. Documentation is here: http://boost-sandbox.sourceforge.net/libs/proto Download proto.zip from here: http://www.boost-consulting.com/vault/index.php?directory=Template%20Metapro gramming Proto is a very important infrastructure library, IHMO. It has been used as the backbone for several other library writing efforts already, such as Xpressive and the rewrite of Spirit (there it has been used for all three parts: the parser, the lexer and the generator modules), and it is a key enabling technology in the long-planned unification of Phoenix and the Lambda Library. --------------------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Regards Hartmut Review Manager

3 2