- 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