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

I NEED HEMP PLEASEeeeeeeeeeeeeee
by Karim Bakir 06 Apr '06

06 Apr '06

I use multi array boost But I have problem : - I can't declare a multi array as a member variable , I have the error: unexpected "error C2321: syntax error : unexpected 'boost::extents" When I don' write the keyword "typdef" I have more mistakes. //Boost library #include <Boost/multi_array.hpp> #include <cassert> //Name Space using namespace std; using namespace boost; class MyClass { typedef boost::multi_array<double,2>array_type_2d; public: MyClass(); virtual ~MyClass(); array_type_2d M(boost::extents[10][10]); }; So I want to have : but I don't manage it. //myClass.h ////////////////////////// //Boost library #include <Boost/multi_array.hpp> #include <cassert> //Name Space using namespace std; using namespace boost; class myClass { boost::multi_array<double,2>array_type_2d; private : int dim1, dim2; array_type_2d MyMatrice(boost::extents[dim1][dim2]) ; array_type_2d MySecondMatrice(boost::extents[10][10]) ; }; //myClass.cpp //////////////////////////////// void myClass::tester() { for (int i= 0 ; i<dim1; +) for(int j=0;j<dim2;j++) MyMatrice[i][j] = 15; } for ( i= 0 ; i<10; +) for(int j=0;j<10;j++) MySecondMatrice[i][j] = 0; } Thankssss

4 3

Please add support for Borland C++ Builder 2006
by Zhou Fan 06 Apr '06

06 Apr '06

Please add support for Borland C++ Builder 2006. I need it very much.

4 3

signal type declaration problem
by Emre Birol 06 Apr '06

06 Apr '06

Hi all, I have a class like below and I want to declare a signal type inside my class. Unfortunately when I do that MS VC80 complaints. Any help highly will be appreciated. template <typename T> class MyTask { public: // type definitions typedef enum { waiting, running, completed, failed } States; typedef boost::signal<void (States)> StatusChanged; typedef boost::signals::connection Connection; }; I get two warnings first then an error: Warning 1 warning C4512: 'boost::signals::detail::bound_objects_visitor' : assignment operator could not be generated c:\lib\boost\include\boost-1_33\boost\signals\trackable.hpp 185 Warning 2 warning C4346: 'boost::signal<void(lumentest::NITask<trait>::States)>::slot_function_type' : dependent name is not a type c:\projects\tesla-at-sti\src\lumentest\devices\nitask.hpp 124 Error 3 error C2061: syntax error : identifier 'slot_function_type' c:\projects\tesla-at-sti\src\lumentest\devices\nitask.hpp 124 if I replace 'States' with an int type then it works. I think compiler can't find out the type of States properly... I've also tried following declarations. None of them worked. typedef boost::signal<void (MyTask::States)> StatusChanged; typedef boost::signal<void (MyTask<T>::States)> StatusChanged; typedef boost::signal<void (typename MyTask::States)> StatusChanged; thanks, Emre

1 0

[review] promotion traits - review period extended until April 9.
by Tobias Schwinger 06 Apr '06

06 Apr '06

Dear users & members of Boost, I decided to extend the review period of the fast-track review for Promotion Traits until April 9 because there were only three reviews until now. That is, you have another three days to submit your evaluation of the proposed Boost software. Cheer up, it's a small & fast-to-track submission! We're very much looking forward to your reviews. Download URL ============ http://cpp-experiment.sourceforge.net/promote-20050917.tar.gz About the submission ==================== The Promotion Traits extend Boost.TypeTraits with templates that compute the type after promotion has been applied. Example: // given template<typename T> struct some_algorithm; template<> struct some_algorithm<int> { [...] }; // [...] more specializations // , [...] some_algorithm< typename integral_promotion<T>::type > [...] // makes some_algorithm work for any type T that promotes to an integer // (that is enums and smaller integral types) without the need for // additional specialization Review questions ================ Please always explicitly state in your review, whether you think the library should be accepted into Boost. You might want to comment on the following questions: - 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, Tobias (Review Manager)

1 0

(no subject)
by Karim Bakir 06 Apr '06

06 Apr '06

Hi I want to know if it exists in boost multi array a method to empty it. thanks. --------------------------------- Nouveau : téléphonez moins cher avec Yahoo! Messenger ! Découvez les tarifs exceptionnels pour appeler la France et l'international.Téléchargez la version beta.

3 2

sregex_token_iterator
by Jean-Sebastien Vachon 06 Apr '06

06 Apr '06

Hi All, I have a string in the following form: w="id = 10" C=field1 G=GeoRaster X=leMHG08wViX2quWNB All I want is to iterator onto the key/values pairs. w "id = 10" C field1 G GeoRaster X leMHG08wViX2quWNB The key/value pairs are separated by spaces. However, I can not simply use a space pattern to iterate over my input string since the W option allows the user to use "" to include spaces. Can someone tell me what is wrong in the following code? oParametersValue represents my input string. regex eParam("(.)=(\"?.*\"?)", regex::normal | regbase::icase); int const sub_matches[] = { 1, 2 }; // key, value sregex_token_iterator oIter(oParametersValue.begin(), oParametersValue.end(), eParam, sub_matches); sregex_token_iterator j; while (oIter != j) { std::cout << *oIter++ << std::endl; } Thanks

2 4

Regex question
by Peter Sliepenbeek 06 Apr '06

06 Apr '06

First some examples: -- std::string input = "u"; std::string expression = "[^UuMmFf]*"; std::string replacement = "Unknown"; boost::regex regular_expression(expression); std::string output = boost::regex_replace(input, regular_expression, replacement, boost::match_default); Boost: output = "UnknownuUnknown" $ echo 'u' | sed 's/[^UuMmFf]*/Unknown/g' UnknownuUnknown Expected. -- std::string input = "x"; std::string expression = "[^UuMmFf]*"; std::string replacement = "Unknown"; boost::regex regular_expression(expression); std::string output = boost::regex_replace(input, regular_expression, replacement, boost::match_default); Boost 1.33.1: output = "UnknownUnknown" Prior: "Unknown" $ echo 'x' | sed 's/[^UuMmFf]*/Unknown/g' Unknown The result generated by Boost 1.33.1 is not expected! -- std::string input = " "; std::string expression = "[^UuMmFf]*"; std::string replacement = "Unknown"; boost::regex regular_expression(expression); std::string output = boost::regex_replace(input, regular_expression, replacement, boost::match_default); Boost 1.33.1: output = "UnknownUnknown" Prior: "Unknown" $ echo ' ' | sed 's/[^UuMmFf]*/Unknown/g' Unknown The result generated by Boost 1.33.1 is not expected! -- The expression "[^UuMmFf]*" will greedily match the input string. In the case of "x" or " " (space) the expression will match the whole string! There should not be a match on an empty string! Considering these examples I would mark this as a bug! Thanks, P. Sliepenbeek __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

Re: [Boost-users] Serialization: crash at launch of program (duetoboost::serialization::base_object)
by RIVASSEAU Jean Noel 06 Apr '06

06 Apr '06

I have tried to use versioning. Exact same problem. More explanations: if I use the version facility, and at load I switch the boost::serialization::base_object<MyBaseClass> depending on the version, the same crash will happen. Eg: this code: if (version == 0) { boost::serialization::base_object<MyBaseClass_1> } Else { boost::serialization::base_object<MyBaseClass_2> } Will cause the same crash. So, could you look at the code, because currently there is no way to change the base class of an object appearing in serialized archives, if you want to be able to read old archives. It seems like there is a bug, if the base_object is used several times with different classes, the crash will appear. Thanks Jean-Noël -----Message d'origine----- De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de Robert Ramey Envoyé : mercredi 5 avril 2006 17:15 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] Serialization: crash at launch of program (duetoboost::serialization::base_object) The "version" facility is provided for maintaining the ability to read old archives. It doesn't sound like you're using this and its sounds like you should be. Robert Ramey "RIVASSEAU Jean Noel" <JN.RIVASSEAU(a)oberthurcs.com> wrote in message news:87F60F7FA02FF749AFB02BD9FCAA6B0401074928@naserv31.nanterre.oberthurcs.com... Hello, My program crashes at launch (not even a exit(0) as the first line of main(int argc, char *argv[]) will stop it from crashing), due to the BSL. What I am trying to do is: I have a class, whose serialization is split (eg, save and load functions are provided, and they are different). Now this class had a parent class, so I used to call boost::serialization::base_object<MObject>() on the base class MObject. However I want to change the parent of my class to a different class. I also want to update my old archives, so I decided to leave the load function of my class untouched, while I would change the save function, to update the call to base_object to the new parent class (not MObject anymore). I thought it would work, since it would load the old archive using the same method, but save it using the new, so I would have ran only one time the program and the archive would be updated (then, of course, before running it again I would have to recompile it one more time with the correct changes to the load function). But it does not work as expected, since it seems the BSL does not like the fact that save and load functions calls to boost::serialization::base_object do not specify the same base class. It does not complain at compile time but crashes at run time before even entering main and certainly before loading any archive. The crash is due to a NULL pointer, I have tried to debug with gdb but the crash apparently occurs on the _libkernel32_a_iname () so I do not not know where it is (too low level for me). Robert, do you have an idea what is going on? I suspect a bug - however if it is "normal" behaviour (I think it should then throw an exception rather than crash), *** Tell that to the author of _libkernel32_a_iname () do you have an idea how could I update my archives? I need to change the parent of this class, but need to be able to read my old archives - and changing them "by hand" by looking into the XML archive code is tool hard. Thank you, regards Jean-Noël Rivasseau _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

[Multi_Array] distiontion be tween views, array_view, sub_array_view etc.
by Robert Ramey 06 Apr '06

06 Apr '06

The multi_array library seems to a good fit for a situation which I'm currently dealing with. I'm having a lot of problems understanding how to use it though. I can't really understand the distinction between the differing types of views, subviews etc. I would sort of expect that a new instance of a multi_array could be created by passing a reference to anything that fullills he requirements of a multi_array. That seems not to be the case. If you could pont me to any additional information on this library, I would be interested. Robert Ramey

4 4

(Semi-)Automatic Resoning Tools
by Hossein Haeri 06 Apr '06

06 Apr '06

Dear all, Off-hand, I know that there is no such a thing in the Boost repository: a (semi-)automatic reasoning tool. Or, am I missing anything? I have made a short google on that, and the first thing comming up is ACL2 which is quite huge for my purpose. The problem with it is that it takes much longer to become an effective user of it than the time I've got. So, does anybody here know any such reasoning tool which doesn't need that much learning time? TIA, --Hossein ___________________________________________________________ Yahoo! Photos NEW, now offering a quality print service from just 8p a photo http://uk.photos.yahoo.com

1 0

Re: [Boost-users] Idea for equation library
by Stephen Henry 06 Apr '06

06 Apr '06

It's quite a nice idea, but I'm not too sure why anyone would want to use it. There are already a number of optimised and fully featured mathematical libraries out there. Without somesort a capability for algebraic manipulation, for example, the ability to determine the value of a variable within an equation given a number of relations (which coincidently would be really useful, but non-trivial to implement), the library basically amounts to some santatic sugar. What I find interesting, however, is the named associations for function arguments ( x -> 5 ), for example, but I think there is already a library in Boost that enables such functionality. S. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Stephen Gross Sent: 04 April 2006 18:29 To: Boost Subject: [Boost-users] Idea for equation library I've got an idea for a toolkit that uses boost::lambda to let you write 'equations' on the fly in c++. For instance, consider the following pseudo-code: ================== Equation e = x + y; print e(x -> 5, y -> 10) // Prints 15 e = x - y print e(x -> 5, y -> 10) // Prints -5 Equation d = eq(e) + z print d(x -> 1, y -> 2, z -> 3) // Prints 2 ================== The idea is that you can encapsulate an algebraic function in a standalone 'Equation' instance, and dynamically reassign that equation. It's built off of boost::lambda (of course), but it lets you name the variables rather than just refer to them with the standard placeholders (_1, _2, etc.). Is it worthwhile for me to post the toolkit code on this group? Thanks, --Steve Stephen Gross Case Western School of Medicine Cleveland, OH "By Grabthar's hammer, by the sons of Worvan, you shall be avenged." - Dr. Lazarus _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Re: [Boost-users] equation (really expression) idea
by james.jones＠firstinvestors.com 06 Apr '06

06 Apr '06

From: "Stephen Gross" <sgross(a)darwin.epbi.cwru.edu> > >1. Types are not template-ized. I don't want everything to be a double. > This is an interesting point. My goal so far has been to prioritize > simplicity above all. The purpose of the toolkit is for letting people write > arithmetic equations easily. In light of that, I think sticking with doubles > makes sense. So if I want to use a rational class, or a higher-precision double provided by a library, or a fixed-precision class, or a boolean type (a la Excel: if(x<y,x,y)) I'm out of luck? I appreciate simplicity of use, but you can still accomplish this by letting double be the default type (which makes sense, I think). Then non-power-users get double all the time, and power users can still do some hacking. > Well, this is an interesting idea but it runs contrary to the metaphor I > want. In the above example, the variables 'x' and 'y' work as global > variables. I want the user to have to pass x and y directly to the equation. I agree - which is why I wrote the bit about an evaluate function that takes positional arguments. Maybe named arguments are even better, though. I hadn't thought of that. > If you had global-level variables, then it would be difficult to make the > above example work properly (passing z on as x and y when f2 invokes f1).. Please don't call them globals - they aren't. They're in the same scope as the expression. However, as to your particular issue, this isn't a problem: variable x, y, z; expression expr1 = x + y; expression expr2 = z + expr1; A variable is just a special form of an expression, after all. As to mapping, it would be nice to be able to write code like: double v = expr1(x=5,y=10); double w = expr2(x=2,y=3,z=8); I should think the Boost parameter library could handle this. Actually, maybe you don't even need the Boost parameter library. Just define operator() on expression to ignore its arguments (then x=5, y=10 sets the values of x and y, and expr1 is then evaluated in that context). - James

2 1

Cross compiling to Arm.
by James Hughes 06 Apr '06

06 Apr '06

Hello all, Just quick question. Has anyone managed to cross compile Boost from a Linux X86 host to ARM using a gcc compiler? Is so, which version of the compiler did you use and which version of boost? I am having problems with iwmmxt_le-g++ v 3.4.3 and boost:1.33.1, in the Spirit libs (as previously posted). It appears to be a compiler fault...which is not evident inthe non-cross compiler version of g++ 3.4.3. James

1 0

Spirit: Assigning elements of a closure member.
by Mark Williams 06 Apr '06

06 Apr '06

Is there any standard way, in a semantic action, to assign individual elements of a struct that is set as a member of a closure? For example suppose I have:- struct foo { int a, b, c; std::string d; float e; }; And I have this as member1 in my closure, which is then attached to a rule that parses each of those struct member elements seperately, is there then a standard way within the semantic actions in my rule to assign to foo.d, say, without modifying the other values? It seems that my only option is to either write my own functors to set each member seperately, or have the individual elements as seperate members of my closure. I kind of want to do something like this: myrule = int_p[assign_a(myrule.m1.a)] >> int_p[assign_a(myrule.m1.b)]; But myrule.m1 is an actor, not an instance of foo. Is there a way to do this with boost::bind perhaps? I want to use closures since my rules need to be reentrant. Mark

1 1

Assertions doesn't work!
by Kiuhnm 05 Apr '06

05 Apr '06

I'm using MSVC8 (2005) with Boost 1.33.1. The code at the end of this post should cause the compiler to print out something like this (GCC): conversion from 'mpl_::failed ****************(factorial<mpl_::int_<-5> >::FACTORIAL_of_NEGATIVE_NUMBER::****************) (mpl_::int_<-5>)' to non-scalar type 'mpl_::assert<false>' requested. but I obtain something completely different. It seems that the compiler continues to evaluate the factorial (-1, -2, -3, ...) ignoring the assertions. Since the template expansion is quite "complex", the compiler fails and prints out: --- fatal error C1202: recursive type or function dependency context too complex c:\boost\include\boost-1_33_1\boost\mpl\aux_\preprocessed\plain\times.hpp(60) : see reference to class template instantiation 'factorial<N>' being compiled with [ N=boost::mpl::int_<-88> ] --- What's wrong? --- #include <boost/mpl/assert.hpp> #include <boost/mpl/greater_equal.hpp> #include <boost/mpl/equal_to.hpp> #include <boost/mpl/multiplies.hpp> #include <boost/mpl/prior.hpp> #include <boost/static_assert.hpp> namespace mpl = boost::mpl; // specializations are nullary metafunctions that compute n>0 template <int n> struct FACTORIAL_of_NEGATIVE_NUMBER : mpl::greater_equal<mpl::int_<n>, mpl::int_<0> > {}; template <class N> struct factorial : mpl::eval_if< mpl::equal_to<N,mpl::int_<0> > , mpl::int_<1> , mpl::multiplies< N , factorial<typename mpl::prior<N>::type> > > { BOOST_MPL_ASSERT((FACTORIAL_of_NEGATIVE_NUMBER<N::value>)); BOOST_STATIC_ASSERT((0)); // !!! BOOST_MPL_ASSERT_MSG(N::value >= 0, FACTORIAL_of_NEGATIVE_NUMBER, (N)); // !!! }; int main() { int f = factorial< mpl::int_<-5> >::type::value; } --- Thank you, Kiuhnm -- View this message in context: http://www.nabble.com/Assertions-doesn%27t-work%21-t1401263.html#a3770376 Sent from the Boost - Users forum at Nabble.com.

2 1

Re: [Boost-users] Boost-users Digest, Vol 866, Issue 4
by Stephen Gross 05 Apr '06

05 Apr '06

Message: 10 Date: Wed, 5 Apr 2006 10:52:07 -0700 From: "Sohail Somani" <s.somani(a)fincad.com> Subject: Re: [Boost-users] Equation idea (follow-up) To: <boost-users(a)lists.boost.org> Message-ID: <1C1EBEF8DBACDC439D038EA051674EC728BE13(a)xbox.financialcad.com> Content-Type: text/plain; charset="us-ascii" >Because people want to use different types. For example, some systems may support higher precision for long double. I think you have a good point on this one... The trick is to find a way to do it that keeps the client syntax as simple. >I think most boost users are pretty much power-users (for better or worse). Sure, so I guess the question is more like this: If we accept the premise that the intended users of the toolkit aren't power users, then does it make sense for boost to include? I think you have a valid point that maybe it's not appropriate for boost. But at the same time, I figured that since it's built so directly off of boost, it might be helpful. Then again, maybe the best place for the equation toolkit is in a different toolkit bundle...? --Steve

2 1

Re: [Boost-users] equation (really expression) idea (follow-up)
by Stephen Gross 05 Apr '06

05 Apr '06

>1. Types are not template-ized. I don't want everything to be a double. This is an interesting point. My goal so far has been to prioritize simplicity above all. The purpose of the toolkit is for letting people write arithmetic equations easily. In light of that, I think sticking with doubles makes sense. 2. Perhaps variables should be first-class objects, not just placeholders in BLL. Maybe... The whole idea, though, is basically to macro-ify some boost::lambda::bind operations so that you let lambda do the heavy lifting of actually combining all the functors together. 3. (Style not substance) Many of the type and function names aren't very clear. Examples: go() and MapType; Sure; style can always be worked on. Right now, it's not very well-documented anyway so some of the implementation may not be intuitive. >I'm thinking the client syntax should be something more like this: expression expr; variable<double> x; variable<int> y; expr = x + y; double v = expr; // would throw because x and y are unassigned x = 10; y = 20; v = expr; // assigns 30 to v Well, this is an interesting idea but it runs contrary to the metaphor I want. In the above example, the variables 'x' and 'y' work as global variables. I want the user to have to pass x and y directly to the equation. There's another reason for this: If one equation uses another equation, you have to make sure the equations use the right variables. Consider this: Equation f1 = x + y Equation f2 = z + f1(x -> z, y -> z) print f2(9) If you had global-level variables, then it would be difficult to make the above example work properly (passing z on as x and y when f2 invokes f1).. --Steve

2 1

Re: [Boost-users] I NEED HEMP PLEASEeeeeeeeeeeeeee
by Sohail Somani 05 Apr '06

05 Apr '06

I don't think this is the right list to discuss these things. (Sorry, I had to)

1 0

Re: [Boost-users] Boost-users Digest, Vol 866, Issue 4
by Sohail Somani 05 Apr '06

05 Apr '06

> >I think most boost users are pretty much power-users (for better or > worse). > > Sure, so I guess the question is more like this: If we accept > the premise > that the intended users of the toolkit aren't power users, > then does it make > sense for boost to include? I think you have a valid point > that maybe it's > not appropriate for boost. But at the same time, I figured > that since it's > built so directly off of boost, it might be helpful. Then > again, maybe the > best place for the equation toolkit is in a different toolkit > bundle...? Im sure you'd get a really great response on a numerical analysis type forum (I think there is a newsgroup sci.math.num-analysis or something) Sohail

1 0

Re: [Boost-users] Equation idea (follow-up)
by Sohail Somani 05 Apr '06

05 Apr '06

> >> class Equation > >Should be templated > > Why? Because people want to use different types. For example, some systems may support higher precision for long double. > The idea is that the target users for this toolkit aren't > power-users. Quite > the contrary: I work with a lot of scientists, and they have > rudimentary > C/C++ skills. This system would let them write equations > without having to > learn template syntax or, for that matter, much about > function declarations. I think most boost users are pretty much power-users (for better or worse). If your stuff is compatible with boost/tr1 function (and it seems that it is, just might be missing some tyepdefs), then that's a step in the right direction. Sohail

1 0

Re: [Boost-users] Equation idea (follow-up)
by Stephen Gross 05 Apr '06

05 Apr '06

>> std::cout << a(_y is 5, _z is 10) << std::endl; >I do think the idea of assigning inputs at the call site is important which is what you've done. It would be nice to use the named parameter library here if possible to get rid of the leading underscores. I've played around a little with the parameter library, but it requires you to pre-register variable names (I think???). With this system, you can either use the underscore-letter name, or just wrap the name in the VAR() macro (eg: Equation e = VAR(foo) + VAR(bar); cout << e(VAR(foo) is 9, VAR(bar) is 10). ) >> class Equation >Should be templated Why? >I don't know what this offers over boost bind and function. I use these to do a lot of this type of stuff. As long as the number of parameters are low, its easy to understand and you get some currying for free. The idea is that the target users for this toolkit aren't power-users. Quite the contrary: I work with a lot of scientists, and they have rudimentary C/C++ skills. This system would let them write equations without having to learn template syntax or, for that matter, much about function declarations. >// I'd really like to do >double v = f(x=x,y=y); I think the system I've proposed will do what you're asking: Equation f = _x + _y; double v = f(_x is 5, _y is 8) --Steve

1 0

Re: [Boost-users] Equation idea (follow-up)
by Sohail Somani 05 Apr '06

05 Apr '06

Comments below > std::cout << a(_y is 5, _z is 10) << std::endl; I do think the idea of assigning inputs at the call site is important which is what you've done. It would be nice to use the named parameter library here if possible to get rid of the leading underscores. > class ArgTable I think this is not needed if you can use the named parameter library. > class Equation Should be templated I don't know what this offers over boost bind and function. I use these to do a lot of this type of stuff. As long as the number of parameters are low, its easy to understand and you get some currying for free. SomeFn f = bind(my_fn(),_1,_2); // its not too difficult to understand this as x,y // I'd really like to do double v = f(x=x,y=y); Sohail

1 0

Re: [Boost-users] Equation idea (follow-up)
by Stephen Gross 05 Apr '06

05 Apr '06

>Why don't just use Blitz++ for various expressions/equations? ;) I didn't know about blitz++, but I've just now taken a quick look at it. It appears designed for performance above all, which is not the idea behind my equation toolkit. The equation toolkit is designed to let you *easily* write straight-forward equations, combine them, and re-assign them as you want. For instance: ================= Equation e = x + y print e(x -> 1, y -> 2) e = y print e(y -> 9) e = z + 2 * y / a + b print e(a -> 2, b -> 5, y -> 100, z -> 50) ================= The advantage is that you can easily change an equation so you don't actually have to write functions for each equation. If you have a situation where you need to dynamically change around equations a lot during runtime, this system should (ideally) be useful. --Steve

1 0

Equation idea (follow-up)
by Stephen Gross 05 Apr '06

05 Apr '06

Ok, at least one person said they were interested in seeing my idea for an equation toolkit, so here goes... The files a few hundred lines, so hopefully that's ok for this group. If I've exceed some message size, I'm sorry in advance... ======== e.cpp (client code) follows ========= #include "equation.h" #include "equation_enable_macros.h" int main() { equation::Equation a; a = _y + _z; std::cout << a(_y is 5, _z is 10) << std::endl; a = _x + 8 * (_y - _z); std::cout << a(_x is 2, _y is 3, _z is -9000.9) << std::endl; return 0; } ======== equation.h follows (the real work) ========= // Copyright Stephen Gross 2006 #ifndef api_equation #define api_equation #include <string> #include <iostream> #include <map> #include "boost/function.hpp" #include "boost/lambda/lambda.hpp" #include "boost/lambda/bind.hpp" namespace equation { class ArgTable { typedef std::map<std::string, double> MapType; public: ArgTable & setArg(const std::string & name, double val) { my_map[name] = val; return *this; } virtual double getArg (const std::string & name) const { MapType::const_iterator f = my_map.find(name); if(f == my_map.end()) { std::cout << "Error: Equation requested argument '" << name << "' which was not given." << std::endl; exit(0); } else { return f->second; } } private: MapType my_map; }; class ArgTableReporter : public ArgTable { public: virtual double getArg(const std::string & name) const { my_last_var = name; return 0; } const std::string & getLastVar() const { return my_last_var; } private: mutable std::string my_last_var; }; /// /// Represents an Equation, simply put. /// /// The idea here is that, for any Equation that takes named arguments ("x", "y", etc.) and manipulates them /// arithmetically, such an Equation can in fact be encapsulated in an Equation instance. /// /// class Equation { public: typedef boost::function1<double, const ArgTable &> FunctorType; /// @name Constructors //@{ Equation() : my_ftr(boost::lambda::constant(0)) { ; } Equation(const Equation & other) : my_ftr(other.my_ftr) { } template<typename T> Equation(const T & t) : my_ftr(t) { } //@} /// @name The underlying function that invokes the functor: //@{ double go (const ArgTable & args) const { return my_ftr(args); } //@} /// @name operator() //@{ double operator() () { return go(ArgTable()); } template<typename A1> double operator() (const A1 & a1, double v1) const { ArgTable args; ArgTableReporter names; a1(names); args.setArg(names.getLastVar(), v1); return go(args); } template<typename A1, typename A2> double operator() (const A1 & a1, double v1, const A2 & a2, double v2) const { ArgTable args; ArgTableReporter names; a1(names); args.setArg(names.getLastVar(), v1); a2(names); args.setArg(names.getLastVar(), v2); return go(args); } template<typename A1, typename A2, typename A3> double operator() (const A1 & a1, double v1, const A2 & a2, double v2, const A3 & a3, double v3) const { ArgTable args; ArgTableReporter names; a1(names); args.setArg(names.getLastVar(), v1); a2(names); args.setArg(names.getLastVar(), v2); a3(names); args.setArg(names.getLastVar(), v3); return go(args); } template<typename A1, typename A2, typename A3, typename A4> double operator() (const A1 & a1, double v1, const A2 & a2, double v2, const A3 & a3, double v3, const A4 & a4, double v4) const { ArgTable args; ArgTableReporter names; a1(names); args.setArg(names.getLastVar(), v1); a2(names); args.setArg(names.getLastVar(), v2); a3(names); args.setArg(names.getLastVar(), v3); a4(names); args.setArg(names.getLastVar(), v4); return go(args); } //@} private: FunctorType my_ftr; }; namespace Private { class Sigma { public: Sigma() : my_start(0), my_stop(0), my_iter(boost::lambda::constant(0.0)) { } Sigma(double start, double stop, const Equation & eq) : my_start((int)start), my_stop((int)stop), my_iter(eq) { } Sigma(const Sigma & other) : my_start(other.my_start), my_stop(other.my_stop), my_iter(other.my_iter) { } Sigma& operator=(const Sigma & other) { if(this != &other) { my_start = other.my_start; my_stop = other.my_stop; my_iter = other.my_iter; } return *this; } double go (const ArgTable & args) const { ArgTable newargs = args; double result = 0.0; for(int i = my_start; i <= my_stop; ++i) { newargs.setArg("i", (double)i); result += my_iter.go(newargs); } return result; } private: int my_start; int my_stop; Equation my_iter; }; /// /// Helper struct so that unary math functions can be easily macro-ified for constructing Equations. struct UnaryFunc { UnaryFunc(double (*fn) (double), const Equation::FunctorType & arg_getter) : my_fn(fn), my_arg_getter(arg_getter) { } UnaryFunc(double (*fn) (double), double v) : my_fn(fn), my_arg_getter(boost::lambda::constant(v)) { } UnaryFunc(const UnaryFunc & other) : my_fn(other.my_fn), my_arg_getter(other.my_arg_getter) { } UnaryFunc& operator=(const UnaryFunc & other) { if(this != &other) { my_fn = other.my_fn; my_arg_getter = other.my_arg_getter; } return *this; } double go(const ArgTable & args) const { return (*my_fn) (my_arg_getter(args)); } double (*my_fn) (double); Equation::FunctorType my_arg_getter; }; /// /// Helper struct so that binary math functions can be easily macro-ified for construction Equations. struct BinaryFunc { BinaryFunc( double (*fn) (double, double), const Equation::FunctorType & arg1_getter, const Equation::FunctorType & arg2_getter) : my_fn(fn), my_arg1_getter(arg1_getter), my_arg2_getter(arg2_getter) { } BinaryFunc( double (*fn) (double, double), double arg1, const Equation::FunctorType & arg2_getter) : my_fn(fn), my_arg1_getter(boost::lambda::constant(arg1)), my_arg2_getter(arg2_getter) { } BinaryFunc( double (*fn) (double, double), const Equation::FunctorType & arg1_getter, double arg2) : my_fn(fn), my_arg1_getter(arg1_getter), my_arg2_getter(boost::lambda::constant(arg2)) { } BinaryFunc( double (*fn) (double, double), double arg1, double arg2) : my_fn(fn), my_arg1_getter(boost::lambda::constant(arg1)), my_arg2_getter(boost::lambda::constant(arg2)) { } BinaryFunc(const BinaryFunc & other) : my_fn(other.my_fn), my_arg1_getter(other.my_arg1_getter), my_arg2_getter(other.my_arg2_getter) { } BinaryFunc& operator=(const BinaryFunc & other) { if(this != &other) { my_fn = other.my_fn; my_arg1_getter = other.my_arg1_getter; my_arg2_getter = other.my_arg2_getter; } return *this; } double go(const ArgTable & args) const { return (*my_fn) (my_arg1_getter(args), my_arg2_getter(args)); } double (*my_fn) (double, double); Equation::FunctorType my_arg1_getter; Equation::FunctorType my_arg2_getter; }; } // End namespace Private } // End namespace equation #define VAR(name) boost::lambda::bind<double>(&equation::ArgTable::getArg, boost::lambda::_1, std::string(#name)) #define EQ(name) boost::lambda::bind<double>(&equation::Equation::go, &name, boost::lambda::_1) #endif =========== equation_enable_macros.h follows ============ #ifndef api_equation_enable_macros #define api_equation_enable_macros // Disable macros now available: #undef api_equation_disable_macros #define is , #define _a VAR(a) #define _b VAR(b) #define _c VAR(c) #define _d VAR(d) #define _e VAR(e) #define _f VAR(f) #define _g VAR(g) #define _h VAR(h) #define _i VAR(i) #define _j VAR(j) #define _k VAR(k) #define _l VAR(l) #define _m VAR(m) #define _n VAR(n) #define _o VAR(o) #define _p VAR(p) #define _q VAR(q) #define _r VAR(r) #define _s VAR(s) #define _t VAR(t) #define _u VAR(u) #define _v VAR(v) #define _w VAR(w) #define _x VAR(x) #define _y VAR(y) #define _z VAR(z) #define _sigma(start, stop, iter) boost::lambda::bind<double> (&equation::Private::Sigma::go, equation::Private::Sigma (start, stop, iter), boost::lambda::_1) #define _sqrt(x) boost::lambda::bind<double> (&equation::Private::UnaryFunc::go, equation::Private::UnaryFunc (&sqrt, x), boost::lambda::_1) #define _pow(x, y) boost::lambda::bind<double> (&equation::Private::BinaryFunc::go, equation::Private::BinaryFunc (&pow, x, y), boost::lambda::_1) #endif ========= end of code snippets ==============

2 1

Re: [Boost-users] equation (really expression) idea (follow-up)
by james.jones＠firstinvestors.com 05 Apr '06

05 Apr '06

From: "Stephen Gross" <sgross(a)darwin.epbi.cwru.edu> > Ok, at least one person said they were interested in seeing my idea for an > equation toolkit, so here goes... The files a few hundred lines, so > hopefully that's ok for this group. If I've exceed some message size, I'm > sorry in advance... This is a decent start, but I have several problems with it. 1. Types are not template-ized. I don't want everything to be a double. 2. Perhaps variables should be first-class objects, not just placeholders in BLL. 3. (Style not substance) Many of the type and function names aren't very clear. Examples: go() and MapType; I'm thinking the client syntax should be something more like this: expression expr; variable<double> x; variable<int> y; expr = x + y; double v = expr; // would throw because x and y are unassigned x = 10; y = 20; v = expr; // assigns 30 to v It would be cool to then be able to define some sort of 'evaluate' function so that you could write: v = expr.evaluate(10, 20); // v <- 30 Perhaps this is where the BLL comes in, because you'd first have to map the positional arguments to the variables in the expression. Maybe you could also extend this to handle currying. - James

1 0

Problem with memory allocation in UBLAS matrix and vector
by Vasilios Papakos 05 Apr '06

05 Apr '06

Hello, Here is the problem I am having: In the following code (tried to keep it as short as possible), I create a vector [vec1] and a matrix [mat1] in the respective test functions. Then, I create [vec2] and [mat2] in main, but when I print them they have the values of [vec1] and [mat1]. Why is this happening? I am quite new to boost, so I may miss something quite fundamental. I really appreciate you help. System: Fedora Core 4, boost-1.33.1.-5, g++ 4.0.2 Regards, Vasilios ---------------------------------------------------------------------------------------------------------------------------------------------------------- #include <boost/numeric/ublas/vector.hpp> #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/io.hpp> typedef boost::numeric::ublas::matrix<double> ublas_matrix; typedef boost::numeric::ublas::vector<double> ublas_vector; using std::cout; using std::endl; void test_matrix(); void test_vector(); int main() { test_matrix(); ublas_matrix mat2(3, 2); cout << "m2 = " << mat2 << endl; test_vector(); ublas_vector vec2(4); cout << "v2 = " << vec2 << endl; } void test_matrix() { unsigned m = 3, n = 2; ublas_matrix mat1(m, n); for (unsigned i = 0; i < m; ++ i) for (unsigned j = 0; j < n; ++ j) mat1(i, j) = 5.0; } void test_vector() { ublas_vector vec1(4); for (unsigned i = 0; i < vec1.size(); ++i) vec1(i) = i; } ----------------------------------------------------------------------------------------------------------------------------------------------------------

1 0

Serialization: crash at launch of program (due to boost::serialization::base_object)
by RIVASSEAU Jean Noel 05 Apr '06

05 Apr '06

Hello, My program crashes at launch (not even a exit(0) as the first line of main(int argc, char *argv[]) will stop it from crashing), due to the BSL. What I am trying to do is: I have a class, whose serialization is split (eg, save and load functions are provided, and they are different). Now this class had a parent class, so I used to call boost::serialization::base_object<MObject>() on the base class MObject. However I want to change the parent of my class to a different class. I also want to update my old archives, so I decided to leave the load function of my class untouched, while I would change the save function, to update the call to base_object to the new parent class (not MObject anymore). I thought it would work, since it would load the old archive using the same method, but save it using the new, so I would have ran only one time the program and the archive would be updated (then, of course, before running it again I would have to recompile it one more time with the correct changes to the load function). But it does not work as expected, since it seems the BSL does not like the fact that save and load functions calls to boost::serialization::base_object do not specify the same base class. It does not complain at compile time but crashes at run time before even entering main and certainly before loading any archive. The crash is due to a NULL pointer, I have tried to debug with gdb but the crash apparently occurs on the _libkernel32_a_iname () so I do not not know where it is (too low level for me). Robert, do you have an idea what is going on? I suspect a bug - however if it is "normal" behaviour (I think it should then throw an exception rather than crash), do you have an idea how could I update my archives? I need to change the parent of this class, but need to be able to read my old archives - and changing them "by hand" by looking into the XML archive code is tool hard. Thank you, regards Jean-Noël Rivasseau

2 1

Re: [Boost-users] Idea for equation library
by james.jones＠firstinvestors.com 05 Apr '06

05 Apr '06

Stephen Gross wrote: > The idea is that you can encapsulate an algebraic function in a standalone > 'Equation' instance, and dynamically reassign that equation. It's built off > of boost::lambda (of course), but it lets you name the variables rather than > just refer to them with the standard placeholders (_1, _2, etc.). Is it > worthwhile for me to post the toolkit code on this group? I'd love to see this. But it should be called "Expression", not "Equation" - the concepts you'd be creating aren't "equations". Equation: x + y = z Expression: x + y - James

1 0

Confusion on The Directory Structure For serialization library
by Cheok Yan Cheng 05 Apr '06

05 Apr '06

You might thoroughly read http://www.boost.org/more/getting_started.html#Build_Install. Where under the Results section, the naming convention is described. -------------------------------------------------------- That's cool! I get the naming convention I want after running bjam install. Thank you very much! __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

1 0

Boost.Filesystem
by Elisha Berns 05 Apr '06

05 Apr '06

I asked this two weeks ago but didn't get any reply: Can file locking and permission setting be added to Boost.Filesystem? Elisha Berns

3 4

Re: [Boost-users] [Serialization] a newbie question about retrieving objects serialized through base class pointers
by t.sammoud 05 Apr '06

05 Apr '06

Robert Ramey wrote: >If BOOST_CLASS_EXPORT is used, the class name is included as an attribute in >the xml file. >Otherwise, the class_id variable - another xml attribute is used. This is >set/recovered by the >"registration" process. I understood from the documentation that BOOST_CLASS_EXPORT works for classes which derive from a virtual base class, which isn't really the case for me. Is it possible to add class names as attributes to xml archives even for classes which aren't serialized through base class pointers? If there is a way, this would really helps me Thanks Accédez au courrier électronique de La Poste : www.laposte.net ; 3615 LAPOSTENET (0,34 /mn) ; tél : 08 92 68 13 50 (0,34/mn)

2 1

bjam build question
by Joe McCay 05 Apr '06

05 Apr '06

Is it possible to specify a clean build from scratch, or do you have manually delete the object files and stuff? jmccay

2 1

'Function String' parser question
by K M 05 Apr '06

05 Apr '06

Hi, I have this parser that parses string that represents a function, (a c++ function prototype to say) CONSIDER: bool parse_info<> x_parser4(char const* str, FunctionSpec& spec) { // some rules... rettype = lexeme_d[ (alpha_p) >> *(alnum_p | space_p | ch_p('*')) ][list_actor(spec)]; // assign function name when match... function = lexeme_d[ (alpha_p | ch_p('_')) >> *(alnum_p | ch_p('_')) ][assign_a(spec.m_Name)]; // other rules.... .... return parse(str,top); } // Here's what my struct looks like: struct FunctionSpec { std::string m_Name; enum eVarType { VAR_VOID, VAR_BOOL, VAR_INT... } eVarType m_RetType; }; In the function rule what i did was just to assign the name to the m_Name of spec In the rettype tule what i did there was to pass the match string along with the struct (spec) to a class (list_actor) using the operator()... Problem is that i can't jsut assign m_RetType to the 'matched string' delivered to list_actor's operator() since this one is an enumerated type; In the code i attached, there is a function that 'maps' a string to eVarType, but i can't call this function within the list_actor's operator() body? i.e. template <typename ActionIterT> operator(...,...) { // can't do here? // tried to bind the function but it didn't work as well... } In summary what i need to do is to assign value for m_RetType and other members of FunctionSpec using the strings i get from parsing, e.g. when i get the string "void" for a match in the rettype rule, m_RetType will be assigned to VAR_VOID. etc. ----- krby

1 0

Failed installing on VC8. Namespace 'boost' not found.
by �� 05 Apr '06

05 Apr '06

Hi. I'm newbie in C++ and i can't install the Boost library. Maybe i'm just doing somethng wrong ? Hepl plz. I have have A Visual Studio 2005 installed into default location. I have python 2.4.3 installed at default location (c:\Python24) => trying to install boost : I'm launching bjam.exe as bjam "-sTOOLS=vc-8_0" install it produces 168 files in c:\boost\lib with total size ~1Gig and produces the c:\Boost\include\boost-1_33_1\boost\ with .hpp's inside. //======================================= then setting VC++ Directorise in Tools>Options>Projects and Solutions in in VC++ 8.0 IDE - adding "c:\Boost\include" and "c:\Boost\include\boost-1_33_1\boost" to Include files - adding "c:\Boost\lib" Library files //======================================= then creating a simple VC++ console project and adding some using/include from examlles #include "stdafx.h" #include <boost/config.hpp> #include <iostream> #include <fstream> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> using namespace boost; int _tmain(int argc, _TCHAR* argv[]) { return 0; } ==> Build == > fatal error C1083: Cannot open include file: 'boost/config.hpp': No such file or directory //================================================= Or in this manner : #include "stdafx.h" using namespace boost; int _tmain(int argc, _TCHAR* argv[]) { return 0; } ==> Build == > error C2871: 'boost' : a namespace with this name does not exist //============================== Any ideas how to make that thing work ?

3 2

Re: [Boost-users] Failed installing on VC8. Namespace 'boost' not found
by Alex Korban 04 Apr '06

04 Apr '06

Hi Just a note about Vinzenz's advice: make sure you don't put the trailing slash into the include path, otherwise Visual Studio might produce weird and seemingly unrelated errors. E.g. put c:\Boost\include\boost-1_33_1 into the include paths, not c:\Boost\include\boost-1_33_1\ Hope this helps. Regards Alex Korban.

1 0

Re: [Boost-users] Idea for equation library
by Sohail Somani 04 Apr '06

04 Apr '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Stephen Gross > Is it > worthwhile for me to post the toolkit code on this group? Heck yes.

1 0

Idea for equation library
by Stephen Gross 04 Apr '06

04 Apr '06

I've got an idea for a toolkit that uses boost::lambda to let you write 'equations' on the fly in c++. For instance, consider the following pseudo-code: ================== Equation e = x + y; print e(x -> 5, y -> 10) // Prints 15 e = x - y print e(x -> 5, y -> 10) // Prints -5 Equation d = eq(e) + z print d(x -> 1, y -> 2, z -> 3) // Prints 2 ================== The idea is that you can encapsulate an algebraic function in a standalone 'Equation' instance, and dynamically reassign that equation. It's built off of boost::lambda (of course), but it lets you name the variables rather than just refer to them with the standard placeholders (_1, _2, etc.). Is it worthwhile for me to post the toolkit code on this group? Thanks, --Steve Stephen Gross Case Western School of Medicine Cleveland, OH "By Grabthar's hammer, by the sons of Worvan, you shall be avenged." - Dr. Lazarus

1 0

using random library
by Kamil Renczewski 04 Apr '06

04 Apr '06

Hello I have a problem. I need to write program, whitch interprets arguments given at runtime and create generators from this arguments. Then i have to use this generators (by calling operator() method) to generate numbers. Problem is that i dont know type of generators at compile time and i dont know how to store them in struct or class or even pass to a function. Here is en example of my thinking: i run program like this: generators N 10 2 E 2.3 and i would like to get some ramdom numbers from a normal_distribution<>(10, 2) and exponential_distribution<>(2.3) another run of a program might be: generators U -10 30 G 0.3 whitch should give me an uniform_int<>(-10, 30) and geometric_distribution<>(0.3) . Any ideas how to do this? thanks

2 1

Building 1.33.1 with Sun Studio 11
by paul.floyd 04 Apr '06

04 Apr '06

Hi all I've almost managed to get Boost 1.33.1 to build on Solaris with Sun Studio 11. I'm not quite up to speed yet with all of the Boost MACROS (in particular the WORKAROUND one). Here's what I've done so far: a) Apply all of the latest patches to Sun Studio 11 b) Apply all of the patches at http://blogs.sun.com/roller/page/sga?catname=%2FBoost c) I had a compile problem with readdir_r not being seen. To fix this I changed my bjam command line to add -sSUNPRO_CXX="CC -D_XOPEN_SOURCE=500" (on Solaris 10 you may prefer -D_XOPEN_SOURCE=600) d) In boost/test/impl/unit_test_suite.ipp, the code makes use of std::random_shuffle. AFAICS this uses rand48(), and rand48() is in <stdlib.h> but not in <cstdlib> and std::. To fix this I added #if defined(__SUNPRO_CC) #include <stdlib.h> #endif at line 42. (this looks like a compiler/std lib issue to me) e) I had some errors with size_t not being in the global scope (Sun Studio is the pickiest compiler I know of for this). This comes from boost/config/posix_features.hpp including unistd.h My fix for this was to add #include <cstdlib> using std::size_t; at line 17 of boost/config/platform/solaris.hpp f) I had two problems with libs/iostreams/src/bzip2.cpp f.1) bzlib.h uses FILE as if it were in the global scope, but as per point e), with Sun Studio, when including <cstdio>, it is in std::, so just before including "bzip2.h" (line 18) I added #include <boost/iostreams/filter/bzip2.hpp> #if defined(__SUNPRO_CC) using std::FILE; #endif f.2) Solaris 8 ships with a version of libbz2 that is too old to be compatible with the Boost.Iostreams code. Iostreams doesn't seem to do any checking of the libbz2 version (if any version is available to check). To fix this I downloaded libbz2 from http://www.bzip.org/downloads.html, untarred it to a '3rdparty' directory, built it (make CC=cc CFLAGS=-xO5) and then changed my bjam command line to use -sSUNPRO_CXX="CC -D_XOPEN_SOURCE=500 -I/home/paulf/scratch/boost_1_33_1/3rdparty/bzip2-1.0.3" This leaves me with (for the moment) one compile error: boost/spirit/core/non_terminal/impl/grammar.ipp, line 279 the compiler complains about Error: Initializing definition_t &def = get_definition<DerivedT, ContextT, ScannerT>(self); requires an lvalue At first I thought this might be related to Sun Studio having an issue with name mangling typedefs, but this doesn't seem to be the case. A+ Paul Accédez au courrier électronique de La Poste : www.laposte.net ; 3615 LAPOSTENET (0,34 /mn) ; tél : 08 92 68 13 50 (0,34/mn)

1 0

Re: [Boost-users] Perl Regex Question
by paul.floyd 04 Apr '06

04 Apr '06

> admin(a)geocodenet.com wrote : > > > When I use this regular expression: > > > > ^(*.)a(*.) [snip] > > 1==>M > > 2==>nagement > > This is what you get if you use (.*?) (ungreedy) Or alternatively (and more portable to different regex engines which may not have non-greedy options): ^([^a]*)a(.*) A+ Paul Accédez au courrier électronique de La Poste : www.laposte.net ; 3615 LAPOSTENET (0,34 /mn) ; tél : 08 92 68 13 50 (0,34/mn)

1 0

Confusion on The Directory Structure For serialization library
by Cheok Yan Cheng 04 Apr '06

04 Apr '06

Hello all, I just download boost 1.33.1 and I am building using VC++ 7.1. I am a bit confused on the directory structure of serialization library (1) \bin\boost\libs\serialization\build\libboost_serialization.lib \bin\boost\libs\serialization\build\libboost_wserialization.lib May I know the differences among libboost_serialization.lib and libboost_wserialization.lib directory? What is the meaning of 'w'? (2) \bin\boost\libs\serialization\build\libboost_serialization.lib \bin\boost\libs\serialization\build\boost_serialization.dll First, I thought libboost_serialization.lib are mean for static library, boost_serialization.dll are mean for dynamic library. However, inside the libboost_serialization.lib directory, they are further divided into libboost_serialization.lib\vc-7_1\release\runtime-link-static\threading-multi libboost_serialization.lib\vc-7_1\release\threading-multi <---- (Does this mean this is a dynamic library since it doesn't contains runtime-link-static??? How about boost_serialization.dll) Thank you very much! __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

Re: [Boost-users] [multi_index] Serialization problemwithmulti_indexcontainer
by JOAQUIN LOPEZ MU?Z 04 Apr '06

04 Apr '06

----- Mensaje original ----- De: John Reid <john.reid(a)wibr.ucl.ac.uk> Fecha: Lunes, Abril 3, 2006 5:09 pm Asunto: Re: [Boost-users] [multi_index] Serialization problemwithmulti_indexcontainer > Joaquín Mª López Muñoz wrote: > > What this means is, if you've got elements a,b and its corresponding > > deserialized equivalents a',b', then a<b must yield the same value > > (true or false) as a'<b' --assuming it is operator< that is used > for sorting > > the index, which is the case if identity<element> is the key and > > the default sorting criterion is used. > > Ok thanks, that makes sense. I should have read that. > > My value_type has a data member that is a pointer to an object of > an > abstract class. I would like one index to be sorted by the > addresses of these objects. Yep, here's the problem, addresses' order is not preserved. > There seems no way to do this and have direct > serialisation of the multi_index container. Can you confirm? Yes, I'm afraid you can't directly serialize a multi-index container one of whose indices is of type ordered_non_unique and the key is the address of some mmember (or the whole element.) You'll have to stick to your current workaround --but you can improve it a bit: you don't really need to use an intermediate vector if you do the serialization process "by hand": save: save the number of elements. traverse the first index and save he visited elements. load: clear the container. load the number of elements N. repeat N times: load an element and insert it into the container. The overall effect is the same as with the intermediate vector, without any extra overhead. > Maybe I'm > missing something. Is there a reason why the serialisation > implementation does not recalculate the indices on the fly? Well, this is prewisely what's happening. Consider the following: struct element { element(int x,int y,int z):x(x),y(y),z(z){} int x,y,z; }; typedef multi_index_container< element, indexed_by< ordered_non_unique<member<element,int,&element::x> >, ordered_non_unique<member<element,int,&element::y> > > > multi_index_t; multi_index t m; element a(0,1,0); element b(1,1,1); element b(2,1,2); m.get<1>()insert(a); m.get<1>().insert(b,m.get<1>().begin()); m.get<1>().insert(c,m.get<1>().begin()); Now, if you traverse m by its index #0, the result is (0,1,0), (1,1,1), (2,1,2) whereas if you traverse it by index #1, the order is, because of our use of hinted insertion, the following: (0,1,0), (2,1,2), (1,1,1) So far so good. When saving and subsequently loading this container, Boost.MultiIndex guarantees that the traversal order of *every* index is preserved. Now, suppose serialization were implemented the naive way, that is, by just saving the elements as they are visited by the first index and loading through the first index again, just as you're doing in your workaround (no offense meant by the use of the word "naive", of course.) If you examine the process carefully, you can see that, when performed this way, index #0 is correctly replicated, but the resulting order of the loaded index #1 is (0,1,0), (1,1,1), (2,1,2) which does not match the original. This is why Boost.MultiIndex saves, additionally to the elements, enough extra information to restore index traversal orders in those cases where such order is not univocally determined (ordered non-unique, sequenced and random-access indices.) And when applying this extra information, the kind of sanity check you've been bitten by is routinely performed. I hope I've made myself clear, sorry for the long explanation. > Thanks for your response, > John. Thank you for using Boost.MultiIndex. I'm sorry out-of-the-shelf serialization capabilities can't serve your particular needs. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

Linker errors with boost::regex with boost_1_33_1, STLport-4.6.2 and VS7.1
by Vijay Choudhary 04 Apr '06

04 Apr '06

Hi All, Is there a known issue of linker errors with using boost::regex library with STLport. If I don't install STLport I am able to build regex however I am getting linker error while trying to build after installing STLPort. Operating System:Win-XP IDE: Visual Studio .NET(version 7.1.3088) STLPort version: STLport-4.6.2 Boost versio:boost_1_33_1 The code which I have used in sample project: #include "stdafx.h" #include <boost/regex.hpp> #include <iostream> #include <string> int _tmain(int argc, _TCHAR* argv[]) { std::string line; boost::regex pat( "^Subject: (Re: |Aw: )*(.*)" ); while (std::cin) { std::getline(std::cin, line); boost::smatch matches; if (boost::regex_match(line, matches, pat)) std::cout << matches[2]; } return 0; } I got following linker errors: ConsoleApp1.obj : error LNK2019: unresolved external symbol "void __cdecl boost::re_detail::raise_runtime_error(class _STL::runtime_error const &)" (?raise_runtime_error@re_detail@boost@@YAXABVruntime_error@_STL@@@Z) referenced in function "void __cdecl boost::re_detail::raise_error<struct boost::regex_traits_wrapper<struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > >(struct boost::regex_traits_wrapper<struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > const &,enum boost::regex_constants::error_type)" (??$raise_error@U?$regex_traits_wrapper@U?$regex_traits@DV?$w32_regex_tr aits@D@boost@@@boost@@@boost@@@re_detail@boost@@YAXABU?$regex_traits_wra pper@U?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@1@W4error_ty pe@regex_constants@1@@Z) ConsoleApp1.obj : error LNK2019: unresolved external symbol "class _STL::basic_string<char,class _STL::char_traits<char>,class _STL::allocator<char> > __cdecl boost::re_detail::w32_transform(unsigned long,char const *,char const *)" (?w32_transform@re_detail@boost@@YA?AV?$basic_string@DV?$char_traits@D@_ STL@@V?$allocator@D@2@@_STL@@KPBD0@Z) referenced in function "public: class _STL::basic_string<char,class _STL::char_traits<char>,class _STL::allocator<char> > __thiscall boost::w32_regex_traits<char>::transform(char const *,char const *)const " (?transform@?$w32_regex_traits@D@boost@@QBE?AV?$basic_string@DV?$char_tr aits@D@_STL@@V?$allocator@D@2@@_STL@@PBD0@Z) Debug/ConsoleApp1.exe : fatal error LNK1120: 2 unresolved externals However if I comment call to function boost::regex_match() in sample code , then I am able to build it. Regards: Vijay Kumar

2 1

does ptr_* solves this?
by Marco Correia 04 Apr '06

04 Apr '06

Hi, I have an heterogeneous container holding pointers to objects of type B. I want to insert objects of type D1,D2,... that derive from B, and I want to do that using a custom stl like allocator, for example: B* obj = my_alloc<D>::allocate(1); obj = new (obj) B(); container.insert(obj); My problem is that when an object is removed from the container, I have to explicitely deallocate it from my allocator, but the static info was lost, so I cannot do my_alloc<?>::deallocate(1,oj); I've asked in boost irc channel, and someone told me ptr_* boost libraries solve this problem, is this correct? thanks -- Marco Correia <mvc(a)netcabo.pt>

3 4

[BGL] GraphML ?
by Tiago de Paula Peixoto 04 Apr '06

04 Apr '06

Hi. Is there any planned support for GraphML i/o (http://graphml.graphdrawing.org/) in BGL? Has anyone played with this, and has experimental code? I think I saw it mentioned in the BGL documentation somewhere, but I can't find it. Thanks a lot. -- Tiago de Paula Peixoto <tiago(a)forked.de>

3 4

bind on a iterator zip.
by chun ping wang 04 Apr '06

04 Apr '06

std::for_each(boost::make_zip_iterator(boost::make_tuple(beg1, beg2, beg3)), boost::make_zip_iterator(boost::make_tuple(end1, end2, end3)), ); now i want acess each indivdual tuple values using lambda and bind. How would i do that? My basic question is how would I use lambda to access the tuples value or each iteration value....

1 0

Perl Regex Question
by admin＠geocodenet.com 03 Apr '06

03 Apr '06

Hi all, I'm sure this is just a configuration issue, but I'm not sure where my config is wrong. I'm using boost_regex_search, and capturing subgroups. When I use this regular expression: ^(*.)a(*.) On this string: "Management" I end up with the following matches: 0==> Management 1==> Man 2==> gement Should this be returning the following matches? 0==>Management 1==>M 2==>nagement 3==>Management 4==>Man 5==>gement Or am I getting exactly what I'm supposed to be getting here? Also, the default syntax is Perl syntax, correct? Thanks!

4 3

[review] promotion traits - reminder
by Tobias Schwinger 03 Apr '06

03 Apr '06

Dear users & members of Boost, half of the scheduled review period is over and there were no reviews, so far. Therefore I want to welcome you, once again, to evaluate the proposed Boost software. The end of the review period is scheduled for April 6, so please try to post your review before then. Download URL ============ http://cpp-experiment.sourceforge.net/promote-20050917.tar.gz About the submission ==================== The Promotion Traits extend Boost.TypeTraits with templates that compute the type after promotion has been applied. Example: // given template<typename T> struct some_algorithm; template<> struct some_algorithm<int> { [...] }; // [...] more specializations // , [...] some_algorithm< typename integral_promotion<T>::type > [...] // makes some_algorithm work for any type T that promotes to an integer // (that is enums and smaller integral types) without the need for // additional specialization It's a small submission so you probably won't notice that you're working before you're done... Review questions ================ Please always explicitly state in your review, whether you think the library should be accepted into Boost. You might want to comment on the following questions: - 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, Tobias (Review Manager)

1 0

Use count callback
by Dave 03 Apr '06

03 Apr '06

Hello all, I'm using shared_ptr<foo> and would like to be notified, via a callback, when the use count for a foo object becomes > N. I wish to receive notification for no shared_ptr types other than those instantiated with foo. Is this possible? Thanks, Dave

2 1

Re: [Boost-users] [BULK] Use count callback
by Sohail Somani 03 Apr '06

03 Apr '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Dave > Sent: Monday, April 03, 2006 12:47 PM > To: boost-users(a)lists.boost.org > Subject: [BULK] [Boost-users] Use count callback > Importance: Low > > Hello all, > > I'm using shared_ptr<foo> and would like to be notified, via > a callback, > when the use count for a foo object becomes > N. I wish to receive > notification for no shared_ptr types other than those > instantiated with foo. > Is this possible? Specialize for foo? Might be kind of tedious though.

1 0

Re: [Boost-users] Serialization--a peculiar observation regarding operator<<
by Drumheller, Michael 03 Apr '06

03 Apr '06

Robert, Oliver, and Dave: That seems to have fixed it. I'm embarrassed for not having figured it out. Thank you very much. Michael P.S. This is totally off-topic, but I'd be a lot *less* embarrassed if the VC compiler error messages were not so lame. This compiler has managed to annihilate huge segments of my life with messages of the form "Could not do the right thing with an X" instead of "Could not do the right thing with an X; a Y was expected." In this case it should have said "binary '<<': no operator found which takes a right-hand operand of type 'double' (or there is no acceptable conversion to 'const double')" Just that tiny rephrasing words would have saved a lot of pain. Alas. Anyway: Thanks again you guys. --MD >>> ------------------------------ >>> >>> Message: 5 >>> Date: Mon, 3 Apr 2006 08:55:30 -0700 >>> From: "Robert Ramey" <ramey(a)rrsd.com> >>> Subject: Re: [Boost-users] Serialization--a peculiar observation >>> regardingoperator<< >>> To: boost-users(a)lists.boost.org >>> Message-ID: <e0rghh$dua$1(a)sea.gmane.org> >>> >>> hmm >>> >>> The operator ar << takes a reference to a const argument. >>> >>> It looks like the compiler is objecting to taking the >>> reference to an argument on the stack >>> >>> ar << foo(); >>> >>> which seems like a good idea to me. In this case there >>> would be no problem, but in the case where the return of >>> foo() would be a "tracked" type, this would break the >>> serialization system. >>> >>> Robert Ramey >>> Message: 1 >>> Date: Mon, 3 Apr 2006 10:33:55 +0200 >>> From: "David Klein" <d.klein(a)ascaron.com> >>> Subject: Re: [Boost-users] Serialization--a peculiar observation >>> regardingoperator<< >>> To: <boost-users(a)lists.boost.org> >>> Message-ID: >>> <D3A9DB446C206D4EA2C2CCFD637362490173A0C8(a)exchsrv.ascaron.lan> >>> Content-Type: text/plain; charset="us-ascii" >>> >>> hi michael, >>> >>> try changing: >>> >>> double foo() { return 3.1416; } >>> >>> to >>> >>> const double foo() { return 3.1416; } >>> >>> HTH dave >>> >>> Message: 2 >>> Date: Mon, 3 Apr 2006 10:39:28 +0200 >>> From: "Oliver Mutz" <mutz(a)isdcad.de> >>> Subject: Re: [Boost-users] Serialization--a peculiar observation >>> regardingoperator<< >>> To: <boost-users(a)lists.boost.org> >>> Message-ID: <001501c656fa$21bb3ed0$050aa8c0(a)int.isdcad.de> >>> Content-Type: text/plain; charset="us-ascii" >>> >>> >>> Try changing the return type of foo() to const double. >>> For the reason see the ratinale page in the serialization >>> documentation. >>> >>> Oliver >>>

1 0

[Serialization] a newbie question about retrieving objects serialized through base class pointers
by t.sammoud 03 Apr '06

03 Apr '06

Hi all, I'm trying to reuse XML archives for some purpose. I'm serializing an array of pointers to a base class (let's call it A) containing pointers to derived classes (let's call them B and C). I'm wondering how does Boost distinguish between class types (A, B and C)when deserializing from the XML archive? (Is there any information in the XML archive or elsewhere giving the class name of the serialized object?) Regards Accédez au courrier électronique de La Poste : www.laposte.net ; 3615 LAPOSTENET (0,34 /mn) ; tél : 08 92 68 13 50 (0,34/mn)

2 1

Serialization--a peculiar observation regarding operator<<
by Drumheller, Michael 03 Apr '06

03 Apr '06

The test program below (under boost 1_33, vc71) compiles fine, unless I change the "#if 1" to "#if 0", in which case it produces this: error C2679: binary '<<': no operator found which takes a right-hand operand of type 'double' (or there is no acceptable conversion) Can anyone explain why that should happen? A double is a double--why should '<<' care whether the rhs comes from funcall a variable? Note: The test program is clearly a nonsense program (in real life the role of foo() is played by some public (get-accessor) on klass--a very common pattern when doing a non-intrusive serialization). But I did not want to cloud the issue--I wanted to emphasize that the bug, if it is a bug, seems to have nothing to with klass. Thank you. Michael Drumheller -----------------------------------------------------------------begin-- ------------------------------------------------------------- #include <fstream> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/split_free.hpp> class klass {}; double foo() { return 3.1416; } namespace boost { namespace serialization { template<class Archive> void save(Archive &ar, const klass & b, const unsigned int ver) { #if 1 double x=foo(); ar << x; #else ar << foo(); #endif } template<class Archive> void load(Archive &ar, klass & b, const unsigned int ver){}//N/A for this demo }} BOOST_SERIALIZATION_SPLIT_FREE(klass); void out(const char *testfile, const klass & c) { std::ofstream ofs(testfile); boost::archive::text_oarchive oa(ofs); oa << c; } ----------------------------------------------------------------end----- ----------------------------------------------------------------- Michael Drumheller Boeing Phantom Works Mathematics and Engineering Analysis 425.865.3520 michael.drumheller(a)boeing.com

3 2

[multi_index] Serialization problem with multi_index container
by John Reid 03 Apr '06

03 Apr '06

Hi, I had some problems serializing/deserializing a multi_index container. I've tried a work around of copying the container into a vector and serializing/deserializing this (which works). Does anyone know the conditions under which serialization of multi_index containers do not work? My guess is my operator< may not satisfy the requirements although it has stood up to all the testing I have been able to do so far. I am using VS2005 with boost 1_33_1. FYI I'm getting an archive exception from this code in ordered_index.hpp: void rearranger(node_type* position,node_type *x) { node_type* before; if(!position){ before=position=lower_bound(key(x->value)).get_node(); node_type::decrement(before); } else{ before=position; node_type::increment(position); } if(position!=x){ /* check the rearrangement is consistent */ if(!in_place(x->value,position,Category())){ throw_exception( archive::archive_exception( archive::archive_exception::other_exception)); } ordered_index_node_impl::rebalance_for_erase( x->impl(),header()->parent(),header()->left(),header()->right()); ordered_index_node_impl::restore( x->impl(),before->impl(),position->impl(),header()->impl()); } } Thanks, John.

2 2

filesystem and filenames containing "+"
by Simon Lundell 03 Apr '06

03 Apr '06

Dear all, I am experiencing problems with boost::filesystem on files that contains a plus (+) sign. Below is a minimal example to test this. the line: boost::filesystem::path p_plus("filename+.txt"); throws an exception if the filename contains a plus. Any help or hints would be greatly appreciated. Best regards, Simon output: ***************** Contents of filename-.txt Filesystem error caught, reason: boost::filesystem::path: invalid name "filename+.txt" in path: "filename+.txt" ***************** source: ************* #include <iostream> #include <cstdlib> #include <boost/filesystem/path.hpp> #include <boost/filesystem/exception.hpp> #include <boost/filesystem/fstream.hpp> using namespace std; int main(int argc, char *argv[]){ try{ boost::filesystem::path p_minus("filename-.txt"); boost::filesystem::ifstream ifs_minus(p_minus,ios::in ); cout<<ifs_minus.rdbuf(); }catch ( boost::filesystem::filesystem_error const &fse){ cout << "Filesystem error caught, reason: "<<fse.what() << endl; } try{ boost::filesystem::path p_plus("filename+.txt"); boost::filesystem::ifstream ifs_plus(p_plus,ios::in ); cout<<ifs_plus.rdbuf(); }catch ( boost::filesystem::filesystem_error const &fse){ cout << "Filesystem error caught, reason: "<<fse.what() << endl; } return 0; } *****************

2 1

regex? Ok to submit simpler examples?
by Lynn Allan 03 Apr '06

03 Apr '06

<alert comment="boost and regex newbie"> Thanks for providing and supporting boost::regex. Maybe I'm the only one who finds the provided examples perhaps a bit complicated to get "up to speed" ... much of the source code is parsing the command line and then reading in a file and getting everything set up to do rather advanced functionality (or at least it seems that way to this boost newbie). I'd appreciate examples that are more "baby steps with training wheels" showing how to do the equivalent of "Hello, world". Something something like the following for regex_replace? void how_to_use_replace() { string contents("String has © twice © to be replaced."); boost::regex reg("©"); contents = boost::regex_replace(contents, reg, "©"); cout << contents << endl; // assert (contents == "String has © twice © to be replaced"); } I realize there are simpler ways to accomplish this replacement (like std::string.replace) and the above might not be "best practice", but these kind of "barebones" examples might help "flatten" the learning curve for this terrific library. </alert>

1 0

[BGL] Neighbourhood as a subgraph.
by Seweryn Habdank-Wojewódzki 03 Apr '06

03 Apr '06

Hi! Did any one check how to get neighbourhood of the node from given graph with respect to the properties or connections? Like in example below: V = { 1, 2, 3, 4, 5 }; E = { (1,2), (2,5), (5,4), (2,4), (1,4), (1,3), (3,4) }; So if there is no property, let assume that we are interesting in searching neighbourhood level 1 of point 1 we will have {1,2,3,4} level 2 {1,2,3,4,5}, but neighbourhood level 1 of point 4 is {1,2,3,4,5}. Of course I am interesting in copying proper edges too. If we have numerical properties on edges we could define (as on all problems with paths) that distance between node A and B is a sum of properties between them. And if we set adjacent matrix as 0 1 3 2 0 1 0 0 1 1 3 0 0 2 0 2 1 2 0 2 0 1 0 2 0 Than neighbourhood of level (or in that case "distance") 1 of point 1 is {1,2} level 2 {1,2,4,5}, and for point 4 level 1 {2,4}. The question is. If algorithms "breadth_first_*" will give me all functionality for that or not? Regards. -- |\/\/| Seweryn Habdank-Wojewódzki `\/\/

1 0

How to meet these cross-platform project goals?
by Matt England 03 Apr '06

03 Apr '06

Summary: I'm managing a newly-open-sourced project, and I'm looking to accomplish these goals: 1) Ensure the source packages can build on all systems 2) Ensure the application (binary) packages run on all supported systems 3) Ensure libraries we deliver integrate properly with other software projects Any feedback or guidance from this community would be greatly appreciated. I provide further details, as well as more-specific questions, below. Details: I manage a significant, C++ based software project that is on the verge of presenting an open-source format. Up until now, my group had tight control on the systems/environments (mostly Windows-MinGW, RHEL, Fedora, and Debian to this point) for which we built and tested our software. No longer; we now believe we have to support most of the worlds' systems, representing a set of very heterogeneous environments, and that's not trivial. I'm looking for feedback and guidance on what tools and paradigms are available to my C++ based, open-source project to best ensure consistent cross-platform build and execution capability. I provide my research findings and general understanding of the issues below. Thanks in advance for any help. (I plan on posting this note in a couple different email lists, forums, and newsgroups. Please forgive me if my post is not appropriate for your community. For what it's worth, I have found it difficult reaching a conclusion for this cross-platform-software-distribution issue, and I think it best to query several different communities involved with this stuff and get their combined take on the matter.) I break this issue down into these goals: 1) Ensure the source packages can build on all systems 2) Ensure the application (binary) packages run on all supported systems 3) Ensure libraries we deliver integrate properly with other software projects I write more details, including associated questions, for each one of these goals in 3 different sections of my note below. I'm looking for the best and/or most-accepted ways to solve these problems. I've done a little research (coupled with my many years of user/developer experience with similar systems facing the same problems), and the following notes reflect what I've come up with thus far. For what it's worth: our project has taken extreme care to create portable and modular C++ code and to use only the most-common and highly-portable libraries. We feel that our problem lies not in making our code more portable, but rather making our build process and our binary-distribution systems more portable. ------------------------------------------------------------------ ---- 1) Ensure the source packages can build on all systems ------ ------------------------------------------------------------------ The target stakeholder for this problem seems to be one of: a) user looking to build binaries from source, or b) a developer looking to modify the source for some reason, or c) some combination thereof. While this stakeholder set may be more knowledgeable and experienced then a general "binary-only" user, I still believe an automated system needs to check the build environment to make sure it's suitable to build my software package. This task appears to be centered on 2 basic issues: * Check that a proper compiler-and-linker system exists with all the appropriate system headers and libraries * Check availability and compatibility of "external" libraries and their headers Am I missing anything here? For what it's worth: the external libraries (besides "standard" system libraries) that we currently use include but may not be limited to the following: various Boost-C++ libraries, OpenSSL, BZip2, libpqxx, Xerces-c, and optionally ACE (<http://www.cs.wustl.edu/~schmidt/ACE.html>), libcurl, and xmlrpc-c. Up until now, we were including each library (and its associated header files) from the above toolset in a Subversion-controlled "external" directory for each platform (eg, one for MinGW, Fedora, RHEL, Debian, etc). However, we're finding that some boost libs don't work for all debian3.1 systems, etc. I suspect we are going to run into this problem more and more over time, and as such we need to let system in question provide the library that's compatible with said system (in the aforementioned case: let Debian's apt download/build the right boost library). Is my understanding correct? My project also uses an extensive and modular GNU-make Makefile system based on a core Makefile we authored that builds rules dynamically (by heavily leveraging the $(eval) function in make) based up on per-application "input" Makefiles. Further, we do not hard-code lists of source files in our Makefiles, for we auto-find the source files in each application or library subdirectory on the fly; therefore, when one adds or removes source-code files to our repos (we use Subversion, although it may not matter that much), we require no changes to the Makefiles. This system has served us well, and we're not inclined to move away from this system unless absolutely necessary. (And if we want to support single-source control of all build processes, even with non-MinGW Windows systems, we might have to move away from this to something like bakefile or CMake...but more on this in a minute.) However, I doubt the Makefile system will be robust enough to handle the nuances of truly cross-platform builds; maybe that's an understatement. The tried-and-true tool to address this seems to be autoconf, and I'm currently gearing myself up to author some autoconf-based control files. However, autoconf does not appear to address non-MinGW Windows environments. For that reason, my project is currently supporting only MinGW in Windows environments. However, I'd like to be able to "single-source control" the build process for non-autoconf-supported systems like VisualStudio systems (and to a lesser extent CodeBlocks, Dev-C++, etc...although they are a safer bet to read GNUmake Makefiles) in the future. bakefile is the only thing that I've seen that yet supports this approach. CMake (CMake?) might, but I'm not sure about VStudio; further, CMake requires that all my developer-users change their usage patterns (from './configure && make && make install') and to build and use CMake...and I'm not yet inclined to change this paradigm. A note about autoconf: I'm hoping it provides a *supplement* to my existing Makefile system, instead of replacing such system with new, auto-generated makefiles, etc. (For this and possibly other reasons I'm steering clear of using automake, as per experiences like these: <http://subversion.tigris.org/hacking.html#configury>). I'm a control freak about my build-control process, and I don't want some automated tool specifying what my build rules and dependencies are. Rather, I want autoconf (or some tool that replaces it) to simply make sure that the build environment (on said machine) is sufficient and then set the make variables accordingly as inputs to my existing make/Makefile process. Is this the way it works...or at least can work...with autoconf? Another way to ask this: can autoconf essentially be made a "slave" to the Makefile.in file? ------------------------------------------------------------------ ------ 2) Ensure the app packages run on all supported systems --- ------------------------------------------------------------------ The target stakeholder here seems to be: A "binary-only" user that simply needs to install the package and have it run, no fuss, no muss. This seems to boil down address this problem (or set of problems): making sure that all the shared-object/DLL library and other binary dependencies (like having a PostgreSQL or MySQL system installed if the system stores data in a database like ours does) are satisfied for the target operating system (and can be referenced in the appropriate binary/library "lookup" paths). And if said libraries/binaries/software can not be found, auto-downloading and installing them if necessary. Mechanisms like Fedora's yum, RHEL's up2date (hopefully I didn't get those mixed up), Debian's apt, *BSD's pkg, Solaris' pkg, etc, all seem to handle this with more or less sufficient capability. (Eg, an .rpm ".spec" file will map out the necessary rpm dependencies on a fedora/reel system.) Assuming they do, a couple questions: * Is there ever a time when I should package the binary libraries or binaries for external products (eg, OpenSSL, PostgreSQL) for my project's binary distribution? * Do tools exist where I can write one "control spec" for all the above auto-package toolsets instead of having to write a different spec for each of .rpm, .deb, BSD-pkg, etc? Separately: what does one do about Windows? What about other "non-Unix" operating systems like VMS? Do .msi-like installation packages do the work that of Debian's apt in that said system will automatically download missing library dependencies? I highly doubt it. Must my project include all the binary packages for my external libs/bins (eg, OpenSSL, PostgreSQL) in these distributions? (For what it's worth, our project currently supports MinGW-based Windows distributions of our stuff.) An additional note/question about "common" Linux binaries: For Linux flavors of my binary distribution, I'd like to be able to support a "build once, support many" paradigm. ie, if I could make one binary to support many different Linux distributions (Fedora, Debian, RHEL, SuSE, Mandiva/Mandrake, etc) and many different versions of each distribution (FC 1, 2, 3, 4, 5), I feel like I could save myself a lot of headache running different builds on all these platforms. At the very least, I'd like to not have to make a different build for every single Fedora flavor. Alas, I suspect this boils down to which "native, Linux-system" libraries does my app/apps/libraries depend on? Is there implicit kernel-level dependence in this scenario? Is it more then libc/libc++/etc? Where can I read more about this? This is the area for which I'm least experienced and knowledgeable. To be clear: I still want to make separate, "native," .rpm and .deb packages (and any other packages I need to support for Linux distros), but if they could all use the same underlying binary...and we could do this reliably and consistently with no problems...it would seem to make our life a lot easier. I see mature projects (like CMake) use one binary tarball (again, I'm not saying I'm going to distribute in a tarball-only fashion) for all Linux distros, so I'm hopeful this can be done. ------------------------------------------------------------------ -- 3) Ensure our libraries integrate w/ other software projects -- ------------------------------------------------------------------ We want to provide the core functionality of our project's technology as an "embed-able" library (either in static or dynamic-shared-object/dll fashion). The libtool section of the autoconf manual (<http://www.gnu.org/software/autoconf/manual/index.html>), quoted below, appears to sum up the issues surrounding this...I guess. I have to take libtool's word for it, for I have to experience the library distribution problems in our project that libtool says will happen. But if this helps, then we'll do it. Do any alternatives exist? But what do we do in non-MinGW Windows environments (assuming libtool works with MinGW-based systems at all)? Is there where the Windows' dlltool and similar tools come in? Can anyone point me to good reading for this on the web or elsewhere? The libtool quote as promised: "2.2 Libtool Very often, one wants to build not only programs, but libraries, so that other programs can benefit from the fruits of your labor. Ideally, one would like to produce shared (dynamically linked) libraries, which can be used by multiple programs without duplication on disk or in memory and can be updated independently of the linked programs. Producing shared libraries portably, however, is the stuff of nightmares; each system has its own incompatible tools, compiler flags, and magic incantations. Fortunately, gnu provides a solution: Libtool. Libtool handles all the requirements of building shared libraries for you, and at this time seems to be the only way to do so with any portability. It also handles many other headaches, such as: the interaction of Makefile rules with the variable suffixes of shared libraries, linking reliably with shared libraries before they are installed by the superuser, and supplying a consistent versioning system (so that different versions of a library can be installed or upgraded without breaking binary compatibility)." -Matt --------------------------------------------------------------------- To unsubscribe, e-mail: users-unsubscribe(a)subversion.tigris.org For additional commands, e-mail: users-help(a)subversion.tigris.org

2 1

multi index sidx.relocate(sidx.end(), si) performance, legality
by bert hubert 03 Apr '06

03 Apr '06

Hi People, Does anybody know if the code below, which relocates an interator to the end() of an index, is legal? I tried delving into the multi_index code but it is over my head. I ask this because begin() is typically valid as an iterator, but end() never is. The code does appear to work. Also, would it be expensive? I think relocating in a sequenced index is about as expensive as swapping pointers, but I'm not sure. The code: typedef multi_index_container< CacheEntry, indexed_by < ordered_unique< composite_key< CacheEntry, member<CacheEntry,string,&CacheEntry::d_qname>, member<CacheEntry,uint16_t,&CacheEntry::d_qtype> > >, ordered_non_unique<const_mem_fun<CacheEntry,uint32_t,&CacheEntry::getTTD> >, sequenced<> > > cache_t; cache_t d_cache; // i is given and a valid iterator to the composite key typedef cache_t::nth_index<2>::type sequence_t; sequence_t& sidx=d_cache.get<2>(); sequence_t::iterator si=d_cache.project<2>(i); sidx.relocate(sidx.end(), si); // does this work? -- http://www.PowerDNS.com Open source, database driven DNS Software http://netherlabs.nl Open and Closed source services

2 1

boost::bind to member variables
by Nico Galoppo 03 Apr '06

03 Apr '06

Hi, what kind of object does boost::bind return when binding to a class member variable ? (as opposed to a member method). Is it a function object too? More in particular, I would like to write a generic free function that applies an operation on a particular member variable, passed in with boost::bind. Something like this: struct A { int value; }; void f(bind_return_type& membervar) { membervar = 3; } A a; f(bind(&A::value, a)); Thanks. --nico -- nico galoppo von borries | address: 105 creel st., chapel hill comp. graphics phd. student | north carolina, 27516 USA UNC, chapel hill | phone: +1 (919) 962-1898 (office) | +1 (919) 942-7609 (home) | email: nico at cs dot unc dot edu | homepage: http://www.ngaloppo.org

4 9

dereferencing cursors
by Louis Lavery 03 Apr '06

03 Apr '06

Hello, I've been reading "The Cursor/Property Map Abstraction" Doc.No: N1873=05-0133 by Dietmar Kühl and David Abrahams. I like the idea of cursors, they're so much simpler than C++ iterators, but I am concerned regarding dereferencing a cursor. Here's the relevant paragraph... "The presence of a dereference operator on cursors might seem strange, since since the goal is to separate access from traversal. For instance, the values of a property map could be read as pm(c) instead of pm(*c). It turns out that the dereference operation is required in order to reasonably support traversal adapters. If you have a property map that accepts foo_cursor arguments, it may not be designed to accept a reverse_cursor<foo_cursor> directly. Like so many others, this problem is solved by adding a level of indirection: dereferencing a cursor yields an intermediate key, and the key type of a traversal adapter is the same as that of its underlying iterator." ...and my concern is that if all cursors yield the same key type then this could lead to hard to find bugs. EG. Suppose we have a property map (pm) of Ts and that it's useful to reverse it but that reversing it requires reversing the Ts[1], not just applying a reverse cursor. I guess we'd wrap pm in a reversed property map (rpm) that supplies its own cursors (rc), some thing like... t = pm(*c); // forward access t = rpm(*rc); // reversed access - returns reversed t ...but, of course, there's nothing to stop... t = pm(*rc); t = rpm(*c); But may be there are other advantages that outweight this drawback? I'd be interested to know. Also, has there been any further work on the proposal? Thanks, Louis. [1] EG. Reversing a 2D curve made from arcs of circles could well require reversing the direction of the returned arcs.

2 1

[format][patch][1.33.1][SunPro11] missing static_cast from void* to char*
by Marc Mutz 03 Apr '06

03 Apr '06

Hi, SunPro (tested: v11, with current patches), needs the attached patch to compile the following code: --code-- using boost::format; using boost::str; void foo( const std::string & ); format fmt( "host=%1%,port=%2%" ); const std::string host = ...; const unsigned short port = ...; foo( str( fmt % host % port ) ); --/code-- --- /opt/boost/cc/1.33.1/include/boost-1_33_1/boost/format/alt_sstream_impl.hpp~ Sun Feb 27 03:06:57 2005 +++ /opt/boost/cc/1.33.1/include/boost-1_33_1/boost/format/alt_sstream_impl.hpp Mon Apr 24 18:07:09 2006 @@ -245,7 +245,7 @@ add_size /= 2; if(0 < add_size) { new_size += add_size; - newptr = alloc_.allocate(new_size, is_allocated_? oldptr : 0); + newptr = static_cast<Ch*>(alloc_.allocate(new_size, is_allocated_? oldptr : 0)); } if(0 < prev_size) Thanks, Marc PS: Regarding the API: I don't much like the fact that format::operator% changes the format instance. I would have liked to write "static const format" in the code snippet above. Feels more natural ("do as the ints do"). I see where the design comes from (speed optimization), but speed shouldn't dictate design. Expression templates could be used to speed up the process. -- Marc Mutz -- marc(a)klaralvdalens-datakonsult.se, mutz(a)kde.org Klarälvdalens Datakonsult AB, Platform-independent software solutions

1 0

Re: [Boost-users] Serialization--a peculiar observation regardingoperator<<
by David Klein 03 Apr '06

03 Apr '06

boost-users-bounces(a)lists.boost.org wrote: > The test program below (under boost 1_33, vc71) compiles fine, unless > I change the "#if 1" to "#if 0", in which case it produces this: > error C2679: binary '<<': no operator found which takes a right-hand > operand of type 'double' (or there is no acceptable conversion) > > Can anyone explain why that should happen? A double is a double--why > should '<<' care whether the rhs comes from funcall a variable? > > Note: The test program is clearly a nonsense program (in real life > the role of foo() is played by some public (get-accessor) on klass--a > very common pattern when doing a non-intrusive serialization). But I > did not want to cloud the issue--I wanted to emphasize that the bug, > if it is a bug, seems to have nothing to with klass. > > Thank you. > > Michael Drumheller > -----------------------------------------------------------------begin-- > ------------------------------------------------------------- > #include <fstream> > #include <boost/archive/text_oarchive.hpp> > #include <boost/serialization/split_free.hpp> > class klass {}; > double foo() { return 3.1416; } > namespace boost { namespace serialization { > template<class Archive> > void save(Archive &ar, const klass & b, const unsigned int > ver) > { > #if 1 > double x=foo(); > ar << x; > #else > ar << foo(); > #endif > } > template<class Archive> > void load(Archive &ar, klass & b, const unsigned int > ver){}//N/A for this demo > }} > BOOST_SERIALIZATION_SPLIT_FREE(klass); > void out(const char *testfile, const klass & c) > { > std::ofstream ofs(testfile); > boost::archive::text_oarchive oa(ofs); > oa << c; > } > ----------------------------------------------------------------end----- > ----------------------------------------------------------------- > Michael Drumheller > Boeing Phantom Works > Mathematics and Engineering Analysis > 425.865.3520 michael.drumheller(a)boeing.com > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users hi michael, try changing: double foo() { return 3.1416; } to const double foo() { return 3.1416; } HTH dave

1 0

Regex question
by Kyle Alons 03 Apr '06

03 Apr '06

std::string in("hello"); std::string exprStr("(.*)"); std::string replStr("goodbye$1"); boost::regex expr(exprStr); std::string out(boost::regex_replace(in, expr, replStr)); printf("%s", out.c_str()); In Boost 1.31, this outputs "goodbyehello". In 1.32+, it outputs "goodbyehellogoodbye". Is it a bug, a by-design breaking change, or? Thanks. -- --------------------- Kyle Alons http://www.kinook.com

2 1

Minimal installation with smart pointers only
by Mateusz Łoskot 02 Apr '06

02 Apr '06

Hi, Today, I tried to extract smart pointers library from Boost tree using bcp tool. Everything seems to work well: 1. I checkouted latest Boost CVS 2. I build bcp without any problems, using VC++ 8.0 3. I run bcp --cvs --list to see how many files are related to smart_ptr.hpp (and shared_ptr.hpp too). 4. Finally, I extracted smart pointers library: d:\boost_cvs> bcp --cvs smart_ptr.hpp d:\tmp\boost-smart_ptr Next, I compiled some examples using this extraction and everything works well. My only question is if this is normal that smart_ptr extraction weight is about 2.8MB ? Are there any options that can be used to make this package smaller? Here is a linsg (looong) of files that I got copied during the extraction process. Could anyone take a look at it and see if there are some files not used which can be safely removed? //////////////////////////////////////////////////////// // START OF THE LIST ./boost/assert.hpp ./boost/checked_delete.hpp ./boost/config ./boost/config/abi ./boost/config/abi/borland_prefix.hpp ./boost/config/abi/borland_suffix.hpp ./boost/config/abi/msvc_prefix.hpp ./boost/config/abi/msvc_suffix.hpp ./boost/config/abi_prefix.hpp ./boost/config/abi_suffix.hpp ./boost/config/auto_link.hpp ./boost/config/compiler ./boost/config/compiler/borland.hpp ./boost/config/compiler/comeau.hpp ./boost/config/compiler/common_edg.hpp ./boost/config/compiler/compaq_cxx.hpp ./boost/config/compiler/digitalmars.hpp ./boost/config/compiler/gcc.hpp ./boost/config/compiler/gcc_xml.hpp ./boost/config/compiler/greenhills.hpp ./boost/config/compiler/hp_acc.hpp ./boost/config/compiler/intel.hpp ./boost/config/compiler/kai.hpp ./boost/config/compiler/metrowerks.hpp ./boost/config/compiler/mpw.hpp ./boost/config/compiler/sgi_mipspro.hpp ./boost/config/compiler/sunpro_cc.hpp ./boost/config/compiler/vacpp.hpp ./boost/config/compiler/visualc.hpp ./boost/config/no_tr1 ./boost/config/no_tr1/complex.hpp ./boost/config/no_tr1/functional.hpp ./boost/config/no_tr1/memory.hpp ./boost/config/no_tr1/utility.hpp ./boost/config/platform ./boost/config/platform/aix.hpp ./boost/config/platform/amigaos.hpp ./boost/config/platform/beos.hpp ./boost/config/platform/bsd.hpp ./boost/config/platform/cygwin.hpp ./boost/config/platform/hpux.hpp ./boost/config/platform/irix.hpp ./boost/config/platform/linux.hpp ./boost/config/platform/macos.hpp ./boost/config/platform/qnxnto.hpp ./boost/config/platform/solaris.hpp ./boost/config/platform/win32.hpp ./boost/config/posix_features.hpp ./boost/config/requires_threads.hpp ./boost/config/select_compiler_config.hpp ./boost/config/select_platform_config.hpp ./boost/config/select_stdlib_config.hpp ./boost/config/stdlib ./boost/config/stdlib/dinkumware.hpp ./boost/config/stdlib/libcomo.hpp ./boost/config/stdlib/libstdcpp3.hpp ./boost/config/stdlib/modena.hpp ./boost/config/stdlib/msl.hpp ./boost/config/stdlib/roguewave.hpp ./boost/config/stdlib/sgi.hpp ./boost/config/stdlib/stlport.hpp ./boost/config/stdlib/vacpp.hpp ./boost/config/suffix.hpp ./boost/config/user.hpp ./boost/config.hpp ./boost/current_function.hpp ./boost/detail ./boost/detail/atomic_count.hpp ./boost/detail/atomic_count_gcc.hpp ./boost/detail/atomic_count_pthreads.hpp ./boost/detail/atomic_count_win32.hpp ./boost/detail/bad_weak_ptr.hpp ./boost/detail/interlocked.hpp ./boost/detail/lightweight_mutex.hpp ./boost/detail/lwm_nop.hpp ./boost/detail/lwm_pthreads.hpp ./boost/detail/lwm_win32_cs.hpp ./boost/detail/quick_allocator.hpp ./boost/detail/shared_array_nmt.hpp ./boost/detail/shared_count.hpp ./boost/detail/shared_ptr_nmt.hpp ./boost/detail/sp_counted_base.hpp ./boost/detail/sp_counted_base_cw_ppc.hpp ./boost/detail/sp_counted_base_gcc_ia64.hpp ./boost/detail/sp_counted_base_gcc_ppc.hpp ./boost/detail/sp_counted_base_gcc_x86.hpp ./boost/detail/sp_counted_base_nt.hpp ./boost/detail/sp_counted_base_pt.hpp ./boost/detail/sp_counted_base_w32.hpp ./boost/detail/sp_counted_impl.hpp ./boost/detail/workaround.hpp ./boost/enable_shared_from_this.hpp ./boost/intrusive_ptr.hpp ./boost/mpl ./boost/mpl/aux_ ./boost/mpl/aux_/adl_barrier.hpp ./boost/mpl/aux_/arity.hpp ./boost/mpl/aux_/config ./boost/mpl/aux_/config/adl.hpp ./boost/mpl/aux_/config/arrays.hpp ./boost/mpl/aux_/config/ctps.hpp ./boost/mpl/aux_/config/dtp.hpp ./boost/mpl/aux_/config/eti.hpp ./boost/mpl/aux_/config/gcc.hpp ./boost/mpl/aux_/config/integral.hpp ./boost/mpl/aux_/config/intel.hpp ./boost/mpl/aux_/config/lambda.hpp ./boost/mpl/aux_/config/msvc.hpp ./boost/mpl/aux_/config/nttp.hpp ./boost/mpl/aux_/config/overload_resolution.hpp ./boost/mpl/aux_/config/preprocessor.hpp ./boost/mpl/aux_/config/static_constant.hpp ./boost/mpl/aux_/config/ttp.hpp ./boost/mpl/aux_/config/workaround.hpp ./boost/mpl/aux_/integral_wrapper.hpp ./boost/mpl/aux_/lambda_arity_param.hpp ./boost/mpl/aux_/lambda_support.hpp ./boost/mpl/aux_/na.hpp ./boost/mpl/aux_/na_fwd.hpp ./boost/mpl/aux_/na_spec.hpp ./boost/mpl/aux_/nttp_decl.hpp ./boost/mpl/aux_/preprocessor ./boost/mpl/aux_/preprocessor/def_params_tail.hpp ./boost/mpl/aux_/preprocessor/enum.hpp ./boost/mpl/aux_/preprocessor/filter_params.hpp ./boost/mpl/aux_/preprocessor/params.hpp ./boost/mpl/aux_/preprocessor/sub.hpp ./boost/mpl/aux_/preprocessor/tuple.hpp ./boost/mpl/aux_/static_cast.hpp ./boost/mpl/aux_/template_arity_fwd.hpp ./boost/mpl/aux_/value_wknd.hpp ./boost/mpl/aux_/yes_no.hpp ./boost/mpl/bool.hpp ./boost/mpl/bool_fwd.hpp ./boost/mpl/if.hpp ./boost/mpl/int.hpp ./boost/mpl/integral_c.hpp ./boost/mpl/integral_c_fwd.hpp ./boost/mpl/integral_c_tag.hpp ./boost/mpl/int_fwd.hpp ./boost/mpl/lambda_fwd.hpp ./boost/mpl/limits ./boost/mpl/limits/arity.hpp ./boost/mpl/size_t.hpp ./boost/mpl/size_t_fwd.hpp ./boost/mpl/void_fwd.hpp ./boost/non_type.hpp ./boost/preprocessor ./boost/preprocessor/arithmetic ./boost/preprocessor/arithmetic/add.hpp ./boost/preprocessor/arithmetic/dec.hpp ./boost/preprocessor/arithmetic/inc.hpp ./boost/preprocessor/arithmetic/sub.hpp ./boost/preprocessor/array ./boost/preprocessor/array/data.hpp ./boost/preprocessor/array/elem.hpp ./boost/preprocessor/array/size.hpp ./boost/preprocessor/cat.hpp ./boost/preprocessor/comma_if.hpp ./boost/preprocessor/config ./boost/preprocessor/config/config.hpp ./boost/preprocessor/control ./boost/preprocessor/control/detail ./boost/preprocessor/control/detail/dmc ./boost/preprocessor/control/detail/dmc/while.hpp ./boost/preprocessor/control/detail/edg ./boost/preprocessor/control/detail/edg/while.hpp ./boost/preprocessor/control/detail/msvc ./boost/preprocessor/control/detail/msvc/while.hpp ./boost/preprocessor/control/detail/while.hpp ./boost/preprocessor/control/expr_iif.hpp ./boost/preprocessor/control/if.hpp ./boost/preprocessor/control/iif.hpp ./boost/preprocessor/control/while.hpp ./boost/preprocessor/debug ./boost/preprocessor/debug/error.hpp ./boost/preprocessor/detail ./boost/preprocessor/detail/auto_rec.hpp ./boost/preprocessor/detail/check.hpp ./boost/preprocessor/detail/dmc ./boost/preprocessor/detail/dmc/auto_rec.hpp ./boost/preprocessor/detail/is_binary.hpp ./boost/preprocessor/empty.hpp ./boost/preprocessor/enum_params.hpp ./boost/preprocessor/facilities ./boost/preprocessor/facilities/empty.hpp ./boost/preprocessor/facilities/identity.hpp ./boost/preprocessor/identity.hpp ./boost/preprocessor/inc.hpp ./boost/preprocessor/iterate.hpp ./boost/preprocessor/iteration ./boost/preprocessor/iteration/detail ./boost/preprocessor/iteration/detail/bounds ./boost/preprocessor/iteration/detail/bounds/lower1.hpp ./boost/preprocessor/iteration/detail/bounds/lower2.hpp ./boost/preprocessor/iteration/detail/bounds/lower3.hpp ./boost/preprocessor/iteration/detail/bounds/lower4.hpp ./boost/preprocessor/iteration/detail/bounds/lower5.hpp ./boost/preprocessor/iteration/detail/bounds/upper1.hpp ./boost/preprocessor/iteration/detail/bounds/upper2.hpp ./boost/preprocessor/iteration/detail/bounds/upper3.hpp ./boost/preprocessor/iteration/detail/bounds/upper4.hpp ./boost/preprocessor/iteration/detail/bounds/upper5.hpp ./boost/preprocessor/iteration/detail/finish.hpp ./boost/preprocessor/iteration/detail/iter ./boost/preprocessor/iteration/detail/iter/forward1.hpp ./boost/preprocessor/iteration/detail/iter/forward2.hpp ./boost/preprocessor/iteration/detail/iter/forward3.hpp ./boost/preprocessor/iteration/detail/iter/forward4.hpp ./boost/preprocessor/iteration/detail/iter/forward5.hpp ./boost/preprocessor/iteration/detail/iter/reverse1.hpp ./boost/preprocessor/iteration/detail/iter/reverse2.hpp ./boost/preprocessor/iteration/detail/iter/reverse3.hpp ./boost/preprocessor/iteration/detail/iter/reverse4.hpp ./boost/preprocessor/iteration/detail/iter/reverse5.hpp ./boost/preprocessor/iteration/detail/local.hpp ./boost/preprocessor/iteration/detail/rlocal.hpp ./boost/preprocessor/iteration/detail/self.hpp ./boost/preprocessor/iteration/detail/start.hpp ./boost/preprocessor/iteration/iterate.hpp ./boost/preprocessor/iteration/local.hpp ./boost/preprocessor/iteration/self.hpp ./boost/preprocessor/list ./boost/preprocessor/list/adt.hpp ./boost/preprocessor/list/append.hpp ./boost/preprocessor/list/detail ./boost/preprocessor/list/detail/dmc ./boost/preprocessor/list/detail/dmc/fold_left.hpp ./boost/preprocessor/list/detail/edg ./boost/preprocessor/list/detail/edg/fold_left.hpp ./boost/preprocessor/list/detail/edg/fold_right.hpp ./boost/preprocessor/list/detail/fold_left.hpp ./boost/preprocessor/list/detail/fold_right.hpp ./boost/preprocessor/list/fold_left.hpp ./boost/preprocessor/list/fold_right.hpp ./boost/preprocessor/list/for_each_i.hpp ./boost/preprocessor/list/reverse.hpp ./boost/preprocessor/list/transform.hpp ./boost/preprocessor/logical ./boost/preprocessor/logical/and.hpp ./boost/preprocessor/logical/bitand.hpp ./boost/preprocessor/logical/bool.hpp ./boost/preprocessor/logical/compl.hpp ./boost/preprocessor/punctuation ./boost/preprocessor/punctuation/comma.hpp ./boost/preprocessor/punctuation/comma_if.hpp ./boost/preprocessor/repeat.hpp ./boost/preprocessor/repetition ./boost/preprocessor/repetition/detail ./boost/preprocessor/repetition/detail/dmc ./boost/preprocessor/repetition/detail/dmc/for.hpp ./boost/preprocessor/repetition/detail/edg ./boost/preprocessor/repetition/detail/edg/for.hpp ./boost/preprocessor/repetition/detail/for.hpp ./boost/preprocessor/repetition/detail/msvc ./boost/preprocessor/repetition/detail/msvc/for.hpp ./boost/preprocessor/repetition/enum_params.hpp ./boost/preprocessor/repetition/for.hpp ./boost/preprocessor/repetition/repeat.hpp ./boost/preprocessor/slot ./boost/preprocessor/slot/detail ./boost/preprocessor/slot/detail/counter.hpp ./boost/preprocessor/slot/detail/def.hpp ./boost/preprocessor/slot/detail/shared.hpp ./boost/preprocessor/slot/detail/slot1.hpp ./boost/preprocessor/slot/detail/slot2.hpp ./boost/preprocessor/slot/detail/slot3.hpp ./boost/preprocessor/slot/detail/slot4.hpp ./boost/preprocessor/slot/detail/slot5.hpp ./boost/preprocessor/slot/slot.hpp ./boost/preprocessor/tuple ./boost/preprocessor/tuple/eat.hpp ./boost/preprocessor/tuple/elem.hpp ./boost/preprocessor/tuple/rem.hpp ./boost/preprocessor/tuple/to_list.hpp ./boost/scoped_array.hpp ./boost/scoped_ptr.hpp ./boost/shared_array.hpp ./boost/shared_ptr.hpp ./boost/smart_ptr.hpp ./boost/static_assert.hpp ./boost/throw_exception.hpp ./boost/type.hpp ./boost/type_traits ./boost/type_traits/add_reference.hpp ./boost/type_traits/alignment_of.hpp ./boost/type_traits/broken_compiler_spec.hpp ./boost/type_traits/config.hpp ./boost/type_traits/detail ./boost/type_traits/detail/bool_trait_def.hpp ./boost/type_traits/detail/bool_trait_undef.hpp ./boost/type_traits/detail/cv_traits_impl.hpp ./boost/type_traits/detail/false_result.hpp ./boost/type_traits/detail/ice_and.hpp ./boost/type_traits/detail/ice_eq.hpp ./boost/type_traits/detail/ice_not.hpp ./boost/type_traits/detail/ice_or.hpp ./boost/type_traits/detail/is_function_ptr_helper.hpp ./boost/type_traits/detail/is_function_ptr_tester.hpp ./boost/type_traits/detail/is_mem_fun_pointer_impl.hpp ./boost/type_traits/detail/is_mem_fun_pointer_tester.hpp ./boost/type_traits/detail/size_t_trait_def.hpp ./boost/type_traits/detail/size_t_trait_undef.hpp ./boost/type_traits/detail/template_arity_spec.hpp ./boost/type_traits/detail/type_trait_def.hpp ./boost/type_traits/detail/type_trait_undef.hpp ./boost/type_traits/detail/wrap.hpp ./boost/type_traits/detail/yes_no_type.hpp ./boost/type_traits/ice.hpp ./boost/type_traits/integral_constant.hpp ./boost/type_traits/intrinsics.hpp ./boost/type_traits/is_abstract.hpp ./boost/type_traits/is_arithmetic.hpp ./boost/type_traits/is_array.hpp ./boost/type_traits/is_class.hpp ./boost/type_traits/is_convertible.hpp ./boost/type_traits/is_enum.hpp ./boost/type_traits/is_float.hpp ./boost/type_traits/is_function.hpp ./boost/type_traits/is_integral.hpp ./boost/type_traits/is_member_function_pointer.hpp ./boost/type_traits/is_member_pointer.hpp ./boost/type_traits/is_pod.hpp ./boost/type_traits/is_pointer.hpp ./boost/type_traits/is_polymorphic.hpp ./boost/type_traits/is_reference.hpp ./boost/type_traits/is_same.hpp ./boost/type_traits/is_scalar.hpp ./boost/type_traits/is_union.hpp ./boost/type_traits/is_void.hpp ./boost/type_traits/remove_cv.hpp ./boost/type_traits/remove_reference.hpp ./boost/type_traits/type_with_alignment.hpp ./boost/version.hpp ./boost/weak_ptr.hpp ./libs/smart_ptr ./libs/smart_ptr/src ./libs/smart_ptr/src/sp_collector.cpp ./libs/smart_ptr/src/sp_debug_hooks.cpp // END OF THE LIST //////////////////////////////////////////////////////// Thanks in advance -- Mateusz Łoskot http://mateusz.loskot.net

3 4

multi_array operations.
by chun ping wang 01 Apr '06

01 Apr '06

2 question: Hi, i would like to know are there any easy way to do multi_array math operation on ones of same dimension and size.. #include <boost/multi_array.hpp> template <class T, int N> typename DimArray<T, N>::ndimarr array_minus(const typename DimArray<T, N>::ndimarr& A, const typename DimArray<T, N>::ndimarr& B) { typename DimArray<T, N>::ndimarr temp(A); typedef typename DimArray<T, N>::size TDS; const TDS outer_sz(A.size()); const TDS inner_sz(A[0].size()); for (TDS i = 0; i < outer_sz; ++i) { for (TDS j = 0; j < inner_sz; ++j) { temp[i][j] -= B[i][j]; } } return temp; } question 2: How do you find a index of an item where a specify condition is true. given this... template <class T> bool isSafe(const typename DimArray<T, 2>::ndimarr& MAX, const typename DimArray<T, 2>::ndimarr& Alloc, const typename DimArray<T, 2>::ndimarr& Need, const typename DimArray<T, 1>::ndimarr& Available) { typename DimArray<T, 1>::ndimarr Work(Available); typename DimArray<bool, 1>::ndimarr Finish(boost::extents[Need[0].size()]); typedef typename DimArray<T, 2>::size TDS; const TDS outer_sz(MAX.size()); const TDS inner_sz(MAX[0].size()); for(TDS i = 0; i < inner_sz; ++i) Finish[i] = false; } Is there a effective and safe way to find i such that Need[i] <= Work other than a loop. Thanks for the help.

1 0

[review] promotion traits
by Tobias Schwinger 01 Apr '06

01 Apr '06

The review of Alexander Nasonov's Promotion Traits start today. Since it's a small contribution it will be fast-track reviewed and the end of the review period is scheduled for April 6. Download URL ============ http://cpp-experiment.sourceforge.net/promote-20050917.tar.gz About the submission ==================== The Promotion Traits extend Boost.TypeTraits with templates that compute the type after promotion has been applied. Example: // given template<typename T> struct some_algorithm; template<> struct some_algorithm<int> { [...] }; // [...] more specializations // , [...] some_algorithm< typename integral_promotion<T>::type > [...] // makes some_algorithm work for any type T that promotes to an integer // (that is enums and smaller integral types) without the need for // additional specialization Review questions ================ Please always explicitly state in your review, whether you think the library should be accepted into Boost. You might want to comment on the following questions: - 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, Tobias (Review Manager)

1 0

[serialization]problem with tree-structure
by heinz meier 01 Apr '06

01 Apr '06

Hello! I want to serialize a self made tree-data-structure. It consists of nodes which are conected via pointers to other nodes. I can serialize an object that contains only one of these nodes. But when i connect other nodes via pointers to that node i get a segmentation fault when i try to serialize that. I read the "Serializable Concept" in the Reference that says that it should work and i assume that i implemented the serialization-libary correct, because it works for a single node... I have no idea what can be wrong. So can someone help me please? I'm using the "libboost_serialization-gcc-1_33_1" libary and gcc 3.3.5 -- E-Mails und Internet immer und �berall! 1&1 PocketWeb, perfekt mit GMX: http://www.gmx.net/de/go/pocketweb

3 3

Serialization creates huge object file
by Zoltan Szatmary 31 Mar '06

31 Mar '06

Dear Robert, I have been using the serialization lib for a while. I already wrote some mail to this list as you might remember. I was quite satisfied with its performance and ease of use, but now there is a problem I cannot solve. I need to serialize/deserialize some 50 polymorphic classes, so I do BOOST_CLASS_EXPORT them. I put all the serialization related logic into one definition (.cpp) file. I only use two types of archives, xml_iarchive and xml_oarchive. Now, when I compile the file with Intel compiler v8.2 on an Itanium based machine and with debug info the result is a huge (>42MB) object file, which ld (the linker) simply refuses to link. I am quite sure that the size of the object file is the problem. I tried to separate the xml_iarchive related code to one .cpp file and the xml_oarchive related code to an another, but of course this means that export.hpp is included to both, which results in multiple definitions error when trying to link the two object files together. Could you suggest any solution? Thank you very much in advance Zoltan Szatmary

3 3

Re: [Boost-users] Problems compiling Serialisation libs because o f Spirit problem
by James Hughes 31 Mar '06

31 Mar '06

Hi Joel. > -----Original Message----- > From: Joel de Guzman [mailto:joel@boost-consulting.com] > Sent: 30 March 2006 23:43 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Problems compiling Serialisation > libs because > o f Spirit problem > > > > The spirit list is the proper venue for spirit related questions. > spirit-general(a)lists.sourceforge.net. Will try there. > > Anyway... I am not sure what the workaround is here. I do not > have access to g++3.4.3. We've tested against all versions of > g++ (including 2.95.3 for Spirit 1.6.x) and I don't recall > any problems. I am currently testing against 3.4.4 and I see > no problems. Do you have a minimal cpp test file I can try? > Perhaps posting the compiler errors might help. One of the errors (all errors seem to relate to this one area) was included in the previous post on the subject, but it is just a build of boost, without any of my code anywhere near! Not sure an example is necessary, it's all boost library code. I am thinking it must be something to do with cross compiling (x86 host compiling to ARM code), but cannot see why it should be. My (previously limited) template understanding is improving rapidly, trying to figure out how this stuff works! James

2 1

Re: [Boost-users] Problems compiling Serialisation libs because o f Spirit problem
by James Hughes 30 Mar '06

30 Mar '06

Some more information on this... Looking at the headers that give the error, there appears to be an issue with the result types returned from parsers.... boost/spirit/core/parser.hpp template <typename DerivedT> struct parser { typedef DerivedT embed_t; typedef DerivedT derived_t; typedef plain_parser_category parser_category_t; template <typename ScannerT> struct result { typedef typename match_result<ScannerT, nil_t>::type type; }; boost/spirit/core/primitives/numerics.hpp struct sign_parser : public parser<sign_parser> { typedef sign_parser self_t; template <typename ScannerT> struct result { typedef typename match_result<ScannerT, bool>::type type; }; The derived sign_parser class appears to want to 'override' the base class struct result, but instead the compiler is giving an error. This would appear to be a compiler fault, but I could be way off there - depends whether this compiles in other circumstances!! I am still at loss to fix this so all help gratefully received! James > -----Original Message----- > From: James Hughes [mailto:JHughes@Linx.co.uk] > Sent: 30 March 2006 11:34 > To: 'boost-users(a)lists.boost.org' > Subject: [Boost-users] Problems compiling Serialisation libs > because of > Spirit problem > > > Hello all, > > I reported some time ago an issue with trying to compile the > Boost libs > using an ARM cross compiler. > > This has just started to have an impact as I wish to try out the > Serialisation libs, and these are one of the areas with a > compile issue. > > The following error is repeated over a considerable number of > files and > seems to indicate a problem with Spirit. > > I am using the latest release version of Boost (1.33.1)- no > patches (are > there any?) and a gcc v3.4.3 cross compiler to ARM architecture. > > Does anyone have any suggestions? I have had no luck figuring > it out, but to > be honest haven't spent a lot of time on it yet. > > Rgds > > James

2 1

portable uuid generator
by Tim Blechmann 30 Mar '06

30 Mar '06

hi all, working on a crossplatform program at the moment, i'm in need of a portable uuid generator ... currently, i'm using libuuid on linux and i read through the msdn about generating gid, but if there's a uuid class (maybe in boost?) that already does it, it would handy ... thanks ... tim -- TimBlechmann(a)gmx.de ICQ: 96771783 http://www.mokabar.tk You can play a shoestring if you're sincere John Coltrane

5 12

Re: [Boost-users] Using BOOST_STRING_TRIM_HPP to check whethertrim_copy() is available?
by Sohail Somani 30 Mar '06

30 Mar '06

> Hi, > > I've got a header that I'd like to use in both application that use > Boost and in ones that don't. > Is there a define I can use to check whether Boost is available? > In particular, I wish to use boost::trim_copy, but I don't want to > force all files that include my header to use Boost. I'm guessing BOOST_VERSION should be enough. I think all non-trivial boost headers end up including this, but I'm not 100%.

1 0

Using BOOST_STRING_TRIM_HPP to check whether trim_copy() is available?
by Olaf van der Spek 30 Mar '06

30 Mar '06

Hi, I've got a header that I'd like to use in both application that use Boost and in ones that don't. Is there a define I can use to check whether Boost is available? In particular, I wish to use boost::trim_copy, but I don't want to force all files that include my header to use Boost. Olaf

1 0

Re: [Boost-users] Serialization library question
by wayne.x.liu＠jpmchase.com 30 Mar '06

30 Mar '06

Well, I guess I'll work around it for gcc by using register_type(). Wayne ------------------------------ Message: 6 Date: Wed, 29 Mar 2006 20:39:57 -0800 From: "Robert Ramey" <ramey(a)rrsd.com> Subject: Re: [Boost-users] Serialization library question To: boost-users(a)lists.boost.org Message-ID: <e0fnef$aus$1(a)sea.gmane.org> I compiled, linked and executed this exact program on my VC 7.1 setup. I had no problems of any kind Robert Ramey

1 0

[type_traits][regex] VC++ __fastcall /clr
by Edward Diener 30 Mar '06

30 Mar '06

When compiling managed code in VC++ .NET, which is any of the /clr compiler options, the programmer can mix both CLR classes and regular C++ classes. In the regular C++ classes, Boost should work fine. The VC++ macro which tells one that managed code of any kind is being compiled is _MANAGED, which is defined if managed code is being compiled else it is not defined. So when any of the /clr compiler options are being used _MANAGED is defined, else it is not defined. The VC++ compiler issues compiler warning C4561 whenever managed code is being compiled and __fastcall shows up as a calling convention in any way. Obviously the programmer can turn off this warning via a VC++ #pragma, but I am wondering if Boost could not change some of its headers to avoid this warning. In Boost bind and mem_fn, the programmer has to specifically ask for __fastcall support via special Boost macros to have any functions declared with the __fastcall calling convention, so nothing should be done there since it is clearly a programming error if he does so while compiling managed code. However there are two other places in Boost which I have discovered where functions with the __fastcall calling convention are declared without the programmer doing anything. The first, and most cumbersome reagrding warning messages, is in type_traits in the helper header files type_traits\detail\is_mem_fun_pointer_tester.hpp and type_traits\detail\is_function_pointer_tester.hpp. Since many other libraries, lambda in my case recently, uses type_traits, might not these headers be changed so that when VC++ is the compiler and _MANAGED is defined, the __fastcall versions of these helper functions are not declared ? The second, which I have not encountered but which I saw while searching through Boost header code, is in regex\config.h and I do not know, given some other macros there, whether BOOST_REGEX_CALL can ever be __fastcall when compiling with /clr, but if it can perhaps a change can be made there also. I know that it is not the purpose of Boost to try to accomodate C++ .NET programmers creating /clr compilations using Boost, especially when just warnings and not errors are issued. But in this case, using the predefined macro _MANAGED in VC++ and BOOST_MSVC, it would seem this acoomodation could be made. So I would like the Boost developers of type_traits, especially since it is used by so many other Boost libraries, and regex to consider it.

2 1

boost program options cannot accept hex number
by Peng Yu 30 Mar '06

30 Mar '06

I tried to supply a hex number to an unsigned long integer. But it fails. ("code", po::value<unsigned long>(), "Via pattern code") Error message: in option 'code': invalid option value '0x5A' Could you please let me if it is possible to input a hex form integer in the command line? Thanks, Peng

2 1

Problems compiling Serialisation libs because of Spirit problem
by James Hughes 30 Mar '06

30 Mar '06

Hello all, I reported some time ago an issue with trying to compile the Boost libs using an ARM cross compiler. This has just started to have an impact as I wish to try out the Serialisation libs, and these are one of the areas with a compile issue. The following error is repeated over a considerable number of files and seems to indicate a problem with Spirit. I am using the latest release version of Boost (1.33.1)- no patches (are there any?) and a gcc v3.4.3 cross compiler to ARM architecture. Does anyone have any suggestions? I have had no luck figuring it out, but to be honest haven't spent a lot of time on it yet. Rgds James >>>>> gcc-C++-action bin/boost/libs/serialization/build/libboost_serialization.a/gcc/debug/xml_gr ammar.o In file included from /home/jhughes/boost_1_33_1/libs/serialization/build/../src/basic_xml_grammar .ipp:22, from /home/jhughes/boost_1_33_1/libs/serialization/build/../src/xml_grammar.cpp:6 3: /home/jhughes/boost_1_33_1/boost/spirit/core/primitives/numerics.hpp:120: error: declaration of `template<class ScannerT> struct boost::spirit::sign_parser::result' /home/jhughes/boost_1_33_1/boost/spirit/core/parser.hpp:123: error: conflicts with previous declaration `template<class ScannerT> struct boost::spirit::parser<boost::spirit::sign_parser>::result' set -e "/opt/montavista/mobilinux/devkit/arm/iwmmxt_le/bin/iwmmxt_le-g++" -D_REENTRANT -c -Wall -ftemplate-depth-255 -DBOOST_LIB_DIAGNOSTIC=1 -g -O0 -fno-inline -Wno-non-virtual-dtor -Wno-ctor-dtor-privacy -I"bin/boost/libs/serialization/build" -I "/home/jhughes/boost_1_33_1" -o "bin/boost/libs/serialization/build/libboost_serialization.a/gcc/debug/xml_g rammar.o" "/home/jhughes/boost_1_33_1/libs/serialization/build/../src/xml_grammar.cpp" "/opt/montavista/mobilinux/devkit/arm/iwmmxt_le/bin/iwmmxt_le-objcopy" --set-section-flags .debug_str=contents,debug "bin/boost/libs/serialization/build/libboost_serialization.a/gcc/debug/xml_g rammar.o" ...failed gcc-C++-action bin/boost/libs/serialization/build/libboost_serialization.a/gcc/debug/xml_gr ammar.o... <<<<<

1 0

Building boost libraries for x64 platform
by Sergei N. Malyutin 30 Mar '06

30 Mar '06

Hi, I need to use boost libraries under amd64 platform. At the build time of the library boost_thread I've got an error message from the linker that it failed to find an external symbol _InterlockedCompareExchange (this call is used in the source once.cpp). I really have not found this export among system libraries functions. Does this mean that currently the boost cannot be used in this environment? I did not see any limitations on the boost use under x64. May be I missed anything? Any help or links to the required information would be appreciated. Sergei Malyutin _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 2

[serialization] XML archive limitations?
by Delfin Rojas 30 Mar '06

30 Mar '06

Hello, I would like to know if it is possible to use the serialization lib and the XML archive to serialize into XML attributes instead of XML elements. For example I want to be able to generate something like: <song id="5" title="foo"/> I would also like to know if the order of XML elements is strict. Meaning, if I have the XML: <song> <id>5</id> <name>foo</name> </song> Can I ask the library to de-serialize "name" and then "id"? What if the xml contains extra XML elements that I don't care to de-serialize? Will I get an error processing the archive? If these things are not supported right now, what would it take to support it? New xml archive? Thanks a lot, Delfin Rojas

3 2

Re: [Boost-users] Serialization library question
by wayne.x.liu＠jpmchase.com 30 Mar '06

30 Mar '06

Thanks for the help. The new code works. For my application, I would like to use BOOST_CLASS_EXPORT_GUID to simplify the registration process. Changing the demo code to use EXPORT causes it to core dump. Perhaps I'm not using correctly... Again, help would be appreciated. Wayne Liu #0 0x004a2575 in boost::archive::detail::basic_iarchive_impl::load_preamble () from /cbb/public/wayne/build/lib/libboost_serialization-gcc-1_33_1.so.1.33.1 #1 0x004a30b9 in boost::archive::detail::basic_iarchive_impl::load_pointer () from /cbb/public/wayne/build/lib/libboost_serialization-gcc-1_33_1.so.1.33.1 #2 0x004a2934 in boost::archive::detail::basic_iarchive::load_pointer () from /cbb/public/wayne/build/lib/libboost_serialization-gcc-1_33_1.so.1.33.1 #3 0x0804d989 in boost::archive::detail::load_pointer_type<boost::archive::text_iarchive, bus_stop*>::invoke (ar=@0xbfff7fd0, t=@0xbfff800c) at /cbb/public/wayne/build/include/boost-1_33_1/boost/archive/detail/iserializer.hpp:486 #4 0x0804d8f6 in load<boost::archive::text_iarchive, bus_stop*> (ar=@0xbfff7fd0, t=@0xbfff800c) at /cbb/public/wayne/build/include/boost-1_33_1/boost/archive/detail/iserializer.hpp:572 #5 0x0804d80b in boost::archive::basic_text_iarchive<boost::archive::text_iarchive>::load_override<bus_stop*> (this=0xbfff7fd0, t=@0xbfff800c) at /cbb/public/wayne/build/include/boost-1_33_1/boost/archive/basic_text_iarchive.hpp:64 #6 0x0804d718 in boost::archive::text_iarchive_impl<boost::archive::text_iarchive>::load_override<bus_stop*> (this=0xbfff7fd0, t=@0xbfff800c) at /cbb/public/wayne/build/include/boost-1_33_1/boost/archive/text_iarchive.hpp:64 #7 0x0804d65d in operator>><bus_stop*> (this=0xbfff7fd0, t=@0xbfff800c) at /cbb/public/wayne/build/include/boost-1_33_1/boost/archive/detail/interface_iarchive.hpp:76 #8 0x0804c807 in restore (ss=@0xbfff8070) at test/d3.cpp:138 #9 0x0804cf69 in main (argc=1, argv=0xbfff8274) at test/d3.cpp:180 /////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8 // demo.cpp // // (C) Copyright 2002-4 Robert Ramey - http://www.rrsd.com . // Use, modification and distribution is subject to 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) #include <iomanip> #include <iostream> #include <sstream> #include <string> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/access.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/export.hpp> ///////////////////////////////////////////////////////////// // One bus stop // // illustrates serialization of serializable members // class bus_stop { friend class boost::serialization::access; friend std::ostream & operator<<(std::ostream &os, const bus_stop &gp); virtual std::string description() const = 0; int latitude; int longitude; template<class Archive> void serialize(Archive &ar, const unsigned int version) { ar & latitude; ar & longitude; } protected: bus_stop(const int & _lat, const int & _long) : latitude(_lat), longitude(_long) {} public: bus_stop(){} virtual ~bus_stop(){} }; BOOST_IS_ABSTRACT(bus_stop) BOOST_CLASS_EXPORT_GUID(bus_stop, "bus_stop") std::ostream & operator<<(std::ostream &os, const bus_stop &bs) { return os << bs.latitude << bs.longitude << ' ' << bs.description(); } ///////////////////////////////////////////////////////////// // Several kinds of bus stops // // illustrates serialization of derived types // class bus_stop_corner : public bus_stop { friend class boost::serialization::access; std::string street1; std::string street2; virtual std::string description() const { return street1 + " and " + street2; } template<class Archive> void serialize(Archive &ar, const unsigned int version) { // save/load base class information ar & boost::serialization::base_object<bus_stop>(*this); ar & street1 & street2; } public: bus_stop_corner(){} bus_stop_corner(const int & _lat, const int & _long, const std::string & _s1, const std::string & _s2 ) : bus_stop(_lat, _long), street1(_s1), street2(_s2) { } }; BOOST_CLASS_EXPORT_GUID(bus_stop_corner, "bus_stop_corner") class bus_stop_destination : public bus_stop { friend class boost::serialization::access; std::string name; virtual std::string description() const { return name; } template<class Archive> void serialize(Archive &ar, const unsigned int version) { ar & boost::serialization::base_object<bus_stop>(*this) & name; } public: bus_stop_destination(){} bus_stop_destination( const int & _lat, const int & _long, const std::string & _name ) : bus_stop(_lat, _long), name(_name) { } }; BOOST_CLASS_EXPORT_GUID(bus_stop_destination, "bus_stop_destination") void save(const bus_stop * const s, std::stringstream &ss) /* NOTE extra const here !! */ { std::cout << "original"; std::cout << *s; boost::archive::text_oarchive oa(ss); //oa.register_type(static_cast<bus_stop_corner *>(NULL)); //oa.register_type(static_cast<bus_stop_destination *>(NULL)); oa << s; } void restore( std::stringstream &ss) { bus_stop *s; boost::archive::text_iarchive ia(ss); //ia.register_type(static_cast<bus_stop_corner *>(NULL)); //ia.register_type(static_cast<bus_stop_destination *>(NULL)); ia >> s; std::cout << "restored"; std::cout << *s; } int main(int argc, char *argv[]) { // fill in the data // make a few stops bus_stop *bs0 = new bus_stop_corner( 34, 134, "24th Street", "10th Avenue" ); bus_stop *bs1 = new bus_stop_corner( 35, 133, "State street", "Cathedral Vista Lane" ); bus_stop *bs2 = new bus_stop_destination( 35, 133, "White House" ); bus_stop *bs3 = new bus_stop_destination( 35, 133, "Lincoln Memorial" ); { std::stringstream ss; // display the complete schedule save(bs0,ss); restore(ss); } { std::stringstream ss; // display the complete schedule save(bs1,ss); restore(ss); } { std::stringstream ss; // display the complete schedule save(bs2,ss); restore(ss); } { std::stringstream ss; // display the complete schedule save(bs3,ss); restore(ss); } return 0; }

2 2

Re: [Boost-users] Dynamically creating classed by name?
by Wu Yinghui, Freddie 30 Mar '06

30 Mar '06

> Note that a component of the serialization library "extended_type_info" addresses > this issue (as it must) in order to de-serialize pointers. You might look in > the serialization documentation. > > Robert Ramey Frankly speaking, I've been researching on this topic as well. Most of the current libraries (e.g. Reflex) uses external programs/scripts to general the "stub" program for reflection support. This is not acceptable for our current environment. Boost.Serialization was a very good candidate, though a little bit difficult to use--It provides the necessary support all under the hood of C++ and C++ alone. Nonetheless, though I've inspected "extended_type_info" reference in the manual a number of times, I'm sorry that I cannot see how to achieve what Rob Caldecott wanted using it. Maybe you can shed some light on this? TIA! Cheers, Freddie > Rob Caldecott wrote: > > Is there any way that, using Boost, you can dynamically create > > classes by name, similar to the MFC RUNTIME_CLASS macros? I was > > hoping that the boost::serialize libs might be able to help with this. > > > > For example, I want to be able to do something like: > > > > CMyClass* pClass = CREATE_CLASS_BY_NAME("CMyClass"); > > > > Can Boost help me to achieve this? -- Wu Yinghui, Freddie Research & Development Software Engineer Volume Interactions Pte Ltd 1 Kim Seng Promenade, #12-01 Great World City East Tower Singapore 237994 Tel: +65 62226962 (Ext 216) Fax: +65 62226215 Email: yhwu(a)volumeinteractions.com URL: http://www.volumeinteractions.com Important: This message is intended for the recipient(s) addressed above. It contains privileged and confidential information. If you are not the intended recipient, please notify the sender immediately by replying to this message and then delete it from your system. You must not read, copy, use, or disseminate this communication in any form. Thank you.

2 1

Boost::Python core dump
by Dave Steffen 29 Mar '06

29 Mar '06

Hi folks, I've got a Boost::Python compatibility question. Our application is written in python, with a bunch of math stuff written in C++ and access from python via Boost::Python. Having recently rebuilt from scratch, the python code (which formerly worked) now produces an (almost) immediate core dump: ./run_gui.sh: line 3: 25950 Segmentation fault (core dumped) python gui/bntd_gui.py $* GDB is generally unhelpful, but it _looks_ like the problem happens while it's loading shared libraries; that is, the core dump indicates that Python is dying somewhere at the end of the "load shared libraries" stage. Does anybody have any advice? What sorts of things might cause this? Might a mismatch be a compiler-used-for-building-python vs compiler-used-for-building-my-app incompatibility? I'm using python 2.3.3 (built with GCC 3.4.1), and building the C++ code into shared libs with GCC 3.3.1 (not the same!). Any thoughts would be greatly appreciated. Thanks! ---------------------------------------------------------------------- Dave Steffen, Ph.D. Fools ignore complexity. Pragmatists Software Engineer IV suffer it. Some can avoid it. Geniuses Numerica Corporation remove it. ph (970) 419-8343 x27 -- Alan Perlis fax (970) 223-6797 dgsteffen(a)numerica.us

1 0

Re: [Boost-users] [MultiArray] Banded matrix
by Sohail Somani 29 Mar '06

29 Mar '06

Yes, I think this seems to be the case. I read some posts about how multi_array might be extended to support more numerical code. How do you suppose this would be done? > -----Original Message----- > From: Ronald Garcia [mailto:garcia@cs.indiana.edu] > Sent: Wednesday, March 29, 2006 2:10 PM > To: Sohail Somani > Cc: boost-users(a)lists.boost.org > Subject: Re: [MultiArray] Banded matrix > > Hi Sohail, > > You will likely not be able to get this to work correctly. The > multi_array_ref operators rely upon the dense representation of an > array. More likely you will want to use template function that uses > array notation as in: > > template <class Array> > void some_fcn(const Arrray& m); > > ron > > On Mar 29, 2006, at 3:04 PM, Sohail Somani wrote: > > > Well, I'd like to use a banded_matrix *as* a multi_array. > For example: > > > > some_fcn( const multi_array_ref<T,2> & m); > > > > I'd like to pass in an implementation of a multi_array_ref<T,2> > > that is > > optimized to only hold three diagonals of the array (for example). > > > > Should this not be done? :) > > > > Sohail > > > >> -----Original Message----- > >> From: Ronald Garcia [mailto:garcia@cs.indiana.edu] > >> Sent: Wednesday, March 29, 2006 12:01 PM > >> To: Sohail Somani > >> Cc: boost-users(a)lists.boost.org > >> Subject: Re: [MultiArray] Banded matrix > >> > >> Hi Sohail, > >> > >> I'm not clear on what you mean "used as a multi_array_ref". Could > >> you elaborate what you are tryijng to do? > >> > >> ron > >> > >> On Mar 28, 2006, at 1:56 PM, Sohail Somani wrote: > >> > >>> Hi, > >>> > >>> I'd like to continue to use multi array as my array type > >> for numerical > >>> work. I'd like to hear some suggestions on how I could implement a > >>> banded matrix based on multi_array such that it could be used as a > >>> multi_array_ref. The obvious solution is to subclass, have > >> an array of > >>> multi_array<T,1> and overload the indexing operators. > >>> > >>> Are there any gotchas? > >>> > >>> Thanks! > >>> > >>> Sohail > >> > >> > >

1 0

Re: [Boost-users] [MultiArray] Banded matrix
by Sohail Somani 29 Mar '06

29 Mar '06

Well, I'd like to use a banded_matrix *as* a multi_array. For example: some_fcn( const multi_array_ref<T,2> & m); I'd like to pass in an implementation of a multi_array_ref<T,2> that is optimized to only hold three diagonals of the array (for example). Should this not be done? :) Sohail > -----Original Message----- > From: Ronald Garcia [mailto:garcia@cs.indiana.edu] > Sent: Wednesday, March 29, 2006 12:01 PM > To: Sohail Somani > Cc: boost-users(a)lists.boost.org > Subject: Re: [MultiArray] Banded matrix > > Hi Sohail, > > I'm not clear on what you mean "used as a multi_array_ref". Could > you elaborate what you are tryijng to do? > > ron > > On Mar 28, 2006, at 1:56 PM, Sohail Somani wrote: > > > Hi, > > > > I'd like to continue to use multi array as my array type > for numerical > > work. I'd like to hear some suggestions on how I could implement a > > banded matrix based on multi_array such that it could be used as a > > multi_array_ref. The obvious solution is to subclass, have > an array of > > multi_array<T,1> and overload the indexing operators. > > > > Are there any gotchas? > > > > Thanks! > > > > Sohail > >

2 1

[MultiArray] Banded matrix
by Sohail Somani 29 Mar '06

29 Mar '06

Hi, I'd like to continue to use multi array as my array type for numerical work. I'd like to hear some suggestions on how I could implement a banded matrix based on multi_array such that it could be used as a multi_array_ref. The obvious solution is to subclass, have an array of multi_array<T,1> and overload the indexing operators. Are there any gotchas? Thanks! Sohail

2 1

[program-options] windows/dos_style
by Andy 29 Mar '06

29 Mar '06

I am just starting to create a program on windows with command line options. I want it act like most dos based programs do. I have been looking at the enum style_t in cmdline.hpp. It provides a unix_style but there is no dos_style or windows_style. What would a dos_style/windows_style look like? Thanks, Andy

1 0

[date_time] local_time compiler issue
by Prasad Ramanan 29 Mar '06

29 Mar '06

Hi, I get a compiler error when trying to compile the following simple program that includes the boost local_time header file: #include <iostream> #include <fstream> #include <string> #include "boost/date_time/local_time/local_time.hpp" using namespace std; void main() {} The error is: 'syntax error: '<' in the file boost\date_time\tz_db_base.hpp at the following line: 'typedef time_zone_names<charT> time_zone_names;' (this is line 149 of this file) I am using boost version 1.32, and I am using the c++ compiler from Microsoft Visual C++ .NET Version 7.1.3088. Does anyone know what is going on here? I have used boost::gregorian and boost::posix_time before successfully. Thanks for your help, Prasad

1 0

Dynamically creating classed by name?
by Rob Caldecott 29 Mar '06

29 Mar '06

Is there any way that, using Boost, you can dynamically create classes by name, similar to the MFC RUNTIME_CLASS macros? I was hoping that the boost::serialize libs might be able to help with this. For example, I want to be able to do something like: CMyClass* pClass = CREATE_CLASS_BY_NAME("CMyClass"); Can Boost help me to achieve this?

3 2

helppppppppp me please
by Karim Bakir 29 Mar '06

29 Mar '06

Hi, I develop in VC++, I use boost library, I have a problem , I use Multi array It runs very well however I can't to include a boost array as a parameter in a function , the compilation is Ok but at the execution it does nothing. Too I can't declare a private member as boost multi array. With boost I can only return a boost multi array , that is OK . Declare member variabla as a boost multiarray it said extents unexpected for example: class Myclass { public : void maFonction(boost::multi_array<double, 2> res); private : int dim1; int dim2; typedef boost::multi_array<double, 2> boostResultatNearby(boost::extents[dim1][dim2][dim3]) } Can you help me please thanks --------------------------------- Nouveau : téléphonez moins cher avec Yahoo! Messenger ! Découvez les tarifs exceptionnels pour appeler la France et l'international.Téléchargez la version beta.

3 2

[Numeric Conversion] numeric_cast and UDTs
by Scott Meyers 29 Mar '06

29 Mar '06

From a cursory look through the library doc, it appears that it's possible to create a UDT such that numeric_cast will work with it. For example, class int24 { ... }; // for 24-bit ints; must also specialize // std::numeric_limits, create a range // checking policy, etc. int i; ... int24 myInt = numeric_cast<int24>(i); // throws if i's value won't // fit in an int24 short s = numeric_cast<short>(myInt); // throws if myInt's value won't // fit in a short Can somebody who knows this library please tell me if my understanding is correct -- that numeric_cast can be made to work with integral UDTs? Thanks, Scott

3 3

Building boost using the VS2005 ARM cross-compiler?
by Alex Korban 29 Mar '06

29 Mar '06

Hi Has anyone attempted to build boost using the VS2005 ARM cross-compiler? Are all the necessary libraries available in this version of Visual Studio (I know they weren't in EVC4)? How would I go about actually building boost? My understanding is that I need to modify the jam files to use the cross-compiler. Perhaps somebody has already done it? Any help would be greatly appreciated. -- Best regards Alex Korban.

2 1

Re: [Boost-users] [tuples] make_tuple_over a type-sequence
by EMalenfant＠interstarinc.com 29 Mar '06

29 Mar '06

From: Yuval Ronen [mailto:ronen_yuval@yahoo.com] > > Is there a meta-function that creates a tuple type which > contains the types contained in a type-sequence? (I'm talking > about a similar thing to variant's make_variant_over). > We use a generator like this: template<typename Typelist> struct TupleGen : boost::mpl::reverse_fold< Typelist, boost::tuples::null_type, boost::tuples::cons<boost::mpl::_2, boost::mpl::_1> > { };

3 2

[tuples] make_tuple_over a type-sequence
by Yuval Ronen 29 Mar '06

29 Mar '06

Is there a meta-function that creates a tuple type which contains the types contained in a type-sequence? (I'm talking about a similar thing to variant's make_variant_over).

2 3

Re: [Boost-users] Dynamically creating classed by name?
by David Klein 29 Mar '06

29 Mar '06

boost-users-bounces(a)lists.boost.org wrote: > boost-users-bounces(a)lists.boost.org wrote: >> Is there any way that, using Boost, you can dynamically create >> classes by name, similar to the MFC RUNTIME_CLASS macros? I was >> hoping that the boost::serialize libs might be able to help with >> this. >> >> For example, I want to be able to do something like: >> >> CMyClass* pClass = CREATE_CLASS_BY_NAME("CMyClass"); >> >> Can Boost help me to achieve this? >> >> >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users > > hi rob, > > i guess you're looking for some kind of reflection library. > there is none so far in boost, but there were some proposals in the > past. > > see: http://lists.boost.org/Archives/boost/2006/01/99686.php > > HTH dave > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users oh well, i just read about MFC's RUNTIME_CLASS and it seems more like a factory than a whole reflection library. there used to be an implementation of a generic factory class in the old boost vault on sourceforge. but i couldn't find it in the new one. maybe someone can upload it again? sorry for the noise before.

1 0

Re: [Boost-users] Dynamically creating classed by name?
by David Klein 29 Mar '06

29 Mar '06

boost-users-bounces(a)lists.boost.org wrote: > Is there any way that, using Boost, you can dynamically create > classes by name, similar to the MFC RUNTIME_CLASS macros? I was > hoping that the boost::serialize libs might be able to help with this. > > For example, I want to be able to do something like: > > CMyClass* pClass = CREATE_CLASS_BY_NAME("CMyClass"); > > Can Boost help me to achieve this? > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users hi rob, i guess you're looking for some kind of reflection library. there is none so far in boost, but there were some proposals in the past. see: http://lists.boost.org/Archives/boost/2006/01/99686.php HTH dave

1 0

[Test] Incorrect assertion count/Warning when tests do not call one of the Test Tools?
by Kevin Wheatley 29 Mar '06

29 Mar '06

I was just wondering if there is an option to generate an error/warning if a test function called by the test library does no 'asserts' (or any of the BOOST_* test tools). I know there is the option to output the number of assertions and the number of tests, but as we don't always have the one assert per test style of testing here, we can't use that directly to catch tests that do no testing, the detailed ouput level in this case does something like this: Running 5 test cases... unknown location(0): fatal error in "read_one_line_file": std::runtime_error: not implemented Test suite "Master Test Suite" failed with: 8 assertions out of 8 passed 4 test cases out of 5 passed 1 test case out of 5 failed Test case "construct_default_object" passed with: 1 assertion out of 1 passed Test case "no_such_file" passed with: 2 assertions out of 2 passed Test case "blank_filename" passed with: 2 assertions out of 2 passed Test case "read_empty_file" passed with: 2 assertions out of 2 passed Test case "read_one_line_file" aborted with: 1 assertion out of 1 passed The problem comes from (sample): BOOST_AUTO_TEST_CASE( construct_default_object ) { CSVFileReader defaultObject; boost::ignore_unused_variable_warning(defaultObject); } I'd like to say I don't see any asserts here, and would like a warning, or at least to note that I did not call an assert. In fact it looks like BOOST_AUTO_TEST_CASE() is adding an additional test to all of my test cases. Is this by design? Thanks Kevin -- | Kevin Wheatley, Cinesite (Europe) Ltd | Nobody thinks this | | Senior Technology | My employer for certain | | And Network Systems Architect | Not even myself |

2 4

bjam and gprof
by Dean Bushey 29 Mar '06

29 Mar '06

Hi, I'm trying to generate profile information on the test cases. I see that I can use the -sBUILD=profile option to bjam. This places the resulting gmon.out in the current directory, and lots of other information in the <boost>/bin/..... directory. To run gprof I need the executible file, along with the gmon.out file. Is this kept somewhere? Is there a way to tell bjam to save the executible file somewhere for use with gprof? Thanks Dean Dean Bushey --------------------------------- Blab-away for as little as 1¢/min. Make PC-to-Phone Calls using Yahoo! Messenger with Voice.

1 0

Re: [Boost-users] Known issues loading lots of objects withxml_iarchive
by Christopher Gillett 29 Mar '06

29 Mar '06

See I foolishly assumed that all your code was bug free :-) lol...sorry for the nebulous report - here is something a bit more concrete. The scenario as stated is loading a large number of objects that have been previously serialized into a number of files. After around 150 files have been processed I hit an archive exception and stream error. This occurs only when using the XML archive...if I use the binary archive I can process as many files as I'd like (and in fact I've tested many more than I actually need). The approach is "textbook" in that I've seen this same pattern many times in sample code, tutorials, etc. The only difference in the code between binary and xml serialization is my load function: XML: #include <boost/archive/xml_oarchive.hpp> #include <boost/archive/xml_iarchive.hpp> void load( MyObjType &obj, const char *fileName ) { std::ifstream ifs( fileName ); assert( ifs.good() ); boost::archive::xml_iarchive ia( ifs ); ia >> BOOST_SERIALIZATION_NVP( obj ); } Binary: #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/binary_iarchive.hpp> void load( MyObjType &obj, const char *fileName ) { std::ifstream ifs( fileName ); assert( ifs.good() ); boost::archive::binary_iarchive ia( ifs ); ia >> obj; } Each class I'm serializing has the usual "boilerplate" in the class definition, for example: #include <boost/serialization/nvp.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/list.hpp> #include <boost/serialization/version.hpp> class MyClass : public MyClassBaseObject { friend class boost::serialization::access; friend std::ostream & operator<<(std::ostream &os, const MyClass &MyClassObj); template<class Archive> void serialize(Archive &ar, const unsigned int version) { ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP( MyClassBaseObj ); ar & BOOST_SERIALIZATION_NVP( thing1 ); ar & BOOST_SERIALIZATION_NVP( thing2 ); ar & BOOST_SERIALIZATION_NVP( etc ); } ... }; I initially thought this was a file management problem, but since I can load as many files as I'd like with the binary archive I suspect a bug in the XML archive code. While I can live with binary serialization if necessary, my goal is XML serialization. Any thoughts on this? I can put together a totally contrived example program that will demonstrate the failure if necessary. I'm hoping to hear that it's something stupid on my part. Thanks, Chris Gillett > Date: Mon, 13 Mar 2006 18:40:32 -0800 > From: "Robert Ramey" <ramey(a)rrsd.com> > Subject: Re: [Boost-users] Known issues loading lots of objects > withxml_iarchive? > To: boost-users(a)lists.boost.org > Message-ID: <dv5aeu$l6e$1(a)sea.gmane.org> > > There are no "known" issues. In fact the system has no known bugs > either. LOL - of course the function of this list is to address the > problem. I haven't heard of anyone having this problem. You might > investigate a little by seeing if occurs just in xml or in other > archives > as well. > > Robert Ramey > > Christopher Gillett wrote: >> I am serializing a LOT of objects, one per file. I can create >> XML for >> many thousands of objects with no issue. However, when trying to >> load a few hundred objects (using a separate program, btw) I am >> hitting a boost::archive::archive_exception with a stream error while >> loading around the 161st file, which I believe based on stack traces >> is coming from within >> boost::archive::basic_xml_grammar<char>::parse_end_tag (). >> >> The approach I'm taking is fairly textbook, so I'm curious if there >> are known issues with loading a lot of files, etc. >> >> Any advice appreciate. >> >> Thanks, >> Chris Gillett

2 1

How to handle slightly different command line interface when using boost::program_options
by Peng Yu 29 Mar '06

29 Mar '06

The program_options package ease the way to implement the program cmd interface. But what I found is that as the interface getting bigger the main() program gets longer and longer and is hard to read, because a lot of conditional branch statements have to be used. In general, the declaration of the options are at the beginning of the program and the use of the options are at somewhere afterwards. This cause the program hard to maintain. I'm wondering if there is any OO way to handle this problem. Then the main program could be easily maintained and understood.

1 0