April 2012 - 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

Identify cycles in a undirected graph
by NsPx 20 Aug '13

20 Aug '13

Hi all, I use undirected_dfs to detect all cycles in a undirected graph. I detect a cycle with DFSVisitor.back_edge(e,g) but how can I get the list of vertices defining this cycle ? Thanks by advance

4 4

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

Asio and ZeroMQ
by Matthias Vallentin 11 Oct '12

11 Oct '12

A while ago, Maciej Gajewski started an effort to use Asio to observe a ZeroMQ socket [1]. Based on his code, I put together a thin library that wraps the implementation details. Since other have requested a working example, here it is now at github: https://github.com/mavam/bmq Any feedback is highly appreciated. A basic usage example looks like this: #include <boost/asio/io_service.hpp> #include <bmq.h> int main() { boost::asio::io_service io; bmq::context ctx(1); bmq::component c(ctx, io); auto sink = c.add_sink(ZMQ_PAIR, "inproc://x"); c.subscribe(sink, [](bmq::message&& msg) { std::string str(static_cast<char*>(msg.data()), msg.size()); std::cout << str << std::endl; }); auto source = c.add_source(ZMQ_PAIR, "inproc://x"); bmq::message msg(const_cast<char*>("foo"), 3, nullptr); source->send(msg); // Execute message handler. io.poll(); return 0; } At this point, the library is really thin and only provides very rudimentary wrapping of ZeroMQ. In the future, I plan to extend it in order to facilitate applications that build on message-passing. The dataflow abstraction I envision is essentially a directed graph, where nodes represent components and edges communication links. 0mq provides the edges and the Asio handles asynchronous event processing at the component level. The motiviation is that this model lends itself well for scaling out distributed systems over large clusters. Matthias [1] http://permalink.gmane.org/gmane.network.zeromq.devel/9538

4 4

[Sandbox - endian] Why is endian still in sandbox?
by Nathaniel J Fries 07 Oct '12

07 Oct '12

A fairly novel (at least when put up against more intricate labours like asio, filesystem, and their like) project which appears to be finished and would be a very useful companion to existing libraries sits in the sandbox. Is there a reason for this?

3 3

[Range] insert algorithm fails if target is a map
by Robert Jones 11 Sep '12

11 Sep '12

The title says it all really. The failure occurs because the insert algorithm expects the container to provide a 3-arg insert of the form container.insert( position, begin, end ); whereas map's, multimap's and set's insert method only takes two arguments... map.insert( begin, end ); Is this limitation by design? It would be easy to provide specialisations for maps, mmaps and sets, but that would not be a completely general solution. - Rob.

3 3

filesystem directory_iterator run-time error during construction after upgrading to OSX Lion
by Martin Searancke 04 Sep '12

04 Sep '12

I have just upgraded my Mac to Lion and code that worked fine under snow leopard is giving me a run-time exception when constructing a directory_iterator. The error I am getting is "malloc: pointer being freed was not allocated" The line in question that raises this error is: for ( directory_iterator itr( my_path ); itr != end_itr; ++itr ) taken directly from the example and working fine under windows. This is version 1.49 installed with MacPorts. Is this a known problem? I found some vague references to a similar problem in an earlier version of boost but no solution. I have confirmed that I only have 1 copy of the headers and libs on the system and in the correct path. The date stamp on the files matches the last time I did a macports update so this should be the matching library for the header. Please note that I am a real novice to Mac development and have only just started porting code from windows for less than a month. Thanks in advance, Martin

3 2

[Graph] compilation error under Windows but not under Linux
by Gaël de Chalendar 29 Aug '12

29 Aug '12

Hello, I have a compilation error under Windows (Visual C++ 2008) with a code that works well under Linux (gcc 4.6.1 and before). The compilation error is: =========== /FsaAccess16.tcc(833) : error C2784: 'std::pair<graph_traits<G>::in_edge_iterator,graph_traits<G>::in_edge_iterator> boost::in_edges(graph_traits<G>::vertex_descriptor,const boost::subgraph<Graph> &)'ÿ: impossible de d‚duire l'argument modŠle pour 'const boost::subgraph<Graph> &' … partir de 'FrCeaLic2m::Common::FsaAccess::selected_graph_types16::spareGraphType' C:\PROGRA~1\boost\BOOST_~1\boost/graph/subgraph.hpp(432)ÿ: voir la d‚claration de 'boost::in_edges' Z: \Projets\MoteurMultimedia\mm_common\src\common/FsaAccess/FsaAccess16.tcc(778)ÿ: lors de la compilation de la fonction membre '<Inconnu>' de la classe <Inconnu> z: \projets\moteurmultimedia\mm_common\src\common\fsaaccess\FsaAccessReader16.h(118)ÿ: voir la r‚f‚rence … l'instanciation de la classe modŠle 'FrCeaLic2m::Common::FsaAccess::FsaAccess16<graphType>' en cours de compilation with [ graphType=FrCeaLic2m::Common::FsaAccess::selected_graph_types16::spareGraphType ] z: \projets\moteurmultimedia\mm_common\src\common\fsaaccess\FsaAccessSpare16.h(35)ÿ: voir la r‚f‚rence … l'instanciation de la classe modŠle 'FrCeaLic2m::Common::FsaAccess::FsaAccessReader16<graphType>' en cours de compilation with [ graphType=FrCeaLic2m::Common::FsaAccess::selected_graph_types16::spareGraphType ] =========== The line that does not compile is boost::tie(iei,ie_end) = boost::in_edges(commonTarget,m_graph); The function being compiled is declared like that: template <typename graphType > std::pair< const typename boost::graph_traits<graphType>::vertex_descriptor, bool > FsaAccess16<graphType>::findEquivalentInRegister( dicoVertexType tempState ){ ... And here graphType, the type of m_graph is spareGraphType defined by: struct selected_graph_types16 { ... typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, dicoVertexCountProperty> spareGraphType; ... This is a cmake based project that I compile using qtcreator. I'm a Linux developer and I'm a little bit lost with VC outputs and tools under Windows... Regards, Gaêl -- Gael de Chalendar CEA LIST Centre de Fontenay-aux-Roses Laboratoire Vision et Ingénierie des Contenus (Vision and Content Engineering Laboratory) Bat. 38-2 ; 18, rue du Panorama ; BP 6 92265 Fontenay aux Roses Cedex ; France Tél.:01.46.54.80.18 ; Fax.:01.46.54.75.80 Email : Gael.D.O.T.de-Chalendar.A(a)T.cea.D.O.T.fr

2 2

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

25 Aug '12

2 1

[vector, PropertyGraph] Problem declaring a class member of the "vector<int>" type
by Alex Sadovsky 13 Jun '12

13 Jun '12

Hello everyone, > >I am trying to declare, in a header file, a class that has a member of type "vector<double>" (the code is included below). The compiler complains that I haven't included the appropriate namespace (the error message reads, "ISO C++ forbids declaration of ‘vector’ with no type"), and I understand that it is looking for this: > >using namespace boost::numeric::ublas; > >However, I tried putting it in the header file in various places (haven't programmed in C++ in 10 years and couldn't find any online documentation to clarify this specific situation), and still no luck. I am definitely doing something wrong, but cannot reason out the error, as it probably has to do with the specific syntax conventions. Any help is appreciated! > >Thanks, >-Al > >P.S. Code in header file: > >////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// >// File "airspace-graph-rectilinear-edges.h" >typedef char* string; >const int PHYSICAL_SPACE_DIMENSION = 2; >// Information needed about a waypoint used in an airspace: name and physical position >class WaypointConcept{ > private: > using namespace boost::numeric::ublas; > string waypoint_name; > vector<double> waypoint_position_xyh(PHYSICAL_SPACE_DIMENSION); > public: > string GetWaypointName(); > vector<double> GetWaypointPosition(); >} > >class AirspaceGraphConcept PropertyGraphConcept<class Graph, class WaypointConcept, class vertex_index_t>; >typedef Vertex* GraphPathType; >typedef string FlightIDType; >typedef boost::unordered_map<std::FlightIDType, GraphPathType> FlightIDToPathAssignmentType; >////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// > >Code in the .cpp file (which includes the above header file) I am trying to compile: >////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// >#include <boost/lambda/lambda.hpp> >#include <iostream> >#include <iterator> >#include <algorithm> >#include <boost/numeric/ublas/io.hpp> >#include <boost/numeric/ublas/vector.hpp> >#include "airspace-graph-rectilinear-edges.h" > >int main() >{ > using namespace boost::numeric::ublas; > > vector<double> v(3); > for (unsigned i = 0; i < v.size(); ++ i) > v (i) = 2.01*double(i); > > std::cout << v << std::endl; >} >////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// > > > > > > > > > > > > > > > >

3 7

[property_tree] number of sections in an inifile
by Sean Farrow 13 Jun '12

13 Jun '12

Hi: If I have defined: boost::property_tree::ptree IniTree; What is the correct way to determine how many sections there are in an ini file. Should I use count, max_size, m_children or size? Any help appreciated. Cheers Sean.

3 2

accumulator operations
by Olaf Peter 04 Jun '12

04 Jun '12

Hi, I like to collects some stats. There are several data slices where I can partially/separated collect them (each of them). Finaly I like to combine these stats to a single one to get summarized informations. How to? May this work: accumulator_set<..> acc1; accumulator_set<..> acc2; ... accumulator_set<..> acc_all; ... acc1(42); ... acc_all += acc1; ... acc_all += acc2; Because did not found informations about. The same problem woulde be probably for a threaded implementation too. Thanks, Olaf

4 4

[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

offlist - Re: [iterator] Problems with iterator_facade and const-qualification
by Neil Groves 24 May '12

24 May '12

On Sat, May 7, 2011 at 5:52 PM, Dave Abrahams <dave(a)boostpro.com> wrote: > On Fri, May 6, 2011 at 1:51 PM, Evan Driscoll <driscoll(a)cs.wisc.edu> > wrote: > > On 05/06/2011 11:59 AM, Jeff Flinn wrote: > >> > >> You might google any_iterator, and see how other authors have addressed > >> similar problems. > > > > Great! I tried to find someone who had done something similar, figuring I > > couldn't have been the first, but all the search terms I tried were too > > generic. > > > > Thanks, > > Evan > > You can find one in the ASL that's built on iterator_facade. > http://stlab.adobe.com/classadobe_1_1any__iterator.html > > The underlying Boost.Range implementation implements an any_iterator that I believe to be similar to the one in ASL in terms of functionality. I believe that the small-buffer optimization implementation is superior to forcing the definition of a closed-set of possible type as suggested in a TODO within the ASL documentation. During my performance testing I had considerably superior performance than the ASL implementation. I wondered if you disliked my implementation, or had any feedback. Additionally I wondered what you thought about moving the Boost.Range internal any_iterator implementation into Boost.Iterator. I can't honestly imagine a good use-case for using any_iterator in preference to any_range, hence I haven't suggested this previously. This could easily be due to my lack of imagination! Can you think of a time when using an any_iterator on any interface would be superior to using an any_range? Your opinions and guidance would be much appreciated. HTH, > > -- > Dave Abrahams > BoostPro Computing > http://www.boostpro.com Regards, Neil Groves

4 5

Compiler warns about 'reference to temporary' with iterator on shared memory map
by Rajalakshmi Iyer 21 May '12

21 May '12

Hello, Consider: typedef std::pair<int, int> value_type; typedef allocator<value_type, managed_shared_memory::segment_manager> ValueAllocator; typedef boost::interprocess::map<int, int, std::less<int>, ValueAllocator> A_map; class A { public: A() { /* Construct shared memory map */ } ~A() bool contains(int i); private: A_map* m_objA; }; inline bool A::contains(int i) { A_map::iterator itr = m_objA->find(i); return (itr != m_objA->end()); } Here, at the line A_map::iterator itr = m_objA->find(i); I see this warning: .../boost_1_49_0/include/boost/container/detail/tree.hpp:391:31: warning: returning reference to temporary [enabled by default] I dont see a reason for this. Can someone please point out if I am doing something wrong here? Thanks in advance, Regards, Raj -- Twitter: @Blismobile <http://twitter.com/#!/blismobile> BlisMobile Media 32 Percy Street, London W1T 2DE www.blismobile.com [image: BlisMobile] <http://www.blismobile.com/>[image: Follow on Twitter]<http://twitter.com/#!/blismobile>[image: Blis Website] <http://www.blismobile.com/> This communication is from BlisMobile Media, which is a trading name of Breeze Tech (UK) Ltd, a company registered in England and Wales with registered number 06455773. Its registered office is 32 Percy Street, London W1T 2DE, United Kingdom. This communication contains information that is confidential and may also be privileged. It is for the exclusive use of the intended recipient(s). If you are not the intended recipient(s), please (1) notify info(a)blismobile.com by forwarding this email and delete all copies from your system and (2) note that disclosure, distribution, copying or use of this communication is strictly prohibited. Email communications cannot be guaranteed to be secure or free from error or viruses. All emails sent to or from a Blismobile email account are securely archived and stored by an external supplier. This email does not constitute a contractual agreement; such agreements are in specified contractual or Insertion Order (IO) form only and exclusively contain all the terms to which Breeze Tech )UK) Ltd will be bound. To the extent permitted by law, Breeze Tech (UK) Ltd does not accept any liability for use of or reliance on the contents of this email by any person save by the intended recipient(s) to the extent agreed in a contract or Insertion Order. Opinions, conclusions and other information in this email which have not been delivered by way of the business of Breeze Tech (UK) Ltd are neither given nor endorsed by it.

3 6

[MSM] What's the easiest way to share data between states in a Boost.MSM state machine?
by B. Tommy Jensen 08 May '12

08 May '12

As the subject indicates, I'm trying to find the best way to share data between states in a MSM state machine. My first attempt has been to let each sub-machine and state inherit from a common base class, e.g.: struct MyStateMachine_ : public msm::front::state_machine_def<MyStateMachine_,CommonBaseClass> My idea is to add a reference to some shared data in the base class, making it easy to access the shared data from any state. The shared data reference must be passed to the base class. Questions: 1. Is it possible to pass constructor parameters to the common base class' constructor? I have tried different options without success, it seems that the default constructor with no arguments is the only option. 2. If 1. is not possible, what is the best way to initialize the shared property correctly? For example an easy method to iterate over all defined states? (not only the active ones). I have tried to iterate over all states with get_state_by_id, but this method does not enter sub-machines' states. 3. In general, what is the preferred way of implementing shared data between state classes in Boost.MSM? It would have been natural to store the data in the root state, but I can't see that there is an easy way to get access to the root FSM. (only the "nearest parent" FSM in the hierarchy is passed to the various event handler methods). Regards, Tommy

2 4

fatal error C1001 with VS2010, boost 1.49, and shared_ptr.hpp
by Phillip Hellewell 01 May '12

01 May '12

I'm upgrading to boost 1.49 and getting this fatal error while compiling a source file that uses shared_ptr: 1>C:\mycomps\base\target\dependency\include\boost/smart_ptr/shared_ptr.hpp(362): fatal error C1001: An internal error has occurred in the compiler. 1> (compiler file 'msc1.cpp', line 1420) 1> To work around this problem, try simplifying or changing the program near the locations listed above. 1> Please choose the Technical Support command on the Visual C++ 1> Help menu, or open the Technical Support help file for more information Line 362 of shared_ptr.hpp is: shared_ptr( shared_ptr<Y> && r, typename boost::detail::sp_enable_if_convertible<Y,T>::type = boost::detail::sp_empty() ) Looks like the compiler is crashing with an access violation; any suggestions other than wait for a patch from Microsoft? I don't want to have to disable features like BOOST_HAS_RVALUE_REFS or BOOST_SP_NO_SP_CONVERTIBLE, but that may be my only choice :( Thanks, Phillip

2 3

async_read_some
by Christer Borgqvist 01 May '12

01 May '12

Hi, Im playing around with the /boost_asio/example/http/server3 and using POST method. The bytes_transferred is 231, but thats only the header and ends with \r\n\r\n, need to read the rest. Sometimes i get bytes_transferred to 1032, the right amount of data, sometimes i get bytes_transferred = 231, but if i print the buffer_ i have all the 1032 bytes. Is it right that the bytes in the buffer_ and the bytes_transferred is not the same? appreciate any help. /christer void connection::handle_read(const boost::system::error_code& e, std::size_t bytes_transferred) { if (!e) { boost::tribool result; boost::tie(result, boost::tuples::ignore) = request_parser_.parse( request_, buffer_.data(), buffer_.data() + bytes_transferred); if (result) { request_handler_.handle_request(request_, reply_); boost::asio::async_write(socket_, reply_.to_buffers(), strand_.wrap( boost::bind(&connection::handle_write, shared_from_this(), boost::asio::placeholders::error))); } else if (!result) { reply_ = reply::stock_reply(reply::bad_request); boost::asio::async_write(socket_, reply_.to_buffers(), strand_.wrap( boost::bind(&connection::handle_write, shared_from_this(), boost::asio::placeholders::error))); } else { socket_.async_read_some(boost::asio::buffer(buffer_), strand_.wrap( boost::bind(&connection::handle_read, shared_from_this(), boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred))); } }

3 2

Use boost::shared_ptr with boost::adaptors
by tolik levchik 01 May '12

01 May '12

The following code gives me segfault. But if `foo_ptr` is `foo*` it works fine. #include <vector> #include <boost/range/adaptor/indirected.hpp> #include <boost/range/adaptor/transformed.hpp> #include <boost/range/algorithm/for_each.hpp> #include <boost/bind.hpp> #include <boost/shared_ptr.hpp> struct foo{ foo(int _i): i(_i){} virtual void bar() const{ std::cout << "foo::bar::i " << i << std::endl; } int i; }; typedef boost::shared_ptr<foo> foo_ptr; //typedef foo* foo_ptr; foo_ptr trasform(int i){ return foo_ptr(new foo(i)); } int main(){ std::vector<int> vec; vec.push_back(1); using namespace boost::adaptors; using boost::bind; boost::for_each(vec | transformed(bind(&trasform, _1)) | indirected, bind(&foo::bar, _1)); } Is it expected behavior of adaptors ?

3 6