- Boost-users - lists.boost.org

fatal error C1128: object file format limit exceeded : more than 65, 279 sections
by jono 02 Mar '08

02 Mar '08

hi, i've received this error compiling a project under visual studio 7.1. "fatal error C1128: object file format limit exceeded : more than 65,279 sections" the problem appeared when i added a couple more specializations to a 'binary operator' visitor for manipulating boost variant objects. before this, there were 20 or 30 similar specializations compiling without errors or warnings. the visitor and helpers are as follows: =========================== template<BinaryOp op, typename ObjectT, typename ObjectU> Object binary_op(const ObjectT &arg1, const ObjectU &arg2) { return undefined; } template<BinaryOp op, typename ObjectT> Object binary_op(const ObjectT &arg1) { return undefined; } template<BinaryOp op> class BinaryOpVisitor : public boost::static_visitor<Object> { public: template<typename ObjectT> Object operator()( const ObjectT &arg0) const; { return binary_op<op, ObjectT>(arg0); } template<typename ObjectT, typename ObjectU> Object operator()( const ObjectT &arg0, const ObjectU &arg1) const { return binary_op<op, ObjectT, ObjectU>(arg0, arg1); } }; ======================== and specialized: ======================== template<> INLINE Object binary_op<ADD>(const Integer& arg0, const Integer& arg1){return make<Integer>(arg0 + arg1);} .... .... .... .... etc etc ======================== the variant type looks like this.... ======================== typedef boost::make_recursive_variant< Nil ,Integer ,Real ,String ,Error ,Class ,Character ,Stream ,Boolean ,boost::recursive_wrapper< Symbol > ,boost::recursive_wrapper< Lambda > ,boost::recursive_wrapper< Function > ,boost::recursive_wrapper< Pair > >::type Atom; ======================== i imagine there are some combinatorial proliferations of template instantiation going on in the compiler. the operators were declared inline, but removing that didn't fix the error. i've restructured the source code in other ways, but without success so far. visual studio 8 has a compiler switch /bigobj to resolve this problem: "By default, an object file can hold up to 65,536 (2^16) addressable sections. /bigobj increases that address capacity to 4,294,967,296 (2^32)." i haven't tried compiling this project with g++ since making these changes (haven't checked them in) so i don't know what its limits are. does anyone has experience with solving this problem. is it a problem with my visitor class? is there a way i can break my recursive variant down for the compiler? cheers, Jono Poff

1 0

a difference of boost.function between g++4.13 and vc8
by 钱晓明 02 Mar '08

02 Mar '08

I wrote some code using boost.function. Compiling it both in g++4.13 and vc8, I find that I can not declare a struct in function with operator() and use boost.function to call it when I use g++. Just like this: int main() { struct int_div { float operator()(int x, int y) const { return ((float)x)/y; }; }; boost::function<float (int x, int y)> f = int_div(); std::cout << f(5, 3) << std::endl; return 0; } When I compile the code above in g++, it give me the error : 请求从 'main()::int_div' 转换到非标量类型 'boost::function<float ()(int, int), std::allocator<void> >'(I use ubuntu chinese.) but when I move the int_div definition outside of main(), It is ok! And the code above VC8 can compile it! why?

2 1

Re: [Boost-users] [boost] Serialization of Range library's sub_range
by brass goowy 02 Mar '08

02 Mar '08

Brian Wood writes: >Recently, I suggested there should be serialization support wrt >the Range library - >http://lists.boost.org/Archives/boost/2008/01/132294.php. >I'm writing to inform you of my plans in this regard. This input: > >Msgs > (sub_range<list<short> >) @OUT >} > >to the C++ Middleware Writer, http://home.seventy7.com/cgi-bin/samb.cgi, >results in this output: > >#include <boost/range/sub_range.hpp> >#include <list> >#include <Buffer.hh> >using boost::sub_range; > > >struct Msgs >{ >inline >Msgs() {} >inline >~Msgs() {} > >inline >int >Send(Buffer* buf, const sub_range<list<short> >& about1) >{ > unsigned int headCount = 0; > headCount = about1.size(); > if (!buf->Receive(&headCount, sizeof(int))) { > buf->ews_.SetErrorWords(1, __FILE__, __LINE__); > return 0; > } > list<short>::const_iterator rit1 = boost::begin(about1); > list<short>::const_iterator rit2 = boost::end(about1); > for (; rit1 != rit2; ++rit1) { > if (!buf->Receive(&(*rit1), sizeof(short))) { > buf->ews_.SetErrorWords(1, __FILE__, __LINE__); > return 0; > } > } > > if (!buf->SendStoredData()) { > buf->ews_.SetErrorWords(2, __FILE__, __LINE__); > return 0; > } > return 1; >} > >}; > >This functionality isn't available online yet. G-d willing, it >will be available by the middle of next month. Update: the functionality is now available online. Brian Wood Ebenezer Enterprises www.webebenezer.net

1 0

Boost file system idiocy
by Patrick Loney 02 Mar '08

02 Mar '08

Can't find how to seek to eof, currently using: fs.seekp( (std::streamoff)boost::filesystem::file_size( SKDO::ArchiveFilePath( keyname ) ) ); please help ****************************************************************************** "This message and any attachments are solely for the intended recipient and may contain confidential and privileged information. If you are not the intended recipient, any disclosure, copying, use, or distribution of the information included in this message and any attachments is prohibited. If you have received this communication in error, please notify us by reply e-mail and immediately and permanently delete this message and any attachments. Thank you." Interactive Transaction Solutions Ltd (2473364 England) Registered Office: Systems House, Station Approach Emsworth PO10 7PW ********************************************************************** Ce message �lectronique contient des informations confidentielles � l'usage unique des destinataires indiqu�s, personnes physiques ou morales. Si vous n'�tes pas le destinataire voulu, toute divulgation, copie, ou diffusion ou toute autre utilisation de ces informations, est interdite. Si vous avez re�u ce message �lectronique par erreur, nous vous remercions d'en avertir son exp�diteur imm�diatement par email et de d�truire ce message ainsi que les �l�ments attach�s. Interactive transaction Solutions SAS- France (RCS Pontoise : 489 397 877) Si�ge social : Parc Saint Christophe, 10, Avenue de l�Entreprise 95865 Cergy-Pontoise Cedex ______________________________________________________________________ This email has been scanned by the MessageLabs Email Security System. For more information please visit http://www.messagelabs.com/email ______________________________________________________________________

2 1

Couting occourance of specified characters
by Olaf Peter 01 Mar '08

01 Mar '08

Hi, the snipped attached counts the accourance of a specified character. Is there a simpler way using the boost libs? This solution looks quite overkill. It should be fast ;-) Thanks, Olaf

2 1

Bind + Function + Arguments
by QbProg 01 Mar '08

01 Mar '08

Hello there, I've started using boost function and bind features , and I'd like to find a way to do the following. You can take it as suggestion, if it is not implemented :) I would like to use the bind function on object members in the same way indipendently of the number of arguments. For example: function <void (int , int ) > FunctionOne; function < bool (int ) > FunctionTwo; class Implementor { public: void ImplOne ( int , int ); bool ImplTwo ( int ); }; void test () { Implementor i; FunctionOne = bind ( &Implementor::ImplOne , &i , _1 , _ 2); FunctionTwo = bind (&Implemenetor::ImplTwo, &i , _1); /* I Would be nice to do something like this, with parameter "guessing" */ // FunctionOne = GenericBind ( &Implementor::ImplOne ,&i); // FunctionTwo = GenericBind ( &Implementor::ImplTwo, &i); /* This will greatly remove verbosity! */ /* Actually I do */ #define Bind0(A,B) bind(A,B) #define Bind1(A,B) bind(A,B,_1) #define Bind2(A,B) bind(A,B,_1,_2) ...... FunctionOne = Bind2 ( &Implementor::ImplOne , &i ); FunctionTwo = Bind1 ( &Implementor::ImplTwo , &i); } It would be usefoul to make library callbacks more usable, insteat of writing a long list of arguments each time. It is possible with current implementation? I ask you for any suggestion, Thank you QbProg

2 3

[Review] Proto review starts today, March 1st
by Hartmut Kaiser 01 Mar '08

01 Mar '08

Hi all, The review of Eric Nieblers Proto library starts today, March 1st 2008, and will end on March 14th. I really hope to see your vote and your participation in the discussions on the Boost mailing lists! --------------------------------------------------- About the library: Proto is a framework for building Domain Specific Embedded Languages in C++. It provides tools for constructing, type-checking, transforming and executing expression templates. More specifically, Proto provides: * An expression tree data structure. * Operator overloads for building the tree from an expression. * Utilities for defining the grammar to which an expression must conform. * An extensible mechanism for immediately executing an expression template. * An extensible set of tree transformations to apply to expression trees. * A mechanism for giving expressions additional behaviors and members. Documentation is here: http://boost-sandbox.sourceforge.net/libs/proto Download proto.zip from here: http://www.boost-consulting.com/vault/index.php?directory=Template%20Metapro gramming Proto is a very important infrastructure library, IHMO. It has been used as the backbone for several other library writing efforts already, such as Xpressive and the rewrite of Spirit (there it has been used for all three parts: the parser, the lexer and the generator modules), and it is a key enabling technology in the long-planned unification of Phoenix and the Lambda Library. --------------------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - 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? Regards Hartmut Review Manager

1 0

templates: parts of functions
by Hicham Mouline 01 Mar '08

01 Mar '08

Hi, I have a function makeTree whose behavior depends on 3 different policies typename T1 typename T2 int N For performance reasons, I need to write the 2- and 3- specializations alongside the general N case. That is, the 2- and 3- default instantiations generated from the N case by the compiler are not optimal. As it is impossible to write function templates partial specializations, I encapsulate the template< typename T1, typename T2, int N> void makeTree(Head<N>&, const T2&, const C&) ; function in a class template template< typename T1, typename T2, int N> class makeTree{ void makeTree(Head<N>&, const T2&, const C&); }; and write the partial specializations <T1,T2,2> and <T1,T2,3>. Now, this makeTree function is quite large. It includes code that : . doesn't depend on any of the template arguments . code that depends only T1 . code that depends only on T2 . code that depends only on N . code that depends only on <T1,N>. I am worried about code bloat, and the effect on overall performance of the actual code generated even if it is not run (I noticed substantial effects depending on the size of object files and final shared library generated). Besides this, I suppose it is a better design to have these segments of code put in template functions with the right template arguments. Is it MPL the library that I should look into for such work? Perhaps nothing in Boost particularly facilitates this work, and std c++ templates are enough, Thoughts, comments are appreciated, Rds,

1 0

static assert
by Hicham Mouline 01 Mar '08

01 Mar '08

hi, I would like to avoid template instantiations with ContractType whose static functions st1 and st2 return an enum... template <typename ContractType> class C { BOOST_STATIC_ASSERT( !(ContractType::st1()==A && ContractType::st2()==P) ); ... }; Is there a way to make this work?

4 4

Re: [Boost-users] A request for help using the Boost Unit Test Library
by Tim Allison 01 Mar '08

01 Mar '08

> > Tim Allison <tallison <at> meicompany.com> writes: > >> I ran the -E option on the Gnu compiler. Here is what I hope is the >> relevant output (at the end of the 38K resulting file!): > > [...] > >> # 20 "/usr/include/boost/test/unit_test.hpp" 2 3 4 > > [...] > >> BOOST_AUTO_TEST_CASE( test1 ) > > Looks like this is Boost 1.33. You need 1.34 to build examples in new docs. > > Gennadiy > > Where do I find examples for Boost 1.33? Based on your previous remarks, I used: http://www.boost.org/libs/test/example/unit_test_example_01.cpp It is copyrighted 2005. Tim Allison

1 0