July 2015 - Boost-users - lists.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

[Range, Phoenix] What am I missing...
by Robert Jones 25 Apr '17

25 Apr '17

Hi Folks Can anyone explain the output of this program... #include <iostream> #include <boost/range/algorithm/copy.hpp> #include <boost/range/counting_range.hpp> #include <boost/range/adaptor/reversed.hpp> #include <boost/range/adaptor/transformed.hpp> #include <boost/phoenix/bind/bind_function.hpp> #include <boost/phoenix/core/argument.hpp> int f( int i ) { return i * 2; } int main( ) { using boost::adaptors::reversed; using boost::adaptors::transformed; using boost::counting_range; using boost::copy; using boost::phoenix::arg_names::_1; copy( counting_range( 1, 5 ) | reversed | transformed( f ), std::ostream_iterator<int>( std::cout, " " ) ); std::cout << std::endl; copy( counting_range( 1, 5 ) | reversed | transformed( bind( f, _1 ) ), std::ostream_iterator<int>( std::cout, " " ) ); std::cout << std::endl; } Which is... 8 6 4 2 1768406272 1768406272 1768406272 1768406272 I'm using Gcc 4.6.2 & Boost 1.53 Thx All.

3 4

[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

[Interprocess] Communication between x86 and x64 issue
by Toni Neubert 19 Feb '16

19 Feb '16

I want to communicate between different platforms using boost interprocess. I am using vc12 and boost 1.58 on windows 7. My code below is a very simple example, that should work. But it doesn't for communications between different platforms... If I create it in x64 and open in win32, the process stuck at a lock at function try_based_lock in boost/int/sync/detail/common_algorithms.hpp In the other way around: win32 create, x64 open: the process crashes at name_length in segment_manager_helper.hpp while trying to find the name in index (priv_generic_find in segment_manager). #include <iostream> #include <boost/interprocess/managed_shared_memory.hpp> int main() { namespace bip = boost::interprocess; // open in WIN32, create in x64 #ifdef _WIN32 bip::managed_shared_memory msm(bip::open_only, "TestIPC"); #elsif X64 bip::shared_memory_object::remove("TestIPC"); bip::managed_shared_memory msm(bip::create_only, "TestIPC", 4096); msm.construct<uint32_t>("Data")[1](10); #endif // Get Data and print it auto data = msm.find<uint32_t>("Data"); if (data.second == 1) { std::cout << *data.first << std::endl; } std::cin.ignore(); return 0; } Does anybody have experience in this? Thank you in advance!

3 2

Re: [Boost-users] Crashing Issue
by swati upadhyaya 04 Nov '15

04 Nov '15

hi I am using like this where RunningThreads_ is vector containing boost thread object pointer(handler).I am using interrupt() for the interruption of thread interruption_point() catching that interruption then joining.everytime its crashing in join() for me but for others who have the same configuration its working fine all of us has windos 8. For me also it was working last week but this week the same piece of code is crashing. :( RunningThreads_[i].handle->interrupt(); RunningThreads_[i].handle->join(); delete RunningThreads_[i].handle; On Thu, Feb 5, 2015 at 9:31 AM, swati upadhyaya <swatiupadhyaya(a)gmail.com> wrote: > RunningThreads_[i].handle->interrupt(); > LOG4CPLUS_INFO(root, "Thread Interrupted for " << > RunningThreads_[i].app_name << " successful"); > RunningThreads_[i].handle->join(); > LOG4CPLUS_INFO(root, "Waiting for thread to exit " << > RunningThreads_[i].app_name << " successful"); > delete RunningThreads_[i].handle; > LOG4CPLUS_INFO(root, "Thread handle for " << > RunningThreads_[i].app_name << " successfully deleted"); > //RunningThreads_.erase(i); > > On Wed, Feb 4, 2015 at 12:10 AM, Vicente J. Botet Escriba < > vicente.botet(a)wanadoo.fr> wrote: > >> Le 03/02/15 09:10, swati upadhyaya a écrit : >> >> In my code join() timed_joined() is crashing, I am using these API >> after interrupt(),Same piece of code is working for others but in my system >> its crashing, >> Is there some dependency problem I am using >> Boost version: 1.55.0 >> OS: Windows 8 >> IDE: Visual Studio 2010 >> >> Hi, >> >> it could help if you post the example and the backtrace. >> >> Which version/OS/compiler use others for which this works? >> >> Vicente >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users >> > >

3 2

Query regarding interest in my submitting plf::colony to Boost
by Soul Studios 14 Aug '15

14 Aug '15

Hi all, I've had some expressions of support outside of the Boost community for submission of the plf::colony container and it's associated container plf::stack, mainly from the review judges for my cppcon submission on the same topic (topic didn't make it through to the finals but got a positive response). I'd like to guage reactions here to see whether it is worth spending the time necessary to port it to Boost, with all the associated reviews etc. plf::colony is a container for unordered data, where erasure and addition do not cause iterator/pointer invalidation, with superior performance characteristics to all std:: containers when either (a) Pointers and iterators which point to container elements must stay valid regardless of container additions and deletions and/or (b) Additions to or deletions from the container will be occurring in performance-critical code. Erasure performance in particular can be in advance of 6000x of vectors, while still being faster than lists, maps, deques etc for add and iteration. Full details and benchmarks across four compilers are here: http://www.plflib.org/colony.htm#benchmarks It has been thoroughly tested, including integrating it into the game engine I constructed last year as well as the usual unit tests. It supports both C++0x and C++11, and has been tested on the following compilers so far: Clang 3.4, GCC 4.6, 4.7, 4.8, 4.9 and 5.1 (both 32-bit and 64-bit), MS Visual C++ 2010 & 2013 (2015 supported but untested as yet). Internally a colony is a combination of a linked-list of increasingly-larger memory blocks combined with boolean erasure fields, combined with a custom memory location recycle stack. The most common comment I get is "that sounds kinda like a deque", so to save some time here are the differences (from the FAQ): "A double-ended queue requires a very different internal framework. It may or may not use a linked-list of memory blocks, dependent on the compiler, and has no comparable performance characteristics. Deque element erasure is very slow, similar to a vector, and it does not free unused memory blocks to the OS once they are empty, unlike a colony. In addition a deque invalidates references to subsequent container elements when erasing elements, which a colony does not. A colony never invalidates pointers/iterators to elements unless the element being referred to is erased." The rest of the faq is here and I would appreciate it if people read it before casting judgement: http://www.plflib.org/colony.htm I am aware that it will be a lot of work to port colony to Boost, so I will only undertake this if there is genuine interest. In addition, plf::stack - which colony must use internally - is a std::stack equivalent container but with much better performance characteristics, which can be used outside of plf::colony. Asides from the performance characteristics, colonies have the following positive and negative properties: Positive: Lack of pointer/iterator invalidation makes interrelating between collections of data easier, without the cache misses associated with vectors of pointers to dynamically-allocated objects. Negative: Due to the additional overhead, performance can be worse for scalar types. Thanks in advance- Matt B

5 13

[Boost.Iterator] transform_iterator equivalent for output iterators
by dariomt＠gmail.com 05 Aug '15

05 Aug '15

Here is my problem: for any given algorithm that writes its output into an output iterator, I'd like to apply a transformation *before* writing to the output iterator. e.g. inside the algorithm the output iterator is dereferenced and incremented to write each result, typically like this: *output++ = ith_result; I'd like to wrap the output iterator with a unary function func such that the effect is equivalent to: *output++ = func( ith_result ); I'm looking at the adaptors in Boost.Iterator but I cannot find a suitable one. Am I missing anything? Is there a better approach? Regards

7 8

[graph] Example parallel BGL
by Sensei 03 Aug '15

03 Aug '15

Dear all, I'd like to play with Parallel BGL (with MPI), and I'd like to see some example code. I've followed the Overview and the Adjacency List example, but I cannot compile my code. Right now, I'd like to create a graph, and then fill in with some nodes. Then, access the nodes belonging to a single process, but I wish I had an error there My error concerns the definition of the graph: No template named 'bsp_process_group' in namespace 'boost::parallel'; did you mean 'boost::process_group'? The code follows. What am I doing wrong here? I may have forgotten some header... Is there any distributed (complete) example code that I might read? Thanks & Cheers! #include <iostream> #include <string> #include <vector> #include <boost/mpi.hpp> #include <boost/graph/use_mpi.hpp> #include <boost/graph/distributed/mpi_process_group.hpp> #include <boost/graph/distributed/adjacency_list.hpp> int main(int argc, const char * argv[]) { boost::mpi::environment env; boost::mpi::communicator comm; typedef boost::adjacency_list<boost::vecS, boost::distributedS<boost::parallel::bsp_process_group, boost::vecS>, boost::directedS> graph; typedef boost::erdos_renyi_iterator<boost::minstd_rand, graph> generator; if (comm.rank() == 0) { boost::add_edge(1, 2); boost::add_edge(2, 2); boost::add_edge(2, 3); boost::add_edge(3, 4); boost::add_edge(4, 5); boost::add_edge(5, 1); // access ***only rank 0 nodes*** } return 0; }

2 2

Connected components not working Boost Graph library
by Choppin, Simon 03 Aug '15

03 Aug '15

Hello all, I hope you can help me, I'm trying to group 3D point data in clusters according to the distance between points. I.e. different groups (or components) are separated by a minimum threshold distance. To do this I am creating a boost graph (using the Boost Graph library), adding vertices (with 3D point information) and adding edges between nodes of the graph that are within my threshold distance. However, when I find the connected components on the resulting graph I'm getting an incorrect answer. The vertices of the graph are not grouped correctly. I am comparing my results with a Matlab script (and their proprietary programs) which correctly separates the points. I have a stackoverflow post with more detail (and no answers) http://stackoverflow.com/questions/27001402/connected-components-boost-c. If you are able to help in any way I'd be very appreciative. I really don't want to use compiled Matlab for this solution. Thanks Simon Choppin

3 9

Details of boost parallel graph implementation
by Mayank Bakshi 03 Aug '15

03 Aug '15

3 5