- Boost - lists.preview.boost.org

[Serialization] (and [TypeTraits]?) Overloaded new operator are not called from serialization
by Runar Undheim 20 Nov '08

20 Nov '08

Could someone help to update the serialization code in boost to call the overloaded new operator, please? There already exist some code, but the code is not active because of a #if 0 statement. And if I set the code to #if 1 the code is not compiling with Visual C++ 2005. So I have updated the heap_allocator implementation in archive\detail\iserializer.hpp to support overload of new operator, but I'm not sure if it will work on all compilers. I have just tested the code with Visual C++ 2005. First the code that I used to check if the new operator is overloaded. If there are compilers that don't support the code, the implementation could be updated using defines and only return false. This way we take advantage of the information on supported compilers, an the code will work as before on unsupported compilers. Should the code that check if it has a new operator be part of the Type Traits library? typedef char True; // sizeof(True) == 1 typedef struct { char a[2]; } False; // sizeof(False) > 1 template <class U, U x> struct test; template <typename C> const True *hasNewOperator(C*, test<void *(*)(size_t),&C::operator new>* = NULL) { // Function must be implemented on Visual C++ 2005 to prevent linking error return NULL; } template <typename R> const False *hasNewOperator(...) { // Function must be implemented on Visual C++ 2005 to prevent linking error return NULL; } //#define hasNewOperator(f) (sizeof(*hasNewOperator<f>(static_cast<f*>(NULL))) == sizeof(True)) Then the heap_allocator is updated to use the hasNewOperator: template<class T> struct heap_allocator { template<class U> static T* new_operator(U); static T* new_operator(const True*) { return static_cast<T *>((T::operator new)(sizeof(T))); } static T* new_operator(const False*) { return static_cast<T *>(operator new(sizeof(T))); } static T * invoke(){ return new_operator(hasNewOperator<T>(static_cast<T *>(NULL))); } }; regards, Runar

2 2

Boost and Borland C++ Compiler 5.5
by Marcin Kurek 20 Nov '08

20 Nov '08

Hello everybody, I faced a problem when upgrading a piece of software originally written using Borland C++ Builder 5. Because there are some configuration files I need to parse I thought it might be a good idea to use Boost Regex. However, I've encountered many errors when I tried to build it. I've downloaded 1.37.0 release and followed instructions in "Getting started on Windows": E:\boost_1_37_0\bjam.exe --build-dir E:\boost-build --toolset=borland As result I get multiple errors: "bcc32.exe" -j5 -g255 -q -c -P -Ve -Vx -a8 -b- -O2 -tWC -tWR -tWC -WM- -DBOOST_ALL_NO_LIB=1 -DNDEBUG -I"." -I"C:\Program Files\Borland\CBuilder5/include/" build\borland\release\link-static\copysignf.obj" "libs\math\build\..\src\tr1\copysignf.cpp" ...failed borland.compile.c++ e:\boost-build\boost\bin.v2\libs\math\build\borland\release\link-static\copysignf.obj... borland.compile.c++ e:\boost-build\boost\bin.v2\libs\math\build\borland\release\link-static\erfcf.obj libs\math\build\..\src\tr1\erfcf.cpp: Error E2176 .\boost/math/tr1.hpp 179: Too many types in declaration Error E2176 .\boost/math/tr1.hpp 180: Too many types in declaration Error E2176 .\boost/math/tr1.hpp 181: Too many types in declaration I've downloaded BCC 5.5.1 from Borland, but the effect was the same. I also was trying some older releases of Boost, including 1.32.0 and 1.33.1. E:\boost_1_33_1\bjam.exe -sTOOLS=borland install "bcc32" -j5 -g255 -q -c -P -w -Ve -Vx -a8 -b- -DNDEBUG -DNDEBUG -DBOOST_IOSTREAMS_DYN_LINK=1 -O2 -vi -w-inl -tWR -tWD -WM- -w-8001 -I"bin\boost\libs\iostreams\build" -I"E:\boost_1_33_1" -I"E:\bo ost_1_33_1" -o"bin\boost\libs\iostreams\build\boost_iostreams.dll\borland\release\mapped_file.obj" "E:\boost_1_33_1\libs\iostreams\build\..\src\mapped_file.cpp" (...) borland-C++-action bin\boost\libs\iostreams\build\boost_iostreams.dll\borland\release\threading-multi\mapped_file.obj E:\boost_1_33_1\libs\iostreams\build\..\src\mapped_file.cpp: Error E2401 E:\boost_1_33_1\boost/iostreams/detail/is_iterator_range.hpp 20: Invalid template argument list Error E2303 E:\boost_1_33_1\boost/iostreams/detail/is_iterator_range.hpp 20: Type name expected Error E2238 E:\boost_1_33_1\boost/range/iterator.hpp 102: Multiple declaration for 'range_iterator<char *>' Error E2344 E:\boost_1_33_1\boost/range/iterator.hpp 77: Earlier declaration of 'range_iterator<char *>' Error E2238 E:\boost_1_33_1\boost/range/iterator.hpp 108: Multiple declaration for 'range_iterator<wchar_t *>' Error E2228 E:\boost_1_33_1\boost/range/iterator.hpp 108: Too many error or warning messages I don't have an idea what's wrong. I was googling a lot, but after 6 hours I guess I'll give up for today. Maybe there's something obvious I don't see, could anybody point me in the right direction, please? Thanks a lot, Marcin

2 1

limit symbol names of fusion::vector
by Christian Holmquist 19 Nov '08

19 Nov '08

Hi, I'm using fusion::result_of::as_vector<some_mpl_transform_view>::type quite frequently, but having troubles with extremely long type names (our vc8.pdb are close to 0.5 Gb). Is there any way in fusion like in mpl, where one can do mpl::vector<a, b, c>::type ^^ which gives the shorter name mpl::vector3<a, b, c> instead of mpl::vector<a, b, c, na, na, na, ...> In essence, can I have fusion::vector2<int, float> from the following: fusion::result_of::as_vector<mpl::vector<int, float>::type >::type Thanks for a great lib! / Christian

3 6

BOOST_FOREACH slow?
by Hansi 19 Nov '08

19 Nov '08

Hello, I have made a few tests with the performance of BOOST_FOREACH. The results are for me unexpected slow...may be one has an idea if I make something wrong... vector[int]: index:0.00167619 vector[int]: iterator:0.00167619 vector[int]: BOOST_FOREACH:9.40036 list[int]: iterator:239.669 list[int]: BOOST_FOREACH:233.219 vector[TestData]: index:0.00167619 vector[TestData]: iterator:0.00167619 vector[TestData]: BOOST_FOREACH:9.40008 list[TestData]: iterator:233.827 list[TestData]: BOOST_FOREACH:238.513 testArray[int]: index:0.00167619 testArray[int]: BOOST_FOREACH:9.40008 Best regards Hansjörg the test program was: // ForEach.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include "..\include\PerformanceCounter.h" #include <vector> #include <boost\foreach.hpp> #include <iostream> #include <list> using namespace std; using namespace Microtec; class TestData { public: TestData(int val1, int val2, int val3):var1(val1),var2(val2),var3(val3){} int var1; int var2; int var3; }; int testArray[10000000]; int _tmain(int argc, _TCHAR* argv[]) { vector<int> data; list<int> lstData; vector<TestData> vectorTestData; list<TestData> lstTestData; for(int i = 0; i < 10000000;i++) { data.push_back(i); lstData.push_back(i); vectorTestData.push_back(TestData(i,i,i)); lstTestData.push_back(TestData(i,i,i)); } int res = 0; const int actSize = (int)data.size(); for(int i = 0; i < actSize; i++) { res += data[i]; } //takes 0.0017 ms res = 0; for(vector<int>::iterator it = data.begin(); it != data.end(); it++) { res += *it; } //takes 0.0017 ms res = 0; BOOST_FOREACH(int val,data) { res += val; } //takes 9.400 ms //list res = 0; for(list<int>::iterator it = lstData.begin(); it != lstData.end(); it++) { res += *it; } //takes 239.669 ms res = 0; BOOST_FOREACH(int val,lstData) { res += val; } //takes 233.219 ms //vector TestData for(int i = 0; i < actSize; i++) { res += vectorTestData[i].var1; } //takes 0.0017 ms res = 0; for(vector<TestData>::iterator it = vectorTestData.begin(); it != vectorTestData.end(); it++) { res += it->var1; } //takes 0.0017 ms res = 0; BOOST_FOREACH(TestData& val,vectorTestData) { res += val.var1; } //takes 9.400 ms //list res = 0; for(list<TestData>::iterator it = lstTestData.begin(); it != lstTestData.end(); it++) { res += it->var1; } //takes 233.827 ms res = 0; BOOST_FOREACH(TestData& val,lstTestData) { res += val.var1; } //takes 238.827 ms for(int i = 0; i < actSize; i++) { res += testArray[i]; } //takes 0.0017 ms res = 0; BOOST_FOREACH(int val,testArray) { res += val; } //takes 9.400 ms return 0; }

9 25

[asio] Removing gcc warning
by Richard Smith 19 Nov '08

19 Nov '08

The function boost::asio::detail::pipe_select_interrupter::interupt() in <boost/asio/detail/pipe_select_interrupter.hpp> produces the following warning in gcc 4.3.2 / glibc 2.8 when compiled with -O1 or higher. The warning occurs even without any -W options. ./boost/asio/detail/pipe_select_interrupter.hpp:75: warning: ignoring return value of ‘ssize_t write(int, const void*, size_t)’, declared with attribute warn_unused_result As the message implies, gcc issues this warning whenever a function declared with __attribute__((warn_unused_result)); it appears that gcc implicitly places this attribute on ::write as the glibc header doesn't contain it. A short test case is: #include <unistd.h> int main() { ::write(1, 0, 0); } To suppress the warning, the function interupt() function can be altered as follows: #include <boost/concept_check.hpp> void interrupt() { char byte = 0; ignore_unused_variable_warning( ::write(write_descriptor_, &byte, 1) ); } Is there any chance of making a change along these lines? Apologies if this is a know issue: a quick search of the mailing list didn't turn anything up. -- Richard Smith

1 0

Boost.Build causing failures on the release branch (and Trunk too)
by John Maddock 19 Nov '08

19 Nov '08

There seem to be a lot of failures on the release branch caused by some libraries not being found, so for example on acc: http://tinyurl.com/6r76o5 or on Darwin: http://tinyurl.com/6dyezn The library not being found is part of the project requirements BTW in case that helps, Regards, John.

1 1

[signals2][review] The review of the signals2 library (formerly thread_safe_signals) begins today, Nov 1st
by Stjepan Rajko 19 Nov '08

19 Nov '08

Hello all, The review for the Signals2 library (formerly known as thread_safe_signals) submitted by Frank Mori Hess begins today (Nov 1st) and is scheduled to end on Nov 10th. I would like to thank Franz Alt, Terry Golubiewski, Doug Gregor, Ravikiran Rajagopal and Andrew Webber for making this review possible by committing to reviewing the library. How to submit a review: -------- As usual, EVERYONE is welcome to participate in the review discussions and to submit a review. I strongly encourage participation from reviewers that would examine the library from a purely user standpoint (commenting on the interface and / or the documentation), as well as reviewers that would be willing to look into the details of the implementation (i.e., you don't have to focus on both). Here are some questions you might want to answer in your review (feel free to skip those that don't apply to your analysis): * 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. Please submit your review either to the list or privately to me by the end of the review period. If you send me a review privately I will forward it to the list so the review can be discussed. If you would prefer me to forward your review anonymously (with your name removed) please indicate that in your e-mail. If you are a first time reviewer, here is some more information to get you started: * http://www.boost.org/community/reviews.html has more information on the review process * the review officially takes place on both the boost dev and boost-user lists, but typically more of the discussion happens on the boost dev list * if you want to get a feel for past reviews, you can find them in the archives (see http://www.boost.org/community/groups.html) - the past review dates are on the review schedule (http://www.boost.org/community/review_schedule.html) Typically, there is a period of discussion between the reviewers and the author, with official reviews coming in towards the tail end of the review period. About the library: -------- * The library can be downloaded from: http://www.boostpro.com/vault/index.php?&directory=thread_safe_signals (latest version is signals2-2008-10-08.zip) * Documentation is also available online: http://www.comedi.org/projects/signals2/libs/signals2/doc/html/index.html * A synopsis: The Boost.Signals2 library (formerly known as thread_safe_signals) is an implementation of a managed signals and slots system. Signals represent callbacks with multiple targets, and are also called publishers or events in similar systems. Signals are connected to some set of slots, which are callback receivers (also called event targets or subscribers), which are called when the signal is "emitted." Signals and slots are managed, in that signals and slots (or, more properly, objects that occur as part of the slots) can track connections and are capable of automatically disconnecting signal/slot connections when either is destroyed. This enables the user to make signal/slot connections without expending a great effort to manage the lifetimes of those connections with regard to the lifetimes of all objects involved. When signals are connected to multiple slots, there is a question regarding the relationship between the return values of the slots and the return value of the signals. Boost.Signals2 allows the user to specify the manner in which multiple return values are combined. * Relationship to Boost.Signals: This is a thread-safe variant of the original Boost.Signals library. There have been some changes to the interface to support thread-safety, mostly with respect to automatic connection management. The following thread offers some more details on the differences between the two implementations, as well as a plan of a phased replacement of Boost.Signals should Signals2 be accepted: http://tinyurl.com/4sqau3 [nabble] The Signals2 FAQ also covers some differences: http://tinyurl.com/576gl6 Kind regards, Stjepan (review manager)

7 15

task_array<n> and variadic templates
by vicente.botet 19 Nov '08

19 Nov '08

Hi, I want to create an static task_array<n> which must be initiaized with n functors. In pseudo code: template <std::size N> struct task_array { template <typename F_1, ..., typename F_N> task_array(F_1 f1, ..., F_N fN); }; My current implementation with N=1..3 is like that template <std::size N> struct task_array; template <> struct task_array<1>; { template <typename F_1,> task_array(F_1 f1); }; template <> struct task_array<2>; { template <typename F_1, typename F_2> task_array(F_1 f1, F_2 f2); }; template <> struct task_array<3>; { template <typename F_1, typename F_2, typename F_3> task_array(F_1 f1, F_2 f2, F_3 f3); }; I can use the Boost.Preprocessor library to generate this up to a maximum know at compile time, but can I define this class with the help of variadic templates? If yes how? Thanks in advance, Vicente

3 6

[alchemy] Boost on Adobe Alchemy
by Wilhansen Li 19 Nov '08

19 Nov '08

Hi guys, Adobe Labs just released their Alchemy ( http://labs.adobe.com/technologies/alchemy/) C/C++ to AVM2 compiler which basically compiles C/C++ code to .swf or .swc which can then be imported to Flash or Flex. I'm gonna try it out when I find some time next week. In any case, I'm interested in making Boost work in Alchemy but have no idea where to get started (aside from copy-pasting the generated header files for gcc for the header-only libraries). Is there anybody else interested in porting Boost over to Alchemy? Best Regards, Wil --

1 0

subbitset
by Andreas Klein 19 Nov '08

19 Nov '08

Hello. I am using your dynamic_bitset and I encountered the following problem. I have realy large bits sets (>100000) bits. At some point I need do some xor Operations on only a small fraction of the bits. So I need a way to access the bits from index n to n+s-1. The bitclass has no convient way to do this. I suggest add the member function sub_bitset for that purpose. Example: a = 100000101101101001110101 ^^^^^^^ a.subbitset(3,7) b = 1001110 (The ^^^^^^^ marks the position of b in a). I implemented subbitset as follows: template<typename B, typename A> dynamic_bitset<B, A> dynamic_bitset<B, A>::subbitset(size_type n,size_type s) const { assert(n+s < size()); dynamic_bitset res(s); size_type const last = res.num_blocks() - 1; // num_blocks() is >= 1 size_type const last2 = num_blocks() - 1; size_type const div = n / bits_per_block; // div is <= last block_width_type const r = bit_index(n); const block_type * const b = &m_bits[0]; block_type * const bb = &res.m_bits[0]; if (r != 0) { block_width_type const ls = bits_per_block - r; for (size_type i = 0; i <= last; ++i) { if (div+i+1 >last2) { // Do we reach the last block? bb[i] = (b[div+i] >> r); break; } bb[i] = (b[div+i] >> r) | (b[div+i+1] << ls); } } else { for (size_type i = 0; i <= last; ++i) { if (i+div>last2) // Do we reach the last block? break; bb[i] = b[i+div]; } // note the '<=': the last iteration 'absorbs' // b[last-div] = b[last] >> 0; } // Zero unused bits block_width_type const rr = bit_index(s); if(rr != 0) bb[last] &= (1<<(block_type)(rr))-1; return res; } I guess, that I am not the only one who would benefit from the possibility to access subbitsets. I could also imagine that references to subbitsets could be of some use. Foe example I could imagine that one would use subbitset as follows. a= 00000000 b= 111 a.subbit(2,3) ^= b; -> a=00011100 But such a reference would be harder to implement and at the moment I do not need it. What do you think? Is there any hope for subbitset in boost? Best wishes Andreas Klein.

1 0

which Operating Systems should be supported?
by Oliver Kowalke 19 Nov '08

19 Nov '08

Hello, I'd like to know which operating systems should be take into account if a new library gets contributed? Should only the newest version of the os be considered (I think not - at least on Windows). - Windows - Linux (kernel version + glibc version) - xBSD (FreeBSD, NetBSD, OpenBSD, DragonFly, .... MAC OS?) - HP/UX - Solaris, OpenSolaris (is there a difference beside the second is open source?) - AIX - what about this systems (maybe no futher activly developed): - IRIX - Tru64 special purpose os: - QNX regards, Oliver -- Der GMX SmartSurfer hilft bis zu 70% Ihrer Onlinekosten zu sparen! Ideal für Modem und ISDN: http://www.gmx.net/de/go/smartsurfer

6 6

boost and vendor's TR1 implementations
by Sergey Sadovnikov 19 Nov '08

19 Nov '08

Hello All, Today there is at least two implementations of TR1 library extensions shipped with compilers. I mean VS 2008 SP1 and gcc 4.3.x STL. Because of boost has it's own implementation of TR1 there is some problems with migrating code to this compilers. For example: 1. There is many ambiguous names if both boost and std::tr1 exposed into global namespace. 2. boost::transform_iterator knows nothing about std::tr1::bind shipped with VS2008 compiler. I think what first problem is very serious. I sure what there is a lot of code what exposed 'boost' namespace into global scope. Some of boost test cases has such directives (tests for 'function', 'tokenizer', 'string algo' libraries for example). When developers will start to expose 'std::tr1' namespace into global scope they will be encountered many problems with compilation. I think what it will be good idea to hide boost implementation of TR1 classes when this classes shipped with compiler. For example: //... #ifdef _HAS_TR1 #include <memory> namespace boost { using std::tr1::shared_ptr; //... other usings } #else // rest of the shared_ptr.hpp #endif -- Best Regards, Sergey mailto:flex_ferrum@artberg.ru

6 20

namespace noncopyable_
by Kenneth Laskoski 19 Nov '08

19 Nov '08

Why is this nested namespace noncopyable_ necessary? The comment "// protection from unintended ADL" seems greek to me. Can someone please enlighten me and point out a practical consequence of simply defining "namespace boost { class noncopyable {...}; }" Thanks, Kenneth

2 1

[constrained_value] New version
by Robert Kawulak 19 Nov '08

19 Nov '08

Hi all, I've updated the Boost Constrained Value library (which is likely to be reviewed soon) -- the list of changes is below: - added unconstrained -- a new constrained alias to replace it in release mode if constraint-checking is not needed and efficiency is a concern, - added Examples section to the documentation, - other minor corrections and improvements in the documentation, - using BOOST_THROW_EXCEPTION instead of boost::throw_exception() (requires Boost version 1.37.0), - fixed one place to make a better use of EBO. As usually, the code and documentation can be downloaded here: http://rk.go.pl/f/constrained_value.zip The documentation is also available online here: http://rk.go.pl/r/constrained_value Best regards, Robert Kawulak -=##############=- "I know not with what weapons World War III will be fought, but World War IV will be fought with sticks and stones." - Albert Einstein

2 2

Boost C++ Libraries page meaning
by vicente.botet 18 Nov '08

18 Nov '08

Hi, What is the expected behavior of the Name First Release STD Proposal STD::TR1 Header Only Use Automatic Linking Key in the page http://www.boost.org/doc/libs/? Thanks, Vicente

4 7

[thread]when thread_resource_error is thrown?
by vicente.botet 18 Nov '08

18 Nov '08

Hi, the documentation states that the a lot of functions throwing in the Thread library throw thread_resource_error. I have do a grep on new allocation and I get Vicente@viboes1 ~/SVN/boost/thread $ grep -r "new " * detail/thread.hpp: std::auto_ptr<thread> new_thread(new thread(thread func)); pthread/thread_heap_alloc.hpp: return new T(); pthread/thread_heap_alloc.hpp: return new T(static_cast<A1&&>(a1)); pthread/thread_heap_alloc.hpp: return new T(static_cast<A1&&>(a1),sta tic_cast<A2&&>(a2)); pthread/thread_heap_alloc.hpp: return new T(static_cast<A1&&>(a1),sta tic_cast<A2&&>(a2), pthread/thread_heap_alloc.hpp: return new T(static_cast<A1&&>(a1),sta tic_cast<A2&&>(a2), pthread/thread_heap_alloc.hpp: return new T(a1); pthread/thread_heap_alloc.hpp: return new T(a1,a2); pthread/thread_heap_alloc.hpp: return new T(a1,a2,a3); pthread/thread_heap_alloc.hpp: return new T(a1,a2,a3,a4); thread_specific_shared_ptr.hpp:// We don't need any more a new class thread that inherits from boost::thread, thread_specific_shared_ptr.hpp: tss_ptr = new tss_type(* this); win32/condition_variable.hpp: entry_ptr new_entry(new list_en try(wake_sem)); win32/thread_heap_alloc.hpp: T* const data=new (heap_memory) T(); win32/thread_heap_alloc.hpp: T* const data=new (heap_memory) T(st atic_cast<A1&&>(a1)); win32/thread_heap_alloc.hpp: T* const data=new (heap_memory) T(st atic_cast<A1&&>(a1),static_cast<A2&&>(a2)); win32/thread_heap_alloc.hpp: T* const data=new (heap_memory) T(st atic_cast<A1&&>(a1),static_cast<A2&&>(a2), win32/thread_heap_alloc.hpp: T* const data=new (heap_memory) T(st atic_cast<A1&&>(a1),static_cast<A2&&>(a2), win32/thread_heap_alloc.hpp: T* const data=new (heap_memory) T(a1 ); win32/thread_heap_alloc.hpp: T* const data=new (heap_memory) T(a1 ,a2); win32/thread_heap_alloc.hpp: T* const data=new (heap_memory) T(a1 ,a2,a3); win32/thread_heap_alloc.hpp: T* const data=new (heap_memory) T(a1 ,a2,a3,a4); Where the std::bad_alloc exception is catched? Vicente

1 0

[proto] [ was Re: [spirit2] Trivial parser crashes ]
by Joel de Guzman 18 Nov '08

18 Nov '08

Joel de Guzman wrote: > Joel de Guzman wrote: >> sm4 wrote: >>> Oops - seems formatting got in the way. >>> >>> Hope this is better: >> >> Ooops, I missed your reply. Its better to post spirit >> related questions to spirit's mailing list. I'm re-posting >> this there. > > Ok, this looks like a bug in handling aliases of the form: > > r1 %= r2; > > where r1 and r2 are rules with the same type. A quick > workaround is to copy the rhs rule: > > r1 %= r2.copy(); Eric, It seems to be a problem with Spirit2's usage of proto extends. Here's what's happening: 1) Rule uses proto::extends 2) Rule implements operator %= On expressions: r %= some-expression; The rule's operator%= kicks in. However, on expressions: r %= r2; // r and r2 has the same type Then proto %= kicks in leaving it as a no-op. Nothing happens. Hence, the rhs is never "auto-assigned" to the lhs. I'm not sure how to deal with this. Do you have a hint? I place the original test code here. Tracing the code, the first %= works as expected while the second and third becomes no-ops calling proto operator %=. > ----------------------------------------------------------------------------------------- > #include <boost/config/warning_disable.hpp> > #include <boost/spirit/include/qi.hpp> > #include <boost/spirit/include/phoenix_core.hpp> > #include <boost/spirit/include/phoenix_operator.hpp> > #include <boost/spirit/include/phoenix_fusion.hpp> > #include <boost/fusion/include/adapt_struct.hpp> > #include <boost/fusion/include/adapt_struct.hpp> > > #include <iostream> > #include <string> > > using namespace boost::spirit; > using namespace boost::spirit::qi; > using namespace boost::spirit::ascii; > using namespace boost::spirit::arg_names; > > namespace phoenix = boost::phoenix; > > using phoenix::at_c; > > struct key_val > { > std::string key; > std::string value; > }; > > BOOST_FUSION_ADAPT_STRUCT( > key_val, > (std::string, key) > (std::string, value) > ) > > > template <typename Iterator> > struct my_grammar : grammar<Iterator, key_val(), space_type> > { > my_grammar() : my_grammar::base_type(start) > { > quoted_string %= lexeme['"' >> +(char_ - '"') >> '"']; > key %= quoted_string; > value %= quoted_string; > > start = > key [at_c<0>(_val) = _1] > >> ':' > >> value [at_c<1>(_val) = _1] > ; > } > > rule<Iterator, std::string(), space_type> key; > rule<Iterator, std::string(), space_type> quoted_string; > rule<Iterator, std::string(), space_type> value; > > rule<Iterator, key_val(), space_type> start; > > }; > > int main() > { > typedef std::string::const_iterator citerator; > std::string str = "\"x\": \"25\" "; > > citerator iter = str.begin(); > citerator end = str.end(); > > my_grammar<citerator> my_parser; > key_val kv; > phrase_parse(iter, end, my_parser, kv, space); // ASSERTs > > return 0; > } > ----------------------------------------------------------------------------------------- Regards, -- Joel de Guzman http://www.boostpro.com http://spirit.sf.net

3 2

[thread] thread pining (processor affinity)
by k-oli＠gmx.de 18 Nov '08

18 Nov '08

Hello Anthony, are you interessted in a function boost::this_thread::pin_to_processor( int)? I can provide code for Windows, LINUX, HP/UX , Solaris, IRIX, AIX (xBSD seams not to offer this functionality - FreeBSD 7.1 will add processor affinity). best regards, Oliver

3 3

[thread?] code for binding/unbinding current thread to a processor
by k-oli＠gmx.de 18 Nov '08

18 Nov '08

Hello, I've uploaded code to boost vault which allows to bind/unbind current thread to a processor. boost::this_thread::bind_to_processor( unsigned int n); // thread gets bound to processor n boost::this_thread::bind_to_any_processor(); // thread can be scheduled to all available processors platforms: Windows, Linux, Solaris, HP/UX, AIX, IRIX best regards, Oliver -- Der GMX SmartSurfer hilft bis zu 70% Ihrer Onlinekosten zu sparen! Ideal für Modem und ISDN: http://www.gmx.net/de/go/smartsurfer

1 0

How do I change template-depth for the qcc toolset so that the accumulator tests pass
by Niklas Angare 18 Nov '08

18 Nov '08

The accumulators/test/weighted_tail_variate_means test fails with "template instantiation depth exceeds maximum of 100" with the qcc toolset. I've tried to increase the depth by editing tools/build/v2/tools/qcc.jam so that it's like gcc.jam which has a default depth of 128 but the compiler is still called with -Wc,-ftemplate-depth-100. How do I change the default depth? I've tried the attached patch which makes that section of the file equal to gcc.jam but it doesn't work. I also tried leaving the $(1) which I have no idea what it does but the result was the same. Regards Niklas Angare

2 3

BOOST_FOREACH not compiling with Multindex containers, Intel Compiler version 11
by lipik 17 Nov '08

17 Nov '08

Hi, I use boost.Multindex in my code, to simulate std::map. The code works fine on VC++ 2003 and Intel Compiler 10, but after upgrading to ICL 11 (latest), I can't use BOOST_FOREACH macros like so: BOOST_FOREACH (const parameters_map::value_type &pv, params) { } The compiler throws up the following error: .\interaction_request_handler.cpp(192): error: operand types are incompatible ("boost::foreach_detail_::rvalue_probe<const parameters_map>" and "const parameters_map") BOOST_FOREACH (const parameters_map::value_type &pv, params) { everything else compiles fine. I am guessing that some automatic conversion is not being triggered in this compiler. Any hints as to what I can try tweaking to get this to compile? Else I will just have to expand all FOREACH macros manually... I am using Boost 1.35, and would rather not be forced to upgrade just yet (since I also use built components, and I remember it was quite time-consuming, building the required components with Intel manually since bjam support for it is spotty). Thanks

2 2

[serialization] Warnings with MSVC 7.1
by Chard 17 Nov '08

17 Nov '08

I've been working on a cut-over of a code-base from Boost 1.34.1 to 1.37 and have found I now get a lot of compiler warnings in the serialization code. The warnings (emitted via BOOST_STATIC_WARNING) appear to be where non-polymorphic objects are serialized via shared_ptr. The boost serialization code seems to want them to be polymorphic. Are these benign warnings that can be disabled? Apologies if this has been raised earlier; I had a good look.. The following example code triggers the warnings (MSVC 7.1): ====== #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/serialization.hpp> #include <boost/serialization/shared_ptr.hpp> using namespace boost; struct X { template <typename T> void serialize(T &ar, const unsigned int version) {} }; typedef boost::shared_ptr<X> X_P; void test_ser() { X_P x_p; std::ifstream ifstr("test.txt"); boost::archive::text_iarchive ar(ifstr); ar & x_p; }

2 3

[threadpool] new version 16: pining of processors (processor affinity)
by k-oli＠gmx.de 17 Nov '08

17 Nov '08

Hello, I've uploaded a new version (16) to boost vault. In the new version as much worker-threads are created as boost::thread::hardware_concurrency() returns if no poolsize is specified in the pool constructor . Each worker-thread will be pined to one processor. Currentyl supported platforms for processor pining: Windows, Linux, HP/UX, AIX, IRIX, Solaris. regards, Oliver

4 4

gcc 3.6 compile for nios2
by Shlomo Kut-SM 16 Nov '08

16 Nov '08

Hi, I am trying cross compile boost for the nios2 processor. I am running into trouble when bjam generates the -pthread compiler option which is rejected by gcc for nios. I would like it to generate -D_REENTRANT instead. How can I do this? Here is what I am doing now: 1. cd boost_1_35_0 2. echo "using gcc : nios : nios2-linux-g++ ;"> tools/build/v2/user-config.jam 3. ../bjam clean 4. ../bjam -d2 --toolset=gcc-nios '-sBUILD=release static multi/single' link=static --prefix= --layout=system --with-thread --with-signals --with-filesystem install Please can you help? Shlomo Best Regards, Shlomo Kut eMail: shlomo_kut(a)softmodule.com Mobile: 972-54-771-8308

1 0

[iostreams] How to overload the flush on a outpou stream
by vicente.botet 16 Nov '08

16 Nov '08

Hi, I want to to take a specific action when I flush an output stream. Can Boost.Iostreams be of any use? Thanks is advanve, Vicente

1 0