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

Re: [Boost-users] [review] Fast track formal review of Forward library begins today
by Tobias Schwinger 27 Dec '07

27 Dec '07

shunsuke wrote: > "A FunctionObject that can be used with boost::bind" is not good. :-) It's much better than using cryptic Concept names in tutorial-style documentation, IMO. We have a bunch of Function object Concepts defined in Fusion - and I have to say I'm waiting for the day I can remove them IOW result type computation crutches are not needed anymore... Regards, Tobias

2 1

time date newbie problem
by Michał Nowotka 27 Dec '07

27 Dec '07

Hi, I'm a date time library newbie and currenty working on simple web server implementation in C++. I want to generate string containing actual date in following format: Wed, 26 Dec 2007 17:33:47 GMT Date time documentation is so complicated and I can't find clear answer how to do that. Can you help me? -- Cheers, Michał Nowotka

4 6

Re: [Boost-users] [multi_index] passing 'cons t TYPE' as 'this' argument discards qualifiers
by "JOAQUIN LOPEZ MU?Z" 27 Dec '07

27 Dec '07

----- Mensaje original ----- De: damny(a)web.de Fecha: Martes, Diciembre 25, 2007 5:17 pm Asunto: [Boost-users] [multi_index] passing 'cons t TYPE' as 'this' argument discards qualifiers Para: boost-users(a)lists.boost.org > merry xmas everyone, Merry Xmas :) [...] > class cClass { > private: > int att1; > public: > std::string nme; // name > int idf; // identifier > cClass(); > cClass(std::string nme, int idf); > int get_attribute(); > }; > [...] > mMapByNme::iterator itrNme = locMsg.get<0>().find("name1"); > mMapByIdf::iterator itrIdf = locMsg.get<1>().find(456); > printf( "att1 = %d\n", itrNme->get_attribute() ); [...] > main.cpp: In function `int main()': > main.cpp:33: error: passing 'const cClass' as 'this' argument of > 'int cClass::get_attribute()' discards qualifiers > Process terminated with status 1 (0 minutes, 20 seconds) > > any hints how to solve the problem? The problem here is that elements of a multi_index_container are immutable, and the iterators ony grant const access to them. In this regard, the behavior is the same as that of a regular std::set. To solve your particular problem you can const-qualify the offending member function: int get_attribute() const; > how to encapsulate this special multi_index into a class, that > fits the above description of the needed 'map'. You should probably consider whether Boost.Bimap could be a better approach, but I see you're already discussing this issue with Matías. > are there possibilities to avoid the 'std::string' for the 'name' > key? I'm not getting this question. Could you please elaborate? > where are the more easier examples for C++-templates/boost > newbies like me :o) ? HTH, Joaquín M López Muñoz Telefónica, Investiación y Desarrollo

1 0

[lambda] problem with if_then_else_return
by Zeljko Vrba 27 Dec '07

27 Dec '07

I have a problem with the following statement: return std::accumulate( qrun_.begin(), qrun_.end(), svt, _1 < if_then_else_return( _2 != (acct*)0, bind(&acct::get_avt, _2), (unsigned)-1)); Basically, I want to find the minimal value of get_avt() over all non-null members of qrun_ which is declared as std::vector<acct*>. I get the following compiler error with SunCC 5.9: Error, badbinaryop: The operation "unsigned<const boost::lambda::detail::return_type_deduction_failure< boost::lambda::detail::return_type_2_ifthenelsereturn<1, 1, 1, 0, unsigned, const unsigned>>" is illegal. The get_avt method is declared as: unsigned get_avt() const Removing the const qualifier doesn't help. Replacing (unsigned)-1 with _1 generates the same error, but with "const unsigned" replaced by "unsigned&". Replacing (unsigned)-1 with bare 0 compiles without any error, but does not compute what I want. Any suggestions about what am I doing wrong?

1 0

Re: [Boost-users] [multi_index] passing 'const TYPE' as 'this' argument discards qualifiers
by damny＠web.de 26 Dec '07

26 Dec '07

hi mathias, thanks for your response. but i think there is a misapprehension. i want something like <http://www.boost.org/libs/multi_index/doc/tutorial/index.html>. "indexed by shape" should meet my "index by name" and "indexed by number" should meet my "index by identifier", so i can get the associated element value either by locMap[nme] or by locMap[idf], or something like that :o) there are 3 sets, a name key set, a identifier key set and an element value set; and there mapping. in a bimap are only 2 sets, a key set and an element set, which can swapped. thats not what i want. best regards, daniel _____________________________________________________________________ Der WEB.DE SmartSurfer hilft bis zu 70% Ihrer Onlinekosten zu sparen! http://smartsurfer.web.de/?mc=100071&distributionid=000000000066

2 1

[Serialization] BOOST_CLASS_EXPORT_GUID_1 macro issue (SVN Trunk)
by Richard Turrin 26 Dec '07

26 Dec '07

Hi, I am in the midst of migrating some projects into VS 2008, and have downloaded and built the boost library from the SVN Trunk (retrieved on 18 December, 2007 @ 4:09 pm) which seems to satisfy support for VS 2008. However, I was having a problem compiling some code that calls the macro BOOST_SHARED_POINTER_EXPORT (the code uses Boost serialization on some shared_ptr objects). I was running into the following error: MyOuterClass.h(11) : error C2371: '`anonymous-namespace'::boost_serialization_guid_initializer___LINE___1' : redefinition; different basic types MyOuterClass.h(10) : see declaration of '`anonymous-namespace'::boost_serialization_guid_initializer___LINE___1' The issue seems to be located in the BOOST_CLASS_EXPORT_GUID_1 macro, line 160 in serialization/export.hpp. The following macro is not expanding as desired: #define BOOST_CLASS_EXPORT_GUID_1(T, K) \ ... BOOST_PP_CAT(boost_serialization_guid_initializer_, __LINE__ ## _1) \ I believe the author of this line intended that __LINE__ would be replaced with a line number where the macro is implicitly called from, and THEN concatenated with the _1 token. Unfortunately, it seems that the two tokens are concatenated first creating __LINE___1 in the process. I have a trivial workaround: #define EXPAND(x) x #define BOOST_CLASS_EXPORT_GUID_1(T, K) \ ... BOOST_PP_CAT(boost_serialization_guid_initializer_, EXPAND(__LINE__) ## _1) \ This allows me to compile without the error (under VS 2008). Please advise if there is a better or more appropriate solution. Also, I wasn't sure whether _1 was a token literal or an mpl (Boost Metaprogramming library) placeholder. I realize that 1.35 is not yet ready for release. So, I'm not expecting everything to work correctly. So far, this is the only issue I've run into. Let me know if you need more information. Thank you for your time! Best Regards, Rich Turrin

3 4

problem with boost/ublas/storage
by nksallem＠laas.fr 26 Dec '07

26 Dec '07

Hi, First Merry Christmas Second, I'm facing the same issue that the one described here : http://lists.boost.org/MailArchives/ublas/2007/08/2247.php As I didn't found a reply, I'm posting new one. I'm runnig version 10.34.01 and using ublas for a linear least square resolution problem. the error was : -------------------------------------------------------------------- ...ublas/storage.hpp at line 196: i < size ** std:exception ** bad index ------------------------------------------------------------ It seems to be a resize() problem on matrixes, any suggestions? Thanks

1 0

Re: [Boost-users] [review] Fast track formal review of Forward library begins today
by Kirit Sælensminde 26 Dec '07

26 Dec '07

Joel de Guzman wrote: > David Abrahams wrote: >> on Fri Dec 07 2007, shunsuke <pstade.mb-AT-gmail.com> wrote: >>> FWIW, starting from Abrahams' callable and functionN, I've been implementing a similar library: >>> http://tinyurl.com/vd4r5 , which regards Boost.Functional/Forward facility >>> as one of higher-order functions, `perfect`. >> Hmm. Did anyone reply to this? I think if someone points to an >> alternative library with that level of maturity during a review, it >> shouldn't be ignored. We should at least have a discussion of the >> relative merits of the two approaches before taking a vote. > > I think the Egg library is awesome. Is it in the review queue yet? > If not, it should be. My opinion here is that it can co-exist with > the Forward library just as boost.bind can coexist with boost.lambda. > It's not always a matter of which is more sophisticated. Certainly, > bind is a subset of lambda. Yet, even with the simplicity of bind, > it is sufficiently useful in many applications. I'd say the same for > Egg and Boost.Functional. > > Let's have more FP in C++! :-) I've got to agree. The egg library looks like an incredible bit of work. I'd love to see this in Boost too. I for one though do find it confusing when there is overlap between libraries because normally the documentation of the libraries don't discus each other's strengths and weaknesses and why you might want to choose one over the other. That isn't to say that there shouldn't be overlap between libraries, but it would be nice if the documentation of the libraries cross tied a bit more. K -- http://www.kirit.com/

1 0

Re: [Boost-users] [review] Fast track formal review of Forward library begins today
by David Abrahams 26 Dec '07

26 Dec '07

on Fri Dec 07 2007, shunsuke <pstade.mb-AT-gmail.com> wrote: > John Torjo wrote: >> Hi all, >> >> The formal review of the Boost.Functional/Forward library, proposed by >> Tobias Schwinger, begins today : >> >> Boost.Functional/Forward provides decorator function objects to have an >> n-ary, >> generic function object accept both RValues and mutable LValues. > > Sorry, this is not a review. Ignore this if irrelevant. > > Was boost::detail::functionN family in Boost.Accumulators considered? > That seems more advanced than Boost.Functional/Forward. > > FWIW, starting from Abrahams' callable and functionN, I've been implementing a similar library: > http://tinyurl.com/vd4r5 , which regards Boost.Functional/Forward facility > as one of higher-order functions, `perfect`. Hmm. Did anyone reply to this? I think if someone points to an alternative library with that level of maturity during a review, it shouldn't be ignored. We should at least have a discussion of the relative merits of the two approaches before taking a vote. -- Dave Abrahams Boost Consulting http://www.boost-consulting.com

1 0

[multi_index] passing 'const TYPE' as 'this' argument discards qualifiers
by damny＠web.de 26 Dec '07

26 Dec '07

merry xmas everyone, and maybe santa claus or anyone of you have a helping surprise for me :o) after became acquainted with boost and boost.python i have to learn boost.multi_index now. the goal is to build a 'map' with two individual keys (a name and an identifier) per value (object of user class); nme1-idf1-valu1, nme2-idf2-valu2, nme3-idf3-valu3, ... any value should be 'directly' accessible by name or by identifier; valu1:=map[nme1], valu1:=map[idf1]. although i don't understand the documentation perfectly and i'm not familiar with templates i recognise that boost.multi_index is the perfect way :o) and i did the following: //--- cclass.hpp ----------- #ifndef _CCLASS_HPP_ #define _CCLASS_HPP_ class cClass { private: int att1; public: std::string nme; // name int idf; // identifier cClass(); cClass(std::string nme, int idf); int get_attribute(); }; typedef boost::multi_index_container < cClass, boost::multi_index::indexed_by < boost::multi_index::hashed_unique < BOOST_MULTI_INDEX_MEMBER(cMessage,std::string,nme) >, boost::multi_index::ordered_unique < BOOST_MULTI_INDEX_MEMBER(cMessage,int, idf) > > > mMap; typedef mMap::nth_index<0>::type mMapByNme; typedef mMap::nth_index<1>::type mMapByIdf; #endif //--- cclass.cpp ----------- #include <boost/multi_index_container.hpp> #include <boost/multi_index/member.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/hashed_index.hpp> #include "cclass.hpp" cClass::cClass() { this->att1=0xFF; } cClass::cClass(std::string nme, int idf) : nme(nme), idf(idf) { this->att1=idf+1; } int cClass::get_attribute() {return this->att1; } //--- main.cpp ------------- #include <boost/multi_index_container.hpp> #include <boost/multi_index/member.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/hashed_index.hpp> #include "cclass.hpp" int main() { mapMsg locMsg; locMsg.insert( cClass("name1", 123) ); locMsg.insert( cClass("name2", 456) ); mMapByNme::iterator itrNme = locMsg.get<0>().find("name1"); mMapByIdf::iterator itrIdf = locMsg.get<1>().find(456); printf( "att1 = %d\n", itrNme->get_attribute() ); // <<<<< printf statement } //-------------------------- compiling (mingw/gcc3.4.5) this code without the printf statement works. but if i compile the whole code i get this error message: main.cpp: In function `int main()': main.cpp:33: error: passing 'const cClass' as 'this' argument of 'int cClass::get_attribute()' discards qualifiers Process terminated with status 1 (0 minutes, 20 seconds) any hints how to solve the problem? how to encapsulate this special multi_index into a class, that fits the above description of the needed 'map'. are there possibilities to avoid the 'std::string' for the 'name' key? where are the more easier examples for C++-templates/boost newbies like me :o) ? many, many thnx, daniel _______________________________________________________________________ Jetzt neu! Schützen Sie Ihren PC mit McAfee und WEB.DE. 30 Tage kostenlos testen. http://www.pc-sicherheit.web.de/startseite/?mc=022220

2 1

[serialization] get rid from rtti
by Yan Drugalya 26 Dec '07

26 Dec '07

Folks, I have class some class Circle which is derived from Shape class. I want to get rid from RTTI. In order that I did following: BOOST_CLASS_TYPE_INFO( Circle, extended_type_info_no_rtti<Circle> ) BOOST_CLASS_EXPORT(Circle) const char * Circle::get_key() const { const boost::serialization::extended_type_info *eti = boost::serialization::type_info_implementation<Circle> ::type::get_instance(); return eti->get_key(); } But even after that, if I try to compile project a lot of waring appear: warning C4541: 'dynamic_cast' used on polymorphic type 'boost::archive::detail::basic_oarchive' with /GR-; unpredictable behavior may result it also fails with exception during runtime. What also need to be done to completely get rid form RTTI

2 1

MPL: flatten implementation not working
by Andreas Klöckner 25 Dec '07

25 Dec '07

Hi all, I came up with the following implementation of a "flatten" operation that turns a sequence of sequences into a flat list: 8< ------------------------------------------------------------------- #include <iostream> #include <boost/mpl/vector.hpp> #include <boost/mpl/vector_c.hpp> #include <boost/mpl/clear.hpp> #include <boost/mpl/fold.hpp> #include <boost/mpl/copy.hpp> #include <boost/mpl/placeholders.hpp> #include <boost/mpl/back_inserter.hpp> #include <boost/mpl/size.hpp> template<class Sequence> struct flatten { typedef typename boost::mpl::fold< Sequence, typename boost::mpl::clear<Sequence>::type, typename boost::mpl::copy< boost::mpl::_2, boost::mpl::back_inserter<boost::mpl::_1> >::type >::type type; }; typedef flatten< boost::mpl::vector< boost::mpl::vector_c<int, 0, 1, 2, 3>, boost::mpl::vector_c<int, 4, 5, 6> > >::type flatvec; int main() { std::cout << boost::mpl::size<flatvec>::value << std::endl; } 8< ------------------------------------------------------------------- It compiles (using gcc 4.2.1), but prints 0 instead of the expected 7. What am I doing wrong? Thanks for your help Andreas

2 1

[boost-users] [iterator_range construct new iterator_range of arbitary size_type]
by chun ping wang 25 Dec '07

25 Dec '07

Hi I have two questions. How would I go about using iterator_range to construct a new boost iterator_range of specific size_type ? 1.) Like std::vector<int> v(40); // constructs 40 int objects but instead your giving only std::vector<int>::iterator beg(v.begin()), end(v.end()); // the range 2.) How would with combination of iterator_range modify an existing sequence. Like BOOST_FOREACH(int& x, v) but using boost iterator_range concept instead. Thanks.

3 4

[serialization] understanding of track_always serialization trait
by Yan Drugalya 24 Dec '07

24 Dec '07

Folks , I feel a lack of understanding what actually track_always trait does. I expect that boost does not allow me to save/load twice object with the same address? But it reports BOOST_STATIC_ASSERT even in following case: Question 1 Class A { // serialization support }; BOOST_CLASS_TRACKING (A, track_always) BOOST_CLASS_EXPORT( A) … A* a = new A; oa << a ; assert in oserializer.hpp // if your program traps here, it indicates taht your doing one of the following: // a) serializing an object of a type marked "track_never" through a pointer. // b) saving an non-const object of a type not markd "track_never) // Either of these conditions may be an indicator of an error usage of the // serialization library and should be double checked. See documentation on // object tracking. Qurstion 2 Above code with using of xml_oarchive compliles and works: oa << BOOST_SERIALIZATION_NVP(a); oa << BOOST_SERIALIZATION_NVP(a); I expect that it should raise above BOOST_STATIC_ASSERT because I trying to store the same object twice? Question 3 Also I can't understand how track_always serialization trait works in case of Diamond inheritance Quataion from documentation "In a diamond hesitance structure with a virtual base class, object tracking will prevent redundant save/load invocations" How boost knows that this is virtual base class and prevents redundant save/load invocations? Please help me to find the way to understanding of object tracking trait :) Thank you

2 1

Help needed on time date
by tonyaim83 24 Dec '07

24 Dec '07

Hi I'm using Date time library for the first time so no idea how best make use of it. My primary target is to check if the first timestamp and second timestamp entered by the user are in a span of one hour. Format of input string is as follows YYYYDDMM-HH:MM:SS(20071015-17:47:10) Now if the second string is also in the an hour span it should return true otherwise false. I m thinking of doing this like std::string to_iso_string(date d1) ptime p1(d1, time_duration("17:21:23")); std::string to_iso_string(date d2) ptime p2(d2, time_duration("17:22:23")); ptime p3=p2-p1; if (p3>1) { return false; } I could also find a function which has a separator T std::string to_iso_extended_string(ptime); How can i make use of this function as in my case the separtor of date- time is "-" Or a better way to perform the same task. -- View this message in context: http://www.nabble.com/Help-needed-on-time-date-tp14486644p14486644.html Sent from the Boost - Users mailing list archive at Nabble.com.

3 2

[interprocess][intrusive][mpi] Latest SVN head documentation
by Edward Diener 24 Dec '07

24 Dec '07

In the latest SVN head, the documentation for interprocess and intrusive offo of the main Boost documentation page eventually points to an HTTP metacomm address where no documentation exists rather than to the documentation in the corresponding boost/libs/interprocess/doc/html and boost/libs/intrusive/doc/html where documentation does exist after bjam is used to build it. For MPI in the latest SVN head, the documentation off of the main Boost documentation page points to boost/doc/html/mpi.html but no file exists here even after building the MPI docs with bjam. Instead it should eventually point to boost/libs/mpi/doc/html where docs do exist for MPI after one builds them.

1 0

BGL: Finding all simple cycles in an undirected graph
by Torsten Sadowski 23 Dec '07

23 Dec '07

Hello, I am looking for a way to find all simple cycles in an undirected graph. I need it to reconstruct a 3D mesh from a graph containing the mesh vertices and edges. Any hints? Cheers, Torsten

2 3

Cygwin compilation problem
by Kent Holsinger 23 Dec '07

23 Dec '07

I've used various earlier versions of Boost with Cygwin in the past, and I am finally getting around to trying version 1.34.1. Unfortunately, I can't get it to build. Here's the string of error messages I get when I try: ***** Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (don't panic: this is a strictly optional feature). /c/development/boost_1_34_1/tools/build/v2/tools/stage.jam:424: in object(installed-shared-lib-generator)(a)4.run *** argument error * rule virtual-target.register ( target ) * called with: ( object(file-target)@1391 object(file-target)@1392 ) * extra argument object(file-target)@1392 /c/development/boost_1_34_1/tools/build/v2/build/virtual-target.jam:880:see definition of rule 'register' being called /c/development/boost_1_34_1/tools/build/v2/build/generators.jam:840: in try-one-generator-really /c/development/boost_1_34_1/tools/build/v2/build/generators.jam:902: in try-one-generator /c/development/boost_1_34_1/tools/build/v2/build/generators.jam:1110: in construct-really /c/development/boost_1_34_1/tools/build/v2/build/generators.jam:1186: in generators.construct /c/development/boost_1_34_1/tools/build/v2/tools/stage.jam:160: in construct /c/development/boost_1_34_1/tools/build/v2/build/targets.jam:1242: in object(install-target-class)(a)65.generate /c/development/boost_1_34_1/tools/build/v2/build/targets.jam:765: in generate-really /c/development/boost_1_34_1/tools/build/v2/build/targets.jam:738: in object(main-target)(a)249.generate /c/development/boost_1_34_1/tools/build/v2/build/targets.jam:895: in targets.generate-from-reference /c/development/boost_1_34_1/tools/build/v2/build/targets.jam:1169: in generate-dependencies /c/development/boost_1_34_1/tools/build/v2/build/targets.jam:1214: in object(alias-target-class)(a)71.generate /c/development/boost_1_34_1/tools/build/v2/build/targets.jam:765: in generate-really /c/development/boost_1_34_1/tools/build/v2/build/targets.jam:738: in object(main-target)(a)253.generate /c/development/boost_1_34_1/tools/build/v2/build-system.jam:402: in load /c/development/boost_1_34_1/tools/build/v2/kernel/modules.jam:261: in import /c/development/boost_1_34_1/tools/build/v2/kernel/bootstrap.jam:132: in boost-build /c/development/boost_1_34_1/boost-build.jam:9: in module scope ***** If it makes any difference bjam --version reports: Boost.Build V2 (Milestone 11) Boost.Jam 03.1.16 and gcc --version reports gcc (GCC) 3.4.4 (cygming special, gdc 0.12, using dmd 0.125) Do I need to figure out how to compile gcc 4.x under Cygwin, or is there a simpler way to get things to work? Kent -- Kent E. Holsinger kent(a)darwin.eeb.uconn.edu http://darwin.eeb.uconn.edu -- Department of Ecology & Evolutionary Biology -- University of Connecticut, U-3043 -- Storrs, CT 06269-3043

2 2

VS2005 threads with clr option not working
by Jason McGuidwin 23 Dec '07

23 Dec '07

hello, I am trying to compile a simple proragm with the thread headers included and the clr option in VS2005 When i include the thread headers and set the to compile with the /clr option the app will not execute and give the error below: "The application failed to initialize properly (0xc000007b). Click on OK to terminate the application." this sample program works fine without the clr option, however I am writing a managed c++ app that needs this option on. also I have used the lib installer from http://www.boost-consulting.com/products/free the 1.34.1 installer for vs8.0, I have selected all options and still does not work. I have tried defining BOOST_THREAD_USE_DLL and BOOST_THREAD_USE_LIB, still fails. BOOST_THREAD_USE_LIB error message is the same as if I did not have this define. BOOST_THREAD_USE_DLL error message: "This application has failed to start because boost_threads-vc80-mt-gd-1_34_1.dll was not found. Re-Installing the application may fix this problem." my project prefs have the following settings: c/c++ - additional include directories= "C:\Program Files\Boost\boost_1_34_1\" linker - additional include directories= "C:\Program Files\Boost\boost_1_34_1\lib" [code] #include "stdafx.h" #include <iostream> #include <boost/timer.hpp> //#define BOOST_THREAD_USE_DLL //#define BOOST_THREAD_USE_LIB #include <boost/thread/thread.hpp> #include <boost/thread/xtime.hpp> int main(int argc, char* argv[]) { boost::xtime expiration; boost::timer the_timer; //starts the timer std::cout<<"Welcome to the sample program!"<<std::endl; for(int i = 0;i <1000000; i++) { if(i%100000 == 0) { std::cout<<"."; boost::xtime_get(&expiration, boost::TIME_UTC); expiration.nsec +=int(5 * 1e08);// half second; boost::thread::sleep(expiration); } } std::cout<<std::endl<<"This program has been running for: "<< the_timer.elapsed() <<" second(s)." << std::endl; std::cout<< std::endl<<"Press any key then enter to exit. "<< std::endl; char buff[100]; std::cin>>buff; } [/code] Jason McGuidwin Gnostech Inc. San Diego, Ca

3 2

[review] Formal Fast-Track review of the Boost.Functional/Factory library - extended until sunday
by John Torjo 22 Dec '07

22 Dec '07

Hi all, I've extended the review until Sunday (inclusive). I'm hoping for more reviews. So far, we've had only two. If you are interested in the library (you should be :)), please take some time to review it. This is the info you need to do a review on: *Description* Factories are callback mechanisms for constructors, so we provide two function objects, boost::value_factory and boost::factory, that encasulate object construction through direct application of the constructor or operator new, respectively. These templates make other facilities that operate on function objects (such as standard algorithms, Boost.Bind, Boost.Function, or Fusion functional adapters) applicable to constructors. *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 6

Re: [Boost-users] [review] Formal Fast-Track review of the Boost.Functional/Factory library - extended until sunday
by Tobias Schwinger 22 Dec '07

22 Dec '07

shunsuke wrote: > John Torjo wrote: >> Hi all, >> >> I've extended the review until Sunday (inclusive). I'm hoping for more reviews. So far, we've had only two. >> If you are interested in the library (you should be :)), please take some time to review it. This >> is the info you need to do a review on: >> >> *Description* >> >> Factories are callback mechanisms for constructors, so we provide two >> function objects, boost::value_factory and boost::factory, that >> encasulate object construction through direct application of the >> constructor or operator new, respectively. These templates make other >> facilities that operate on function objects (such as standard >> algorithms, Boost.Bind, Boost.Function, or Fusion functional adapters) >> applicable to constructors. > > Is there any difference to lambda::constructor/new_ptr? Yes, those components are designed to only work with the Lambda library. Functional/Factory OTOH provides standard compliant (they work with result_of and the libraries built upon it) function objects. Regards, Tobias

2 3

vector slice for other containers
by abir basak 22 Dec '07

22 Dec '07

Hi, can I use vector_slice / vector_range from uBLAS for std::vector or std::deque ? Or any other library can do it? I can't use iterator based libs (like boost::range or boost::range + step_iterator) as I want to hold view even after a few push_back & pop_front , as long as no element gets remove from within my view window. If elements gets removed from view window,any behavior is fine for me .. but if the case is not so , I want the range/slice view to hold the proper elements irrespective of iterator invalidation due to push_back/pop_front. Thanks abir

1 0

[review] Formal Fast-Track review of the Boost.Functional/Factory library - 2 days left
by John Torjo 22 Dec '07

22 Dec '07

Hi all, There are only 2 days left from the formal Fast-Track review of the Boost.Functional/Factory library. We've had just one review, and we need more. If you are interested in the library (you should be :)), please take some time to review it. This is the info you need to do a review on: *Description* Factories are callback mechanisms for constructors, so we provide two function objects, boost::value_factory and boost::factory, that encasulate object construction through direct application of the constructor or operator new, respectively. These templates make other facilities that operate on function objects (such as standard algorithms, Boost.Bind, Boost.Function, or Fusion functional adapters) applicable to constructors. *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 6

[review][unordered] Review summary
by Ion Gaztañaga 21 Dec '07

21 Dec '07

Hi to all, This post tries to summarize the review of the new Boost.Unordered library. In general, there were no serious implementation change requests and most reviewers had only documentation issues. Here we go: * * * begin of summary * * * Thosten Ottosen's review: ---------------------- (http://lists.boost.org/Archives/boost/2007/12/131372.php) Thorsten questioned about the convenience of supporting throwing hash or predicates. This started a thread about the exception safety guarantees of STL containers and Daniel explained the thread-safety guarantees of Unordered. Basically, Daniel's implementation uses an smart double-buffering technique to obtain strong safety guarantees (stricter than the requirements of the standard) in some operations. There's an slight size overhead (the container must allocate space for two equality functors and hashers) but according to Daniel, speed should not suffer. Chung Ping Wang's review: ---------------------- (http://lists.boost.org/Archives/boost/2007/12/131372.php) The only complain was the packaging of the library (there was an "unordered" directory at the top). Since the library has been accepted it will be packaged as the rest of Boost libraries so the problem disappears. Mathias Gaunard's comment: ---------------------- (http://lists.boost.org/Archives/boost/2007/12/131426.php) Mathias suggested adding move semantics and in-place construction. Daniel said that these features were likely to be added in the future. He pointed that we have no standard move emulation library in Boost so we'll need to push that first. Regarding in-place construction, there is a problem with allocators, since containers are now required to call allocator::construct() to construct values. Hervé Brönnimann's review: ---------------------- (http://lists.boost.org/Archives/boost/2007/12/131435.php) Hervé praised the library and suggested adding operator==(). Daniel replied that he was trying to limit himself to obvious design decisions for extensions so he didn't want to go into this area. He also cited some problems with non-unique key unordered containers. Hervé suggested extending the prime number list and Daniel agreed. Daniel also agreed to correct some documentation issues. "Swap" semantics wrt allocators was also discussed. "Swap" and its effect on containers is an active issue in the committee, so Daniel is free to implement what he thinks best until we have a firm resolution. John Torjo's review: ---------------------- (http://lists.boost.org/Archives/boost/2007/12/131557.php) A concise and positive review with no comments. Jamie Allsop's review: ---------------------- (http://lists.boost.org/Archives/boost/2007/12/131762.php) Documentation suggestions that Daniel found interesting and a request to include a comparison with other implementations. Steven Watanabe's comments ---------------------- (http://lists.boost.org/Archives/boost/2007/12/131817.php) Several implementation comments regarding (ADL, BOOST_DEDUCED_TYPENAME, warnings...). See the post for details. Cromwell Enage's review ---------------------- (http://lists.boost.org/boost-users/2007/12/32706.php) Suggested the addition of local_cbegin() and similar, and some documentation suggestions Daniel agreed to solve. Paul A Bristow's review ---------------------- (http://lists.boost.org/Archives/boost/2007/12/131545.php) A brief and positive review with no comments. * * * end of summary * * * Regards, Ion

1 0

BOOST_PP_COUNTER compiler errors (MSVC8)
by Robert Dailey 21 Dec '07

21 Dec '07

Hi, I'm currently compiling my code in Visual Studio 2005. Below is the code that utilizes BOOST_PP_COUNTER. Note that the goal here is to increment the counter 1 time each time the CHECK_MATCH_AND_RETURN macro is used. This allows me to make sure that I've got one macro call per enumeration member. The problem I'm having is that I'm getting page after page of compiler error and as far as I can tell I'm using the counter system as it was shown in the code examples. Below I've also listed some of the compiler errors I'm getting: Compiler Errors: error C2162: expected macro formal parameter error C2065: 'include' : undeclared identifier error C2882: 'boost' : illegal use of namespace identifier in expression Code: #include <boost/static_assert.hpp> #include <boost/preprocessor/slot/counter.hpp> /// Various camera actions that may be performed. /// These actions are usually a result of input events. enum CameraAction { MOVE_FORWARD = 0 , MOVE_BACKWARD , MOVE_LEFT , MOVE_RIGHT , MOVE_UP , MOVE_DOWN , ROTATE_RIGHT , ROTATE_LEFT , ROTATE_UP , ROTATE_DOWN , ROLL_LEFT , ROLL_RIGHT , INCREASE_ACCEL , DECREASE_ACCEL , ENABLE_LOOK , TOGGLE_LOOK , ENABLE_AUTO_MOVE , TOGGLE_AUTO_MOVE /// @cond , NUM_CAMERAACTIONS , CAMERAACTION_NONE /// @endcond }; //========================================================================================= CameraAction StringToCameraAction( const std::string& str ) { // I'm using a macro here because I need the stringizing preprocessor operator (#) // to make the conditionals more manageable. By using this macro, I never have to explicitly // update the string comparison itself if the enumeration names ever change. #define CHECK_MATCH_AND_RETURN( action ) if( str == #action ) { return action; } #include BOOST_PP_UPDATE_COUNTER() CHECK_MATCH_AND_RETURN( ROTATE_LEFT ) CHECK_MATCH_AND_RETURN( ROTATE_RIGHT ) CHECK_MATCH_AND_RETURN( ROTATE_UP ) CHECK_MATCH_AND_RETURN( ROTATE_DOWN ) CHECK_MATCH_AND_RETURN( MOVE_UP ) CHECK_MATCH_AND_RETURN( MOVE_DOWN ) CHECK_MATCH_AND_RETURN( MOVE_LEFT ) CHECK_MATCH_AND_RETURN( MOVE_RIGHT ) CHECK_MATCH_AND_RETURN( MOVE_FORWARD ) CHECK_MATCH_AND_RETURN( MOVE_BACKWARD ) CHECK_MATCH_AND_RETURN( ROLL_RIGHT ) CHECK_MATCH_AND_RETURN( ROLL_LEFT ) CHECK_MATCH_AND_RETURN( INCREASE_ACCEL ) CHECK_MATCH_AND_RETURN( DECREASE_ACCEL ) CHECK_MATCH_AND_RETURN( ENABLE_LOOK ) CHECK_MATCH_AND_RETURN( TOGGLE_LOOK ) CHECK_MATCH_AND_RETURN( ENABLE_AUTO_MOVE ) CHECK_MATCH_AND_RETURN( TOGGLE_AUTO_MOVE ) // This helps me remember to add/remove items above. BOOST_STATIC_ASSERT( (BOOST_PP_COUNTER)+1 != NUM_CAMERAACTIONS ); return CAMERAACTION_NONE; }

2 6