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

boost serialisation file size comparison
by Avi Bahra 08 Dec '09

08 Dec '09

I have written some test for the different kind of serialization archives in my application. In the test below the only difference is the kind of archive used ( and use of ios::binary for the binary streams) ANode:: ...test_node_tree_persistence_text file_size: 4014 ANode:: ...test_node_tree_persistence_binary file_size: 5351 ANode:: ...test_node_tree_persistence_portable_binary file_size: 2878 What I don't understand is why should the binary archive serialization file size be larger than text ? -- Best regards, Ta, Avi

3 2

program_options
by Hicham Mouline 08 Dec '09

08 Dec '09

For command-line options, I understand from what I read so far that the options should be like --option_name=value There is a system(I believe it is gnu) which has the long and short versions of options, like -h and --help Also, on winxxx systems, usually the command line options are indicated with a / like /? or /x /X .... Is it possible to tune program_options to choose the platform's default way of treating options? Regards,

6 5

Review Wizard report for December 2009
by John Phillips 08 Dec '09

08 Dec '09

All, Please check the report below and let Ron and I know if there are any issues so we can correct them before putting it on the web site. Pay especial attention to the need for many qualified and interested Review Managers. John ============================================== Review Wizard Status Report for December 2009 ============================================== News ==== Polygon Library Accepted Boost 1.40 Released New Libraries: None Revised Libraries: Accumulators, Asio, Circular Buffer, Filesystem, Foreach, Function, Fusion, Hash, Interprocess, Intrusive, MPL, Program Options, Proto, Python, Serialization, Unordered, Xpressive Geometry Library Accepted Boost 1.41 Released New Libraries: Property Tree Revised Libraries: DateTime, Filesystem, Iostreams, Math, Multi-index Containers, Proto, Python, Regex, Spirit, System, Thread, Unordered, Utility, Wave, Xpressive MSM Library Review Underway Constrained Value Review - Review Result still Pending Older Issues ============ The Time Series Library, accepted in August 2007, has not yet been submitted to SVN. The Floating Point Utilities Library, has not yet been submitted to SVN. It is slated to be integrated with the Boost.Math library. The Switch Library, accepted provisionally in January 2008, has not yet been submitted for mini-review and full acceptance. The Phoenix Library, accepted provisionally in September 2008, has not yet been submitted for mini-review and full acceptance. For libraries that are still waiting to get into SVN, please get them ready and into the repository. The developers did some great work making the libraries, so don't miss the chance to share that work with others. General Announcements ===================== As always, we need experienced review managers. The review queue has been growing substantially but we have had few volunteers, so manage reviews if possible and if not please make sure to watch the review schedule and participate. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants or library contributors. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "garcia at osl dot iu dot edu" and "phillips at mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. A recent effort is trying to secure at least five people who promise to submit reviews as a precondition to starting the review period. Consider volunteering for this and even taking the time to create the review as early as possible. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report before we do that, please email Ron or John. If you're a library author and plan on submitting a library for review in the next 3-6 months, send Ron or John a short description of your library and we'll add it to the Libraries Under Construction below. We know that there are many libraries that are near completion, but we have hard time keeping track all of them. Please keep us informed about your progress. The included review queue isn't a classic queue. It is more an unordered list of the libraries awaiting review. As such, any library in the queue can be reviewed once the developer is ready and a review manager works with the wizards and the developer to schedule a review. It is not FIFO. Review Queue ============ * Lexer * Shifted Pointer * Logging * Log * Join * Pimpl * Task * Endian * Conversion * Sorting * GIL.IO * AutoBuffer * String Convert * Move * Containers * Interval Containers * Type Traits Extensions * Interthreads * Bitfield * Lockfree -------------------- Lexer ----- :Author: Ben Hanson :Review Manager: Eric Neibler :Download: `Boost Vault <http://boost-consulting.com/vault/index.php?action=downloadfile&filename=bo…>`__ :Description: A programmable lexical analyser generator inspired by 'flex'. Like flex, it is programmed by the use of regular expressions and outputs a state machine as a number of DFAs utilising equivalence classes for compression. Shifted Pointer --------------- :Author: Phil Bouchard :Review Manager: Needed :Download: `Boost Vault <http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directo…>`__ :Description: Smart pointers are in general optimized for a specific resource (memory usage, CPU cycles, user friendliness, ...) depending on what the user need to make the most of. The purpose of this smart pointer is mainly to allocate the reference counter (or owner) and the object itself at the same time so that dynamic memory management is simplified thus accelerated and cheaper on the memory map. Logging ------- :Author: John Torjo :Review Manager: Gennadiy Rozental :Download: http://torjo.com/log2/ :Description: Used properly, logging is a very powerful tool. Besides aiding debugging/testing, it can also show you how your application is used. The Boost Logging Library allows just for that, supporting a lot of scenarios, ranging from very simple (dumping all to one destination), to very complex (multiple logs, some enabled/some not, levels, etc). It features a very simple and flexible interface, efficient filtering of messages, thread-safety, formatters and destinations, easy manipulation of logs, finding the best logger/filter classes based on your application's needs, you can define your own macros and much more! Log --- :Author: Andrey Semashev :Review Manager: Needed :Download: `Boost Vault <http://tinyurl.com/cm9lum>`__ :Description: The library is aimed to help adding logging features to applications. It provides out-of-box support for many widely used capabilities, such as formatting and filtering based on attributes, sending logs to a syslog server or to Windows Event Log, or simply storing logs into files. It also provides basic support for the library initialization from a settings file. The library can also be used for a wider range of tasks and implement gathering and processing statistical information or notifying user about application events. Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: | `Boost Vault <http://www.boost-consulting.com/vault/index.php?action=downloadfile&filenam…>`__ | http://www.ddj.com/cpp/205918714 (documentation) :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Task ----------- :Author: Oliver Kowalke :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo…>`__ :Description: Formerly called Thread Pool The library provides: - thread creation policies: determines the management of worker threads: - fixed set of threads in pool - create workerthreads on demand (depending on context) - let worker threads ime out after certain idle time - channel policies: manages access to queued tasks: - bounded channel with high and low watermark for queuing tasks - unbounded channel with unlimited number of queued tasks - rendezvous syncron hand-over between producer and consumer threads - queueing policy: determines how tasks will be removed from channel: - FIFO - LIFO - priority queue (attribute assigned to task) - smart insertions and extractions (for instance remove oldest task with certain attribute by newst one) - tasks can be chained and lazy submit of taks is also supported (thanks to Braddocks future library). - returns a task object from the submit function. The task it self can be interrupted if its is cooperative (means it has some interruption points in its code -> ``this_thread::interruption_point()`` ). Endian ------ :Author: Beman Dawes :Review Manager: Needed :Download: http://mysite.verizon.net/beman/endian-0.10.zip :Description: Conversion ---------- :Author: Vicente Botet :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=co…>`__ :Description: Generic explicit conversion between unrelated types. Boost.Conversion provides: * a generic ``convert_to`` function which can be specialized by the user to make explicit conversion between unrelated types. * a generic ``assign_to`` function which can be specialized by the user to make explicit assignation between unrelated types. * conversion between ``std::complex`` of explicitly convertible types. * conversion between ``std::pair`` of explicitly convertible types. * conversion between ``boost::optional`` of explicitly convertible types. * conversion between ``boost::rational`` of explicitly convertible types. * conversion between ``boost::interval`` of explicitly convertible types. * conversion between ``boost::chrono::time_point`` and ``boost::ptime``. * conversion between ``boost::chrono::duration`` and ``boost::time_duration``. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=al…>`__ :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 8X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 7X as fast as std::sort on x86 processors. string_sort is roughly 2X as fast as std::sort. GIL.IO ------ :Author: Christian Henning :Review Manager: Needed :Download: `GIL Google Code Vault <http://gil-contributions.googlecode.com/files/rc2.zip>`__ :Description: I/O extension for boost::gil which allows reading and writing of/in various image formats ( tiff, jpeg, png, etc ). This review will also include the Toolbox extension which adds some common functionality to gil, such as new color spaces, algorithms, etc. AutoBuffer ---------- :Author: Thorsten Ottosen :Review Manager: Needed :Download: `Here <http://www.cs.aau.dk/~nesotto/boost/auto_buffer.zip>`__ :Description: Boost.AutoBuffer provides a container for efficient dynamic, local buffers. Furthermore, the container may be used as an alternative to std::vector, offering greater flexibility and sometimes better performance. String Convert -------------- :Author: Vladimir Batov :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo…>`__ :Description: The library takes the approach of boost::lexical_cast in the area of string-to-type and type-to-string conversions, builds on the past boost::lexical_cast experience and advances that conversion functionality further to additionally provide: * throwing and non-throwing conversion-failure behavior; * support for the default value to be returned when conversion fails; * two types of the conversion-failure check -- basic and better/safe; * formatting support based on the standard I/O Streams and the standard (or user-defined) I/O Stream-based manipulators (like std::hex, std::scientific, etc.); * locale support; * support for boost::range-compliant char and wchar_t-based string containers; * no DefaultConstructibility requirement for the Target type; * consistent framework to uniformly incorporate any type-to-type conversions. It is an essential tool with applications making extensive use of configuration files or having to process/prepare considerable amounts of data in, say, XML, etc. Move ---------------- :Author: Ion Gaztanaga :Review Manager: Needed :Download: http://svn.boost.org/svn/boost/sandbox/move/ and online documentation at http://svn.boost.org/svn/boost/sandbox/move/libs/move/doc/html/index.html :Description: In C++0x, move semantics are implemented with the introduction of rvalue references. They allow us to implement move() without verbosity or runtime overhead. Boost.Move is a library that offers tools to implement those move semantics not only in compilers with rvalue references but also in compilers conforming to C++03. Containers ------------------ :Author: Ion Gaztanaga :Review Manager: Needed :Download: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost.… and online documentation at http://svn.boost.org/svn/boost/sandbox/move/libs/container/doc/html/index.h… :Description: Boost.Container library implements several well-known containers, including STL containers. The aim of the library is to offers advanced features not present in standard containers or to offer the latest standard draft features for compilers that comply with C++03. Interval Containers Library ------------------------- :Author: Joachim Faulhaber :Review Manager: Needed :Description: The Interval Template Library (Itl) provides intervals and two kinds of interval containers: Interval_sets and interval_maps. Interval_sets and maps can be used just as sets or maps of elements. Yet they are much more space and time efficient when the elements occur in contiguous chunks: intervals. This is obviously the case in many problem domains, particularly in fields that deal with problems related to date and time. Interval containers allow for intersection with interval_sets to work with segmentation. For instance you might want to intersect an interval container with a grid of months and then iterate over those months. Finally interval_maps provide aggregation on associated values, if added intervals overlap with intervals that are stored in the interval_map. This feature is called aggregate on overlap. It is shown by example: :: typedef set<string> guests; interval_map<time, guests> party; guests mary; mary.insert("Mary"); guests harry; harry.insert("Harry"); party += make_pair(interval<time>::rightopen(20:00, 22:00),mary); party += make_pair(interval<time>::rightopen_(21:00, 23:00),harry); // party now contains [20:00, 21:00)->{"Mary"} [21:00, 22:00)->{"Harry","Mary"} //guest sets aggregated on overlap [22:00, 23:00)->{"Harry"} As can be seen from the example an interval_map has both a decompositional behavior (on the time dimension) as well as a accumulative one (on the associated values). Type Traits Extensions -------------------------- :Author: Frédéric Bron :Review Manager: Needed :Download: https://svn.boost.org/trac/boost/browser/sandbox/type_traits :Description: The purpose of the addition is to add type traits to detect if types T and U are comparable in the sens of <, <=, >, >=, == or != operators, i.e. if t<u has a sens when t is of type T and u of type U (same for <=, >, >=, ==, !=). The following traits are added: is_equal_to_comparable<T,U> is_greater_comparable<T,U> is_greater_equal_comparable<T,U> is_less_comparable<T,U> is_less_equal_comparable<T,U> is_not_equal_to_comparable<T,U> The names are based on the corresponding names of the standard template library (<functional> header, section 20.3.3 of the standard). The code has the following properties: * returns true if t<u is meaningful and returns a value convertible to bool * returns false if t<u is meaningless. * fails with compile time error if t<u is meaningful and returns void (a possibility to avoid compile time error would be to return true with an operator, trick but this has little sens as returning false would be better) InterThreads ------------------- :Author: Vicente J. Botet Escriba :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=in…>`__ :Description: Boost.InterThreads extends Boost.Threads adding some features: * thread decorator: thread_decorator allows to define setup/cleanup functions which will be called only once by thread: setup before the thread function and cleanup at thread exit. * thread specific shared pointer: this is an extension of the thread_specific_ptr providing access to this thread specific context from other threads. As it is shared the stored pointer is a shared_ptr instead of a raw one. * thread keep alive mechanism: this mechanism allows to detect threads that do not prove that they are alive by calling to the keep_alive_point regularly. When a thread is declared dead a user provided function is called, which by default will abort the program. * thread tuple: defines a thread groupe where the number of threads is know statically and the threads are created at construction time. * set_once: a synchonizer that allows to set a variable only once, notifying to the variable value to whatever is waiting for that. * thread_tuple_once: an extension of the boost::thread_tuple which allows to join the thread finishing the first, using for that the set_once synchronizer. * thread_group_once: an extension of the boost::thread_group which allows to join the thread finishing the first, using for that the set_once synchronizer. (thread_decorator and thread_specific_shared_ptr) are based on the original implementation of threadalert written by Roland Schwarz. Boost.InterThreads extends Boost.Threads adding thread setup/cleanup decorator, thread specific shared pointer, thread keep alive mechanism and thread tuples. Bitfield --------------- :Author: Vicente J. Botet Escriba :Review Manager: Needed :Download: https://svn.boost.org/svn/boost/sandbox/bitfield with documentation available at https://svn.boost.org/svn/boost/sandbox/bitfield/libs/bitfield/doc/index.ht… :Description: Portable bitfields traits. Boost.Bitfield consists of: * a generic bitfield traits class providing generic getter and setter methods. * a BOOST_BITFIELD_DCL macro making easier the definition of the bitfield traits and the bitfield getter and setter functions. Lockfree ------------------ :Author: Tim Blechmann :Review Manager: Needed :Description: boost.lockfree provides implementations of lock-free data structures. lock-free data structures can be accessed by multiple threads without the necessity of blocking synchronization primitives such as guards. lock-free data structures can be used in real-time systems, where blocking algorithms may lead to high worst-case execution times, to avoid priority inversion, or to increase the scalability for multi-processor machines. boost.lockfree provides: * boost::lockfree::fifo, a lock-free fifo queue * boost::lockfree::stack, a lock-free stack the code is available from the boost vault: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost_… and from my personal git repository: git://tim.klingt.org/boost_lockfree.git http://tim.klingt.org/git?p=boost_lockfree.git the documentation is available at: http://tim.klingt.org/boost_lockfree/ Libraries under development =========================== Please let us know of any libraries you are currently developing that you intend to submit for review. See https://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0

[Date_Time] reliability and high resolution when getting system time
by John Beauport 08 Dec '09

08 Dec '09

For middleware purposes we have been looking at using Boost as our date/time library. It seems to cover most of our requirements. Now it has been brought to our attention that one of our requirements would be to be able to get the system time at a high resolution. Although using solely the high performance counter is a solution to this, it has its flaws. We have read an article that gives a solution that overcomes some of the problems inherent to using the performance counters, and combines/synchronizes these counters with system time to achieve better resolution. The following is a link to the article that tackles the subject (on Windows): http://msdn.microsoft.com/en-us/magazine/cc163996.aspx Has solving this type of issue been considered in Date_Time? Is it worth looking into? With these questions, I am trying to avoid venturing in something that may have already been experimented with and concluded on. I have noticed in the boost::date_time code that there is the microsec_clock::local_time() call that should provide high resolution time, but in looking at the code I do not quite understand how that is achieved with accuracy. I am trying to understand the file_time_to_microseconds() function in filetime_functions.hpp, and I have difficulty to understand how counting microseconds difference from Jan-01-1601 to Jan-01-1970 comes into play in counting the microseconds from epoch to "now". Can someone clarify this? I thank you in advance for taking the time to answer my few questions. Kind Regards, John

1 0

Waiting for multiple events
by Vadim Guchenko 07 Dec '09

07 Dec '09

Hello, All! I want to do something like this: Wrapper wrapper(final_handler); w_handler1 = wrapper.wrap(handler1); ... w_handlerN = wrapper.wrap(handlerN); where the final_handler() must be invoked as soon as all the wrapped handlers handler1() ... handlerN() are invoked through w_handler1() ... w_handlerN() in any order. Is there any existing Boost tool for that? -- Best regards, Vadim Guchenko [yhw at relost dot net].

3 2

Newbie question
by Michael Qi 07 Dec '09

07 Dec '09

Hi, I am trying to start to learn boost. Now, I am learning the getting started guide. And try to build a boost regex program in the guide. But Visual C++ 7.1 tell me error: LINK : fatal error LNK1104: Could not open file "D:\Program.obj" Could you help me? Thank you

2 1

Re: [Boost-users] Updated performance results using Boost Serialization 1.41
by Brian Wood 07 Dec '09

07 Dec '09

Kim Barrett writes: >On Dec 4, 2009, at 7:11 PM, Hartmut Kaiser wrote: >> Our measurements show Boost.Serialization spends most of its time creating >> (constructing) archives and there it's mainly initializing the locale... > > The locale initialization can be avoided if your application can get away with using the > boost::archive::no_codecvt construction flag. (Assuming that's still behaving the same > as when I looked into this performance area back around boost 1.33.) > > These threads may also be of interest: > > http://lists.boost.org/Archives/boost/2005/07/90814.php Based on that link I tried it as follows: int const binary_archive_flags = boost::archive::no_header | boost::archive::no_codecvt; filebuf fb; fb.open("ofile", ios_base::out); binary_oarchive oa(fb, binary_archive_flags); clock_t start(clock()); oa << lst; clock_t end(clock()); I didn't discern any improvement to the performance of this test from adding those flags. > http://lists.boost.org/Archives/boost/2006/03/102133.php I don't see how that is relevant. > > I keep promising myself that I will soon collect sufficient round tuits to do something > about this, but so far those promises remain broken. Maybe once I upgrade my team to boost 1.41. -- Brian Wood Ebenezer Enterprises http://www.webEbenezer.net

1 0

Re: [Boost-users] Updated performance results using Boost Serialization 1.41
by Brian Wood 07 Dec '09

07 Dec '09

Hartmut Kaiser writes: > Our measurements show Boost.Serialization spends most of its time creating > (constructing) archives and there it's mainly initializing the locale... That seems a little different from what I've been testing. The test looks like this: filebuf fb; fb.open("ofile", ios_base::out); binary_oarchive oa(fb); clock_t start(clock()); oa << lst; clock_t end(clock()); The time to construct an oarchive is not included in the test. -- Brian Wood Ebenezer Enterprises http://www.webEbenezer.net

1 0

boost::tuple and boost.interprocess
by Michal 07 Dec '09

07 Dec '09

Hallo Group Members I need to use shared memory to communicate between two processes. is boost::tuple ready to be used by boost.interprocess? best regards, Michal

2 2

[serialization] Observation regarding xml archives and library version
by Pfligersdorffer, Christian 07 Dec '09

07 Dec '09

Hi folks, hi Robert, did anyone notice that xml archives can be loaded where other archive types throw an "unsupported version" exception? I was rather surprised when I was able to read in an xml archive created by 1.41 using 1.34! The internal library version changed twice since then, so ... ... are you a magician, Robert? :-) Or is this an undocumented virtue of xml archives? Or is this just a bug nobody seems to have noticed before? Regards, -- Christian Pfligersdorffer Software Engineering http://www.eos.info

2 1

boost::interprocess - checking for a scoped lock
by Brenda Orlin 07 Dec '09

07 Dec '09

I am using scoped_lock with interprocess_mutex. I suspect that I have one of my threads trying to lock the mutex multiple times before it is unlocked. Is there a way to check and see if a mutex has already been locked by the current thread? _________________________________________________________________ Windows 7: Unclutter your desktop. Learn more. http://www.microsoft.com/windows/windows-7/videos-tours.aspx?h=7sec&slideid…

1 0

[Pool] correct usage for optimal performance
by Igor R 07 Dec '09

07 Dec '09

Hello, In my application I use singleton pools for the 2 most common allocation scenarios: 1) Frequent allocation of small objects (one by one, tens to hundreds per second). Every object is disposed soon after its allocation, so that only few objects are alive simultaniously. Since the objects are accessed through shared_ptr, I allocate them as follows: allocate_shared<Obj>(boost::fast_pool_allocator<Obj>()); Is this the appropriate use of Pool for this scenario? Should I use pool_allocator (i.e. ordered_malloc()) instead? 2) Frequent (same as in (1) frequency and lifetime) allocation of memory blocks that look like this: [10Kb, 1Kb, 1.1Kb, 0.9Kb,... 10.5Kb...] - i.e. 1 big block, then several small ones. Each block is stored in shared_array, and I allocate it this way: shared_array<char> data_; //... typedef boost::singleton_pool<my_alloc_tag, 1024> allocator; int chunks = blockSize / allocator::requested_size + 1; // rough aproximation data_.reset(static_cast<char *>(allocator::malloc(chunks)), bind(&allocator::free, _1, chunks)); Again, should I use here ordered_xxx? Or probably it's worth using allocator::maloc for the case of chunks==1, and ordered_malloc for chunks > 1? Thanks!

2 1

bidirectional socket
by pedro chaparro 07 Dec '09

07 Dec '09

hi, i have a basic question, for implementing a bidirectional communication can i do it just using one socket , i mean just open one port? or do i need to implement a client and a server in each end point? im realli confuse with this issue =( -- Ing Pedro Alonso Chaparro Valero Ciudad Politecnica de la Innovación iTEAM - Mobile Communications Group Polytechnic University of Valencia C\ Camino de Vera S/N, Edificio 8G 46022 Valencia, Spain

2 1

Problem using Boost regex
by John Emmas 07 Dec '09

07 Dec '09

If my previous post makes it to the mailing list, please ignore it (I figured out some of the original confusion). Here's the problem I'm left with:- A couple of days ago I installed libboost (v1.40) using the Windows setup.exe file. To get myself started I decided to build the regex example that I found here:- http://www.cs.brown.edu/~jwicks/boost/libs/regex/doc/introduction.html My installation contains DLLs called:- boost_regex-vc80-mt-1_40.dll and boost_regex-vc80-mt-gd-1_40.dll along with their associated link libs - and here's the example, as I built it:- #include <string> #include <boost/regex.hpp> using namespace std; using namespace boost; bool validate_card_format(const string s) { static const boost::regex e("(\\d{4}[- ]){3}\\d{4}"); return regex_match(s, e); } // and further on, I call the above function.... bool bb = validate_card_format("1111 2222 3333 4444"); If I link my app to boost_regex-vc80-mt-gd-1_40.lib (or if I don't link it to boost at all) the app won't run. In either case if I try to launch my app I see a dialog box telling me that the configuration is incorrect (possibly a problem with manifests?) OTOH If I link my app to boost_regex-vc80-mt-1_40.lib, I get a crash at the above call - i.e. at 'bb = validate_card_format("1111 2222 3333 4444");' The crash is caused by an unhandled exception in 'basic_regex::assign'. The exception occurs at the call to 'do_assign()' and I get this message:- boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<std::runtime_error> > at memory location 0x0012f4e4. I'm guessing that I should have configured something between installing boost and starting to use it. Have I missed a step out somewhere? Thanks, John

1 0

boost::date input facet
by Hicham Mouline 07 Dec '09

07 Dec '09

Hello, I have a txt file with a 1st column as a date and a 2nd column as data. I am trying to read this file into a STL sequence. The format of the date varies. Is there a utility function to try different(all) dates formats until it finds a valid date when it attempts to read that 1st column? Or should I just construct a list of possible date_input_facets and try each of them until >> succeeds? Regards,

1 0

Re: [Boost-users] Compilation errors 1.39, 1.41
by Pfligersdorffer, Christian 07 Dec '09

07 Dec '09

Hello again, I just found out that the issue with double targets only occurs when I build debug and release at once (as I usually do): bjam debug release stage I also found out, that with version 1.41 the math libraries correctly detect missing support for long double on my platform, so I guess the issue was solved. Thanks, -- Christian Pfligersdorffer Software Engineering http://www.eos.info

2 2

Updated performance results using Boost Serialization 1.41
by Brian Wood 07 Dec '09

07 Dec '09

I've recently updated the performance section of a comparison between the Boost Serialization library and the C++ Middleware Writer -- http://webEbenezer.net/comparison.html#perf<http://webebenezer.net/comparison.html#perf>. The new tests were done on Fedora 12 and Windows Vista. The previous version of that file is here http://webEbenezer.net/comp138.html#perf<http://webebenezer.net/comp138.html#perf>. The most dramatic change occurred on Windows. Previously the Boost versions were around 2.7 times slower than the Ebenezer versions. Now they are between 3.8 and 4.0 times slower than the Ebenezer versions. I believe that difference is due to our dropping return codes for exceptions. I'm not sure why it shows up more on Windows than on Linux. Cheers, Brian Wood Ebenezer Enterprises http://www.webEbenezer.net "When a man's ways please the L-RD, he makes even his enemies to be at peace with him." Proverbs 16:7

3 2

Mysterious failure of libboost_thread in 1_41_0
by Stonewall Ballard 06 Dec '09

06 Dec '09

I'm trying to switch from 1_40_0 to 1_41_0, but have run into a mysterious problem in the thread lib. My test app that I used to find the problem with thread_group::interrupt_all() failed disastrously in 1_41_0. Debugging revealed that threads were being created uninterruptable. I couldn't figure out how that was happening, though. Tracing didn't show anything setting the interruptable flags to false in the threads, but they showed up that way right after the threads started. It looks like it might be some sort of memory corruption, like a write through a bogus pointer. Adding the three 1_41_0 thread library files directly to my build (and not using the library) worked fine. Using libboost_thread and the headers from 1_40_0 worked fine as well. The failure occurred when I used the 1_41_0 headers and libboost_thread. Both the static and the dynamic libs failed in exactly the same way. The only difference between the Jamfile.v2 in each version is the removal of exceptions.cpp in 1_41_0. I don't understand the build system well enough to figure out what else might have changed. I'm building using: ./bjam address-model=32 architecture=x86 threading=multi This is with OS X 10.6.2, using gcc 4.2, building a simple command-line tool. In both cases, I built the boost libraries using address-model=32, though building with 32_64 in 1_41_0 didn't make any difference. Using 32_64 was broken in 1_40_0, so I suspect that the problem might be there. If anyone wants to take a look at this, I parked the XCode project here: <http://dl.dropbox.com/u/297034/ThreadTest_41.zip>, 20KB. I'm sure it can be built without the XCode project, but this may be an OS X specific problem. The project is configured to use the boost version installed in /usr/local. When run, it hits an assert right after the thread starts, showing that the thread is uninterruptable. The work-around is simply to include the three files from the library directly in the project. I have to wonder if this will happen with other boost libs as well. Any help would be greatly appreciated. - Stoney -- Stonewall Ballard stoney(a)sb.org http://stoney.sb.org/

2 3

[GIL] rotated90cw_view - jpeg lossless rotation
by Jose 06 Dec '09

06 Dec '09

I rotate jpeg photos to portrait by reading the file and saving it like this: boost::gil::jpeg_write_view(file, boost::gil::rotated90cw_view(boost::gil::view(img))); results: original size: 4106172 image/jpeg 3264 2448 rotated size: 5594681 image/jpeg 2448 3264 The rotation should be lossless (as the image is a multiple of the jpeg MCU) but the size has increased significantly and the exif tags disappeared. My questions: Has it been tested that the rotation is lossless ? What can I do make sure the exif tags are preserved ? thanks jose

4 6

[GIL] gil_function_requires( view that contains alpha )
by Eloi Du Bois 06 Dec '09

06 Dec '09

Hi everybody, I would like to know if there is an easy way to check if a view type contains an alpha channel. I would do something like that (not tested): BOOST_STATIC_ASSERT(mpl::contains<typename color_space_type<Pixel>::type, alpha_t>::value); But I don't know if it is a good idea. Is there a way to do that with gil_function_requires ? Thanks & respect ! Eloi.

2 5

enable_if operator+ exists
by Zachary Turner 06 Dec '09

06 Dec '09

Is there a way to use enable_if so that one specialization gets selected if operator+ exists between two types, and another specialization if operator+ does not exist? For example: template<class A, class B, boost::enable_if<operator_plus_exists<A,B> >::type* dummy = 0> void operator()(const A& a, const B& b) { std::cout << "a + b = " << (a + b) << std::endl; } template<class A, class B, boost::disable_if<operator_plus_exists<A,B> >::type* dummy = 0> void operator()(const A& a, const B& b) { } How would I implement the operator_plus_exists class?

3 3

Re: [Boost-users] [test] Non-aligned pointer being freed
by Pete Bartlett 06 Dec '09

06 Dec '09

>>> I went ahead and applied manually the patch to the 1.41.0 release. Has >>> this patch made it into SVN Trunk? >> I think so. >> https://svn.boost.org/trac/boost/changeset/56467 >> In Christ, >> Steven Watanabe >So I see that the milestones just keep getting pushed back. Just when >exactly is this going to get rolled into an actual release? OS X 10.6 >has been out since late August and any one who uses OS X 10.6 or >compiles in 64 bit on 10.5 WILL experience this bug. I think I saw a message or two a while ago from Gennadiy asking if the release branch was open again - but didn't see any without replies. I also saw a message from Beman saying the release branch was open. So it looks like now is a really good time to get the goodies on trunk pushed across to release, if Gennadiy has the time to spare in his schedule? Pete

2 1

[spirit] alpha numeric characters
by Ovanes Markarian 06 Dec '09

06 Dec '09

Hello *, I currently use boost 1.36 to parse some input line like a->b->c-> ... I thought a, b, c can be strings containing letters or digits. Until now I thought that this defines alpha numeric characters. But when using the spirit rule: +((+alnum_p)[some_callback_func] >> str_p("->")) the some_callback_func gets as input the whole input sequence (a->b->c->...). Furthermore, it than gets called for b->c->... and than c->d->... Maybe my rule is wrong, but I can't get where. Thanks for advice, Ovanes

3 4

Non-aligned pointer being freed
by Michael Jackson 05 Dec '09

05 Dec '09

So I am running into the same issue as this thread: <http://old.nabble.com/-Boost.Test--Error:-Non-aligned-pointer-being-freed-t… > Is the patch included in that thread still safe to apply to the 1.41.0 release? _________________________________________________________ Mike Jackson mike.jackson(a)bluequartz.net BlueQuartz Software www.bluequartz.net Principal Software Engineer Dayton, Ohio

4 5

1.41.0 fails to compile on Windows 7 with Visual Studion 2008 tools
by Mike Jackson 05 Dec '09

05 Dec '09

1> C:\Users\mjackson\Workspace\boost-1.41.0.cmake0\boost/test/impl/exception_safety.ipp(518) : see reference to class template instantiation 'boost::unit_test::callback0<>' being compiled 1>C:\Users\mjackson\Workspace\boost-1.41.0.cmake0\boost/smart_ptr/shared_ptr.hpp(231) : error C2872: 'detail' : ambiguous symbol 1> could be 'boost::detail' 1> or 'boost::unit_test::detail' 1>C:\Users\mjackson\Workspace\boost-1.41.0.cmake0\boost/smart_ptr/shared_ptr.hpp(231) : error C2872: 'detail' : ambiguous symbol 1> could be 'boost::detail' 1> or 'boost::unit_test::detail' 1>C:\Users\mjackson\Workspace\boost-1.41.0.cmake0\boost/smart_ptr/shared_ptr.hpp(231) : error C2872: 'detail' : ambiguous symbol 1> could be 'boost::detail' 1> or 'boost::unit_test::detail' 1>C:\Users\mjackson\Workspace\boost-1.41.0.cmake0\boost/smart_ptr/shared_ptr.hpp(451) : error C2872: 'detail' : ambiguous symbol 1> could be 'boost::detail' 1> or 'boost::unit_test::detail' I tried both the CMake versions of 1.41.0 and the normal bjam versions. Both gave the same error. _________________________________________________________ Mike Jackson mike.jackson(a)bluequartz.net BlueQuartz Software www.bluequartz.net Principal Software Engineer Dayton, Ohio

3 6

Re: [Boost-users] issues when building the boost trunk
by Vladimir Prus 05 Dec '09

05 Dec '09

Sean Farrow wrote: > Hi: > > There is currently an issue when trying to build the boost trunk. Below is > the output from the bjam program. > > C:/Program Files/boost/tools/build/v2\build-system.jam:903: syntax error at > keyword = > > C:/Program Files/boost/tools/build/v2\build-system.jam:903: syntax error at > keyword ; > > C:/Program Files/boost/tools/build/v2\build-system.jam:951: syntax error at > keyword } > > don't know how to make all > > ...found 1 target... > > ...can't find 1 target.... I do not get this error on the trunk. In fact I don't even have '=' on line 903. Are you sure this file is unmodified relative to SVN? Can you attach it? > The command line I'm using is bjam -toolset=msvc -stage This should be bjam toolset=msvc stage to be correct, and 'stage' is the default anyway. - Volodya

1 0

issues when building the boost trunk
by Sean Farrow 05 Dec '09

05 Dec '09

Hi: There is currently an issue when trying to build the boost trunk. Below is the output from the bjam program. C:/Program Files/boost/tools/build/v2\build-system.jam:903: syntax error at keyword = C:/Program Files/boost/tools/build/v2\build-system.jam:903: syntax error at keyword ; C:/Program Files/boost/tools/build/v2\build-system.jam:951: syntax error at keyword } don't know how to make all ...found 1 target... ...can't find 1 target.... The command line I'm using is bjam -toolset=msvc -stage Any help appreciated. Sean.

1 0

[Fwd: boost::function Small Buffer Optimization (SBO) and allocators]
by Chris Hite 04 Dec '09

04 Dec '09

I would really like to specify the SBO size on boost::function! How about changing the signature to?: template<typename Signature,std::size_t SBOSize=3*sizeof(void*)> class function; I've been trying to do a work around using the constructor with the allocator. I was going to define my own function class derived from the boost one, with a private one time allocator using a private buffer. This approach works find as long as constructors where the Functor type is present. The copy constructor and equals operators require serious hackery, since these constructors on boost function don't allow you to pass a new allow you to pass a new allocator. There's no template<typename Allocator> functionN(const functionN&, Allocator); This means that the Function constructor has to affect data underlying the const Function instance it's copying such that when the allocator is copied over it mutates into one that points at the private buffer of the new constructing instance. This is doable, but kind of scary since I'm making assumptions about when and how the Allocator is copied. This is also not such a wonderful solution, because the SBO is wasted. Any chance of just parameterizing the SBO size? Chris

2 1

boost::date visualizer in vs debugger
by Hicham Mouline 04 Dec '09

04 Dec '09

Hello Has anyone been able to write a msvc8/9 debugger visualizer for boost::gregorian::date? Given that class stores its date in an internal int, I wonder if it's doable to display the date in some human readable format at all? Rds,

1 0

[serialization] speed & size optimized binary archive
by Sebastian Karlsson 04 Dec '09

04 Dec '09

I'm trying to create a binary archive which manages serialization of derived type through base and archive versioning ( not on a type by type basis ). Looking at the binary archive which ships with the distribution it serializes a whole lot of things which is unnecessary for our use case. Going by the documentation and looking on how other archives are implemented I've created a basic implementation, which while compiling doesn't handle serialization of exported types. Even though the documentation is mostly great, this is a small area which seems to be left out, namely the requirements of an archive to be able to serialize / deserialize exported types properly. Looking at the provided archive types it's not clearly distinguishable exactly what's needed for this functionality. The documentation mentions BOOST_SERIALIZATION_REGISTER_ARCHIVE, which is used for the archive. Also, it would be great to know more in depth what actually gets serialized, even if it's subject of change for newer versions. For example, I'm interested in knowing how serialization of exported types will impact archive size. I'm thinking just an extra id per instance? Reading the documentation I got a hunch that extra meta data on a per type basis gets serialized to the archive as well. Under "Types used by the serialization library" several types are mentioned, which of these can be ignored for our use case? This is a reduced form of the output archive which together with an analogous input archive doesn't manage to serialize derived types through their base even if exported, checked to work with the supplied binary archive type. class BinaryOArchive : public boost::archive::detail::common_oarchive< BinaryOArchive > { typedef std::ostream Sink; friend class boost::archive::save_access; template< typename Type > void save( Type& a_Type ) { m_Out.write( reinterpret_cast< const char* >( &a_Type ), sizeof( Type ) ); } public: BinaryOArchive( Sink& a_Out ) : m_Out( a_Out ) {} void save_binary( void *a_Address, std::size_t a_Count ) { m_Out.write( static_cast< const char* >( a_Address ), a_Count ); } private: Sink& m_Out; }; #include "boost/archive/impl/archive_serializer_map.ipp" BOOST_SERIALIZATION_REGISTER_ARCHIVE(Altus::BinaryOArchive) BOOST_SERIALIZATION_USE_ARRAY_OPTIMIZATION(Altus::BinaryOArchive)

3 5

[boost::any] struct tm with boost::any
by Pascal Kesseli 04 Dec '09

04 Dec '09

Hi everyone These two lines of code: any a = tm(); tm t = any_cast<tm>(a); result in a bad_any_cast exception: boost::bad_any_cast: failed conversion using boost::any_cast Is that a bug or what am I missing here? I am using MinGW version 4.4.0 and boost 1.40.0. Thanks for a quick reply and best regards Pascal

1 0

1_41_0 exposes macro collision with thread
by Stonewall Ballard 04 Dec '09

04 Dec '09

Just a heads-up that since 1_41_0 removes libs/thread/src/pthread/exceptions.cpp file from the thread library (its now header-only), it's exposed to any precompiled headers with XCode. If you're using Carbon or (I think) CoreFoundation, that defines a macro named "check", which causes compilation errors in exception/diagnostic_information.cpp. I've had to add #undef check in files that include boost to eliminate this problem. - Stoney -- Stonewall Ballard stoney(a)sb.org http://stoney.sb.org/

2 3

BGL: How to construct voronoy diagram?
by Arman Khalatyan 04 Dec '09

04 Dec '09

Hi, I need to have a voronoy digram over the point data. I would like to visit the facets around the given point and find the occupied volume. Let suppose I have a set of 3D points: typedef typeP struct{float x[3];}; std::vector<typeP> Pdata; How can I generate Voronoy diagram on top of this set? Is BGL situable with this job? thanks Arman.

3 6

[DateTime] Using the system's tzdata?
by Roland Bock 04 Dec '09

04 Dec '09

Hi, DateTime has the Time Zone Database and a respective .csv with time zone information which is probably outdated here and there, judging by the frequent updates of tzdata on Linux systems. I therefore wonder: is there an easy way to use the system's tzdata information in combination with boost::date_time? Regards, Roland

1 0

Compilation errors 1.39, 1.41
by Pfligersdorffer, Christian 04 Dec '09

04 Dec '09

Hello all, I do not always find time to update our project to use the latest and greatest boost version but occasionally I do. At the moment I try to move to at least version 1.39 for my target (power-pc, 32-bit, embedded linux, gcc-4.0.0 cross compiler) and see the following error when compiling the math libs: ./boost/math/special_functions/expm1.hpp:270: error: '::expm1l' has not been declared With version 1.41 it's even more severe since bjam exits with an error before any compilation can take place: error: Duplicate name of actual target: <pstage/lib>libboost_date_time.so.1.41.0 error: previous virtual target { common%common.copy-libboost_date_time.so.1.41.0.SHARED_LIB { gcc%gcc.link.dll-libboost_date_time.so.1.41.0.SHARED_LIB { gcc%gcc.compile.c++-gregorian/greg_month.o.OBJ { gregorian/greg_month.cpp.CPP } } { gcc%gcc.compile.c++-gregorian/greg_weekday.o.OBJ { gregorian/greg_weekday.cpp.CPP } } { gcc%gcc.compile.c++-gregorian/date_generators.o.OBJ { gregorian/date_generators.cpp.CPP } } } } error: created from ./stage-proper error: another virtual target { common%common.copy-libboost_date_time.so.1.41.0.SHARED_LIB { gcc%gcc.link.dll-libboost_date_time.so.1.41.0.SHARED_LIB { gcc%gcc.compile.c++-gregorian/greg_month.o.OBJ { gregorian/greg_month.cpp.CPP } } { gcc%gcc.compile.c++-gregorian/greg_weekday.o.OBJ { gregorian/greg_weekday.cpp.CPP } } { gcc%gcc.compile.c++-gregorian/date_generators.o.OBJ { gregorian/date_generators.cpp.CPP } } } } error: created from ./stage-proper error: added properties: <debug-symbols>off <define>NDEBUG <inlining>full <optimization>speed <runtime-debugging>off <variant>release error: removed properties: <debug-symbols>on <inlining>off <optimization>off <runtime-debugging>on <variant>debug /home/cpf/boost_1_41_0/tools/build/v2/build/virtual-target.jam:490: in actualize-no-scanner from module object(file-target)@4875 /home/cpf/boost_1_41_0/tools/build/v2/build/virtual-target.jam:135: in object(file-target)(a)4875.actualize from module object(file-target)@4875 /home/cpf/boost_1_41_0/tools/build/v2/build-system.jam:717: in load from module build-system /home/cpf/boost_1_41_0/tools/build/v2/kernel/modules.jam:283: in import from module modules /home/cpf/boost_1_41_0/tools/build/v2/kernel/bootstrap.jam:142: in boost-build from module /home/cpf/boost_1_41_0/boost-build.jam:17: in module scope from module I hope someone can look into this. Regards, -- Christian Pfligersdorffer Software Engineering http://www.eos.info

1 0

boost::variant and SFINAE
by Jonathan Chambers` 03 Dec '09

03 Dec '09

I'm using boost::variant in the following manner struct Visitor : boost::static_visitor<> { void operator()(int &i) const { i = 1; } }; boost::variant<int, char> var = 0; boost::apply_visitor(Visitor(), 0); I'm trying to get the program to compile if the variant takes on the guise of an int (because I've implemented void operator()(int &i) const, but not compile if I make the variant take the guise of a char e.g. boost::variant<int, char> var = 'a'; because I've not implemented the void operator()(char &c) const Can anyone think of a way of doing this, maybe using SFINAE (Substitution Failure Is Not An Error) I'm thinking of doing something along the lines of : template <typename T> struct SetObj; template <> struct SetObj<int> { void operator()(int &obj) const { obj = 1; } } struct Visitor : boost::static_visitor<> { template <typename T> void operator()(T& obj) const { SetObj<T>()(obj); } }; But not sure how to take it to the next level to get the desired behaviour. _________________________________________________________________ Have more than one Hotmail account? Link them together to easily access both http://clk.atdmt.com/UKM/go/186394591/direct/01/

4 3

Problem using enable_if with gcc 3.4.4
by gao_bolin＠voila.fr 03 Dec '09

03 Dec '09

Hi, I am having some trouble using enable_if with gcc 3.4.4 (code below). Basically it is working as expected with functions ("bar"), but using it on member functions of a class ("Foo"), I am getting the error that this member function cannot be overloaded. Visual 2008 and gcc4 seem to be ok with it though. Any explanation and work around appreciated. B. -- #include <iostream> #include <boost/type_traits.hpp> #include <boost/utility/enable_if.hpp> // This won't compile with gcc 3.4.4 class Foo { public: template < typename T > typename boost::enable_if<boost::is_same<T, int>, T>::type bar(int x) { std::cout << "A" << std::endl; return x; } template < typename T > typename boost::disable_if<boost::is_same<T, int>, T>::type bar(int x) { std::cout << "B" << std::endl; return x; } }; // this would. template < typename T > typename boost::enable_if<boost::is_same<T, int>, T>::type bar(int x) { std::cout << "A" << std::endl; return x; } template < typename T > typename boost::disable_if<boost::is_same<T, int>, T>::type bar(int x) { std::cout << "B" << std::endl; return x; } int main() { bar<int>(1); bar<double>(1); Foo f; f.bar<int>(1); f.bar<double>(1); return 0; } ____________________________________________________ Michael Jackson, Susan Boyle, Black Eyed Peas ... Retrouvez leurs derniers titres sur http://musiline.voila.fr

2 1

xpressive compilation error
by Pablo Hernández Valdés 03 Dec '09

03 Dec '09

Hello, I used to had an old version of boost (I don't remember exactly which) and my code worked fine. Now I updated to the last version and I started to receive compilation errors in linux when using a std::vector with regular expressions from boost::xpressive, in windows it compiles fine. This code doesn't compile: #include <vector> #include <boost/xpressive/xpressive.hpp> typedef boost::xpressive::basic_regex<std::string::const_iterator> regex_t; int main(int argc, char* argv[]) { std::vector<regex_t> vector; vect.push_back(regex_t()); return 0; } Compiler output: cd '/home/segurmatica/console_filter/debug' && WANT_AUTOCONF_2_5="1" WANT_AUTOMAKE_1_6="1" LC_MESSAGES="C" LC_CTYPE="C" gmake -k gmake all-recursive Making all in src compiling console_filter.cpp (g++) In file included from /usr/local/lib/gcc/i686-pc-linux-gnu/4.4.2/../../../../include/c++/4.4.2/vector:63, from /home/segurmatica/console_filter/src/console_filter.cpp:1: /usr/local/lib/gcc/i686-pc-linux-gnu/4.4.2/../../../../include/c++/4.4.2/bits/stl_construct.h: In static member function 'static void std::_Destroy_aux<<anonymous> >::__destroy(_ForwardIterator, _ForwardIterator) [with _ForwardIterator = boost::xpressive::basic_regex<__gnu_cxx::__normal_iterator<const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >*, bool <anonymous> = false]': /usr/local/lib/gcc/i686-pc-linux-gnu/4.4.2/../../../../include/c++/4.4.2/bits/stl_construct.h:116: instantiated from 'void std::_Destroy(_ForwardIterator, _ForwardIterator) [with _ForwardIterator = boost::xpressive::basic_regex<__gnu_cxx::__normal_iterator<const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >*]' /usr/local/lib/gcc/i686-pc-linux-gnu/4.4.2/../../../../include/c++/4.4.2/bits/stl_construct.h:142: instantiated from 'void std::_Destroy(_ForwardIterator, _ForwardIterator, std::allocator<_T2>&) [with _ForwardIterator = boost::xpressive::basic_regex<__gnu_cxx::__normal_iterator<const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >*, _Tp = boost::xpressive::basic_regex<__gnu_cxx::__normal_iterator<const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >]' /usr/local/lib/gcc/i686-pc-linux-gnu/4.4.2/../../../../include/c++/4.4.2/bits/stl_vector.h:313: instantiated from 'std::vector<_Tp, _Alloc>::~vector() [with _Tp = boost::xpressive::basic_regex<__gnu_cxx::__normal_iterator<const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, _Alloc = std::allocator<boost::xpressive::basic_regex<__gnu_cxx::__normal_iterator<const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >]' /home/segurmatica/console_filter/src/console_filter.cpp:8: instantiated from here /usr/local/lib/gcc/i686-pc-linux-gnu/4.4.2/../../../../include/c++/4.4.2/bits/stl_construct.h:93: error: no matching function for call to '_Destroy(const boost::proto::exprns_::expr<boost::proto::tag::address_of, boost::proto::argsns_::list1<boost::xpressive::basic_regex<__gnu_cxx::__normal_iterator<const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >&>, 1l>)' gmake[2]: *** [console_filter.o] Error 1 gmake[2]: Target `all' not remade because of errors. gmake[2]: Nothing to be done for `all-am'. gmake[1]: *** [all-recursive] Error 1 gmake: *** [all] Error 2 *** Exited with status: 2 *** I'm using gcc 4.4.2 and boost 1.41 Thanks in advance, Pablo -- View this message in context: http://old.nabble.com/xpressive-compilation-error-tp26609113p26609113.html Sent from the Boost - Users mailing list archive at Nabble.com.

3 3

problems with boost::thread::native_handle()
by Carlos Casado Cascado 03 Dec '09

03 Dec '09

Hello, my name is Carlos Casado, i work at the Malaga univeristy in Spain. I´m working with a robotic arm and we use boost thread library. We need give some thread priority, we want use the thread's original handle (pthread) because we can manage priority with pthread_setschedparam () . The problem is that we can´t use native_handle() because it is not defined. We have a RT ubuntu machine with boost thread 1.35 version Forgive my english errors. And thanks for your help

2 2

[Serialization] Does it leak memory when applied to shared_ptr?
by Peng.Huang 03 Dec '09

03 Dec '09

When used for serialize the shared pointer, memory leak occurs. I am not sure that is due to the internal bug or the wrong use of serialization library. The following is test code: ============================================================================ ====== #include <iostream> #include <cstddef> #include <fstream> #include <string> #include <cstdio> #include <boost/config.hpp> #include <boost/archive/tmpdir.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/shared_ptr.hpp> class A{ private: friend class boost::serialization::access; int x; template<class Archive> void serialize(Archive& ar, const unsigned int /* file version */) { ar & x; } public: static int count; A(){++count; std::cout<<"A ctor"<<std::endl;} virtual ~A(){--count;std::cout<<"A dtro"<<std::endl;} }; int A::count = 0; int main(int /* argc */, char /*argv[] */){ std::string filename(boost::archive::tmpdir()); filename += "/testfile"; boost::shared_ptr<A> spa(new A); { std::ofstream ofs(filename.c_str()); boost::archive::text_oarchive oa(ofs); oa << spa; } spa.reset(); { std::ifstream ifs(filename.c_str()); boost::archive::text_iarchive ia(ifs); ia >> spa; } spa.reset(); std::cout << std::endl; return 0; } ============================================================================ ====== The output is: A ctor A dtor A ctor Valgrind report memory leak of 8 bytes, just the size of class A.

2 1

compare strings??
by pedro chaparro 03 Dec '09

03 Dec '09

hi, i need to know how to compare two strings S1 and S2 , i've found fuction is_iequal and is_equal but i dont understand how use it =(, can anyone give me a example? thanks <http://www.boost.org/doc/libs/1_41_0/doc/html/boost/algorithm/is_iequal.html> -- Ing Pedro Alonso Chaparro Valero Ciudad Politecnica de la Innovación iTEAM - Mobile Communications Group Polytechnic University of Valencia C\ Camino de Vera S/N, Edificio 8G 46022 Valencia, Spain

4 5

boost::thread and SunStudio
by Frank Meerkötter 03 Dec '09

03 Dec '09

Hi, i was trying to compile boost (1.40) with SunStudio11 but failed. By searching around a little bit i found this mail by Steven Watanabe http://article.gmane.org/gmane.comp.lib.boost.user/48995 The patch mentioned in the mail fixes my problem but i am wondering why it was not applied to the 1.40 release? KR, Frank

1 0

boost asio - async_read and deadline_timer don't call their handler functions
by Gözde Bahar KOŞ 03 Dec '09

03 Dec '09

Hello, I want to use asio library for my serial communication module but I'm having trouble on asynchronous functionality. In the following code block, I wanted to read 5 bytes from the first serial port of my computer in 10 seconds. But none of the handler functions were called. Firstly I waited not inputing any bytes but timer did not call wait_handler. Secondly I sent 5 bytes in 10 seconds from the other computer but read_handler was not called. I could read the bytes using synchronous functions like read function, I mean there is nothing wrong with the communication. I tried this code both on a Windows and a Linux host but results were the same.. Can you please check what can be wrong with the following code? ************************************************************** #include <iostream> #include <boost/asio.hpp> #include <boost/asio/buffer.hpp> #include <boost/asio/deadline_timer.hpp> using namespace std; using namespace boost::asio; using namespace boost::system; using namespace boost::posix_time; struct wait_handler { void operator()(const error_code& ec){ cout << "Timeout!" << endl; } }; struct read_handler { void operator()(const error_code& ec, size_t bytes_transferred) { cout << "Data read!" << endl; } }; int main(int argc, char* argv[]) { char read_msg_[5]; io_service io; serial_port theport(io, "com1"); deadline_timer * timer = new deadline_timer(io); timer->expires_from_now(seconds(10)); wait_handler whandler; timer->async_wait(whandler); read_handler rhandler; async_read(theport, buffer(read_msg_, 5), rhandler); Sleep(30000); //30 seconds return 0; } ************************************************************** Best Regards, Gözde Bahar Koş ###################################################################### Dikkat: Bu elektronik posta mesaji kisisel ve ozeldir. Eger size gonderilmediyse lutfen gondericiyi bilgilendirip mesaji siliniz. Firmamiza gelen ve giden mesajlar virus taramasindan gecirilmekte, guvenlik nedeni ile kontrol edilerek saklanmaktadir. Mesajdaki gorusler ve bakis acisi gondericiye ait olup Aselsan A.S. resmi gorusu olmak zorunda degildir. ###################################################################### Attention: This e-mail message is privileged and confidential. If you are not the intended recipient please delete the message and notify the sender. E-mails to and from the company are monitored for operational reasons and in accordance with lawful business practices. Any views or opinions presented are solely those of the author and do not necessarily represent the views of the company. ######################################################################

2 2

autolinking problem with iostream bzip2 and zlib filters -- DLLs needed for some reason? (updated)
by ChristinaGE 03 Dec '09

03 Dec '09

Hello, I am using the boost iostreams with the bzip2 qnd zlib filters. I built boost according to the directions here: http://www.boost.org/doc/libs/1_40_0/libs/iostreams/doc/installation.html This created the following libraries in the boost/stage/lib directory: libboost_bzip2-vc90-mt libboost_bzip2-vc90-mt-1_40 libboost_bzip2-vc90-mt-gd libboost_bzip2-vc90-mt-gd-1_40 libboost_zlib-vc90-mt libboost_zlib-vc90-mt-1_40 libboost_zlib-vc90-mt-gd libboost_zlib-vc90-mt-gd-1_40 now, here is the problem.. on every machien I usually do this on, it "autolinks" these libraries.. I have just started to build my code on a new machine, and for some reason it is not autolinking them. So to get my code to work I have to manually add them to my dependencies list and also add the directory where they are located. >From the link above it seems not to autolink of you have the preprocessor variable BOOST_IOSTREAMS_NO_LIB defined, but I dont seem to have that defined anywhere. Does anyone know why these libraries may not be autolinked? Also, I just now noticed that I am required to have the bzip2 and zlib DLLs to run my application, when before I never needed them. Thanks! Christy

4 3

boost::any and const pointers
by James C. Sutherland 02 Dec '09

02 Dec '09

I have a map<string,any> that I would like to control access to so that if a pointer is put in the map, only a const pointer can be extracted. The following simple code illustrates the situation. //-------------------- <snip> -------------------------- typedef std::map<std::string,boost::any> Properties; template<typename T> void set( Properties& p, const std::string name, const T t ) { p[name] = t; } template<typename T> const T get( const Properties& p, const std::string name ) { const Properties::const_iterator iprop=p.find(name); try{ const T t = boost::any_cast<const T>(iprop->second); return t; } catch(const boost::bad_any_cast &){ throw std::runtime_error("bad cast"); } } int main() { Properties p; int i=1; set(p,"int",i); set(p,"int*",&i); int* j = get<int*>(p,"int*"); // I don't want this to compile const int* k = get<int*>(p,"int*"); // I want this to compile fine. } //-------------------- </snip> ------------------------- Currently this whole code compiles without trouble, but I don't want to allow a non-const pointer to be extracted. Any ideas of how to accomplish this? Thanks for any tips!

4 8

boost file system, copy directories, create directory structure
by Avi Bahra 02 Dec '09

02 Dec '09

With boost 1.39 file system, is it possible to copy directories . ie recursive copy likewise given a path, need a way of creating the directories ? Could have missed this, but could not find such functionality in boost file system -- Best regards, Ta, Avi

2 1

Is GCC
by hce 02 Dec '09

02 Dec '09

Hi, I am using gcc version 4.3.0 and /lib64/libc-2.8.so on fedora 9, is it stable to use std::vector and std::map to contain shared_ptr<MyObject> MyObjectPtr? I've got libc.so Segmentation fault while accessing vector and map contain MyObjectPtr. Thank you. Kind regards, Jupiter

3 2

[property_tree] utf8 and others
by Sergei Politov 02 Dec '09

02 Dec '09

Hi, I'm playing with new boost library property_tree. And I have several questions regarding it. 1) Suppose there is xml file with utf8 encoding. What is the best way to populate it into wptree? 2) How can I save wptree into xml file with utf8 encoding. Unfortunately write_xml requires wostream. 3) Is there something like map operator[]? I.e. I need the following behavior: wptree & something(some_path) { boost::optional<wptree &> child = my_tree.get_child(some_path); if(child) return child.get(); else return my_tree.put_child(some_path); } Best Regards, Sergei

2 2

default value of program options
by Axel 02 Dec '09

02 Dec '09

Hi I m using program options classes to handles command line arguments (Boost version 1.35, Debian lenny packages). I don't manage to get this code work : boost::program_options::options_description cmd_line_options_("Command line options") ; boost::program_options::variables_map current_options_ ; int port_ = 0 ; cmd_line_options_.add_options() ("port,p", boost::program_options::value<int>(&port_), "specify the destination port to use") ; try { boost::program_options::store(boost::program_options::command_line_parser(argc, argv).options(cmd_line_options_).run(), current_options_) ; } catch(po::error &e) { cout << "Error when parsing command line arguments: " << e.what() << "\n" ; } cout << port_ << ":" << current_options_["port"].as<int>() << endl ; When executing : ./foo --port=12345, the output is : 0:12345 The port_ variable value remains to be 0 when the current_options_ variable hold the right value (12345). Could someone tell me what am I doing wrong ? Thanks

2 2

Boost 1.41 compile error with gcc 4.2.4 on Solaris Sparc
by Teme 02 Dec '09

02 Dec '09

Hi, I have a problem to compile Boost 1.39 or 1.40 ro 1.41 on Solaris Sparck with gcc 4.2.4. I am tried to compile with bjam and witj Cmake but I will get the same assembler message about illegal operands error. I noticed that when I defined BOOST_SP_USE_PTHREADS everything compiled fine until I tried to compile my software using Boost. Then I got the same assembler message about illegal operands. Do You have any advice? Best Regards, Teemu Here is the error while running make: ~/boost-1.41.0.cmake0/build % make [ 0%] Building CXX object libs/date_time/src/CMakeFiles/ boost_date_time-mt-shared.dir/gregorian/greg_month.cpp.o /var/tmp//ccXu6PKl.s: Assembler messages: /var/tmp//ccXu6PKl.s:580: Error: Illegal operands /var/tmp//ccXu6PKl.s:595: Error: Illegal operands /var/tmp//ccXu6PKl.s:8504: Error: Illegal operands make[2]: *** [libs/date_time/src/CMakeFiles/boost_date_time-mt- shared.dir/gregorian/greg_month.cpp.o] Error 1 make[1]: *** [libs/date_time/src/CMakeFiles/boost_date_time-mt- shared.dir/all] Error 2 make: *** [all] Error 2 Here is the generated configuration output from Cmake: tes@kielo <arkki_Z4.4-481_0/HAR1>:~/utils/boost-1.41.0.cmake0/build % cmake ../. -- -- Boost.CMake version = 1.41.0.cmake0 -- Boost compiler = gcc -- Boost toolset = gcc42 -- Boost platform = sunos -- Build name = gcc-4.2.4-sunos -- -- Looking for (optional) dependencies on the system -- -- BZip2: -- BZIP2_INCLUDE_DIR = /usr/include -- BZIP2_DEFINITIONS = -- BZIP2_LIBRARIES = /usr/lib/libbz2.so -- -- Doxygen: -- DOXYGEN_EXECUTABLE = /C2/tools/utils/bin/doxygen -- DOXYGEN_DOT_FOUND = YES -- DOXYGEN_DOT_EXECUTABLE = /C2/tools/utils/bin/dot -- DOXYGEN_DOT_PATH = /C2/tools/utils/bin -- -- Expat: -- Expat not found, some libraries or features will be disabled. -- See the documentation for Expat or manually set these variables: -- EXPAT_INCLUDE_DIR = EXPAT_INCLUDE_DIR-NOTFOUND -- EXPAT_LIBRARIES = -- -- ICU: -- Disabled since WITH_ICU=OFF -- -- MPI: -- MPI not found, some libraries or features will be disabled. -- See the documentation for MPI or manually set these variables: -- MPI_INCLUDE_PATH = MPI_INCLUDE_PATH-NOTFOUND -- MPI_COMPILE_FLAGS = -- MPI_LINK_FLAGS = -- MPI_LIBRARIES = MPI_LIBRARY-NOTFOUND -- -- Python: -- Disabled since WITH_PYTHON=OFF -- -- Xsltproc: -- XSLTPROC_EXECUTABLE = /usr/bin/xsltproc -- XSLTPROC_FLAGS = --xinclude -- -- Valgrind: -- Disabled since WITH_VALGRIND=OFF -- -- ZLib: -- ZLIB_INCLUDE_DIR = /usr/include -- ZLIB_LIBRARIES = /usr/lib/libz.so -- -- Install include dir: = include/boost-1.41.0 -- Install lib dir: = lib/boost-1.41.0 -- -- Reading boost project directories... -- -- + preprocessor -- + concept_check -- + property_map -- + config -- + mpl -- + type_traits -- + function -- + iterator -- + smart_ptr -- + exception -- + utility -- + integer -- + detail -- + static_assert -- + tuple -- + function_types -- + fusion -- + typeof -- + proto -- + intrusive -- + logic -- + numeric -- + xpressive -- + optional -- + tokenizer -- + io -- + bind -- + date_time -- + thread -- + regex -- +-- ICU (unicode) not available, disabling support. -- + algorithm -- + range -- + foreach -- + array -- + functional -- + unordered -- + pool -- + spirit -- + variant -- + serialization -- + format -- + math -- + multi_index -- + any -- + random -- + graph -- + python -- +-- disabled since PYTHON_FOUND is false -- + parameter -- + accumulators -- + system -- + asio -- + circular_buffer -- + ptr_container -- + assign -- + bimap -- + compatibility -- + conversion -- + crc -- + timer -- + test -- + disjoint_sets -- + dynamic_bitset -- + filesystem -- + interprocess -- + flyweight -- + gil -- + mpi -- +-- MPI not found, disabling. -- + graph_parallel -- +-- MPI not found, disabling. -- + iostreams -- + lambda -- + multi_array -- + program_options -- + rational -- + signals -- + signals2 -- + statechart -- + tr1 -- + units -- + wave -- -- Reading boost project TEST directories... -- -- -- Skipping config of tools since BUILD_TOOLS is "NONE" -- -- Configuring done -- Generating done -- Build files have been written to: /home/tes/utils/ boost-1.41.0.cmake0/build

2 2

Boost iostreams bzip2/zlib autolink problem
by ChristinaGE 02 Dec '09

02 Dec '09

Hello, I am using the boost iostreams with the bzip2 qnd zlib filters. I built boost according to the directions here: http://www.boost.org/doc/libs/1_40_0/libs/iostreams/doc/installation.html This created the following libraries in the boost/stage/lib directory: libboost_bzip2-vc90-mt libboost_bzip2-vc90-mt-1_40 libboost_bzip2-vc90-mt-gd libboost_bzip2-vc90-mt-gd-1_40 libboost_zlib-vc90-mt libboost_zlib-vc90-mt-1_40 libboost_zlib-vc90-mt-gd libboost_zlib-vc90-mt-gd-1_40 now, here is the problem.. on every machien I usually do this on, it "autolinks" these libraries.. I have just started to build my code on a new machine, and for some reason it is not autolinking them. So to get my code to work I have to manually add them to my dependencies list and also add the directory where they are located. >From the link above it seems not to autolink of you have the preprocessor variable BOOST_IOSTREAMS_NO_LIB defined, but I dont seem to have that defined anywhere. Does anyone know why these libraries may not be autolinked? Thanks! Christy

1 0

Re: [Boost-users] boost lambda for processing std::vector
by CR Koudella 02 Dec '09

02 Dec '09

Thanks for your answer. I see, I am pretty out of time here. I will look into phoenix. Can you provide an indication as to how you would handle my example with phoenix? That would be of great help. PS: If this message doesn't end up in the right thread, I apologize. I haven't figured out how to reply to the list... Do I have to not user list receive messages in a digest, but receive them one by one?

4 7

[OT] Interested in good (fast, robust) boost-based JSON API
by Dominique Devienne 02 Dec '09

02 Dec '09

Can anyone recommend one such good targeted library up to Boost's standards you've had good success with? (with a boost-like commercial friendly license) I guess it would need to be Tuple and Spirit based to be well integrated to Boost, although it could also have a polymorphic base json::value class too. Thanks for any insights. --DD PS: C++ JSON libraries listed at http://json.org/ don't seem quite up to the task, thus my post. PPS: If Spirit-based, a library using Spirit V2 as released in Boost 1.41 would be preferred.

4 7

How to return a Null pointer for shared_ptr
by hce 02 Dec '09

02 Dec '09

Hi, I defined a shared_ptr in to a map table. How can I return a NULL pointer in a function to search the table if it is not found as following example? typedef shared_ptr<int> IntPtr; typedef std::map<std::string IntPtr> MapTable; MapTable mt; IntPtr search(const std::string& key) { MapTable::const_iterator it = mt.find(key); if (it == mt.end()) { return NULL; // can't compile it?? } return it->second; } Thank you. Kind regards, Jupiter

3 2

[asio]boost1.40.0/gcc3.2.3 compile error
by victor 02 Dec '09

02 Dec '09

hello, can gcc3.2.3 compile boost1.40.0? On linux2.5/gcc3.2.3, I get compile error: invalid use of undefined type `struct boost::asio::detail::has_result_type<const char*>' /usr/local/boost_1_40_0/boost/asio/read_until.hpp:55: declaration of `struct boost::asio::detail::has_result_type<const char*>' invalid use of undefined type `struct boost::asio::detail::has_result_type<const char*>' /usr/local/boost_1_40_0/boost/asio/read_until.hpp:55: declaration of `struct boost::asio::detail::has_result_type<const char*>' enumerator value for `value' not integer constant make: *** [] 错误 1 All is ok in gcc4.1.2. How to compile the program using boost::asio on gcc3.2.3? Any suggestion is appreciated.

1 0

Re: [Boost-users] thread_group::interrupt_all is not reliable
by Stonewall Ballard 01 Dec '09

01 Dec '09

On Dec 1, 2009, at 6:05 PM, Roland Bock wrote: > Stonewall Ballard wrote: > [...] >>> In such a case, notify_one would wake less threads than required. But how can that happen with notify_one being called for each and every task? >> Take a look at this: >> <http://www.justsoftwaresolutions.co.uk/threading/implementing-a-thread-safe…> > [...] >> I added the comment to the code in case someone came along later and decided that it was wasteful to notify_all(). > > Hmm. Have you read the section "UPDATE" on the page? To me that says that the requirement for the notify_all has already been taken care of in the presented code (by calling it each time a task is pushed). Ah, I'd missed that. Thanks for pointing it out. It takes several readings to understand all this. >> My code is running in the idle loop of a dialog window, so I had to avoid blocking the producer for more than a moment. Since there could be many more available tasks than threads, a queue was the obvious choice. > > Yes, a blocking dialog would be bad. I am using the threadpool for a merge process which can delegate the processing of chunks to its workers. At the time I wrote it, I thought that blocking would not be problem (and in the intended scenario it isn't), because I can rarely use all available threads due to the sheer size of the chunks. The merger blocks that anyway. > > But after today, I think I will change my pool. Limiting the number of tasks is part of the merge logic, the pool should not do something like that. May as well code a general-purpose pool so that it's debugged by the time you need it for another program. Thanks again for your help. - Stoney -- Stonewall Ballard stoney(a)sb.org http://stoney.sb.org/

1 0

thread_group::interrupt_all is not reliable
by Stonewall Ballard 01 Dec '09

01 Dec '09

I've discovered that under circumstances apparently related to timing and load, sending interrupt_all to a thread_group when all the threads are waiting on a boost::condition_variable leaves one thread waiting about 1/3 of the time. This is with boost 1_40_0 running on Mac OS X 10.6.2, with 32-bit boost libraries. Boost uses the posix thread system here. I boiled my app down to some test code that runs as a command-line app. It's a bit longer than I'd like, but this configuration seems to be necessary to invoke the problem. The test uses a queue to pass "tasks" from the main thread to worker threads, and another queue to pass "results" back to the main thread. The problem is most apparent when all the tasks are finished and the queue empties, so that all the worker threads are waiting on the input queue when the main thread sends interrupt_all. I've looked at the waiting thread in a debugger when this happens, and found that it has been interrupted, but is still waiting on the condition. It looks like it just got missed by the interrupt_all. This is more likely to happen when there are a lot of worker threads (16, or one per core in my testing). The test code is parked at <http://sb.org/ThreadTest.zip>, 20KB. It's an XCode 3.2 project, but the five source files could be readily compiled and run in any Unix environment. I don't see any errors in the code that could cause these failures. There is a work-around, which is to interrupt the waiting thread again. This required a modified version of thread_group so I could do a timed_join_all on it. I welcome any suggestions about what could be wrong here, or ways to simplify the test to make it more suitable for a bug report. - Stoney -- Stonewall Ballard stoney(a)sb.org http://stoney.sb.org/

2 3

[coroutines] Stack corruption bug
by Nat Goodspeed 01 Dec '09

01 Dec '09

My colleague Mark Palange discovered a Boost.Coroutines scenario that can lead to stack corruption. The normal usage for a boost::coroutines::coroutine object is to repeatedly invoke its operator() method. Each entry to this method rebinds the coroutine_impl::m_result pointer to the address of a stack result_slot_type* variable. So far, so good. When a coroutine waits for a boost::coroutines::future object, the original operator() call exits, destroying the stack result_slot_type* variable. When that coroutine is later resumed by calling the future object's callback, coroutine_impl::m_result is *not* rebound: it's left set to the now-destroyed (possibly reused) address. Finally, when the coroutine exits, coroutine_impl::bind_result() blithely assigns through *m_result, thereby overwriting that slot on the stack. Now we're in Undefined Behavior territory. The attached patch file addresses the problem in two ways: 1. Each of the three methods that calls coroutine_impl::bind_result_pointer() (coroutine::call_impl(), coroutine::call_impl_nothrow(), coroutine_impl::run()) now uses an instance of a new helper class coroutine_impl::local_result_slot_ptr. This class contains the result_slot_type* variable and calls bind_result_pointer(&member) when constructed, wrapping the existing logic. But it also calls bind_result_pointer(NULL) when destroyed. This way, an invalid attempt to dereference *m_result is more likely to self-identify than to lead to mysterious, not obviously related side effects. 2. coroutine_impl::bind_result() now avoids the assignment if m_result is NULL. Possibly there are better behaviors for bind_result() on NULL m_result than silently bypassing the assignment, but this works for us, since our typical coroutine is void-valued anyway. If you're using boost::coroutines::coroutine and waiting on a boost::coroutines::future, please apply the attached patch to your copy of the Boost.Coroutines library. Alternatively, update the whole library with the new tarball: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-… diff -rc boost-coroutine/boost/coroutine/coroutine.hpp /Users/nat/linden/viewer-20-topush/libraries/include/boost/coroutine/coroutine.hpp *** boost-coroutine/boost/coroutine/coroutine.hpp Wed Apr 29 14:41:05 2009 --- /Users/nat/linden/viewer-20-topush/libraries/include/boost/coroutine/coroutine.hpp Tue Dec 1 15:25:52 2009 *************** *** 258,265 **** result_type call_impl(arg_slot_type args) { BOOST_ASSERT(m_pimpl); m_pimpl->bind_args(&args); ! result_slot_type * ptr; ! m_pimpl->bind_result_pointer(&ptr); m_pimpl->invoke(); return detail::fix_result<result_slot_traits>(*m_pimpl->result()); --- 261,267 ---- result_type call_impl(arg_slot_type args) { BOOST_ASSERT(m_pimpl); m_pimpl->bind_args(&args); ! BOOST_DEDUCED_TYPENAME impl_type::local_result_slot_ptr ptr(m_pimpl); m_pimpl->invoke(); return detail::fix_result<result_slot_traits>(*m_pimpl->result()); *************** *** 270,277 **** call_impl_nothrow(arg_slot_type args) { BOOST_ASSERT(m_pimpl); m_pimpl->bind_args(&args); ! result_slot_type * ptr; ! m_pimpl->bind_result_pointer(&ptr); if(!m_pimpl->wake_up()) return detail::optional_result<result_type>(); --- 272,278 ---- call_impl_nothrow(arg_slot_type args) { BOOST_ASSERT(m_pimpl); m_pimpl->bind_args(&args); ! BOOST_DEDUCED_TYPENAME impl_type::local_result_slot_ptr ptr(m_pimpl); if(!m_pimpl->wake_up()) return detail::optional_result<result_type>(); diff -rc boost-coroutine/boost/coroutine/detail/coroutine_impl.hpp /Users/nat/linden/viewer-20-topush/libraries/include/boost/coroutine/detail/coroutine_impl.hpp *** boost-coroutine/boost/coroutine/detail/coroutine_impl.hpp Sun Aug 20 13:11:09 2006 --- /Users/nat/linden/viewer-20-topush/libraries/include/boost/coroutine/detail/coroutine_impl.hpp Tue Dec 1 16:04:48 2009 *************** *** 89,95 **** } void bind_result(result_slot_type* res) { ! *m_result = res; } // Another level of indirecition is needed to handle --- 89,98 ---- } void bind_result(result_slot_type* res) { ! // This used to be unconditional. But m_result isn't always valid. ! if (m_result) { ! *m_result = res; ! } } // Another level of indirecition is needed to handle *************** *** 102,120 **** return m_result; } // This function must be called only for void // coroutines. It wakes up the coroutine. // Entering the wait state does not cause this // method to throw. void run() { arg_slot_type void_args; - result_slot_type * ptr = 0; // This dummy binding is required because // do_call expect args() and result() // to return a non NULL result. bind_args(&void_args); ! bind_result_pointer(&ptr); this->wake_up(); } protected: --- 105,157 ---- return m_result; } + /// This helper class packages data/logic originally found inline in + /// coroutine::call_impl() and call_impl_nothrow(), also + /// coroutine_impl::run(). + class local_result_slot_ptr + { + public: + local_result_slot_ptr(pointer pimpl): + m_pimpl(pimpl), + m_ptr(NULL) + { + m_pimpl->bind_result_pointer(&m_ptr); + } + ~local_result_slot_ptr() + { + // In the original use case, a coroutine could only be resumed by + // calling coroutine::operator() again, which would rebind the + // result pointer to a new valid value. But with the introduction + // of futures, it's possible to suspend a coroutine by waiting on + // a future object -- thus destroying the local result_slot_type* + // -- then resume that coroutine by calling the future's callback, + // bypassing coroutine::operator(). This used to leave an old, + // invalid result pointer in effect. Subsequent coroutine exit + // wrote through that pointer, munging a word of stack. Now we + // make a point of setting the bound result pointer NULL when the + // result_slot_type* to which it pointed vanishes, so that any + // attempt to dereference it will at least self-identify -- + // instead of producing arbitrary undefined behavior. + m_pimpl->bind_result_pointer(NULL); + } + + private: + pointer m_pimpl; + result_slot_type* m_ptr; + }; + // This function must be called only for void // coroutines. It wakes up the coroutine. // Entering the wait state does not cause this // method to throw. void run() { arg_slot_type void_args; // This dummy binding is required because // do_call expect args() and result() // to return a non NULL result. bind_args(&void_args); ! local_result_slot_pointer(this); this->wake_up(); } protected: diff -rc boost-coroutine/boost/coroutine/detail/self.hpp /Users/nat/linden/viewer-20-topush/libraries/include/boost/coroutine/detail/self.hpp *** boost-coroutine/boost/coroutine/detail/self.hpp Sun Aug 20 13:11:09 2006 --- /Users/nat/linden/viewer-20-topush/libraries/include/boost/coroutine/detail/self.hpp Wed Aug 5 16:50:17 2009 *************** *** 217,222 **** --- 217,235 ---- BOOST_ASSERT(m_pimpl); return m_pimpl->pending(); } + + /// @c true only if this @c self object was created by the passed @a coroutine + template <typename SomeCoroutine> + bool is_from(const SomeCoroutine& coroutine) const + { + // get_impl() only accepts non-const ref... a mistake, IMO. + return static_cast<void*>(coroutine_accessor::get_impl(const_cast<SomeCoroutine&>(coroutine)).get()) == + static_cast<void*>(m_pimpl); + } + + /// opaque token used to correlate this 'self' with its corresponding coroutine + void* get_id() const { return m_pimpl; } + private: coroutine_self(impl_type * pimpl, detail::init_from_impl_tag) : m_pimpl(pimpl) {}

1 0

Re: [Boost-users] [OT] Interested in good (fast, robust)
by Richard Ulrich 01 Dec '09

01 Dec '09

I'm using json_spirit from http://www.codeproject.com/KB/recipes/JSON_Spirit.aspx for parsing big but simple json files. So far I didn't have any problems with it. It's still based on classic spirit. Don't know if and when it will switch to spirit 2. Rgds Richard On Tue, 2009-12-01 at 12:00 -0500, boost-users-request(a)lists.boost.org wrote: > Date: Tue, 01 Dec 2009 17:38:36 +0100 > From: Sebastian Redl <sebastian.redl(a)getdesigned.at> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [OT] Interested in good (fast, robust) > boost-based JSON API > Message-ID: <4B15468C.7000309(a)getdesigned.at> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > Dominique Devienne wrote: > > Can anyone recommend one such good targeted library up to Boost's > > standards you've had good success with? (with a boost-like > commercial > > friendly license) > > > Boost.PropertyTree has some support for parsing and writing JSON, but > it > doesn't preserve types. > > Sebastian

3 2

[Ubuntu 8.04] Linking Problem in Eclipse with Boost 1.41 Libraries
by Brooks Garrison 01 Dec '09

01 Dec '09

Hello all, My question is concerning the Boost installation process. I am currently working on a machine that has Ubuntu 8.04 LTS. I have downloaded the latest copy of Boost (1.41.0) and am trying to successfully install it. I have followed the procedures for building the libraries such as Filesystem / Regex / Thread / etc. using both the bootstrap, "easy", method and the "build custom binaries" method. I'm using Eclipse as my C++ development environment and I can create programs that use the Boost headers (the ones that do not require compilation - ie. Lambda) just fine. When I try to implement the sample program that incorporates [regex], I am able to compile and link just fine. I've set the include directory to ( /usr/local/boost_1_41_0/prefix/include - prefix was just the name I gave the folder), the library search path to ( /usr/local/boost_1_41_0/prefix/lib ) and the library I wanted to link to, [regex], using (boost_regex - I have also tried boost_regex-gcc##-mt ). As I said though, when I try to run the program, I get the result: ./boost_regex_test: error while loading shared libraries: libboost_regex.so.1.41.0: cannot open shared object file: No such file or directory I have not specified that I was using shared libraries, so I do not understand why it is trying to look for them. If anyone could please clarify why this is happening, I'd be more than greatful. Just as an aside, I also tried downloading and installing Boost from the Synaptic Package Manager that comes with Ubuntu 8.04. I'm able to use all of the libraries when I do this, but I'd rather not because the version of Boost is 1.34.1 (quite archaic) and has cause problems because member variables have evolved and some no longer exist. Thanks again for any and all help.

2 10

lexical_cast and default params
by Noah Roberts 01 Dec '09

01 Dec '09

Running into something very strange with boost::lexical_cast in 1.39. This code works, but notice the f(). If I attempt to get rid of it and call boost::lexical_cast directly in the constructor for test I get this error: 1>d:\dev_workspace\experimental\scratch\scratch\main.cpp(16) : error C2783: 'Target boost::lexical_cast(const Source &)' : could not deduce template argument for 'Target' 1> d:\boostvs39\include\boost\lexical_cast.hpp(1164) : see declaration of 'boost::lexical_cast' This is hard for me to understand since I've given the target type as a template parameter....and the f() version works just fine. It even works if I make it inline as the lexical_cast function is. Any ideas? #include <boost/lexical_cast.hpp> #include <string> #include <iostream> template < typename R, typename T > R f(T const& x) { return boost::lexical_cast<R>(x); } template < typename T > struct test { test(std::string const& x = f<std::string>(T())) : test_string(x) {} std::string test_string; }; int main() { test<int> t; std::cout << t.test_string; std::cout << boost::lexical_cast<std::string>(int()); std::cin.get(); }

1 1

[Serialization - 1.35] Crash while serializing
by Soumen 01 Dec '09

01 Dec '09

Hi, I've following class hierarchy: FilterCondition <---+--- CompositeCondition | +--- ConcreteCondition FilterCondition is ABC. FilterCondition has certain data members which I need to serialize. I already have another class "Table" for which serialization works perfectly. Now, I've added a pointer of type "FilterCondition" as a member to "Table". Say, the member name is "filterCond_". Now, as soon as I add following line in Table::serialize(), I get a crash : ar & filterCond_; This happens even though I make body of FilterCondition::serialize(), CompositeCondition::serialize() and ConcreteCondition::serialize() empty. In Table::serialize(), I've verified that filterCond_ is a valid pointer. I've declared FilterCondition as abstract through BOOST_CLASS_ABSTRACT macro as well. Following is top of stack from gdb: ------------------------------------------------------------------------------------------------ (gdb) where #0 0x0000000000fcfee6 in boost::serialization::detail::extended_type_info_typeid_0::less_than () #1 0x0000000000fcf703 in boost::serialization::extended_type_info::operator< () #2 0x0000000000fcf78b in boost::serialization::extended_type_info::find () #3 0x0000000000fcffea in boost::serialization::detail::extended_type_info_typeid_0::get_derived_extended_type_info () #4 0x000000000136ca0c in boost::serialization::detail::extended_type_info_typeid_1<FilterCondition const>::get_derived_extended_type_info (t=@0x19c6e390) at /remote/arch-tools/boost/qsc-b/1_35_0/include/boost/serialization/extended_type_info_typeid.hpp:92 #5 0x000000000136ca5b in boost::archive::detail::save_pointer_type<boost::archive::binary_oarchive, FilterCondition*>::polymorphic<FilterCondition>::save (ar=@0x7fbfffc410, t=@0x19c6e390, bpos_ptr=0x0) at /remote/arch-tools/boost/qsc-b/1_35_0/include/boost/archive/detail/oserializer.hpp:385 #6 0x000000000136cbed in boost::archive::detail::save_pointer_type<boost::archive::binary_oarchive, FilterCondition*>::save<FilterCondition> (ar=@0x7fbfffc410, t=@0x19c6e390, bpos_ptr=0x0) at /remote/arch-tools/boost/qsc-b/1_35_0/include/boost/archive/detail/oserializer.hpp:434 #7 0x000000000136cc4a in boost::archive::detail::save_pointer_type<boost::archive::binary_oarchive, FilterCondition*>::invoke (ar=@0x7fbfffc410, t=0x19c6e390) at /remote/arch-tools/boost/qsc-b/1_35_0/include/boost/archive/detail/oserializer.hpp:462 #8 0x000000000136cc6c in boost::archive::save<boost::archive::binary_oarchive, FilterCondition*> (ar=@0x7fbfffc410, t=@0x19c6d820) at /remote/arch-tools/boost/qsc-b/1_35_0/include/boost/archive/detail/oserializer.hpp:532 #9 0x000000000136cc96 in boost::archive::detail::common_oarchive<boost::archive::binary_oarchive>::save_override<FilterCondition* const> (this=0x7fbfffc410, t=@0x19c6d820) at /remote/arch-tools/boost/qsc-b/1_35_0/include/boost/archive/detail/common_oarchive.hpp:64 #10 0x000000000136ccbb in boost::archive::array::oarchive<boost::archive::binary_oarchive>::save_override<FilterCondition*> (this=0x7fbfffc410, x=@0x19c6d820, version=0) at /remote/arch-tools/boost/qsc-b/1_35_0/include/boost/archive/array/oarchive.hpp:122 #11 0x000000000136cce3 in boost::archive::basic_binary_oarchive<boost::archive::binary_oarchive>::save_override<FilterCondition*> (this=0x7fbfffc410, t=@0x19c6d820) at /remote/arch-tools/boost/qsc-b/1_35_0/include/boost/archive/basic_binary_oarchive.hpp:64 #12 0x000000000136cd0b in boost::archive::binary_oarchive_impl<boost::archive::binary_oarchive, char, std::char_traits<char> >::save_override<FilterCondition* const> (this=0x7fbfffc410, t=@0x19c6d820) at /remote/arch-tools/boost/qsc-b/1_35_0/include/boost/archive/binary_oarchive_impl.hpp:45 #13 0x000000000136cd38 in boost::archive::detail::interface_oarchive<boost::archive::binary_oarchive>::operator<< <FilterCondition* const> (this=0x7fbfffc410, t=@0x19c6d820) at /remote/arch-tools/boost/qsc-b/1_35_0/include/boost/archive/detail/interface_oarchive.hpp:64 #14 0x000000000136cd69 in boost::archive::detail::interface_oarchive<boost::archive::binary_oarchive>::operator&<FilterCondition*> (this=0x7fbfffc410, t=@0x19c6d820) at /remote/arch-tools/boost/qsc-b/1_35_0/include/boost/archive/detail/interface_oarchive.hpp:72 #15 0x000000000136ce5a in Table::serialize<boost::archive::binary_oarchive> (this=0x19c6d750, ar=@0x7fbfffc410, version=0) at /remote/scratch/gsoumen/hiers/tmp.trunk/tools/code/tables/Table.h:178 #16 0x000000000136ce7f in boost::serialization::access::serialize<boost::archive::binary_oarchive, Table> (ar=@0x7fbfffc410, t=@0x19c6d750, file_version=0) at /remote/arch-tools/boost/qsc-b/1_35_0/include/boost/serialization/access.hpp:109 ------------------------------------------------------------------------------------------------ Is this a bug in serialization library? Regards, ~ Soumen -- View this message in context: http://www.nabble.com/-Serialization---1.35--Crash-while-serializing-tp2553… Sent from the Boost - Users mailing list archive at Nabble.com.

3 3

Boost Program Options: Just curiosity, why double dashes ?
by Mauricio Gomes 01 Dec '09

01 Dec '09

I am studying Boost Program Options library and I am curious, why was it choosen double dashes as the token to identify an option in the command line ? Example: my_program --help Would not a single dash be enough and less verbose ? What is the rationale behind that ? Thanks, -- Mauricio Gomes "Think globally, act locally".

5 4

Mac OSX - gcc crash
by Igor R 01 Dec '09

01 Dec '09

Hello, My question is not focused, but maybe someone had similar experience and could share his conslucions. I'm porting to iPhone (SDK 3.1.2, XCode3.2.1) rather big static library that uses boost very extensively. It compiles and works well under the simulator both in debug and in release modes. But when I try to compile it for the device, gcc4.2 crashes ("exists with code 1"). I found-out that if I do not generate debug symbols, the compilation succeeds. However, then I can't debug the application on iPhone - it doesn't stop on breakpoints and I can't step through the code (if the application would work on the device like it works on simulator, debugging wouldn't be an issue, but it doens't work for some reason). Again, I even don't know *where* the compiler crashes and whether it's related to boost headers or not, but any idea/experience would be greatly appreciated. Thanks.

3 3

serialization library leaks memory in its global object
by gast128 01 Dec '09

01 Dec '09

Dear all, we were transferring to Boost 1.41 but came across some serious issues in Boost.Serialization. The first is already adressed in a previous post, but now the M$ crt reports a memory leak when using Boost.Serialization in combination of pointers. I think it is located in 'basic_iarchive_impl::load_pointer' where an object is allocated and added to a global object ('object_id_vector') but never released. I know that we might end up here in an argument about the defintion of a memory leak, but the fact remains that the crt just reports it on program closure and until now we never had any reports of that type. If we have to think about every report dumped by the crt, it's just unacceptable. It's like a broken window syndrome; in the end u can not distinguish between false and correct reports. Code: #include <sstream> #include <boost\smart_ptr\make_shared.hpp> #include <boost\archive\xml_oarchive.hpp> #include <boost\archive\xml_iarchive.hpp> struct Foo { template <class Archive> void serialize(Archive& /*ar*/, const unsigned int /*version*/) { } }; int main() { #ifdef _DEBUG _CrtSetDbgFlag(_CRTDBG_ALLOC_MEM_DF | _CRTDBG_CHECK_ALWAYS_DF | _CRTDBG_LEAK_CHECK_DF); #endif std::stringstream sstr; boost::shared_ptr<Foo> ptrFoo = boost::make_shared<Foo>(); { boost::archive::xml_oarchive oa(sstr); oa << boost::serialization::make_nvp("v", ptrFoo); } boost::archive::xml_iarchive ia(sstr); ia >> boost::serialization::make_nvp("v", ptrFoo); return 0; }

3 5

How to get rid of compiler version in library names?
by dutchman1 01 Dec '09

01 Dec '09

Hi, I just installed Boost and noticed the library names all have the compiler/boost version in the file name, e.g. gcc41. libboost_date_time-gcc41-mt-1_39.a The program I'm trying to compiler only looks for the library name, e.g. libboost_date_time-mt.a. My error: error: Unable to find file or target named error: '/usr/lib/libboost_date_time-mt.a' error: referred from project at error: '.' How can I make boost install using the library names without compiler name/boost version? Thanks! -- View this message in context: http://old.nabble.com/How-to-get-rid-of-compiler-version-in-library-names--… Sent from the Boost - Users mailing list archive at Nabble.com.

3 2

Re: [Boost-users] Numpy ndarray as argument or return value using boost python
by OvermindDL1 01 Dec '09

01 Dec '09

On Mon, Nov 30, 2009 at 1:34 PM, Nyiro Gergo <gergo.nyiro(a)gmail.com> wrote: > - Hide quoted text - > - Show quoted text - > <http://groups.google.com/group/boost-list/browse_thread/thread/b491f5eb8cc8…> > > On Mon, Oct 12, 2009 at 7:09 AM, Pim Schellart <p.schell... > <http://groups.google.com/groups/unlock?_done=/group/boost-list/browse_threa…>@gmail.com> > wrote: >>> Hi Everyone, > >>> I tried to find a good example for this but after spending two days on >>> google and one day getting pyublas to compile I decided to call for >>> help. >>> I want to give a numpy ndarray as an argument to a c++ method, >>> calculate something and return the output as an ndarray to Python. >>> I would prefer not to use another library (such as PyUblas) for this >>> so I do not have to add another dependency to my program. >>> Since the latest information on boost python is quite outdated (uses >>> numeric) I would like to know the following. > >>> 1. Is boost python still maintained or should I switch to another tool. >>> 2. Is numpy supported, and if so, >>> 3. can someone give me a basic example of how to use it. > >> 1. Yes, Boost.Python is still maintained and works find. >> 2. Yes, Boost.Python supports any and all libraries that communicate >> through python, you would just use the ndarray just like any other >> Python Object. >> 3. Give an example of how you use it in Python and we can give you an >> example of how you would do it from the C++ side, it is a pretty >> direct 1-to-1 mapping (have you gone through the Boost.Python >> tutorials and documentation yet?). > > Hello, > > I read that post above on Boost-users mailing list, but I have no permission > required to post. To answer to the 3. point could you give me an example how > to solve this python code snippet in C++: >>>> parser = cParser('FileName') # that would be the C++ class (already >>>> implemented) >>>> TimeAndSignal = parser.getSignal('SignalName') # and this the >>>> questionable member function >>>> type(TimeAndSignal) > <type, 'list'> >>>> len(TimeAndSignal) > 2 >>>> type(TimeAndSignal[0]) > <type, 'ndarray'> >>>> type(TimeAndSignal[1]) > <type, 'ndarray'> >>>> import pylab >>>> pylab.plot(TimeAndSignal[0], TimeAndSignal[1]); pylab.show() >>>> Time, Signal = parser.getSignal('SignalName') # and this must work too >>>> pylab.plot(Time, Signal); pylab.show() > > Thanks for your help in advance. You should forward this to the Boost list. I am not home right now so cannot give a good example, so you would probably get a much better example from there. I am forwarding this response back to the Boost list. If I notice this later when I have free time, I will come up with examples for the above, but it really is very simple, should look at the examples included with Boost.Python.

1 0

Adding additional property in Boost graph object.
by Amanullah Yasin 30 Nov '09

30 Nov '09

Hi, Dear all I want to add one additional edge property in Boost graph object of type "bool". Please guide me how i can do it. I tried but not successful. ////////////////////// Here is the main definition of Boost graph object "slGraph" ///////////////////////////////////////////////////////////////////////// namespace boost { struct computable_object_t { typedef vertex_property_tag kind; }; } typedef boost::property<boost::vertex_index_t, unsigned int, boost::property<boost::computable_object_t, plComputableObject*> > slVertexProperty; typedef boost::property<boost::edge_weight_t, slScoreValueType> slEdgeProperty; typedef boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, \ slVertexProperty, slEdgeProperty> slGraph; typedef slGraph::vertex_descriptor slNode; typedef slGraph::edge_descriptor slEdge; typedef slGraph::vertex_iterator slNodeIterator; typedef slGraph::edge_iterator slEdgeIterator; typedef slGraph::out_edge_iterator slOutEdgeIterator; typedef slGraph::in_edge_iterator slInEdgeIterator; typedef slGraph::adjacency_iterator slOutNodeIterator; typedef slGraph::inv_adjacency_iterator slInNodeIterator; ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////// Thanks in advance. Amanullah YASIN PhD student Equipe COD (Connaissances et Décision) LINA (Laboratoire d'Informatique de Nantes Atlantique) Ecole Polytechnique de l'Université de Nantes La Chantrerie - rue Christian Pauc - BP 50609 44306 Nantes Cedex 3 FRANCE Mob# 06 99 07 49 71 Fix # 02 72 00 26 45 amanyasin@ gmail.com, hotmail.com, yahoo.com

2 1

Re: [Boost-users] [boost bimap]- question on use of optionalsorting predicate for set_of declarations
by Curtis Himel 30 Nov '09

30 Nov '09

"The thing is that you are using the left view of the bimap, and not the one you have customized. Try using the right view map, it should work as you expect." I didn't understand why switching views would work, and it didn't do what I wanted. (I tried it anyway.) If I use the right view, then I'm looking up the multiset ints with a unique short, right? I want to go the other way- I want to look up a sorted range of unique shorts from the right side with a non-unique int from the left side. I might have misunderstood you, but I don't see how using the right view works there. Thanks, Curtis _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ This e-mail and any files transmitted with it are confidential and intended solely for the use of the individual or entity to whom they are addressed. If you have received this e-mail in error please notify the originator of the message. This footer also confirms that this e-mail message has been scanned for the presence of computer viruses. Any views expressed in this message are those of the individual sender, except where the sender specifies and with authority, states them to be the views of Indra Systems, Inc.

2 1

std_hash_set_fwd.hpp:29: error: redeclared with 3 template parameter(s)
by Mathieu Malaterre 30 Nov '09

30 Nov '09

Has anyone seen this type of error before: /usr/include/boost/spirit/home/phoenix/stl/algorithm/detail/././std_hash_set_fwd.hpp:29: error: redeclared with 3 template parameter(s) /usr/include/c++/4.3/backward/hash_set:84: note: previous declaration ‘template<class _Value, class _HashFcn, class _EqualKey, class _Alloc> class __gnu_cxx::hash_set’ used 4 template parameter(s) /usr/include/boost/spirit/home/phoenix/stl/algorithm/detail/././std_hash_set_fwd.hpp:36: error: redeclared with 3 template parameter(s) /usr/include/c++/4.3/backward/hash_set:285: note: previous declaration ‘template<class _Value, class _HashFcn, class _EqualKey, class _Alloc> class __gnu_cxx::hash_multiset’ used 4 template parameter(s) make[2]: *** [Simulation/CMakeFiles/GraphicDisplay.dir/GraphicDisplay/Visualization.o] Error 1 System: debian stable $ gcc -dumpversion 4.3.4 $ apt-cache policy libboost-all-dev libboost-all-dev: Installed: 1.40.0.1 Candidate: 1.40.0.1 Version table: *** 1.40.0.1 0 200 http://ftp.fr.debian.org testing/main Packages 100 http://ftp.fr.debian.org unstable/main Packages 100 /var/lib/dpkg/status Thanks, -- Mathieu

2 2

asio to read device files
by Lloyd 30 Nov '09

30 Nov '09

Hi, In Windows we can open and read storage meidias by using the call CreateFile() and ReadFile() respecively. The device name is passed as a string to the CreateFile() call, as an example "PhysicalDrive1". Create file returns a handle of type "HANDLE". can I use this handle in asio in order to read a device file? Thanks, Lloyd ______________________________________ Scanned and protected by Email scanner

2 1

MultiArray and point-wise product
by Claudio Martella 30 Nov '09

30 Nov '09

Hello list, I'm trying to calculate point-wise product from a MultiArray (basically the adjacency list from the boost graph). Can anybody suggest how the point-wise product can be calculated in boost in the most efficient way (of course i can implement the function myself with a nested for())? For those not familiar with point-wise product, it's defined as: A[i,j] = B[i,j] * C[i,j] TIA /CM -- Claudio Martella Digital Technologies Unit Research & Development - Analyst TIS innovation park Via Siemens 19 | Siemensstr. 19 39100 Bolzano | 39100 Bozen Tel. +39 0471 068 123 Fax +39 0471 068 129 claudio.martella(a)tis.bz.it http://www.tis.bz.it Short information regarding use of personal data. According to Section 13 of Italian Legislative Decree no. 196 of 30 June 2003, we inform you that we process your personal data in order to fulfil contractual and fiscal obligations and also to send you information regarding our services and events. Your personal data are processed with and without electronic means and by respecting data subjects' rights, fundamental freedoms and dignity, particularly with regard to confidentiality, personal identity and the right to personal data protection. At any time and without formalities you can write an e-mail to privacy(a)tis.bz.it in order to object the processing of your personal data for the purpose of sending advertising materials and also to exercise the right to access personal data and other rights referred to in Section 7 of Decree 196/2003. The data controller is TIS Techno Innovation Alto Adige, Siemens Street n. 19, Bolzano. You can find the complete information on the web site www.tis.bz.it.

2 1

Re: [Boost-users] Two questions on boost::function
by CR Koudella 30 Nov '09

30 Nov '09

Thanks for your reply on this, too. Yes, I am beginning to look into phoenix. Here too, it would be of great help if you could indicate to me how you would handle my example with phoenix. Thanks, ChrisK

2 2

pow math function and bind in boost::lambda
by Conoscenza Silente 30 Nov '09

30 Nov '09

Hi All I tried to use pow function from <cmath> in a lamda function using boost::lamdba. Below the piece of code I used. Do you know what is wrong with it? Thank you very much. CS double l_tmp; double p_tmp; constant_type<double>::type h( constant(2.3) ); constant_type<double>::type g( constant(1.2) ); var_type<double>::type tmp( var(l_tmp) ); var_type<double>::type pow_tmp( var(p_tmp) ); std::for_each( x.begin(), x.end(),( tmp = 10, pow_tmp = boost::lambda::bind( pow, tmp - h - g , 3.15 ) ));

2 4

test errors due to possible boost config issue
by McLemon, Sean 30 Nov '09

30 Nov '09

I've just got back to configuring\building boost for our compiler again. In one of the tests I'm running into a compiler error, perhaps I'm hoping someone can help me figure out what's going wrong. The test is libs/bind/test/bind_cdecl_mf_test.cpp and i'm getting a parse error fairly early on (line 30) and an undefined identifier "F" (line 32). $ c:/analog/tools6.0/ccblkfn.exe c:/dsp_testsuite/TESTS/boost/boost_1_40_0/libs/bind/test/bind_cdecl_mf_test.cpp -double-size-64 -Ic:/dsp_testsuite/TESTS/boost/boost_1_40_0/ -full-io -full-cpplib -c++ -eh -rtti c:/dsp_testsuite/TESTS/boost/bf_cplb.c -proc ADSP-BF537 -O -time -D__DSPTEST_API__ -D__DSPTEST_USING_60__ -flags-link -MDUSE_SDRAM_HEAP -flags-link -MDUSE_CACHE -o d_dsptest_bind_cdecl_mf_testcpp_0e80028.dxe -DBOOST_NO_FUNCTION_TEMPLATE_ORDERING ccblkfn.exe: Compiling c:\dsp_testsuite\TESTS\boost\boost_1_40_0\libs\bind\test\bind_cdecl_mf_test.cpp "c:\dsp_testsuite\TESTS\boost\boost_1_40_0\boost/bind/mem_fn_template.hpp", line 30: cc0018: error: expected a ")" BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) ()) ^ "c:\dsp_testsuite\TESTS\boost\boost_1_40_0\boost/bind/mem_fn_template.hpp", line 32: cc0020: error: identifier "F" is undefined F f_; ^ <snip, lots more errors here. suspect due to F being undefined> Perhaps I'm missing a define in my configuration header, or this is a genuine error in our compiler. - Sean

2 1

Boost.Serialization not building
by gast128 30 Nov '09

30 Nov '09

Dear all, we just upgrade to Boost 1.41 and get a compile error in Boost.Serialization: 1>c:\work sdk\boost_1_41_0\boost/archive/shared_ptr_helper.hpp(114) : error C2440: 'return' : cannot convert from 'const boost::serialization::extended_type_info_typeid<T>' to 'const boost::serialization::extended_type_info *' There was already a discussion about this on the newsgroup but no solution was posted: http://thread.gmane.org/gmane.comp.lib.boost.user/52384/focus=52390 The case is easy reproducable: struct Foo { //virtual ~Foo(){} }; struct Foo2 : public Foo { template <class Archive> void serialize(Archive& /*ar*/, const unsigned int /*version*/) { } }; struct Bla { template <class Archive> void serialize(Archive& ar, const unsigned int /*version*/) { ar & BOOST_SERIALIZATION_NVP(m_ptrFoo2); } boost::shared_ptr<Foo2> m_ptrFoo2; }; void F() { std::stringstream sstr; Bla bla; boost::archive::xml_iarchive ia(sstr); ia >> boost::serialization::make_nvp("bla", bla); } Can somebody help? Adding a virtual dtor does remove the problem (and is exactly the difference with 'test_shared_ptr.cpp') but this is unwanted. wkr

2 5

How well does Boost work on Windows CE 6.0 R3?
by Andreas Huber 29 Nov '09

29 Nov '09

Among others, we're considering to use the following Boost libraries on Windows CE 6.0 R3, with MSVC 9.0: date_time exception filesystem regex signals2 system thread For all of these libraries, the msvc-9.0~wm5~stlport5.2 toolset reports at least one test failure on the trunk. So: - Has anybody managed to use these libraries on CE 6.0? - With STLPort or the MS implementation? - If any, what tweaks were necessary? Also, has anybody used the following libs on CE: log (Semashev, proposed) futures (Williams, accepted but not yet added) ? Thanks, -- Andreas Huber When replying by private email, please remove the words spam and trap from the address shown in the header.

1 0

adding a compiler flag
by Igor R 29 Nov '09

29 Nov '09

Hello, Is it possible to add a c++ compiler flag to bjam line, when building a boost library, or what's the right way to do this? Thanks.

2 2

[1.41][regex] MSVC makefiles
by Chard 29 Nov '09

29 Nov '09

The MSVC makefiles for regex (libs/regex/build) create 1_40 filenames. I assume (at least) one of: - they missed the update. - they're obsolete; just use bjam. - I've missed something.

2 1

program_options
by Dejan 29 Nov '09

29 Nov '09

Hi all, I'm experimenting with program_options and trying to get something like "mandatory options". E.g. # my_prog -a someValue with "-a someValue" as mandatory options. Can I define "something" with program_options. Thanks in advantage Dejan

3 2

boost lambda for processing std::vector
by CR Koudella 29 Nov '09

29 Nov '09

Hi, I am trying to understand if boost.lambda is well suited for the quick processing of an std::vector<double>. I must apologize for my sketchy understanding of the library and this is the reason why I turn to you for your help. Imagine that we are given an std::vector<double>, say, x', of some size and that we need to extend x' somehow to x in order to use it as an argument for some function f. So, say x' = (3,3,3) and x can be obtained by some map as x = (3,1,3,1,3). Ideally, this problem would fit into function composition using bind or lambda::bind. Define g(x) = f[x(x')]. The composition operation is standard. What is not for me is how to write the function x(x') using boost.lambda. It is always possible to write a quick C++ functor that will encode in its state the map defining how to generate x from x'. This would typically proceed by constructing a return std::vector<double> to be populated according to the map. But, can this be done easily with boost.lambda also? I am not sure. I seem to be finding it difficult to formulate expressions that return types such as std::vectors, while operating on the vector elements. I can see that the library is well suited to write small functors on the fly that will operate on container items (as is documented), but when it comes to full containers, I am kind of stuck. Any attempt seems to be leading to complicated script and dead ends, which makes me think that I am better off relegating the case to a small C++ functor written elsewhere in the file. Not sure if you see where I am coming from, but in a functional programming language or a higher level scripting language such as python, this kind of operation is quite easy to do on the fly. What I am trying to figure out is how much of the 'in-place definition of code in c++' should reasonably be handled with boost.lambda. Again, I can clearly see the power of boost.lambda when applied to std::for_each or std::transform, etc..., but I am not sure how to leverage it beyond that and I haven't seen many examples out there trying to do that either. Insights and help greatly appreciated, Many thanks, ChrisK

2 1

Two questions on boost::function
by CR Koudella 29 Nov '09

29 Nov '09

Hi, thank you very much for your help. What you suggest works fine, thanks. I have 'studied' the boost lambda library a bit and get the feeling as it says in the intro to the doc that it is especially meant to write small lambda expressions for use with the STL. I am not actually that interested in this use and am having a bit of time trying to get it to do some other things. Imagine I want to do the following operation [h * (f - g)^2](x), where the x is 'const std::vector<double> &', all functions return double and h(x) = k1 and g(x) = k2, where k1, k2 = const. f is some non-trivial function. I can make this work according to the method you indicate. I am not entirely sure what the optimal is to build the lambda expressions for the constant functions h and g, see below. It seems that I need to drive this step through boost::function, otherwise the code won't compile. // some function f given... // constant h functor const double dh = 4.0; bll::constant_type<double>::type lh(bll::constant(dh)); boost::function<double (const std::vector<double> & vecArg)> bfoh; bfoh = lh; // constant g functor const double dg = 0.5; bll::constant_type<double>::type lg(bll::constant(dg)); boost::function<double (const std::vector<double> & vecArg)> bfog; bfog = lg; // construct h * (f - g)^2 // f - g boost::function<double (const std::vector<double> & vecArg)> bfoDF; bfoDF = bll::bind(f, bll::_1) - bll::bind(bfog, bll::_1); // (f - g)^2 boost::function<double (const std::vector<double> & vecArg)> bfoSF; bfoSF = bll::bind(bfoDF, bll::_1) * bll::bind(bfoDF, bll::_1); // h * (f -g)^2 boost::function<double (const std::vector<double> & vecArg)> bfoWRF; bfoWRF = bll::bind(bfoh, bll::_1) * bll::bind(bfoSF, bll::_1); Other than this, the repetitive use of bll::bind at every stage and generally speaking, the wordiness of the script makes me wonder whether this is the right thing to use or if I am using it as I should. I mean h*(f-g)^2 is a pretty simple operation. Any comments on how to improve the above? In particular on how to build the constant functors h and g? Another question I have is, would it be possible to combine functors with different return types in the same way? Imagine j(x) is now a function that takes in an std::vector<double> and returns an std::vector<double>. Then can it be scaled with a function that takes in an std::vector<double>, but returns a double? BTW, a propos extracting the underlying functor out of a boost::function, yes it isn't ideal, but you might just need to acess the underlying interface at some point. Thanks, ChrisK >

2 1

Re: [Boost-users] [GIL] Performance warning...
by Christian Henning 28 Nov '09

28 Nov '09

Lubomir, looking at the default_channel_converter the channels already arrive as a const reference. All I did was to make sure they are still const references in the channel_converter functions. In all cases the source channels should at least be const. Which allows for more compiler optimizations. I did run the performance test in gil_test suite and the changes were marginal. Some tests were faster some were slower after the change. Christian On Fri, Nov 27, 2009 at 6:13 PM, Lubomir Bourdev <lbourdev(a)adobe.com> wrote: > This was done on purpose. I don't know if it still holds, but it used to be > that a const reference to a simple type like an int or char is slower than > passing the type by value. This is the same reason most STL algorithms take > iterators by value. If you want to make this change it is important to > verify that performance of simple built-in channel types is not adversely > affected. > > Lubomir > > On 11/27/09 12:17 PM, "Christian Henning" <chhenning(a)gmail.com> wrote: > >> Hi Eloi, you're correct and I'll fix that. I can even make it const >> reference. Running the test shows no real difference but that might be >> only because no expensive channels are being used. >> >> I'll commit the changes asap. >> >> Lubomir, please review the changes if your time allows. Affected files >> are channel_algorithm.hpp and gil_concept.hpp. >> >> Thanks, >> Christian >> > >

4 5

GGL Review Results
by Hartmut Kaiser 28 Nov '09

28 Nov '09

Hi all, The review of the Generic Geometry Library is over now. We have had vibrant discussions with regards to the library itself. In addition those stirred up a lot of controversial discussion about the Boosts review process. In this review results I will concentrate on the library at hands. Formally this review ended with 12 YES and 2 NO votes. This result reflects the overall discussion and the general consensus of this library being worth to be included into Boost. Based on this result and the discussions the Generic geometry Library has been formally accepted into Boost. It is worth highlighting that most of the reviewers emphasized the excellent quality of the library design. Here are some quotes: - "The design is very clear. I think it can serve as a standard example of how to cover a big non trivial problem domain using meta-programming, partial specialization and tag dispatch to make it uniformly accessible by a set of generic algorithms." - "The design looks clear enough so that I was able to understand about what was being done. Adding concept checking is a good idea. It also surely is a modern generic design." - "I am quite pleased with the use of tag-dispatching and strategies. I was happy to see this approach taken and by looking at the documentation and source code it seems sound. I believe this approach offers the greatest latitude for a generic library." At the same time the 2 NO votes reflect a couple of shortcomings which still need to be addressed before final inclusion into SVN. Here is a list of contingencies noted by the reviewers: - Robustness: algorithmic robustness and arithmetic stability have been discussed widely. The consensus of the reviewers is that all algorithms need to be robust and that the user should be able to make sure all calculations are arithmetically stable. GGL addresses arithmetic stability by allowing to instantiate all algorithms with arbitrary number types. But it turns out not the entire library has been converted to use this scheme yet. Any design issues that would prevent strong robustness guarantees (without drastic refactoring) in the future should be identified and fixed prior to release. The documentation needs to reflect the actual guarantees and complexities of every algorithm. - Concepts: more refinement needs to be done for the existing concepts. At least 2 users claimed to not have been able to adapt their data structures to the existing scheme. The library aims for defining the concepts and interfaces for future geometry related work in Boost, so these use cases need to be addressed. Users mentioned the missing concept inheritance. This might be a good way to address the current problems of concepts being too fine grained and too difficult to use. What needs to be done at minimum is to enhance the flexibility of the concept mechanism enabling to adapt user provided data structures more easily. The concepts need to be sound even in the light of extensions. - Boolean operations: while the library provides a set of Boolean operations those seem to be not complete and/or robust in terms of clockwise/counterclockwise geometries, closed/open polygons. Robust Boolean operations are a strong requirement, so this should be fixed as reported by at least one reviewer. - Documentation: the documentation of the library is not complete and needs additional effort. Using Doxygen alone as a documentation tool has its (known) shortcomings when it comes to generic libraries. The authors already mentioned to plan to switch to QuickBook after review allowing to have better control over the generated docs. - Testing: several reviewers mentioned the need for a thorough testing framework allowing the verification of the correctness of the algorithms in a wide range of use cases. Different test strategies need to be employed, such as high volume and random tests, known border case tests, tests using different numeric precision types, etc. Minor (non-contingency) issues: - Names of used concepts: currently the library is using mainly terms as established by the OpenGIS Consortium (OGC). This is misleading for users coming from different (non-GIS) domains. It has been suggested to introduce different namespaces for the different geometry domains (GIS, graphics, 3D, etc.) allowing to use the expected terminology established in that particular domain. - Name of the library: the name 'GGL - Generic Geometry Library' is misleading as it is not a generic geometry library but a library using generic programming techniques related to geometry. It has been suggested to use the name Boost.Geometry instead. This is not a requirement imposed by the review results, but I would like to suggest to the authors to consider renaming. - Integration with Boost.Units has been suggested. The library does not need to be completetly integrated with Boost.Units, although it appears to be reasonable to deal with types as exposed by Boost.Units especially for distance and area calculations. - Spatial data structures (such as spatial trees) have been mentioned to be crucial for a geometry related library. While the library can't implement all possible data structures in this field it can (and should) define concepts and interfaces allowing future extensions while maintaining interoperability. - In addition to that the reviewers made a lot of remarks related to different smaller inconsistencies part of which already have been addressed during the review. Barend has a full list of the remaining ones and promised to address all of them. Last but not least I would like to encourage cooperation between the authors of this library and the author of Boost.Polygon as both libraries have their strength' worth combining. In an ideal world and at some point I would like to see both libraries to be merged. But this is obviously not something to expect really soon. At this point I would like to thank all who participated in the review and, certainly, the authors for submitting this excellent library to Boost. Regards Hartmut GGL Review Manager ------------------- Meet me at BoostCon http://boostcon.com

1 0

[serialization] how to serialize map of non-default-constructible?
by ivo.t＠moss-soft.de 28 Nov '09

28 Nov '09

Hi to everybody, I'm pretty new to the list, work for some time with Boost and C++ and have a fair knowledge but am not an expert yet. I try to serialize a map whose type is not default-constructible, and I'm seriously stuck there. I thought the load_construct_data and save_construct_data overrides would help me there, but that seems not to be the case. I tried to create a private default constructor hoping that the map (respectively pair) constructor could access it, due to the boost::serialization::access friend declaration, but that didn't work as well. I really do _not_ want to make a public default constructor. What could I do as a workaround?? Any help would be greatly appreciated!! Btw, I work with Boost 1.39 and Visual Studio 2005. Thank you very much in advance Ivo

3 2

[boost bimap]- question on use of optional sorting predicate for set_of declarations
by Curtis Himel 27 Nov '09

27 Nov '09

I have a question with sorting of sets in the bimap framework. I have a bimap declared thus: //Boost Bimap requires this predicate struct setup struct AreDecalIDsInCorrectRenderOrderStruct { bool operator() (const short nDecalID1, const short nDecalID2) const { //Do comparison } }; typedef boost::bimap<boost::bimaps::unordered_multiset_of<int>, boost::bimaps::set_of<short, AreDecalIDsInCorrectRenderOrderStruct>> intMultisetShortSetBimap; intMultisetShortSetBimap m_mStructureIDToLinkedDecalID; The problem is this isn't working as I expected. I'm expecting that when I insert elements using: m_mStructureIDToLinkedDecalID.insert(intMultisetShortSetBimap ::value_type(nStructureID, nDecalID)); and then later retrieve them using: pair<intMultisetShortSetBimap ::left_const_iterator, intMultisetShortSetBimap ::left_const_iterator> equalRange = m_mStructureIDToLinkedDecalID.left.equal_range(nStructureID); that the retrieved elements with equal range would be sorted according to the predicate I used. But they aren't. Instead their order is dependent on the order they were inserted. I've verified that my predicate is being called on insertions. Am I misunderstanding the purpose of passing a sorting predicate to a set_of declaration? If so, what does the sorting actually do and is there a way to get boost::bimap to do what I want? Thanks for any help. -Curtis _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ This e-mail and any files transmitted with it are confidential and intended solely for the use of the individual or entity to whom they are addressed. If you have received this e-mail in error please notify the originator of the message. This footer also confirms that this e-mail message has been scanned for the presence of computer viruses. Any views expressed in this message are those of the individual sender, except where the sender specifies and with authority, states them to be the views of Indra Systems, Inc.

2 1

[GIL] Performance warning...
by Eloi Du Bois 27 Nov '09

27 Nov '09

Hi all, I am creating a bunch of function for channel merging, thus I was looking in channel_algorithm.hpp and I saw something that may slow down processes... I don't know if I'm right, but on line 362: /// \ingroup ChannelConvertAlgorithm > /// \brief Converting from one channel type to another. > template <typename DstChannel, typename SrcChannel> // Model ChannelConcept > (could be channel references) > inline typename channel_traits<DstChannel>::value_type channel_convert(*SrcChannel > src*) { > return channel_converter<typename > channel_traits<SrcChannel>::value_type, > typename > channel_traits<DstChannel>::value_type>()(src); > } > There is no reference on parameter ***src*.* *That* *not* *a very good idea because references aren't hold by templates function (even if inlined). This may invoke copy constructor and can slow down the processes a "lot"... Here is an example that shows I'm right in theory: // "Slow" on big objects > template<typename P> > inline void testPtr1(P a) { > std::cout << "In called function inequality ptr of a: " << (int)&a << > std::endl; > } > > // Better > template<typename P> > inline void testPtr2(P &a) { > std::cout << "In called function equality ptr of a: " << (int)&a << > std::endl; > } > > template<typename P> > void test(const P & a) { > std::cout << "Base ptr of a: " << (int)&a << std::endl; > testPtr1(a); > } > > int main() { > int a = 0; > test(a); > return 0; > } >

2 1

[bimap] Creating a bimap fom a std::map
by Edward Diener 27 Nov '09

27 Nov '09

I would have thought, naively enough, that one of the common uses of a bimap was that one should be able to create a bimap from a std::map as long as the relation between the two types was unique both ways. I was disconcerted when I did not see a bimap constructor that accepted a std::map of the same types, but then I saw the constructor which takes two iterators and decided to try that, like so: std::map<int,std::string> myMap; // ... fill myMap boost::bimap<int,std::string> myBimap(myMap.begin(),myMap.end()); I was met with, in VC9 using Boost 1.40: "c:\utilities\boost\boost_1_40_0\boost\multi_index_container.hpp(232) : error C2664: 'std::pair<_Ty1,_Ty2> boost::multi_index::multi_index_container<Value,IndexSpecifierList,Allocator>::insert_(const Value &,boost::multi_index::detail::ordered_index_node<Super> *)' : cannot convert parameter 1 from 'std::pair<_Ty1,_Ty2>' to 'const boost::bimaps::relation::mutant_relation<TA,TB,Info,force_mutable> &' 1> with 1> [ 1> _Ty1=boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>,std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>>>>> *, 1> _Ty2=bool, 1> Value=boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>, 1> IndexSpecifierList=boost::bimaps::detail::bimap_core<int,TString,boost::mpl::na,boost::mpl::na,boost::mpl::na>::core_indices, 1> Allocator=std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>>, 1> Super=boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>,std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>>>> 1> ] 1> and 1> [ 1> _Ty1=const int, 1> _Ty2=TString 1> ] 1> and 1> [ 1> TA=boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>, 1> TB=boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>, 1> Info=boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info, 1> force_mutable=true 1> ] 1> Reason: cannot convert from 'std::pair<_Ty1,_Ty2>' to 'const boost::bimaps::relation::mutant_relation<TA,TB,Info,force_mutable>' 1> with 1> [ 1> _Ty1=const int, 1> _Ty2=TString 1> ] 1> and 1> [ 1> TA=boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>, 1> TB=boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>, 1> Info=boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info, 1> force_mutable=true 1> ] 1> No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called 1> c:\utilities\boost\boost_1_40_0\boost\bimap\bimap.hpp(247) : see reference to function template instantiation 'boost::multi_index::multi_index_container<Value,IndexSpecifierList,Allocator>::multi_index_container<InputIterator>(InputIterator,InputIterator,const boost::tuples::cons<HT,TT> &,const std::allocator<_Ty> &)' being compiled 1> with 1> [ 1> Value=boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>, 1> IndexSpecifierList=boost::bimaps::detail::bimap_core<int,TString,boost::mpl::na,boost::mpl::na,boost::mpl::na>::core_indices, 1> Allocator=std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>>, 1> InputIterator=std::_Tree<std::_Tmap_traits<int,TString,std::less<int>,std::allocator<std::pair<const int,TString>>,false>>::iterator, 1> HT=boost::tuples::tuple<boost::multi_index::member<boost::bimaps::relation::detail::relation_storage<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,true>,std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,pointer-to-member(0x4)>,std::less<std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>>>, 1> TT=boost::tuples::cons<boost::tuples::tuple<boost::multi_index::member<boost::bimaps::relation::detail::relation_storage<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,true>,int,pointer-to-member(0x0)>,std::less<int>>,boost::multi_index::detail::index_base<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>,boost::bimaps::detail::bimap_core<int,TString,boost::mpl::na,boost::mpl::na,boost::mpl::na>::core_indices,std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true>>>::ctor_args_list>, 1> _Ty=boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int,boost::bimaps::relation::member_at::left>,boost::bimaps::tags::tagged<const std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>,boost::bimaps::relation::member_at::right>,boost::bimaps::detail::manage_additional_parameters<boost::mpl::na,boost::mpl::na,boost::mpl::na>::case_NNN::additional_info,true> 1> ] 1> c:\programming\programs\vc9\xxx\current\yyyyyyyyyy\zzzzzzzzzzzzzzzz.cpp(338) : see reference to function template instantiation 'boost::bimaps::bimap<KeyTypeA,KeyTypeB>::bimap<std::_Tree<_Traits>::iterator>(InputIterator,InputIterator)' being compiled 1> with 1> [ 1> KeyTypeA=int, 1> KeyTypeB=TString, 1> _Traits=std::_Tmap_traits<int,TString,std::less<int>,std::allocator<std::pair<const int,TString>>,false>, 1> InputIterator=std::_Tree<std::_Tmap_traits<int,TString,std::less<int>,std::allocator<std::pair<const int,TString>>,false>>::iterator 1> ]" So evidently that does not work. What is the problem with creating a bimap from the data in a std::map ? It seems as if it should be a no-braine and one of the chief selling points of using a bimap.

4 10

Compiler warnings from Macs, IBM acc, Borland, Comeau, Metroworks, et al - are they a Problem?
by Paul A. Bristow 27 Nov '09

27 Nov '09

https://svn.boost.org/trac/boost/wiki/Guidelines/MaintenanceGuidelines (bottom of the page) has a collection of suggestions for 'quieting' warnings on MSVC and GCC, but no information on other compilers yet. Can users of these compilers please 1 Assert that they never have a problem with unhelpful compiler warnings from Boost stuff, or 2 Send common warnings and suggestions for dealing with them by suppressing or by 'fixing' the code (so that I can add to the guidelines. Thanks Paul --- Paul A. Bristow Prizet Farmhouse Kendal, UK LA8 8AB +44 1539 561830, mobile +44 7714330204 pbristow(a)hetp.u-net.com

2 1

[boost serialization] Build SQL database from data in web pages
by Boost lzw 27 Nov '09

27 Nov '09

Hello folks, I am wondering if I can use boost, boost serialization in particular, to build a SQL database from data in web pages. For example, I want to build a SQL database based on data from web page link such as this one: http://tubic.tju.edu.cn/deg/information.php?ac=DEG10010001 Since the data would be collected from thousands of such link, I want to write code for doing it automatically. Can anyone suggest how to do it with boost? Thanks a lot in advance, Robert

3 2

Re: [Boost-users] gcc problems on mac os 10.6...
by Wong Hua 27 Nov '09

27 Nov '09

Thanks for the answer ! It seems that you have a custom Python installed in /Library/Frameworks/Python. framework, and the build process prefers this one instead of the "system" /System/Library/Frameworks/Python.framework. When I installed the custom 2.5 one from python.org, I had the same error, because the build process picked up this custom install of Python. I uninstalled it, and the build picked up the system python, which worked well. The thing is that the Python from Python.org is 32 bits. The python installed with mac os 10.6 is 64 bits. I checked that using : >>>import struct >>>struct.calcsize("P")*8 Returns 32 on the python installed from python.org (in fact you have to specify you want a 64 bit python when configuring I think)

2 1

uuid?
by Maróy Ákos 27 Nov '09

27 Nov '09

Hi, I searched through the boost-users mailing list archives, and found a few references of a to-be-released uuid implementation, but nothing really tangilbe. Is there a uuid implementation available under or around boost? Thanks, Akos

9 13

Re: [Boost-users] BOOST_FOREACH and boost::bimap
by pete＠pcbartlett.com 27 Nov '09

27 Nov '09

On Fri 27/11/09 08:08 , Conoscenza Silente <abruzzoforteegentile(a)gmail.com> wrote: > Hi All > I tried to use BOOST_FOREACH with bimap but it doesn't compile. .. > BOOST_FOREACH( BMapKIt it, myBimap) // this line doesnt' ... Bimap is no different from any other container when it comes to FOREACH, you need "BMapVal v" not "BMapKlt it" in the macro.

2 1

[Statechart] How to model this scenario?
by Zachary Turner 27 Nov '09

27 Nov '09

Suppose I have a character in a game. He can run, and do two types of attacks. He can initiate either an attack first or a jump first, and then initiate the other second and it will perform both at the same time until one finishes, then go back to just one until that one is also finished, and finally go back to just running on the ground. Additionally, he can be knocked back either on the ground or while already in the air. The system has the following properties: - If he is attacking (regardless of whether it be on the ground or in the air), he cannot initiate another attack until the first one is done. Otherwise he can always initiate an attack (even in the air). - If he is jumping, he cannot jump again until the first jump is finished. - Regardless of whether he is jumping or on the ground, he can initiate attack 1, initiate attack 2, or jump. All of this is only possible if he is not currently being knocked back. - There are separate animations for: jumping attack 1 while on the ground attack 2 while on the ground attack 1 while jumping attack 2 while jumping knockback If being knocked back, the knockback animation takes priority over whatever other animation was being played at the time. After the knockback is complete, it will continue from the previous animation, assuming that state has not finished. I feel like I should use some type of concurrent states here, but I'm not sure how to model the combinatorial factor (i.e. playing different animations depending on the *combination* of states). I'm also not sure how to model the priority of the knockback animation. In fact, this is not just related to the Statechart library, but I'm unclear how to do this using UML State Machines as well. Any advice appreciated. Zach

2 1

finite state machine performance info
by Conoscenza Silente 27 Nov '09

27 Nov '09

Hi All Yesterday I started playing with Boost State Chart library implementing state machines for my applications. Each time I am moving into a new state I noticed that a new state is created; this means that the constructor of the boost::statechart::state class is called each time ( and the destructor for the state that I am leaving ). I would like to fasten up the whole process; let's say that I would like to avoid the creation/destruction of the class each time using object already allocated in memory that are deleted only at the exit of the application. Is this a good way in your opinion ? I saw that there is an allocator template argument but at the state where I am now I would lilke to not spend time in doing a new allocator for that: do you know if there already in place something that I can reuse for my purpose? Thanks CS

5 9

Re: [Boost-users] Automating Serialization?
by Brian Wood 27 Nov '09

27 Nov '09

Stefan Strasser writes: >Am Thursday 26 November 2009 14:05:18 schrieb Bilokon, Paul: >> Hi, >> >> By design Boost Serialization requires the user to list each field that >> needs to be serialised. >> >> This is in contrast, for example, with Java and some other languages where >> serialisation is supported (kind of) at the language level. >> >> The current approach requires some code duplication. We have to declare a >> field. We have to manually (de)serialise it. If we need to make a change, >> we make it in at least two distinct places. >> >> Is there any way to automate the process of serialisation, perhaps >> harnessing the power of the preprocessor? E.g. we could label the fields >> that need to be serialised. Is there anything in Boost that could help? > >not that I'm aware of, but I even think that's a good thing. >the serialize() function represents a file format, and you want file formats >to be stable and not being changed because someone added a runtime field to a >class. "runtime field" ? >usually when you do want to add a serialized field you'd also want old >versions of the file still to be readable, so you end up writing custom >(versioned) deserialization code anyway, even if your language has built-in >serialization support. I recommend avoiding the versioning support in Boost Serialization. It runs counter to good development practices by averting the type system. Consider for example a class called Account that uses versioning to support multiple releases of a product. In the usual case, later releases will have more fields and added complexity than earlier releases. Support then for a client at an early release, say 1.1, becomes inefficient since Account is being used to handle both 1.2 and 1.1 users. If instead Account_11 and Account_12 are used -- with Account_12 probably derived from Account_11 -- this weakness is avoided. Additionally this approach is beneficial from a testing perspective. In a 1.2 server, 1.1 clients are supported using Account_11, which has already been tested and is not messed with to support 1.2 clients. > >you could use some compile time code generator to write default serialization >code for you, using e.g. OpenC++, GCC-XML, or Doxygen, but I doubt those >generated functions would stay there very long. I'm not exactly sure what you are saying here, but if a user is simply improving the names of some of his fields, the functions won't stay the same very long. Automating this helps with a common problem of forgetting to update the serialization functions and the compiler then barking. I don't claim though that every class should be handled this way. The C++ Middleware Writer allows users to turn off the automated generation of marshalling functions if that is desired. In my experience, it is unusual to turn that functionality off. Regards, Brian Wood http://www.webEbenezer.net <http://www.webebenezer.net/> "Then Samuel took a stone, and set it between Mizpeh and Shen, and called the name of it Ebenezer, saying, so far the the L-RD has helped us."

2 1

BOOST_FOREACH and boost::bimap
by Conoscenza Silente 27 Nov '09

27 Nov '09

Hi All I tried to use BOOST_FOREACH with bimap but it doesn't compile. What is wrong in using it the way is displayed below? Reading the specs it should be able to work since bimap provide .begin() and .end() methods. Thanks CS typedef boost::bimap<int,std::string > BMap; typedef boost::bimap<int,std::string >::value_type BMapVal; typedef boost::bimap<int,std::string >::const_iterator BMapKIt; BMap myBimap; myBimap.insert( BMapVal( 10, "hi") ); myBimap.insert( BMapVal( 20, "hihihi") ); BOOST_FOREACH( BMapKIt it, myBimap) // this line doesnt' compile: { std::cout << "LEFT: " << it->left << " RIGHT: " << it->right << std::endl; } TestBoost_Nov26.h:68: error: conversion from ‘boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int, boost::bimaps::relation::member_at::left>, boost::bimaps::tags::tagged<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::bimaps::relation::member_at::right>, mpl_::na, false>’ to non-scalar type ‘boost::bimaps::detail::set_view_iterator<boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int, boost::bimaps::relation::member_at::left>, boost::bimaps::tags::tagged<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::bimaps::relation::member_at::right>, mpl_::na, true>, std::allocator<boost::bimaps::relation::mutant_relation<boost::bimaps::tags::tagged<const int, boost::bimaps::relation::member_at::left>, boost::bimaps::tags::tagged<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::bimaps::relation::member_at::right>, mpl_::na, true> > > > > >’ requested

1 0

[interprocess] file_lock permission denied
by Trigve Siver 27 Nov '09

27 Nov '09

Hi, I'm trying to use file_lock from interprocess but without success. Here is code I'm using: m_Stream.exceptions(std::ios::badbit); m_Stream.open(m_FileName.c_str()); boost::interprocess::file_lock lock(m_FileName.c_str()); ... { // Lock file boost::interprocess::scoped_lock<boost::interprocess::file_lock> scoped_file_lock(lock); // Write to stream m_Stream << "Some text"; m_Stream.flush(); } where m_Stream is std::ofstream. When "m_Stream.flush()" is executed, I've got a "badbit" exception with "errno" 0x001b0800 and message (with strerror()) "Permission denied". I've tried also with win32 CreateFile()/WriteFile() but without success. I'm using boost 1.40, Visual Studio 2005 SP1, Vista 32 bit SP2 Thanks Trigve

1 0

Re: [Boost-users] Automating Serialization?
by Brian Wood 27 Nov '09

27 Nov '09

Emil Dotchevski writes: >On Thu, Nov 26, 2009 at 5:05 AM, Bilokon, Paul <paul.bilokon(a)citi.com> wrote: > >> The current approach requires some code duplication. We have to declare a >> field. We have to manually (de)serialise it. If we need to make a change, we >> make it in at least two distinct places. > > You are thinking in terms of reflection. Think in terms of states and > invariants and it'll make more sense. For example, if you have an > array of items and a pointer, and your invariant is that the pointer > always points the last element in the array, the pointer should not be > serialized. > I don't know if that is a common situation, but there are two ways to handle that with the C++ Middleware Writer. One as I mentioned in another post is to turn off the automatic generation of marshalling functions. The other is to place those fields which shouldn't be included in the marshalling process within an #ifdef SERVER_SIDE -- http://webEbenezer.net/ifdefSERVER.html . The macro is turned on when servers are built and off when clients are built. This approach enables servers to have a complete view of a type and clients to have an accurate, but limited view of the same type. Regards, Brian Wood http://www.webEbenezer.net <http://www.webebenezer.net/> "Then Samuel took a stone, and set it between Mizpeh and Shen, and called the name of it Ebenezer, saying, so far the the L-RD has helped us."

1 0

using uint8_t & the like on open solaris
by Maróy Ákos 27 Nov '09

27 Nov '09

Mikko, > You could try > using boost::uint8_t; This is what I wanted to avoid. looking at the issue further, it seems that solaris doesn't have the <stdint> C++ include, only the <stdint.h> C include, and thus these definitions are incolded from there, into the global namespace. as a solution, <boost/cstdint.hpp> could put the contents of the <stdint.h> C include into the std namespace explicitly, to increase C++ compliance - as the C includ would be unaware of namespaces anyway. another workaround is to specify using boost::uint8_t; before usage. Akos

1 0