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

Memory Leak Detection output format
by Jamie Cook 21 Jan '08

21 Jan '08

Hi all, I'm using the boost.test unit tests with memory leak detection turned on and I'm slightly puzzled about the format of the output. I've been working on getting boost to play nicely with STLport and one of the 'problems' I'm having is with memory leaks being reported by boost.test which are actually coming from stlport (there is a discussion on their FAQ about how these aren't really memory leaks at all but that is beside the point). I've managed to get rid of most of these leaks but I've still got one hanging around and I don't know where it comes from. My output from my testing looks like this Embedding manifest... Performing Post-Build Event... *** No errors detected Running 1 test case... Detected memory leaks! Dumping objects -> {171} normal block at 0x00378B88, 1280 bytes long. Data: < 7 lationStatis> A8 8D 37 00 6C 61 74 69 6F 6E 53 74 61 74 69 73 Object dump complete. My question is this... how can I enable more informative memory leak output? In this article () it says that by #define _CRTDBG_MAP_ALLOC, the filename and line number will also be displayed. I'm looking into execution_monitor.ipp and I can see where <crtdbg.h> is included but even if I put the #define directly before this include the output comes out exactly the same as above. (and yes I recompiled the library) I'm using MSVC8.0, boost 1.34.1 and stlport 5.1.4 and the test library is compiled as C:\Program Files\boost\boost_1_34_1\libs\test\build>bjam --toolset=msvc link=static stdlib=stlport threading=multi I would really appreciate if anyone could give me some insight on why this is being reported in such a way that I can't actually use it. Cheers, -- Jamie Cook Research Engineer ………………………………………..………………… Veitch Lister Consulting Pty Ltd. Ground Floor, 80 Jephson St, PO Box 1054, Toowong, QLD 4066 AUSTRALIA Ph: +61 7 3870 4888 Fax: +61 7 3870 4446 Email: jamie.cook(a)veitchlister.com.au Web: www.veitchlister.com.au ………………………………………..…………………

4 4

Using singleton library
by James Jackson 21 Jan '08

21 Jan '08

Hi, I'd like to give the Singleton library currently out for review a try. I have the standard Boost 1.34.1 release. Blindly copying in the files in the singleton release distribution into the relevant directories in by Boost installation results in compile errors such as: "boost/function_types/is_member_function_pointer.hpp: No such file or directory" And indeed, function_types is not present in my installation. Is there a recipe for getting going with this library on top of the standard distrubtion, or should I just check everything out from HEAD in CVS? Cheers, James.

1 0

boost.logging v2 compiler errors
by ope 20 Jan '08

20 Jan '08

Hi, I did try the boost.logging lib from svn http://svn.boost.org/svn/boost/sandbox/logging/ and got with the starter example the compiler errors: $ LANG=en g++ -Iboost/logging -Iboost/logging/lib/logging/samples/starter/ boost/logging/lib/logging/samples/starter/log.cpp -o log In file included from boost/logging/lib/logging/samples/starter/log.cpp:2: boost/logging/lib/logging/samples/starter/log.h:47: error: 'g_l' declared as function returning a function boost/logging/lib/logging/samples/starter/log.cpp: In function 'boost::logging::log_holder<boost::logging::logger_format_write<boost::logging::default_, boost::logging::default_, boost::logging::writer::threading::ts_write, boost::logging::default_, boost::logging::scenario::usage::detail_find_logger::find_logger<boost::logging::scenario::usage::logger_::favor::correctness, boost::logging::scenario::usage::logger_::change::often<10>, boost::logging::default_>::lock_resource<10> >, boost::logging::default_, boost::logging::override>& g_l()': boost/logging/lib/logging/samples/starter/log.cpp:14: error: new declaration 'boost::logging::log_holder<boost::logging::logger_format_write<boost::logging::default_, boost::logging::default_, boost::logging::writer::threading::ts_write, boost::logging::default_, boost::logging::scenario::usage::detail_find_logger::find_logger<boost::logging::scenario::usage::logger_::favor::correctness, boost::logging::scenario::usage::logger_::change::often<10>, boost::logging::default_>::lock_resource<10> >, boost::logging::default_, boost::logging::override>& g_l()' boost/logging/lib/logging/samples/starter/log.h:47: error: ambiguates old declaration 'int g_l()' boost/logging/lib/logging/samples/starter/log.cpp: At global scope: boost/logging/lib/logging/samples/starter/log.cpp:14: error: no matching function for call to 'boost::logging::ensure_early_log_creation::ensure_early_log_creation(int)' boost/logging/boost/logging/detail/log_keeper.hpp:86: note: candidates are: boost::logging::ensure_early_log_creation::ensure_early_log_creation(type&) [with type = int] boost/logging/boost/logging/detail/log_keeper.hpp:85: note: boost::logging::ensure_early_log_creation::ensure_early_log_creation(const boost::logging::ensure_early_log_creation&) boost/logging/lib/logging/samples/starter/log.cpp: In function 'void init_logs()': boost/logging/lib/logging/samples/starter/log.cpp:20: error: base operand of '->' is not a pointer boost/logging/lib/logging/samples/starter/log.cpp:21: error: base operand of '->' is not a pointer boost/logging/lib/logging/samples/starter/log.cpp:22: error: base operand of '->' is not a pointer boost/logging/lib/logging/samples/starter/log.cpp:23: error: base operand of '->' is not a pointer boost/logging/lib/logging/samples/starter/log.cpp:26: error: base operand of '->' is not a pointer boost/logging/lib/logging/samples/starter/log.cpp:27: error: base operand of '->' is not a pointer boost/logging/lib/logging/samples/starter/log.cpp:28: error: base operand of '->' is not a pointer On other examples I've got linker errors. Does exist some decencies? Thanks, Olaf

2 5

Re: [Boost-users] Memory Leak Detection output format
by Jamie Cook 20 Jan '08

20 Jan '08

Dieter, I've actually already found VLD, however I had some small problems with it... firstly it's a compile time library meaning that I'd have to include it into the stlport source and compile it in from the ground up rather than just linking. While this is doable (with a bit of work) my second problem was that it caused random crashes in my application ... this was much harder to work around :) Thanks to all for the suggestions however - has anyone ever had any luck with mpatrol? I've got the source downloaded however development stopped in 2001 as far as I can tell. Jamie -- Jamie Cook Research Engineer ………………………………………..………………… Veitch Lister Consulting Pty Ltd. Ground Floor, 80 Jephson St, PO Box 1054, Toowong, QLD 4066 AUSTRALIA Ph: +61 7 3870 4888 Fax: +61 7 3870 4446 Email: jamie.cook(a)veitchlister.com.au Web: www.veitchlister.com.au ………………………………………..…………………

1 0

[newbie question] how to get rid of vector of vectors using boost structures
by Michał Nowotka 19 Jan '08

19 Jan '08

Hello, In my app I'm using vector of vectors as a matrix but it has cumbersome interface especially accesing data. Does boost offer some more accurate data structure (it shuld be flexible as vector but with friendly interface)? -- Cheers Michał Nowotka

2 1

quick_tour example of BGL
by Rajesh Tengli 19 Jan '08

19 Jan '08

Hi, In the quick_tour example of Boost Graph Library and the documentation at this link http://www.boost.org/libs/graph/doc/quick_tour.html i think the edge_array for the example graph should be: Edge edge_array[] = { Edge(A,B), Edge(A,E), Edge(A,D),Edge(A,C), Edge(C,A), Edge(C,D), Edge(D,B),Edge(D,A), Edge(E,D), Edge(E,B), Edge(E,A)}; // 11 edges instead of the mentioned Edge edge_array[] = { Edge(A,B), Edge(A,D), Edge(C,A), Edge(D,C), Edge(C,E), Edge(B,D), Edge(D,E), }; // 7 edges -Rajesh Tengli

1 0

[iostreams] issue to compile code with intel-linux 9.1 and 10.0
by frederic.bron＠alcan.com 19 Jan '08

19 Jan '08

Compiling on Linux 2.6.9-42.ELsmp #1 SMP x86_64 x86_64 x86_64 GNU/Linux I had no issue building the boost libraries using icpc 10.0 (toolset intel-linux). But when I try to compile the code I have written (which compiles well with g++), I get the following error (intel 9.1 and 10.0 give the same error): /soft/bal/usr/boost_icc/include/boost/iostreams/detail/streambuf/indirect_streambuf.hpp(237): error: identifier "streamsize" is undefined streamsize keep = (std::min)( static_cast<streamsize>(gptr() - eback()), ^ detected during: instantiation of "boost::iostreams::detail::indirect_streambuf<T, Tr, Alloc, Mode>::indirect_streambuf() [with T=boost::iostreams::basic_null_device<char, boost::iostreams::input>, Tr=std::char_traits<char>, Alloc=std::allocator<char>, Mode=boost::iostreams::input]" at line 80 of "/soft/bal/usr/boost_icc/include/boost/iostreams/stream_buffer.hpp" Any idea? F. Bron Avis : Ce message et toute pièce jointe sont la propriété d'Alcan et sont destinés seulement aux personnes ou à l'entité à qui le message est adressé. Si vous avez reçu ce message par erreur, veuillez le détruire et en aviser l'expéditeur par courriel. Si vous n'êtes pas le destinataire du message, vous n'êtes pas autorisé à utiliser, à copier ou à divulguer le contenu du message ou ses pièces jointes en tout ou en partie. Notice: This message and any attachments are the property of Alcan and are intended solely for the named recipients or entity to whom this message is addressed. If you have received this message in error please inform the sender via e-mail and destroy the message. If you are not the intended recipient you are not allowed to use, copy or disclose the contents or attachments in whole or in part.

2 1

Re: [Boost-users] Memory Leak Detection output format
by Jamie Cook 19 Jan '08

19 Jan '08

> Try building with internal STL. After all you only interested in your own leaks, right? > Gennadiy yeah I am, and having every test run spit back four blocks of unfreed memory makes it harder to see which memory leaks are from my code and which are from stlport - especially if there is no contextual information such as file/line# to distinguish them, I basically have to memorize the sizes of each leak and compare back against those on each run. Hence why I really want to either a) Find out where this last 1280 bytes of memory is being allocated b) Have filename/line# output so that it's easier to see which leaks are from my own code Which is why I'm wondering if there is a way to change the output of the memory leak detector ... guess I might have to start looking at external leak detectors that are linked at runtime instead... does anyone know any good ones? Kindly, Jamie Cook Research Engineer ………………………………………..………………… Veitch Lister Consulting Pty Ltd. Ground Floor, 80 Jephson St, PO Box 1054, Toowong, QLD 4066 AUSTRALIA Ph: +61 7 3870 4888 Fax: +61 7 3870 4446 Email: jamie.cook(a)veitchlister.com.au Web: www.veitchlister.com.au ………………………………………..…………………

6 6

Custom deleter for ptr_vector?
by Robert Dailey 18 Jan '08

18 Jan '08

Hi, I was wondering it is currently possible to give ptr_vector a custom deleter? This could simply be in the form of a functor. If this feature does not exist, would it be hard to add? For example, you could do this: namespace boost { namespace detail { template< typename t_type > struct default_deleter { void operator() ( t_type* ptr ) { delete ptr; } }; } template< typename t_type, typename t_deleter = detail::default_deleter<t_type> > class ptr_vector { private: std::vector<t_type*> m_pointers; public: ~ptr_vector() { std::for_each( m_pointers.begin(), m_pointers.end(), t_deleter() ); } }; }

1 0

[flyweight] Remainder: Flyweight review will start January 21
by Ion Gaztañaga 18 Jan '08

18 Jan '08

Hi to all, Flyweight library will be reviewed January 21-30. For those interested in the library, this post contains all the information needed for the review: *Author:* Joaquín M. López Muñoz *Description:* Flyweights are small-sized handle classes granting constant access to shared common data, thus allowing for the management of large amounts of entities within reasonable memory limits. Boost.Flyweight makes it easy to use this common programming idiom by providing the class template flyweight<T>, which acts as a drop-in replacement for const T. *Online docs:* http://tinyurl.com/2sstyr http://svn.boost.org/svn/boost/sandbox/flyweight/libs/flyweight/index.html *Download:* http://tinyurl.com/hrdm6 http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directo… *Notes:* 1) We've seen some suggestions in the mailing list for Flyweight. Joaquín has nicely explained a couple of issues that we'd like to address/discuss in the review: http://tinyurl.com/33ghtf http://svn.boost.org/svn/boost/sandbox/flyweight/libs/flyweight/doc/review_… 2) Flyweight needs Boost 1.35 elements because the library depends on libraries like Interprocess for some features/tests. Since SVN snapshot tarballs seem to be missing these days, those who want to try flyweight can download a working SVN-HEAD snapshot here: http://igaztanaga.drivehq.com/boost_trunk.tar.bz2 3) Serialization tests won't work. This feature is expected to work when some new features (discussed in the mailing list between Joaquín and Robert Ramey) are added in Boost.Serialization. Those are expected for Boost 1.36. Regards, Ion

1 0

Filesystem bug in directory_iterator (operations.cpp, readdir_r_simulator function)
by raulh39＠ya.com 18 Jan '08

18 Jan '08

Hi, I have encountered an error in the filesystem library. I am working with Boost 1.34.1, SunOs 5.7, and a multi-threaded environment. This small program reproduces the problem: ------------------------------------------------------ #include <boost/filesystem/fstream.hpp> #include <boost/filesystem/operations.hpp> #include <boost/filesystem/convenience.hpp> #include <boost/foreach.hpp> #include <iostream> int main() { namespace fs = boost::filesystem; fs::path path(".",fs::native); if(fs::exists(path) && fs::is_directory(path)) { fs::directory_iterator begin(path), end; BOOST_FOREACH(fs::path file, std::make_pair(begin,end)) std::cout << file.leaf() << std::endl; } } ------------------------------------------------------ The problem is that this program never ends. Apparently the "begin" iterator never reaches the "end" iterator. It only happens in a multi-thread compilation. But, I think that I know where the bug is. In the file libs/filesystem/src/operations.cpp is were the function 'readdir_r_simulator' is implemented, and, if I understand it correctly, it should return != 0 if an error has ocurred. But, the 1247 line: { return ::readdir_r( dirp, entry, result ); } is wrong, because when an error is encountered, readdir_r() returns a null pointer. NULL is converted to the int 0 and the function returns it. So, I suggest to change that line with: { if(::readdir_r( dirp, entry, result )==NULL) return errno; else return 0; } I will try to post this bug to the bug tracking facility (¿trac?). Regards, Raul.

1 1

[program_options] Non-conventional options
by ope 18 Jan '08

18 Jan '08

Hi, I've read http://www.boost.org/doc/html/program_options/howto.html#id1592624 about Non-conventional Syntax but it doesn't solve my problem. For a program I have to bypass some options to the underlying library (to be concrete Qt), where some of the Qt specific options I have to parse for my program too. Qt's QApplication recognizes cmd line arguments in a style of '-command' which differs from long option style of boost.program_options. Therefore the '-command' should be valid, the '--command' not! How can I get this? Thanks, Olaf

1 0

Re: [Boost-users] Memory Leak Detection output format
by Dieter Rosch 18 Jan '08

18 Jan '08

You might want to do a google for VLD (Visual Leak Detector). It is an excellent free memory leak detector for MSVC 8. From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Jamie Cook Sent: 16 January 2008 01:07 AM To: boost-users(a)lists.boost.org Subject: [Boost-users] Memory Leak Detection output format Hi all, I'm using the boost.test unit tests with memory leak detection turned on and I'm slightly puzzled about the format of the output. I've been working on getting boost to play nicely with STLport and one of the 'problems' I'm having is with memory leaks being reported by boost.test which are actually coming from stlport (there is a discussion on their FAQ about how these aren't really memory leaks at all but that is beside the point). I've managed to get rid of most of these leaks but I've still got one hanging around and I don't know where it comes from. My output from my testing looks like this Embedding manifest... Performing Post-Build Event... *** No errors detected Running 1 test case... Detected memory leaks! Dumping objects -> {171} normal block at 0x00378B88, 1280 bytes long. Data: < 7 lationStatis> A8 8D 37 00 6C 61 74 69 6F 6E 53 74 61 74 69 73 Object dump complete. My question is this... how can I enable more informative memory leak output? In this article () it says that by #define _CRTDBG_MAP_ALLOC, the filename and line number will also be displayed. I'm looking into execution_monitor.ipp and I can see where < crtdbg.h> is included but even if I put the #define directly before this include the output comes out exactly the same as above. (and yes I recompiled the library) I'm using MSVC8.0, boost 1.34.1 and stlport 5.1.4 and the test library is compiled as C:\Program Files\boost\boost_1_34_1\libs\test\build>bjam --toolset=msvc link=static stdlib=stlport threading=multi I would really appreciate if anyone could give me some insight on why this is being reported in such a way that I can't actually use it. Cheers, -- Jamie Cook Research Engineer ........................ Veitch Lister Consulting Pty Ltd. Ground Floor, 80 Jephson St, PO Box 1054, Toowong, QLD 4066 AUSTRALIA Ph: +61 7 3870 4888 Fax: +61 7 3870 4446 Email: jamie.cook(a)veitchlister.com.au Web: www.veitchlister.com.au ........................

1 0

[review] Fast track review of Boost.Utility/Singleton begins today
by John Torjo 18 Jan '08

18 Jan '08

Hi all, Today starts the formal Fast-Track review of the Boost.Utility/Singleton library. This is a very useful utility, so I'm expecting lots of reviews ;) *Description* A Singleton describes a globally accessible and unique facility, typically implemented as a class with inaccessible constructors and a globally accessible function for clients to access a single instance which is created when accessed for the first time. This library provides three Singleton templates that share an identical interface : |- boost::singleton| : can be used to create Singletons with synchronized initialization. If further synchronization is required it has to be implemented by the user. |- boost::mutexed_singleton| : additionally ensures that concurrent access to the instance is mutually exclusive. In other words, only one thread can access the instance at a given time. |- boost::thread_specific_singleton| : instances exist once per thread. *Author* Tobias Schwinger *Download* Get it from here: http://www.boost-consulting.com/vault/index.php?action=downloadfile&filenam… Read documentation online here: http://torjo.com/tobias/ What to include in Review Comments ================================== Your comments may be brief or lengthy, but basically the Review Manager needs your evaluation of the library. If you identify problems along the way, please note if they are minor, serious, or showstoppers. Here are some questions you might want to answer in your review: * What is your evaluation of the design? * What is your evaluation of the implementation? * What is your evaluation of the documentation? * What is your evaluation of the potential usefulness of the library? * Did you try to use the library? With what compiler? Did you have any problems? * How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? * Are you knowledgeable about the problem domain? And finally, every review should answer this question: * Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Best, John Torjo - Review Manager - -- http://John.Torjo.com -- C++ expert ... call me only if you want things done right

4 8

Writing binary data in a specific byte ordering (i.e. network order)
by legalize+jeeves＠mail.xmission.com 18 Jan '08

18 Jan '08

[Please do not mail me a copy of your followup] Does boost have a facility for this? I have a bunch of code that did binary I/O on x86. I want to make the code endian-neutral. This is similar to writing binary data in "network order" as is done with TCP and other internet protocols. I was thinking that you could now determine completely at compile-time whether or not bytes need to be swapped using a template class. My thought was that you would have a class for writing "LittleEndian" bytes that took a boolean template parameter. The parameter is determined at compile-time based on the endian-ness of your architecture. Then a specializations for the template determines whether or not you just use stream.write() to write the binary bytes directly from the POD datum or whether or not you manually extract the individual bytes for writing in the proper order. I hope that's clear... it hasn't gelled in my mind enough to have a sample implementation. I'm hoping that there's a facility in boost for this already? -- "The Direct3D Graphics Pipeline" -- DirectX 9 draft available for download <http://www.xmission.com/~legalize/book/download/index.html> Legalize Adulthood! <http://blogs.xmission.com/legalize/>

3 2

[Boost.accumulators] Immediate variance
by Milosz Marian Hulboj 18 Jan '08

18 Jan '08

Hello, I was looking through the documentation of boost.accumulators for calculating the variance in one pass. It seems that for so called 'immediate variance' some approximation is being introduced. However I think that it is not necessary (unless there is a hidden purpose?) and incremental calculation can be done according to the substitution schema described here: http://planetmath.org/encyclopedia/OnePassAlgorithmToComputeSampleVariance.… Regards, Milosz

2 1

[Fwd: Re: [Boost-announce] [review] Fast track review of Boost.Utility/Singleton begins today] (on behalf of Ingolf Steinbach)
by John Torjo 18 Jan '08

18 Jan '08

[on behalf of Ingolf Steinbach] -------- Original Message -------- Subject: Re: [Boost-announce] [review] Fast track review of Boost.Utility/Singleton begins today Date: Mon, 14 Jan 2008 22:46:54 +0100 From: Ingolf Steinbach <ingolf.steinbach(a)googlemail.com> To: John Torjo <john.groups(a)torjo.com> References: <478B978A.6090503(a)torjo.com> Hi, John. 2008/1/14, John Torjo <john.groups(a)torjo.com>: > * What is your evaluation of the design? Some questions: 1. Shouldn't there be a protected d'tor in singleton in order to reduce the chance of mis-use (deletion via pointer to singleton)? 2. Why does instance have pointer-like (rather than reference-like) syntax? I know that GoF use pointers, but references typically make me feel better than pointers (or something that looks like one) which might be 0. 3. Is a private (or protected) my_singleton destructor supported without 'verbose "template...friend-making"'? > * What is your evaluation of the implementation? Not evaluated. > * What is your evaluation of the documentation? Not evaluated. > * What is your evaluation of the potential usefulness of the library? I'd very much like to see this kind of library in boost. This one looks promising. > * Did you try to use the library? With what compiler? > Did you have any problems? No. N/A. N/A > * How much effort did you put into your evaluation? A glance only due to lack of spare time. Sorry . > * Are you knowledgeable about the problem domain? A little: I have written some template based singleton code myself and have read Andrei's MCPPD. > * Do you think the library should be accepted as a Boost library? I'd like to see the above issues addressed in some way. Apart from that, I have no objections. Kind regards Ingolf -- http://John.Torjo.com -- C++ expert ... call me only if you want things done right

2 1

[Boost String Algorithms library] ireplace_all bug with character arrays
by Richard Turrin 18 Jan '08

18 Jan '08

Hi, I've encountered a bug with ireplace_all from the Boost String Algorithms library for version 1.35. If I pass a character array for the Format argument, the function ignores the null terminator and instead uses the entire array minus the last character to replace the occurrences of the Search string in the Input parameter. However, if I provide a pointer to a character array, the string replacement is done as expected. When I stepped into the code, I came across the following lines (excerpt from /trunk/boost/range/as_literal.hpp): template< class Char, std::size_t sz > inline iterator_range<const Char*> as_literal( const Char (&arr)[sz] ) { return boost::make_iterator_range( arr, arr + sz - 1 ); } There is no check for a null terminator. Nor did I find one after this function returned. I think the author here assumed that a caller would always pass in a character array of the right size. I've attached a sample that demonstrates the problem. I performed the test in Visual Studio 2008. Let me know if you need more information. Thanks. Rich Turrin

4 15

the Switch library by Steven Watanabe has been accepted provisionally
by Stjepan Rajko 18 Jan '08

18 Jan '08

The Switch library, submitted by Steven Watanabe, has been accepted provisionally pending a mini-review to be scheduled when possible. The purpose of the mini-review will be to assure that the suggestions outlined below have been adequately addressed. I would like to again thank Steven for submitting a very useful library, and for diligently working with the reviewers on improving its design. I would also like to thank Tobias Schwinger, Joel de Guzman, Darren Cook, Daniel (dherring@...), Felipe Magno de Almeida, and Paul Bristow for providing reviews, votes and half votes. Finally, thanks also to Dan Marsden, Larry Evans, Alexander Nasonov, Richard (legalize@...) and Mathias Gaunard for contributing to the discussion. SUMMARY OF VOTES: Tobias Schwinger and Joel de Guzman have submitted full reviews with positive votes: http://article.gmane.org/gmane.comp.lib.boost.user/32637 http://article.gmane.org/gmane.comp.lib.boost.user/32634 (Joel eventually converted his vote to "yes") One "yes" (half) vote was submitted by Paul Bristow: http://article.gmane.org/gmane.comp.lib.boost.devel/170069 One "no" (half) vote was submitted by Felipe Magno de Almeida: http://article.gmane.org/gmane.comp.lib.boost.devel/170051 Another "no" came privately - the point there was that the library didn't undergo enough scrutiny before submission, and that it should be resubmitted. Another privately submitted "no" came soon after the review opened, stating that the reviewer was not able to deduce any usability/usefulness from the library documentation, and suggested there should be a motivating example on the first page. RATIONALE FOR ACCEPTANCE: I believe the low number of full, positive reviews is justified by the relatively narrow scope that this library covers. Within that scope, however, reviewers indicated that the library is extremely useful. Also, the reviewers submitting positive votes have indicated (and proven) significant expertise in the area, leading me to place much weight on their votes. On the other hand, the negative votes did not point out any concrete flaws in the library itself that would merit rejection. RATIONALE FOR REQUIRING A MINI-REVIEW The "no" votes did, on the other hand, indicate some skepticism of the quality of the library/documentation as submitted, and the progress of the redesign that was happening during the review. Also, as a result of the review, the potential scope of the library has expanded significantly from what was originally proposed (which mostly focused on the ability to choose the number of cases at run-time). I believe that a combination of these two give sufficient reason for a mini-review - doubts about the library can be resolved, and those that might become prospective users of the library under the expanded scope will get a chance to give their opinion. I volunteered to manage the mini-review, so once the library is ready it will hopefully not remain in the review queue for too long (as it seems that finding review managers is the biggest problem ATM). To keep the burden on the community low, I propose to treat the mini-review as a partial continuation of the current review - I will consider the "yes" votes by Tobias and Joel to be left standing unless they state otherwise, and will require any "no" votes to be (re)justified given the new condition of the library. SUGGESTED CHANGES TO THE LIBRARY: * Documentation All reviewers have noted that the documentation could be improved. Specific suggestions were: * motivating example on the first page * additional examples * performance stats * more explanation of the types involved and how they are used. As the scope for the library has increased as a consequence of the review, a gentler, more detailed documentation approach might benefit the library - I believe that many people might find the new library useful, given the right motivation and examples in the documentation. * Return type Tobias Schwinger suggested that the return type should be specified explicitly in the switch_ call, rather than inferring it from the function object, and this seems to be the status quo in the newer designs. Joel de Guzman also suggested that if a version of switch_ should infer the return type, that return type should be a Boost.Variant of the types returned by each of the cases. * Default default behavior If the default behavior is left unspecified, switch_ should invoke the default constructor of the return type in the default case, rather than throwing an exception. This was suggested by Tobias Schwinger after the issue was raised by Dan Marsden. Alexander Nasonov has also indicated that a throwing default case can cause inefficiency, even when it is guaranteed not to be invoked. * Fall-through Alexander Nasonov pointed out the lack of fall-through capability in the submitted implementation. Fall-through has been incorporated into the recent designs being discussed. * Allowing void-returning function objects for the default case with a non-void returning switch Tobias Schwinger mentioned the possibility of allowing default case function objects of void return type even when the switch return type is non-void, as long as the function object call does not return. This would be useful, for example, if the function object is guaranteed to throw. After some discussion on whether determining if the return type is void can be done efficiently, it looks like the proposed solution is to use a special return type that indicates that the call will not return. Since Tobias indicated that this feature is a minor point, it could be implemented or not, depending on how well it fits into the final design. * Design There has been a lengthy discussion on the underlying design of the library, what it should offer, and whether the name of the library is appropriate. There are two types of designs that have been put forward as being appropriate and/or necessary for a Boost.Switch library. On one hand, there is the submitted design (labeled "A" in recent postings), which takes the switch cases in an MPL sequence and a single function object containing implementations of all cases. Joel de Guzman has proposed another design (labeled "B"), in which the switch cases are specified separately and allow a different function to be used for each case. Design "A" is better suited for situations in which the number of cases is determined by a compile time constant, while "B" is more appropriate for many use cases, and provides more flexibility and a more familiar syntax. The result of the discussion was that the Boost.Switch library should cover both situations, and an interface is now being developed that can be used in different ways for different uses (based on a common concept capturing case sequences). Thanks again to all that have contributed to this review, and congratulations to Steven for the accepted library. As others have stated, there is much confidence that Steven will meet the challenges successfully for the mini-review, which we will schedule as soon as the library is ready. Regards, Stjepan

2 2

Error using native_file_string()
by Eswar K 17 Jan '08

17 Jan '08

Hi, I am newbie to boost. I was earlier using boost-1.33.1 and my code was working fine. In FC6 i am compiling my code and shows me the following error. * error: âclass boost::filesystem::basic_directory_entry<boost::filesystem::basic_path<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::filesystem::path_traits> >â has no member named ânative_file_stringâ* Is there any difference in the libraries ? Am I missing something? My function is something like this. *void recurse_directory( const boost::filesystem::path& directory ) { boost::filesystem::directory_iterator end; for( boost::filesystem::directory_iterator dir_itr( directory ); dir_itr != end; ++dir_itr ) { if( boost::filesystem::is_directory( *dir_itr ) ) { try { recurse_directory( *dir_itr ); } catch (boost::filesystem::filesystem_error &e) { std::cerr << "Error recursing directory: " << (*dir_itr).native_file_string() << " (" << e.what() << ")" << std::endl; continue; } } else { add_file( (*dir_itr).native_file_string() ); // Get error here.... } } } * I am getting the error on the highlighted line. I am stuck here. Any help would be deeply appreciated. Thanks in advance. Regards, Eswar

2 1

Examples of boost::thread?
by Robert Dailey 17 Jan '08

17 Jan '08

Hi, I want to make a simple worker thread in my WTL application. However, looking through the boost::thread documentation, I don't see any samples of how to create a thread. Would anyone be so kind as to point me in the right direction? Thank you.

2 1

Boost.regex :: u32regex does not compile with latest STLPort
by Amit 17 Jan '08

17 Jan '08

Hi, Not sure if this is an issue on boost side or STLPort side, but compiling u32regex match givess an error in v4/perl_matcher.hpp, line 85. the call is essentially vector<int>::assign(int, int) since char type is int for ICU strings. This is being resolved to template<iter> assign(iter, iter) member, hence the error. I have fixed it in my local copy by changing the line to s1.assign(static_cast<std::size_t>(1), col); But don't know if this is a good fix. This used to work on Dinkum STL, so I am guessing STLPort is messing up somewhere. Do I need to build regex libraries again after this change? Thanks Amit

2 2

MinGW Build Issues
by Chris Miller 17 Jan '08

17 Jan '08

Why on earth I try and support Windows is beyond my comprehension. It's just something I do. I'm having some massive difficulties making Boost build with MinGW so I can start using it from Code::Blocks. I've tried using Boost's native Jam system, but first I have to build that. And that doesn't work. It keeps telling me this: C:\USERS\LORDSA~1\DESKTOP\BOOSTJAM>build.bat mingw ### ### Using 'msvc' toolset. ### C:\Users\LORDSA~1\DESKTOP\BOOSTJAM>rd /S /Q bootstrap C:\Users\LORDSA~1\DESKTOP\BOOSTJAM>md bootstrap C:\Users\LORDSA~1\DESKTOP\BOOSTJAM>cl /nologo /GZ /Zi /MLd /Fobootstrap/ /Fdboot strap/ -DNT -DYYDEBUG kernel32.lib advapi32.lib user32.lib /Febootstrap\jam0 co mmand.c compile.c debug.c execnt.c expand.c filent.c glob.c hash.c hdrmacro.c he aders.c jam.c jambase.c jamgram.c lists.c make.c make1.c newstr.c option.c outpu t.c parse.c pathunix.c regexp.c rules.c scan.c search.c subst.c timestamp.c vari able.c modules.c strings.c filesys.c builtins.c pwd.c class.c w32_getreg.c nativ e.c modules/set.c modules/path.c modules/regex.c modules/property-set.c modules /sequence.c modules/order.c 'cl' is not recognized as an internal or external command, operable program or batch file. C:\USERS\LORDSA~1\DESKTOP\BOOSTJAM>g++ G++: no input files C:\USERS\LORDSA~1\DESKTOP\BOOSTJAM> It keeps trying to use the MSVC toolset, even though I'm telling it not to. Any help here would be nice! I'm putting this all into an instruction set for potential programmers on my project here: http://www.fsdev.net/index.php?option=com_openwiki&Itemid=22&id=code:kw_pro… -- Registered Linux Addict #431495 http://profile.xfire.com/mrstalinman John 3:16! If Microsoft is the Wal*Mart of the Software World, then Linux is the Home Depot

5 15

ms vc80 works well but intel compiler10 fail
by 杨留安 17 Jan '08

17 Jan '08

here I have some class to test the boost::any_cast,usually I use intel compiler 10.0,but I got a message the application must be close. but the ms vc 8.0 compiler works well. My operator is windows xp,and I use vs2005 with inter compiler 10.0 here is my code: ----------------------------------------------------------------------------------------------------------------------------------------- class CA{public: void tellme() { cout<<"I am ca"<<endl; }}; class CB{public: void tellme() { cout<<"I am cb"<<endl; }}; class CC{public: void tellme() { cout<<"I am cc"<<endl; }}; class dotellme{public: void operator()(boost::any& ra) { if(CA* p = boost::any_cast<CA>(&ra)) { p->tellme(); } else if (CB* p = boost::any_cast<CB>(&ra)) { p->tellme(); } else if (CC* p = boost::any_cast<CC>(&ra)) { p->tellme(); } else if(string* p = boost::any_cast<string>(&ra)) { cout<<*p<<endl; } else { int a; try { a = boost::any_cast<int>(ra); cout<<"it's int:"<<a<<endl; } catch (boost::bad_any_cast& e) { cout<<"OOPS"<<endl; } } }}; //void tellme(boost::any& ra)//{// dotellme()(ra);//}int _tmain(int argc, _TCHAR* argv[]){ vector<boost::any> va; va.push_back(CA()); va.push_back(CB()); va.push_back(CC()); va.push_back(string("haha,it a string")); va.push_back(dotellme()); va.push_back(5); dotellme dt; for_each(va.begin(),va.end(),dotellme()); va.clear(); return 0;} _________________________________________________________________ 手机也能上 MSN 聊天了，快来试试吧！ http://mobile.msn.com.cn/

1 0

Boost 1.35 Release Date
by Chauhan, Vikas 17 Jan '08

17 Jan '08

Hello all, Following on the original post. Does anybody have anymore updates on BOOST 1.35 (rc1) release date? Is there a location on Boost website where I can get this information? Thanks and regards, Vikas > Message: 6 > Date: Wed, 28 Nov 2007 16:37:43 +0100 > From: "Tarjei Knapstad" <tarjei.knapstad(a)gmail.com> > Subject: Re: [Boost-users] Boost 1.35 release date > To: boost-users(a)lists.boost.org > Message-ID: > <ff5e09cc0711280737g1a1b919cw9633f00e0a1346de(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > On 26/11/2007, Chauhan, Vikas <Vikas.Chauhan(a)anritsu.com> wrote: > > > > Hello, > > > > Can you please advise the planned release date for BOOST > 1.35 version. > > > > >From Beman's post on the main Boost list: > <quote> > * Merge for release complete: Sunday, November 25th. > * Start testing release candidate build process: Monday, December 3rd. > * Release Candidate 1: Monday, December 10th. > </quote> > > So I'm guessing early next year if there's not too much > trouble with the RC's. My guess is as good as yours though :) > > -- > Tarjei >

4 5

Re: [Boost-users] [boost] [switch_] Compound Cases [was Case Concept]
by Steven Watanabe 17 Jan '08

17 Jan '08

AMDG Joel de Guzman wrote: > Steven Watanabe wrote: > > >> Also, one thing that needs to be nailed down is: What Is I? >> Tobias was using it as the index into the list of labels: >> mpl::int_<0>, mpl::int_<1>, mpl::int_<2>, ... >> In my original interface and as you seem to be using it I is one of: >> mpl::at_c<labels, 0>::type, mpl::at_c<labels, 1>::type, >> mpl::at_c<labels, 2>::type >> > > It's in the concept I presented: > > I An MPL Integral Constant type > > Here: > > http://boost.org/libs/mpl/doc/refmanual/integral-constant.html > > Anything special I am missing? > What I meant was where they come from and thus how they should be interpreted. If you have mpl::vector_c<int, 4,2, 7> do you get mpl::int_<0>, mpl::int_<1>, and mpl::int_<2> or mpl::int_<4>, mpl::int_<2>, and mpl::int_<7>? In Christ, Steven Watanabe

2 1

Jamfiles and project
by Mojmir Svoboda 17 Jan '08

17 Jan '08

Hello, I'm having trouble assembling Jamfiles.v2 correctly: Let's assume i have following hierarchy: ~ - devel $DEVEL_ROOT +- boost $BOOST_ROOT +- mt +- flog Jamfile.v2, Jamroot +- doc +- test +-test1 - Jamfile.v2 . +-testN - Jamfile.v2 Q1: How do I include headers/project with absolute path in flog/test/test1/Jamfile.v2? <include>$DEVEL_ROOT or <library>$DEVEL_ROOT/mt/mt Right now it's relative to ~/devel/flog. Q2: How do I include something conditionaly based on threading model? something like if (threading==multi) { include project mt } To be honest, as a new user i'd appreciate some helloworldish project sample, from which the usage of building framework should be obvious. Many thanks, Mojmir

1 0

problems linking boost_date_time
by jerome.wacongne＠fxoverlay.com 17 Jan '08

17 Jan '08

Hi, Here is what I get when I try to link my unit tests agains boost_date_time. g++ -LC:\dev\workspace\fxoverlayFundation\Debug -LC:\dev\workspace\fxoverlayBusiness\Debug -LC:\dev\boost_1_34_1\stage\lib -ofxoverlayBusinessTests.exe emptyTests.o allTests.o InterestRateTests.o InterestCurveTests.o -lboost_date_time-mgw34-d-1_34_1 -lboost_unit_test_framework-mgw34-d-1_34_1 -lfxoverlayBusiness -lfxoverlayFundation C:\dev\workspace\fxoverlayBusiness\Debug/libfxoverlayBusiness.a(InterestCurve.o): In function `ZSt10_ConstructISt4pairIKSsN3com9fxoverlay8business12InterestRateEES6_EvPT_RKT0_': C:/dev/msys/MinGW/bin/../lib/gcc/mingw32/3.4.5/../../../../include/c++/3.4.5/bits/stl_tree.h:(.text$_ZN5boost9date_time15month_formatterINS_9gregorian10greg_monthENS0_13simple_formatIcEEcE12format_monthERKS3_RSo[boost::date_time::month_formatter<boost::gregorian::greg_month, boost::date_time::simple_format<char>, char>::format_month(boost::gregorian::greg_month const&, std::basic_ostream<char, std::char_traits<char> >&)]+0x38): undefined reference to `boost::gregorian::greg_month::as_short_string() const' C:/dev/msys/MinGW/bin/../lib/gcc/mingw32/3.4.5/../../../../include/c++/3.4.5/bits/stl_tree.h:(.text$_ZN5boost9date_time15month_formatterINS_9gregorian10greg_monthENS0_13simple_formatIcEEcE12format_monthERKS3_RSo[boost::date_time::month_formatter<boost::gregorian::greg_month, boost::date_time::simple_format<char>, char>::format_month(boost::gregorian::greg_month const&, std::basic_ostream<char, std::char_traits<char> >&)]+0x57): undefined reference to `boost::gregorian::greg_month::as_long_string() const' Both "libboost_date_time-mgw34-d-1_34_1.a" and "liboost_unit_test_framework-mgw34-d-1_34_1.a" are in "C:\dev\boost_1_34_1\stage\lib" Here are my includes : #include <boost/date_time/posix_time/ptime.hpp> #include <boost/date_time/posix_time/time_parsers.hpp> #include <boost/date_time/posix_time/time_formatters.hpp> using namespace boost::posix_time; The functions I actualy use are : from_iso_string() and to_simple_string() (wich build a ptime from a string and return a string from a ptime) I would apreciate any suggestion to make my program compile and link. Regards, Jérôme This message and any attachments (the "message") is intended solely for the addressees and is confidential. If you receive this message in error, please delete it and immediately notify the sender. Any use not in accord with its purpose, any dissemination or disclosure, either whole or partial, is prohibited except formal approval. The internet can not guarantee the integrity of this message. Overlay AM (and its subsidiaries) shall (will) not therefore be liable for the message if modified. --------------------------------------------- Ce message et toutes les pieces jointes (ci-apres le "message") sont etablis a l'intention exclusive de ses destinataires et sont confidentiels. Si vous recevez ce message par erreur, merci de le detruire et d'en avertir immediatement l'expediteur. Toute utilisation de ce message non conforme a sa destination, toute diffusion ou toute publication, totale ou partielle, est interdite, sauf autorisation expresse. L'internet ne permettant pas d'assurer l'integrite de ce message, Overlay AM (et ses filiales) decline(nt) toute responsabilite au titre de ce message, dans l'hypothese ou il aurait ete modifie.

2 2

Re: [Boost-users] Memory Leak Detection output format
by Jamie Cook 17 Jan '08

17 Jan '08

Gennadiy, thanks for the quick reply. I've followed your advice but with little luck :( I have a very simple test project which is not still giving me the same old output my std_afx.h (precompiled headers are turned off) // ----------------------------------------------------------------------------------------------------------- #pragma once #define _CRTDBG_MAP_ALLOC #include <crtdbg.h> // #ifdef _DEBUG // #include <new> // #define BOOST_TEST_DEBUG_NEW new( _CLIENT_BLOCK, __FILE__, __LINE__) // #define new BOOST_TEST_DEBUG_NEW // #else // #define BOOST_TEST_DEBUG_NEW // #endif #define BOOST_TEST_MAIN #include <boost/test/unit_test.hpp> #include <boost/test/floating_point_comparison.hpp> #include <boost/filesystem.hpp> // Windows Header Files: #define WIN32_LEAN_AND_MEAN // Exclude rarely-used stuff from Windows headers #include <windows.h> // ----------------------------------------------------------------------------------------------------------- my test cpp file // ----------------------------------------------------------------------------------------------------------- #include "std_afx.h" #include <iostream> BOOST_AUTO_TEST_CASE( SimpleTestCase ) { int i = 9; i++; int * j = new int[101]; } // ----------------------------------------------------------------------------------------------------------- and this generates the following output when i run the executable... ================================================ Running 1 test case... *** No errors detected Detected memory leaks! Dumping objects -> {203} normal block at 0x00368D40, 404 bytes long. Data: < > CD CD CD CD CD CD CD CD CD CD CD CD CD CD CD CD {164} normal block at 0x00368158, 1280 bytes long. Data: <x 6 lationStatis> 78 83 36 00 6C 61 74 69 6F 6E 53 74 61 74 69 73 Object dump complete. ================================================ As you can see the test case introduces an easy to spot memory leak of 101 integers (at 4 bytes a pop = 404 bytes). I've done this with your debug block uncommented and the output is exactly the same... One thing I did have to do to get that block to compile was add the #include <new>, if that wasn't there I got an error from stlport stating that c:\program files\stlport-5.1.4\stlport\stl\_new.h(47) : fatal error C1189: #error : Cannot include native new header as new is a macro.-- I think the problem is that even though I've compiled stlport with settings telling it to use regular old new/delete and not it's own super-duper new/delete, that it is still using it's own internal versions of 'regular' new and delete... I'll try fiddling with some options in stlport unless you can think of any other reason it would continue to have this behaviour? Jamie Cook Research Engineer ………………………………………..………………… Veitch Lister Consulting Pty Ltd. Ground Floor, 80 Jephson St, PO Box 1054, Toowong, QLD 4066 AUSTRALIA Ph: +61 7 3870 4888 Fax: +61 7 3870 4446 Email: jamie.cook(a)veitchlister.com.au Web: www.veitchlister.com.au ………………………………………..…………………

2 1

Unserialize throws an exception
by Lorenzo Cavallaro 17 Jan '08

17 Jan '08

Dear all, I'm trying to unserialize a boost::archive::text_iarchive. The code used to work, but know (for no apparent reasons) it's calling terminate throwing the following exception. terminate called after throwing an instance of 'boost::archive::archive_exception what(): stream error Aborted The piece of code is very simple: std::ifstream ifs(filename); boost::archive::text_iarchive ia(ifs); ia >> map; where map is an STL hash_multimap. Any ideas? Btw, this is one of the first thing I'm doing in the code. Nonetheless to say, another code of mine which serialize and unserialize works like a charm... Boost library version is 1.34.1. TIA, bye Lorenzo -- Lorenzo `Gigi Sullivan' Cavallaro <sullivan(a)security.dico.unimi.it> GPG key at http://security.dico.unimi.it/~sullivan/sullivan.asc Until I loved, life had no beauty; I did not know I lived until I had loved. (Theodor Korner) See the reality in your eyes, when the hate makes you blind. (A.H.X)

3 4

[signals] problem when disconnecting slots
by raimar wagner 16 Jan '08

16 Jan '08

Hello! I'm trying to use the boost signals library to implement a callback system, but my first test-application (see boost_test_app.cpp in attachment) won't compile. The connect method works as expected, but if I'm trying to disconnect my slot (in line 28: " mySignal.disconnect(slot);") a compiler error message appears. The error message: /path_to_boost/include/boost-1 _34_1/boost/boost/function_equal.hpp:17: error: no match for 'operator==' in 'f == g' /path_to_boost/include/boost-1_34_1/boost/function/function_base.hpp:577: note: candidates are: bool boost::operator==(const boost::function_base&, boost::detail::function::useless_clear_type*) /path_to_boost/include/boost-1_34_1/boost/function/function_base.hpp:589: note: bool boost::operator==(boost::detail::function::useless_clear_type*, const boost::function_base&) My compile command: g++ -I/path_to_boost/include/boost-1_34_1/ -g -o boost_test_app boost_test_app.cpp -L/path_to_boost/lib -lboost_signals-gcc41 I'm using boost 1.34.1 with g++ (GCC) 4.1.0 (SUSE Linux) as compiler. Best regards Raimar

4 3

Casting a shared_ptr as a prototyped (void *)?
by Elli Barasch 16 Jan '08

16 Jan '08

I'd like to pass a shared_ptr as the entry argument to a thread function via pthread_create. However, the entry argument is prototyped as void *. I can't simply cast the shared pointer as a (void *). How do I go about this?

6 10

Re: [Boost-users] Boost.Test Framework to test a DLL
by Plonka Christian 16 Jan '08

16 Jan '08

Hi Ovanes, I found the problem. The console_test_runner and my NetCtrld.dll used different boost_unit_test_framework-....dll's. So I had two different master test suites, one in each DLL. Now it seems to be working. Thanks, Christian ________________________________ Von: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] Im Auftrag von Ovanes Markarian Gesendet: Dienstag, 15. Jänner 2008 18:40 An: boost-users(a)lists.boost.org Betreff: Re: [Boost-users] Boost.Test Framework to test a DLL Is there any chance that Boost.Test can not load (find) your DLL? Try to copy console_test_runner into the directory which contains your DLL? Debug DLLs under VC++ have usually a suffix 'D' before .dll. The letter NetCtrl->d<-.dll is probably this suffix. If not, add it, so that the name is NetCtrldD.dll With Kind Regards, Ovanes On Jan 15, 2008 9:55 AM, Plonka Christian <christian.plonka(a)amst.co.at> wrote: Hi, I'm planning to change from CppUnit to Boost.Test for unit testing since it is now possible to integrate unit tests also in a DLL. Nevertheless I do encounter some problems here. The code is (I guess you'll recognize it): //---------------------------------------------------------------------- --- #define BOOST_TEST_DYN_LINK #include <boost/test/unit_test.hpp> using namespace boost::unit_test; BOOST_AUTO_TEST_CASE( test1 ) // void test1() { int i = 0; BOOST_CHECK_EQUAL( i, 2 ); } BOOST_AUTO_TEST_CASE( test2 ) { BOOST_CHECKPOINT("About to force division by zero!"); int i = 1, j = 0; i = i / j; } extern "C" { __declspec(dllexport) bool init_unit_test() { printf("Initializing\n"); framework::master_test_suite().p_name.value = "Test runner test"; // framework::master_test_suite().add( BOOST_TEST_CASE( &test1 ) ); return true; } } //---------------------------------------------------------------------- --- I the sample (test_runner_test.dll) it works fine but when I use it in my DLL I get: C:\Projekte\Test\NetControl\bin>console_test_runner --test NetCtrld.dll Initializing Test setup error: test tree is empty I also tried the commented version using master_test_suite().add() without any change. Any hint what I can try or how I can debug this? Thanks, Christian _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

[program options] support for sections
by Ovanes Markarian 16 Jan '08

16 Jan '08

Hello! In my last project I remeber to see somewhere that boost::program_options library supports config files sections. But I can not find any hints to this feature in the current doc. Does anyone has an experience with sections in the config file? With Kind Regards, Ovanes

1 1

Re: [Boost-users] Boost.Test Framework to test a DLL
by Plonka Christian 16 Jan '08

16 Jan '08

Hi Ovanes, this is, why I added 'printf("Initializing\n"); to init_unit_test() in my DLL. As this is indeed printed before the error message, I think that the lib is found and loaded. Furthermore, if the lib cannot be found, I get: C:\Projekte\Test\NetControl\bin>console_test_runner --test NetCtrl.dll Boost.Test framework internal error: unknown reason So it seems that the DLL is loaded and init_unit_test() is invoked, but the test cases are not registered ... Christian ________________________________ Von: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] Im Auftrag von Ovanes Markarian Gesendet: Dienstag, 15. Jänner 2008 18:40 An: boost-users(a)lists.boost.org Betreff: Re: [Boost-users] Boost.Test Framework to test a DLL Is there any chance that Boost.Test can not load (find) your DLL? Try to copy console_test_runner into the directory which contains your DLL? Debug DLLs under VC++ have usually a suffix 'D' before .dll. The letter NetCtrl->d<-.dll is probably this suffix. If not, add it, so that the name is NetCtrldD.dll With Kind Regards, Ovanes On Jan 15, 2008 9:55 AM, Plonka Christian <christian.plonka(a)amst.co.at> wrote: Hi, I'm planning to change from CppUnit to Boost.Test for unit testing since it is now possible to integrate unit tests also in a DLL. Nevertheless I do encounter some problems here. The code is (I guess you'll recognize it): //---------------------------------------------------------------------- --- #define BOOST_TEST_DYN_LINK #include <boost/test/unit_test.hpp> using namespace boost::unit_test; BOOST_AUTO_TEST_CASE( test1 ) // void test1() { int i = 0; BOOST_CHECK_EQUAL( i, 2 ); } BOOST_AUTO_TEST_CASE( test2 ) { BOOST_CHECKPOINT("About to force division by zero!"); int i = 1, j = 0; i = i / j; } extern "C" { __declspec(dllexport) bool init_unit_test() { printf("Initializing\n"); framework::master_test_suite().p_name.value = "Test runner test"; // framework::master_test_suite().add( BOOST_TEST_CASE( &test1 ) ); return true; } } //---------------------------------------------------------------------- --- I the sample (test_runner_test.dll) it works fine but when I use it in my DLL I get: C:\Projekte\Test\NetControl\bin>console_test_runner --test NetCtrld.dll Initializing Test setup error: test tree is empty I also tried the commented version using master_test_suite().add() without any change. Any hint what I can try or how I can debug this? Thanks, Christian _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Applying Boost license to non boost projects
by Roshan Naik 16 Jan '08

16 Jan '08

I am interested in adopting the Boost Software license for an open source C++ library (Castor: http://www.mpprogramming.com/2.html) The Boost FAQ describes how to apply the license to Boost header files. It basically states that the foll. lines should be included: // Copyright Joe Coder 2004 - 2006. // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) - Does this same guideline apply to non boost projects ? The need for stating Boost.org there might confuse some users of non boost prj to think that the library is supplied by Boost. - Do all header files in my prj (which is a pure header library) need to include this text at the top/somewhere in order to adopt the license. -Roshan

2 1

[iostreams and serialization] serialize via iostreams
by Pooyan McSporran 15 Jan '08

15 Jan '08

I'm trying to use a combination of the iostreams library and the serialization library in order to be able to serialise objects and send them over a socket. I've written a class called "SocketDevice" which implements a bidirectional iostreams instance, and I'm trying to use this with serialization, in particular the binary_oarchive and binary_iarchive archive models. The problem is that when I do this, the code ends up calling a copy constructor (which doesn't exist) on my SocketDevice class. However I don't want to implement a copy constructor for this class as it doesn't make sense (as it manages a socket and a buffer for that socket, etc). The interface of my SocketDevice class looks like this: class SocketDevice : public boost::iostreams::device<boost::iostreams::bidirectional> { public: typedef char char_type; SocketDevice (int sock); ~SocketDevice (); std::streamsize read (char *s, std::streamsize n); std::streamsize write (const char *s, std::streamsize n); private: const int sock; char *buffer; size_t bufferSize; }; and I'm trying to do the object sending/receiving via template methods, eg: template<class C> void sendObject (const C& data, int sock) { boost::iostreams::stream_buffer<SocketDevice> buf (sock); std::ostream s (&buf); boost::archive::binary_oarchive oa (s); oa << data; } The copy constructor appears to be synthesised when the 'buf' object is instantiated in the above template method. My guess is that I'm doing something wrong, but I can't see what. I've also tried splitting my SocketDevice class from a bidirectional one to a pair of input & output ones, but with the same result. I've also tried making sendObject() a normal (non-template) method, this makes no difference. I realise that there are issues with trying to combine socket communications with object serialisation, but I'm still curious as to why I have this copy constructor issue.

2 2

Re: [Boost-users] templates w/ non-type arguments
by Hicham Mouline 15 Jan '08

15 Jan '08

I realize my question was not complete! Is it possible to write the 3 x 3 x 3 explicit instantiations, not with 27 lines of code, but perhaps in some kind of loop? Rds, -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Michael Gopshtein Sent: 15 January 2008 08:51 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] templates w/ non-type arguments "Hicham Mouline" <hicham(a)mouline.org> wrote in message news:20080114191355.0EA71200C2@ws6-7.us4.outblaze.com... > Hello, > > I have: > enum ParamType { FLAT, CURVE1D, CURVE2D }; > > template<ParamType r, ParamType q, ParamType v> > class TIP: > { > }; > > I would like to explicitly write all the possible full specializations of > TIP... > template class TIP<FLAT, FLAT, FLAT>; template<> class TIP<FLAT, FLAT, FLAT> {}; template<> class TIP<FLAT, FLAT, CURVE1D> {}; etc. > ... > > regards,

2 1

Boost.Test Framework to test a DLL
by Plonka Christian 15 Jan '08

15 Jan '08

Hi, I'm planning to change from CppUnit to Boost.Test for unit testing since it is now possible to integrate unit tests also in a DLL. Nevertheless I do encounter some problems here. The code is (I guess you'll recognize it): //---------------------------------------------------------------------- --- #define BOOST_TEST_DYN_LINK #include <boost/test/unit_test.hpp> using namespace boost::unit_test; BOOST_AUTO_TEST_CASE( test1 ) // void test1() { int i = 0; BOOST_CHECK_EQUAL( i, 2 ); } BOOST_AUTO_TEST_CASE( test2 ) { BOOST_CHECKPOINT("About to force division by zero!"); int i = 1, j = 0; i = i / j; } extern "C" { __declspec(dllexport) bool init_unit_test() { printf("Initializing\n"); framework::master_test_suite().p_name.value = "Test runner test"; // framework::master_test_suite().add( BOOST_TEST_CASE( &test1 ) ); return true; } } //---------------------------------------------------------------------- --- I the sample (test_runner_test.dll) it works fine but when I use it in my DLL I get: C:\Projekte\Test\NetControl\bin>console_test_runner --test NetCtrld.dll Initializing Test setup error: test tree is empty I also tried the commented version using master_test_suite().add() without any change. Any hint what I can try or how I can debug this? Thanks, Christian

2 1

MetaComm and Boost Consulting SVN daily snapshot services
by Joaquín Mª López Muñoz 15 Jan '08

15 Jan '08

Hello, Some time ago, there were two places where users could download daily snapshots of the Boost repository: * http://engineering.meta-comm.com/boost.aspx (linked from boost.org) * http://www.boost-consulting.com/boost.tar.bz2 Alas, none of them are being updated anymore. It'd be great if at least one could be put back in business, as this is a very useful service for casual Boost users without SVN tools. Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[DateTime] format flag to print single-digit hour?
by Boris 15 Jan '08

15 Jan '08

I'm using the Boost.DateTime IO system to create customized date/time strings. While the library supports quite a lot of format flags out of the box I'm missing a format flag to print a single-digit hour. There is the format flag %k though (see http://www.boost.org/doc/html/date_time/date_time_io.html#date_time.format_…) - however it adds a preceding blank for single-digit hours. I guess there is currently no format flag for single-digit hours? Is it possible then to extend the Boost.DateTime IO system somehow to add your own format flag? While I could use another library like Boost.Format additionally I prefer to stick to one (it might make more sense then to switch to Boost.Format completely)? Boris

1 0

templates w/ non-type arguments
by Hicham Mouline 15 Jan '08

15 Jan '08

Hello, I have: enum ParamType { FLAT, CURVE1D, CURVE2D }; template<ParamType r, ParamType q, ParamType v> class TIP: { }; I would like to explicitly write all the possible full specializations of TIP... template class TIP<FLAT, FLAT, FLAT>; ... regards,

2 1

Re: [Boost-users] [boost] [switch_] Compound Cases [was Case Concept]
by Steven Watanabe 15 Jan '08

15 Jan '08

AMDG Joel de Guzman wrote: > Steven Watanabe wrote: > >> My concern is >> 1) fall-through can't easily be added to the interface. >> > > I have an idea I'd like to post in another update to the > case concept. > Great. > The point is that it is just another case. Whatever the > sequenced_case is, it's just a model of the case concept. > Sure it still has to be documented, but not as a separate > concept, but as a model of it. > > Also, to me, it's most trivial to just make it an ET > tree: > > template< class CaseL, class CaseR > > struct binary_case > { > CaseL l; > CaseR r; > > binary_case(CaseL const& l, CaseR const& r) > : l(l), r(r) {} > > typedef mpl::joint_view< > typename CaseL::labels, typename CaseR::labels > > labels; > > template< typename Result, class I > > Result apply(I); > }; > > Key points: > > * apply is part of the concept. In this case, it dispatches > to l or r depending on I > > * hmmm.... maybe labels should be an mpl set. > No, thank you. mpl set is buggy and slow. Also, one thing that needs to be nailed down is: What Is I? Tobias was using it as the index into the list of labels: mpl::int_<0>, mpl::int_<1>, mpl::int_<2>, ... In my original interface and as you seem to be using it I is one of: mpl::at_c<labels, 0>::type, mpl::at_c<labels, 1>::type, mpl::at_c<labels, 2>::type In Christ, Steven Watanabe

1 0

Re: [Boost-users] [boost] [switch_] Case Concept [ was Re: formal review of Switch library...]
by Steven Watanabe 14 Jan '08

14 Jan '08

AMDG Joel de Guzman wrote: > Valid Expressions: > > Expression Semantics > ---------- > -------------------------------------------------------- > C::labels An MPL Sequence of Integral Constants > I think that a case should only have a single label. Allowing multiple labels makes the implementation harder without adding any significant utility. See below. > case_<I>(f) Returns a Case object with supplied > <snip more generators> > These can return fusion sequences of cases instead of plain cases. This has the additional benefit that switch_ can be specified as taking a fusion sequence of cases, without having to handle a single case specially. > default_(f) Returns a Case object with an empty labels list. > forwarding to the encapsulated function object f. > From the standpoint of the implementor of switch_, how do I figure out which Case is the default? > * case_c and case_range_c are simple shortcuts. The type of > integral constant is int. The actual type can be casted to > the actual switch parameter. I think this is safe Since the value is known at compile time the cast can be checked at compile time to detect overflow. In Christ, Steven Watanabe

2 3

Re: [Boost-users] [boost] [switch_] Case Concept [ was Re: formal review of Switch library...]
by Steven Watanabe 14 Jan '08

14 Jan '08

AMDG Tobias Schwinger wrote: > Joel de Guzman wrote: > >> c0, c1, ... cN Returns a fusion sequence of Case objects >> > > seemingly equivalent to > > (c0, c1, ... cN) > > (note: Application of comma operator ;-)). > > > ?! Why doesn't it just return another (compound) Case object and leave > the Sequence an unspecified implementation detail... > So you want switch_ to be template<class R, class I, class Cases> requires Case<Cases> && BuiltInIntegerOrEnum<I> R switch(I i, Cases cases); IMO, There is a very big problem here. Suppose that you have a fusion sequence that holds your cases and function objects coming from somewhere else. The problem of adapting it to switch_ is no easier than it would be with my original interface. In Christ, Steven Watanabe

3 6

Re: [Boost-users] [boost::logging] using rolling files failed
by John Torjo 14 Jan '08

14 Jan '08

Hi Benjamin, Sorry for that. It's because I introduced a breaking change: after you initialize the log, call: g_logger->turn_cache_off(); That should do the trick. Best, John > Hi John, > > I'm working on integrating your last modifications about flushing > rolling files, but I encounter some problems. > > With version V0.11.7, I change rolling_file.hpp (see attached file) to > flush logs each time. It works fine. > > /destination::rolling_file_settings settings; > settings.file_count( 10 ); > settings.max_size_bytes( 5242880 ); > destination::rolling_file loggerFile( logFile.GetPath(), settings ); > g_logger->writer().add_destination( loggerFile ); > / > > With last version (revision 42765), I just add one line. / > / > > /destination::rolling_file_settings settings;/ > /settings.file_count( 10 );/ > /settings.max_size_bytes( 5242880 ); / > */=> settings.flush_each_time(true); // add this line/* > /destination::rolling_file loggerFile( logFile.GetPath(), settings );/ > /g_logger->writer().add_destination( loggerFile );/ > > Then it doesn't work. > I put a break point in rolling_file_info#write but my program does not > enter in it anymore ! > I think that rolling file objects are not instanciated because output > files are MY_FILE.txt and not MY_FILE.txt.1 > > Even if it will not compile alone, I give you my class Logger to see > my implementation. > > Regards, > Benjamin > > > ------------------------------------------------------------------------ > > // destination_rolling_file.hpp > > // Boost Logging library > // > // Author: John Torjo, www.torjo.com > // > // Copyright (C) 2007 John Torjo (see www.torjo.com for email) > // > // Distributed under the Boost Software License, Version 1.0. > // (See accompanying file LICENSE_1_0.txt or copy at > // http://www.boost.org/LICENSE_1_0.txt) > // > // See http://www.boost.org for updates, documentation, and revision history. > // See http://www.torjo.com/log2/ for more details > > > #ifndef JT28092007_destination_rolling_file_HPP_DEFINED > #define JT28092007_destination_rolling_file_HPP_DEFINED > > #if defined(_MSC_VER) && (_MSC_VER >= 1020) > # pragma once > #endif > > #if defined(_MSC_VER) > #pragma warning ( disable : 4355) > #endif > > #include <boost/logging/detail/fwd.hpp> > #include <boost/logging/detail/manipulator.hpp> > #include <boost/logging/format/destination/convert_destination.hpp> > #include <fstream> > #include <string> > #include <sstream> > #include <boost/filesystem/path.hpp> > #include <boost/filesystem/operations.hpp> > > namespace boost { namespace logging { namespace destination { > > > /** > @brief Settings you can pass to the rolling file. To see how it's used, see @ref dealing_with_flags. > */ > struct rolling_file_settings { > typedef boost::logging::detail::flag<rolling_file_settings> flag; > > rolling_file_settings() > : max_size_bytes(this, 1024 * 1024) > , file_count(this, 10) > , initial_erase(this, false) > , start_where_size_not_exceeded(this, true) > {} > > /// maximum size in bytes, by default 1Mb > flag::t<int> max_size_bytes; > /// how many files has a rolling file, by default, 10 > flag::t<int> file_count; > /// if true, it initially erases all files from the rolling file (by default, false) > flag::t<bool> initial_erase; > /// if true, it starts with the first file that hasn't exceeded the max size; > /// otherwise, it starts with the first file (default = true) > flag::t<bool> start_where_size_not_exceeded; > }; > > namespace detail { > template<class convert_dest > > struct rolling_file_info { > > rolling_file_info (const std::string& name_prefix, rolling_file_settings flags ) > // many thanks to Martin Bauer > : m_name_prefix(name_prefix), m_flags(flags), m_cur_idx(0) { > namespace fs = boost::filesystem; > > if ( m_flags.initial_erase()) { > for ( int idx = 0; idx < m_flags.file_count(); ++idx) > if ( fs::exists( file_name(idx) )) > fs::remove( file_name(idx) ); > } > > // see what file to start from > if ( m_flags.start_where_size_not_exceeded() ) { > for ( m_cur_idx = 0; m_cur_idx < m_flags.file_count(); ++m_cur_idx ) > if ( fs::exists( file_name(m_cur_idx) )) { > if ( fs::file_size( file_name(m_cur_idx)) < m_flags.max_size_bytes() ) > // file hasn't reached max size > break; > } > else > // file not found, we'll create it now > break; > > } > > recreate_file(); > } > > std::string file_name(int idx) { > std::ostringstream out; > out << m_name_prefix << "." << (idx+1); > return out.str(); > } > > void recreate_file() { > m_out = boost::shared_ptr< std::basic_ofstream<char_type> >(new std::basic_ofstream<char_type>( file_name(m_cur_idx).c_str(), > std::ios_base::out | std::ios_base::app)); > m_cur_size = 0; > } > > template<class msg_type> void write( const msg_type& msg) { > convert_dest::write(msg, (*m_out) ); > > // bdd 2007-12-10 : flush each time > m_cur_size += static_cast<int>( msg.size() ); > m_out->flush(); > > // bdd > //if ( m_out->tellp() > m_flags.max_size_bytes()) { > if ( m_cur_size > m_flags.max_size_bytes()) { > m_cur_idx = (m_cur_idx + 1) % m_flags.file_count(); > recreate_file(); > } > } > > boost::shared_ptr< std::basic_ofstream<char_type> > m_out; > std::string m_name_prefix; > rolling_file_settings m_flags; > // the index of the current file > int m_cur_idx; > > // bdd 2007-12-10 : flush each time > //size_t m_cur_size; > int m_cur_size; > }; > } > > /** > @brief Writes to multiple files: name_prefix.1, name_prefix.2, ... name_prefix.N, and then restarts from 1. > > We first write to name_prefix.1. > > The log has a max_size. When max_size is reached, we start writing to name_prefix.2. When max_size is reached, we start writing to name_prefix.3. > And so on, until we reach name_prefix.N (N = file_count). When that gets fool, we start over, with name_prefix.1. > */ > template<class convert_dest = do_convert_destination > struct rolling_file_t : is_generic, non_const_context<detail::rolling_file_info<convert_dest> > { > typedef non_const_context<detail::rolling_file_info<convert_dest> > non_const_context_base; > > /** > Constructs a rolling file > > @param name_prefix the name to be used as prefix for the files > > @param flags [optional] extra settings to pass to the rolling file. See rolling_file_settings and @ref dealing_with_flags. > */ > rolling_file_t(const std::string & name_prefix, rolling_file_settings flags = rolling_file_settings() ) : non_const_context_base(name_prefix, flags) {} > > template<class msg_type> void operator()( const msg_type & msg) const { > non_const_context_base::context().write(msg); > } > > bool operator==(const rolling_file_t & other) const { > return non_const_context_base::context().m_name_prefix == other.context().m_name_prefix; > } > }; > > /** @brief rolling_file_t with default values. See rolling_file_t > > @copydoc rolling_file_t > */ > typedef rolling_file_t<> rolling_file; > > > > > }}} > > #endif > > > ------------------------------------------------------------------------ > > > > //============================================================================= > // Includes > //============================================================================= > #include "StdAfx.h" > #include "common/log/Logger.h" > > //----- MEDCommon ----- > #include "common/system/ApplicationHelper.h" > #include "common/io/Directory.h" > #include "common/system/Time.h" > > //----- boost ----- > #pragma warning(disable: 4541) > > #include "boost/logging/tags.hpp" > #include "boost/logging/defaults.hpp" > #include "boost/logging/format.hpp" > #include "boost/logging/format_all.hpp" > #include "boost/logging/format_fwd.hpp" > #include "boost/logging/format_ts.hpp" > #include "boost/logging/logging.hpp" > #include "boost/logging/detail/error.hpp" > #include "boost/logging/detail/filter.hpp" > #include "boost/logging/detail/find_gather.hpp" > #include "boost/logging/detail/format_msg_type.hpp" > #include "boost/logging/detail/format_write_detail.hpp" > #include "boost/logging/detail/forward_constructor.hpp" > #include "boost/logging/detail/fwd.hpp" > #include "boost/logging/detail/level.hpp" > #include "boost/logging/detail/log_keeper.hpp" > #include "boost/logging/detail/logger.hpp" > #include "boost/logging/detail/macros.hpp" > #include "boost/logging/detail/manipulator.hpp" > #include "boost/logging/detail/scenario.hpp" > #include "boost/logging/detail/template.hpp" > #include "boost/logging/detail/use_format_write.hpp" > // raw_doc ? > #include "boost/logging/detail/ts/ts.hpp" > #include "boost/logging/detail/ts/ts_boost.hpp" > #include "boost/logging/detail/ts/ts_none.hpp" > //#include "boost/logging/detail/ts/ts_posix.hpp" > #include "boost/logging/detail/ts/ts_resource.hpp" > #include "boost/logging/detail/ts/ts_win32.hpp" > #include "boost/logging/detail/tss/tss.hpp" > #include "boost/logging/detail/tss/tss_ensure_proper_delete.hpp" > #include "boost/logging/detail/tss/tss_impl.hpp" > //#include "boost/logging/detail/tss/tss_impl_pthread.hpp" > #include "boost/logging/detail/tss/tss_impl_win32.hpp" > #include "boost/logging/format/array.hpp" > #include "boost/logging/format/op_equal.hpp" > #include "boost/logging/format/optimize.hpp" > #include "boost/logging/format/destination/convert_destination.hpp" > #include "boost/logging/format/destination/defaults.hpp" > #include "boost/logging/format/destination/file.hpp" > #include "boost/logging/format/destination/rolling_file.hpp" > #include "boost/logging/format/destination/shared_memory.hpp" > #include "boost/logging/format/formatter/convert_format.hpp" > #include "boost/logging/format/formatter/defaults.hpp" > #include "boost/logging/format/formatter/tags.hpp" > #include "boost/logging/format/formatter/thread_id.hpp" > #include "boost/logging/format/formatter/time.hpp" > #include "boost/logging/gather/ostream_like.hpp" > #include "boost/logging/tag/defaults.hpp" > #include "boost/logging/writer/format_write.hpp" > #include "boost/logging/writer/on_dedicated_thread.hpp" > #include "boost/logging/writer/ts_write.hpp" > > using namespace boost::logging; > > //----- Step 3 : Specify your logging class(es) ----- > //typedef logger_format_write< > log_type; > // thread safe > typedef logger_format_write< default_, default_, writer::threading::ts_write > log_type; > //typedef logger_format_write< default_, default_, writer::threading::on_dedicated_thread > log_type; > > //----- Step 4: declare which filters and loggers you'll use (usually in a header file) ----- > // filter > BOOST_DECLARE_LOG_FILTER(g_log_level, level::holder ) > BOOST_DECLARE_LOG_FILTER(g_audit_filter, filter::ts ) > > // logger > BOOST_DECLARE_LOG(g_logger, log_type) > BOOST_DECLARE_LOG(g_audit, log_type) > BOOST_DECLARE_LOG(g_debug, log_type) > > //----- Step 5: define the macros through which you'll log ----- > > //----- Step 6: Define the filters and loggers you'll use (usually in a source file) ----- > // filter > BOOST_DEFINE_LOG_FILTER(g_log_level, level::holder ) // holds the application log level > BOOST_DEFINE_LOG_FILTER(g_audit_filter, filter::ts ) > BOOST_DEFINE_LOG_FILTER(g_debug_filter, filter::ts ) > //BOOST_DEFINE_LOG_FILTER(g_audit_filter, filter::no_ts ) > // logger > BOOST_DEFINE_LOG(g_logger, log_type) > BOOST_DEFINE_LOG(g_audit, log_type) > BOOST_DEFINE_LOG(g_debug, log_type) > > using namespace common::log; > > //============================================================================= > // Global functions > //============================================================================= > void > Audit( const std::ostringstream & msg ) > { > Info( msg ); > BOOST_LOG_USE_LOG_IF_FILTER(g_audit, g_audit_filter->is_enabled() ) << "\t[AUDIT]\t" << msg.str(); > } > > void > Debug( const std::ostringstream & msg ) > { > BOOST_LOG_USE_LOG_IF_FILTER(g_debug, g_debug_filter->is_enabled() ) << "\t[DEBUG]\t" << msg.str(); > } > > void > Trace2( const std::ostringstream & msg ) > { > Debug( msg ); > common::log::Logger::s_traces.Push( msg.str() ); > } > > void > Info( const std::ostringstream & msg ) > { > BOOST_LOG_USE_LOG_IF_LEVEL(g_logger, g_log_level, info ) << "\t[INFO]\t" << msg.str(); > BOOST_LOG_USE_LOG_IF_FILTER(g_debug, g_debug_filter->is_enabled() ) << "\t[INFO]\t" << msg.str(); > } > > void > Warning( const std::ostringstream & msg ) > { > BOOST_LOG_USE_LOG_IF_LEVEL(g_logger, g_log_level, warning ) << "\t[WARN]\t" << msg.str(); > BOOST_LOG_USE_LOG_IF_FILTER(g_debug, g_debug_filter->is_enabled() ) << "\t[WARN]\t" << msg.str(); > } > > void > Error( const std::ostringstream & msg ) > { > if ( ! common::log::Logger::IsInitialized() ) > { > common::log::Logger::Init( "INIT" ); > } > if ( ! common::log::Logger::s_traces.IsEmpty() ) > { > // > vector<string> traces = common::log::Logger::s_traces.ToArray(); > for ( size_t i=0; i < traces.size(); i++ ) > { > BOOST_LOG_USE_LOG_IF_LEVEL(g_logger, g_log_level, error ) << "\t[TRACE]\t" << traces[i]; > } > } > BOOST_LOG_USE_LOG_IF_LEVEL(g_logger, g_log_level, error ) << "\t[ERROR]\t" << msg.str(); > BOOST_LOG_USE_LOG_IF_FILTER(g_debug, g_debug_filter->is_enabled() ) << "\t[ERROR]\t" << msg.str(); > } > > void > Exception( const std::ostringstream & msg ) > { > if ( ! common::log::Logger::IsInitialized() ) > { > common::log::Logger::Init( "INIT" ); > } > if ( ! common::log::Logger::s_traces.IsEmpty() ) > { > // > vector<string> traces = common::log::Logger::s_traces.ToArray(); > for ( size_t i=0; i < traces.size(); i++ ) > { > BOOST_LOG_USE_LOG_IF_LEVEL(g_logger, g_log_level, fatal ) << "\t[TRACE]\t" << traces[i]; > } > } > BOOST_LOG_USE_LOG_IF_LEVEL(g_logger, g_log_level, fatal ) << "\t[FATAL]\t" << msg.str(); > BOOST_LOG_USE_LOG_IF_FILTER(g_debug, g_debug_filter->is_enabled() ) << "\t[FATAL]\t" << msg.str(); > } > > > > //============================================================================= > // Class attributs > //============================================================================= > bool Logger::s_isInitialized = false; > bool Logger::MODE_DEBUG = false; > common::container::RollingStack<string> Logger::s_traces( 15 ); > > //============================================================================= > // Class methods > //============================================================================= > void > Logger::SetLevel( LEVEL level ) > { > g_audit_filter->set_enabled(true); > g_debug_filter->set_enabled(false); > switch ( level ) > { > case LEVEL_DEBUG : > Logger::MODE_DEBUG = true; > g_debug_filter->set_enabled(true); > g_log_level->set_enabled(level::debug); // debug > break; > case LEVEL_INFO : > g_log_level->set_enabled(level::info); // info + warning + ... > break; > case LEVEL_ERROR : > g_log_level->set_enabled(level::error); // error + fatal + ... > break; > default: > g_log_level->set_enabled(level::info); > break; > } > > } > > bool > Logger::IsInitialized() > { > return s_isInitialized; > } > > void > Logger::Init( const string & product ) > { > if ( s_isInitialized ) > { > return; > } > > // check log dir > common::system::ApplicationHelper ah; > common::io::Directory dir( ah.GetPath() + "logfiles" ); > dir.CheckAndCreate(); > > // init file names > //string date = common::system::Time::GetTime( common::system::Time::FORMAT_AAAA_MM_JJ ); > //common::io::File logFile( dir.GetPath() + date + "_" + product + ".txt" ); > //common::io::File auditFile( dir.GetPath() + date + "_AUDIT_" + product + ".txt" ); > common::io::File logFile( dir.GetPath() + product + ".txt" ); > common::io::File auditFile( dir.GetPath() + "AUDIT_" + product + ".txt" ); > common::io::File debugFile( dir.GetPath() + "DEBUG_" + product + ".txt" ); > > // Step 7: add formatters and destinations > // That is, how the message is to be formatted... > g_logger->writer().add_formatter( formatter::time("$dd/$MM/$yyyy - $hh:$mm.$ss ") ); > g_logger->writer().add_formatter( formatter::idx() ); > g_logger->writer().add_formatter( formatter::append_newline() ); > //g_log_err->writer().add_formatter( formatter::tag::module() ); // tag::file_line() ); > //g_log_err->writer().add_formatter( formatter::tag::level() ); > > g_audit->writer().add_formatter( formatter::time("$dd/$MM/$yyyy - $hh:$mm.$ss ") ); > g_audit->writer().add_formatter( formatter::idx() ); > g_audit->writer().add_formatter( formatter::append_newline() ); > > g_debug->writer().add_formatter( formatter::time("$dd/$MM/$yyyy - $hh:$mm.$ss ") ); > g_debug->writer().add_formatter( formatter::idx() ); > g_debug->writer().add_formatter( formatter::append_newline() ); > > g_logger->writer().add_destination( destination::cout() ); > > // bdd : rolling file : pb de flush (garde les donnees en cache) > destination::rolling_file_settings settings; > settings.file_count( 10 ); > settings.max_size_bytes( 5242880 ); // bytes = 5M > //settings.flush_each_time(true); > destination::rolling_file loggerFile( logFile.GetPath(), settings ); > g_logger->writer().add_destination( loggerFile ); > > g_debug->writer().add_destination( destination::dbg_window() ); > > destination::rolling_file_settings settingsD; > settingsD.file_count( 30 ); > settingsD.max_size_bytes( 10000000 ); // ~10M > //settingsD.flush_each_time(true); > g_debug->writer().add_destination( destination::rolling_file( debugFile.GetPath(), settingsD ) ); > > // bdd xml : en attente > //g_log_err->writer().add_destination( as_xml("logerror.xml") ); > > g_audit->writer().add_destination( destination::file( auditFile.GetPath() ) ); > > #ifdef _DEBUG > SetLevel( Logger::LEVEL_DEBUG ); > #else > SetLevel( Logger::LEVEL_INFO ); > #endif > s_isInitialized = true; > // Step 9 : Enjoy! > } > > > //============================================================================= > // Constructor and destructor > //============================================================================= > Logger::Logger(void) > : common::app::Object("common::log::Logger") > { > } > > Logger::~Logger(void) > { > } > > //============================================================================= > // Public methods > //============================================================================= > > > ------------------------------------------------------------------------ > > //* Step 1: (optional) Specify your format message class and/or destination message class. By default, it's std::(w)string. You'll use this when you want a optimize string class. > //* Step 2: (optional) Specify your formatter & destination base classes > //* Step 3: Specify your logger class(es) > //* Step 4: Declare the filters and loggers you'll use (in a header file) > //* Step 5: Define the macros through which you'll do logging > //* Step 6: Define the loggers and the filters you'll use (in a source file). We need this separation (into declaring and defining the logs/filters), in order to make compilation times fast. > //* Step 7: Add formatters and destinations. That is, how the message is to be formatted... > //* Step 8: Use it > //* Step 9: Enjoy the results! > > //* debug (smallest level), > //* info, > //* warning , > //* error , > //* fatal (highest level) > > #ifndef _COMMON_LOG_LOGGER_H_ > #define _COMMON_LOG_LOGGER_H_ > #pragma once > > //============================================================================= > // Includes > //============================================================================= > //----- MEDCommon ----- > #include "../commonIncludes.h" > #include "../app/Object.h" > #include "StackLog.h" > #include "common/txt/StringHelper.h" > #include "common/container/RollingStack.h" > > void MEDCOMMON_API Audit( const std::ostringstream & msg ); > void MEDCOMMON_API Debug( const std::ostringstream & msg ); > void MEDCOMMON_API Trace2( const std::ostringstream & msg ); > void MEDCOMMON_API Info( const std::ostringstream & msg ); > void MEDCOMMON_API Warning( const std::ostringstream & msg ); > void MEDCOMMON_API Error( const std::ostringstream & msg ); > void MEDCOMMON_API Exception( const std::ostringstream & msg ); > > #define MED_FUNCTION \ > common::log::StackLog log( __FUNCTION__ ); > > #define MED_FUNCTION2( msg ) \ > ostringstream s; \ > s << msg; \ > common::log::StackLog log( __FUNCTION__, s ); > > #define MED_METHOD( object ) \ > common::log::StackLog log( object,__FUNCTION__ ); > > #define MED_METHOD2( object, params ) \ > ostringstream s; \ > s << params; \ > common::log::StackLog log( object,__FUNCTION__, s ); > > #define MED_AUDIT( module, msg ) \ > { \ > ostringstream s; \ > s << "[" << module << "]\t" \ > << msg; \ > Audit( s ); \ > } > > #define MED_DBG2( module, msg ) \ > { \ > if ( common::log::Logger::MODE_DEBUG ) \ > { \ > string file = __FILE__; \ > string fileName = common::txt::StringHelper::LastToken(file,"\\"); \ > ostringstream s; \ > s << "[" << module << "]\t" \ > << msg \ > << " (" \ > << fileName \ > << "#" \ > << __FUNCTION__ \ > << " L." \ > << __LINE__ \ > << ")"; \ > Debug( s ); \ > } \ > } > > #define MED_TRC2( module, msg ) \ > { \ > string file = __FILE__; \ > string fileName = common::txt::StringHelper::LastToken(file,"\\"); \ > ostringstream s; \ > s << "[" << module << "]\t" \ > << msg \ > << " (" \ > << fileName \ > << "#" \ > << __FUNCTION__ \ > << " L." \ > << __LINE__ \ > << ")"; \ > Trace2( s ); \ > } > > #define MED_INF2( module, msg ) \ > { \ > ostringstream s; \ > s << "[" << module << "]\t" \ > << msg; \ > Info( s ); \ > } > > #define MED_WARN2( module, msg ) \ > { \ > string file = __FILE__; \ > string fileName = common::txt::StringHelper::LastToken(file,"\\"); \ > ostringstream s; \ > s << "[" << module << "]\t" \ > << msg \ > << " (" \ > << fileName \ > << "#" \ > << __FUNCTION__ \ > << " L." \ > << __LINE__ \ > << ")"; \ > Warning( s ); \ > } > > #define MED_ERR2( module, msg ) \ > { \ > string file = __FILE__; \ > string fileName = common::txt::StringHelper::LastToken(file,"\\"); \ > ostringstream s; \ > s << "[" << module << "]\t" \ > << msg \ > << " (" \ > << fileName \ > << "#" \ > << __FUNCTION__ \ > << " L." \ > << __LINE__ \ > << ")"; \ > Error( s ); \ > } > > #define MED_EXC2( module, msg ) \ > { \ > string file = __FILE__; \ > string fileName = common::txt::StringHelper::LastToken(file,"\\"); \ > ostringstream s; \ > s << "[" << module << "]\t" \ > << msg \ > << " (" \ > << fileName \ > << "#" \ > << __FUNCTION__ \ > << " L." \ > << __LINE__ \ > << ")"; \ > Exception( s ); \ > } > > namespace common > { > namespace log > { > class MEDCOMMON_API Logger : public common::app::Object > { > > > > //============================================================================= > // Constants > //============================================================================= > public: > enum LEVEL { > LEVEL_DEBUG , > LEVEL_INFO , > LEVEL_ERROR }; > > //============================================================================= > // Class attributs > //============================================================================= > public: > static bool MODE_DEBUG; > // traces > static common::container::RollingStack<string> s_traces; > > private: > static bool s_isInitialized; > > //============================================================================= > // Class methods > //============================================================================= > public: > static void SetProduct( const string & product ); > static bool IsInitialized(); > static void Init( const string & product ); > static void SetLevel( LEVEL level ); > > //============================================================================= > // Attributs > //============================================================================= > private: > > > //============================================================================= > // Constructor and destructor > //============================================================================= > private: > Logger(); > virtual ~Logger(); > > //============================================================================= > // Public methods > //============================================================================= > public: > > //============================================================================= > // Other methods > //============================================================================= > protected: > > }; > } // namespace log > } // namespace common > > #endif // _COMMON_LOG_LOGGER_H_ > > -- http://John.Torjo.com -- C++ expert ... call me only if you want things done right

1 0

[Math] Feedback wanted on design issue.
by John Maddock 14 Jan '08

14 Jan '08

Hi folks I'd like some user feedback on an error-handling design issue if you're all willing :-) To the Sandbox "development" version of Boost.Math I've recently added equivalent functionality to the C99 round/trunc/modf functions: these convert floating point values to integers or to integer and fractional parts. However, there are two possible error conditions: 1) The input value is not a number (NaN). 2) The input value is outside the range of the integer type. We could handle these using the existing error handlers for domain_error's and overflow_error's respectively, but there's a problem: Users may legitimately turn off the throwing of exceptions from domain or overflow errors and prefer the functions to return NaN's and infinities instead. But this clearly wouldn't make as much sense for these particular conversion functions given that integers don't support either of these states.... So I'm tempted to add another error handler specific for integer conversion failures: the question then is whether this is starting down a slippery slope to too many error types making the library too hard to understand/use. Currently we already have: Pole Errors. Domain Errors. Overflow Errors. Underflow Errors. Denorm Errors. Internal Evaluation Errors. See http://svn.boost.org/svn/boost/trunk/libs/math/doc/sf_and_dist/html/math_to… for the details. So am I going overboard with error types, or worrying about nothing? Thanks for any thoughts/user experience you may have, Regards, John Maddock.

1 0

testing , please ignore
by John Torjo 14 Jan '08

14 Jan '08

-- http://John.Torjo.com -- C++ expert ... call me only if you want things done right

1 0

Question about link in VC7.1
by Michael Qi 14 Jan '08

14 Jan '08

Hi list users, I am using VC.net 2003 and use boost installer to install boost. I read the getting started guide and when link got an error. I configured VC to Multithreaded and the compilation succeeded, the link error is: LINK : fatal error LNK1104: could not open file "libboost_regex-vc71-mt-sgd-1_34_1.lib" and in boost lib directory the file libboost_regex-vc71-mt-1_34_1.lib existed, not the one with "sgd" Why VC　want sgd? Any suggestion is welcomed:) Regards HeQi

2 2

the review of the switch library ends today, January 13th
by Stjepan Rajko 14 Jan '08

14 Jan '08

The review of the Switch library submitted by Steven Watanabe ends today (Sunday, January 13th). I would like to thank Steven for submitting a very useful library, as well as all those who have submitted reviews and/or contributed to the discussion (especially Tobias Schwinger and Joel de Guzman who have put in quite a bit of effort towards enhancing the design of the library). I will send a more detailed summary of the review as well as a decision in the following days. I currently have only 3 reviews to base a decision on, so any additional votes that anyone would like to contribute in the very near future would be very welcome. Regards, Stjepan

1 0

Re: [Boost-users] Casting this pointer to a number
by sj＠sjcomp.com 13 Jan '08

13 Jan '08

On Sun, 13 Jan 2008 16:04:36 +0100, Zeljko Vrba, zvrba(a)ifi.uio.no wrote: > Why? What is it going to do with the ID? Why not make the ID a > void* pointer? > And what semantics does this "unique identification" have? Once an object is > deleted, another new'd object may get its address; I can hardly qualify that > as "unique ID". I have a set of objects and these objects have corresponding representations in the other part of my program (for debugging purposes [visualization]). Two parts of the program do not know about each other. One part calls a functions f and another part receives the call. I need to know what object initiated this call. It's given that objects are not destroyed, hence this is unique in that case. Making it void* is an option. Though I was looking for a more elegant solution. Thanks for the example. Thanks. -- Regards, Alexander. http://sjcomp.com

1 0

Casting this pointer to a number
by sj＠sjcomp.com 13 Jan '08

13 Jan '08

Hello, I'd like to provide a function with an unique identifier: void f(size_t UniqueId); This function is going to be called from within class member functions like that: class a { a() { f((size_t)this); } }; Right now the old style cast works. The question is how do I make conversion using numeric_cast? If I use: f(boost::numeric_cast<size_t>(this)); I get a compilation error: error C2665: 'ceil' : none of the 3 overloads could convert all the argument types I guess another question is: should I bother replacing this old-style cast, maybe there is a better way to approach this situation in general? Thanks.

4 3

FW: Export control classification number (ECC) for boost
by matthias.jaeschke＠nsn.com 13 Jan '08

13 Jan '08

> Hi, > > We are using boost in one of our products, and are now in the process of collecting the information needed to export it to other countries. > > Can you tell me what the U.S. Export Control Classification Number (ECCN) for boost is, and whether a license exception may be used for it? > > If you don't know the US ECCN, can you tell me whether any US citizens or people living in the U.S.A. have contributed code to boost? > > In addition to the U.S. ECCN, there is also a German "ECCN", which is called the AL Number. Can you tell me what the AL Number is for boost? > > To better understand the meaning of the U.S. ECCN, please check the following webpage: > http://www.bis.doc.gov/Licensing/Do_I_NeedAnECCN.html > > Many thanks, > Matthias Jäschke / Peter Niggemeier > Nokia Siemens Networks > > > Matthias Jäschke > Senior Quality Engineer > > Nokia Siemens Networks Deutschland GmbH > Heltorfer Str. 1 > D-40472 Düsseldorf > Phone: +49-151-55153859 > Fax +49-211-9412-3383 > E-mail: matthias.jaeschke(a)nsn.com > > Sitz der Gesellschaft: Bochum / Registered office: Bochum > Registergericht: Bochum / Commercial registry: Bochum, HRB 11180 > Geschäftsführung / Managing Directors: Dr. Ulrich Halka, Lydia Sommer > _________________________________________________ > Important Note: This e-mail and any attachment are confidential and may contain trade secrets and may well also be legally privileged or otherwise protected from disclosure. If you have received it in error, you are on notice of its status. Please notify us immediately by reply e-mail and then delete this e-mail and any attachment from your system. If you are not the intended recipient please understand that you must not copy this e-mail or any attachment or disclose the contents to any other person. Thank you for your cooperation. > > Wichtiger Hinweis: Dieses E-Mail und etwaige Anlagen können Betriebs- oder Geschäftsgeheimnisse, dem Anwaltsgeheimnis unterliegende oder sonstige vertrauliche Informationen enthalten. Sollten Sie dieses E-Mail irrtümlich erhalten haben, ist Ihnen der Status dieses E-Mails bekannt. Bitte benachrichtigen Sie uns in diesem Fall sofort durch Antwort-Mail und löschen Sie dieses E-Mail nebst etwaigen Anlagen von Ihrem System. Ebenso dürfen Sie dieses E-Mail oder seine Anlagen nicht kopieren oder an Dritte weitergeben. Vielen Dank. > >

2 1

ptime constructor
by Miguel Lopes 13 Jan '08

13 Jan '08

Hi all, I have a small question about ptime class usage. I am currently working on an old project that uses Boost library; unfortunately, when I build and run the project executable some exceptions are thrown. I found out that some parts of the project are trying to create ptime objects like this: *ptime(time_from_string(string(sz)))* That line throws an exception, when sz is empty. So my question is: Is there any version (Boost version) of ptime class that accepts an empty string as argument? The problem is that I need to investigate which version of Boost, is being really used in the project makefile and with all versions of Boost that line throws the exception. On the other hand I have a precompiled binary of the project, and under the same data input conditions, it works perfectly, that is, even with empty dates no exceptions are thrown. Kind Regards, Miguel Lopes

2 1

Re: [Boost-users] Review: Switch library
by legalize+jeeves＠mail.xmission.com 13 Jan '08

13 Jan '08

[Please do not mail me a copy of your followup] boost(a)lists.boost.org spake the secret code <fmblls$ees$1(a)ger.gmane.org> thusly: >I also urge Steven to pursue the dynamic_switch idea I posted >which employs perfect hashing at compile time whereby allowing >equivalent or faster than a switch dispatch at runtime where >the cases are dynamic (instead of compile time constants). I just want to say that I think this approach is so amazingly cool, my socks are not only blown off, but orbiting the planet :-). -- "The Direct3D Graphics Pipeline" -- DirectX 9 draft available for download <http://www.xmission.com/~legalize/book/download/index.html> Legalize Adulthood! <http://blogs.xmission.com/legalize/>

4 4

Re: [Boost-users] [Boost String Algorithms library] ireplace_all bug with character arrays]
by Pavol Droba 13 Jan '08

13 Jan '08

Hi, Thorsten Ottosen wrote: > shunsuke skrev: >> Richard Turrin wrote: >>> Hi, >>> >>> I've encountered a bug with ireplace_all from the Boost String >>> Algorithms library for version 1.35. If I pass a character array for >>> the Format argument, the function ignores the null terminator and >>> instead uses the entire array minus the last character to replace the >>> occurrences of the Search string in the Input parameter. However, if >>> I provide a pointer to a character array, the string replacement is >>> done as expected. >>> >>> When I stepped into the code, I came across the following lines >>> (excerpt from /trunk/boost/range/as_literal.hpp): >>> >>> template< class Char, std::size_t sz > >>> inline iterator_range<const Char*> as_literal( const Char (&arr)[sz] ) >>> { >>> return boost::make_iterator_range( arr, arr + sz - 1 ); >>> } >>> >>> There is no check for a null terminator. Nor did I find one after >>> this function returned. I think the author here assumed that a >>> caller would always pass in a character array of the right size. >> >> Character array seems to have three views. >> >> 1. array: SIZE("ab\0c") == 5; >> 2. literal: SIZE("ab\0c") == 4; >> 3. null-terminated: SIZE("ab\0c") == 2; >> >> Both 2. and 3. is forced into boost::as_array. >> "One name, two facilities" usually makes trouble. >> IMO, `as_c_str` should have been added for 3. > > I agree we could add a new function. Can we come up with a better name > than as_c_str()? > > Or should we simply make as_literal() scan the array? > I think, that as_literal should behave the same way for character arrays and for c-string. Different behaviour is unexpexted here. The only difference that could be beneficial is that for arrays, the scanning for nulls can be bounded to protect agains the buffer overruns. Regards, Pavol.

1 0

/trunk/boost/range/is_literal.hpp: preprocessor bug
by Richard Turrin 13 Jan '08

13 Jan '08

Hi, Sorry for being a nitpicker here: There is a preprocessor bug in /trunk/boost/range/is_literal.hpp in the SVN repository. Line 18 has the following statement: #if BOOST_NO_FUNCTION_TEMPLATE_ORDERING It should really read: #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING This might manifest itself as compile errors in some of the older compilers (Metrowerks Code Warrior 5.3, SunPro 5.0, and Microsoft Visual C++ 7.0). Rich Turrin

2 1

Re: [Boost-users] [boost] Review: Switch library
by Stjepan Rajko 13 Jan '08

13 Jan '08

On Jan 12, 2008 5:22 PM, Joel de Guzman <joel(a)boost-consulting.com> wrote: > > For the record, I am changing my vote to "yes". I'm quite happy > with the response to my concerns. I am very confident Steven > will produce an amazing library from the very constructive > discussions so far. I'm obviously very adamant in my posts, > the reason being that I really need such a library now but I > have certain use-cases that I need to be handled by the library, > *now*, and not later in another lifetime. I can't wait for > another review or another library to come along that's closer > to my needs. I believe the switch_ library can, with additional > thought and design, handle my needs. > Thank you, Joel. Your contribution to this review is greatly appreciated. I do believe that without addressing your concerns the library would not be a true Boost.Switch. Regards, Stjepan

1 0

libXXX
by Lars Schouw 13 Jan '08

13 Jan '08

I am having a problems with the boost libs I have build the names does not start with lib When I build boost using bjam "-sTOOLS=vc9" install I got a bunch of .lib files in c:\boost\lib e.g. boost_thread-vc90-mt-1_35.lib but when I build my library against tghis if fails to link since it needs a file libboost_thread-vc90-mt-1_35.lib What am I doing wrong? I am using boost from subversion, Windows Vista and Visual Studio 2008 Thanks in advance Lars ____________________________________________________________________________________ Be a better friend, newshound, and know-it-all with Yahoo! Mobile. Try it now. http://mobile.yahoo.com/;_ylt=Ahu06i62sR8HDtDypao8Wcj9tAcJ

3 2

boost.time_series
by Kim Kuen Tang 13 Jan '08

13 Jan '08

Hello everybody, i want to start using the time series library. But unfortunately i've got compiler errors while compiling the time_series\libs\time_series\example\main.cpp file with visual studio compiler 2005. ------ Erstellen gestartet: Projekt: example, Konfiguration: Debug Win32 ------ Kompilieren... main.cpp using native typeof c:\Boost\src\time_series\boost/sequence/size.hpp(26) : error C2143: Syntaxfehler: Es fehlt ';' vor '<' c:\Boost\src\time_series\boost/sequence/size.hpp(32): Siehe Verweis auf die Instanziierung der gerade kompilierten Klassen-template "boost::sequence::impl::size<S,T>". c:\Boost\src\time_series\boost/sequence/size.hpp(26) : error C4430: Fehlender Typspezifizierer - int wird angenommen. Hinweis: "default-int" wird von C++ nicht unterstützt. c:\Boost\src\time_series\boost/sequence/size.hpp(26) : error C2039: 'type': Ist kein Element von '`global namespace'' c:\Boost\src\time_series\boost/sequence/size.hpp(26) : error C2238: Unerwartete(s) Token vor ';' c:\Boost\src\time_series\boost/sequence/size.hpp(28) : error C2143: Syntaxfehler: Es fehlt ';' vor '(' c:\Boost\src\time_series\boost/sequence/size.hpp(28) : error C4430: Fehlender Typspezifizierer - int wird angenommen. Hinweis: "default-int" wird von C++ nicht unterstützt. c:\Boost\src\time_series\boost/sequence/size.hpp(29) : error C4430: Fehlender Typspezifizierer - int wird angenommen. Hinweis: "default-int" wird von C++ nicht unterstützt. Das Buildprotokoll wurde unter "file://c:\Boost\src\time_series\libs\time_series\example\Debug\BuildLog.htm" gespeichert. example - 7 Fehler, 0 Warnung(en) ========== Erstellen: 0 erfolgreich, Fehler bei 1, 0 aktuell, 0 übersprungen ========== The errors might come from clr-syntax in the quellcode since the compiler doesnt support the response file that contains the clr-syntax without the \clr option. Perhaps anybody can give me a hint how to solve this problem?

1 0

[iterator_facade] Help with const iterator for binary file
by nicola 12 Jan '08

12 Jan '08

Hi, I have a class modeling a record-based read-only binary file and I have written a random access iterator based on iterator_facade to iterate over the records. The class looks like this: class my_binary_file { public: typedef std::string key_type; typedef unsigned int value_type; typedef std::pair<key_type, value_type> record_type; private: class my_binary_file_iterator : public boost::iterator_facade< my_binary_file_iterator, my_binary_file::record_type const, boost::random_access_traversal_tag, my_binary_file::record_type&, int> { public: my_binary_file_iterator() : rec_num_(0), ff_ptr_(0) { } explicit my_binary_file_iterator(my_binary_file* ff, unsigned int n) : ff_ptr_(ff), rec_num_(n) { } private: friend class boost::iterator_core_access; unsigned int rec_num_; my_binary_file* ff_ptr_; mutable my_binary_file::record_type record; void increment() { ++rec_num_; } void decrement() { --rec_num_; } void advance(int n) { rec_num_ += n; } int distance_to(const my_binary_file_iterator z) const { return z.rec_num_ - this->rec_num_; } bool equal(my_binary_file_iterator const& other) const { return this->ff_ptr_ == other.ff_ptr_ && this->rec_num_ == other.rec_num_; } const my_binary_file::record_type dereference() const { ff_ptr_->seekg(rec_num_); my_binary_file::key_type key; my_binary_file::value_type val; ff_ptr_->get_record(key, val); record = std::make_pair(key, val); return record; } }; public: typedef my_binary_file_iterator iterator; iterator begin() const { return iterator(this, 0); } iterator end() const { return iterator(this, num_records_); } // Opens a binary file for reading explicit my_binary_file(const std::string& path); ~my_binary_file(); operator void*() const; bool operator!() const; // Reads the record at the current position bool get_record(key_type& k, value_type& v); std::ios::pos_type tellg() const { return fs_.tellg(); } void seekg(unsigned int n) { fs_.seekg(start_record_ + std::ios::off_type(n * record_size_), std::ios::beg); } private: boost::filesystem::path pathname_; mutable boost::filesystem::fstream fs_; std::streampos start_record_; key_type::size_type key_size_; unsigned int record_size_, num_records_; }; Unfortunately, when I try to compile my project, I get the following error: error: invalid conversion from 'const frequency_file* const' to 'frequency_file*' I have tried several variants of my code, but without success. I think I'm missing something pretty obvious in my definition of my_binary_file_iterator, but I can't get out of it. Anyone can help? Regards Nicola

2 4

Re: [Boost-users] [boost] Switch library review - summary of discussion so far
by Stjepan Rajko 12 Jan '08

12 Jan '08

On Jan 12, 2008 8:25 AM, Mathias Gaunard <mathias.gaunard(a)ens-lyon.org> wrote: > Stjepan Rajko wrote: > > > * Default default behavior > > > > Alexander Nasonov has also > > indicated that a throwing default case can cause inefficiency, even > > when it is guaranteed not to be invoked. > > Wouldn't an assert be more suited then? > If default behaviour is unspecified and yet invoked, terminating sounds > like a good thing to do. > An assert was considered as well - e.g., see: http://groups.google.com.by/group/boost-list/msg/0d73059086974920 This behavior is also analogous to the standard switch statement - if the default label is omitted, and none of the cases is matched, no termination occurs. > > > There has been a lengthy discussion on the underlying design of the > > library, what it should offer, and whether the name of the library is > > appropriate. There are two types of designs that have been put > > forward as being appropriate and/or necessary for a Boost.Switch > > library. On one hand, there is the submitted design (labeled "A" in > > recent postings), which takes the switch cases in an MPL sequence and > > a single function object containing implementations of all cases. > > Joel de Guzman has proposed another design (labeled "B"), in which the > > switch cases are specified separately and allow a different function > > to be used for each case. > > It seems to me that B is convertible to A... > There would be no need to duplicate the interface then. > Under the right details, yes: http://thread.gmane.org/gmane.comp.lib.boost.user/32628/focus=169957 Tobias offered formal transforms between the two: http://groups.google.com.by/group/boost-list/msg/1b1fa0084cd7baad > An utility which converts B to A would be quite useful though, even > outside of boost.switch. > Thanks for your comments! Stjepan

1 0

[Boost.Serialization] Questions about the New Release of Boost.Serialization 1.36
by Marc Viala Perso 12 Jan '08

12 Jan '08

Hello, This mail is about Boost.Serialization and more specifically the new release of this library, tagged as 1.36, which can be found via the link: www.rrsd.com <http://www.rrsd.com/> ; I've found this link into a specific thread about Serialization and multi-threading. Last week, I've downloaded this new release and tested it in my environment - Windows XP and Visual C++ 7.1.6030; the compilation was done against Boost.1.34.1 trunk and was running with success but I've noticed that some, "not all", old binary archives generated w/ Boost.Serialization 1.34.1 can't be restored with this new version of Boost.Serialization. When I compare the binary files with a file binary comparison software utility it seems that the binary formats between these two versions are not comparables. I would like to know if this behaviour is "normal": i.e. the binary formats between 1.34.1 and 1.36 are not strictly equivalent and that an old binary archive can be declare "not compatible" w/ the 1.36 release. Is this right? Furthermore, is it possible to have the same behaviour w/ an XML or Text Archive format? Could we guarantee a sort of compatibility in the future? And more generally speaking, what is the policy for insuring compatibility between new releases of Boost.Serialization? Best regards, Marc VIALA

5 15

Solve linear system (tridiagonal matrix)
by nisha kannookadan 12 Jan '08

12 Jan '08

Hi everybody I need to solve a linear system Ax = b, where A is a tridiagonal matrix, is there an easy way to do it? I programmed an algo, which computes the inverse of the tridiagonal matrix with the usmani-algo and uses prod then, but this is quite time intense. I want to use the lapack bindings, but I dont get along with it. Im bit confused, if I need to install something additional to it, the way I tried out gesv, its not working and I get error msgs. I searched through out the www, but its hard to find good info. If somebody has already the code to solve linear equations with lapack, I would thankful, if he could post it here. Thank you Nisha K _________________________________________________________________ Express yourself instantly with MSN Messenger! Download today it's FREE! http://messenger.msn.click-url.com/go/onm00200471ave/direct/01/

1 0

Switch library review - summary of discussion so far
by Stjepan Rajko 12 Jan '08

12 Jan '08

I will try to summarize the discussions happening so far on the Switch library under review - maybe this will be helpful to those considering joining the discussion and submitting a review. * Documentation All reviewers have noted that the documentation could be improved - e.g., additional examples, performance stats, as well as more explanation of the types involved and how they are used. * Return type Tobias Schwinger suggested that the return type should be specified explicitly in the switch_ call, rather than inferring it from the function object, and this is now a part of the recent designs being discussed. Joel de Guzman also suggested that if a version of switch_ should infer the return type, that return type should be a Boost.Variant of the types returned by each of the cases. * Default default behavior If the default behavior is left unspecified, switch_ should invoke the default constructor of the return type in the default case, rather than throwing an exception. This was suggested by Tobias Schwinger after the issue was raised by Dan Marsden. Alexander Nasonov has also indicated that a throwing default case can cause inefficiency, even when it is guaranteed not to be invoked. * Fall-through Alexander Nasonov pointed out the lack of fall-through capability in the submitted implementation. Fall-through has been incorporated into the recent designs being discussed. * Allowing void-returning function objects for the default case with a non-void returning switch Tobias Schwinger mentioned the possibility of allowing default case function objects of void return type even when the switch return type is non-void, as long as the function object call does not return. This would be useful, for example, if the function object is guaranteed to throw. There is still some discussion on whether determining if the return type is void can be done efficiently. * Design There has been a lengthy discussion on the underlying design of the library, what it should offer, and whether the name of the library is appropriate. There are two types of designs that have been put forward as being appropriate and/or necessary for a Boost.Switch library. On one hand, there is the submitted design (labeled "A" in recent postings), which takes the switch cases in an MPL sequence and a single function object containing implementations of all cases. Joel de Guzman has proposed another design (labeled "B"), in which the switch cases are specified separately and allow a different function to be used for each case. Design "A" is better suited for situations in which the number of cases is determined by a compile time constant, while "B" is more appropriate for many use cases, and provides more flexibility and a more familiar syntax. It seems that a consensus has been reached that this library could offer either both interfaces in different layers, or an interface that can be used in different ways for different uses (based on a common concept capturing case sequences). (Apologies if I have missed or misinterpreted something) More reviews/votes would be extremely welcome! Regards, Stjepan

1 0

formal review of Switch library ends tomorrow (Wednesday, January 9th) - reviews needed
by Stjepan Rajko 12 Jan '08

12 Jan '08

The formal review of Switch library by Steven Watanabe is scheduled to end tomorrow, January 9th. I have only received one review (privately) so far, and hope that those participating in the discussions about the library (as well as any other interested boosters) would be willing to contribute a few more - a summary of your final thoughts with a vote would be greatly appreciated. If you need a little extra time to finish out the discussions or write the review, please let me know as we can extend the review period for a few days if necessary. Please feel free to submit your reviews to the list, or privately to me. As a reminder, here are some questions you may want to answer in your review: * What is your evaluation of the design? * What is your evaluation of the implementation? * What is your evaluation of the documentation? * What is your evaluation of the potential usefulness of the library? * Did you try to use the library? With what compiler? Did you have any problems? * How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? * Are you knowledgeable about the problem domain? And finally, every review should answer this question: * Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Thanks again to those that have been participating in the discussions and/or have already submitted a review. Regards, Stjepan

5 39

[thread] unresolved external symbol with trunk
by Christian Henning 11 Jan '08

11 Jan '08

Hi there, for some reasons using MSVC 8 and the current updated boost trunk results in two linker errors, as shown below: 1>simplest.obj : error LNK2001: unresolved external symbol "private: void __thiscall boost::thread::start_thread(void)" (?start_thread@thread@boost@@AAEXXZ) 1>simplest.obj : error LNK2001: unresolved external symbol "bool __cdecl boost::this_thread::interruptible_wait(void *,struct boost::detail::timeout)" (?interruptible_wait@this_thread@boost@@YA_NPAXUtimeout@detail@2@@Z) Any ideas? Regards, Christian

1 0

Port QT call to BOOST - Resolved
by j.c. 11 Jan '08

11 Jan '08

Was quite easy actually. :-) #include <iostream> #include <boost/bind.hpp> #include <boost/signal.hpp> namespace jc { class task { public: task() { // ... } ~task() { // ... } void done() { sig_finished(this); } /// signals boost::signal<void (task *)> sig_finished; }; class bucket { public: bucket() { // ... } ~bucket() { // ... } void on_finished(task * t) { std::cout << "on_finished:\n"; } void set_task(task * t) { t->sig_finished.connect(boost::bind( &bucket::on_finished, this, t)); } }; } // namepace jc using namespace jc; int main() { task * t = new task; bucket * b = new bucket; b->set_task(t); t->done(); delete t; delete b; return 0; }

6 13

Boost.xpressive: compiled program crashes :-(
by George Petasis 11 Jan '08

11 Jan '08

Hi all, I am using xpressive to build parser for context-free grammar segments, and the c++ code that I use is produced automatically from the grammar files through scripts. A sample C++ file is attached to this mail (main is at the end of the file). The problem is that although I can get the code to compile with MS VC++ 2005, I get a crash as soon as I use regex_match. Any ideas why? Regards, George #include <string> #include <iostream> #include <fstream> #include <map> #include <boost/xpressive/xpressive.hpp> #include <boost/xpressive/regex_actions.hpp> using namespace boost::xpressive; using namespace std; bool debug_output; //////////////////////////////////////////////////////////////////////////// // // Types // //////////////////////////////////////////////////////////////////////////// // Grammar Non Terminals... boost::xpressive::sregex CNT_pvl_6_part_1, CNT_pvl_6_part_2, CNT_pvl_6_part_3, CNT_pvl_6_part_4, CNT_pvl_6_part_5, CNT_pvl_6_part_6, CNT_pvl_6_part_7, HEADSYMBOL_part_1, HEADSYMBOL_part_2, HEADSYMBOL_part_3, HEADSYMBOL_part_4, HEADSYMBOL_part_5, HEADSYMBOL_part_6, HEADSYMBOL_part_7, HEADSYMBOL_part_8, HEADSYMBOL_part_9, HEADSYMBOL_part_10, HEADSYMBOL_part_10_heads, HEADSYMBOL_part_11, HEADSYMBOL_part_12, HEADSYMBOL_part_13, HEADSYMBOL_part_14, HEADSYMBOL_part_15, HEADSYMBOL_part_16, HEADSYMBOL_part_17, CNT_pvl_1, CNT_pvl_11, CNT_pvl_3, CNT_pvl_4, CNT_pvl_6, CNT_pvl_7, CNT_pvl_8, HEADSYMBOL, s_scl__dqt_, s_scl__sq_S, s_scl__lpar_, s_scl__rpar_, s_scl__com_, s_scl__pvl_, s_scl__sls_, s_scl_16TH, s_scl__cln_, s_scl_A, s_scl_ABOUT, s_scl_ACCOMPLISH, s_scl_ACHIEV, s_scl_AD, s_scl_AFRICA, s_scl_AFRICAN, s_scl_AFTER, s_scl_AGAIN, s_scl_AGE, s_scl_AGO, s_scl_ALL, s_scl_ALL_pvl_AMERICAN, s_scl_ALMOST, s_scl_ALREADI, s_scl_ALSO, s_scl_AN, s_scl_AND, s_scl_ANI, s_scl_ANKL, s_scl_ANOTH, s_scl_APPAR, s_scl_APPEAR, s_scl_ARGUMENT, s_scl_AS, s_scl_ASIC, s_scl_AT, s_scl_ATTEMPT, s_scl_AUDIBL, s_scl_AWARD, s_scl_BACK, s_scl_BE, s_scl_BEAT, s_scl_BECAM, s_scl_BECOM, s_scl_BEEN, s_scl_BEFOR, s_scl_BEHIND, s_scl_BEST, s_scl_BETTER, s_scl_BIGGEST, s_scl_BITE, s_scl_BOTH, s_scl_BOUNC, s_scl_BOW, s_scl_BROKE, s_scl_BROKEN, s_scl_BUILD, s_scl_BUOI, s_scl_BUT, s_scl_BY, s_scl_CAL, s_scl_CAME, s_scl_CAN, s_scl_CAP, s_scl_CAREER, s_scl_CELEBR, s_scl_CENTIMET, s_scl_CENTIMETR, s_scl_CHAMPION, s_scl_CHAMPIONSHIP, s_scl_CHEER, s_scl_CHOSE, s_scl_CITIZEN, s_scl_CITY, s_scl_CLAIM, s_scl_CLEAR, s_scl_CLEARANC, s_scl_CLIMB, s_scl_CLINCH, s_scl_COLLECT, s_scl_COME, s_scl_COMEBACK, s_scl_COMFORT, s_scl_COMPET, s_scl_COMPETIT, s_scl_COMPETITOR, s_scl_CONDIT, s_scl_CONFIRM, s_scl_CONTENT, s_scl_COULD, s_scl_COULDN_sq_T, s_scl_COUNT_pvl_BACK, s_scl_COUNTBACK, s_scl_COUNTRI, s_scl_COUNTRY, s_scl_CROWD, s_scl_CZECH, s_scl_DATE, s_scl_DEFEND, s_scl_DISTANT, s_scl_DOLDRUM, s_scl_DOUBL, s_scl_DUAL, s_scl_EARN, s_scl_ENJOI, s_scl_ENOUGH, s_scl_ENSUR, s_scl_EQUAL, s_scl_EUROPEAN, s_scl_EVEN, s_scl_EVENT, s_scl_EVER, s_scl_EXCEED, s_scl_EXECUT, s_scl_EXIT, s_scl_EXTRA, s_scl_FAIL, s_scl_FAILUR, s_scl_FALL, s_scl_FALTER, s_scl_FAR, s_scl_FASHION, s_scl_FEEL, s_scl_FIELD, s_scl_FIFTH, s_scl_FINAL, s_scl_FINISH, s_scl_FIRE, s_scl_FIRST, s_scl_FIRST_pvl_JUMP, s_scl_FLAG, s_scl_FOLLOW, s_scl_FOR, s_scl_FOUND, s_scl_FROM, s_scl_FUTUR, s_scl_GAIN, s_scl_GARNER, s_scl_GAVE, s_scl_GENDER, s_scl_GIVE, s_scl_GLOBAL, s_scl_GOE, s_scl_GONE, s_scl_GOOD, s_scl_GOT, s_scl_GRADUAT, s_scl_GUTSI, s_scl_HA, s_scl_HAD, s_scl_HAIL, s_scl_HAPPI, s_scl_HAVE, s_scl_HE, s_scl_HEARTBREAK, s_scl_HEIGHT, s_scl_HER, s_scl_HEROIC, s_scl_HERSELF, s_scl_HI, s_scl_HIGH, s_scl_HIGHER, s_scl_HIM, s_scl_HOME, s_scl_HOMETOWN, s_scl_HONOUR, s_scl_IMPRESS, s_scl_IN, s_scl_INCLUD, s_scl_INCREAS, s_scl_INDOOR, s_scl_INJURI, s_scl_INTO, s_scl_IS, s_scl_IT, s_scl_JOIN, s_scl_JOINT, s_scl_JULI, s_scl_JUMP, s_scl_JUMPER, s_scl_JUNIOR, s_scl_JUST, s_scl_LAST, s_scl_LATE, s_scl_LATE_pvl_HOUR, s_scl_LEAD, s_scl_LEADER, s_scl_LEAP, s_scl_LEFT, s_scl_LIFT, s_scl_LIKE, s_scl_LINE, s_scl_LOOK, s_scl_LOUDLI, s_scl_LOWEST, s_scl_LUI, s_scl_M, s_scl_MADE, s_scl_MAI, s_scl_MAKE, s_scl_MANAG, s_scl_MARYLAND, s_scl_MEDAL, s_scl_MEDALLIST, s_scl_MEET, s_scl_METR, s_scl_MOMENTARILI, s_scl_MOMENTUM, s_scl_MONTH, s_scl_MORE, s_scl_MOTIV, s_scl_MOVE, s_scl_NAME, s_scl_NATION, s_scl_NATIONALITY, s_scl_NATIV, s_scl_NEAR_pvl_PB, s_scl_NEED, s_scl_NEVER, s_scl_NEW, s_scl_NO, s_scl_NO_pvl_CONTEST, s_scl_NOT, s_scl_NOTIC, s_scl_NOW, s_scl_OBISPO, s_scl_OCCAS, s_scl_OF, s_scl_OFF, s_scl_OLYMP, s_scl_ON, s_scl_ONC, s_scl_ONLI, s_scl_OPEN, s_scl_OPENING_pvl_ROUND, s_scl_ORIGIN, s_scl_OUNC, s_scl_OUT, s_scl_OUTDOOR, s_scl_OVER, s_scl_OVERTOOK, s_scl_OWN, s_scl_PASS, s_scl_PB, s_scl_PB_pvl_EQUALLING, s_scl_PERFECT, s_scl_PERFORM, s_scl_PERFORMANCE, s_scl_PERSON, s_scl_PICK, s_scl_PLACE, s_scl_POINT, s_scl_POLY_pvl_SAN, s_scl_POST, s_scl_PRESENT, s_scl_PREVAIL, s_scl_PRINCETON, s_scl_PRODUC, s_scl_PRONOUNC, s_scl_PROPHECI, s_scl_PUBLIC, s_scl_PULL, s_scl_QUICKSILV, s_scl_QUIET, s_scl_RANK, s_scl_RANKING, s_scl_REACH, s_scl_RECORD, s_scl_RECOV, s_scl_REIGN, s_scl_RELEG, s_scl_REMARK, s_scl_REPRES, s_scl_REQUIR, s_scl_RESPECT, s_scl_RESPOND, s_scl_REST, s_scl_RETURN, s_scl_RIVAL, s_scl_ROLL, s_scl_ROSE, s_scl_S, s_scl_SAID, s_scl_SATISFI, s_scl_SCORE, s_scl_SEASON, s_scl_SECOND, s_scl_SELF_pvl_FULFILLING, s_scl_SETTL, s_scl_SHARE, s_scl_SHE, s_scl_SHOCK, s_scl_SHORTER, s_scl_SHOUT, s_scl_SIMPL, s_scl_SINC, s_scl_SLATE, s_scl_SNATCH, s_scl_SOIL, s_scl_SOMETH, s_scl_SOUTH, s_scl_SPARTANBURG, s_scl_SPLENDID, s_scl_SPORT, s_scl_STAI, s_scl_STAND, s_scl_STAR, s_scl_STATU, s_scl_STRAIGHT, s_scl_STUCK, s_scl_SUCCESS, s_scl_SUCH, s_scl_SUFFIC, s_scl_SUPPORT, s_scl_SURPRIS, s_scl_SUSTAIN, s_scl_TAKE, s_scl_TANTALIS, s_scl_TC, s_scl_THAN, s_scl_THAT, s_scl_THE, s_scl_THEIR, s_scl_THEN, s_scl_THERE, s_scl_THI, s_scl_THIRD, s_scl_THIRD_pvl_TIME, s_scl_THOUGH, s_scl_THREATEN, s_scl_THREE, s_scl_THROUGH, s_scl_TI, s_scl_TIE, s_scl_TIME, s_scl_TIRE, s_scl_TITL, s_scl_TO, s_scl_TODAI, s_scl_TOKEN_pvl_INTEGER, s_scl_TONIGHT, s_scl_TOOK, s_scl_TOP, s_scl_TOWN, s_scl_TRACK, s_scl_TRY, s_scl_TURN, s_scl_TWICE, s_scl_TWO, s_scl_UNEXPECT, s_scl_UNKNOWN, s_scl_UNSUCCESS, s_scl_UP, s_scl_UPSET, s_scl_VERI, s_scl_WA, s_scl_WAI, s_scl_WAKE, s_scl_WAYSID, s_scl_WEEK, s_scl_WEIGHT, s_scl_WELL, s_scl_WELL_pvl_DESERVED, s_scl_WENT, s_scl_WERE, s_scl_WHAT, s_scl_WHEN, s_scl_WHICH, s_scl_WHO, s_scl_WHOSE, s_scl_WILL, s_scl_WINNER, s_scl_WITH, s_scl_WON, s_scl_WORLD, s_scl_WOULD, s_scl_YEAR, s_scl_YEAR_pvl_OLD, s_scl__octal_205_, s_scl__octal_222_, s_scl__octal_226_, s_scl__octal_227_; // Grammar symbol tables... void initialise_grammar_name_pvl_ranking_pvl_learned(void) { // Grammar rules... CNT_pvl_1 = (by_ref(s_scl_PERSON) >> _s >> by_ref(s_scl_BEST)) | (by_ref(s_scl_BEST) >> _s >> by_ref(s_scl_OF)); CNT_pvl_11 = (by_ref(s_scl__com_) >> _s >> by_ref(s_scl_TO)) | (by_ref(s_scl__com_) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_WA)); CNT_pvl_3 = (by_ref(s_scl_LEAP) >> _s >> by_ref(s_scl_A)) | (by_ref(s_scl_HA) >> _s >> by_ref(s_scl_A)); CNT_pvl_4 = (by_ref(s_scl_HI) >> _s >> by_ref(s_scl_SECOND)) | (by_ref(s_scl_HER) >> _s >> by_ref(s_scl_FIRST)); CNT_pvl_6_part_1 = (by_ref(s_scl__octal_205_) >> _s >> by_ref(s_scl_NAME) >> _s >> by_ref(s_scl_WA)) | (by_ref(s_scl_WITH) >> _s >> by_ref(s_scl_THE)) | (by_ref(s_scl_WITH) >> _s >> by_ref(s_scl_HI)) | (by_ref(s_scl_WITH) >> _s >> by_ref(s_scl_A)) | (by_ref(s_scl_WITH) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_WHO) >> _s >> by_ref(s_scl_WA)) | (by_ref(s_scl_WHO) >> _s >> by_ref(s_scl_HAD)) | (by_ref(s_scl_WHO) >> _s >> by_ref(s_scl_CLEAR) >> _s >> by_ref(s_scl_PERFORMANCE)) | (by_ref(s_scl_WHEN) >> _s >> by_ref(s_scl_HE)) | (by_ref(s_scl_WA) >> _s >> by_ref(s_scl_IN)); CNT_pvl_6_part_2 = (by_ref(s_scl_TOOK) >> _s >> by_ref(s_scl_THE)) | (by_ref(s_scl_TO) >> _s >> by_ref(s_scl_TAKE)) | (by_ref(s_scl_TO) >> _s >> by_ref(s_scl_RANKING)) | (by_ref(s_scl_TO) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_THE) >> _s >> by_ref(s_scl_SPORT)) | (by_ref(s_scl_THE) >> _s >> by_ref(s_scl_RANKING)) | (by_ref(s_scl_THE) >> _s >> by_ref(s_scl_NATIONALITY)) | (by_ref(s_scl_THE) >> _s >> by_ref(s_scl_EVENT)) | (by_ref(s_scl_THE) >> _s >> by_ref(s_scl_CROWD)) | (by_ref(s_scl_RANKING) >> _s >> by_ref(s_scl_THE)); CNT_pvl_6_part_3 = (by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_TO)) | (by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_METR)) | (by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_M)) | (by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl__sls_) >> _s >> by_ref(s_scl_PERFORMANCE)) | (by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl__com_)) | (by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_OF) >> _s >> by_ref(s_scl_NATIONALITY)) | (by_ref(s_scl_OF) >> _s >> by_ref(s_scl_CAL) >> _s >> by_ref(s_scl_POLY_pvl_SAN) >> _s >> by_ref(s_scl_LUI) >> _s >> by_ref(s_scl_OBISPO) >> _s >> by_ref(s_scl_WERE)) | (by_ref(s_scl_OF) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_NAME) >> _s >> by_ref(s_scl__com_)); CNT_pvl_6_part_4 = (by_ref(s_scl_NAME) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_LAST) >> _s >> by_ref(s_scl_YEAR)) | (by_ref(s_scl_JUMP) >> _s >> by_ref(s_scl_TO)) | (by_ref(s_scl_IN) >> _s >> by_ref(s_scl_CITY)) | (by_ref(s_scl_GENDER) >> _s >> by_ref(s_scl__sq_S) >> _s >> by_ref(s_scl_SPORT)) | (by_ref(s_scl_FOR) >> _s >> by_ref(s_scl_THE)) | (by_ref(s_scl_FINISH) >> _s >> by_ref(s_scl_IN)) | (by_ref(s_scl_COUNTRY) >> _s >> by_ref(s_scl__com_)) | (by_ref(s_scl_CLEARANC) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_CLEAR) >> _s >> by_ref(CNT_pvl_6)); CNT_pvl_6_part_5 = (by_ref(s_scl_BOUNC) >> _s >> by_ref(s_scl_BACK) >> _s >> by_ref(s_scl_FROM)) | (by_ref(s_scl_AT) >> _s >> by_ref(s_scl_PERFORMANCE)) | (by_ref(s_scl_AND) >> _s >> by_ref(s_scl_NAME)) | (by_ref(s_scl_AND) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl__com_) >> _s >> by_ref(s_scl_WHO)) | (by_ref(s_scl__com_) >> _s >> by_ref(s_scl_THE)) | (by_ref(s_scl__com_) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl__lpar_) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl__rpar_)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_TWO) >> _s >> by_ref(s_scl_YEAR) >> _s >> by_ref(s_scl_AGO)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_TO)); CNT_pvl_6_part_6 = (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_THE)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_TAKE)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_RANKING)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_ON)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_FINISH)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_CITY)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_BEEN)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_AND)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_AFTER)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_A)); CNT_pvl_6_part_7 = (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl__com_)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(CNT_pvl_6)); CNT_pvl_6 = (CNT_pvl_6_part_1 | CNT_pvl_6_part_2 | CNT_pvl_6_part_3 | CNT_pvl_6_part_4 | CNT_pvl_6_part_5 | CNT_pvl_6_part_6 | CNT_pvl_6_part_7); CNT_pvl_7 = (by_ref(s_scl_OF) >> _s >> by_ref(s_scl_THE)) | (by_ref(s_scl_FROM) >> _s >> by_ref(s_scl_THE)); CNT_pvl_8 = (by_ref(s_scl_SPORT) >> _s >> by_ref(s_scl__com_)) | (by_ref(s_scl_NAME) >> _s >> by_ref(s_scl__lpar_)); HEADSYMBOL_part_1 = (by_ref(s_scl__octal_226_) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_SURPRIS)) | (by_ref(s_scl__octal_226_) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_ATTEMPT) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_BECOM) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_FIRST) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl_EUROPEAN) >> _s >> by_ref(s_scl_SPORT) >> _s >> by_ref(s_scl_CHAMPION) >> _s >> by_ref(s_scl_SINC) >> _s >> by_ref(s_scl_NAME) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_DATE) >> _s >> by_ref(s_scl__octal_226_) >> _s >> by_ref(s_scl_HAD) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_BE) >> _s >> by_ref(s_scl_SATISFI) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl__octal_226_) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_WILL) >> _s >> by_ref(s_scl_LOOK) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_BUILD) >> _s >> by_ref(s_scl_ON) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_EVENT)) | (by_ref(s_scl_WHOSE) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_GARNER) >> _s >> by_ref(s_scl_HIM) >> _s >> by_ref(s_scl_NO) >> _s >> by_ref(s_scl_BETTER) >> _s >> by_ref(s_scl_THAN)) | (by_ref(s_scl_WHO) >> _s >> by_ref(s_scl_TI) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl_WHO) >> _s >> by_ref(s_scl_REACH) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_NEAR_pvl_PB) >> _s >> by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_LATE) >> _s >> by_ref(s_scl_MAI) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_HA) >> _s >> by_ref(s_scl_BEEN) >> _s >> by_ref(s_scl_ON) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_ROLL) >> _s >> by_ref(s_scl_THI) >> _s >> by_ref(s_scl_MONTH) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_FIRST) >> _s >> by_ref(s_scl_WITH) >> _s >> by_ref(s_scl_ANOTH) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_THEN) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_PB_pvl_EQUALLING) >> _s >> by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_LEAP) >> _s >> by_ref(s_scl_TO)) | (by_ref(s_scl_WHO) >> _s >> by_ref(s_scl_POST)) | (by_ref(s_scl_WHO) >> _s >> by_ref(s_scl_MADE) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_REMARK) >> _s >> by_ref(s_scl_COMEBACK) >> _s >> by_ref(s_scl_FROM) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_CAREER) >> _s >> by_ref(s_scl_THREATEN) >> _s >> by_ref(s_scl_INJURI) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_DATE) >> _s >> by_ref(CNT_pvl_11)) | (by_ref(s_scl_WHO) >> _s >> by_ref(s_scl_LIKE) >> _s >> by_ref(s_scl_NAME) >> _s >> by_ref(s_scl_IS) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_DOUBL) >> _s >> by_ref(s_scl_WORLD) >> _s >> by_ref(s_scl_INDOOR) >> _s >> by_ref(s_scl_CHAMPION) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_ALSO)); HEADSYMBOL_part_2 = (by_ref(s_scl_WHO) >> _s >> by_ref(s_scl_LIKE) >> _s >> by_ref(s_scl_NAME) >> _s >> by_ref(CNT_pvl_3) >> _s >> by_ref(s_scl_SEASON) >> _s >> by_ref(CNT_pvl_1) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_BECAM)) | (by_ref(s_scl_WHO)) | (by_ref(s_scl_WERE) >> _s >> by_ref(s_scl_RANKING) >> _s >> by_ref(s_scl_AND)) | (by_ref(s_scl_WERE) >> _s >> by_ref(s_scl_PERFECT) >> _s >> by_ref(s_scl_THROUGH) >> _s >> by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_BEFOR) >> _s >> by_ref(s_scl_BOW) >> _s >> by_ref(s_scl_OUT) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_TIE) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl_WENT) >> _s >> by_ref(s_scl_ON) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_WA) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_ONLI) >> _s >> by_ref(s_scl_HIGH) >> _s >> by_ref(s_scl_JUMPER) >> _s >> by_ref(s_scl_OVER) >> _s >> by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_AND) >> _s >> by_ref(CNT_pvl_4) >> _s >> by_ref(s_scl_TIME) >> _s >> by_ref(s_scl_CLEARANC) >> _s >> by_ref(s_scl_MORE) >> _s >> by_ref(s_scl_THAN) >> _s >> by_ref(s_scl_SUFFIC) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl_WA) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_NO_pvl_CONTEST) >> _s >> by_ref(s_scl_RANKING) >> _s >> by_ref(CNT_pvl_7)) | (by_ref(s_scl_WA) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_FIRST) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_FALTER) >> _s >> by_ref(s_scl_AND) >> _s >> by_ref(s_scl_SHE) >> _s >> by_ref(s_scl_WA) >> _s >> by_ref(s_scl_RELEG) >> _s >> by_ref(s_scl_TO)) | (by_ref(s_scl_WA) >> _s >> by_ref(s_scl_SHORTER) >> _s >> by_ref(s_scl_THAN) >> _s >> by_ref(s_scl_RANKING) >> _s >> by_ref(s_scl_MEDALLIST) >> _s >> by_ref(CNT_pvl_11) >> _s >> by_ref(s_scl_BUT) >> _s >> by_ref(CNT_pvl_11) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_ON) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_WA) >> _s >> by_ref(s_scl_NAME) >> _s >> by_ref(s_scl_AN) >> _s >> by_ref(s_scl_ALL_pvl_AMERICAN) >> _s >> by_ref(s_scl_BY) >> _s >> by_ref(s_scl_TRACK) >> _s >> by_ref(s_scl_FIELD) >> _s >> by_ref(s_scl_NEW) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_DATE) >> _s >> by_ref(s_scl_AND) >> _s >> by_ref(s_scl_FINISH)); HEADSYMBOL_part_3 = (by_ref(s_scl_WA) >> _s >> by_ref(s_scl_LEFT) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_WA) >> _s >> by_ref(s_scl_HAIL) >> _s >> by_ref(s_scl_AS) >> _s >> by_ref(s_scl_ON) >> _s >> by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_STAR) >> _s >> by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_FUTUR) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_WA) >> _s >> by_ref(s_scl_APPAR) >> _s >> by_ref(s_scl_SATISFI) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_WA) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_SURPRIS)) | (by_ref(s_scl_WA) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_DISTANT) >> _s >> by_ref(s_scl_RANKING) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_BUT) >> _s >> by_ref(s_scl_THEN) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_HE) >> _s >> by_ref(s_scl_WA) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_TANTALIS)) | (by_ref(s_scl_WA) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_DISTANT)) | (by_ref(s_scl_WA)) | (by_ref(s_scl_TOOK) >> _s >> by_ref(s_scl_WHAT) >> _s >> by_ref(s_scl_IS) >> _s >> by_ref(s_scl_NOW) >> _s >> by_ref(s_scl_BECOM) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_COMFORT)) | (by_ref(s_scl_TOOK) >> _s >> by_ref(s_scl_JOINT)) | (by_ref(s_scl_TOOK) >> _s >> by_ref(s_scl_EVENT)); HEADSYMBOL_part_4 = (by_ref(s_scl_TOOK)) | (by_ref(s_scl_TODAI) >> _s >> by_ref(s_scl_WA) >> _s >> by_ref(s_scl_STUCK) >> _s >> by_ref(s_scl_AT) >> _s >> by_ref(s_scl__dqt_) >> _s >> by_ref(s_scl_ONLI) >> _s >> by_ref(s_scl__dqt_) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_TO)) | (by_ref(s_scl_THE) >> _s >> by_ref(s_scl_REIGN) >> _s >> by_ref(s_scl_OLYMP) >> _s >> by_ref(s_scl_SPORT) >> _s >> by_ref(s_scl_CHAMPION) >> _s >> by_ref(s_scl_COMFORT)) | (by_ref(s_scl_THE) >> _s >> by_ref(s_scl_EUROPEAN) >> _s >> by_ref(s_scl_RANKING) >> _s >> by_ref(s_scl_MEDALLIST) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(CNT_pvl_11) >> _s >> by_ref(s_scl_VERI) >> _s >> by_ref(s_scl_MOTIV) >> _s >> by_ref(s_scl_AND) >> _s >> by_ref(s_scl_CLEAR) >> _s >> by_ref(s_scl_AN) >> _s >> by_ref(s_scl_IMPRESS) >> _s >> by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(CNT_pvl_1) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl_THE) >> _s >> by_ref(s_scl_DOUBL) >> _s >> by_ref(s_scl_WORLD) >> _s >> by_ref(s_scl_INDOOR) >> _s >> by_ref(s_scl_CHAMPION) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_WORLD) >> _s >> by_ref(s_scl_RANKING) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_BEHIND) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl__octal_222_) >> _s >> by_ref(s_scl_S) >> _s >> by_ref(CNT_pvl_8)) | (by_ref(s_scl_THE) >> _s >> by_ref(s_scl_DOUBL) >> _s >> by_ref(s_scl_EVENT)) | (by_ref(s_scl_THE) >> _s >> by_ref(s_scl_DATE) >> _s >> by_ref(s_scl_WORLD) >> _s >> by_ref(s_scl_CHAMPION) >> _s >> by_ref(s_scl_AND) >> _s >> by_ref(s_scl_DEFEND) >> _s >> by_ref(s_scl_CITY) >> _s >> by_ref(s_scl_RANKING) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_IS) >> _s >> by_ref(s_scl_LOOK) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_HER)) | (by_ref(s_scl_THE) >> _s >> by_ref(s_scl_DATE) >> _s >> by_ref(s_scl_WORLD) >> _s >> by_ref(s_scl_CHAMPION) >> _s >> by_ref(s_scl_AND) >> _s >> by_ref(s_scl_DEFEND) >> _s >> by_ref(s_scl_CITY)) | (by_ref(s_scl_THE) >> _s >> by_ref(s_scl_AGE) >> _s >> by_ref(s_scl__pvl_) >> _s >> by_ref(s_scl_YEAR_pvl_OLD) >> _s >> by_ref(s_scl_WHO) >> _s >> by_ref(CNT_pvl_3) >> _s >> by_ref(CNT_pvl_1) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_AT) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_BEFOR) >> _s >> by_ref(s_scl_CAP) >> _s >> by_ref(s_scl_HI) >> _s >> by_ref(s_scl_SEASON) >> _s >> by_ref(CNT_pvl_6)); HEADSYMBOL_part_5 = (by_ref(s_scl_THE) >> _s >> by_ref(s_scl_AGE) >> _s >> by_ref(s_scl__pvl_) >> _s >> by_ref(s_scl_YEAR_pvl_OLD) >> _s >> by_ref(s_scl_WHO) >> _s >> by_ref(CNT_pvl_3) >> _s >> by_ref(CNT_pvl_1) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_THE)) | (by_ref(s_scl_SNATCH) >> _s >> by_ref(s_scl_THE)) | (by_ref(s_scl_SHARE)) | (by_ref(s_scl_SETTL) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl_SCORE) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_BIGGEST) >> _s >> by_ref(s_scl_UPSET) >> _s >> by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_CHAMPIONSHIP) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_SAID) >> _s >> by_ref(s_scl_THAT) >> _s >> by_ref(s_scl_HE) >> _s >> by_ref(s_scl_WA) >> _s >> by_ref(s_scl_HAPPI) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_S) >> _s >> by_ref(s_scl_CLIMB) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_S) >> _s >> by_ref(s_scl_ACCOMPLISH) >> _s >> by_ref(s_scl_INCLUD)) | (by_ref(s_scl_S) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_SPORT)); HEADSYMBOL_part_6 = (by_ref(s_scl_S)) | (by_ref(s_scl_ROSE) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_OCCAS) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_SPLENDID) >> _s >> by_ref(s_scl_FASHION) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_GENDER) >> _s >> by_ref(s_scl__octal_222_) >> _s >> by_ref(s_scl_S) >> _s >> by_ref(s_scl_SPORT) >> _s >> by_ref(s_scl_TITL) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_GUTSI) >> _s >> by_ref(s_scl_THIRD_pvl_TIME) >> _s >> by_ref(s_scl_CLEARANC) >> _s >> by_ref(s_scl_AT) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_CLINCH) >> _s >> by_ref(s_scl_THE)) | (by_ref(s_scl_RETURN) >> _s >> by_ref(s_scl_TO)) | (by_ref(s_scl_RANKING)) | (by_ref(s_scl_PRODUC) >> _s >> by_ref(s_scl_HI) >> _s >> by_ref(s_scl_BEST) >> _s >> by_ref(s_scl_EVER) >> _s >> by_ref(s_scl_JUMP) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_PREVAIL) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_GENDER) >> _s >> by_ref(s_scl__octal_222_) >> _s >> by_ref(s_scl_S) >> _s >> by_ref(CNT_pvl_8)) | (by_ref(s_scl_PLACE)) | (by_ref(s_scl_PICK) >> _s >> by_ref(s_scl_UP) >> _s >> by_ref(s_scl_A)) | (by_ref(s_scl_OVERTOOK) >> _s >> by_ref(s_scl_HIM) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_OF) >> _s >> by_ref(s_scl_TOKEN_pvl_INTEGER) >> _s >> by_ref(s_scl_SPARTANBURG) >> _s >> by_ref(s_scl_TC) >> _s >> by_ref(CNT_pvl_6)); HEADSYMBOL_part_7 = (by_ref(s_scl_OF) >> _s >> by_ref(s_scl_QUIET) >> _s >> by_ref(s_scl_FIRE) >> _s >> by_ref(s_scl_PLACE)) | (by_ref(s_scl_OF) >> _s >> by_ref(s_scl_QUICKSILV)) | (by_ref(s_scl_OF) >> _s >> by_ref(s_scl_MARYLAND) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl__pvl_)) | (by_ref(s_scl_MOVE) >> _s >> by_ref(s_scl_UP) >> _s >> by_ref(s_scl_TO)) | (by_ref(s_scl_MAKE) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_BEST) >> _s >> by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_CONDIT) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_PERFORMANCE)) | (by_ref(s_scl_LATE_pvl_HOUR) >> _s >> by_ref(s_scl_HEROIC) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_LIFT) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_OUT) >> _s >> by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_DOLDRUM) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_EVEN) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_HI) >> _s >> by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_JUMP) >> _s >> by_ref(s_scl_WA) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_LOWEST)) | (by_ref(s_scl_IS) >> _s >> by_ref(s_scl_ANOTH) >> _s >> by_ref(s_scl_TOP) >> _s >> by_ref(s_scl_LINE) >> _s >> by_ref(s_scl_SOUTH) >> _s >> by_ref(s_scl_AFRICAN) >> _s >> by_ref(s_scl_COMPET) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_AGE) >> _s >> by_ref(s_scl_YEAR_pvl_OLD) >> _s >> by_ref(s_scl_WHO) >> _s >> by_ref(CNT_pvl_3) >> _s >> by_ref(CNT_pvl_1) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_HA) >> _s >> by_ref(s_scl_COME) >> _s >> by_ref(s_scl_BACK) >> _s >> by_ref(s_scl_FROM) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_BROKEN) >> _s >> by_ref(s_scl_ANKL) >> _s >> by_ref(s_scl_SUSTAIN) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_IS) >> _s >> by_ref(s_scl_ANOTH) >> _s >> by_ref(s_scl_CITY)) | (by_ref(s_scl_INCREAS) >> _s >> by_ref(s_scl_HI) >> _s >> by_ref(s_scl_LEAD) >> _s >> by_ref(s_scl_AT) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_TOP) >> _s >> by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_EVENT) >> _s >> by_ref(s_scl_STAND) >> _s >> by_ref(s_scl_OVER) >> _s >> by_ref(s_scl_NAME) >> _s >> by_ref(s_scl_BY)); HEADSYMBOL_part_8 = (by_ref(s_scl_INCREAS) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_OWN) >> _s >> by_ref(s_scl_WORLD) >> _s >> by_ref(s_scl_LEADER) >> _s >> by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_YEAR) >> _s >> by_ref(s_scl_WHEN) >> _s >> by_ref(s_scl_ACHIEV) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_BEST) >> _s >> by_ref(s_scl_EVER) >> _s >> by_ref(s_scl_PERFORM) >> _s >> by_ref(s_scl_BY) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_CENTIMETR) >> _s >> by_ref(CNT_pvl_11)) | (by_ref(s_scl_IN) >> _s >> by_ref(CNT_pvl_8) >> _s >> by_ref(CNT_pvl_11) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_HEIGHT) >> _s >> by_ref(s_scl_REQUIR) >> _s >> by_ref(s_scl_TO)) | (by_ref(s_scl_IN)) | (by_ref(s_scl_HAD) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_CONTENT) >> _s >> by_ref(s_scl_WITH)) | (by_ref(s_scl_HAD) >> _s >> by_ref(s_scl_NOT) >> _s >> by_ref(s_scl_GONE) >> _s >> by_ref(s_scl_ANI) >> _s >> by_ref(s_scl_HIGHER) >> _s >> by_ref(s_scl_THE)) | (by_ref(s_scl_HAD) >> _s >> by_ref(s_scl_NEVER) >> _s >> by_ref(s_scl_BEEN) >> _s >> by_ref(s_scl_RANK) >> _s >> by_ref(s_scl_HIGHER) >> _s >> by_ref(s_scl_THAN)) | (by_ref(s_scl_HAD) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_BEST) >> _s >> by_ref(s_scl_COMPETIT) >> _s >> by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_YEAR) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl_HAD) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(CNT_pvl_1) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_THREE) >> _s >> by_ref(s_scl_FAILUR) >> _s >> by_ref(s_scl_AT) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_HA) >> _s >> by_ref(s_scl_ALSO)) | (by_ref(s_scl_GOT) >> _s >> by_ref(s_scl_THE)); HEADSYMBOL_part_9 = (by_ref(s_scl_GOT) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_SURPRIS)) | (by_ref(s_scl_GAVE) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_HOME) >> _s >> by_ref(s_scl_CROWD) >> _s >> by_ref(s_scl_SOMETH) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_SHOUT) >> _s >> by_ref(s_scl_ABOUT) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_BEST) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl_GAIN) >> _s >> by_ref(s_scl_MORE) >> _s >> by_ref(s_scl_MOMENTUM) >> _s >> by_ref(s_scl_OFF) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl__sq_S) >> _s >> by_ref(s_scl_SUPPORT) >> _s >> by_ref(s_scl_TO)) | (by_ref(s_scl_FROM) >> _s >> by_ref(s_scl_SOUTH) >> _s >> by_ref(s_scl_AFRICA)) | (by_ref(s_scl_FROM) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_WA) >> _s >> by_ref(s_scl_VERI) >> _s >> by_ref(s_scl_IMPRESS) >> _s >> by_ref(s_scl_IN)) | (by_ref(s_scl_FOLLOW) >> _s >> by_ref(s_scl_UP) >> _s >> by_ref(s_scl_WITH) >> _s >> by_ref(s_scl_ANOTH) >> _s >> by_ref(s_scl_CLEAR)) | (by_ref(s_scl_FOLLOW) >> _s >> by_ref(s_scl_NAME) >> _s >> by_ref(s_scl__sq_S) >> _s >> by_ref(s_scl_LEAD) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_FIRST) >> _s >> by_ref(s_scl_CAME) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_PUBLIC) >> _s >> by_ref(s_scl_NOTIC) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_DATE) >> _s >> by_ref(CNT_pvl_11)) | (by_ref(s_scl_FINISH)) | (by_ref(s_scl_FAIL) >> _s >> by_ref(s_scl_TWO) >> _s >> by_ref(s_scl_ATTEMPT) >> _s >> by_ref(s_scl_BUT) >> _s >> by_ref(CNT_pvl_11) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_AUDIBL) >> _s >> by_ref(s_scl_SHOCK) >> _s >> by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_CROWD) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_NAME) >> _s >> by_ref(s_scl_PULL) >> _s >> by_ref(s_scl_OUT) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(CNT_pvl_1) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_SECOND) >> _s >> by_ref(s_scl_JUST) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_NEED) >> _s >> by_ref(s_scl_IT) >> _s >> by_ref(s_scl_AND) >> _s >> by_ref(s_scl_MOVE) >> _s >> by_ref(s_scl_INTO)); HEADSYMBOL_part_10 = (by_ref(s_scl_EQUAL) >> _s >> by_ref(s_scl_HI) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl_NATION) >> _s >> by_ref(s_scl_JUNIOR) >> _s >> by_ref(s_scl_OUTDOOR) >> _s >> by_ref(s_scl_RECORD) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_WHEN)) | (by_ref(s_scl_ENJOI) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_STAI) >> _s >> by_ref(s_scl_OF) >> _s >> by_ref(s_scl_EXECUT) >> _s >> by_ref(s_scl_AT) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_ONLI) >> _s >> by_ref(s_scl_CLEAR) >> _s >> by_ref(s_scl_BOTH) >> _s >> by_ref(s_scl_HEIGHT) >> _s >> by_ref(s_scl_AT) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_THIRD) >> _s >> by_ref(s_scl_ATTEMPT) >> _s >> by_ref(s_scl_BUT) >> _s >> by_ref(s_scl_HE) >> _s >> by_ref(s_scl_RANKING)) | (by_ref(s_scl_EARN) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_SECOND)) | (by_ref(s_scl_COULDN_sq_T) >> _s >> by_ref(s_scl_MANAG) >> _s >> by_ref(s_scl_BETTER) >> _s >> by_ref(s_scl_THAN) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_SECOND) >> _s >> by_ref(s_scl_ATTEMPT) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_COULD) >> _s >> by_ref(s_scl_HAVE) >> _s >> by_ref(s_scl_AD) >> _s >> by_ref(s_scl_EXTRA) >> _s >> by_ref(s_scl_WEIGHT) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_HI) >> _s >> by_ref(s_scl_ARGUMENT) >> _s >> by_ref(s_scl_BY) >> _s >> by_ref(s_scl_POINT) >> _s >> by_ref(s_scl_OUT) >> _s >> by_ref(s_scl_THAT) >> _s >> by_ref(s_scl_HE) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_CONFIRM) >> _s >> by_ref(s_scl_HI) >> _s >> by_ref(s_scl_STATU) >> _s >> by_ref(s_scl_AS) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_BEST) >> _s >> by_ref(s_scl_JUNIOR) >> _s >> by_ref(s_scl_SPORT) >> _s >> by_ref(s_scl_JUMPER) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_WORLD) >> _s >> by_ref(s_scl_THI) >> _s >> by_ref(s_scl_YEAR) >> _s >> by_ref(s_scl_BY)) | (by_ref(s_scl_COME) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_HOME) >> _s >> by_ref(s_scl_TOWN) >> _s >> by_ref(s_scl_MEET) >> _s >> by_ref(s_scl_OFF) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_BACK) >> _s >> by_ref(s_scl_OF) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_LEAP) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_WEEK) >> _s >> by_ref(s_scl_AGO) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_AND) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_MORE) >> _s >> by_ref(s_scl_SIMPL) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_NATION) >> _s >> by_ref(s_scl_TITL)) | (by_ref(s_scl_COLLECT) >> _s >> by_ref(s_scl_TOKEN_pvl_INTEGER) >> _s >> by_ref(s_scl_POINT) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl_COLLECT) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_FLAG) >> _s >> by_ref(s_scl_FOR) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_WELL_pvl_DESERVED) >> _s >> by_ref(s_scl_AND) >> _s >> by_ref(s_scl_LOUDLI) >> _s >> by_ref(s_scl_CHEER)) | (by_ref(s_scl_CLAIM)); HEADSYMBOL_part_10_heads = (HEADSYMBOL_part_1 | HEADSYMBOL_part_2 | HEADSYMBOL_part_3 | HEADSYMBOL_part_4 | HEADSYMBOL_part_5 | HEADSYMBOL_part_6 | HEADSYMBOL_part_7 | HEADSYMBOL_part_8 | HEADSYMBOL_part_9 | HEADSYMBOL_part_10); HEADSYMBOL_part_11 = (by_ref(s_scl_CAN) >> _s >> by_ref(s_scl_FINAL) >> _s >> by_ref(s_scl_FEEL) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_HONOUR) >> _s >> by_ref(s_scl_THAT) >> _s >> by_ref(s_scl_GOE) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_GLOBAL) >> _s >> by_ref(s_scl_RANKING) >> _s >> by_ref(s_scl_AS) >> _s >> by_ref(s_scl_SHE) >> _s >> by_ref(s_scl_PRESENT) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_COUNTRI) >> _s >> by_ref(s_scl_WITH) >> _s >> by_ref(s_scl_IT) >> _s >> by_ref(s_scl_ONLI)) | (by_ref(s_scl_BUOI) >> _s >> by_ref(s_scl_BY) >> _s >> by_ref(s_scl_HI) >> _s >> by_ref(s_scl_HOMETOWN) >> _s >> by_ref(s_scl_CROWD) >> _s >> by_ref(CNT_pvl_11)) | (by_ref(s_scl_BROKE) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_OWN) >> _s >> by_ref(s_scl_NATION) >> _s >> by_ref(s_scl_RECORD) >> _s >> by_ref(s_scl_NOT) >> _s >> by_ref(s_scl_ONC) >> _s >> by_ref(s_scl_BUT) >> _s >> by_ref(s_scl_TWICE) >> _s >> by_ref(s_scl_ON) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_WAI) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_SNATCH) >> _s >> by_ref(s_scl_THE)) | (by_ref(s_scl_BECAM) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_FIRST) >> _s >> by_ref(s_scl_EVER) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl_TO)) | (by_ref(s_scl_ASIC) >> _s >> by_ref(CNT_pvl_11)) | (by_ref(s_scl_APPEAR) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_HAVE) >> _s >> by_ref(s_scl_RECOV) >> _s >> by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_SHOCK) >> _s >> by_ref(s_scl_OF) >> _s >> by_ref(s_scl_HI)) | (by_ref(s_scl_AND) >> _s >> by_ref(s_scl_OLYMP) >> _s >> by_ref(s_scl_CHAMPION) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_JOINT)) | (by_ref(s_scl_AND) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl_NAME) >> _s >> by_ref(s_scl_WERE) >> _s >> by_ref(s_scl_PERFECT) >> _s >> by_ref(s_scl_THROUGH) >> _s >> by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_BEFOR) >> _s >> by_ref(s_scl_BOW) >> _s >> by_ref(s_scl_OUT) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_TIE) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl_AND) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl_NAME) >> _s >> by_ref(s_scl_BOTH) >> _s >> by_ref(s_scl_FALL) >> _s >> by_ref(s_scl_BY) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_WAYSID) >> _s >> by_ref(s_scl_AT) >> _s >> by_ref(s_scl_THAT) >> _s >> by_ref(s_scl_HEIGHT) >> _s >> by_ref(s_scl_WITH) >> _s >> by_ref(s_scl_THREE) >> _s >> by_ref(s_scl_UNSUCCESS) >> _s >> by_ref(s_scl_ATTEMPT) >> _s >> by_ref(s_scl_AND) >> _s >> by_ref(s_scl_WAKE) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_RESPECT)) | (by_ref(s_scl_AND) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(CNT_pvl_6)); HEADSYMBOL_part_12 = (by_ref(s_scl_AND) >> _s >> by_ref(s_scl_DATE) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl_JUNIOR) >> _s >> by_ref(s_scl_CHAMPION) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_AND) >> _s >> by_ref(s_scl_CZECH) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_TOP) >> _s >> by_ref(s_scl_OUT) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(s_scl_ALSO) >> _s >> by_ref(CNT_pvl_3) >> _s >> by_ref(s_scl_PB) >> _s >> by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_ON) >> _s >> by_ref(CNT_pvl_4) >> _s >> by_ref(s_scl_ATTEMPT) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_BUT) >> _s >> by_ref(s_scl_WA)) | (by_ref(s_scl_ALREADI) >> _s >> by_ref(s_scl_ENSUR) >> _s >> by_ref(CNT_pvl_7)) | (by_ref(s_scl_ALL) >> _s >> by_ref(s_scl_TI) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl_AD) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_OUNC) >> _s >> by_ref(s_scl_OF)) | (by_ref(s_scl_A) >> _s >> by_ref(s_scl_PRINCETON) >> _s >> by_ref(s_scl_GRADUAT) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_BEAT) >> _s >> by_ref(s_scl_OUT) >> _s >> by_ref(s_scl_NAME) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl_A) >> _s >> by_ref(s_scl_NATIV) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_DUAL) >> _s >> by_ref(s_scl_CITIZEN) >> _s >> by_ref(s_scl_OF) >> _s >> by_ref(s_scl_BOTH) >> _s >> by_ref(s_scl_COUNTRY) >> _s >> by_ref(CNT_pvl_11) >> _s >> by_ref(s_scl_RANKING) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_FIFTH) >> _s >> by_ref(s_scl_EVENT) >> _s >> by_ref(s_scl_MEDAL) >> _s >> by_ref(s_scl__pvl_) >> _s >> by_ref(s_scl__pvl_) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_SECOND)) | (by_ref(s_scl__pvl_) >> _s >> by_ref(s_scl_HEARTBREAK) >> _s >> by_ref(s_scl_AND)) | (by_ref(s_scl__pvl_) >> _s >> by_ref(s_scl_ALSO) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_BUT)); HEADSYMBOL_part_13 = (by_ref(s_scl__pvl_) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_M) >> _s >> by_ref(s_scl_TO)) | (by_ref(s_scl__com_) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl__pvl_)) | (by_ref(s_scl__lpar_) >> _s >> by_ref(s_scl_TI) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl__lpar_) >> _s >> by_ref(s_scl_OPEN) >> _s >> by_ref(s_scl_AT) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl__cln_) >> _s >> by_ref(CNT_pvl_1) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_FOR)) | (by_ref(s_scl__lpar_)) | (by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl__octal_227_) >> _s >> by_ref(s_scl_AT) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_TIME) >> _s >> by_ref(s_scl_ALMOST) >> _s >> by_ref(s_scl_AS) >> _s >> by_ref(s_scl_UNKNOWN) >> _s >> by_ref(s_scl_AS) >> _s >> by_ref(s_scl_NAME) >> _s >> by_ref(s_scl__octal_227_)) | (by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl_MOMENTARILI) >> _s >> by_ref(s_scl_FOUND) >> _s >> by_ref(s_scl_HERSELF) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_RANKING) >> _s >> by_ref(s_scl_PLACE) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_FIRST_pvl_JUMP) >> _s >> by_ref(s_scl_SUCCESS) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_BUT) >> _s >> by_ref(s_scl_WHEN) >> _s >> by_ref(s_scl_THREE) >> _s >> by_ref(s_scl_OF) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_RIVAL) >> _s >> by_ref(s_scl_RESPOND) >> _s >> by_ref(s_scl_WITH) >> _s >> by_ref(s_scl_OPENING_pvl_ROUND) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_SHE) >> _s >> by_ref(s_scl_PASS) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_AND) >> _s >> by_ref(s_scl_EXIT) >> _s >> by_ref(s_scl_THERE) >> _s >> by_ref(s_scl_IN)) | (by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl__com_)) | (by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_WON) >> _s >> by_ref(s_scl_THE)); HEADSYMBOL_part_14 = (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_WINNER) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_WHO) >> _s >> by_ref(s_scl_TOOK) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_COUNTBACK)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_WERE)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_WENT)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_TOOK) >> _s >> by_ref(s_scl_ANOTH)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_TIE) >> _s >> by_ref(s_scl_FOR)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_TI) >> _s >> by_ref(s_scl_IN)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_THI) >> _s >> by_ref(s_scl_EVENT) >> _s >> by_ref(s_scl_TONIGHT) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_IT) >> _s >> by_ref(s_scl_WA) >> _s >> by_ref(s_scl_ALMOST) >> _s >> by_ref(s_scl_AS) >> _s >> by_ref(s_scl_THOUGH) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_REST) >> _s >> by_ref(CNT_pvl_7) >> _s >> by_ref(s_scl_FIELD) >> _s >> by_ref(s_scl_WERE) >> _s >> by_ref(s_scl_CONTENT) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_TURN) >> _s >> by_ref(s_scl_SUCH) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_PRONOUNC) >> _s >> by_ref(s_scl_INTO) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_SELF_pvl_FULFILLING) >> _s >> by_ref(s_scl_PROPHECI) >> _s >> by_ref(s_scl_BY) >> _s >> by_ref(s_scl_PRESENT) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_SHARE)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_REPRES) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_HAD) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_FIRST) >> _s >> by_ref(s_scl_ATTEMPT) >> _s >> by_ref(s_scl_CLEARANC) >> _s >> by_ref(s_scl_WHICH) >> _s >> by_ref(s_scl_WA) >> _s >> by_ref(s_scl_GOOD) >> _s >> by_ref(s_scl_ENOUGH) >> _s >> by_ref(s_scl_FOR)); HEADSYMBOL_part_15 = (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_PLACE) >> _s >> by_ref(s_scl_AT) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_HOME) >> _s >> by_ref(s_scl_SOIL) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_COUNT_pvl_BACK)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_PLACE)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_MEDALLIST) >> _s >> by_ref(s_scl_FROM) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl__sq_S) >> _s >> by_ref(s_scl_EVENT) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_LEAP) >> _s >> by_ref(s_scl_TO)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_MEDALLIST) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_HAD) >> _s >> by_ref(s_scl_THREE) >> _s >> by_ref(s_scl_FAILUR) >> _s >> by_ref(s_scl_AND) >> _s >> by_ref(s_scl_LEFT) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_MAKE) >> _s >> by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_ON) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_THIRD) >> _s >> by_ref(s_scl_TRY) >> _s >> by_ref(s_scl__octal_205_) >> _s >> by_ref(s_scl_WHEN) >> _s >> by_ref(s_scl_ALL) >> _s >> by_ref(s_scl_THREE) >> _s >> by_ref(s_scl_OF) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_COMPETITOR) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_THEIR) >> _s >> by_ref(s_scl_FIRST) >> _s >> by_ref(s_scl_ATTEMPT) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_NAME) >> _s >> by_ref(s_scl_CHOSE) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_PASS) >> _s >> by_ref(s_scl_AT) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_HEIGHT) >> _s >> by_ref(s_scl__pvl_) >> _s >> by_ref(s_scl_WHICH) >> _s >> by_ref(s_scl_WOULD) >> _s >> by_ref(s_scl_HAVE) >> _s >> by_ref(s_scl_EXCEED) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(CNT_pvl_1) >> _s >> by_ref(s_scl_BY) >> _s >> by_ref(s_scl_A) >> _s >> by_ref(s_scl_CENTIMET) >> _s >> by_ref(s_scl__pvl_) >> _s >> by_ref(s_scl_AND) >> _s >> by_ref(s_scl_AGAIN) >> _s >> by_ref(s_scl_JOIN) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_COMPETIT) >> _s >> by_ref(s_scl_AT) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_ONLI) >> _s >> by_ref(s_scl_GENDER) >> _s >> by_ref(s_scl_TO) >> _s >> by_ref(s_scl_CLEAR) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_GIVE) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_MEDAL) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_JOINT)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_HI) >> _s >> by_ref(s_scl_WAI) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_HI) >> _s >> by_ref(s_scl_COUNTRI) >> _s >> by_ref(s_scl__octal_222_) >> _s >> by_ref(s_scl_S) >> _s >> by_ref(s_scl_ONLI)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_GOT) >> _s >> by_ref(s_scl_THE)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_FOR)); HEADSYMBOL_part_16 = (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_FINISH)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_FIFTH) >> _s >> by_ref(s_scl_NATIONALITY) >> _s >> by_ref(s_scl_OUTDOOR) >> _s >> by_ref(s_scl_TITL) >> _s >> by_ref(s_scl_OF) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_CAREER) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_JUMPER) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_COME) >> _s >> by_ref(s_scl_BACK) >> _s >> by_ref(s_scl_FROM) >> _s >> by_ref(s_scl_ANKL) >> _s >> by_ref(s_scl_INJURI) >> _s >> by_ref(s_scl_TO)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_CLEAR) >> _s >> by_ref(s_scl_PERFORMANCE) >> _s >> by_ref(s_scl_HERSELF) >> _s >> by_ref(s_scl_IN) >> _s >> by_ref(s_scl_JULI) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_WA) >> _s >> by_ref(s_scl_CONTENT) >> _s >> by_ref(s_scl_WITH)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_CELEBR)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_BITE) >> _s >> by_ref(s_scl_HI)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_AWARD)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_AN) >> _s >> by_ref(s_scl_UNEXPECT)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl_ALL) >> _s >> by_ref(s_scl_TI) >> _s >> by_ref(s_scl_FOR)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(s_scl__sq_S) >> _s >> by_ref(s_scl_16TH) >> _s >> by_ref(s_scl_STRAIGHT)) | (by_ref(CNT_pvl_6) >> _s >> by_ref(CNT_pvl_6)); HEADSYMBOL_part_17 = (by_ref(CNT_pvl_6) >> _s >> by_ref(CNT_pvl_4) >> _s >> by_ref(s_scl_ATTEMPT) >> _s >> by_ref(CNT_pvl_6)) | (by_ref(CNT_pvl_6)) | (by_ref(CNT_pvl_11) >> _s >> by_ref(s_scl_ORIGIN) >> _s >> by_ref(s_scl_ON) >> _s >> by_ref(s_scl_THE) >> _s >> by_ref(s_scl_SLATE) >> _s >> by_ref(s_scl_AS) >> _s >> by_ref(s_scl_WELL) >> _s >> by_ref(s_scl__com_) >> _s >> by_ref(s_scl_BUT) >> _s >> by_ref(s_scl_TIRE) >> _s >> by_ref(s_scl_AFTER) >> _s >> by_ref(s_scl_HER) >> _s >> by_ref(s_scl_CITY)) | (by_ref(CNT_pvl_11) >> _s >> by_ref(s_scl_FAR) >> _s >> by_ref(s_scl_BACK) >> _s >> by_ref(s_scl_IN)); HEADSYMBOL = (HEADSYMBOL_part_10_heads | HEADSYMBOL_part_11 | HEADSYMBOL_part_12 | HEADSYMBOL_part_13 | HEADSYMBOL_part_14 | HEADSYMBOL_part_15 | HEADSYMBOL_part_16 | HEADSYMBOL_part_17); s_scl__dqt_ = (as_xpr("\"")); s_scl__sq_S = (as_xpr("'s")); s_scl__lpar_ = (as_xpr("(")); s_scl__rpar_ = (as_xpr(")")); s_scl__com_ = (as_xpr(",")); s_scl__pvl_ = (as_xpr("-")); s_scl__sls_ = (as_xpr("/")); s_scl_16TH = (as_xpr("16th")); s_scl__cln_ = (as_xpr(";")); s_scl_A = (as_xpr("a")); s_scl_ABOUT = (as_xpr("about")); s_scl_ACCOMPLISH = (as_xpr("accomplish")); s_scl_ACHIEV = (as_xpr("achiev")); s_scl_AD = (as_xpr("ad")); s_scl_AFRICA = (as_xpr("africa")); s_scl_AFRICAN = (as_xpr("african")); s_scl_AFTER = (as_xpr("after")); s_scl_AGAIN = (as_xpr("again")); s_scl_AGE = (as_xpr("age")); s_scl_AGO = (as_xpr("ago")); s_scl_ALL = (as_xpr("all")); s_scl_ALL_pvl_AMERICAN = (as_xpr("all-american")); s_scl_ALMOST = (as_xpr("almost")); s_scl_ALREADI = (as_xpr("alreadi")); s_scl_ALSO = (as_xpr("also")); s_scl_AN = (as_xpr("an")); s_scl_AND = (as_xpr("and")); s_scl_ANI = (as_xpr("ani")); s_scl_ANKL = (as_xpr("ankl")); s_scl_ANOTH = (as_xpr("anoth")); s_scl_APPAR = (as_xpr("appar")); s_scl_APPEAR = (as_xpr("appear")); s_scl_ARGUMENT = (as_xpr("argument")); s_scl_AS = (as_xpr("as")); s_scl_ASIC = (as_xpr("asic")); s_scl_AT = (as_xpr("at")); s_scl_ATTEMPT = (as_xpr("attempt")); s_scl_AUDIBL = (as_xpr("audibl")); s_scl_AWARD = (as_xpr("award")); s_scl_BACK = (as_xpr("back")); s_scl_BE = (as_xpr("be")); s_scl_BEAT = (as_xpr("beat")); s_scl_BECAM = (as_xpr("becam")); s_scl_BECOM = (as_xpr("becom")); s_scl_BEEN = (as_xpr("been")); s_scl_BEFOR = (as_xpr("befor")); s_scl_BEHIND = (as_xpr("behind")); s_scl_BEST = (as_xpr("best")); s_scl_BETTER = (as_xpr("better")); s_scl_BIGGEST = (as_xpr("biggest")); s_scl_BITE = (as_xpr("bite")); s_scl_BOTH = (as_xpr("both")); s_scl_BOUNC = (as_xpr("bounc")); s_scl_BOW = (as_xpr("bow")); s_scl_BROKE = (as_xpr("broke")); s_scl_BROKEN = (as_xpr("broken")); s_scl_BUILD = (as_xpr("build")); s_scl_BUOI = (as_xpr("buoi")); s_scl_BUT = (as_xpr("but")); s_scl_BY = (as_xpr("by")); s_scl_CAL = (as_xpr("cal")); s_scl_CAME = (as_xpr("came")); s_scl_CAN = (as_xpr("can")); s_scl_CAP = (as_xpr("cap")); s_scl_CAREER = (as_xpr("career")); s_scl_CELEBR = (as_xpr("celebr")); s_scl_CENTIMET = (as_xpr("centimet")); s_scl_CENTIMETR = (as_xpr("centimetr")); s_scl_CHAMPION = (as_xpr("champion")); s_scl_CHAMPIONSHIP = (as_xpr("championship")); s_scl_CHEER = (as_xpr("cheer")); s_scl_CHOSE = (as_xpr("chose")); s_scl_CITIZEN = (as_xpr("citizen")); s_scl_CITY = (as_xpr("city")); s_scl_CLAIM = (as_xpr("claim")); s_scl_CLEAR = (as_xpr("clear")); s_scl_CLEARANC = (as_xpr("clearanc")); s_scl_CLIMB = (as_xpr("climb")); s_scl_CLINCH = (as_xpr("clinch")); s_scl_COLLECT = (as_xpr("collect")); s_scl_COME = (as_xpr("come")); s_scl_COMEBACK = (as_xpr("comeback")); s_scl_COMFORT = (as_xpr("comfort")); s_scl_COMPET = (as_xpr("compet")); s_scl_COMPETIT = (as_xpr("competit")); s_scl_COMPETITOR = (as_xpr("competitor")); s_scl_CONDIT = (as_xpr("condit")); s_scl_CONFIRM = (as_xpr("confirm")); s_scl_CONTENT = (as_xpr("content")); s_scl_COULD = (as_xpr("could")); s_scl_COULDN_sq_T = (as_xpr("couldn't")); s_scl_COUNT_pvl_BACK = (as_xpr("count-back")); s_scl_COUNTBACK = (as_xpr("countback")); s_scl_COUNTRI = (as_xpr("countri")); s_scl_COUNTRY = (as_xpr("country")); s_scl_CROWD = (as_xpr("crowd")); s_scl_CZECH = (as_xpr("czech")); s_scl_DATE = (as_xpr("date")); s_scl_DEFEND = (as_xpr("defend")); s_scl_DISTANT = (as_xpr("distant")); s_scl_DOLDRUM = (as_xpr("doldrum")); s_scl_DOUBL = (as_xpr("doubl")); s_scl_DUAL = (as_xpr("dual")); s_scl_EARN = (as_xpr("earn")); s_scl_ENJOI = (as_xpr("enjoi")); s_scl_ENOUGH = (as_xpr("enough")); s_scl_ENSUR = (as_xpr("ensur")); s_scl_EQUAL = (as_xpr("equal")); s_scl_EUROPEAN = (as_xpr("european")); s_scl_EVEN = (as_xpr("even")); s_scl_EVENT = (as_xpr("event")); s_scl_EVER = (as_xpr("ever")); s_scl_EXCEED = (as_xpr("exceed")); s_scl_EXECUT = (as_xpr("execut")); s_scl_EXIT = (as_xpr("exit")); s_scl_EXTRA = (as_xpr("extra")); s_scl_FAIL = (as_xpr("fail")); s_scl_FAILUR = (as_xpr("failur")); s_scl_FALL = (as_xpr("fall")); s_scl_FALTER = (as_xpr("falter")); s_scl_FAR = (as_xpr("far")); s_scl_FASHION = (as_xpr("fashion")); s_scl_FEEL = (as_xpr("feel")); s_scl_FIELD = (as_xpr("field")); s_scl_FIFTH = (as_xpr("fifth")); s_scl_FINAL = (as_xpr("final")); s_scl_FINISH = (as_xpr("finish")); s_scl_FIRE = (as_xpr("fire")); s_scl_FIRST = (as_xpr("first")); s_scl_FIRST_pvl_JUMP = (as_xpr("first-jump")); s_scl_FLAG = (as_xpr("flag")); s_scl_FOLLOW = (as_xpr("follow")); s_scl_FOR = (as_xpr("for")); s_scl_FOUND = (as_xpr("found")); s_scl_FROM = (as_xpr("from")); s_scl_FUTUR = (as_xpr("futur")); s_scl_GAIN = (as_xpr("gain")); s_scl_GARNER = (as_xpr("garner")); s_scl_GAVE = (as_xpr("gave")); s_scl_GENDER = (as_xpr("gender")); s_scl_GIVE = (as_xpr("give")); s_scl_GLOBAL = (as_xpr("global")); s_scl_GOE = (as_xpr("goe")); s_scl_GONE = (as_xpr("gone")); s_scl_GOOD = (as_xpr("good")); s_scl_GOT = (as_xpr("got")); s_scl_GRADUAT = (as_xpr("graduat")); s_scl_GUTSI = (as_xpr("gutsi")); s_scl_HA = (as_xpr("ha")); s_scl_HAD = (as_xpr("had")); s_scl_HAIL = (as_xpr("hail")); s_scl_HAPPI = (as_xpr("happi")); s_scl_HAVE = (as_xpr("have")); s_scl_HE = (as_xpr("he")); s_scl_HEARTBREAK = (as_xpr("heartbreak")); s_scl_HEIGHT = (as_xpr("height")); s_scl_HER = (as_xpr("her")); s_scl_HEROIC = (as_xpr("heroic")); s_scl_HERSELF = (as_xpr("herself")); s_scl_HI = (as_xpr("hi")); s_scl_HIGH = (as_xpr("high")); s_scl_HIGHER = (as_xpr("higher")); s_scl_HIM = (as_xpr("him")); s_scl_HOME = (as_xpr("home")); s_scl_HOMETOWN = (as_xpr("hometown")); s_scl_HONOUR = (as_xpr("honour")); s_scl_IMPRESS = (as_xpr("impress")); s_scl_IN = (as_xpr("in")); s_scl_INCLUD = (as_xpr("includ")); s_scl_INCREAS = (as_xpr("increas")); s_scl_INDOOR = (as_xpr("indoor")); s_scl_INJURI = (as_xpr("injuri")); s_scl_INTO = (as_xpr("into")); s_scl_IS = (as_xpr("is")); s_scl_IT = (as_xpr("it")); s_scl_JOIN = (as_xpr("join")); s_scl_JOINT = (as_xpr("joint")); s_scl_JULI = (as_xpr("juli")); s_scl_JUMP = (as_xpr("jump")); s_scl_JUMPER = (as_xpr("jumper")); s_scl_JUNIOR = (as_xpr("junior")); s_scl_JUST = (as_xpr("just")); s_scl_LAST = (as_xpr("last")); s_scl_LATE = (as_xpr("late")); s_scl_LATE_pvl_HOUR = (as_xpr("late-hour")); s_scl_LEAD = (as_xpr("lead")); s_scl_LEADER = (as_xpr("leader")); s_scl_LEAP = (as_xpr("leap")); s_scl_LEFT = (as_xpr("left")); s_scl_LIFT = (as_xpr("lift")); s_scl_LIKE = (as_xpr("like")); s_scl_LINE = (as_xpr("line")); s_scl_LOOK = (as_xpr("look")); s_scl_LOUDLI = (as_xpr("loudli")); s_scl_LOWEST = (as_xpr("lowest")); s_scl_LUI = (as_xpr("lui")); s_scl_M = (as_xpr("m")); s_scl_MADE = (as_xpr("made")); s_scl_MAI = (as_xpr("mai")); s_scl_MAKE = (as_xpr("make")); s_scl_MANAG = (as_xpr("manag")); s_scl_MARYLAND = (as_xpr("maryland")); s_scl_MEDAL = (as_xpr("medal")); s_scl_MEDALLIST = (as_xpr("medallist")); s_scl_MEET = (as_xpr("meet")); s_scl_METR = (as_xpr("metr")); s_scl_MOMENTARILI = (as_xpr("momentarili")); s_scl_MOMENTUM = (as_xpr("momentum")); s_scl_MONTH = (as_xpr("month")); s_scl_MORE = (as_xpr("more")); s_scl_MOTIV = (as_xpr("motiv")); s_scl_MOVE = (as_xpr("move")); s_scl_NAME = (as_xpr("name")); s_scl_NATION = (as_xpr("nation")); s_scl_NATIONALITY = (as_xpr("nationality")); s_scl_NATIV = (as_xpr("nativ")); s_scl_NEAR_pvl_PB = (as_xpr("near-pb")); s_scl_NEED = (as_xpr("need")); s_scl_NEVER = (as_xpr("never")); s_scl_NEW = (as_xpr("new")); s_scl_NO = (as_xpr("no")); s_scl_NO_pvl_CONTEST = (as_xpr("no-contest")); s_scl_NOT = (as_xpr("not")); s_scl_NOTIC = (as_xpr("notic")); s_scl_NOW = (as_xpr("now")); s_scl_OBISPO = (as_xpr("obispo")); s_scl_OCCAS = (as_xpr("occas")); s_scl_OF = (as_xpr("of")); s_scl_OFF = (as_xpr("off")); s_scl_OLYMP = (as_xpr("olymp")); s_scl_ON = (as_xpr("on")); s_scl_ONC = (as_xpr("onc")); s_scl_ONLI = (as_xpr("onli")); s_scl_OPEN = (as_xpr("open")); s_scl_OPENING_pvl_ROUND = (as_xpr("opening-round")); s_scl_ORIGIN = (as_xpr("origin")); s_scl_OUNC = (as_xpr("ounc")); s_scl_OUT = (as_xpr("out")); s_scl_OUTDOOR = (as_xpr("outdoor")); s_scl_OVER = (as_xpr("over")); s_scl_OVERTOOK = (as_xpr("overtook")); s_scl_OWN = (as_xpr("own")); s_scl_PASS = (as_xpr("pass")); s_scl_PB = (as_xpr("pb")); s_scl_PB_pvl_EQUALLING = (as_xpr("pb-equalling")); s_scl_PERFECT = (as_xpr("perfect")); s_scl_PERFORM = (as_xpr("perform")); s_scl_PERFORMANCE = (as_xpr("performance")); s_scl_PERSON = (as_xpr("person")); s_scl_PICK = (as_xpr("pick")); s_scl_PLACE = (as_xpr("place")); s_scl_POINT = (as_xpr("point")); s_scl_POLY_pvl_SAN = (as_xpr("poly-san")); s_scl_POST = (as_xpr("post")); s_scl_PRESENT = (as_xpr("present")); s_scl_PREVAIL = (as_xpr("prevail")); s_scl_PRINCETON = (as_xpr("princeton")); s_scl_PRODUC = (as_xpr("produc")); s_scl_PRONOUNC = (as_xpr("pronounc")); s_scl_PROPHECI = (as_xpr("propheci")); s_scl_PUBLIC = (as_xpr("public")); s_scl_PULL = (as_xpr("pull")); s_scl_QUICKSILV = (as_xpr("quicksilv")); s_scl_QUIET = (as_xpr("quiet")); s_scl_RANK = (as_xpr("rank")); s_scl_RANKING = (as_xpr("ranking")); s_scl_REACH = (as_xpr("reach")); s_scl_RECORD = (as_xpr("record")); s_scl_RECOV = (as_xpr("recov")); s_scl_REIGN = (as_xpr("reign")); s_scl_RELEG = (as_xpr("releg")); s_scl_REMARK = (as_xpr("remark")); s_scl_REPRES = (as_xpr("repres")); s_scl_REQUIR = (as_xpr("requir")); s_scl_RESPECT = (as_xpr("respect")); s_scl_RESPOND = (as_xpr("respond")); s_scl_REST = (as_xpr("rest")); s_scl_RETURN = (as_xpr("return")); s_scl_RIVAL = (as_xpr("rival")); s_scl_ROLL = (as_xpr("roll")); s_scl_ROSE = (as_xpr("rose")); s_scl_S = (as_xpr("s")); s_scl_SAID = (as_xpr("said")); s_scl_SATISFI = (as_xpr("satisfi")); s_scl_SCORE = (as_xpr("score")); s_scl_SEASON = (as_xpr("season")); s_scl_SECOND = (as_xpr("second")); s_scl_SELF_pvl_FULFILLING = (as_xpr("self-fulfilling")); s_scl_SETTL = (as_xpr("settl")); s_scl_SHARE = (as_xpr("share")); s_scl_SHE = (as_xpr("she")); s_scl_SHOCK = (as_xpr("shock")); s_scl_SHORTER = (as_xpr("shorter")); s_scl_SHOUT = (as_xpr("shout")); s_scl_SIMPL = (as_xpr("simpl")); s_scl_SINC = (as_xpr("sinc")); s_scl_SLATE = (as_xpr("slate")); s_scl_SNATCH = (as_xpr("snatch")); s_scl_SOIL = (as_xpr("soil")); s_scl_SOMETH = (as_xpr("someth")); s_scl_SOUTH = (as_xpr("south")); s_scl_SPARTANBURG = (as_xpr("spartanburg")); s_scl_SPLENDID = (as_xpr("splendid")); s_scl_SPORT = (as_xpr("sport")); s_scl_STAI = (as_xpr("stai")); s_scl_STAND = (as_xpr("stand")); s_scl_STAR = (as_xpr("star")); s_scl_STATU = (as_xpr("statu")); s_scl_STRAIGHT = (as_xpr("straight")); s_scl_STUCK = (as_xpr("stuck")); s_scl_SUCCESS = (as_xpr("success")); s_scl_SUCH = (as_xpr("such")); s_scl_SUFFIC = (as_xpr("suffic")); s_scl_SUPPORT = (as_xpr("support")); s_scl_SURPRIS = (as_xpr("surpris")); s_scl_SUSTAIN = (as_xpr("sustain")); s_scl_TAKE = (as_xpr("take")); s_scl_TANTALIS = (as_xpr("tantalis")); s_scl_TC = (as_xpr("tc")); s_scl_THAN = (as_xpr("than")); s_scl_THAT = (as_xpr("that")); s_scl_THE = (as_xpr("the")); s_scl_THEIR = (as_xpr("their")); s_scl_THEN = (as_xpr("then")); s_scl_THERE = (as_xpr("there")); s_scl_THI = (as_xpr("thi")); s_scl_THIRD = (as_xpr("third")); s_scl_THIRD_pvl_TIME = (as_xpr("third-time")); s_scl_THOUGH = (as_xpr("though")); s_scl_THREATEN = (as_xpr("threaten")); s_scl_THREE = (as_xpr("three")); s_scl_THROUGH = (as_xpr("through")); s_scl_TI = (as_xpr("ti")); s_scl_TIE = (as_xpr("tie")); s_scl_TIME = (as_xpr("time")); s_scl_TIRE = (as_xpr("tire")); s_scl_TITL = (as_xpr("titl")); s_scl_TO = (as_xpr("to")); s_scl_TODAI = (as_xpr("todai")); s_scl_TOKEN_pvl_INTEGER = (as_xpr("token-integer")); s_scl_TONIGHT = (as_xpr("tonight")); s_scl_TOOK = (as_xpr("took")); s_scl_TOP = (as_xpr("top")); s_scl_TOWN = (as_xpr("town")); s_scl_TRACK = (as_xpr("track")); s_scl_TRY = (as_xpr("try")); s_scl_TURN = (as_xpr("turn")); s_scl_TWICE = (as_xpr("twice")); s_scl_TWO = (as_xpr("two")); s_scl_UNEXPECT = (as_xpr("unexpect")); s_scl_UNKNOWN = (as_xpr("unknown")); s_scl_UNSUCCESS = (as_xpr("unsuccess")); s_scl_UP = (as_xpr("up")); s_scl_UPSET = (as_xpr("upset")); s_scl_VERI = (as_xpr("veri")); s_scl_WA = (as_xpr("wa")); s_scl_WAI = (as_xpr("wai")); s_scl_WAKE = (as_xpr("wake")); s_scl_WAYSID = (as_xpr("waysid")); s_scl_WEEK = (as_xpr("week")); s_scl_WEIGHT = (as_xpr("weight")); s_scl_WELL = (as_xpr("well")); s_scl_WELL_pvl_DESERVED = (as_xpr("well-deserved")); s_scl_WENT = (as_xpr("went")); s_scl_WERE = (as_xpr("were")); s_scl_WHAT = (as_xpr("what")); s_scl_WHEN = (as_xpr("when")); s_scl_WHICH = (as_xpr("which")); s_scl_WHO = (as_xpr("who")); s_scl_WHOSE = (as_xpr("whose")); s_scl_WILL = (as_xpr("will")); s_scl_WINNER = (as_xpr("winner")); s_scl_WITH = (as_xpr("with")); s_scl_WON = (as_xpr("won")); s_scl_WORLD = (as_xpr("world")); s_scl_WOULD = (as_xpr("would")); s_scl_YEAR = (as_xpr("year")); s_scl_YEAR_pvl_OLD = (as_xpr("year-old")); s_scl__octal_205_ = (as_xpr("")); s_scl__octal_222_ = (as_xpr("")); s_scl__octal_226_ = (as_xpr("")); s_scl__octal_227_ = (as_xpr("")); // Symbol tables initialisation... };// initialise_grammar_name_pvl_ranking_pvl_learned //////////////////////////////////////////////////////////////////////////// // // Main program // //////////////////////////////////////////////////////////////////////////// int main(int argc, char* argv[]) { std::string line; boost::xpressive::smatch what; initialise_grammar_name_pvl_ranking_pvl_learned(); debug_output = false; // Simple argument dispatch... if (argc < 2 || (argc > 1 && argv[1][0] == '-' && argv[1][1] == 'h')) { std::cout << "Usage: " << argv[0] << "-<option>" << std::endl; std::cout << " Valid options are:" << std::endl; std::cout << " -h: this help message" << std::endl; std::cout << " -e <expression>: evaluate the provided expression\n"; std::cout << " -f <input-filename> <output-filename> ?-debug?\n"; return 10; } if (argv[1][0] != '-') {return 11;} if (argv[1][1] == 'e') { if (argc < 3) {return 12;} line = argv[2]; std::cout << boost::xpressive::regex_match(line, what, HEADSYMBOL) << std::endl; } else if (argv[1][1] == 'f') { if (argc > 4) debug_output = true; std::ifstream in(argv[2]); // input file if (!in) { std::cout << "Cannot open input file: \"" << argv[2] << "\".\n"; return 13; } std::ofstream out(argv[3]); // output file if (!out) { std::cout << "Cannot open output file: \"" << argv[3] << "\".\n"; return 14; } // Read the input file, line by line... while (getline(in, line, '\n')) { if (in) { if (debug_output) { out << "Expr: \"" << line << '\"' << std::endl; out.flush(); } if (boost::xpressive::regex_match(line, what, HEADSYMBOL)) { out << 1 << std::endl; } else { out << 0 << std::endl; } out.flush(); } } in.close(); out.close(); } return 0; }; // main // EOF

2 3

[Boost Interprocess] - Shared Memory File - Corruption
by Srinivas Gardas 11 Jan '08

11 Jan '08

Hi, I am facing an issue with the 'Shared Memory File'.. Sometimes I get the 'SharedMemory File Name' as the first element of the structure that I used, to create a 'interprocess::list' and when this happens, it means that the SharedMemory got corrupted and my program crashes. Has anyone faced this issue, or does anyone know what might be wrong? Here's how I am using the Boost::Interprocess struct *struct_a* { char sym[6]; char desc[8]; double price; }; typedef boost::interprocess::managed_shared_memory::segment_manager SegmentManager; typedef boost::interprocess::allocator<*struct_a*, SegmentManager> shMemAllocator; typedef boost::interprocess::list<*struct_a*, shMemAllocator> shMemList; typedef boost::interprocess::managed_shared_memory shMemObject boost::scoped_ptr< boost::interprocess::managed_shared_memory > m_shMemPtr; shMemList* m_pList; m_shMemPtr.reset( new shMemObject(boost::interprocess::open_or_create, "shmemfile.shmem" , 100000*sizeof(*struct_a*))); m_shMemPtr->reserve_named_objects(100000); m_pList = m_shMemPtr->find_or_construct<shMemList>("SHMEM_NAME")(m_shMemPtr->get_segment_manager()); struct_a stOne; strcpy(stOne.sym, "ABCDE"); strcpy(stOne.desc, "FGHIJK"); stOne.price = 10.25; m_pList->push_back(stOne); Another program Opens this sharedmemory file and reads the struct from the list and '*pops*' it. What happens sometimes is, In the first field of the struct I see '* SHMEM_NAME*' and the program crashes when this happens. I am not sure what's causing the *struct.field *to comein as Sharedmemory name? If I clean the shared memory file and restart it works fine but I end up with this problem some ther time. This does not happen regularly but it sure does. I'd really appreciate any help figuring the solution out or if there's any mistake I am making. Thanks in Advance, Srinivas Gardas

2 5

trouble building boost when there is only partial GCC installation
by Andrew Marlow 11 Jan '08

11 Jan '08

I am trying to build boost on solaris9 where there is only a partial GCC installation. Version 3.4.6 of g++ is installed but the vendor linker is the only linker available (this cannot be changed, there are no SAs and I do not know the root password). I have already found there are lots of compilation errors unless I say -with-icu=no". But I am getting errors now when it tries to invoke the linker. It looks like it assumes the GCC (binutils) linker is available if the GCC compiler is being used. Here's what I get: ...updating 70 targets... gcc.link.dll bin.v2/libs/serialization/build/gcc-3.4.6/debug/threading-multi/libboost_seri alization-gcc34-mt-d-1_34_1.so.1.34.1 /usr/ccs/bin/ld: illegal option -- - /usr/ccs/bin/ld: illegal option -- - /usr/ccs/bin/ld: illegal option -- g ld: warning: option -o appears more than once, first setting taken /usr/ccs/bin/ld: illegal option -- - usage: ld [-6:abc:d:e:f:h:il:mo:p:rstu:z:B:CD:F:GI:L:M:N:P:Q:R:S:VY:?] file(s) [-64] enforce a 64-bit link-edit [rest of output snipped] I presume this error would go away if the GCC ld was used. Unfortunately I cannot test that theory because I cannot install ld. Just adding the GCC ld to my PATH on the front does not stop the vendor ld from being used. I suspect that because g++ was linked using the vendor linker, it will always use the vendor linker. In which case I think there is a problem in the boost build. Regards, Andrew Marlow ---- There is an emerald here the size of a plover's egg! Don't top-post http://www.catb.org/~esr/jargon/html/T/top-post.html Plain text mails only, please http://www.expita.com/nomime.html --- This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and delete this e-mail. Any unauthorized copying, disclosure or distribution of the material in this e-mail is strictly forbidden. Please refer to http://www.db.com/en/content/eu_disclosures.htm for additional EU corporate and regulatory disclosures.

2 2

[test framework] tread safe?
by Ovanes Markarian 11 Jan '08

11 Jan '08

Hello, is Boost.Test framework thread safe in regards to the following use case: I would like to start multiple threads with some testing tasks. These threads will call boost TestTools functions (BOOST_CHECK... etc.). Is this scenario supported? With Kind Regards, Ovanes Markarian

2 8

Newbie question
by Eric Fowler 11 Jan '08

11 Jan '08

Hate to keep peppering the list with these, but I am stuck: In the Kevin Bacon sample, there appears this fragment: // Convenience function template <typename DistanceMap> bacon_number_recorder<DistanceMap> record_bacon_number(DistanceMap d) { return bacon_number_recorder<DistanceMap>(d); } Which is used thus: std::vector<int> bacon_number(num_vertices(g)); breadth_first_search(g, src, visitor(record_bacon_number(&bacon_number[0]))); I am puzzled about the convenience function ... why use it at all? But when I take it out: vector<int> numbers(num_vertices(g)); numbers[s] = 0; breadth_first_search(g, s, visitor(my_distance_recorder<vector<int> >(numbers))); All entries for vector<int> numbers are zero. I changed the declaration for the recorder's ctor to look like this: my_distance_recorder(Map& _m):m(_m){}; Making it get a reference to that vector, because I assumed I was recording into a local copy that was being thrown away. No dice, still zeroes. My "graph" is a straight line of v---v---v---v---v---etc. for simplicity, so I should be seeing a bfs count of 0, 1, 2, 3, etc. The visitor function is being called and is writing incremented values into the vector - but when it comes back, all are zero. What's going on? The convenience function must be related to this problem but I don't see the connection. Eric Also noticed that: breadth_first_search(g, s, visitor(my_distance_recorder<vector<int> >(&numbers[0]))); for breadth_first_search(g, s, visitor(my_distance_recorder<vector<int> >(numbers))); gets a compile time error.

1 0

[Serialization] XML serialization (newbie question)
by Hasse Carlsson 11 Jan '08

11 Jan '08

I have a newbie question regarding Boost XML serialization: In the example of an XML archive ( http://www.boost.org/libs/serialization/example/demo_save.xml) there are lots of attributes (class_id, tracking_level, class_id_reference etc) included in the XML output. I would like to produce an XML archive _without_ these attributes - how do I achieve that? Can such an XML archive be restored, or are the attributes needed for "de-serialization" to work properly? Thanks, hcsson(a)gmail.com

2 1

Fwd: Serialization problems, shared_ptr etc...
by Hannes Baldursson 10 Jan '08

10 Jan '08

Hi everybody.I'm having problems understanding the Boost::Serialization library. I've managed to get it to save my object... but once I try to load them in to the code doesn't compile. It fails on the line where the ifstream writes to the object. Basically what I'm trying to do is to save a hierarchy of objects that build up a filesystem namespace for a virtual filesystem I'm trying to code. It's something like this: Filesystem_NS --> fsFile -->--> fsFileChunk -->--> fsFileChunk --> fsFile -->--> fsFileChunk -->--> fsFileChunk The code isn't commented very well but it's nothing more than saving and loading the data structures at the moment. There is no code/methods note: There are more errors but they're so many that the forum doesn't allow me to post all of them because of a character limit It looks there's a problem that I'm boost::shared_ptr or something... I don't know I've been probably looking at this for too long. The code compiles if I remove the line where it loads the fsImage file back in to an object. Note that it does save properly. That is, I believe all the data shows up in the saved archive although I can't be sure unless I'm able to restore the state. Could someone here give me a hand? *hdfs.cpp* Code: #ifdef HAVE_CONFIG_H #include <config.h> #endif #include <iostream> #include <fstream> #include <cstdlib> #include <utility> #include "FileSystem.h" #include "fstypes.h" #include "fsFile.h " #include "fsFileChunk.h" #include <boost/shared_ptr.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/shared_ptr.hpp> #include <boost/serialization/vector.hpp> #include <boost/serialization/map.hpp> using namespace std; int main(int argc, char *argv[]) { // string s1 = Path::normalizePath("http://asdfasd/fasdfa//asdf//"); string fsPath = "./fsImage"; FileSystem_NS * const fs = new FileSystem_NS(fsPath); fileId_t fid = ++(*fs).nextFileId; fsFile_Ptr ff(new fsFile(fid)); (*fs).files.insert(pair<string, fsFile_Ptr>("biomynd",ff)); chunkVersion_t cv = 1; size_t cs = 67108864; fsFileChunk_Ptr fc(new fsFileChunk(++(*fs).nextChunkId, (*ff).fID, cv, cs)); ff->addChunk(fc); ofstream ofs("./fsImage"); { boost::archive::text_oarchive oa(ofs); // write class instance to archive oa << (const FileSystem_NS)(*fs); // archive and stream closed when destructors are called } ofs.close(); FileSystem_NS const *newFilesystem = new FileSystem_NS("lol"); ifstream ifs("./fsImage"); { // open the archive boost::archive::text_iarchive ia(ifs); // restore the schedule from the archive ia >> (*newFilesystem); } ifs.close(); cout << fs->fsImage_Path << endl; return EXIT_SUCCESS; } *FileSystem.h* Code: /************************************************************************ FileSystem.h - Copyright Hannes Baldursson **************************************************************************/ #ifndef FILESYSTEM_H #define FILESYSTEM_H #include "fstypes.h" #include "fsFile.h" #include "fsFileChunk.h" #include <string> #include <map> #include <vector> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/vector.hpp> #include <boost/serialization/map.hpp> #include <boost/serializati #ifdef HAVE_CONFIG_H #include <config.h> #endif #include <iostream> #include <fstream> #include <cstdlib> #include <utility> #include "FileSystem.h" #include "fstypes.h" #include "fsFile.h" #include "fsFileChunk.h" #include <boost/shared_ptr.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/shared_ptr.hpp> #include <boost/serialization/vector.hpp> #include <boost/serialization/map.hpp> using namespace std; int main(int argc, char *argvon/tracking.hpp> #include <boost/shared_ptr.hpp> using namespace std; // Filesystem namespace class FileSystem_NS { public: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) const { ar & nextFileId; ar & nextChunkId; ar & files; } fileId_t nextFileId; chunkId_t nextChunkId; const string fsImage_Path; FileSystem_NS(string fsImage = "./fsImage"); map<string, fsFile_Ptr> files; // Maps filenames to fileIds }; BOOST_CLASS_TRACKING(FileSystem_NS, boost::serialization::track_always) #endif // FILESYSTEM_H *fsFile.h* Code: #ifndef FSFILE_H #define FSFILE_H #include <string> #include <map> #include "fstypes.h" #include "fsFileChunk.h" #include <boost/shared_ptr.hpp> #include <boost/serialization/vector.hpp> using namespace std; class fsFile { public: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) const { ar & fname; ar & fID; ar & chunks; } string fname; fileId_t fID; vector<fsFileChunk_Ptr> chunks; // Create a fsFile fsFile(fileId_t fileID); void addChunk(fsFileChunk_Ptr ptr); }; typedef boost::shared_ptr<fsFile> fsFile_Ptr; BOOST_CLASS_TRACKING(fsFile, boost::serialization::track_always) #endif *fsFileChunk.h* Code: #ifndef FSFILE_CHUNK_H #define FSFILE_CHUNK_H #include <vector> #include <string> #include "fstypes.h" #include <boost/shared_ptr.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> using namespace std; class fsFileChunk { public: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) const { ar & cID; ar & fID; ar & cVersion; ar & cSize; } chunkId_t cID; fileId_t fID; // This chunk belongs to file "fileID" chunkVersion_t cVersion; // Current version size_t cSize; std::vector<string> hosts; // vector of hostIP:port for the datanodes that host this chunk. fsFileChunk(chunkId_t chunkID, fileId_t fileID, chunkVersion_t chunkVersion, size_t chunkSize); }; typedef boost::shared_ptr<fsFileChunk> fsFileChunk_Ptr; BOOST_CLASS_TRACKING(fsFileChunk, boost::serialization::track_always) #endif // FSFILE_CHUNK_H *fstypes.h* Code: #ifndef COMMON_FSTYPES_H #define COMMON_FSTYPES_H #include <stdint.h> typedef unsigned long long fileId_t; typedef unsigned long long chunkId_t; typedef unsigned int chunkVersion_t; #endif These are all the header files plus the "main program". Code: /usr/lib/gcc/x86_64-pc-linux-gnu/4.1.2/include/g++-v4/istream:231: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(std::basic_streambuf<_CharT, _Traits>*) [with _CharT = char, _Traits = std::char_traits<char>] <near match> /home/hannson/Projects/HDFS/src/boost/serialization/access.hpp: In static member function 'static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::text_iarchive, T = const std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::shared_ptr<fsFile>, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::shared_ptr<fsFile> > > >]': /home/hannson/Projects/HDFS/src/boost/serialization/serialization.hpp:81: instantiated from 'void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::text_iarchive, T = const std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::shared_ptr<fsFile>, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::shared_ptr<fsFile> > > >]' /home/hannson/Projects/HDFS/src/boost/serialization/serialization.hpp:140: instantiated from 'void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::text_iarchive, T = const std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::shared_ptr<fsFile>, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::shared_ptr<fsFile> > > >]' /home/hannson/Projects/HDFS/src/boost/archive/detail/iserializer.hpp:158: instantiated from 'void boost::archive::detail::iserializer<Archive, T>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned int) const [with Archive = boost::archive::text_iarchive, T = const std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::shared_ptr<fsFile>, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::shared_ptr<fsFile> > > >]' /home/hannson/Projects/HDFS/src/hdfs.cpp:70: instantiated from here /home/hannson/Projects/HDFS/src/boost/serialization/access.hpp:109: error: 'const class std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::shared_ptr<fsFile>, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<ch These are not all the error messages I get.. One important thing. I'm clearly missing something because even when I comment out the fsFile part from the serialization (that is I'm only saving nextFileId and nextChunkId in FileSystem_NS) it still doesn't compile when I'm including the loading code so it seems I'm having two problems. One problem is restoring the object in general, and the other is restoring the objects when using a shared_ptr. Btw, sorry about the html if you like it plain :)

1 0

Problems with msvc 8.0 and build example - please help
by mo mony 10 Jan '08

10 Jan '08

While running cl for msvc 8.0, following the tutorial directions for the example.cpp I get an error " can't find file utility - which is the include file in example. I notice that the path returned in the error has the slashes reversed after the BOOST_ROOT dir. The file definitely exits so I thought it must be a pathing type error. Anyone see this before ? Sorry, I am new to this program/list. I am trying to right some wrappers for C++ to be used by Python. Thanks, Ed ____________________________________________________________________________________ Be a better friend, newshound, and know-it-all with Yahoo! Mobile. Try it now. http://mobile.yahoo.com/;_ylt=Ahu06i62sR8HDtDypao8Wcj9tAcJ

2 1

Non-blocking i/o using ASIO socket
by Chauhan, Vikas 10 Jan '08

10 Jan '08

Hello all, Can you please advise where we need to use "non_blocking_io" flag in ASIO sockets. IIUC, we can do the same using all of the async_xxxx functions provided in the various socket classes. Does it mean that if we do not wish to use ioservice::post() mechanism, we have the option to use "non_blocking_io" flag and implement async functionality? Thanks, Vikas

2 1

Problem compiling some simple code ..
by Eric Fowler 10 Jan '08

10 Jan '08

I have been fiddling with this library off and on for some time ... now am getting this error: /home/eric/boostplay/g0/src/g0.cpp:55: error: no matching function for call to 'add_vertex(Graph (&)())' /home/eric/boostplay/g0/src/g0.cpp:56: error: no matching function for call to 'add_edge(Vertex&, Vertex&, Graph (&)())' on this code: <boost-users(a)lists.boost.org> #ifdef HAVE_CONFIG_H #include <config.h> #endif #include <iostream> #include <cstdlib> #include <boost/config.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/tuple/tuple.hpp> using namespace std; using namespace boost; typedef adjacency_list<vecS, vecS, undirectedS> Graph; typedef graph_traits<Graph>::vertex_descriptor Vertex; typedef graph_traits<Graph>::edge_descriptor Edge; int main(int argc, char *argv[]) { Graph g(); Vertex v = 0; for(int iv = 0; iv < 10; ++iv) for(int iu = 0; iu < 5; ++iu) { Vertex u; Edge e; bool inserted; u = v; tie(v, inserted) = add_vertex(g); tie(e, inserted) = add_edge(u, v, g); if(inserted) cout << "Inserted edge " << e << " from vertex " << u << " to vertex " << v << endl; else cout << "Failed to insert edge " << e << " from vertex " << u << " to vertex " << v << endl; } return EXIT_SUCCESS; } There was a thread on this a while back which suggested casting the call: tie(e, inserted) = add_edge(u, v, g); to tie(e, inserted) = add_edge(std::size_t(u), std::size_t(v), g); but that did not work. Notice my graph has no properties .. usually I don't make 'em that way, but that should be fine, right? Thanks very much, Eric

2 1

A* implemenation using BGL
by Christopher Gay 09 Jan '08

09 Jan '08

I'm having a problem implementing A*. I used Mr Beevers cities example as a spring board for my own version. I am using bundled properties and I am getting an error that I am unsure of how to correct. The error revolves around the CostMap template parameter for the astar_search. It typedefs the value_type to 'C' and the error tells me that I cannot convert int to 'C' in the std::numeric_limits<C>::max call in astar_dispatch2. I am not passing an object/container for the CostMap parameter. Attached are the files I am working with. Thanks for your help! Chris Gay

1 0

can a edge have more than 2 nodes?
by Meththa 09 Jan '08

09 Jan '08

Hi everyone, I am trying to draw a graph which contains nets with more than 2 nodes. At the moment in the program I am using add_edge() to add the edges to the graph. I give the 2 nodes and also a custom parameter of the net name that this edge belongs to. This solution seems to be a long way of doing things specially when I need to access all the nodes of a particular net. For this I end up running two FOR loops checking each edge to see the net name it belongs to and then accessing the nodes belonging to that edge. Does anyone know of how I can have more than 2 nodes attached to an edge (or net)? Thanks in advance Meth ____________________________________________________________________________________ Never miss a thing. Make Yahoo your home page. http://www.yahoo.com/r/hs

2 1

Bind with Tuple gcc error
by Moyukh 09 Jan '08

09 Jan '08

I was using boost::bind with boost::tuple as shown in the code snippet below. This piece of code compiles and executes fine in Visual Studio 2005 but while compiling with gcc-4.1 It throws error "unresolved overloaded function type" (This code actually does nothing except reproduce the error) I guess its because gcc was unable to figure out which get() to call as there are two version const and non const. Any suggestion how to make it work with gcc as well as VS2005. Code ---------------- #include <boost/tuple/tuple.hpp> #include <boost/bind.hpp> int main(int argc, char * argv[]) { typedef boost::tuple<int, bool, int > myTuple; myTuple mt; boost::bind(&myTuple::get<0>, _1)(mt); return 0; } gcc error.. -------------------- Test.cpp: In function 'int main(int, char**)': Test.cpp:13: error: call of overloaded 'bind(<unresolved overloaded function type>, boost::arg<1> (&)())' is ambiguous ../../../../../Boost/boost/bind/bind_mf_cc.hpp:20: note: candidates are: boost::_bi::bind_t<R, boost::_mfi::mf0<R, T>, typename boost::_bi::list_av_1<A1>::type> boost::bind(R (T::*)(), A1) [with R = int&, T = boost::tuples::cons<int, boost::tuples::cons<bool, boost::tuples::cons<int, boost::tuples::null_type> > >, A1 = boost::arg<1> (*)()] ../../../../../Boost/boost/bind/bind_mf_cc.hpp:30: note: boost::_bi::bind_t<R, boost::_mfi::cmf0<R, T>, typename boost::_bi::list_av_1<A1>::type> boost::bind(R (T::*)()const, A1) [with R = const int&, T = boost::tuples::cons<int, boost::tuples::cons<bool, boost::tuples::cons<int, boost::tuples::null_type> > >, A1 = boost::arg<1> (*)()] Thanks Moyukh

1 0

[iostreams] how to say a filter is closable
by frederic.bron＠alcan.com 09 Jan '08

09 Jan '08

I want to write a filter but this filter needs to do some things when the stream is ending. Is it enough to do the following? I want the close function to be called at the end of the stream. Do I need to category_flag to inherit from (closable_tag)? class my_filter : public io::dual_use_filter { public: template<typename Source> int get(Source&) ; template<typename Sink> bool put(Sink&, int) ; template<typename Device> void close(Device&, std::ios_base::openmode) ; } ; Fred Avis : Ce message et toute pièce jointe sont la propriété d'Alcan et sont destinés seulement aux personnes ou à l'entité à qui le message est adressé. Si vous avez reçu ce message par erreur, veuillez le détruire et en aviser l'expéditeur par courriel. Si vous n'êtes pas le destinataire du message, vous n'êtes pas autorisé à utiliser, à copier ou à divulguer le contenu du message ou ses pièces jointes en tout ou en partie. Notice: This message and any attachments are the property of Alcan and are intended solely for the named recipients or entity to whom this message is addressed. If you have received this message in error please inform the sender via e-mail and destroy the message. If you are not the intended recipient you are not allowed to use, copy or disclose the contents or attachments in whole or in part.

3 4

Switch library review extended to Sunday, Jan 13th
by Stjepan Rajko 09 Jan '08

09 Jan '08

The review for the Switch library has been extended to Sunday, January 13th. I hope that the extended period will provide an opportunity for more reviewers to submit their vote, and give enough time for the discussion on design to resolve. As this library is both small and seen as very useful, it seems preferable to take advantage of the momentum of the ongoing discussion between very knowledgeable reviewers and a very knowledgeable author, and get this ironed out now. Stjepan

1 0

(no subject)
by Lars Schouw 09 Jan '08

09 Jan '08

____________________________________________________________________________________ Looking for last minute shopping deals? Find them fast with Yahoo! Search. http://tools.search.yahoo.com/newsearch/category.php?category=shopping

1 0

Re: [Boost-users] [multi_index] range selection over composit_key problem
by Joaquín Mª López Muñoz 09 Jan '08

09 Jan '08

Hi Oliver, "Kowalke Oliver (QD IT PA AS)" ha escrito: > Hello, > I want to do an range selection over an composit key but I get compiler errors like: [...] > std::pair< > idx_type::iterator, > idx_type::iterator > > p( > idx.range( > boost::make_tuple( mi::unbounded, true), > boost::make_tuple( > boost::lambda::_1 >= 0., > true) ) ); I think there's a misunderstanding here about the usage of composite keys with range(): note that the composite key-based index sorts the elements of p according to a lexicographical order on (descending function, descending active); for instance, the values you insert in your example get sorted as follows: (1.1,false),(1,true),(0,true),(-1,true),(-1,false),(-1.1,true). Now, a fundamental limitation (or chararacteristic, if you wish) of range() is that it can only retrieve *contiguous* ranges, no matter whether the key used is simple, composite, custom or whatever . Your (syntactically incorrect) invocation to idx.range() suggests that you're trying to get the values with function>=0 and active==true, but the set of matching values is not contiguous (it is so by chance with the particular set of values you're using in oyur example, but it wouldn't be if for instance you inserted an additional (1,false) ). In order to do that you'd need to retrieve some larger range and filter out the "undesirable" elements, for example like this: // get all elements with function>=0 and arbitrary active: these do always form // a range. std::pair< idx_type::iterator, idx_type::iterator > p( idx.begin(), idx.upper_bound( boost::make_tuple(0.0) ) ); // filter out the elements with !active for ( ; p.first != p.second; ++p.first) if(p.first->active) std::cout << p.first->function << " " << std::boolalpha << p.first->active << std::endl; Hope this helps, please come back if something's still not clear. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 2

Can i build boost under cygwin?
by Steven Woody 09 Jan '08

09 Jan '08

hi, the building process failed. it reported the libraries was not fully build properly. does boost support cygwin? thanks. -- woody then sun rose thinly from the sea and the old man could see the other boats, low on the water and well in toward the shore, spread out across the current.

5 16

boost::asio - reason for asio_handler_invoke
by mikpol 08 Jan '08

08 Jan '08

Hi, I've been trying to understand the reasons to have asio_handler_invoke function, and so far I am unable to understand why it is needed. It is used to override invocation policy for a function-like object based on the handler. boost::asio gives one example with using io_service::strand: template<typename F> void asio_handler_invoke(F fun, MyHandler* h) { h->strand.invoke(fun); } My question is why is it needed to make this function templatized on ANY function object, and not just MyHandler? Why can't we just define MyHandler::operator() in terms of strand like this: struct MyHandler { io_service::strand strand. void operator()() { strand.invoke(boost::bind(&MyHandler::private_invoke, this)); } void private_invoke() { // do stuff... } } Thanks for any help. -- View this message in context: http://www.nabble.com/boost%3A%3Aasio---reason-for-asio_handler_invoke-tp14… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

[multi_index] range selection over composit_key problem
by Kowalke Oliver (QD IT PA AS) 08 Jan '08

08 Jan '08

Hello, I want to do an range selection over an composit key but I get compiler errors like: /home/kowalke/Projects/test_multi_index/src/test_multi_index.cpp:85: instantiated from here /opt/boost/include/boost-1_34/boost/multi_index/ordered_index.hpp:978: error: no match for call to '(boost::tuples::tuple<boost::multi_index::detail::unbounded_type, bool, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type>) (boost::multi_index::composite_key_result<boost::multi_index::composite_key<item, boost::multi_index::member<item, double, &item::function>, boost::multi_index::member<item, bool, &item::active>, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> >)' I've appended a test app. Thanks for advice! regards, Oliver #ifdef HAVE_CONFIG_H #include <config.h> #endif #include <algorithm> #include <iostream> #include <utility> #include <cstdlib> #include <stdexcept> #include <string> #include <boost/foreach.hpp> #include <boost/multi_index_container.hpp> #include <boost/multi_index/member.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/composite_key.hpp> #include <boost/lambda/lambda.hpp> namespace mi = boost::multi_index; struct item { double function; bool active; item( double function_, bool active_) : function( function_), active( active_) {} }; struct idx_tag {}; typedef mi::multi_index_container< item, mi::indexed_by< mi::ordered_unique< mi::tag< idx_tag >, mi::composite_key< item, mi::member< item, double, & item::function >, mi::member< item, bool, & item::active > >, mi::composite_key_compare< std::greater< double >, std::greater< bool > > > > > table; typedef table::index< idx_tag >::type idx_type; int main( int argc, char *argv[]) { try { table tbl; tbl.insert( item( -1.1, true) ); tbl.insert( item( 1., true) ); tbl.insert( item( 0., true) ); tbl.insert( item( 1.1, false) ); tbl.insert( item( -1., true) ); tbl.insert( item( -1., false) ); idx_type & idx( tbl.get< idx_tag >() ); std::pair< idx_type::iterator, idx_type::iterator > p( idx.range( boost::make_tuple( mi::unbounded, true), boost::make_tuple( boost::lambda::_1 >= 0., true) ) ); for ( ; p.first != p.second; ++p.first) std::cout << p.first->function << " " << std::boolalpha << p.first->active << std::endl; return EXIT_SUCCESS; } catch ( std::exception const& e) { std::cerr << e.what() << std::endl; } catch ( ... ) { std::cerr << "unhandled exception" << std::endl; } return EXIT_FAILURE; }

1 0

Re: [Boost-users] [boost] upcoming Switch library review Jan 5th - Jan 9th
by Stjepan Rajko 07 Jan '08

07 Jan '08

On Jan 6, 2008 7:34 AM, Tobias Schwinger <tschwinger(a)isonews2.com> wrote: > Steven Watanabe wrote: > > Tobias Schwinger <tschwinger <at> isonews2.com> writes: > >> Of course there are no pointers to templates, so using a function > >> pointer for anything but the default is pretty pointless. So is trying > >> to handle varying result types -- maybe the result type should be passed > >> in with another template parameter? > > > > I'd rather leave it as result_of<F()>::type. > > Actually 'result_of<F()>::type' determines the result of the nullary > call to F. I don't think I like this sort of "result_of abuse"... The > correct usage would be 'result_of<F(MPLConstant)>::type' but it's > pointless since 'MPLConstant' varies and so may the whole type expression. > > So, if you insist on deducing the result type from the function object > (instead of having it specified explicitly) my vote is 'F::result_type', > however, I still find another template parameter more appropriate for > the following good reasons: > > o The function object can work fine with result_of in a non-'switch_' > context. The cases can return different things as long as they are > convertible to the result of 'switch_', and > > o there is no way to determine this type with 'result_of. > > The current implementation seems to use result_type - is it planned to change to use result_of? I agree that result_of<F()>::type is slightly abusive, since that's not what actually gets called. Would using result_of<F(boost::mpl::front<Cases>::type)> be an option for a non-empty case sequence? As long as the order of the cases doesn't matter (btw, does it?), the user could put the desired type in the front of the Cases sequence if the return type differs for different MPLConstant types. Stjepan

3 9

Which library my program linked?
by Lizheng 07 Jan '08

07 Jan '08

I download the precompiled static boost librarys from boost-consulting website,I found there is more than one "lib" files for a boost library,for example "regex" library,there exist below ".lib" files: - libboost_regex-vc80-mt-1_34_1.lib; - libboost_regex-vc80-mt-gd-1_34_1.lib; - libboost_regex-vc80-mt-s-1_34_1.lib; - libboost_regex-vc80-mt-sgd-1_34_1.lib; - libboost_regex-vc80-s-1_34_1.lib; - libboost_regex-vc80-sgd-1_34_1.lib; so what is the function of the files?I most use VC8 and MFC to write my program,so which ".lib" file my program linked?If I want my program to link with a boost dll library,how can I do?

3 2

thread strange
by Chameleon 07 Jan '08

07 Jan '08

I have a strange problem with the code below. >From outside the function operator()(), I can have the pointer to thread object 'thread'. >From inside operator()() 'thread' is always 0. Why does this happen? ------------------------------------------------------------------ #include <cstdio> #include <boost/thread/thread.hpp> class A { boost::thread *thread; public: A() : thread(0) {} ~A() { join(); } void createThread() { thread = new boost::thread(*this); } void operator()() { printf("Starting thread with pointer: %d\n", thread); //<<<<<<<<<<<<<<HERE! delete thread; thread = 0; } void join() { if (thread) thread->join(); } }; int main(int, char**) { A a; a.createThread(); a.join(); return 0; } ------------------------------------------------------------------

2 1

MSVC2005/icc10.1 boost::date_time std::max 1.34.1
by Hicham Mouline 07 Jan '08

07 Jan '08

hello, #include <iostream> #include <algorithm> int main() { const double d = std::max(5.0, 6.0); return 0; } This works fine. <algorithm> is supposed to be included to use the max algorithm. <algorithm> comes with VisualC++ headers, which intel uses. The strange thing is that when adding #include <boost/date_time/posix_time/posix_time.hpp> before or after <algorithm> #include <iostream> #include <algorithm> #include <boost/date_time/posix_time/posix_time.hpp> int main() { const double d = std::max(5.0, 6.0); return 0; } 1>.\main.cpp(9): error: expected an identifier 1> const double d = std::max(5.0, 6.0); 1> ^ 1> 1>.\main.cpp(9): error: expected an identifier 1> const double d = std::max(5.0, 6.0); Inclusing of that header seems somehow to damage "max". Gcc4.1/boost doesn't have this problem. any ideas, rds,

3 2

[log] Boost Logging v2 - new version (v0.13.6)
by John Torjo 07 Jan '08

07 Jan '08

Boost Logging v2 - new version (v0.13.6) The Boost Logging Lib v2 is getting closer and closer to its review (Feb 4). I've just released a new version, lots of new features: * added tags (attributes a logged message can have, like : line & file, function name, time, etc.) * scoped logs * caching messages before logs are initialized * high precision time (as tag as well) * added spacer formatter - you can specify what goes before and after your formatter * new formatter: named_spacer : Allows you to contain multiple formatters. You have a spacer string, and within it, you can escape your contained formatters * new destination : named - like named_spacer, but for destinations All in all, I've added quite a few features - so, take a look! Look forward to your feedback! http://www.torjo.com/log2/ http://torjo.blogspot.com/2008/01/boost-logging-v2-new-version-v0136.html Best, John -- http://John.Torjo.com -- C++ expert ... call me only if you want things done right

1 0

TestUnit - builing hierarchical tests
by Tomasz Kalkosiński 07 Jan '08

07 Jan '08

Hello group. I want to use Boost.UnitTest library for my code testing. I went thru examples and I've found it useful and easy. It's easy on simple one-method one-file examples. My problem begun when I wanted to build few hierarchical test suites splitted into directories and files. I failed. There is no example on boost page - how to write them splitted in a few files. Only cases are pointers to functions in one file. I had problems including unit test header - I had multiple definitions of boost classes. When i removed header - there were no macros etc. Can anyone share a good practice - how to wrap example1 and example2 to one mainsuite? And use 3 files for it? Examples from tutorial: http://www.pdc.kth.se/training/Talks/C++/boost/libs/test/doc/components/uni… On a side note I find myself disappointed with Boost.UnitTest documentation. It isn't easy to follow (like I did for example with Boost.Regex) . Links to examples are broken on main site : http://www.boost.org/libs/test/doc/components/utf/index.html. But there's a mirror on http://www.pdc.kth.se/training/Talks/C++/boost/libs/test/doc/components/uni…. That's nice, but their latest revision is more than 4 years old! But when you google enough you find another one - author's own - on http://www.patmedia.net/~rogeeff/html/ revised 2007 (at least copyright is 2007). Is it the way Boost library documentation is meant to be? On a second side note I had no "main ()" function problem on debian. There were changes on 1.34.0 so it won't work anymore as documentation says. So I had to dig thru bug reports, mailing lists to find out author's personal note on these changes. As a library user I don't want to waste time googling, I want to use documentation and get it working. I belive Boost.UnitTest is a good work so don't waste it on a poor support! Greetings, Tomasz Kalkosiński

3 7

statechart null in_state_reaction
by Sean Kelly 06 Jan '08

06 Jan '08

Hello, I would like to implement a null-op in_state_reaction - The in_state_reaction template requires a action argument whereas the transition to self doesn't - Which is the preferred method ? Thanks Sean

2 2

Program_options - allowing unknown options in configuration file
by Raul Pedro Santos 06 Jan '08

06 Jan '08

Hi everyone. I'm new to Boost and program_options in particular but so far it has been a joy working with the various boost libraries. Thanks to all the developers for their hard work! I'm using program_options to parse a configuration file but I need to have some options that are not described with program_options. Specifically, I need to use the same file for both my program configuration and also for configuring log4cxx. Each line of log4cxx configuration is of the form "log4j.option=value" and I can't limit the options that can be added to the program, so I can't describe them and ignore them afterwards. I know this is possible on the command line, by calling allow_unregistered() but I need the same thing for a config file, which I can't find out how to do anywhere. Can someone point me in the right direction, please? Thanks in advance. Raul PS - Happy New Year, everyone! :-) ____________________________________________________________________________________ Looking for last minute shopping deals? Find them fast with Yahoo! Search. http://tools.search.yahoo.com/newsearch/category.php?category=shopping

3 2

Re: [Boost-users] cannot build the regex example in visual c++ 2008
by David Randolph Palmer 06 Jan '08

06 Jan '08

I too am having a similar problem, here is my output; c:\Program Files\boost\boost_1_34_1>bjam --with-regex stage msvc-9.0 c:/Program Files/boost/boost_1_34_1/tools/build/v2/tools\msvc.jam:270: in config ure-really *** argument error * rule path.make ( native ) * called with: ( ) * missing argument native c:/Program Files/boost/boost_1_34_1/tools/build/v2/util\path.jam:46:see definiti on of rule 'make' being called c:/Program Files/boost/boost_1_34_1/tools/build/v2/tools\msvc.jam:145: in config ure c:/Program Files/boost/boost_1_34_1/tools/build/v2/tools\msvc.jam:116: in msvc.i nit c:/Program Files/boost/boost_1_34_1/tools/build/v2/build\toolset.jam:27: in usin g C:\Users\dad\user-config.jam:30: in modules.load c:/Program Files/boost/boost_1_34_1/tools/build/v2\build-system.jam:95: in load- config c:/Program Files/boost/boost_1_34_1/tools/build/v2\build-system.jam:143: in load c:\Program Files\boost\boost_1_34_1\tools\build\v2/kernel\modules.jam:261: in im port c:\Program Files\boost\boost_1_34_1\tools\build\v2/kernel/bootstrap.jam:132: in boost-build c:\Program Files\boost\boost_1_34_1\boost-build.jam:9: in module scope I read through msvc.jam and there is no reference to v9. It appears to default and the default settings don't work. I am also using the express edition of v9. Any help appreciated! chris briscoe wrote: > > Hi, whitespace was an issue - thanks. > > using this command: bjam --with-regex stage msvc-9.0 didn't work, > produced > a lot of output > then appeared to skip everything for lack of stage\lib. > > I tried this from the boost root > > C:\Program Files\boost\boost_1_34_1> bjam ^ > More? --build-dir=C:\temp\build-boost ^ > More? --toolset=msvc-9.0 stage > > this ground away for an age producing reams of output and finished with > the > result attached. > > Still don't seem to be there. > > > Thanks > Chris > > ----- Original Message ----- > From: "John Maddock" <john(a)johnmaddock.co.uk> > To: <boost-users(a)lists.boost.org> > Sent: Friday, January 04, 2008 7:24 PM > Subject: Re: [Boost-users] cannot build the regex example in visual c++ > 2008 > > >> chris briscoe wrote: >>> Hi, >>> thanks very much for responding. >>> I have followed your instructions but so far can't get it to work. >>> >>> running bjam as below gives a message: >>> msvc:9.0:C:/microsoft..../bin/cl.exe.jam: Invalid argument >>> and : >>> rule msvc:9.0:c:/micro..../cl.exe.init unknown in module toolset >>> then appears to drop through with a number of in (various modules) >>> messages. >>> >>> Would greatly appreciate your help. >> >> Please post the complete error messages, plus your user-config.jam >> changes, >> otherwise it's hard to say. However... at a guess it appears that there >> isn't any whitespace between the arguments in your user-config.jam. >> Unfortunately bjam insists on whitespace around separators like ":" so: >> >> using msvc :9.0:path-to-cl; >> >> will *not* work, but: >> >> using msvc : 9.0 : path-to-cl ; >> >> will. >> >> HTH, John. >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users >> > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > -- View this message in context: http://www.nabble.com/cannot-build-the-regex-example-in-visual-c%2B%2B-2008… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

cannot build the regex example in visual c++ 2008
by chris briscoe 06 Jan '08

06 Jan '08

Hello- absolute beginner here. I have the latest (November version) of visual studio c++ 2008 express. The header only version compiled fine. However the regex example fails with many unresolved external symbols. Do I need to build the libraries for this compiler? Or am I making some other booboo. I have had a go - following the instructions but so far without success. Grateful for any help. Chris Briscoe

2 5

Re: [Boost-users] upcoming Switch library review Jan 5th - Jan 9th
by dan marsden 06 Jan '08

06 Jan '08

Stjepan Rajko wrote: > If you are interested, please consider submitting a review of this > library. I will send more detailed instructions on what to include in > the review on the 5th. Can I jump the gun with with a few questions please? Why is the fall through behaviour to throw an exception? This is not consistent with standard switch, possibly a motivation section is needed in the docs to explain this type of decision? I'm not too clear with the documentation what the parameter 'n' can be? It is of type 'Int' which is described as being an Integer in the parameters section of the documentation. What does this mean, any built in integral type, can I switch on a std::string? What are the limitations? I got a bit lost here in the docs here, after admittedly only a quick read. Maybe just some clarification is required? The parameter section does not specify the arities of the 2 function object parameters, I had to deduce them from the example. Why do these have to be function objects, and not just any callable type, including ordinary functions (using the Boost.ResultOf mechanism to sort out the return type)? I'm not sure how useful that would be for 'f', but for 'default_' a full blow function object seems a bit much typing, can't I just use a function. Also, why is 'default_' unary, the default in a standard switch statement does not access the switch parameter, and the example does not exploit this feature either. Why not just a nullary function? Again some motivation might be nice. And finally, as the introduction mentions the efficiency of the standard switch statement, could the docs show some performance stats for the library code for comparison? Cheers Dan ___________________________________________________________ Yahoo! Answers - Got a question? Someone out there knows the answer. Try it now. http://uk.answers.yahoo.com/

4 4

Switch library review begins today and ends on Jan 9th
by Stjepan Rajko 05 Jan '08

05 Jan '08

The review of the Switch library by Steven Watanabe begins today. Description: The built in C/C++ switch statement is very efficient. Unfortunately, unlike a chained if/else construct there is no easy way to use it when the number of cases depends on a template parameter. The Switch library addresses this issue. You can download the library from the Boost Vault: http://tinyurl.com/23qn7w For convenience, the docs have been uploaded here: http://tinyurl.com/2h6ut9 ... and the source file here: http://tinyurl.com/2cbfyk What to include in Review Comments Your comments may be brief or lengthy, but basically the Review Manager needs your evaluation of the library. If you identify problems along the way, please note if they are minor, serious, or showstoppers. Here are some questions you might want to answer in your review: * What is your evaluation of the design? * What is your evaluation of the implementation? * What is your evaluation of the documentation? * What is your evaluation of the potential usefulness of the library? * Did you try to use the library? With what compiler? Did you have any problems? * How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? * Are you knowledgeable about the problem domain? And finally, every review should answer this question: * Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Thanks to Dan Marsden, Larry Evans, Tobias Schwinger, and Alexander Nasonov for already opening up the discussion in the following threads: http://tinyurl.com/2u6fjr [nabble/boost-user] http://tinyurl.com/267uj3 [nabble/boost-dev] Thank you for taking the time to look into this library, and I hope that some of you will be able to provide a full review for it. Regards, Stjepan

1 0