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

Re: [Boost-users] serialization::make_nvp parameters
by Hammond, John (UK New Malden) 09 Sep '09

09 Sep '09

> The space may be a problem. Boost.Serialization sticks the name directly into the XML, and <x:1 y:2></x:1 y:2> is bad. It appears that this was indeed the problem - a rookie mistake. By removing any spaces I am able to drop name.c_str() straight in to ::make_nvp() with no problems. To provide further context, the reason I want to assign the tags dynamically is because I am using the Serialization library in a simpler fashion than that for which it was designed. I only wish to provide a means of outputting the state of a window and I have no desire to export in a format that can be reliably read back in to the same system. Thanks for all your help, John ******************************************************************** This email and any attachments are confidential to the intended recipient and may also be privileged. If you are not the intended recipient please delete it from your system and notify the sender. You should not copy it or use it for any purpose nor disclose or distribute its contents to any other person. ********************************************************************

1 0

serialization::make_nvp parameters
by Hammond, John (UK New Malden) 09 Sep '09

09 Sep '09

Hello, I am hoping someone could answer a question I have regarding the make_nvp(..) function of the Serialization library. I am attempting to serialize a number of objects within a loop, and the name of the name-value-pair is to be assigned dynamically depending on some values taken from within the object that is to be serialized. I am currently performing the actions below: my_obj = GetMyObj(..); std::string temp = str( boost::format("x:%1% y:%2%") % _x % _y ); const char* const_temp = temp.c_str( ); ar & boost::serialization::make_nvp(const_temp, my_obj); This code compiles but will cause an exception on make_nvp. As far as I can tell, I am providing the function with the const char* that it requires, so am very confused as to why it is not performing as expected. Any help with this would be greatly appreciated. John Hammond ******************************************************************** This email and any attachments are confidential to the intended recipient and may also be privileged. If you are not the intended recipient please delete it from your system and notify the sender. You should not copy it or use it for any purpose nor disclose or distribute its contents to any other person. ********************************************************************

4 4

Re: [Boost-users] [shared_ptr] deleter that destroys shared_pt r -is it safe?
by Stefan Strasser 09 Sep '09

09 Sep '09

> This was fixed in 1.39, if I'm not mistaken (see revision 51643). Are you sure that it fails with the current implementation? no, "current" means 1.38 in my case.

1 0

[BGL] delete children subgraphs
by Marti Cuquet 09 Sep '09

09 Sep '09

Hello, I have a root subgraph from which I create a lot of children subgraphs, that use too much memory. How can I delete the children subgraphs after using them? Thanks, Marti

2 1

[shared_ptr] deleter that destroys shared_ptr - is it safe?
by Igor R 09 Sep '09

09 Sep '09

Hello, Is the following code legal and safe - a) according to the shared_ptr specs b) with the current boost::shared_ptr implementation Thanks! struct a { a() : p_(this, mem_fn(&a::delete_me)) {} void reset() { p_.reset(); } void delete_me() { delete this; } shared_ptr<a> p_; }; int main() { a* p = new a; p->reset(); }

3 5

[statechart] Broadcasting events to orthogonal states
by Vladimír Třebický 09 Sep '09

09 Sep '09

Hi all, first of all: thanks for the great library! I just dug into the boost::statechart tutorial trying to figure out how to deal with the following simple scenario: Let's say I have a complex application server represented by a single boost::state_chart with multiple modules (eg. network, database, etc.) represented by orthogonal spaces. I have a couple of system-wide events like "system shutdown". Handling these eventa is generally non-trivial and I'd like all the modules to process it independently. As I understand, statechart tries to deliver an event across al of the orthogonal spaces discarding it once it's processed by any of them (ie. by "return transit", "return discard_event", etc.). But I'd like these events to be delivered to _all_ orthogonal spaces no matter what they do with it. I could create a state for each of the orthogonal spaces. These wrappers would accept the system-wide events, translate them to local-events, post them locally and forward the system-wide event. But that's basically like having multiple statecharts for each of the modules and dispatching system-wide events manually. Thanks, Vladimir.

2 2

How to use boost 1.39 with eclipse
by manish4gupta 09 Sep '09

09 Sep '09

Hi , I am working on shared memory.I am using boost interprocess and regex module. I tried to install on ubuntu but it pop up errors for unrecognized function.So now i am planning to use boost interprocess and boost regex module in eclipse. How can i do that? Please help as i am in great need. Regards -- View this message in context: http://www.nabble.com/How-to-use-boost-1.39-with-eclipse-tp25356863p2535686… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[asio] compile error on Solaris 10
by Wang, Paul 08 Sep '09

08 Sep '09

I'm including <boost/asio.hpp> and I'm getting the following compile error on Solaris 10 using gcc 3.4.3 with both Boost 1.39 and 1.40. In file included from /opt/boost_1_39_0/boost/asio/detail/socket_types.hpp:111, from /opt/boost_1_39_0/boost/asio/detail/win_iocp_io_service_fwd.hpp:24, from /opt/boost_1_39_0/boost/asio/io_service.hpp:37, from /opt/boost_1_39_0/boost/asio/basic_io_object.hpp:20, from /opt/boost_1_39_0/boost/asio/basic_socket.hpp:24, from /opt/boost_1_39_0/boost/asio/basic_datagram_socket.hpp:25, from /opt/boost_1_39_0/boost/asio.hpp:20, ... /usr/include/net/if.h:99: error: template argument required for `struct map' Does anyone know of a work around for this? Thanks, Paul

1 0

Can we pass variable argument list to boost format?
by ajil koshy 08 Sep '09

08 Sep '09

Hi, I'd like to know if there is a way by which we can pass the variable argument list to boost format. I have a function which creates formatted output strings for logging purpose. Currently, I'm using _vsnwprintf_s function internally to handle variable argument lists which the caller may be pass to this function. Can this be done using boost format? Thanks Ajil

2 1

Re: [Boost-users] shared_ptr and weak_ptr concurrency
by Jerry Jeremiah 08 Sep '09

08 Sep '09

Just to make sure I understand, am I right that this assumes x86/x64 CPUs and only those built in types up to register size (no 64 bit integers) and may not include single bytes in all circumstances? If you wrote code that depended on this assumption how could you be sure it wouldn't be ported to a box with a different CPU (I move stuff all the time between x86 and AIX, HPUX and sometimes a VAX). Can I make the same assumptions or not? And how can I be sure? Thanks, Jerry Message: 1 Date: Fri, 4 Sep 2009 11:58:46 -0400 From: John Dlugosz <JDlugosz(a)TradeStation.com> To: "boost-users(a)lists.boost.org" <boost-users(a)lists.boost.org> Subject: Re: [Boost-users] shared_ptr and weak_ptr concurrency Message-ID: <89030B4A18ECCD45978A3A6B639D1F240266A3F2C7(a)FL01EXMB01.trad.tradestation .com> Content-Type: text/plain; charset="utf-8" I know that on x86 and x64 architectures, assigning to or reading from any location up to the native general-purpose register size is atomic if the item in question is properly aligned for its size. That is, { a=b; in parallel with b=c; } will not read a partially-changed b, if b is declared in the normal manner. Reading oddly-aligned things out of a packed stream, or using pragmas to change the alignment options, may upset this. Furthermore, the cache is coherent among multiple CPUs or cores, even on a NUMA server. What you have to watch out for is when the compile actually issues the read or write, since it can us a register and save it back to memory much later, or re-arrange the requests. Furthermore, the chip queues requests to memory with reads having priority, so a write followed by a read needs special consideration. Assigning to a (non-volatile) char might do something ?interesting?. For example, if two separate char variables are declared, the compiler might keep them in registers and save them both out at the end with a single 16-bit write. The x86/x64 instruction set is conducive to that, but not to other cases. But in general an architecture might indeed merge separate variables to single larger register. The compiler might then re-save something that didn?t change, thus clobbering a change made on another thread. The current C++ standard does not address threads, so there is indeed no portable way to guarantee that. You have to encapsulate and implement for each architecture, and use compiler-specific extensions. It would be interesting to see a list of architectures noting whether or not primitive type reads and writes are atomic, at least verifying that they are even if there is nothing listed that doesn?t. I?m sure they would all have footnotes to that, as I described above for the one I?m familiar with. --John From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Kevin Kassil Sent: Friday, September 04, 2009 9:32 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] shared_ptr and weak_ptr concurrency Stefan, On Thu, Sep 3, 2009 at 2:30 AM, Stefan Strasser <strasser(a)uni-bremen.de<mailto:strasser@uni-bremen.de>> wrote: ... why would you even need a lock here? the shared_ptr doc says that you can expect the same thread safety from shared_ptr as you can from built-in types. you can use multiple-readers-single-writer without any locks on built-in types. You can? Is assigning to a char or a double guaranteed to be atomic? How can the compiler guarantee that? -- What if there is some architecture for which it's not a single instruction assignment? Kevi

2 1

shared_ptr and weak_ptr concurrency
by Rajeev Rao 08 Sep '09

08 Sep '09

This is the first time I'm using boost in a multi-threaded env (linux x86_64,gcc 4). This question may have been asked in other forms. However, from what I've been able to search (google) up, I could not get a crystal clear answer. I'm essentially trying to use the solution provided in this page. http://onlamp.com/pub/a/onlamp/2006/05/04/smart-pointers.html?page=5. >From the boost documentation, it appears that this could be an undefined operation as the global shared pointer is being read and written to by multiple threads. Is that correct ? In case the link fails or someone wants more details, please read on. I've got a n reader threads and 1 writer thread. initializion Thread : shared_ptr< MyClass > global_ptr(createNewObject()) ; WriterThread :global_ptr.reset( createNewObject()) ReaderThreads:weak_ptr<MyClass> local_weak_ptr (globally_ptr) ;... if(shared_ptr< MyClass > local_shared_ptr = local_weak_ptr.lock() ) { // using local_shared_ptr.} else { // recreate weak ptr from global ?} thanks. Rajeev

7 16

[signals2] tracking intrusively ref-counted object
by Igor R 08 Sep '09

08 Sep '09

Hello, In my project I've got intrusively ref.counted objects (particularly, ATL COM-objects), which listen to signals of some asynchronous subsystem. Currently, when these objects connect to the signals, they bind their own intrusive smart-ptrs to the slot functor, like this: // pseudo code Object::init() { asyncSubsystem_.onSignal_.connect(bind(&Object::handleSignal, intrusive_from_this...)); // ensure the slot wouldn't bound to a dead object } Of course, this implies that the object cannot "die" until it's explicitly disconnected from the signal, so when the user of my library wants to get rid of such an object, he must call one more function (say, obj->close()) before resetting his smart-ptr to the object -- which is not just inconvenient, but also threatens the exception safety of user's code. Now I'd like to eliminate the need for this additional "finalization". For this purpose I have to: a) bind plain "this" to the slot functor -- so that the signal wouldn't be a "strong" client of Object b) eliminate race condition between slot invocation (coming from asyncSubsystem's thread) and the destruction of Object caused by resetting of user's intrusive ptr I tried to think of different ways to solve (b), but nothing seems to work so far... So my question is whether (b) is ever possible, and what would be the right solution for the whole issue. Thank you, Igor'.

3 7

[Thread] finding a good expression to wait...
by Julien Claassen 08 Sep '09

08 Sep '09

Hello everyone! I'm trying to build a simple user-interface. It reads events from the keyboard using cin in one thread and then yields to a controller, which does some work. I'm doing the waiting part in the threads using condition_variables. The input-threads "main-function" looks something like this: *** CODE SNIPPET *** condition input_cond, output_cond; // some other code void main_loop(condition& in, condition& out) { char input_key; boost::mutex::scoped_lock lk(my_global_mutex); while (input_key != 'q') { while (in.timed_wait(lk,system_time(second_clock::local() + seconds(1)) \ == false) // DEFINITELY NOT! good { } cin >> input_key; out.notify_one(); } } *** END OF CODE *** The controller/output main_loop looks similar only it uses out.timed_wait(...) and in.notify_one(), when the crucial task is done. Result is, both main_loops, when passed to a thread start and then it's deadlocked. I have seen examples of the producer/consumer pattern, which worked with buffers and they used conditions like: while (buffer_full == 0) or similar. I only have one key, no queueing, so what to do here? Please any good pointer/help/example is appreciated. Gratefully yours Julien -------- Music was my first love and it will be my last (John Miles) ======== FIND MY WEB-PROJECT AT: ======== http://ltsb.sourceforge.net the Linux TextBased Studio guide ======= AND MY PERSONAL PAGES AT: ======= http://www.juliencoder.de

2 4

Exponential function
by amir ghanbari 08 Sep '09

08 Sep '09

Hi all, I'm new to boost and I wanted to know how can I compute exponential function in boost? thanx in advance!

2 1

[bind] and [function] : question on binding member function
by Moritz 08 Sep '09

08 Sep '09

Hi, can someone explain to me why the following code crashes at the third call to "a.call_func" when "str" is dereferenced? Should'nt it crash when "this" is dereferenced? Thanks in advance. typedef boost::function<void (void)> Callback; class A { public: void set_cb_func( Callback cb ) { callback = cb; } void call_func() { callback(); } Callback callback; }; class B { public: B() : str(new std::string) {} ~B() { delete str; } void do_sth() { std::cerr << &(*this) << " " << *str << std::endl; *str += "string"; }; std::string * str; }; int main() { A a; { B b; a.set_cb_func(boost::bind(&B::do_sth, &b)); a.call_func(); a.call_func(); } a.call_func(); return 0; }

3 2

[Accumulators] Matching via ADL.
by Robert Jones 08 Sep '09

08 Sep '09

In this code sequence: boost::accumulators::accumulator_set< long, boost::accumulators::features< boost::accumulators::tag::sum > > my_acc; long f( ) { using namespace boost::accumulators; return sum( my_acc ); } why do I need a using declaration? Shouldn't sum() be found via ADL? Using Boost 1.39 & MSVC 8. Thanks - Rob.

1 0

[serialization] Workarounds for serialization of std::map / non-default constructors
by Chard 08 Sep '09

08 Sep '09

When serializing a std::map (specifically, the loading part) if either the key or value type of the map's pair is not default constructable then workarounds are required (note: this has only been confirmed with the std::map implementation provided with MSVC71). E.g.: {{{ #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/serialization.hpp> #include <boost/serialization/map.hpp> #include <sstream> #include <utility> //////// // Example, non-default constructable class class X { public: X(int i) : i_(i) {} private: int i_; friend class boost::serialization::access; template <typename A> void serialize(A &ar, const unsigned) {} }; template <typename A> inline void load_construct_data(A &ar, X * a, const unsigned) { ::new(a)X(1); // e.g. } ////////////////////////////////////////// void test_ser_pair() { std::map<double, X> theMap; theMap.insert(std::make_pair(0.5, X(1))); std::string text; { std::ostringstream ostr; boost::archive::text_oarchive arch(ostr); arch & theMap; text = ostr.str(); } { std::istringstream istr(text); boost::archive::text_iarchive arch(istr); // Next line doesn't compile under MSVC7.1 because the serialization // of map uses the default constructor of std::pair. arch & theMap; } } }}} My current workaround is to provide a specialization of just the std::pair constructor for my map's pair, but it would be nice if the library could provide a workaround.

1 0

Re: [Boost-users] Trying to serialize observer pattern - both subject and observers with pionters
by Mikael Carlsson 08 Sep '09

08 Sep '09

Hi, > > I am using the observer pattern in a design and would like to make > > both subject and observers serializable. The subject hold a > base class > > pointer to the observes and the observers holds a base > class pointer > > to the subject. > > > > If I have understood the library correct I must register > the class for > > base class pointers in order to serialize the class pointer. > > Nope - you just have to indicate the base class for each class that > has one. I have included a small piece of code. It illustrates how I have interpreted the documentation. As you can see I use BOOST_CLASS_EXPORT (from what I read above, this is not needed). If I exclude the BOOST_CLASS_EXPORT I get "unregistered class" exception. If I include it, it appears to works but I get seg. fault during main exit (most likely a different problem related to my environment). I guess that I am using some parts of the library incorrect. > > This > > means that I must include the concrete subject in the concrete > > observers and vice versa. > > The means that I will run into circular dependencies. > > Nope C++ doesn't permit a circular derived/base class structure Understood, but I do not have a circular dependency between derived/base class, but with concrete observable(subject) and concrete observers. > > > > I guess that I am missing something here, the observer > pattern must be > > frequently used and be serialized. > > You're confusing the class structure which cannot be circular with a > seqence of pointers which can be circular. I guess you are right, I think I understand. > The library can handle circular pointer references with no problem. Understood (and agreed) / Mikael Carlsson

1 0

Trying to serialize observer pattern - both subject and observers with pionters
by Mikael Carlsson 08 Sep '09

08 Sep '09

Dear list, I am using the observer pattern in a design and would like to make both subject and observers serializable. The subject hold a base class pointer to the observes and the observers holds a base class pointer to the subject. If I have understood the library correct I must register the class for base class pointers in order to serialize the class pointer. This means that I must include the concrete subject in the concrete observers and vice versa. The means that I will run into circular dependencies. I guess that I am missing something here, the observer pattern must be frequently used and be serialized. Have anyone used the observer pattern and managed to serialize both observers and subject with pointers included. / Mikael

2 1

[variant] how to in-place construct a variant
by Stefan Strasser 07 Sep '09

07 Sep '09

I can't figure out how to in-place construct the contents of a boost::variant. the error message using GCC is merely 516 kb in size. from the boost.variant tutoral: > By default, a variant default-constructs its first bounded type, so v initially contains int(0). If this is not desired, or if the first bounded type is not default-constructible, a variant can be constructed directly from any value convertible to one of its bounded types. from the synopsis: > template<typename T> variant(const T &); > template<typename T> variant & operator=(const T &); so why does the following fail: struct A : noncopyable{ A(int); A &operator=(int); }; struct B{}; int main(){ A a(5); //ok a=5; //ok variant<A,B> var(5); //error var=5; //error } both error messages complain about noncopyable being - noncopyable. compiler is gcc 4.3.2 thank you

2 1

[Signals2] connecting signals and pointers to objects
by Julien Claassen 07 Sep '09

07 Sep '09

Dear all! I'm trying to let several threads communicate using Boost.Signals2. Now I have encountered problems when working with pointers to my function-objects. could you please read this example code and give me pointers to solving these issues. *** CODE EXTRACT *** typedef boost::signals2::signal<void (char)> sig_t; class Base { public: boost::signals2::connection connect(const sig_t::slot_type&); protected: sig_t its_signal; }; boost::signals2::connection Base::connect(const sig_t::slot_type& subscriber) { return its_signal.connect(subscriber); } class Derived : public Base { public: void run(); }; void Derived::run() { // do something its_signal(); // something more to be done } class Function_object { public: void slot_func(char); void run(); }; void Function_object::slot_func(char c) { cout << "Hurrah, I received char c: " << c << endl; } void Function_object::run() { Base* my_base_pointer = new Derived(); my_base_pointer->connect(boost::bind(&Function_object::slot_func, \ this)); // Here I get errors from the Boost.Signals2 headers my_base_pointer->run(); } int main() { Function_object fo; thread taskrunner(boost::bind(&Function_object::run, &fo)); taskrunner.join(); return 0; } *** END OF CODE *** I compiled it with: gcc (Debian 4.3.2-1.1) 4.3.2 On Debian Lenny Linux. It seems I could have a reference to my Base or Derived object, when doing the connection, but no pointer. The goal is to have more than one derived class from Base and store them all in some kind of container or simple array. I tried making a vector of references to the Base cass, but as it should be an abstract data type, it didn't work. I would appreciate any help with this! Kindest regards Julien -------- Music was my first love and it will be my last (John Miles) ======== FIND MY WEB-PROJECT AT: ======== http://ltsb.sourceforge.net the Linux TextBased Studio guide ======= AND MY PERSONAL PAGES AT: ======= http://www.juliencoder.de

2 1

[Interprocess] Problem reading or wrting to shared memory
by Thomas.Schulze＠camco.de 07 Sep '09

07 Sep '09

Hello, I created a simple class for storing information in shared memory (native Windows): template< class data> struct SharedData { SharedData<data>(): value(0), var(0.0), written(1), read(0){ std::cout<<" Objekt bei "<<this<<" erzeugt!"<<std::endl;} int value; // just temporary, will be replaced by a more generic data type double var; // just temporary, will be replaced by a more generic data type boost::interprocess::interprocess_semaphore written,read; }; I created and mapped that memory like: boost::interprocess::windows_shared_memory shm (create_only,name, read_write,sizeof(SharedData<data>)); boost::interprocess::mapped_region region(shm,read_write); and assigned a new data structure to it's address with: pShared = new(region.get_address()) SharedData<data>(); with pShared: SharedData<data>* pShared; But when I try to access the stored data with this pointer my program simply quits. Probably I am making a really silly mistake? Kind regards, Thomas Tel.: +49 2762 408-0 Fax.: +49 2762 408-10 Internet: http://www.camcoaudio.com CAMCO Produktions- und Vertriebs-GmbH f�r Beschallungs- und Beleuchtungsanlagen - Fischpicke 5 - 57482 Wenden - Amtsgericht Siegen HRB 7075 - Gesch�ftsf�hrer: Joachim St�cker, Reiner Sassmann, Carsten Wegner

1 0

[asio] SSL enabled http server3 example is blocking
by Mariusz Wojtysiak 07 Sep '09

07 Sep '09

Hello, I noticed, that my ssl server implemented with boost::asio, which use pool of 10 threads, use only first working thread. Even if I put long running operation (like: std::cin > c; ) in handler of ssl request, request from second client is hung until running operation finish in first thread. Similar problem was described in archived post: "[asio] SSL enabled http server3 example is blocking" http://groups.google.pl/group/boost-list/browse_frm/thread/c26432c90020e6d9… After a few hours of debugging asio, I found a reason: Class openssl_stream_service implement ssl operations (like async_handshake, async_write_some...) using strand_ member, which is type of io_service::strand. This causes that two ssl operations using the same ssl stream cannot be running in the same time. Here is piece of code, which I had on my server to handle client request: void Request::handleClientRequest() { boost::asio::async_read_until( m_sessionPtr->getSocket(), m_headerBuffer, '\n', boost::bind( &Request::readHeaderHandler, shared_from_this(), boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred ) ); } void Request::readHeaderHandler( const boost::system::error_code &error, std::size_t bytesTransferred ) { // long running operation char c; } Method readHeaderHandler() is called from io_service::strand, so during this long running operation any other requests from clients have to wait! Solution it simple and works fine for me: Instead of calling long operations directly in handler, post operation to io_service, like here: void Request::readHeaderHandler( const boost::system::error_code &error, std::size_t bytesTransferred ) { m_ioService.post( boost::bind ( &Request::executeCommandHandler::executeCommandHandler, shared_from_this() ) ); } void Request::executeCommandHandler() { // long running operation char c; } This way, readHeaderHandler() return immediately from current srand operation (so other client's request may be handled) and executeCommandHandler() is called a bit later.

1 0

Looking for bgl-book.pdf
by Mathieu Malaterre 07 Sep '09

07 Sep '09

Hi there, Does anyone has a copy of bgl-book.pdf ? I am running a debian/linux system and there are no tool to decompress 'sit' file. Ref: http://www.informit.com/store/product.aspx?isbn=0201729148 or directl link: http://www.informit.com/content/images/0201729148/CDContents/0201729148_CD.… Thank you -- Mathieu

1 0

[math] gamma distribution's quantile performance
by Christian Henning 06 Sep '09

06 Sep '09

Hi there, I have created a test which times the performance of boost::math::quantile( ... ) when using a gamma distribution. I ran it against source code we use here at work, for ages. It can be found here: http://people.sc.fsu.edu/~burkardt/cpp_src/dcdflib/dcdflib.html The old source code is about 2x times faster than the boost version. MS Visual Studio 2005: boost: 35.4sec att_bell:19sec Intel 11.1: boost: 21.4sec att_bell: 11.2sec Question is if there is a way to incorporate such a function into boost::math? As far, as I can tell the results are almost identical. Regards, Christian Here the code: #include <dcdflib.h> #include <boost/math/distributions/gamma.hpp> #include <boost/timer.hpp> double min_mean = 2000; // 2,000 double max_mean = 500000000; //500,000,000 double min_std = 10000; // 10,000 double max_std = 100000000; // 100,000,000 double min_max = 600000000; // 600,000,000 double max_max = 1000000000; // 1,000,000,000 const std::size_t max_year = 5000000; // 5,000,000 const double right = 0.999; const double left = 0.001; inline double get_rand() { return static_cast< double >( std::rand() ) / static_cast< double >( RAND_MAX ); } inline void boost_( boost::math::gamma_distribution<>& d, double q ) { double value = boost::math::quantile( d, q ); } inline void att_bell( double alpha, double beta, double q ) { double q_Minus1 = 1 - q; double value = 0.0; double bound = 0.0; int which = 2; int status = 0; cdfgam( &which , &q , &q_Minus1 , &value , &alpha , &beta , &status , &bound ); } int main() { // boost { std::srand( 0 ); boost::timer timer; for( std::size_t y = 0; y < max_year; ++y ) { if(( y % 100000 ) == 0 ) std::cout << y << std::endl; double mean = get_rand() * ( max_mean - min_mean ) + min_mean; double std = get_rand() * ( max_std - min_std ) + min_std; double alpha = mean * mean / std / std; // shape parameter double beta = mean / alpha; // scale parameter boost::math::gamma_distribution<> d( alpha, beta ); boost_( d, right ); boost_( d, left ); } std::cout << "Boost - Time elapsed: " << timer.elapsed() << " sec" << std::endl; } // att bell { std::srand( 0 ); boost::timer timer; for( std::size_t y = 0; y < max_year; ++y ) { if(( y % 100000 ) == 0 ) std::cout << y << std::endl; double mean = get_rand() * ( max_mean - min_mean ) + min_mean; double std = get_rand() * ( max_std - min_std ) + min_std; double alpha = mean * mean / std / std; // shape parameter double beta = mean / alpha; // scale parameter att_bell( alpha, beta, right ); att_bell( alpha, beta, left ); } std::cout << "ATT Bell - Time elapsed: " << timer.elapsed() << " sec" << std::endl; } return 0; }

3 3