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

[interprocess] Determine size of managed_shared_memory
by Kai Benndorf 12 Oct '19

12 Oct '19

Hi all, I want to create a managed_shared_memory in exactly the size I needed. Therefore I do something like this: size = sizeof( common_managed_shared_memory ); size += sizeof( MyClassInSharedMem ); managed_shared_memory segment(create_only, "name", size ); MyClassInSharedMem allocates itself some memory by segment->allocate(). I added this also to the size, but get a boost::interprocess::bad_alloc exception on allocating this additional memory. Are there some magic bytes I forgot to add? Many thanks in advance Kai

3 2

[statechart] Passing parameters from event to State Local Storage
by Christophe Bourez 16 Nov '16

16 Nov '16

I need to maintain a parameter into the state local storage. This parameter is initially contained in the event that causes the transition to the target state. I give hereafter a small illustrative example. typename sc = boost::statechart; class EvTest : public sc::event<EvTest> { public: EvTest(std::size_t val) : value(val) {} std::size_t getValue() const { return this->value; } private: std::size_t value; }; class MyStateMachine; class StSource; class StTarget; class StSource : public sc::simple_state<StSource, MyStateMachine> { public: typedef sc::custom_reaction<EvTest> reactions; sc::result react(const EvTest &event) { // How to pass event.getValue() to the target state ? transit<StTarget>(); } }; class StTarget : public sc::simple_state<StTarget, MyStateMachine> { public: StTarget(std::size_t val) : val(value) {} private: std::size_t value; }; Thanks, Christophe

5 6

Statechart serialization
by mbrodeur65 04 Mar '15

04 Mar '15

Hi, I'm looking for a solution to serialize boost::statechart objects. I'm aware that this feature is on the statechart library todo list but was wondering if there are any workaround to achieve this with the latest boost release (1.34) ? thanks for your help ! mbrodeur65 -- View this message in context: http://www.nabble.com/Statechart-serialization-tf4131326.html#a11749139 Sent from the Boost - Users mailing list archive at Nabble.com.

4 4

[Thread] Read-write locks
by lfrfly＠icqmail.com 18 Sep '14

18 Sep '14

I'm trying to create a standard read/write lock using Boost Threads, and I'm having a bit of difficulty mapping the Boost concepts onto the usual ones. A read/write lock should have several states: Locked for reading (multiple threads may lock at once), locked for writing (only one thread may lock, and no threads may be locked for reading at the same time), and unlocked. Ideally it would be nice if an RWL which is locked for reading may temporarily upgrade to locked for writing, then return to the locked for reading state. Boost supports several relevant notions of locking: shared locking, upgrade locking, and exclusive locking. This to me is a confusing distinction. In particular, a shared_mutex seems appropriate as the basis for a RWL, but is lock_upgrade() the equivalent of a write lock and lock_shared the equivalent of a read lock? This is unclear. If "upgrade locking" is not the same as "exclusive locking", then is an upgrade lock actually exclusive? Could someone please clarify this.

4 3

[Statechart] How to decide between post_event and process_event atrun time ?
by Philippe DAVID 22 Jul '14

22 Jul '14

Hi, I have a method in which I want to post/process an event. The thing is, this method can be called from outside the state machine (so I need to call process_event), or indirectly by a reaction of the state machine (in this case I must call post_event since process_event is not reentrant). I don't want to write 2 distinct methods to do this (one that calls post, and the other process), I would much rather prefer adding a 'if' in my method that tells me if I have to call process_event or post_event (if I'm being called indirectly by the state machine or not). Is there a way to do this with statechart ? regards, Philippe

3 3

[asio] resolver::cancel() problem
by Matthew Edwards 14 Mar '14

14 Mar '14

In my application (and a separate test program) it seems as though the cancel() function on the resolver does not work as intended. For async resolves, the cancel functionality should abort them immediately and pass an 'operation aborted' error code to the callback handler. In my tests, I will resolve an invalid domain (this causes the resolve to take a few seconds, to demonstrate the problem), sleep for 100ms, then call cancel on the resolver object. No cancelling actually occurs, and the callback is simply triggered after a few seconds with a "No host found" error code, not the expected operation aborted. Has anyone experienced this before, or know how I might be using the resolver incorrectly?

3 2

[BGL] Having a cost function as weight map
by Maxime van Noppen 06 Sep '13

06 Sep '13

Hi, I can't find how to do this pretty basic thing : having a function instead of a field to compute the cost of edges for various path finding algorithms. I couldn't find the answer in the documentation and Google was of no help. Did I miss something obvious ? Example : ------------------- #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> struct my_edge { double cost() const { return cost_ * 2; } double cost_; }; struct my_node { }; int main() { typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::directedS, my_node, my_edge > graph_t; typedef boost::graph_traits<graph_t>::vertex_descriptor vertex_t; graph_t graph; vertex_t v /*= ... */; using boost::weight_map; // Works : boost::dijkstra_shortest_paths(graph, v, weight_map(boost::get(&my_edge::cost_, graph))); // Doesn't compile : //boost::dijkstra_shortest_paths(graph, v, // weight_map(boost::get(&my_edge::cost, graph))); } ------------------- Thanks ! -- Maxime

4 8

can't get first example in boost tutorial to work
by 7stud 11 Mar '13

11 Mar '13

I'm trying to install boost on mac osx 10.4.7. I followed the tutorial "Getting Started on Unix Variants" found here: http://www.boost.org/doc/libs/1_35_0/ more/getting_started/unix-variants.html Following the instructions in the tutorial, I installed boost in /usr/local as instructed, so my directory structure is: /usr/local/boost_1_34_1/boost But when I run the first example in the tutorial: #include <boost/lambda/lambda.hpp> #include <iostream> #include <iterator> #include <algorithm> int main() { using namespace boost::lambda; typedef std::istream_iterator<int> in; std::for_each(in(std::cin), in(), std::cout << (_1 * 3) << " " ); } I get the error(among others): error: boost/lambda/lambda.hpp: No such file or directory If I change the include path to: #include </user/local/boost_1_34_1/boost/lambda/lambda.hpp> I get the error(among others): error: boost/lambda/core.hpp: No such file or directory But core.hpp is in the lambda directory: /usr/local/boost_1_34_1/boost/lambda$ ls algorithm.hpp control_structures.hpp lambda.hpp bind.hpp core.hpp loops.hpp casts.hpp detail numeric.hpp closures.hpp exceptions.hpp switch.hpp construct.hpp if.hpp I'm using the Xcode 2.4 IDE to run my C++ programs. I also tried to execute the program from the command line with the original include path: #include <boost/lambda/lambda.hpp> but I get the same error: ~/2testing/dir1$ g++ prog1.cpp prog1.cpp:1:35: error: boost/lambda/lambda.hpp: No such file or directory prog1.cpp: In function 'int main()': prog1.cpp:8: error: 'boost' has not been declared prog1.cpp:8: error: expected namespace-name before ';' token prog1.cpp:8: error: '<type error>' is not a namespace prog1.cpp:11: error: '_1' was not declared in this scope I get the same errors again with the full include path: #include </user/local/boost_1_34_1/boost/lambda/lambda.hpp> $ g++ prog1.cpp In file included from prog1.cpp:1: /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:14:33: error: boost/lambda/core.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:21:52: error: boost/lambda/detail/operator_actions.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:22:61: error: boost/lambda/detail/operator_lambda_func_base.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:23:63: error: boost/lambda/detail/operator_return_type_traits.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:26:45: error: boost/lambda/detail/operators.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:30:46: error: boost/lambda/detail/member_ptr.hpp: No such file or directory prog1.cpp: In function 'int main()': prog1.cpp:8: error: 'boost' has not been declared prog1.cpp:8: error: expected namespace-name before ';' token prog1.cpp:8: error: '<type error>' is not a namespace prog1.cpp:11: error: '_1' was not declared in this scope What path should I be using? Or, should I set an environment variable somewhere?

6 16

Re: [Boost-users] asio HTTP Server 3 example memory leak
by admin＠thefireflyproject.us 25 Aug '12

25 Aug '12

2 1

[multi_array] operator= requires resize - why?
by Markus Werle 04 Jun '12

04 Jun '12

Hi! IMHO the behaviour of operator= for multi_array is a little bit broken. A lot of preconditions required: template <typename ConstMultiArray> multi_array_ref& operator=(const ConstMultiArray& other) { [...] // make sure the dimensions agree assert(other.num_dimensions() == this->num_dimensions()); assert(std::equal(other.shape(),other.shape()+this->num_dimensions(), this->shape())); Besides the fact that I get mad about asserts instead of exceptions (please change this to a way users may choose) why do we have such an odd behaviour here? >From page 1, line 3 of the docs I cite: "The interface design is in line with the precedent set by the C++ Standard Library containers" - this is not true for operator=, since std::<container>::operator= works fine for me all the time _without_ any resize. Could we please change the behaviour of multi_array::operator= to take care of resize where in need to? IMHO operator= should result in a true copy ignoring previous state. Markus

6 18

Recommended mock framework to use with Boost?
by doug livesey 15 Mar '12

15 Mar '12

Hi -- I'm trying to learn to develop properly with C++ and Boost, and to that end am learning along with Boost.Test, as I'm a BDD coder in another language (Ruby) in my day job. I'm at the point, now, where my tests could really benefit from a mocking framework. There doesn't appear to be one in Boost (not documented, at least), so I wondered if anyone on the list could recommend a mocking framework that they use that works well with Boost.Test? Any and all advice gratefully received, Doug.

9 16

[build] cannot specify different version of gcc
by Brodie Thiesfield 25 Aug '11

25 Aug '11

Hi, I'm trying to build boost on CentOS 5.5 using the /usr/bin/gcc44 compiler and I'm running into difficulties with documentation not fitting reality. How do I make this work? What I've tried... Note: I've removed /usr/bin/gcc and /usr/bin/g++ to force errors when gcc44 and g++44 are not used. Using ./bootstrap.sh Building Boost.Jam with toolset ... tools/jam/src/### ### No toolset specified. Please use --toolset option. Setting CC=/usr/bin/gcc44 and CXX=/usr/bin/g++44 (note that this won't work if gcc and g++ exist because then it will default to the gcc toolkit and not the gcc-4.4 toolkit that I want). This builds a number of things (looking at the bootstrap.log) but still gives the following error. Ignoring the error and calling ./bjam then fails. Building Boost.Jam with toolset ... tools/jam/src/### ### No toolset specified. Please use --toolset option. Using ./bootstrap.sh --toolset=gcc gives an error: unrecognized option: --toolset=gcc Using ./bootstrap.sh --with-toolset=gcc gives an error: Building Boost.Jam with toolset gcc... Failed to build Boost.Jam -> bootstrap.log shows that it is trying to build with gcc, which doesn't exist, therefore error. Using ./bootstrap.sh --with-toolset=gcc-4.4 gives an error: Building Boost.Jam with toolset gcc... Failed to build Boost.Jam -> bootstrap.log shows ### Unknown toolset: gcc-4.4 Creating ~/user-config.jam as: import toolset.using ; using gcc : 4.4 : g++44 ; export BOOST_USER_CONFIG=~/user-config.jam Then calling the same ./bootstrap.sh command lines above show no difference. How in the world do I get this thing to use /usr/bin/gcc44 and /usr/bin/g++44 to compile? I think that I'm going to have to create local links ./gcc -> /usr/bin/gcc44 and add the current directory to the path just to get this to build the way that I want it to. This seems crazy. Regards, Brodie

3 3

MSVC Visualizers Update
by Filip Konvička 28 Jul '11

28 Jul '11

Hi all, I've just updated the Boost visualizers wiki page at https://svn.boost.org/trac/boost/wiki/DebuggerVisualizers I updated the visualizer for Boost.MultiIndex, which did not work since Boost 1.35. I also added new visualizers for Boost.DateTime (ptime and time_duration) and a simple boost::shared_ptr visualizer. The visualizers are available for checkout via SVN at https://svn.boost.org/svn/boost/sandbox/boost_docs/subprojects/DebuggerVisu… Cheers, Filip

6 7

[multi-array] Extracting dimension information from a multi-array
by Ryan McConnehey 15 Jul '11

15 Jul '11

4 7

Asio unhandled exception
by Łukasz Majewski 20 May '11

20 May '11

Hello, I created a server single thread async (linux) and clinet (win). Every time client is close while server is writing to the socket connected to this client exception appears: terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::system::system_error>>' what(): Transport endpoint is not connected Aborted and server is terminated. I dont know why this exception is unhandled. int main( int argc, char** argv ) { try { boost::asio::io_service io_service; quotation_server server( io_service ); while ( true ) { try { io_service.run(); } catch( ... ){} } } catch ( std::exception& e ) { LOG << e.what() << std::endl; } catch( ... ) { LOG << "Unexpected exception" << std::endl; } return 0; }

2 1

Boost Install on Mac OS X using GCC
by Andrew 07 May '11

07 May '11

Hello, I'm trying to install boost on mac using the gcc compiler. I encounter these errors during installation for all libraries: "g++" -Wl,-R -Wl,"/System/Library/Frameworks/Python.framework/Versions/2.6/lib" -Wl,-R -Wl,"/System/Library/Frameworks/Python.framework/Versions/2.6/lib/python2.6/config" -o "stage/lib/libboost_prg_exec_monitor.dylib" -Wl,-h -Wl,libboost_prg_exec_monitor.dylib -shared -Wl,--start-group "/Users/andrew/boost/boost/bin.v2/libs/test/build/gcc-4.2.1/release/threading-multi/execution_monitor.o" "/Users/andrew/boost/boost/bin.v2/libs/test/build/gcc-4.2.1/release/threading-multi/debug.o" "/Users/andrew/boost/boost/bin.v2/libs/test/build/gcc-4.2.1/release/threading-multi/cpp_main.o" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group ...failed gcc.link.dll stage/lib/libboost_prg_exec_monitor.dylib... gcc.link.dll stage/lib/libboost_unit_test_framework.dylib ld: unknown option: -R collect2: ld returned 1 exit status I have no experience at all using boost in mac, and it is necessary that I use gcc. I am wondering if anyone could point me to a solution regarding this. Thanks, Andrew

6 7

distributed breadth first search doesn't work properly?
by Mattia Lambertini 04 May '11

04 May '11

Hi, i am new to boost and i'm using the PBGL to write a software that compute some graph analysis. I've installed boost 1.44.0 and openmpi 1.5 I tried to run the breadth first search example located in $BOOST_ROOT/libs/graph_parallel/example with the graph $BOOST_ROOT/libs/graph/test/weighted_graph.gr All went well since i figure out that the result is different if i run the algorithm with a different number of processors. Only with one processor the values are corrected. here's what happens: mpirun -np 1 ./breadth_first_search.out graph g { subgraph cluster_0 { label="p0"; n0[label=0]; n1[label=2]; n2[label=1]; n3[label=2]; n4[label=1]; } n0 -- n2; n1 -- n1; n1 -- n3; n1 -- n4; n2 -- n1; n2 -- n3; n3 -- n4; n4 -- n0; n4 -- n1; } --------------------- mpirun -np 2 ./breadth_first_search.out graph g { subgraph cluster_0 { label="p0"; n0[label=0]; n1[label=1]; n2[label=1]; } n0 -- n2; n1 -- n1; n1 -- n3; n1 -- n4; n2 -- n1; n2 -- n3; subgraph cluster_1 { label="p1"; n3[label=1]; n4[label=0]; } n3 -- n4; n4 -- n0; n4 -- n1; } Is that correct? From the doc i can't figure out why.. -- Cordiali saluti, Mattia Lambertini

2 11

Request for conditional index feature in boost multi-index
by Gokulakannan Somasundaram 28 Apr '11

28 Apr '11

Hi, First of all thanks for the great library, which had reduced our development time by a lot. In boost multi-index, we currently have almost all the indexing concepts integrated. Hence i am requesting for a new feature called conditional indexes, where in an index/view inside multi-index will only index a portion of the entries inside the entire multi-index(Say something that satisfies a functor). This is in resemblance to the partial indexes in Postgresql. I feel that would provide elegant solutions to lot of issues without forming round about solutions. For example i have a requirement where in there are two sets of data with the same search criteria, but different eviction criteria Say i have two sets of data with same search condition, but one set needs a MRU(Most Recently Used) list of 100 and the other set requires a MRU of 200. Say the entry is like this class Student { int student_no; char sex; std::string address; }; The search criteria is student_no, but for sex='m', we need MRU of 200 and for sex='f', we need a MRU of 100. Now i have a solution where in i introduce a new ordered index to maintain ordering. For example the IndexSpecifierList will be something like this typedef multi_index_container< Student, indexed_by< ordered_unique< member<Student, int, &Student::student_no> >, ordered_unique< composite_key< member<Student, char, &Student::sex>, member<Student, int, &Student::sex_specific_student_counter> > > > > student_set Here i have to introduce a new counter called sex_specific_student_counter, and during the eviction time, i need a logn search. Insertion also involves a extra logn complexity. Now instead if i have two sequenced indexes (like mentioned in the MRU example) in the place of second ordered index, but both with a condition on indexing only a few items, this would have looked more elegant and with better performance. Thanks in advance, Gokul.

3 3

[Asio] Socket Read/Write Thread-Safety
by Timothy Liang 06 Apr '11

06 Apr '11

Hi, I'm implementing a full-duplex protocol over TCP/IP using Boost.Asio. Multiple threads will be calling 'io_service::run_one()', so I have to serialize my completion handlers. Since I need to be reading and writing on a socket at the same time, can I use the 'boost::asio::async_read(...)' and 'boost::asio::async_write(...)' functions? The documentation states that these are implemented in terms of calls to the stream's async_read_some and async_write_some functions, and the 'basic_stream_socket' class isn't thread-safe. Thanks, Timothy

4 15

vs 2010 can't find correct boost lib version?
by Li, Tieniu 30 Mar '11

30 Mar '11

I built boost with visual studio 2010. Libraries of *-vc100-* are generated correctly. When trying to using boost.thread, VS 2010 generated error message: can't find *-vc90-*.lib. Any idea and fixing? Thanks a lot.

4 4

Re: [Boost-users] Collecting boost multi-index meta data
by Joaquin M Lopez Munoz 25 Mar '11

25 Mar '11

Gokulakannan Somasundaram <gokul007 <at> gmail.com> writes: > > > Hi, > Say i have a boost::tuple / MPL Sequence, on which i have > created a multi-index. Is it possible for me collect all the > attribute numbers on which i have declared the > IndexSpecifierList( the one passed as template parameter to > boost::multi_index::indexed_by ) ? Hi Gokul, I'm not sure I undersand your question. Have you taken a look at the index_type_list nested type? http://www.boost.org/libs/multi_index/doc/reference/multi_index_container.h… types >From this MPL sequence you can easily extract the list of key extractor types used for defining the multi_index_container, which hopefully is close to what you're after. Don't hesitate to elaborate a little more on your question and I'll see whether I can be more helpful. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 4

[BGL] Separating twin vertices
by Shaun Jackman 19 Mar '11

19 Mar '11

Hi, I have a directed graph where every vertex has a twin vertex. It is known ahead of time which pairs of vertices are twins. I want to remove as few vertices as possible from the graph such that no vertex and its twin is in the same connected component. Could someone suggest an appropriate algorithm? I've just started delving into the BGL. So far I'm suitably impressed! Cheers, Shaun

2 5

[iostreams] restriction device/filter
by Borko Jandras 09 Mar '11

09 Mar '11

Hello, I'm looking at the implementation of the "restriction" device, from Boost.Iostreams library, which provides access to a subsequence of the original device. When it reaches the end of the input subsequence, the restriction device start performing read()'s of size zero on the original device. Shouldn't it be returning an end-of-sequence marker (EOF) instead? I am using a restriction device as source parameter for the iostreams::copy function and this always results in an infinite loop. Am I doing something wrong? Thanks! - Borko

3 3

[GIL] gray pixel iterator in generic algorithm
by Curtis Gehman 17 Feb '11

17 Feb '11

I'm trying to use GIL pixel iterators in a generic STL-style algorithm. I'm primarily using GIL for the generic 2D iterators. And in my context, I'm only interested in grayscale images. The value_type associated with GIL iterators is a pixel type, which typically is an object representing multiple channels (e.g., colors). It makes sense that comparison operators (e.g., <) are not defined for general color pixel types. For grayscale images, however, it makes sense that common arithmetic and comparison operators would be defined for the pixel type. This seems to be the case for the 8-bit grayscale GIL type (gray8_view_t). The iterator's value_type appears to be seamlessly evaluated to an unsigned char, exactly as I would expect. When I try to use a float image view type, however, the same magic doesn't seem to happen. Below is some toy code that demonstrates the issue. When the last line is knocked out with "//", the code compiles. But with that second template instantiation (for floats) there, the compiler (gcc 4.2 and VC++2010) exits when it does not find an operator< for the iterator's value_type when instantiating for gray32fc_view_t. I suppose that I can roll my own less<iterator_traits<SrcView::x_iterator>::value_type> functors. But I just started using GIL, and I'm hoping that there is a simpler solution. Any ideas? #include <algorithm> #include <iterator> #include <vector> #include <boost/gil/gil_all.hpp> namespace g = boost::gil; using std::vector; using std::iterator_traits; template <typename SrcView> inline vector<typename iterator_traits<typename SrcView::x_iterator>::value_type> row_min(const SrcView& src) { typedef typename iterator_traits<typename SrcView::x_iterator>::value_type value_t; vector<value_t> result; for (int y = 0; y < src.height(); ++y) { result.push_back(*std::min_element(src.row_begin(y), src.row_end(y))); } return result; } // Explicit template instantiation // Works for gray8c_view_t. template vector<iterator_traits<g::gray8c_view_t::x_iterator>::value_type> row_min(const g::gray8c_view_t& src); // Compile error for gray32fc_view_t. // No operator< for iterator_traits<g::gray32fc_view_t::x_iterator>::value_type. template vector<iterator_traits<g::gray32fc_view_t::x_iterator>::value_type> row_min(const g::gray32fc_view_t& src);

3 7

Thread changes from Boost 1.38 to 1.45
by Ven Tadipatri 08 Feb '11

08 Feb '11

Hi, We upgraded our project from using Boost 1.38 to Boost 1.45 but now seem to be having some thread issues. The error doesn't happen for every run, but occasionally the wait method in condition_variable_any fails. At other times the program seems to run into an infinite loop, presumably waiting for a lock that's never released. I looked at the changes in http://www.boost.org/doc/libs/1_45_0/doc/html/thread/changes.html but don't see what could be causing the error to occur only after upgrading to Boost 1.45. Has anyone else experienced their code breaking when upgrading to the latest version of Boost? Thanks, Ven

5 10

Re: [Boost-users] multi_array and variants
by Alle Meije Wink 07 Feb '11

07 Feb '11

Dear Kris, thanks for your reply. > > What I now have is a class bisArray: > > ... > > template<typename T> > > class bisArray: public bisObject { > > typedef boost::variant > > < boost::multi_array_ref<T, 1>, > > boost::multi_array_ref<T, 2>, > > boost::multi_array_ref<T, 3>, > > boost::multi_array_ref<T, 4>, > > boost::multi_array_ref<T, 5>, > > boost::multi_array_ref<T, 6>, > > boost::multi_array_ref<T, 7>, > > boost::multi_array_ref<T, 8>, > > boost::multi_array_ref<T, 9> > > > bisArray_t; > > bisArray_t _bisArray; > > ... > > > > and a class bisImage, which has a bisArray as well as a pointer to the > > data as read from file (1-dimensional structure): > > ... > > > > template<typename T> > > > > class bisImage: public bisObject { > > > > public: > > > > /** Constructor using existing array data > > Reformats array as bisImage > > */ > > bisImage ( T* _data, size_t _dimensions, std::vector<size_t> _sizes > > ): > > data(_data), dimensions(_dimensions) { > > > > This code (or You) comes from java or C#, doesn't it? ;-) In C++ it is > supposed to be this->[...] instead of this.[...] No, it's C (which doesn't use any of this -not properly at least). The whole this[...] business was not supposed to be there anyway I realised. The reason that I went to boost:: is that I was hoping to get one class for all data types (using T) and dimensionalities (using multi_array) > Second thing: the member storage is initialized with the default constructor > (which in this case does not exist => error ), and then assigned (below). > > I suggest a change to: > bisImage([...]) : [...], storage( _data, _dimensions, _size ) { [...] > and remove the assignment from the body of the constructor > > Note also: I have read in many places, that you should not use names > beginning with an underscore (_), because they are reserved for > compiler/library implementation. One of those places was Herb Sutter's gotw > series. Ah! The underscore names come from a library that I tried to imitate which has successfully incorporated some aspects of boost(it is called MIMAS). Have not reached the stage of 'nicifying' the code yet... I moved the storage thing to where you suggested (1 line up) and that does get rid of lots of errors. However what I am stuck with seems to be, in essence, still the same thing: >>> /home/amwink/programs/cpp/bis/src/bisniftiimage.cpp||In function ‘void bis::bisReadNifti(std::string)’:| >>> /home/amwink/programs/cpp/bis/src/bisniftiimage.cpp|102|warning: unused variable ‘testimage’| >>> /usr/include/boost/variant/variant.hpp||In constructor ‘boost::variant<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19>::variant() [with T0_ = boost::multi_array_ref<unsigned char, 1ul>, T1 = boost::multi_array_ref<unsigned char, 2ul>, T2 = boost::multi_array_ref<unsigned char, 3ul>, T3 = boost::multi_array_ref<unsigned char, 4ul>, T4 = boost::multi_array_ref<unsigned char, 5ul>, T5 = boost::multi_array_ref<unsigned char, 6ul>, T6 = boost::multi_array_ref<unsigned char, 7ul>, T7 = boost::multi_array_ref<unsigned char, 8ul>, T8 = boost::multi_array_ref<unsigned char, 9ul>, T9 = boost::detail::variant::void_, T10 = boost::detail::variant::void_, T11 = boost::detail::variant::void_, T12 = boost::detail::variant::void_, T13 = boost::detail::variant::void_, T14 = boost::detail::variant::void_, T15 = boost::detail::variant::void_, T16 = boost::detail::variant::void_, T17 = boost::detail::variant::void_, T18 = boost::detail::variant::void_, T19 = boost::detail::variant::void_]’:| >>> /home/amwink/programs/cpp/bis/src/bisarray.hpp|52|instantiated from ‘bis::bisArray<T>::bisArray(T*, size_t, std::vector<long unsigned int, std::allocator<long unsigned int> >) [with T = unsigned char]’| >>> /home/amwink/programs/cpp/bis/src/bisimage.hpp|33|instantiated from ‘bis::bisImage<T>::bisImage(T*, size_t, std::vector<long unsigned int, std::allocator<long unsigned int> >) [with T = unsigned char]’| >>> /home/amwink/programs/cpp/bis/src/bisniftiimage.cpp|126|instantiated from here| >>> /usr/include/boost/variant/variant.hpp|1198|error: no matching function for call to ‘boost::multi_array_ref<unsigned char, 1ul>::multi_array_ref()’| >>> /usr/include/boost/multi_array/multi_array_ref.hpp|623|note: candidates are: boost::multi_array_ref<T, NumDims>::multi_array_ref(T*, const typename boost::const_multi_array_ref<T, NumDims, T*>::storage_order_type&, const typename boost::const_multi_array_ref<T, NumDims, T*>::index*, const typename boost::const_multi_array_ref<T, NumDims, T*>::size_type*) [with T = unsigned char, long unsigned int NumDims = 1ul]| >>> /usr/include/boost/multi_array/multi_array_ref.hpp|469|note: boost::multi_array_ref<T, NumDims>::multi_array_ref(T*, const boost::detail::multi_array::extent_gen<NumDims>&, const boost::general_storage_order<NumDims>&) [with T = unsigned char, long unsigned int NumDims = 1ul]| >>> /usr/include/boost/multi_array/multi_array_ref.hpp|463|note: boost::multi_array_ref<T, NumDims>::multi_array_ref(T*, const boost::detail::multi_array::extent_gen<NumDims>&) [with T = unsigned char, long unsigned int NumDims = 1ul]| >>> /usr/include/boost/multi_array/multi_array_ref.hpp|417|note: boost::multi_array_ref<unsigned char, 1ul>::multi_array_ref(const boost::multi_array_ref<unsigned char, 1ul>&)| >>> ||=== Build finished: 1 errors, 1 warnings ===| So boost.variant now sugegsts that multi_array_ref() is called, a constructor with no arguments! I don't use that, and I don't even think it exists (because it produces a multi_array view of an *existing* C-style array! The only way I knew to initialise a bisArray was with using a switch statement -proper C: switch dims{ case 1: _bisarray=multi_array_ref<T,1> (data, sizes); break; case 2: _bisarray=multi_array_ref<T,2> (data, sizes); break; ... } That is the only way multi_array_ref is called! Any idea why a problem with the *default* constructor would turn up? Thanks for your suggestions! My error list already fits on one screen :) Alle Meije

3 3

MPFR in Boost 1.45.0
by Novak Elliott 05 Feb '11

05 Feb '11

Hi, I searched the boost mailing list archives on MPFR and the last query was in Feb 2010 so I think this may be worth a new thread. I'm interested in using MPFR (C library for multiple-precision floating-point computations with *correct rounding - *http://www.mpfr.org/) with some of the boost math libraries (vectors, matrices). Support is available to do this via the bindings in boost/math/bindings/mpfr.hpp<http://www.boost.org/doc/libs/1_45_0/boost/math/bindings/mpfr.hpp>. As per the documentation ( http://www.boost.org/doc/libs/1_45_0/libs/math/doc/sf_and_dist/html/math_to… ): "In order to use these bindings you will need to have installed MPFR plus it's dependency the GMP library and the C++ wrapper for MPFR known as gmpfrxx (or mpfr_class)." However, when compiling the example listed in the documentation: #include <boost/math/bindings/mpfr.hpp> #include <boost/math/special_functions/gamma.hpp> int main() { mpfr_class::set_dprec(500); // 500 bit precision // // Note that the argument to tgamma is an expression template, // that's just fine here: // mpfr_class v = boost::math::tgamma(sqrt(mpfr_class(2))); std::cout << std::setprecision(50) << v << std::endl; } I get a large number of compile errors (attached). I do have GMP, MPFR and gmpfrxx installed, although to get the gmpfrxx example to work (source: example.cpp) I had to comment out the reference to GMP_RND_MAX as this enumerated type value, present in MPFR version 2.4.2, has been removed from mpfr.h from version 3.0.0. Does anyone have any experience is getting boost 1.45.0 running with MPFR 3.0.0? I'm wondering whether this an MPFR problem, a boost bindings problem, or both. cheers, Novak.

3 5

[statechart]BitMachine with custom reactions. How to?
by vs＠spinke.de 03 Feb '11

03 Feb '11

Hello! I tried to add custom reactions to the statechart library example BitMachine. It shall not only change the state, but also perform some (self-defined) action on the transition. Could somebody tell me, where I have to add / change what in order to achieve the goal? Any hints are welcome. Thanks a lot. Volker

2 1

What's happened to Ryppl?
by Robert Jones 02 Feb '11

02 Feb '11

33 109

[boost.test] benchmarking support
by Marco Craveiro 01 Feb '11

01 Feb '11

hi boosters, i've been looking for benchmarking support for unit tests, but googling didn't produce any obvious results (and a wealth of spurious matches, so i may have missed something). what i have in mind is something akin to cppbench but for boost.test: http://blog.quibb.org/cppbench/ basically, something that allows repeating each test a number of times, and then time the total execution time per test. is this available? if not, can anyone recall any discussions on the subject? many thanks for your time, marco -- Constraint has encouraged not only economy, but also a certain elegance of design. -- Dennis Ritchie

3 4

win32 api
by Gianni Ambrosio 01 Feb '11

01 Feb '11

Hi All, I'm working on a piece of code that should run on a special real-time kernel that supports only a minimal set of win32 api. I would like to use boost sockets and threads but it seems there are some dependencies on win32 api not supported by that system (i.e. WSARecvFrom, WSASend, WSASocketA, WSAStringToAddressA). Is there a way to build boost libs with some options so that the C socket calls are used instead? I'm asking too much? Regards Gianni

2 4

Planar Embedding of a Graph
by Nitin Gangahar 01 Feb '11

01 Feb '11

Hi all! I am totally new to the Boost Library. I just wanted to know if BGL supports finding if a graph is planar or not and also the planar embedding of a graph. Thanking you, Nitin Gangahar

2 2

Compiling Boost
by Bhushan Inamdar 31 Jan '11

31 Jan '11

Hi all, I have installed Boost 1.44 and I have a program from a tutorial I am trying to compile with out success. The program is as follows: =============================================================================== #include <iostream> #include <vector> #include <algorithm> #include <boost/shared_ptr.hpp> using namespace::std; struct Boost_Example { Boost_Example(int _x) : x (_x) { } ~Boost_Example() { std::cout << "Destroying Boost_Example x = " << x << "\n"; std::cout << endl << endl << " "; system("PAUSE"); cout << endl << endl; } int x; }; typedef boost::shared_ptr<Boost_Example> Boost_ExamplePtr; struct Boost_ExamplePtrOps { bool operator()(const Boost_ExamplePtr &a, const Boost_ExamplePtr &b) { return a->x < b->x; } void operator()(const Boost_ExamplePtr &a) { std::cout << " " << a->x; } }; int main() { std::vector<Boost_ExamplePtr> Boost_Example_Vector; Boost_Example_Vector.push_back(Boost_ExamplePtr(new Boost_Example(3))); Boost_Example_Vector.push_back(Boost_ExamplePtr(new Boost_Example(2))); Boost_Example_Vector.push_back(Boost_ExamplePtr(new Boost_Example(1))); // std::cout << endl << endl; std::cout << " Original Boost_Example_Vector" ; std::for_each(Boost_Example_Vector.begin(), Boost_Example_Vector.end(), Boost_ExamplePtrOps()); std::cout << "\n"; // std::sort(Boost_Example_Vector.begin(), Boost_Example_Vector.end(), Boost_ExamplePtrOps()); std::cout << endl << endl; std::cout << "Sorted Boost_Example_vector: " ; std::for_each(Boost_Example_Vector.begin(), Boost_Example_Vector.end(), Boost_ExamplePtrOps()); std::cout << " \n"; // std::cout << endl << endl << " " ; system("PAUSE"); std::cout << endl << endl; // return 0; } ============================================================================= Just create an empty VC++ project and add a source file to it. Then paste this code in the source file. I believe that, if Boost is correctly installed on one's machine, this should compile correctly. For additional information, I have set up the include and lib directories as under: includes: $(BOOST_ROOT)boost libs $(BOOST_ROOT)stage\lib $(BOOST_ROOT)libs $(BOOST_ROOT)bin.v2 In the above paths, $(BOOST_ROOT) is added to "System Variables" under the "Environment Variables" as C:\Program Files\boost\boost_1_44_0 where it is installed. Shall a "\" be added in the end? Or shall this variable be added to "Path variables" instead of "System variables"? I believe that my environment is rightly setup. But I am still having problems building a simple console application. I am using Visual Studio 2008 on Windows 7. Please let me know, what to do and where to check for the missing block? Thanks and regards, Bhushan

2 1

Problems with testing a putatively successful build using cygwin
by Ted Byers 31 Jan '11

31 Jan '11

I tried the following: ./bootstrap.sh --exec-prefix=/usr/local ./bjam --layout=versioned --build-type=complete cd status ../bjam And I was planning the following if the result of the above was acceptable. ./bjam install However, every time I have tried this, it stops part way through, at the following the last few lines: ../boost/iterator/iterator_facade.hpp:514: warning: type qualifiers ignored on function return type gcc.compile.c++ ../bin.v2/libs/regex/test/regex_regress_threaded.test/gcc-4.3.4/debug/thread ing-multi/regress/test_unicode.o In file included from ../boost/date_time/posix_time/posix_time_system.hpp:14, from ../boost/date_time/posix_time/ptime.hpp:12, from ../boost/date_time/posix_time/posix_time_types.hpp:12, from ../boost/thread/thread_time.hpp:11, from ../boost/thread/locks.hpp:12, from ../boost/thread/pthread/mutex.hpp:12, from ../boost/thread/mutex.hpp:16, from ../boost/thread/pthread/thread_data.hpp:12, from ../boost/thread/thread.hpp:17, from ../boost/thread.hpp:13, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/info.hpp:27, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test_not_regex.hpp: 22, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test.hpp:31, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\test_unicode.cpp:21: ../boost/date_time/time_system_split.hpp:41:1: warning: use of C99 long long integer constant gcc.compile.c++ ../bin.v2/libs/regex/test/regex_regress_threaded.test/gcc-4.3.4/debug/thread ing-multi/regress/test_overloads.o In file included from ../boost/date_time/posix_time/posix_time_system.hpp:14, from ../boost/date_time/posix_time/ptime.hpp:12, from ../boost/date_time/posix_time/posix_time_types.hpp:12, from ../boost/thread/thread_time.hpp:11, from ../boost/thread/locks.hpp:12, from ../boost/thread/pthread/mutex.hpp:12, from ../boost/thread/mutex.hpp:16, from ../boost/thread/pthread/thread_data.hpp:12, from ../boost/thread/thread.hpp:17, from ../boost/thread.hpp:13, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/info.hpp:27, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test_not_regex.hpp: 22, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test.hpp:31, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\test_overloads.cpp:1 2: ../boost/date_time/time_system_split.hpp:41:1: warning: use of C99 long long integer constant gcc.compile.c++ ../bin.v2/libs/regex/test/regex_regress_threaded.test/gcc-4.3.4/debug/thread ing-multi/regress/test_operators.o In file included from ../boost/date_time/posix_time/posix_time_system.hpp:14, from ../boost/date_time/posix_time/ptime.hpp:12, from ../boost/date_time/posix_time/posix_time_types.hpp:12, from ../boost/thread/thread_time.hpp:11, from ../boost/thread/locks.hpp:12, from ../boost/thread/pthread/mutex.hpp:12, from ../boost/thread/mutex.hpp:16, from ../boost/thread/pthread/thread_data.hpp:12, from ../boost/thread/thread.hpp:17, from ../boost/thread.hpp:13, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/info.hpp:27, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test_not_regex.hpp: 22, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\/test.hpp:31, from C:\cygwin\home\Ted\boost_1_45_0\libs\regex\test\regress\test_operators.cpp:1 2: ../boost/date_time/time_system_split.hpp:41:1: warning: use of C99 long long integer constant gcc.link ../bin.v2/libs/regex/test/regex_regress_threaded.test/gcc-4.3.4/debug/thread ing-multi/regex_regress_threaded.exe The last gcc.link statement above has been the last statement in the cygwin bash console for about 12 hours now. I am rather surprised that either bjam or a test program it is running can stop like that and not have bjam detect it and respond appropriately. Is there a way to prevent this from happening? I know (from having tried it), that I can terminate this and re-execute bjam in status, and that that will finish, but doing that doesn't tell me what fraction of tests succeeded. Rather, it tells me only about those targets that were found, and their result, during the current executin. Obviously, it will ignore all the tests that had been performed previously. I also see a lot of files created in status during the test. Is there a script that will process the contents of status and tell me at least the sort of info provided in the table on " http://www.boost.org/development/tests/trunk/developer/summary.html"? Thanks Ted

1 0

[1.46.0 beta 1] Release 1.46.0 beta 1 available
by Beman Dawes 31 Jan '11

31 Jan '11

Boost release 1.46.0 beta 1 is now available from SourceForge See http://sourceforge.net/projects/boost/files/ This release contains one new library, Interval Containers, and numerous enhancements and bug fixes for existing libraries. For details of what's in the release, see http://beta.boost.org/users/news/version_1_46_0. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus

2 1

getting a return value from a bind?
by pedro chaparro 31 Jan '11

31 Jan '11

hi , i have on my code something like boost::thread thrd(boost::bind(&myioTCPLTE,TCPmsg)) function myioTCPLTE return a string value, bu i dont now how to get it to store in a different variable from the main code!! Could anyone help me? thanks -- Pedro Alonso Chaparro Valero R&D Engineer Ciudad Politecnica de la Innovación iTEAM - Mobile Communications Group Polytechnic University of Valencia C\ Camino de Vera S/N, Edificio 8G 46022 Valencia, Spain

2 1

Re: [Boost-users] [Asio] Socket Read/Write Thread-Safety (Timothy Liang)
by Marat Abrarov 31 Jan '11

31 Jan '11

> The 'boost::asio::async_read(...)' and 'boost::asio::async_write(...)' > functions might call async_read_some and async_write_some concurrently in > some scenarios, as they do not synchronize accesses to the stream object > that I'm passing to them as a reference. A look in their implementations > confirms this: if the stream's async_read_some or async_write_some didn't > satisfy the completion condition, it tries again, using the same reference > to the stream object. With multiple threads calling > io_service::run_one(), the result can be one thread calling > async_read_some while another is calling async_write_some at the same > time. This seems to prevent me from using async_read and async_write at > all, so I'm wondering if the stream has some undocumented thread-safety > guarantees, or if there's a proper way to achieve the same effect. RTFM. Really, RTFM. Use boost::asio::io_service::strand and don't worry about synchronization. http://www.boost.org/doc/libs/1_45_0/doc/html/boost_asio/overview/core/stran ds.html You can use async_read and async_write simultaneously (but note "Thread Safety" for used asio class) with strands easily. Yes, with multiple threads running boost::asio::io_service::run on the same boost::asio::io_service object. What amazing laziness in reading asio docs :) - all of the latest questions about Boost.Asio have respective answers in documentation. Marat Abrarov.

2 1

[Range] Sliced range adaptor, alternative for non RandomAccessRanges?
by Alastair Rankine 31 Jan '11

31 Jan '11

Hi, Currently it seems that the sliced range adaptor [1] requires a Random Access Range to do its job. Hence it can't be used for other ranges which dont model this concept. I want to use it with a Forward Range, specifically a std::set iterator range. What I want to do is this: std::set<int> input; input += 1,2,3,4,5,6,7,8,9; boost::copy( input | sliced(2, 5), std::ostream_iterator<int>(std::cout, ",")); (as per the sliced example, but with a std::set instead of a std::vector). I don't know much about the internals of the sliced adapter, but could it be changed to work a similar manner to counting_range, in order to locate the relevant slice of the input range? This would allow it to operate efficiently on Forward Ranges. Failing this, is there an efficient alternative to the above example? [1]: http://www.boost.org/doc/libs/1_45_0/libs/range/doc/html/range/reference/ad…)

3 3

graph- single source K shortest path with Boost Library
by Alexandre Lima 31 Jan '11

31 Jan '11

Hi, I would like to know if somebody could help me with Graphs. I need to find the 10th or kth shortest path in a single source problem, weighted >0, in other words, I need to keep the 10th or more first paths of one source to all other vertexes. I had already done that using a K shortest path algorithm (Yen, http://code.google.com/p/k-shortest-paths/ ),which discovery all the paths of a source to a sink, and I had just used a "for" with an objective to try all the sink nodes to solve the problems to all vertexes. It works, but the problem is that I can't use it in a big graph with 500 000 nodes, problems with memory. And now I am trying to use the boost library to compute at least the 10th shortest path to all nodes from a sink, but I don't know how can I keep the other paths. Attached: graph_al.cpp that is the code of boost library to compute a single source shortest path with dijkstra and pseudo_code that I was thinking to use to storage the other paths, but I don't know how to use it in a complex code like dijkstra boost code. If someone could help me ? thank you in advance. Alexandre de Lima

1 0

Re: [Boost-users] What's happened to Ryppl?
by Brian Wood 31 Jan '11

31 Jan '11

Edward Diener: >On 1/30/2011 7:16 PM, Scott McMurray wrote: >> >> >> I agree -- everything different about a DVCS is a consequence of >> allowing local commits. The best way I've seen of phrasing that >> fundamental difference: >> >> "[A DVCS] separates the act of committing new code from the act of >> inflicting it on everybody else." ~<http://hginit.com/00.html> > > But of course when you eventually merge all your local commits which Git > encourages you to keep to yourself until you are good and ready to > combine them with other people's repositories and local commits, I think that's called chewing the cud. I'm not a Git user, but it reminds me of the saying, "Don't call us, we'll call you." I find this thread interesting so thanks to all involved. And thanks for not top-posting. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net (651) 251-9384

1 0

[boost 1.45.0][mingw] Boost build failure
by Pavel Belski 30 Jan '11

30 Jan '11

I'm trying to build some libraries from Boost using bjam, as it is suggested here(http://www.boost.org/doc/libs/1_45_0/doc/html/boost_asio/using.html). Because i have more than one compiler installed, I've changed the command line a bit to chose the toolset(mingw that comes together with Qt SDK) explicitly: D:\boost_1_45_0>bjam toolset=gcc --with-system --with-thread --with-datetime --with-regex --with-serialization stage Immediately i get the error message: mingw.jam: No such file or directory D:/boost_1_45_0/tools/build/v2/build\toolset.jam:38: in toolset.using rule mingw.init unknown in module toolset. D:/boost_1_45_0/tools/build/v2/build\project.jam:881: in using project-config.jam:1: in modules.load D:/boost_1_45_0/tools/build/v2\build-system.jam:257: in load-config D:/boost_1_45_0/tools/build/v2\build-system.jam:423: in load-configuration-files D:/boost_1_45_0/tools/build/v2\build-system.jam:554: in load D:\boost_1_45_0\tools\build\v2/kernel\modules.jam:283: in import D:\boost_1_45_0\tools\build\v2\kernel\bootstrap.jam:142: in boost-build D:\boost_1_45_0\boost-build.jam:17: in module scope what should i do?

2 1

Google summer of Code 2011 - would a collection of checksums, checkdigits be a useful project?
by Paul A. Bristow 30 Jan '11

30 Jan '11

I have posted some tentative ideas for a GSoC project to create a collection of functions to create and validate check digits at https://svn.boost.org/trac/boost/wiki/SoC2011 Previous discussions suggested that many people might find these useful. Some possible existing systems in wide user are : Simple modulo 256 etc check values and digits. http://en.wikipedia.org/wiki/Cyclic_redundancy_check http://www.boost.org/doc/libs/1_45_0/libs/crc/crc.html Boost's Cyclic redundancy checks codes http://www.boost.org/doc/libs/1_45_0/libs/crc/index.html http://www.netrino.com/Embedded-Systems/How-To/CRC-Calculation-C-Code crc_16_type BISYNCH, ARC crc_ccitt_type designated by CCITT (Comité Consultatif International Télégraphique et Téléphonique) crc_xmodem_type XMODEM crc_32_type PKZip, AUTODIN II, Ethernet, FDDI MD5 hash http://www.md5.net/ SHA hashes http://en.wikipedia.org/wiki/SHA-1 ... Luhn algorithm http://en.wikipedia.org/wiki/Luhn_algorithm Verhoeff algorithm http://en.wikipedia.org/wiki/Verhoeff_algorithm (These two are used by many of the others below). European Article numbering EAN Symbol Specification Manual, Universal Product Code, Uniform Code Council, Dayton, Ohio, USA. Version of check used by Mastercard, VISA, and most other credit card companies. http://www.beachnet.com/~hstiles/cardtype.html Generalised to arbitrary radix version allowing any characters (not just digits). Gene Callahan, Dr Dobb's Journal, Dec 1995, 131, 132 & 149. Generating Sequential keys in an Arbitrary Radix. IBAN International Banking format http://en.wikipedia.org/wiki/International_Bank_Account_Number http://en.wikipedia.org/wiki/Machine-readable_passport check digit US driving licence US Social security numbers Canadian Social Insurance Numbers UK National Insurance number ISBN http://en.wikipedia.org/wiki/International_Standard_Book_Number ISSN http://en.wikipedia.org/wiki/International_Standard_Serial_Number POSTNET http://en.wikipedia.org/wiki/POSTNET Bar codes http://www.dlsoft.com/services/CheckCalc/ http://en.wikipedia.org/wiki/Check_digit#Other_examples_of_check_digits Chemical abstracts http://en.wikipedia.org/wiki/CAS_registry_number Vehicle Id Number http://en.wikipedia.org/wiki/Vehicle_identification_number And there are no doubt many, many more. Suggestions? A question that Boost users/ developers/gurus might to comment on is the format these should take. Should it something naïve like bool ISBNcheck(string); // return true if is a full valid ISBN with correct decimal digit or X check digit. char ISBNcompute(string); // return the decimal digit or X check digit of the ISBN number passed. and similarly for the other check systems. or do we need something more complicated? String or Arrays of (unsigned?) bytes or? (Most of these examples *are* short strings). What return type? Efficiency is not like to be an issue for many of these? (Boost.crc handles this in a much more generic and complex package but handles some popular types. Some of its examples could be packaged simply as above.) Views? Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 0

[CfP] Reminder: 5th Annual BoostCon, Aspen (CO, USA), May 15-20, 2011
by Hartmut Kaiser 30 Jan '11

30 Jan '11

Please note the extended deadline: February 10th, 2011 ------------------ Please distribute. ------------------ 5TH ANNUAL BOOST CONFERENCE 2011 Aspen CO, USA, May 15 - 20, 2011, www.boostcon.com CALL FOR PARTICIPATION We invite you to submit session proposals to the 5th Annual Boost Conference: BoostCon 2011 (Aspen CO, USA, May 15 - 20, 2011). Traditionally the main face-to-face event for all things Boost (www.boost.org) BoostCon 2011 will present leading speakers from the whole C++ community. From using the Boost libraries to writing and maintaining them, from evangelizing to deploying Boost within your organization, from infrastructure and process to vision and mission, and the new C++ Standard, BoostCon brings together the sessions, the colleagues, and the inspiration to support your work with C++ and Boost in particular for the next year. To reflect the breadth of the Boost community, the conference includes sessions aimed at three constituencies: Boost end-users, hard-core Boost library and tool developers, and academics focusing on research. The program fosters interaction and engagement within and across those groups, with an emphasis on hands-on, participatory sessions. SESSION TOPICS Topics of interest include, but are not restricted to, the following: * General tutorial sessions introducing one or more Boost libraries * In-depth sessions on using specific Boost libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * C++0x and how it changes life for users and library writers * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Software development tools and their application to C++ and or Boost * Other topics likely to be of great interest to Boost users and developers Interactive and collaborative sessions are encouraged, as this is the nature of both the on-line Boost community and the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. SESSION FORMATS Presentations ------------- Presentations focus on a practitioner's ideas and experience with anything relevant to Boost and Boost users. Panels ------------- Panels feature three or four people presenting their ideas and experiences relating to Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials ------------- Tutorials are sessions at which instructors teach conference participants specific Boost-relevant skills. Workshops ------------- Workshops provide an active arena for advancements in Boost-relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations ------------- These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems in Boost libraries. Tool Vendors Presentations ------------- We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. SUBMITTING A PROPOSAL Standard Sessions are 90 minutes. You may submit a proposal for fractions or multiples of 90-minutes. Fractional proposals will be grouped into 90 minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned 90 minute, three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other. * A paragraph or two describing the topic covered, suitable for the conference web site. * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half day, full day. * Alternate lengths, if you are willing to make adjustments: 10-20 minute short-talks, 45 minutes, 90 minutes, half-day, full day. * Audience: users, developers, both. * Level: basic, intermediate, advanced. * A biography, suitable for the conference web site. * Your contact information (will not be made public). SUBMISSION DETAILS All submissions have to be done through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=boostcon2011. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited (but are not required) to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates) The full papers are not required unless you want them published in the proceedings. All accepted proposals will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the BoostCon website and will be available to attendees. For general information on the BoostCon 2011 paper submission or the scope of technical papers solicited, please refer to the conference website at www.boostcon.com. For any other questions about the submission process or paper format, please contact the Program Committee at boostcon2011(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to BoostCon. IMPORTANT DATES New proposal submissions due: January 10th, 2011. Proposals decisions sent (tentative program): February 17th, 2011. Fully scheduled program available: February 25th, 2011. Session materials due: April 15th, 2011. Hartmut Kaiser: hartmut.kaiser(a)gmail.com (Program Committee Chair) David Abrahams: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

Boost regex library problem on Mac
by Michael Muratet 30 Jan '11

30 Jan '11

Greetings I am using some simple boost regex code: const boost::regex eparse("^([[:digit:]]+).*"); (in a header file) boost::cmatch matches; (in a cpp file) from the subroutine if (boost::regex_match(edit.c_str(), matches, eparse)) { // matches[0] contains the original string. matches[n] // contains a sub_match object for each matching // subexpression for (int i = 1; i < matches.size(); i++) { // sub_match::first and sub_match::second are iterators that // refer to the first and one past the last chars of the // matching subexpression std::string match(matches[i].first, matches[i].second); std::cout << "\tmatches[" << i << "] = " << match << std::endl; } } with a makefile: CXXFLAGS = -O2 -g -Wall -fmessage-length=0 -I/usr/local/boost_1_39_0 OBJS = CrossMapper.o CrossMap.o Read.o Target.o LIBS = -L/lib -lboost_regex-xgcc40-mt-1_39 INCLUDE= /usr/local/boost_1_39_0 TARGET = CrossMapper $(TARGET): $(OBJS) $(CXX) -o $(TARGET) $(OBJS) $(LIBS) all: $(TARGET) clean: rm -f $(OBJS) $(TARGET) It links but will not load: Macintosh-8:~/Documents/workspace/CrossMapper mmuratet$ ./CrossMapper dyld: Library not loaded: libboost_regex-xgcc40-mt-1_39.dylib Referenced from: /Users/mmuratet/Documents/workspace/CrossMapper/./ CrossMapper Reason: image not found Trace/BPT trap Macintosh-8:~/Documents/workspace/CrossMapper mmuratet$ I've been chasing this for several hours and can't get anywhere. Can anyone offer any suggestions? Thanks Mike

2 2

Problems compiling those libraries that are not header only on 64 bit Windows 7
by Ted Byers 29 Jan '11

29 Jan '11

I tried asking this yesterday, but received a message saying I had to subscribe to this list first. I don't understand that reply as I had already subscribed half an hour before I asked the question, and I have been receiving email from the list ever since. So, I am going to try again (with the query updated to reflect my latest attempts). ============================================================================ ==================== I am working on Windows 7 Pro, 64 bit. I have two versions of MS VS: MS VS 2005 and MS VS 2010. I guess my first question is, "Will library files produced by MS VS 2005 work with MS VS 2010?" I know that library files compiled by compilers from different sources (gcc vs MSVC) won't work with each other (unless the library was written in C or FORTRAN), but does the same apply to different versions fo the same compiler? I have a long practice of passing my code through different compilers when part of the requirement is to produce portable code, since different compiler producers will have different strengths and weaknesses; different understandings of applicable standards. But a limited budget means I have to coerce them to live on the same hardware. I used a prebuilt distribution of bjam for all my attempts to build the boost libraries using msvc++. I did not compile it myself. I also have Cygwin installed. >From the C:\boost_1_45_0 directory, I tried the following to keep the builds for the two versions separate (planning on changing the library directories based on the build environment), but when both finished, both C:\boost_1_45_0\lib\msvc2010\x64 and bjam --build-dir=C:\boost_1_45_0\lib\msvc2010\x32 were empty and C:\boost_1_45_0\stage\lib had 606 items. bjam --build-dir=C:\boost_1_45_0\lib\msvc2010\x32 --build-type=complete bjam --build-dir=C:\boost_1_45_0\lib\msvc2010\x64 --build-type=complete And if I execute bjam in status, I get a result that says something like 30 out of 30K tests failed. (Is that normal?) So, what do I do when trying to support both MSVC++ 2005 and MSVC++ 2010? Here are the results from my latest attempt using cygwin. $ ../boost-jam-3.1.18/bin.cygwinx86/bjam --layout=versioned --build-type=complete warning: No toolsets are configured. warning: Configuring default toolset "gcc". warning: If the default is wrong, your build may not work correctly. warning: Use the "toolset=xxxxx" option to override our guess. warning: For more configuration options, please consult warning: http://boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html Building the Boost C++ Libraries. /home/Ted/boost_1_45_0/tools/build/v2/build/configure.jam:145: in builds-raw *** argument error * rule UPDATE_NOW ( targets * : log ? : ignore-minus-n ? ) * called with: ( <pbin.v2/libs/regex/build/gcc-4.3.4/debug>has_icu.exe : : ignore-minus-n : ignore-minus-q ) * extra argument ignore-minus-q (builtin):see definition of rule 'UPDATE_NOW' being called /home/Ted/boost_1_45_0/tools/build/v2/build/configure.jam:179: in configure.builds /home/Ted/boost_1_45_0/tools/build/v2/build/configure.jam:216: in object(check-target-builds-worker)(a)394.check /home/Ted/boost_1_45_0/tools/build/v2/kernel/modules.jam:103: in modules.call-in /home/Ted/boost_1_45_0/tools/build/v2/util/indirect.jam:96: in indirect.call /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1012: in targets.evaluate-requirements /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1393: in basic-target.compute-usage-requirements /home/Ted/boost_1_45_0/tools/build/v2/build/alias.jam:47: in compute-usage-requirements /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1319: in object(alias-target-class)(a)398.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)836.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1268: in object(typed-target)(a)401.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)837.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1266: in object(typed-target)(a)147.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)818.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:258: in object(project-target)(a)129.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1268: in object(install-target-class)(a)63.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)629.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1268: in alias-target-class.generate Jamroot:648: in build-multiple Jamroot:634: in object(top-level-target)(a)72.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)633.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1217: in generate-dependencies /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:1268: in alias-target-class.generate Jamroot:648: in build-multiple Jamroot:634: in object(top-level-target)(a)73.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:732: in generate-really /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:704: in object(main-target)(a)634.generate /home/Ted/boost_1_45_0/tools/build/v2/build/targets.jam:258: in object(project-target)(a)16.generate /home/Ted/boost_1_45_0/tools/build/v2/build-system.jam:735: in load /home/Ted/boost_1_45_0/tools/build/v2/kernel/modules.jam:283: in import /home/Ted/boost_1_45_0/tools/build/v2/kernel/bootstrap.jam:142: in boost-build /home/Ted/boost_1_45_0/boost-build.jam:17: in module scope And nothing was built. So, what do I have to do to pursuade bjam to produce all of the library files in cygwin? Thanks Ted

5 9

[network] Bagged, Tagged, New Release 0.8.1
by Dean Michael Berris 29 Jan '11

29 Jan '11

Hi Everyone, Just a quick note, there's an update to the 0.8 line which addresses issues that have been identified with the previous 0.8 release. It's recommended that people using the 0.8 release upgrade to 0.8.1. This release is still a header-only release, with some features back-ported from the 0.9-devel branch. You can get the 0.8.1 release at https://github.com/cpp-netlib/cpp-netlib/downloads Have a good day everyone and I hope this helps. PS. The 0.9 release should come out soon, final documentation updates are just getting done; the 0.9 line will be the version that shall be submitted for review, looking for interested review managers at this time. -- Dean Michael Berris about.me/deanberris

1 0

boost recursive_mutex destructor call in child (forked) process
by Prince Singh 29 Jan '11

29 Jan '11

I am facing a problem in using boost::recursive_mutex. Flow of my program is:- 1. Get a boost::recursive_mutex lock 2. Fork the process 3. In parent sleep for few seconds and then unlock boost::recursive_mutex. 4. In child call exit(0) What is happening is that child process is calling the destructor of boost::recursive_mutex and core is dumped. I want that child process should not inherit the boost mutex lock of parent. Please tell me how to do it. Please find attached the core, binary file and the source files. *Stack of core dumped* Thread 1 (Thread 32305): #0 0x0000003bb9c30265 in raise () from /lib64/libc.so.6 #1 0x0000003bb9c31d10 in abort () from /lib64/libc.so.6 #2 0x0000003bb9c296e6 in __assert_fail () from /lib64/libc.so.6 #3 0x0000000000401224 in boost::recursive_mutex::~recursive_mutex(this=0x602c40, __in_chrg=<value optimized out>) at /installs/boost/boost_1_39_0/include/boost-1_39/boost/ thread/pthread/recursive_mutex.hpp:62 #4 0x0000000000400f08 in __tcf_1 () at ../BoostTestClass.cpp:10 #5 0x0000003bb9c333a5 in exit () from /lib64/libc.so.6 #6 0x0000000000400f69 in main () at ../BoostTestClass.cpp:29 -- Thanks and Regards Prashant Gour Software Engineer Drishti-Soft Solutions Pvt. Ltd.

2 1

large variant performance compared (50 elements)
by Paul 29 Jan '11

29 Jan '11

In a project we are using variants holding shared_ptr's. These variants are typically 20 items large but are growing as the project progresses. Now it seems that each time we add elements, we fall into issue's regarding excessive compilation time, huge pdb file or out of heap space errors on the compiler or linker. I took some time to compare various approaches using variants, here are the results: stdafx.h #include <boost/mpl/vector.hpp> #include <boost/mpl/vector/vector100.hpp> #include <boost/variant/variant.hpp> #include <boost/variant/apply_visitor.hpp> #include <boost/variant/static_visitor.hpp> test.h class CTest { public: void foo(const Cs_t& rt); }; type.h class C1 { public: int i; }; class C2 { public: int i; }; class C3 { public: int i; }; ... class C50 { public: int i; }; //v1 typedef boost::variant< boost::shared_ptr<C1>, boost::shared_ptr<C2>, <...> boost::shared_ptr<C49>, boost::shared_ptr<C50> > v_t; //v2 typedef boost::mpl::vector50< boost::shared_ptr<C1>, boost::shared_ptr<C2>, <...> boost::shared_ptr<C49>, boost::shared_ptr<C50> > Mplv_t; typedef boost::make_variant_over<Mplv_t>::type v_t; //v3 typedef boost::variant< C1, C2, <...> C49, C50 > v_t; test.cpp namespace { class CVisit : public boost::static_visitor<> { public: template<typename T> void operator()(const T& rt) const { std::cout << typeid(T).name() << std::endl; } }; } void CTest::foo(const v_t& v) { //A: (invoke visitor directly, no new variant) boost::apply_visitor(CVisit(), v); //B: Copy variant using copy constructor v_t v2(v); <...> //C: Copy variant using assignment operator v_t v2; v2 = v; <...> } main.cpp int main(int argc, char* argv[]) { CTest t; v_t v = boost::shared_ptr<C10>(new C10); t.foo(v); return 0; } Setup: Boost 1.38 Msvc2005, Release target Optimize MaxSpeed (/O2) Debug info enabled (/Zi) Build time = rebuild solution; cl + link Variant type: v1 Foo logic:A Obj size: 2.4MB Exe size: 348KB Pdb size: 9.0MB Build time: 0:49 Peak commit: 500MB Variant type: v2 Foo logic:A Obj size: 1.4MB Exe size: 348KB Pdb size: 11.7MB Build time: 1:02 Peak commit: 600MB Variant type: v3 Foo logic:A Obj size: 1.9MB Exe size: 344KB Pdb size: 3.9MB Build time: 0:25 Peak commit: 300MB Variant type: v1 Foo logic:B (copy variant using copy constructor) Obj size: 3.1MB Exe size: 352KB Pdb size: 9.0MB Build time: 0:50 Peak commit: 500MB Variant type: v2 Foo logic:B Obj size: 2.2MB Exe size: 352KB Pdb size: 11.7MB Build time: 1:03 Peak commit: 600MB Variant type: v3 Foo logic:B Obj size: 2.1MB Exe size: 344KB Pdb size: 3.9MB Build time: 0:26 Peak commit: 300MB Variant type: v1 Foo logic:C (copy variant using assignment operator) Obj size: 71.3MB Exe size: 356KB Pdb size: 10.7MB Build time: 5:18 Peak commit: 1.2GB Variant type: v2 Foo logic:C Obj size: 80.6MB Exe size: 356KB Pdb size: 13.6MB Build time: 8:46 Peak commit: 1.4GB Variant type: v3 Foo logic:C Obj size: 2.4MB Exe size: 344KB Pdb size: 3.9MB Build time: 0:26 Peak commit: 300MB Is there any way to explain these (huge) differences and what is preffered? - Why does the use of assignment operator have such a hugh impact? - Why the difference between using shared_ptr or not? - When to use the numbered variant or boost::variant<...>? Help is greatly appreciated! Paul

9 67

lexical_cast<> in 1.39 does not provide basic_stringstream to operator>>
by Max Motovilov 29 Jan '11

29 Jan '11

Just ran into a regression in old code that last worked [probably] with 1.32 -- I have a number of ADTs which use tellg()/seekg() in their implementations of operator>>. This used to work fine with lexical_cast and now it breaks because the [optimized?] version in 1.39 uses a statically allocated buffer and plain Jane basic_streambuf which does not implement seekpos() and seekoff(). According to http://www.boost.org/doc/libs/1_45_0/libs/conversion/lexical_cast.htm#n1973, operator>> called from a lexical_cast should have at least basic_stringbuf to work with. Now, this project is locked into 1.39 for administrative reasons and I will have to work around the issue anyway. Still, I'm curious whether this is a problem that has been fixed since 1.39, a previously unnoticed bug or a by-design behavior that I am misinterpreting as a violation of spec... Thanks in advance, ...Max...

2 2

[serialization] plugin dll: What project settings are really needed?
by Georg Gast 28 Jan '11

28 Jan '11

Hi! Currently i'm trying to understand serialization via base pointer in a dll. My environment: - Windows XP SP3 - MS Visual Studio 2010 Prof (German) - Boost: 1.45.0 To try that i created 2 projects in one solution: test.exe (like test_dll_plugin) and test_plugin.dll (like dll_polymorphic_derivied2). Copied these files from boost/libs/serialization/(test|examples). Files in test.exe project (console app): - polymorphic_base.hpp - test_tools.hpp - text_archives.hpp Files in test_plugin.dll (standard win32 dll): - polymorphic_base.hpp - test_dll_plugin.cpp - polymorphic_derived2.cpp shared files: - test_decl.hpp - polymorphic_base.hpp Then i tried to copy the project settings to know the exact required settings: test.exe: --------- Preprozessor: WIN32;(_DEBUG|NDEBUG);_CONSOLE;BOOST_LIB_DIAGNOSTIC=1;BOOST_ALL_DYN_LINK=1 C++: Checking of small types: Yes /RTCc Funktionlevel-Linking aktiv: No /Gy- Run time type info: yes / GR systeminternal functions active: yes /Oi Runtime Library: Multithreaded(-Debug)-DLL (/MD|/MDd) test.dll: --------- Preprozessor: WIN32;(_DEBUG|NDEBUG);BOOST_ALL_DYN_LINK=1;BOOST_LIB_DIAGNOSTIC=1;_WINDOWS;_USRDLL;PLUGINDLL_EXPORTS C++: minimal recompilation: No /Gm- complete runtimechecking (Vollständige Laufzeitüberprüfung): Standard Run time type info: yes / GR Runtime Library: Multithreaded(-Debug)-DLL (/MD|/MDd) Now my questions: First Question: Are the above mentioned project settings for the exe and the dll really right and complete? Or is something not needed or missing? Second question: In my real project the dll should be able to provide derivied class dependant MFC Objects (Views/Dialogs) which are then shown in the exe. So: Is that (serialization through basepointer in dll) possible with a MFC extension library or do i need to create a MFC gui dll and a "polymorphic_derived2.dll"? Hope that is understandable ;) Best Regards Georg Gast

3 6