September 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

Is boost::this_thread::sleep_for interruption point?
by Serg Gulko 23 May '13

23 May '13

Hello! According to documentation(v 1.50.0) call boost::this_thread::sleep_for can be interrupted. For some reason this functionality not works for me. Here is code sample: //Simple thread function void Test::worker(int delay) { try { boost::this_thread::sleep_for(boost::chrono::milliseconds(delay)); cout << "Doing some work" << endl; } catch (boost::thread_interrupted const& e) { cout << "INTERRUPTED" << endl; } } //Far in the code boost::thread workerThread(boost::bind(&Test::worker, this, 1200)); boost::this_thread::sleep(boost::posix_time::milliseconds(30)); workerThread.interrupt(); boost::this_thread::sleep(boost::posix_time::milliseconds(1500)); I always getting 'Doing some work'... -- View this message in context: http://boost.2283326.n4.nabble.com/Is-boost-this-thread-sleep-for-interrupt… Sent from the Boost - Users mailing list archive at Nabble.com.

3 3

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

chaining functions input output
by MM 19 Feb '13

19 Feb '13

Hello, i have these 2 functions provided to me and I wonder whether they can somehow be chained without using intermediary memory? http://codepad.org/tTwkUQhp Rds, MM

4 7

[Program Options] terminate parsing after first positional argument
by Stuart Pook 22 Jan '13

22 Jan '13

Hello, How can I tell Boost Program Options to stop parsing the arguments as soon as it finds a positional argument? I'd like to be able to parse the argument list "-v chmod -R -v 600 foo" as having one argument for my program (-v) and the rest as a std::vector of std::string (including the -v). In the attached program I have tried 2 different approaches. The first uses multitoken with the arguments "--command date -u -v", it fails because "-u" isn't known. The second uses collect_unrecognized with "chmod -R -v 600", it doesn't work because -v is interpreted by boost and doesn't end up in the vector. As someone said back in 2005, perhaps I'm trying to write xargs: http://thread.gmane.org/gmane.comp.lib.boost.user/9529/focus=9641 I know that I can ask my users to write a.out -v -- chmod -R -v 600 foo but I don't want to do that. I want them to write "a.out -v chmod -R -v 600 foo". The first positional argument should should tell boost to stop processing. Another slightly different question. If I have a multitoken option that takes doubles how can I get it to accept negative values? If I give my program "--floats 1 8 -4 6" where --floats starts a multitoken option that accepts double, I get an exception saying that "-4" is an unknown option. thanks Stuart This is what my test program gives me with boost 1.50: argv: dd --command date -u -v unrecognised option '-u' Allowed options: -v [ --verbose ] verbose --command arg command to run 2nd try argv: dd chmod -R -v 600 I'm verbose v: chmod -R 600 3rd try argv: dd --floats 1 8 -4 6 unrecognised option '-4' Allowed options: -v [ --verbose ] verbose -f [ --floats ] arg numbers and my program (formatted to fit in 80 characters) #include <boost/program_options.hpp> #include <boost/range/algorithm.hpp> #include <boost/program_options/parsers.hpp> #include <boost/program_options/options_description.hpp> #include <iostream> namespace po = boost::program_options; #define nelements(a) (sizeof (a) / sizeof (a)[0]) void print(char const * * b, char const * * e) { std::cout << "argv: "; std::copy(b, e, std::ostream_iterator<char const *>(std::cout, " ")); std::cout << std::endl; } int main(int argc, char ** argv) { { bool verbose; std::vector<std::string> command; po::options_description desc("Allowed options"); desc.add_options() ("verbose,v", po::bool_switch(&verbose)->default_value(false), "verbose") ("command", po::value<std::vector<std::string> >(&command) ->multitoken(), "command to run") ; char const * args[] = { "dd", "--command", "date", "-u", "-v", 0 }; print(args, args + nelements(args) - 1); po::variables_map vm; try { po::store(po::command_line_parser(nelements(args) - 1, args) .options(desc).run(), vm); po::notify(vm); if (verbose) std::cout << "I'm verbose\n"; std::cout << "command: "; boost::copy(command, std::ostream_iterator<std::string>(std::cout, " ")); std::cout << std::endl; } catch (boost::program_options::unknown_option & x) { std::cerr << x.what() << "\n" << desc << "\n"; } } std::cout << "2nd try\n"; { bool verbose; po::options_description desc("Allowed options"); desc.add_options() ("verbose,v", po::bool_switch(&verbose)->default_value(false), "verbose") ; char const * args[] = { "dd", "chmod", "-R", "-v", "600", 0 }; print(args, args + nelements(args) - 1); po::variables_map vm; po::parsed_options parsed = po::command_line_parser(nelements(args) - 1, args). options(desc).allow_unregistered().run(); try { po::store(parsed, vm); } catch (boost::program_options::unknown_option & x) { std::cerr << x.what() << "\n" << desc << "\n"; exit(2); } po::notify(vm); if (verbose) std::cout << "I'm verbose\n"; std::cout << "v: "; std::vector<std::string> v = po::collect_unrecognized( parsed.options, po::include_positional); boost::copy(v, std::ostream_iterator<std::string>(std::cout, " ")); std::cout << std::endl; } std::cout << "3rd try\n"; { bool verbose; std::vector<double> f; po::options_description all("Allowed options"); all.add_options() ("verbose,v", po::bool_switch(&verbose)->default_value(false), "verbose") ("floats,f", po::value<std::vector<double> >(&f)->multitoken(), "numbers") ; char const * args[] = { "dd", "--floats", "1", "8", "-4", "6", 0 }; print(args, args + nelements(args) - 1); po::variables_map vm; try { po::store(po::command_line_parser(nelements(args) - 1, args) .options(all).run(), vm); po::notify(vm); if (verbose) std::cout << "I'm verbose\n"; std::cout << "floats: "; boost::copy(f, std::ostream_iterator<double>(std::cout, " ")); std::cout << std::endl; } catch (boost::program_options::unknown_option & x) { std::cerr << x.what() << "\n" << all << "\n"; } } }

6 16

[mpi] many undefined references to serialize<boost::mpi::detail::mpi_datatype_oarchive>
by Brian Budge 30 Oct '12

30 Oct '12

Hi all - I've got a class hierarchy that can already be serialized into text or binary archives. I'm explicitly instantiating the template functions for serialize and/or load/save. I'm trying to add the capability to have boost mpi perform the serialization through send/recv/broadcast. I've added explicit instantiations for the boost::mpi::packed_iarchive and packed_oarchive. My code compiles, but at the end I get a bunch of undefined references for serialize<boost::mpi::detail::mpi_datatype_oarchive>. I can add the explicit instantiations for this oarchive, and this seems to fix my linking issue, but this seems broken, i.e. I should not have to deal with anything in a boost::detail namespace? Is there another suggestion for how to get this to work? Thanks, Brian

5 11

[units] Missing quantity operator++, operator%
by Nathan Crookston 25 Oct '12

25 Oct '12

All, I'm in the process of switching my homegrown units system over to boost units. Some operators which I'm missing are the modulus and the pre and post increment operators. Looking through the archives I note an original review[1] which mentioned the absence of those operators. One response claimed that quantity<si::length, int> t = 5. ...; t++; was nonsensical as writing 5 m + 1, and the reviewer eventually agreed, citing possible confusion if the quantity type converted the initializer. Matthias Schabel seemed to respond favorably: 'I debated this for a while - the only problem is that there will be some value types with heterogeneous operator+ / operator- for which q + 1 is not the same type as q, but I guess that it is just OK for it to just give a compile error in those cases.' And Steven Watanabe said 'Will do.' I haven't found anything regarding the modulus operator. My question is, would a patch adding those operators be accepted? Thanks, Nate [1] http://lists.boost.org/Archives/boost/2007/03/119001.php

3 4

[fusion] making an inner struct boost fusion compatible?
by Oswin Krause 17 Oct '12

17 Oct '12

Hi list, I have the following problem: template<class T, class U, class V> struct MyType{ struct nested{ typename MetaFunc<T>::type a; typename MetaFunc<U>::type b; typename MetaFunc<V>::type c; }; }; now this inner struct must be a boost fusion compatible random access sequence. The examples cover only structs on namespace lvel, how can i handle this way? Later these classes will be generated by a macro automatically so even dirty hacks are allowed :). But i don't want to clatter the namespace by pulling nested outside of the class. Is there an easy way or do i have to write the necessary mtafunctions to make this possible? Greetings, Oswin

3 8

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

CSR graph and Dijkstra's to lower graph memory
by jer.k 08 Oct '12

08 Oct '12

Hello, This is my first post and I'm very new to BOOST, so please let me know if I have missed some of the mailing list etiquette :) When I run Dijkstra's on my graph, I quickly run out of memory and I'm trying to find ways to lower the memory needed to store the graph. My graphs has around ~3,600,000 nodes and ~580,000,000 edges (I will eventually need a graph at least 5x this number - more if possible). I only store a weight (double) at each edge (I don't need to store any information at each node) and find that while this only takes about 1.5 hrs to run, this takes up around ~95GB (I have access to a cluster so I can run these high memory jobs). I use an adjacency_list to store this graph. typedef adjacency_list < setS, vecS, undirectedS, no_property, property < edge_weight_t, double > > graph_t; My two questions are: 1) Is this a reasonable amount of memory to expect a graph of this size using an adjacency_list? Or am I doing some terribly wrong? This is much more memory needed than I expected. 2) From what I understand, the compressed sparse row (CSR) graph is a possible solution to lowering the memory requirements as I know the number of edges and the number of nodes prior to forming the graph. I've been going through the documentation and I followed this tread <http://boost.2283326.n4.nabble.com/Graph-On-Dijkstra-SSSP-performance-td444…> which had an example of using a CSR instead of an adjacency_list and running Dijkstra's. However I can't seem to get the last step (last reply by Jeremiah Willcock) of > "plus adding the weight map parameter explicitly > to the call to dijkstra_shortest_paths_no_color_map" to work successfully. I guess I'm not sure how to add the weigh map parameter to the Dijkstra's call. The following is the relevant code dealing with edge weights. ======= ... struct Edge_Cost { double weight;}; // Needed for bundled properties. Edge_Cost *edgeCosts = new Edge_Cost[2]; // Add 3 edges costs. edgeCosts[0].weight = (2.0); edgeCosts[1].weight = (5.2); edgeCosts[2].weight =(3.33); ... typedef compressed_sparse_row_graph<directedS, WebPage, // From the example docs on CSR Edge_Cost // The struct. > graph_t; graph_t g(boost::edges_are_unsorted, &the_edges[0], &the_edges[0] + numEdges, edgeCosts, // Add the weights here??? numNodes); ... boost::dijkstra_shortest_paths(g, // The graph. s, // VertexDescriptor - the source vertex. &p[0], &d[0], edgeCosts, // <--- WHAT DO I PUT HERE?? indexmap, std::less<int>(), closed_plus<int>(), (std::numeric_limits<int>::max)(), 0, default_dijkstra_visitor() ); ======= When I run this, I get several errors, the first is: error C2664: 'boost::get' : cannot convert parameter 2 from 'boost::detail::csr_edge_descriptor<Vertex,EdgeIndex>' to 'ptrdiff_t' c:\boost_1_49_0\boost_1_49_0\boost\graph\dijkstra_shortest_paths.hpp 162 I might be totally off here so please let me know :) Thanks! - Jeremy -- View this message in context: http://boost.2283326.n4.nabble.com/CSR-graph-and-Dijkstra-s-to-lower-graph-… Sent from the Boost - Users mailing list archive at Nabble.com.

4 9

[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

[BGL] vecS for vertex container and vertex index adjustments
by Sergey Mitsyn 03 Oct '12

03 Oct '12

Hi all, I know that while using vecS for vertices one has no vertex iterator stability upon removing vertices. But I have a question if there exists something like vertex _index_ stability. The documentation says that indices for vertices are automatically adjusted so that they are still in contiguous range, but it is not specified how it is done. Is it okay to assume that if a vertex with an index I is removed, then vertices with indices < I have their indices unchanged, while vertices with indices > I have their indices decreased by one? The actual problem is removing all vertices meeting some condition. Is the following code ok? // traverse all vertices and remove those for which predicate // condition_to_remove_vertex returns true. // graph is adjacency_list<.., vecS, ...> vertex_iterator vi = vertices(graph).first, vi_end = vertices(graph).second; while (vi != vi_end) { if (condition_to_remove_vertex(vi, graph)) { vertices_size_type end_index = vertex_index[*vi_end] , vi_index = vertex_index[*vi]; remove_vertex_f(*vi, graph); // vi and vi_end are invalid --end_index; vi = vertices(graph).first + vi_index; vi_end = vertices(graph).first + end_index; // now vi and vi_end are valid again } else ++vi; } This way seems to be more effective than to start iteration again every time a vertex is removed. ------------ Sergey Mitsyn.

3 14

C++ (boost) library for serial port communication
by Alexander Dietz 03 Oct '12

03 Oct '12

Hi all, I wonder if there is a boost-library that enables easy and robust communication to a serial port, just as e.g. the python library pyserial does. Maybe there is a boost-library which can be used for those purpose instead of implementing my own C-style classes and functions? Thanks a lot, Alex

5 7

[ICL] Specific interval_map
by A G 01 Oct '12

01 Oct '12

Hello, I am trying to see whether I can use interval_map for my project. I was initially amazed with interval_map and thought this would be it, but then I have some doubts: I need a interval tree like interval_map, but the aggregated values have the following equivalent property: equal to the length of the interval it is aggregated with. An example: [0:3] -> 3 [4:8] -> 4 Then if I add the interval [2:5] with aggregated value 3 (step 1) to this container, this should end up with: [0:1] -> 1 [2:3] -> 1 [4:5] -> 1 [6:8] -> 2 which I would later need to change into (step 2) : [0:1] -> 1 [2:5] -> 3 ([2:3] and [4:5] are merged because what matter is the last inserted interval: [2:3]). [6:8] -> 2 I am not sure I can do step 1 in just overloading the operator+= over my aggregated values. Could you please confirm ? If so, is there any part of the library I can reuse to do this task (like a function overloading, but which one) or do I have to rewrite an ad-hoc insert-like method myself ? Thank you for your hints. BR, AG.

2 2

Video About Open Source Credit Rating Tool Using Boost
by Marc Joffe 30 Sep '12

30 Sep '12

I am looking for users and developers interested in collaborating on an open source sovereign rating model project. If you don't agree with your country's credit rating, here is a chance to do something about it! A video describing this project is available at http://www.youtube.com/watch?v=71d3FXCqKtY and a journal article explaining the rationale can be found at http://econjwatch.org/articles/rating-government-bonds-can-we-raise-our-grad e. The tool is available at http://www.publicsectorcredit.org/pscf.html. Source is posted at http://www.github.com/joffemd/pscf. The tool uses a Monte Carlo simulation which includes calls to Boost's normal and Cauchy random number generators. There are many opportunities for improvement upon the initial version. Please contact me if interested. Regards, Marc Joffe Public Sector Credit Solutions marc(a)publicsectorcredit.org

2 1

Re: [Boost-users] [Review] ODEInt review starts today, September 19, ends September 28
by Mario Mulansky 29 Sep '12

29 Sep '12

Hi Paul, thanks for your comments, I have just a quick note. > ... > Modern expression templates are de rigeur. Works with Boost.Units which > is a big plus. Also meshes > with Fusion and Arbitrary Precision types so will presumably work with > the recently accept > Multiprecision library. Yes, odeint works out-of-box with the Multiprecision library. I have checked this in the course of the multiprecision review process [1]. Best, Mario [1] http://lists.boost.org/Archives/boost/2012/06/194473.php

2 1

[Serialization] GCC Symbol Visibility
by drivehappy 29 Sep '12

29 Sep '12

I'm attempting to build the serialization library outside of the standard build mechanism for Boost. For the most part this works great, with the exception that the symbol visibility under GCC is not defined correctly - our compiler settings set visibility to "hidden". Snippets from boost/serialization/config.hpp: #define BOOST_SERIALIZATION_DECL(T) __declspec(dllexport) T ... #define BOOST_SERIALIZATION_DECL(T) __declspec(dllimport) T I believe there has been previous discussion on changing these to BOOST_SYMBOL_EXPORT and BOOST_SYMBOL_IMPORT respectively since the __declspec is MSVC specific (http://boost.2283326.n4.nabble.com/Questions-regarding-new-visibility-stuff…) Additionally a patch was suggested (https://svn.boost.org/trac/boost/ticket/2114) that I believe at the time covered all of the boost libraries with the same changes. It doesn't appear to have gotten into Boost.Serialization (at least as of 1.51). If it would save time I could provide a patch specifically for Serialization. Thanks.

2 1

Handling core dumps when process is holding boost interprocess lock
by Rajalakshmi Iyer 28 Sep '12

28 Sep '12

Hello, I am working on application where several multi-threaded processes are attempting to acquire a lock on the shared memory files managed via boost interprocess. It appears that if one of these processes dumps a core while holding a lock on the shared memory file, all the other processes end up waiting for this lock to be released. Any ideas on how this can be overcome? I want to ensure that when a process that is holding the lock dies, it should ensure that the lock is released. Thanks, Raj -- *Twitter: @Blismedia <http://twitter.com/#%21/blismobile> BlisMedia 32 Percy Street, London W1T 2DE www.blismedia.com <http://www.blismobile.com/>** *** <http://www.blismobile.com/>* ****[image: Follow on Twitter]* <http://twitter.com/#%21/blismobile>*[image: Blis Website]* <http://www.blismobile.com/> *This communication is from Blis Media 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)blismedia.com<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 Blis Mobile Ltd will be bound. To the extent permitted by law, Blis Mobile 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.*

2 1