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

[BGL] implementing operator < for edge_descriptors
by Max Schoebinger 02 Feb '05

02 Feb '05

Hello, I am trying to create a std::map<edge_descriptor, unsigned int>. Unfortunaltely, there is no less operator defined for edge descriptors, so i'd like to implement my own version based on a custom internal property associated with the edge. Is it possible to access an arbitrary property, solely based on an edge_descriptor without having access to the graph object? Here some pseudo-code: struct compare_edge_descriptors { bool operator()(edge_descriptor e1, edge_descriptor e2) { unsigned int val1 = get_property_somehow(e1.get_property(), my_custom_property); unsigned int val2 = get_property_somehow(e2.get_property(), my_custom_property); return (val1 < val2 ); } }; Do you have an idea how to implement "get_property_somehow"? Thanks, Max

1 0

boost-users: cant i use mpl::contains to find members of list_c ??
by suresh.t＠philips.com 02 Feb '05

02 Feb '05

hi, I was trying to use mpl::contains with list_c and it always seems to return mpl::false_. For example typedef mpl::list_c< int ,16,8 > mylist; typedef mpl::contains<mylist, mpl::int_<16> >::type tt; "tt::value" is zero though i thought 16 being in the mylist it would be 1. Can someone please let me know whether the usage is improper and if so what should be used to find elements in list_c? Thanks in Advance S.T

2 1

Exercices 3-3 and 3-4 (C++ Templates Metaprogramming)
by Philippe Mori 02 Feb '05

02 Feb '05

I'm not sure of the meaning of "twice twice" and "twice on itself" respectively. My guess would be for exercice 3 that I should do something like : typedef twice<to_be_filled_1>::type T1; // T1 would be T ** // The second time, I replace T (in to_be_fiiled_1) by // T1 (in to_be_filled_2) , thus T2 is T1** which is also T**** typedef twice<to_be_filled_2>::type T2; while for exercice 4, we want something that would look like : typdef twice<twice<to_be_filled_3a>to_be_filled_3b>::type T3; Does I understand the questions correctly? For twice, I use the definition from section 3.3.2. Philippe

2 1

Exercice 3-7 (C++ Templates Metaprogramming)
by Philippe Mori 02 Feb '05

02 Feb '05

I do not understand well the semantic of some constructs. 1) For t1, does the external mpl::lambda has any effect on some use of t1 or mpl::lambda<_1>::type and also mpl::lambda<_1> are always equivalent? 2) Does the uses of lambda in t8 has any effect or the result is always the same as with t2. 3) Does there are other tests that the ones below (i to vii) that would shows some other differences in the semantics of the expression? 4) Same question but for to_be_filled part of my tests. Anything different that the four ones belows (a to d)? 5) In any ot the tests with a to_be_filled part, is it possible to have more than one template argument and that the extra ones are used? The thing I have some of the following (what I have tried and what compile depends on the construct - that is t1, t2,...) : i) display_type(tn); ii) display_type(tn::type); iii) display_value(tn::type::value); iv) display_type(mpl::apply<tn, to_be_filled>::type) v) display_value(mpl::apply<tn, to_be_filled>::type::value) vi) display_type(tn::apply<to_be_filled>::type) vii) display_value(tn::apply<to_be_filled>::type::value) where tn is one of the type t1, t2,... t8 and to_be_filled is something similar to one of those : a) int b) X where X is a metafunction class c) mpl::plus<int_<1>, int_<2> > d) Y where Y is a simple metafunction similar to always_int in section 3.5.4. I have look at the documentation but it is hard to see the relation between each construct, the possible uses of each ones and their prmary purpose. I would be nice to provide more samples and more equivalences. Philippe

2 1

uBLAS sparse_matrix "default" value
by Austin Bingham 02 Feb '05

02 Feb '05

Apparently the wheels of the ublas mailing list move slowly, so I'm asking this question here. Is there any way to set the "default" value of a sparse_matrix? sparse_matrix seems to guarantee that you always get a value when you access an index, even if that index hasn't been explicitly set. For sparse_matrix<float>, for instance, you get 0. Is there any way to specify this value? That is, if I wanted to get back, say, -1 for unset entries, is there a way to do this? There's no direct mention of this that I can find, although there were some discussions of zero-constructors or somesuch that may have been dealing with this question. Thanks. Austin Bingham

2 1

mpl -> integral sequence wrappers -> wrapping enums ?
by Martin Pasdzierny 02 Feb '05

02 Feb '05

Hello MPL experts, I'd like to use meta - vectors of integral constants defined as enums. But unfortunately the code below does not compile. <code> #include <iostream> #include <boost/mpl/vector_c.hpp> #include <boost/mpl/size.hpp> enum MY_ENUM {X,Y}; // (*) typedef boost::mpl::vector_c<MY_ENUM,X,Y> my_vector_c; static const int size = boost::mpl::size<my_vector_c>::value; int main(int argc, char** argv) { std::cout << "\nsize:" << size << "\n... bye" << std::endl; } </code> After replacing line (*) with typedef boost::mpl::vector_c<int,X,Y> my_vector_c; the code compiles and runs fine, but this does not look type safe any more. Any suggestions ?! regards, Martin.

2 3

Re: Rationale for intrusive_ptr?
by Brian Neal 02 Feb '05

02 Feb '05

Well to answer my own question, I think, it can be used when you already have something that is reference counted and you want to manage it yourself. Also in places where new and delete aren't the correct actions. Or when you need something with less resource requirements than shared_ptr. For example, when multi-threading is turned on, shared_ptr asks for a mutex. Intrusive_ptr leaves that up to you. Am I getting close here? I didn't think about using it when you have a function that takes a shared_ptr but you need to pass in this. I dunno, I tend to use shared_ptr sparingly. If I don't need a shared_ptr, I don't ask for one on the interface to a function. That way the user can pass in a naked pointer or a shared_ptr::get(). I make sure to document what the function does (and does not do) with the input pointer though. Thanks. __________________________________ Do you Yahoo!? Yahoo! Mail - Find what you need with new enhanced search. http://info.mail.yahoo.com/mail_250

2 1

equality fails with C++ bools
by Ross Boylan 02 Feb '05

02 Feb '05

I have a function declared bool that is acting rather non-bool. std::cout << obj.fn() gives me "76" and BOOST_CHECK_EQUAL(obj.fn), true) fails, with the message /home/ross/peter/R/mspath/src/test/Covariates_test.cc(178): error in "obs_covariates": test env.matchesObservation() == true failed [76 != 1] std::cout << true prints "1". obj.fn() works OK as an argument to if (obj.fn()). I am using g++ 1:3.3.5-5 on Debian GNU/Linux. I've tried -O2 and -O1; same behavior either way. boost is 1.31.0-9 The function is declared bool matchesObservation() const Maybe bool is being typedef'd or #define'd to int somewhere, for compatibility with old code? Probably not; I tried printing typeid(xxx).name() and got "b" for true and the function return value, while I got "i" for the number 1. I tried tracing into the code with limited success. Some mix of the fact that the underlying libraries weren't a debug version, that the code was optimized, and that there are #line directives (the source files were generated out of another file) made it hard to follow. Any suggestions? -- Ross Boylan wk: (415) 502-4031 530 Parnassus Avenue (Library) rm 115-4 ross(a)biostat.ucsf.edu Dept of Epidemiology and Biostatistics fax: (415) 476-9856 University of California, San Francisco San Francisco, CA 94143-0840 hm: (415) 550-1062

2 5

Christoph Jaeschke/Germany/IBM is out of the office.
by Christoph Jaeschke 02 Feb '05

02 Feb '05

I will be out of the office starting 02/02/2005 and will not return until 02/09/2005. I will respond to your message when I return.

1 0

Compilation Error
by Grek 01 Feb '05

01 Feb '05

Hi: I am a newbie to the world of Boost. I have a problem in compiling a program. I do not know how to set the path to compile the attached code. My platform is Cygwin gcc version 3.3.3 The boost_1_32_0 subdirectory resides in the Cygwin directory. I tried the following, g++ boost_1_32_0/boost/graph/sourcecode.cpp and it displays the message boost/config.hpp : No such file or directory boost/graph/graph_traits.hpp : No such file or directory boost/graph/adjacency_list.hpp : No such file or directory boost/graph/dijkstra_shortest_paths.hpp : No such file or directory followed by more error messages. Please refer to the attached code and help me out. Thanks in advance. Sourcecode.cpp ****************************************************************************** #include <boost/config.hpp> #include <iostream> #include <fstream> #include <string> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> using namespace boost; float maximum(float a[], float mx, int n){ float max=mx; for(int i=0; i<n; ++i){ if(max < a[i]){ max=a[i]; } } return max; } int main() { int num_nodes = 10000; int num_PPIs = 50000; char node[num_nodes][10], p1[num_PPIs][10], p2[num_PPIs][10]; char name[num_nodes]; float wt[num_PPIs], apl, dia, path[num_nodes]; int i, j, l, l1, l2, mx_len=num_nodes, pl[mx_len]; typedef adjacency_list < listS, vecS, directedS, no_property, property < edge_weight_t, float > > graph_t; typedef graph_traits < graph_t >::vertex_descriptor vertex_descriptor; typedef graph_traits < graph_t >::edge_descriptor edge_descriptor; typedef std::pair<int, int> Edge; std::ifstream INF1 ("./data/None.conversion"); std::ifstream INF2 ("./data/None.before"); if(!INF1){ std::cerr << "Cannot find INF1 file." << std::endl; return EXIT_FAILURE; } if(!INF2){ std::cerr << "Cannot find INF2 file." << std::endl; return EXIT_FAILURE; } //read data i=0; while(INF1 >> num_nodes >> node[i]){ ++i; } INF1.close(); num_nodes=i; i=0; while(INF2 >> p1[i] >> p2[i] >> wt[i]){ wt[i]=1.0; ++i; } INF2.close(); num_PPIs=i; // Edge edge_array[num_PPIs]; for(i=0; i<num_PPIs; ++i){ for(j=0; j<num_nodes; ++j){ if(stricmp(p1[i],node[j]) == 0){ edge_array[i].first=j; } } for(j=0; j<num_nodes; ++j){ if(stricmp(p2[i],node[j]) == 0){ edge_array[i].second=j; } } } // int num_arcs = sizeof(edge_array) / sizeof(Edge); std::cout << "0 None " << num_PPIs << " " << num_nodes; graph_t g(edge_array, edge_array + num_arcs, wt, num_nodes); property_map<graph_t, edge_weight_t>::type weightmap = get(edge_weight, g); std::vector<vertex_descriptor> p(num_vertices(g)); std::vector<float> d(num_vertices(g)); // l1=0; l2=0; dia=0; for(j=1; j<mx_len; ++j){ pl[j]=0; } // for(int src=0; src<num_nodes; ++src){ vertex_descriptor s = vertex(src, g); dijkstra_shortest_paths(g, s, predecessor_map(&p[0]).distance_map(&d[0])); for(j=0; j<num_nodes; ++j){ if(j == p[j]){ //set self-looping node to zero distance d[j]=0; } if(d[j] > 10000){ //set non-connecting node to zero distance d[j]=0; } path[j]=d[j]; pl[int(d[j]+0.5)]=pl[int(d[j]+0.5)]+1; } dia=maximum(path,dia,num_nodes); } for(l=1; l<=int(dia); ++l){ l1=l1+pl[l]*l; l2=l2+pl[l]; } apl=float(l1)/float(l2); std::cout << " " << apl << " " << l1 << " " << l2 << " " << dia << std::endl; return EXIT_SUCCESS; } ********************************************************************************** Cheers Grek --------------------------------- Do you Yahoo!? Yahoo! Search presents - Jib Jab's 'Second Term'

2 1

problems with constructor/implicitly_convertible
by Benjamin Schmeling 01 Feb '05

01 Feb '05

Hi, I have defined the following: bigint* bigint_constructor(long_ l){ return new bigint(to_bigint(l)); } class_<bigint>("bigint") .def("__init__", make_constructor(bigint_constructor)) .... .... implicitly_convertible<boost::python::long_, bigint>(); Now I want to have a implicit conversion from long_ to bigint. My original c++ class has no constructor with long_ but my python-bigint class. The compiler tries to find one on c++ bigint and doesn't find it. How should I use implicitly_convertible to reach my goal? Benjamin

1 0

Rationale for intrusive_ptr?
by Brian Neal 01 Feb '05

01 Feb '05

Hi, I need some help understanding when and why you would want to use intrusive_ptr. Does someone have an example? I didn't get much out of the current documentation for it. Thank you. __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

Two issues with lexical_cast
by Yuval Ronen 01 Feb '05

01 Feb '05

Hi. I'm probably just another one out of a million who make these remarks, but I found nothing in the documentation about them, so I'll mention them anyway. 1. lexical_cast(Source arg) takes the source argument by value. Why not by const& ? Calling lexical_cast(some_basic_string) now makes a copy of the source argument for no reason. 2. lexical_cast ignores trailing whitespaces, but not leading whitespaces. Meaning that int a = lexical_cast<int>("3 "); // three-space will work and return 3, but int a = lexical_cast<int>(" 3"); // space-three will throw. Why? There's no rationale here. Both cases should be treated in the same manner, and IMHO, that manner should be throwing. After a look at the code, it seems that the trailing-whitespace-ignore code ('stream >> std::ws' in line 151) was specifically added, so there was supposed to be a reason for this. But as I said, I believe this is wrong, at least as the default behaviour when converting a string to something else. Maybe some policies (IgnoreLeadingWhitespace, IgnoreTrailingWhitespace) can be added to control this? And again, I suppose I'm not the first to think of it... Thanks, Yuval

5 18

RE: [Boost-users] Rationale for intrusive_ptr?
by Nat Goodspeed 01 Feb '05

01 Feb '05

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Brian Neal > Sent: Monday, January 31, 2005 7:34 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Rationale for intrusive_ptr? > > Hi, I need some help understanding when and why you > would want to use intrusive_ptr. Does someone have an > example? I didn't get much out of the current > documentation for it. Thank you. [Nat] Consider: class MyClass; void some_func(const boost::shared_ptr<MyClass>& ptr); class MyClass { public: void process() { // BAD THINGS HAPPEN! some_func(boost::shared_ptr<MyClass>(this)); } }; In our current project, we've been bitten more than once :-( by situations that are analogous but less obvious. Inside a member function, you don't have a shared_ptr<MyClass>, you only have a dumb MyClass* 'this' pointer. But if MyClass is managed with smart pointers, you probably have processing functions that accept only a smart pointer to MyClass. A natural-looking data conversion is easy to code and makes the compiler happy. What happens, though, is that when you instantiate a new shared_ptr<MyClass> from your dumb 'this' pointer, it gets a whole new refcount object! In the example above, the temporary shared_ptr<> goes away as you're about to exit MyClass::process() -- which makes its spurious refcount go to 0 -- which deletes the MyClass instance in question, even though there are probably still existing shared_ptr<MyClass> references to the same instance lying around! (e.g. the one with which you called the process() method) We now use intrusive_ptr almost exclusively (vs. shared_ptr). We limit its intrusiveness by deriving all subject classes from an intrusive_base we wrote, which contains the refcount we use and a couple of methods. This practice has cut down considerably on bizarre crashes.

1 0

implicitly_convertible<a,b>
by Benjamin Schmeling 31 Jan '05

31 Jan '05

Hi, I have exposed a bigint class which has no constructor for long_ . I added an additional constructor by defining .def("__init__", make_constructor(bigint_constructor)) This works fine. Now I want to use the implicitly_convertible function which expects from the class to have an constructor which takes the first argumen (in this case a long_) I used implicitly_convertible<boost::python::long_ ,bigint> but now the problem is that the original c++ class has no such constructor, but the wrapped class. How can I make him use my new constructor in implicitly_convertible? Benjamin

1 0

Compile problems with multi_index on CW 9.3 (mac)?
by Marshall Clow 31 Jan '05

31 Jan '05

I'm trying to use boost::multi_index for the first time, and I'm getting odd compile errors. I have a class with two "keys", a text one and a numeric one, and I want to have two indices into the collection. So, I tried several things, and all of them get the same error: 'index_class' is not a member of class 'boost::multi_index::ordered_unique<boost::multi_index::identity<Foo>, boost::multi_index::detail::null_arg, boost::multi_index::detail::null_arg>' (and then an amazing cascade after that) Here's the basic idea: typedef boost::multi_index_container < Foo, boost::multi_index::indexed_by < boost::multi_index::ordered_unique < boost::multi_index::identity < Foo >, LessThanNumeric >, boost::multi_index::ordered_unique < boost::multi_index::identity < Foo >, LessThanText > > > Foo_; where LessThanNumeric (and LessThanText, too) looks like this: struct LessThanNumeric: std::binary_function< Foo, Foo, bool > { bool operator () ( const Foo& x, const Foo& y ) const { return x.NumericKey () < y.NumericKey (); } }; My source is at <http://www.idio.com/misc/mi-test.cpp> Anyone got any tips? Thanks! -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

2 1

boost::filesystem -- "Aborted"
by matthias 31 Jan '05

31 Jan '05

Hi, I am currently writing a gtkmm component which acts as a file browser, much like a small filemanager which can be embedded in gtkmm applications as a scrolled window. I have just rewritten the component to use the boost::filesystem classes instead of the C functions for interacting with the filesystem. However I am getting a strange error when I start my app: When iterating through a directory I suddenly get the message: Aborted. void FileBrowser::rebuild_file_list() { namespace boostfs = boost::filesystem; boostfs::path cur_path( m_cur_dir ); FileContainer tail; // m_files will first only contain directories, // while tail will contain only files m_files.clear(); try { boostfs::directory_iterator end; for( boostfs::directory_iterator dir( cur_path ); dir != end; ++dir ) { std::cout << (*dir).string() << std::endl; if( boostfs::is_directory( *dir ) ) m_files.push_back( *dir ); else tail.push_back( *dir ); } } catch( std::runtime_error & e ) { std::cerr << e.what() << std::endl; } m_files.sort( SortedByName() ); tail.sort( SortedByName() ); drx::list_concat( m_files, tail ); } OUTPUT: [...] /home/mkay/.acrobat /home/mkay/.synce /home/mkay/.gimp-2.0 /home/mkay/.fonts /home/mkay/.designerrctb2 /home/mkay/.eclipse /home/mkay/.gftp /home/mkay/.ntrc_2 /home/mkay/.DCOPserver_anthrax__0 /home/mkay/.DCOPserver_anthrax_:0 /home/mkay/.kpackage /home/mkay/.fonts.conf /home/mkay/.xscreensaver /home/mkay/xdefaults_old /home/mkay/.reslisarc /home/mkay/.aMule /home/mkay/.gtkrc Aborted At this point the application exits. Any idea what is causing this? Thanks in advance, Matthias

5 6

enabling boost::threads for HP-UX
by Oliver Kowalke 31 Jan '05

31 Jan '05

Hi, I want to use boost on HP-UX together with gcc-3.3.2. As I figured out that thread-support is disabled (BOOST_DISABLE_THREADS is defined in file boost/config/platform/hpux.hpp). Up gcc-3.3 posix-threads are supported on HP-UX-plattform (http://gcc.gnu.org/install/specific.html#hppa*-hp-hpux11) Is it then save to remove #define BOOST_DISABLE_THREADS in boost/config/platform/hpux.hpp? with best regards, Oliver -- "Der Spezialist ist ein Barbar, dessen Unwissenheit nicht allumfassend ist." Master's Voice, S.LEM

3 2

Setting the path to use Boost
by Grek 31 Jan '05

31 Jan '05

Hi fellow Boost users! I am new to the Boost Graph Library (BGL) and I have a query about setting the path to access the library. My platform is Cygwin. I want to use the g++ command and incorporate the BGL in it. How do I go about it? Let's say that I want to use the dijkstra's algorithm. I set the path as follows: boost_1_32_0/libs/graph/example Then I typed the following. g++ -g dijkstra-example.cpp But it displays error messages and I do not know how to proceed. It would be of great help if anyone could tell me how one has to set the path to use the dijkstra's algorithm in a program. Thanks for taking the time to read through this! Cheers Grek --------------------------------- Do you Yahoo!? Yahoo! Search presents - Jib Jab's 'Second Term'

2 1

atlanta statics...
by Jeffrey Holle 31 Jan '05

31 Jan '05

http://houseandhome.msn.com/pickaplace/comparecities.aspx?FromState=WA&From… Hope this link works for you. It takes 5 min. to load a page from website for me. Microsoft's MSN uses windows technology now I guess... The big thing that stands out for me is crime. Seattle is above the national average by about 2x, Atlanta appears to be between 7 and 8 times! I'll have to consider such a move with care....

1 1

Thread stack size
by Thorsten Froehlich 30 Jan '05

30 Jan '05

Hi, Googling I found a thread "Boost.Threads. Anything happening?" (in July 2004) in comp.lang.c++.moderated that suggests there should be a development branch of the thread code that already supports this feature. Unfortunately I cannot find the right branch for it in the boost CVS (using the web CVS viewer). The thread_dev and thread_development branches I found do not appear to be the correct ones as they have not been changed for a very long time and the above mentioned thread suggests it would be a rather recently added feature. While I could add this feature myself for the platforms that I need, I would prefer to avoid duplicating work already done. Could someone point me where to find the branch referred to in the above mentioned comp.lang.c++.moderated thread? Regards, Thorsten Froehlich

2 2

Bug in lexical_cast<> with doubles
by Leon Raj 29 Jan '05

29 Jan '05

I think I've found a bug in the boost::lexical_cast<> library (v1.31.0) on WinXP SP1, MSVC 6.0 (sp5) and MSVC.NET 2003. --- Start code snippet --- #include <boost/lexical_cast.hpp> #include <iostream> int main( int argc, char* argv[] ) { double dMax = = std::numeric_limits< double >::max(); // On a Win32 x86 system, dMax is now 1.7976931348623157e+308 // This is successful and strMax is "1.797693134862316e+308" std::string strMax = boost::lexical_cast< std::string >( dMax ); try { double newDMax = boost::lexical_cast< double >( strMax ); std::cout << "Successfuly" << std::endl; } catch ( boost::bad_lexical_cast& ) { std::cout << "Failed to cast" << std::endl; } // On a Win32 x86 system, this always fails, // because (I think) strMax overflows a double, // because 1.7976931348623157e+308 is *rounded UP* // to 1.797693134862316e+308, which cannot be // represented by a double } --- End code snippet --- ----------------------------------------------------- Leon Raj Senior Engineer Invetech Pty. Ltd. Phone: +61 3 9211 7000 (Switchboard) +61 3 9211 7938 (DDI) leon.raj(a)invetech.com.au IMPORTANT - This e-mail and any attachments may be confidential. Any retransmissions, dissemination or other use of these materials by persons or entities other than the intended recipient is prohibited. If received in error, please contact us and delete all copies. Before opening or using attachments, check them for viruses and defects. Our liability is limited to resupplying any affected attachments. [Any representations or opinions expressed in this e-mail are those of the individual sender, and not necessarily those of Vision Systems Limited].

2 1

Unit test case inheritance problem
by Bill Lear 29 Jan '05

29 Jan '05

I am having trouble working around a problem with inheriting unit test cases. Suppose I have a base class Foo and several derived classes. Suppose I have a corresponding base test case and I would like to reuse that base test case with test cases for the derived classes. What I would like to do is this, in highly stylized form: class BaseFooTestCase { public: virtual Foo* create() = 0; void test_base() { Foo* foo = create(); // test foo ... } void add(test_suite* ts) { ts->add(BOOST_CLASS_TEST_CASE(&BaseFooTestCase::test_base, this); } }; class DerivedFooTestCase { public: virtual Foo* create() { return new Derived(); } void test_derived() { Foo* foo = create(); // test foo } void add(test_suite* ts) { BaseFooTestCase::add(ts); ts->add(BOOST_CLASS_TEST_CASE(&DerivedFooTestCase::test_derived, this); } }; Then, something like this: test_suite* init_unit_test_suite(int, char* []) { auto_ptr<test_suite> ts(new test_suite("test")); DerivedFooTestCase* tc = new DeriveFooTestCase(); tc->add(ts); return ts; } However, I can't get the add() methods in the test case classes worked out. The BOOST_CLASS_TEST_CASE macro seems to want a shared_ptr, and passing "this" to it does not seem to work. Could anyone please provide an example of how to do this? Every time I try to work this out, I end up with a mess --- static allocator methods, weak_ptr wrapped by shared_ptr, and other workarounds --- all of which works, but is really quite a lot of effort for what I want and is overly complex for me to recommend to my team as a solution. Any help appreciated. Thanks. Bill

1 1

Bug in date_time?
by John Eddy 29 Jan '05

29 Jan '05

If I create a file with nothing but the include: #include <boost/date_time/local_time/local_time.hpp> I get a compiler error (VC7 .NET 2003) having to do with line 149 of tz_db_base.hpp which reads: typedef time_zone_names<charT> time_zone_names; which doesn't seem to make much sense. from a brief inspection of the time_zone_names.hpp file, it seems that line 64 which reads: typedef time_zone_names_base<char> time_zone_names; may shed some light on the solution. Thanks, John

3 2

thread pool help
by Cory Nelson 28 Jan '05

28 Jan '05

I'm coding a simple thread_pool class, with the help of boost. I wrote a simple test case, and things seem to be out of sync - not all the work gets executed. I think I am using boost::condition wrong, can someone take a look? -- Cory Nelson http://www.int64.org

3 2

Re: Re: [Boost-users] Warnings in date_time
by John Eddy 28 Jan '05

28 Jan '05

Jeff, Actually, they turned up at warning level 3. If you would like, I can send you the warnings for level 4. John On Thu, 27 Jan 2005 19:28:53 -0500, John Eddy wrote >> Hello, >> >> I just started using the date-time library and it is a great >> library. > > Thanks. >> There are a few warnings that I have noticed so far that >> could be avoided with some explicit casts. I am using VC .NET 2003. > > Yes, thanks. Turns out it's hard for us to see these because warnings have come out in the regression tests. I notice these still aren't coming out -- I assume this is warning level 4? We'll take care of them, eventually. Some of this code is being redone for 1.33... Jeff

1 0

Re: [string_algo] Split and Predicates
by David Brownell 28 Jan '05

28 Jan '05

Thanks for your quick response, Pavol, this did the trick and cleared up my misunderstanding. Might I suggest an overloaded version of split that takes a string/character string as a delimiter. Althought the implementation details are different, I still think it fits well into the intent of the split algorithm and may clear up issue for others have the same problem as I did. Thanks again for your help! David Brownell "Pavol Droba" <droba(a)topmail.sk> wrote in message news:<20050128071103.GC31065(a)lenin.felcer.sk>... > Hi, > > > It is possible to achieve what you want quite easily. However, split algorithm > is not the right tool for this. > Split is a high level wrapper over the split_iterator and it is quite specialized. > > So this is the code, that should work for you: > > #include <boost/algorithm/string/find_iterator.hpp> > #include <boost/algorithm/string/finder.hpp> > > static char const STRING[] = "this\r\nis\r\n\r\na test!"; > > typedef boost::split_iterator<const char*> char_split_iterator; > > for(char_split_iterator It=char_split_iterator(STRING, boost::first_finder("\r\n"); > It!=char_split_iterator(); > ++It) > { > cout << *It << endl; > } >

1 0

Date-Time gregorian::date construction question
by Wolfgang Fertsak 28 Jan '05

28 Jan '05

If a date object is constructed from an invalid date(e.g. Feb 29th, 2005) and the values are specified in the constructor, an exception is thrown. If the object is constructed from a string representation with from_string(), no exception is thrown and the object has the next valid date (in this case Mar 1st, 2005). Is this a bug or a feature? Best regards, Wolfgang #include <iostream> #include <boost/date_time/gregorian/gregorian.hpp> using namespace boost::gregorian; using namespace std; int main() { try { // throws exception date Date1(2005,2,29); string strDate("2005-02-29"); // throws no exception date Date2 = from_string(strDate); // output is 2005-03-01 cout << to_iso_extended_string(Date2) << endl; } catch(std::exception&e) { cout << e.what() << endl; } return 0; }

5 7

Warnings in date_time
by John Eddy 28 Jan '05

28 Jan '05

Hello, I just started using the date-time library and it is a great library. There are a few warnings that I have noticed so far that could be avoided with some explicit casts. I am using VC .NET 2003. Here are the ones I've noticed so far: in microsec_time_clock.hpp on line 102 which reads: boost::uint32_t sub_sec = (filetime % 10000000) / 10; // microseconds same file, line 118 which reads: int adjust = resolution_traits_type::res_adjust()/1000000; in time_system_counted.hpp on line 57 which reads: typename calendar_type::date_int_type dc = day_count(); in date_parsing.hpp on line 211 which reads: ss << ss.narrow(*beg++, 'X'); // 'X' will cause exception to be thrown Thanks, John

2 1

Error Compiling Boost Graph example/graphviz.cpp
by Welson Sun 28 Jan '05

28 Jan '05

Hi, I would like to parse the graphviz dot file using your read_graphviz in the boost graph library. However, when I compiling the example/graphviz.cpp file, I got the following error: $ g++ graphviz.cpp /cygdrive/c/DOCUME~1/welson/LOCALS~1/Temp/cctY52MA.o(.text+0x602):graphviz.c pp: undefined reference to `boost::read_graphviz(std::basic_string<char, std::char_ raits<char>, std::allocator<char> > const&, boost::subgraph<boost::adjacency_li t<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_att ibute_t, std::map<std::basic_string<char, std::char_traits<char>, std::allocato <char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> , std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, td::allocator<char> > const, std::basic_string<char, std::char_traits<char>, st ::allocator<char> > > > >, boost::no_property>, boost::property<boost::edge_att ibute_t, std::map<std::basic_string<char, std::char_traits<char>, std::allocato <char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> , std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, td::allocator<char> > const, std::basic_string<char, std::char_traits<char>, st ::allocator<char> > > > >, boost::property<boost::edge_index_t, int, boost::no_ roperty> >, boost::property<boost::graph_graph_attribute_t, std::map<std::basic string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string< har, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_strin <char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pa r<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, b ost::property<boost::graph_vertex_attribute_t, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::ch r_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std:: har_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic string<char, std::char_traits<char>, std::allocator<char> > const, std::basic_s ring<char, std::char_traits<char>, std::allocator<char> > > > >, boost::propert <boost::graph_edge_attribute_t, std::map<std::basic_string<char, std::char_trai s<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char> std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<cha >, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, s d::char_traits<char>, std::allocator<char> > const, std::basic_string<char, std :char_traits<char>, std::allocator<char> > > > >, boost::property<boost::graph_ ame_t, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, oost::no_property> > > >, boost::listS> >&)' collect2: ld returned 1 exit status However, I can use the write_graphviz to generate the .dot file from a graph, which means I have compiled the library correctly. Do you have any idea what is going on here? Best Regards, Welson Sun ------------------------------------- Electrical and Computer Engineering Brigham Young Unversity 461 CB, Provo, Utah 84602 Office: (801) 422-7206 Email: welson(a)et.byu.edu -------------------------------------

2 1

exception safety of boost graph library
by Ovidiu Deac 28 Jan '05

28 Jan '05

Hello everybody, We are going to use boost graph library within our application and I would like to know if there are any known issues regarding the exception safety. Is the basic guarantee satisfied? Is the strong guarantee satisfied? (see Herb Sutter's definition of basic/strong guarantee in Exceptional C++) "Basic guarantee: Even in the presence of exceptions thrown by T or other exceptions, Stack objects don't leak resources. Note that this also implies that the container will be destructible and usable even if an exception is thrown while performing some container operation. However, if an exception is thrown, the container will be in a consistent, but not necessarily predictable, state. Containers that support the basic guarantee can work safely in some settings. Strong guarantee: If an operation terminates because of an exception, program state will remain unchanged. This always implies commit-or-rollback semantics, including that no references or iterators into the container be invalidated if an operation fails. For example, if a Stack client calls Top and then attempts a Push that fails because of an exception, then the state of the Stack object must be unchanged and the reference returned from the prior call to Top must still be valid." (Herb Sutter, Exceptional C++) Thank you, vidu

2 1

[string_algo] Split and Predicates
by David Brownell 28 Jan '05

28 Jan '05

I am attempting to split a string with the string_algo library, using the code below. It appears that the split algorithm is designed to split on instances of individual characters rather than sequences of characters. Is there something I can do to split on a substring? The code below illustrates the problem, where I am forces to use the is_any_of predicate rather than something that implies equality. It seems like this is a trivial use of the algorithm, so there could easily be something that I am missing. typedef std::vector<boost::iterator_range<char const *> > ResultsType; ResultsType results; static char const STRING[] = "this\r\nis\r\n\r\na test!"; boost::split(results, boost::iterator_range<char const *>(STRING, STRING + sizeof(STRING)), boost::is_any_of("\r\n")); // The problem is here. I would like to be able // to use something like equals, but split requires // a predicate that takes a single argument rather than // a range. for(ResultsType::const_iterator rptr = results.begin(); rptr != results.end(); ++rptr) std::cout << "'" << std::string(rptr->begin(), rptr->end()) << "'\n"; Thanks! David Brownell

2 1

Graphs (boost1.32.0) Trouble with dijkstra visitor and VC 7.1
by Tony Juricic 28 Jan '05

28 Jan '05

Has anybody created custom dijkstra_shortest_paths algorithm visitor for discover_vertex event? I am having all sorts of compilation errors using MSVC 7.1 and defining my visitor using example code. Reshuffling the code (but at this point I hardly know what am I really doing) I got the following to compile: // define visitor for discover_vertex event template <class Vertex, class Tag> struct target_visitor : public default_dijkstra_visitor { target_visitor(Vertex u) : v(u) { } template <class Vertex, class Graph> void discover_vertex(Vertex u, Graph& g) { if ( u==v ) assert(0); } private: Vertex v; }; template <class Vertex, class Tag> target_visitor<Vertex, Tag> target_visit(Vertex u, Tag) { return target_visitor<Vertex, Tag>(u); } ... // call dijkstra_shortest_paths with custom visitor // parameters below are defined as in dijkstra-example.cpp dijkstra_shortest_paths(g, s, predecessor_map(&p[0]).distance_map(&d[0]).visitor(target_visit(D, on_discover_vertex()))); Tony Confused

2 1

error in boost/graph/fruchterman_reingold.hpp
by Jamie Wilkinson 28 Jan '05

28 Jan '05

The doc at http://boost-consulting.com/boost/libs/grpah/doc/fruchterman_reingold.html suggests that there is a 4 argument version of the function, taking only the graph, a position map, width and height; but attempts to compile such a function against the headers from the latest CVS results in a compile error: error: no matching function for call to ` fruchterman_reingold_force_directed_layout(Umbrella::Document&, Umbrella::View::load_from_document()::PositionMap&, double&, double&)' Removing the typenames Param, Tag, and Rest from lines 371-372 of the header allows the compile to continue. Index: boost/graph/fruchterman_reingold.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/graph/fruchterman_reingold.hpp,v retrieving revision 1.5 diff -u -c -r1.5 fruchterman_reingold.hpp cvs diff: conflicting specifications of output style *** boost/graph/fruchterman_reingold.hpp 29 Dec 2004 16:53:05 -0000 1.5 --- boost/graph/fruchterman_reingold.hpp 12 Jan 2005 09:18:16 -0000 *************** *** 368,375 **** params); } ! template<typename Graph, typename PositionMap, typename Dim, typename Param, ! typename Tag, typename Rest> void fruchterman_reingold_force_directed_layout(const Graph& g, PositionMap position, --- 368,374 ---- params); } ! template<typename Graph, typename PositionMap, typename Dim> void fruchterman_reingold_force_directed_layout(const Graph& g, PositionMap position,

4 4

Bind Overload Workaround?
by Duane Murphy 28 Jan '05

28 Jan '05

How do I work around this problem with bind? #include <boost/bind.hpp> namespace { class functions { public: int func( int ); int func( int, int ); }; void test() { functions a_func; boost::bind( functions::func, a_func, 1, _1 ); } } Bind can't determine which function to call because it is overloaded and it doesn't know the context in which it will be called. With CodeWarrior 8 on Mac OS X I get "illegal use of template argument dependent type 'T::result_type' It references an "unspecified" template deep in the bowels of bind. As I recall there was some way of helping bind to pick one of the overloaded functions using a typedef or something similar. (Maybe that was function?). Thanks for any tips, ...Duane

2 2

boost serialization
by Daniel Goller 28 Jan '05

28 Jan '05

are there any problems with boost serialization including linker errors or does this indicate a broken install i have heard of problems with boost serialization but do not know which they might be before running off in the wrong direction i figured i would gather information here to solve this: http://bugs.gentoo.org/show_bug.cgi?id=78043 problem any help on this will be appreciated Daniel

4 6

Regex lib and thread safety
by Leon Mergen 27 Jan '05

27 Jan '05

Hello, I am sorry if this is a stupid question, or simply inappropriatie for this list. I am currently camping with this bug for way too long, so I decided to ask this mailinglist. I am currently in the process of finding out where a segfault is, and how to fix it. Now, I am using the boost regex library to parse my regexes, and for some reason when multiple threads use this regex library, it seems to mess up and generate segfaults (it works perfectly with only one thread). Since it also doesn't always occur on the same place, and doesn't even occur /all/ the times, I have a strong feeling this has something to do with thread safety. On the Boost website is was able to find out that the boost regex library should be thread safe when BOOST_HAS_THREADS is defined; I've tested this, and this worked. ( http://www.boost.org/libs/regex/doc/thread_safety.html ) However, I also was able to find a mailinglist message that provides some instructions on how to make certain boost regex functions thread-safe : ( http://lists.boost.org/MailArchives/boost/msg59110.php ) Now, I am confused; is the boost regex library thread-safe or not ? The solution provided in the mailinglist message ( move the regex_replace () function inside its own scope ) can't be applied here... :( I've posted the stacktrace when the problem occurs and the source of the code 'that matters' below. It also occurs in another function, I've posted the other function too. I hope anyone has any experience with this, or is able to help. Thanks in advance! Regards, Leon Mergen One stacktrace: --- #0 std::string::compare(char const*) const (this=0x0, __s=0x40338b81 "C") at /root/gcc-3.3.2/i686-pc-linux-gnu/libstdc++-v3/include/bits/basic_string.h:257 #1 0x4004b101 in boost::c_regex_traits<char>::update() () from /usr/local/lib/libboost_regex-gcc-1_31.so.1.31.0 #2 0x40084cd9 in boost::reg_expression<char, boost::regex_traits<char>, std::allocator<char> >::set_expression(char const*, char const*, unsigned) () from /usr/local/lib/libboost_regex-gcc-1_31.so.1.31.0 #3 0x080648aa in unsigned boost::reg_expression<char, boost::regex_traits<char>, std::allocator<char> >::set_expression<std::char_traits<char>, std::allocator<char> >>(std::basic_string<char, std::char_traits<char>, >>std::allocator<char> > const&, unsigned) (this=0x413d29cc, >>p=@0x413d2adc, f=34055) at basic_regex.hpp:110 #4 0x080647bf in reg_expression<std::char_traits<char>, std::allocator<char> > (this=0x413d29cc, p=@0x413d2adc, f=33031, a=@0x413d29bc) at basic_regex.hpp:114 #5 0x0806474c in basic_regex<std::char_traits<char>, std::allocator<char> > (this=0x413d29cc, p=@0x413d2adc, f=33031, a=@0x413d29bc) at basic_regex.hpp:361 #6 0x080633ee in RegexEngine::parseReplaceRegex(std::string*, std::string*, std::string*) (this=0x80d1160, regex=Cannot look up value of a typedef) at RegexEngine.cc:8 #7 0x0808070a in ModuleDigitsToText::applyModule(std::string*, std::string) (this=0x80d3190, data=0x80d16e0, language= {static npos = 4294967295, _M_dataplus ={<allocator<char>> = {<No data fields>}, _M_p = 0x80d244c "en"}, static _S_empty_rep_storage = {0, 0, 77, 0}}) at ModuleDigitsToText.cc:565 #8 0x08080270 in ModuleDigitsToText::applyModule(InputData*) (this=0x80d3190, inputData=0x80d16d8) at ModuleDigitsToText.cc:527 #9 0x08062200 in ModuleParser::parse(InputData*) (this=0x80d1150, inputData=0x80d16d8) at ModuleParser.cc:105 #10 0x0805e1db in Normaliser::normalise() (this=0x80d1698) at Normaliser.cc:107 #11 0x080831f4 in Client::operator()() (this=0x80ca808) at Client.cc:44 #12 0x080542bf in boost::detail::function::void_function_obj_invoker0<Client, void>::invoke(boost::detail::function::any_pointer) (function_obj_ptr= {obj_ptr = 0x80ca808, const_obj_ptr = 0x80ca808, func_ptr = 0x80ca808, data = "\b"}) at function_template.hpp:128 #13 0x400a69f4 in boost::thread_group::join_all() () from /usr/local/lib/libboost_thread-gcc-mt-1_31.so.1.31.0 #14 0x401cff60 in pthread_start_thread () from /lib/i686/libpthread.so.0 #15 0x401d00fe in pthread_start_thread_event () from /lib/i686/libpthread.so.0 #16 0x402f7327 in clone () from /lib/i686/libc.so.6 --- And are the two functions where the segfault occurs. Line 8 of RegexEngine.cc is the "boost::regex expression(*regex);" line of the parseReplaceRegex() function. --- std::string RegexEngine::parseReplaceRegex (const std::string * regex, const std::string * replace, const std::string * subject) { // Create an expression out of the regex boost::regex expression(*regex); // Return the replaced regex { return boost::regex_replace(*subject, expression, *replace, boost::match_default | boost::format_sed); } } bool RegexEngine::parseMatchRegex (std::string * regex, std::string * subject, RegexResultSet * what) { #ifdef DEBUG std::cout << "+ RegexEngine::parseMatchRegex[long] ( " << *regex << ", " << *subject << " )" << std::endl; #endif // DEBUG // Prepare result set boost::match_results <std::string::const_iterator> results; // Create string iterators std::string::const_iterator start = subject->begin(); std::string::const_iterator end = subject->end(); // Initialise boolean to know wether a match was reached bool success = false; // Create an expression out of the regex boost::regex expression(*regex); std::vector < std::string > regexResults; // Iterate over the results while (boost::regex_search(start, end, results, expression, boost::match_default)) { regexResults.clear(); for (boost::match_results<std::string::const_iterator>::iterator i = results.begin(); i != results.end(); ++i) { regexResults.push_back(*i); } // Push back a result what->push_back(regexResults); // Set new string iterator start = results[0].second; // Mark that a match was reached success = true; } #ifdef DEBUG std::cout << "- RegexEngine::parseMatchRegex ()" << std::endl; #endif // DEBUG // Return wether a match was reached return success; } ---

4 11

time_period constructor question
by Stuart Siegel 27 Jan '05

27 Jan '05

Can anyone tell me why the line: time_period t4(t2); in the attached cpp file doesn't compile but the line: time_period t3(t1); does? it seems like i should be calling the same copy constructor in both cases but g++ 3.3.4 complains: error: no matching function for call to ` boost::date_time::period<boost::posix_time::ptime, boost::posix_time::time_duration>::period(boost::posix_time::time_period (&)(boost::posix_time::ptime, boost::posix_time::ptime))' /usr/include/boost/date_time/period.hpp:64: error: candidates are: boost::date_time::period<boost::posix_time::ptime, boost::posix_time::time_duration>::period(const boost::date_time::period<boost::posix_time::ptime, boost::posix_time::time_duration>&) /usr/include/boost/date_time/period.hpp:109: error: boost::date_time::period<point_rep, duration_rep>::period(point_rep, duration_rep) [with point_rep = boost::posix_time::ptime, duration_rep = boost::posix_time::time_duration] /usr/include/boost/date_time/period.hpp:99: error: boost::date_time::period<point_rep, duration_rep>::period(point_rep, point_rep) [with point_rep = boost::posix_time::ptime, duration_rep = boost::posix_time::time_duration] //--------------------------------cut here------------------- #include "boost/date_time/posix_time/posix_time_types.hpp" #include "boost/date_time/gregorian/gregorian_types.hpp" int main() { using namespace boost::posix_time; using namespace boost::gregorian; //---------------------------------------------- date dmin( min_date_time) ; ptime tmin( dmin ); date dmax( max_date_time) ; ptime tmax( dmax ); time_period t1( tmin, tmax ); //--------------------------------------------- time_period t2( ptime(min_date_time), ptime(max_date_time) ); //why does this compile (on g++ 3.3.4) time_period t3(t1); //but this doesn't? i.e., why isn't a time_period a time_period a time_period? time_period t4(t2); return 0; } __________________________________ Do you Yahoo!? All your favorites on one personal page � Try My Yahoo! http://my.yahoo.com

4 5

analogy to mem_fun_ref to member variables
by Chris Goller 27 Jan '05

27 Jan '05

I have a struct that contains two values. struct box { double width; double length; } vector<box> boxes; I want to accumlate all the widths of the boxes. The only solution I've found is to create a member function get_width that will return the width for use in mem_fun_ref eg: accumulate(make_transform_iterator(boxes.begin(), mem_fun_ref(&boxes::get_width)), make_transform_iterator(boxes.end(), mem_fun_ref(&boxes::get_width)), 0.0, plus<double>())); Is there a boost way of not using mem_fun_ref, but rather returns the public member variable. Something that could be named mem_var_ref that would look like this: accumulate(make_transform_iterator(boxes.begin(), mem_var_ref(&boxes::width)), make_transform_iterator(boxes.end(), mem_fun_ref(&boxes::width)), 0.0, plus<double>())); This way I wouldn't need to add extra get logic to a structure that doesn't really need it othewise. Thanks, Chris

3 2

boost/graph 1.32.0 : compilation errors on a SUN machine
by laurent de Vito 26 Jan '05

26 Jan '05

Hello, I cannot compile the boost/graph library 1.32.0 on a SUN machine using Sun C++ 5.5. I get the following error message : boost_1_32_0/boost/graph/depth_first_search.hpp", line 377: Error: Default arguments cannot be added in later declarations of the template function in the same scope. which does make sense since the compiler cannot decide which routine depth_first_visit to use if the second routine (line 371) has an extra template but the the extra template has a default value. So in boost/graph/depth_first_search.hpp, I simply deleted the default argument : template <class IncidenceGraph, class DFSVisitor, class ColorMap, class TerminatorFunc> void depth_first_visit (const IncidenceGraph& g, typename graph_traits<IncidenceGraph>::vertex_descriptor u, DFSVisitor vis, ColorMap color, TerminatorFunc func = TerminatorFunc()) becomes template <class IncidenceGraph, class DFSVisitor, class ColorMap, class TerminatorFunc> void depth_first_visit (const IncidenceGraph& g, typename graph_traits<IncidenceGraph>::vertex_descriptor u, DFSVisitor vis, ColorMap color, TerminatorFunc func) Unfortunately the compilation was afterwards not successful; this time I got "boost_1_32_0/boost/graph/named_function_params.hpp", line 500: Error: Cannot return const boost::bgl_named_params<boost::detail::components_recorder<int*>, boost::graph_visitor_t, boost::no_property> from a function that should return boost::detail::error_property_not_found. "boost_1_32_0/boost/graph/depth_first_search.hpp", line 354: Where: While instantiating "boost::get_param<boost::graph_visitor_t, boost::root_vertex_t, boost::detail::components_recorder<int*>, boost::no_property>(const boost::bgl_named_params<boost::detail::components_recorder<int*>, boost::graph_visitor_t, boost::no_property>&, boost::root_vertex_t)". "boost_1_32_0/boost/graph/depth_first_search.hpp", line 354: Where: Instantiated from non-template code. "boost_1_32_0/boost/graph/depth_first_search.hpp", line 355: Error: Could not find a match for boost::vertices<boost::T>(const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, boost::listS>). big thanks for any help, Laurent

3 3

uBLAS, Inverse of Matrices -- Urgent
by Hossein Haeri 26 Jan '05

26 Jan '05

Dear all, Am I missing anything? Isn't there any mechinary in uBLAS which can compute the inverse of a matrix? That being the case, isn't that hilarious? Or, if there is, what's that? All of the Best, --Hossein ___________________________________________________________ ALL-NEW Yahoo! Messenger - all new features - even more fun! http://uk.messenger.yahoo.com

7 34

(?) MPL vs boost.lambda concerning lambda expressions
by Roman 26 Jan '05

26 Jan '05

Hi. Has anybody a suggestion about MPL vs boost.lambda concerning lambda expressions?

2 1

VC7.1 Internal Compiler error compiling Graphviz 1-32
by Alessandro Cossetto 26 Jan '05

26 Jan '05

I tried to compile graphviz library but compiling graphviz_digraph_parser.cpp (and graphviz_graph_parser.cpp ) VC7.1 gave me an internal compiler error (compiler file 'msc1.cpp', line 2701). The error occours in boost\gaph\properties.hpp at line 203: template <class Graph, class Property> struct property_map { private: typedef typename property_kind<Property>::type Kind; typedef typename detail::property_map_kind_selector<Kind>::type Selector; ==> typedef typename Selector::template bind_<Graph, Property> Bind; typedef typename Bind::type Map; public: typedef typename Map::type type; typedef typename Map::const_type const_type; }; It happens when compiler tries to resolve the graph_traits instance (line 124 in graphviz_digraph_parser.cpp) namespace graphviz { ==> typedef boost::graph_traits<GRAPHVIZ_GRAPH>::vertex_descriptor Vertex; typedef boost::graph_traits<GRAPHVIZ_GRAPH>::edge_descriptor Edge; typedef GRAPHVIZ_GRAPH Subgraph; Using GCC I compiled the library wihtout problem. I was not able to find a workarount. Can anyone help me? Alessandro

1 0

[ANN] Interfaces Library
by Jonathan Turkanis 26 Jan '05

26 Jan '05

I am pleased to announce the much anticipated (by me) release of a preliminary version of my interfaces library. The download page and online docs are here: http://www.kangaroologic.com/interfaces/ (For fun, click on "Online Documentation" and then on the Boost logo.) The library is an implementation of Christopher Diggins's proposal to add interfaces to C++, which was posted on comp.std.c++ early last year and later was described in the C/C++ User Journal. It provides a macro-based Interface Definition Language (IDL) which can be used to define C++ class types called interfaces. An interface is a lightweight value type associated with a set of named function signatures. An interface instance can be bound at runtime to any object which implements the interface, i.e., to any object of a type with accessible non-static member functions having the same name and signature as the set of functions associated with the interface. The functions of the bound object can then be invoked through the interface instance using the "dot" operator. Binding is completely non-intrusive: the object's type need not declare any virtual functions or derive from any particular base class. Current applications include: * Non-intrusive dynamic polymorphism - interfaces can often be used in place of abstract base classes, and are sometimes much faster. * Dynamic inheritance - allows function calls to be forwarded automatically to an object specified at runtime. * Smart Interface Pointers - smart pointers which can manage the lifetime of any object whose type implements a given interface. * Smart References - like smart interface pointers, but the managed object is accessed using the dot operator. * The Object Oriented Template Library, a project in the initial stages of development, by Christopher Diggins. Planned future applications include: * Runtime reflection - will allow an interface's functions to be enumerated and looked up by name at runtime * Aspect Oriented Programming as described in a August 2004 Dr. Dobb's Journal article by Christopher Diggins. Possible future applications include: * Integration with component architectures such as COM and CORBA. * Boost.Names - by abstracting the various uses of identifiers in C++ into preprocessor generated types called names, C++ classes and functions can be constructed in a straightforward manner using template metaprogramming. Best Regards, Jonathan

1 0

what does BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP
by Kevin Lee 25 Jan '05

25 Jan '05

I need some expert's opinion on this: When I try to use the boost 1.32.0 in my work env, if i don't define this flag BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP, the lib/smart_ptr/test/intrusive_ptr_test.cpp fails to compile. if i do define it, my compiler would be happy (HP aCC) on intrusive_ptr_test. My questions are: 1) What is the BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP? 2) What will be the other impacts if I do define it in my code globally besides the intrusive_ptr_test? Thanks in advance! Kevin Lee ----------------------------------------- This message and its attachments may contain privileged and confidential information. If you are not the intended recipient(s), you are prohibited from printing, forwarding, saving or copying this email. If you have received this e-mail in error, please immediately notify the sender and delete this e-mail and its attachments from your computer.

2 1

Weak_ptr lost its operator==
by Brian McCandless 25 Jan '05

25 Jan '05

Hi, I just upgraded from boost 1.29 to boost 1.32, and found that operator== for weak_ptr has been dropped between these versions. My code uses std::find to find a weak_ptr in a container. This no longer compiles (g++-3.4.1) since find uses operator==. Has anyone else encountered this kind of problem? What are some good workarounds? Could operator== be put back? Thanks, Brian

2 1

RE: [Boost-users] Serialization problem loading a vector of items
by Foster, Gareth 25 Jan '05

25 Jan '05

I seem to remember being told that std::string was not meant to be inherited from, could it be the same in your case? -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Bill Lear Sent: 24 January 2005 13:43 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Serialization problem loading a vector of items On Friday, January 21, 2005 at 12:29:37 (-0600) Bill Lear writes: >I am curious why loading a vector of items from an input stream fails >using one method but works using a slightly different method. >... I have not seen a response to this post. Along similar lines, I am having problems with sub-classing the std::vector class. I've tried multiple ways, but can't get it to load (de-serialize) properly. I've used private inheritance (my first choice), public inheritance. Neither work. Here is my attempt at public inheritance: template <class T> class RingBuffer: public std::vector<T> { public: RingBuffer() : _first_ind(0), _last_ind(0) { } double first() { return (*this)[_first_ind]; } double last() { return (*this)[_last_ind]; } void add(T v) { _last_ind = (_last_ind + 1) % size(); (*this)[_last_ind] = v; if (_last_ind == _first_ind) { _first_ind = (_first_ind + 1) % size(); } } private: int _first_ind; int _last_ind; friend class boost::serialization::access; template<class Archive> void serialize(Archive& ar, const unsigned int) { ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(std::vector<T>) & BOOST_SERIALIZATION_NVP(_first_ind) & BOOST_SERIALIZATION_NVP(_last_ind); } }; As before, I can save this to a stream, but cannot get it to load from a stream. I am using boost 1.32, with gcc 3.2. Bill _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

3 6

[string_algo] replace repeated char with single instance?
by Jeff Flinn 25 Jan '05

25 Jan '05

Am I required to use regex_finder to replace repeated chars with a single instance? I'm trying to cleanup a string for use with filesystem::path, for example: C:\\abc///def\\ghi => C:\abc\def\ghi There may be mixed forward and back-slashes. These are from environment variables that apparently are required by our use of NutCracker to support legacy apps under windows. If I need to use regex_finder what are the benefits of the string_algo versus just using the regex library? Thanks, Jeff

5 10

C++ Template Metaprogramming - factorial example
by Brad Austin 25 Jan '05

25 Jan '05

Aleksey Gurtovoy wrote: > > Also, the first argument to eval_if is supposed to be an integral > > constant, and T4 is an expression of the form mpl::equal_to<T7,T8>, > > which again is just a nullary function, not an integral constant. > > Not if T7 and T8 are Integral Constants, see > http://www.boost.org/libs/mpl/doc/refmanual/equal-to.html. Okay, I see that now. Sorry, my mistake.

1 0

Re: C++ Template Metaprogramming - factorial example
by Brad Austin 24 Jan '05

24 Jan '05

I wrote: > I recently purchased David Abrahams' and Aleksey Gurtovoy's new book > on the MPL, "C++ Template Metaprogramming" (obviously recently since > it's only been out a couple of weeks), and am working through some of > the examples. I'm having trouble with the factorial example in section > 8.3.1, page 160: > > #include <boost/mpl/int.hpp> > #include <boost/mpl/multiplies.hpp> > #include <boost/mpl/equal.hpp> > #include <boost/mpl/eval_if.hpp> > #include <boost/mpl/prior.hpp> > #include <boost/static_assert.hpp> > > namespace mpl = boost::mpl; > > template <class N> > struct factorial > : mpl::eval_if< > mpl::equal_to<N,mpl::int_<0> > // check N == 0 > , mpl::int_<1> // 0! == 1 > , mpl::multiplies< // N! == N * (N-1)! > N > , factorial<typename mpl::prior<N>::type> > > > > > { > BOOST_STATIC_ASSERT(N::value >= 0); // for nonnegative N > }; > > There's a minor issue in that equal.hpp is (apparently) mistakenly > included instead of equal_to.hpp, but even after fixing that, I can't > get this to compile in the form in which it's written. Should it, or > is it broken? After spending some more time on this I now believe the code is broken. There's some uncertainty because mpl::multiplies<> has apparently been either renamed or replaced with mpl::times<>, and only the latter is documented in the MPL Reference Manual, so I'm not certain whether or not the two behave identically. However changing "multiplies" to "times" didn't seem to make any difference in terms of the compilation errors, so in the analysis that follows I'm making the assumption that if there is any difference, it isn't doesn't change anything relevant to the problem at hand. According to the MPL Reference Manual, in an expression of the form mpl::times<T1,T2>, T1 and T2 must meet the requirements of an integral constant, not merely the weaker requirements of a nullary metafunction. In this case T2 is an expression of the form factorial<T3>, so for this to be vaild factorial<> must model an integral constant, not merely a metafunction *returning* an integral constant. However factorial<> derives from an expression of the form mpl::eval_if<T4,T5,T6>, and doesn't add any nested types or a value of its own. Therefore factorial<> only models an integral constant if mpl::eval_if<T4,T5,T6> does, which it doesn't. mpl::eval_if<T4,T5,T6>::type models an integral constant (provided T5:type and T6::type do), but mpl::eval_if<T4,T5,T6> is merely a metafunction returning that constant. Also, the first argument to eval_if is supposed to be an integral constant, and T4 is an expression of the form mpl::equal_to<T7,T8>, which again is just a nullary function, not an integral constant. So technically this would appear to be wrong, even though eval_if doesn't seem to mind in this case. FWIW, here's the final version of factorial<> I came up with. This version models an integral constant, and accepts for its argument either an integral constant or a nullary metafunction returning an integral constant: template <class N> struct factorial : mpl::if_< typename mpl::equal_to< typename N::type, mpl::int_<0> >::type, mpl::int_<1>, mpl::times< typename N::type , factorial< typename mpl::prior<typename N::type>::type > > >::type::type {}; Anyway, is this mailing list an appropriate place to bring up issues like this? I know David and Aleksey are members, but I'm not clear on whether their book qualifies as an official Boost product.

3 2

Re: [Boost-users] boost::tuple problem
by Victor A. Wagner Jr. 24 Jan '05

24 Jan '05

At Saturday 2005-01-22 08:22, you wrote: > hello everyone, >     what's the difference between "tuple<int> t;"  > and  " tuple<int> t();" >why > tuple<int> t; > cout<<t; >is ok. >But > tuple<int> t(); this declares a function named t which takes no arguments and returns a tuple<int> it does NOT define a variable named t. > cout<<t; >make a link error. >I'm using >vs.net2003__________________________________________________________________»¶ÓÊ¹ÓÃACMAIL >ÓÊ¼þÏµÍ³ > > > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users Victor A. Wagner Jr. http://rudbek.com The five most dangerous words in the English language: "There oughta be a law"

2 1

Serialization problem loading a vector of items
by Bill Lear 24 Jan '05

24 Jan '05

I am curious why loading a vector of items from an input stream fails using one method but works using a slightly different method. Given a load method: template <class T> T* load(std::istream& in) { boost::archive::xml_iarchive ia(in); T* t; ia & BOOST_SERIALIZATION_NVP(t); return t; } and use of it: vector<item>* v = load<vector<item> >(std::cin); I get: uncaught exception: stream error But, when I use this load method: template<class T> void load(std::istream& in, std::vector<T*>& v) { boost::archive::xml_iarchive ia(in); ia >> BOOST_SERIALIZATION_NVP(v); } and use it so: vector<item> v; load(std::cin, v); it works perfectly. Is there some reason the first method should fail? Bill

2 2

serialization library problems with MFC support for OLE Controls
by Muruganathan Annamalai 24 Jan '05

24 Jan '05

hi, Iam using VC6. I had problems using boost serialization library classes with MFC support for OLE controls. This is what I have, #include <afxctl.h> // MFC support for OLE Controls #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> ............. .............. When I compiled the code I got errors like, :\boost\boost-1_32\boost/archive/basic_text_iprimitive.hpp(72) : error C2039: 'char_type' : is not a member of 'IStream' D:\Devstudio_6.0\VC98\INCLUDE\objidl.h(4049) : see declaration of 'IStream' D:\boost\boost-1_32\boost/archive/basic_text_iprimitive.hpp(121) : see reference to class template instantiation 'boost::archive::basic_text_iprimitive<IStream>' being compiled D:\boost\boost-1_32\boost/archive/basic_text_iprimitive.hpp(72) : error C2065: 'char_type' : undeclared identifier D:\boost\boost-1_32\boost/archive/basic_text_iprimitive.hpp(121) : see reference to class template instantiation 'boost::archive::basic_text_iprimitive<IStream>' being compiled D:\boost\boost-1_32\boost/archive/basic_text_iprimitive.hpp(73) : error C2039: 'traits_type' : is not a member of 'IStream' D:\Devstudio_6.0\VC98\INCLUDE\objidl.h(4049) : see declaration of 'IStream' I think, error is because MFC has class called IStream. And the same name IStream is used as template parameter in the boost class. Is there anything I can do to overcome this problem. annamalai

2 1

implicit conversion
by Benjamin Schmeling 24 Jan '05

24 Jan '05

Hi, I am working on exposing a bigint class to python. Now I've got the problem that methods which take an bigint as an parameter do not accept Python longs. For example: import _PythonLiDIA x=123L; c=_PythonLiDIA.bigint(); _PythonLiDIA.gcd(c,x); Traceback (most recent call last): File "test.py", line 132, in ? _PythonLiDIA.gcd(a,x); Boost.Python.ArgumentError: Python argument types in _PythonLiDIA.gcd(bigint, long) did not match C++ signature: gcd(LiDIA::bigint, LiDIA::bigint) I don't know how to achieve implicit conversion at this point, turning an long automatically into an bigint. The other way round, turning an bigint into long can be realized by defining __long__. Can someone help me please? Benjamin

1 0

program_options usage question
by John Eddy 24 Jan '05

24 Jan '05

Hello, I was wondering if it is possible to have an option for which supplying an argument is optional. For example, suppose I have an executable called myprog and an option "o" that does something. Is it possible to allow both of the following command line syntaxes? myprog --o arg myprog --o Where in the second case I can programatically supply some default value? So the first would instruct the program to take the action associated with the "o" option using the supplied arg and the second would instruct it to take that action using the default argument value. I have been fooling with the default_value and implicit methods but neither seems to do what I want. Thanks, John Eddy johneddy(a)eng.buffalo.edu

1 0

MPL vs BLL
by Roman 24 Jan '05

24 Jan '05

Hi. Any suggestion about mpl vs bll? Will they merge someday, or go concurrently? I haven't found anything on the net about it. I'm using bll currently. Thanks. Roman.

1 0

uBLAS Matrix and Vector IO
by Pascal Bauer 24 Jan '05

24 Jan '05

Hi Boost-Users, Does Anybody know, whether there is a routine to save / read (double) Matrices in a BINARY format? Thanx in Advance. Pascal Bauer

1 0

Tiny bug in boost::threads documentation (bibliographic reference)
by Andreas Wachowski 24 Jan '05

24 Jan '05

Hello, ok, this is, how shall I say it, more of a Knuthish bug, but a bug it is, so I might as well report it: In the bibliography of the boost:threads documentation, a reference is erroneous. It says [Hansen73] ACM Computing Surveys. Vol. 5. No. 4. December, 1983. Per Brinch. "Concurrent Programming Concepts" but instead it should be [Hansen73] ACM Computing Surveys. Vol. 5. No. 4. December, 1973. Per Brinch. "Concurrent Programming Concepts" (1973 instead of 1983) Best regards, Andreas

2 1

passing shared_ptr<> by_value or by-reference?
by Kosta 23 Jan '05

23 Jan '05

Hi! Don't know, if this is a FAQ, but I couldn't find an answer to this question: Is there a common sense about how a shared_ptr<> should be passed to functions/methods: by-value or by-(const-)reference? 1) void test(boost::shared_ptr<A> a); 2) void test(boost::shared_ptr<A>& const a);

7 6

Re: [Boost-users] boost::tuple problem
by Peter Dimov 23 Jan '05

23 Jan '05

heroboy wrote: > hello everyone, >     what's the difference between "tuple<int> > t;"  and  " tuple<int> t();" why > tuple<int> t; > cout<<t; > is ok. > But > tuple<int> t(); > cout<<t; > make a link error. Because tuple<int> t(); is a function returning a tuple<int>.

1 0

RE: [Boost-users] boost::tuple problem
by Shriram V 23 Jan '05

23 Jan '05

Hi, Your problem is a basic C++ problem, nothing to do with tuple<>s! Aren't you declaring a function with "tuple<int> t()" ? Thanks, -Shriram. | -----Original Message----- | From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- | bounces(a)lists.boost.org] On Behalf Of heroboy | Sent: Saturday, January 22, 2005 8:53 PM | To: boost-users | Subject: [Boost-users] boost::tuple problem | | hello everyone, |     what's the difference between "tuple<int> t;"  | and  " tuple<int> t();" | why | tuple<int> t; | cout<<t; | is ok. | But | tuple<int> t(); | cout<<t; | make a link error. | I'm using | vs.net2003________________________________________________________________ | __欢迎使用ACMAIL 邮件系统 | | | | _______________________________________________ | Boost-users mailing list | Boost-users(a)lists.boost.org | http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Re: boost::tuple problem
by Franz Schnyder 23 Jan '05

23 Jan '05

heroboy schrieb: > hello everyone, >     what's the difference between "tuple<int> t;"  and  " tuple<int> t();" "tuple<int> t;" creates an instance of the type tuple<int>. "tuple<int> t();" declares a function t() with return type tuple<int>. If the constructor takes no argument you must create the instance without the brackets or the compiler takes it as a function declaration > why > tuple<int> t; > cout<<t; > is ok. > But > tuple<int> t(); > cout<<t; > make a link error. the linker can't find the definition of the function "tuple<int> t()" > I'm using vs.net2003__________________________________________________________________欢迎使用ACMAIL 邮件系统

1 0

C++ Template Metaprogramming - factorial example
by Brad Austin 23 Jan '05

23 Jan '05

I recently purchased David Abrahams' and Aleksey Gurtovoy's new book on the MPL, "C++ Template Metaprogramming" (obviously recently since it's only been out a couple of weeks), and am working through some of the examples. I'm having trouble with the factorial example in section 8.3.1, page 160: #include <boost/mpl/int.hpp> #include <boost/mpl/multiplies.hpp> #include <boost/mpl/equal.hpp> #include <boost/mpl/eval_if.hpp> #include <boost/mpl/prior.hpp> #include <boost/static_assert.hpp> namespace mpl = boost::mpl; template <class N> struct factorial : mpl::eval_if< mpl::equal_to<N,mpl::int_<0> > // check N == 0 , mpl::int_<1> // 0! == 1 , mpl::multiplies< // N! == N * (N-1)! N , factorial<typename mpl::prior<N>::type> > > { BOOST_STATIC_ASSERT(N::value >= 0); // for nonnegative N }; There's a minor issue in that equal.hpp is (apparently) mistakenly included instead of equal_to.hpp, but even after fixing that, I can't get this to compile in the form in which it's written. Should it, or is it broken? I'm using gcc 3.3-23 on Linux. The first meaningful line in the error novel I get is: error: no type named `tag' in `struct factorial<mpl_::int_<0> >' I was able to get a modified version to work, but only by explicitly invoking the eval_if metafunction and wrapping the result in a constant wrapper, like so: template <class N> struct factorial : mpl::int_< mpl::eval_if< mpl::equal_to<N,mpl::int_<0> > , mpl::int_<1> , mpl::multiplies< N , factorial<typename mpl::prior<N>::type> > >::type::value > { }; But as this is a less-than-trivial departure from the book version, I don't feel comfortable moving on without first gaining a better understanding of what's going wrong. Thanks in advance to anyone who can offer some insight.

1 0

[program_options] How do I read a vector of strings?
by Matthew P. Cashdollar 22 Jan '05

22 Jan '05

Hello, I have been using program_options for a while and it works great. However, I don't know how to make a program which behaves like this: programname -blah abc -blah def -blah ghi In my code I would read the option blah as a vector of strings, like: po::options_description desc("Configuration"); desc.add_options() ("blah", po::value<vector<string>>(), "the location of the blah device") ; po::store(po::parse_config_file(config_file, desc), vm); po::notify(vm); etc. When I try to compile the code under MSVC++ 7.0 I get this error (among others): error C2947: expecting '>' to terminate template-argument-list, found '>>' Is it possible for me to do what I am trying to with the program_options library? Thanks, -Matt

3 2

date_time::microsec_clock questions
by Donato Petrino 22 Jan '05

22 Jan '05

Hello, 2 questions regarding the microsec_clock: - Why it just have 'local_time()' but not 'universal_time()' member? (Analogous to the second_clock. I know that it can be converted to UTC, but its inefficient and I have to know in which time zone the program runs.) - For what reason "::std::time(&t)" in "microsec_time_clock.hpp:58" is called? gettimeofday()'s "tv->tv_sec" already has the sec's since 1.1.1970, so there is no need for this extra call. Is it a bug? Thank you in advance! -- Donato Petrino Petrino EDV-Beratung Darmstädter Str. 29 64331 Weiterstadt T +49 6150 5418-11 F +49 6150 5418-18 email: dpetrino(a)petrino-edv.de

2 1

date_time and negative time_durations
by Erik Thiele 22 Jan '05

22 Jan '05

hi the docs of time_duration say that minutes() returns 0..59 and seconds() return 0..59. this is not true, the correct answer is, minutes() returns -59..+59 and seconds() also. the handling of negative durations is not fully documented. i.e. is it true that the sign of hours(),minutes() and seconds() is always equal to each others sign? x=time_duration(anything...); y=x.invert_sign(); is the following true for all values of x: abs(x.hours()) == abs(y.hours()) abs(x.minutes()) == abs(y.minutes()) abs(x.seconds()) == abs(y.seconde()) but whatever way you document it, it should somehow be documented. to continue on my work i now make the assumption that in the following assertions are true for all values of x: if (x.is_negative()) x = x.invert_sign(); assert(x.hours()>=0); assert(0<=x.minutes()<=59); assert(0<=x.seconds()<=59); i hope this assertions are correct for all values of x !!!!! :) cya! erik

2 1

boost::tuple problem
by heroboy 22 Jan '05

22 Jan '05

hello everyone,     what's the difference between "tuple<int> t;"  and  " tuple<int> t();" why tuple<int> t; cout<<t; is ok. But tuple<int> t(); cout<<t; make a link error. I'm using vs.net2003__________________________________________________________________欢迎使用ACMAIL 邮件系统

1 0

Re: strange filesystem dll behaviour (Beman Dawes)
by Christian Hoffmann 22 Jan '05

22 Jan '05

Hi, I guess, you don't define BOOST_ALL_DYN_LINK Rgds -- Christian Hoffmann Trema Laboratories SARL -----Original Message----- From: boost-users-request(a)lists.boost.org [mailto:boost-users-request@lists.boost.org] Sent: Friday, January 21, 2005 6:12 PM To: boost-users(a)lists.boost.org Subject: Boost-users Digest, Vol 437, Issue 3 Send Boost-users mailing list submissions to boost-users(a)lists.boost.org To subscribe or unsubscribe via the World Wide Web, visit http://lists.boost.org/mailman/listinfo.cgi/boost-users or, via email, send a message with subject or body 'help' to boost-users-request(a)lists.boost.org You can reach the person managing the list at boost-users-owner(a)lists.boost.org When replying, please edit your Subject line so it is more specific than "Re: Contents of Boost-users digest..." Today's Topics: 1. Re: strange filesystem dll behaviour (Beman Dawes) 2. Re: unordered_map/hash_table bug? (Daniel James) 3. Re: Re: (newbie) Linking problem using unit testframework(Mac OSX 10.3.7 gcc 3.3 XCode 1.5). (Gennadiy Rozental) ---------------------------------------------------------------------- Message: 1 Date: Fri, 21 Jan 2005 10:18:02 -0500 From: Beman Dawes <bdawes(a)acm.org> Subject: Re: [Boost-users] strange filesystem dll behaviour To: boost-users(a)lists.boost.org, boost-users(a)lists.boost.org Message-ID: <6.0.3.0.2.20050121100502.049f35e0(a)mailhost.esva.net> Content-Type: text/plain; charset="us-ascii"; format=flowed At 01:12 AM 1/20/2005, Paul wrote: >I looked deeper into the problem, and hacked up boost a little to find >out that the problem is the following check: > > if ( (checker == no_check || checker == native) && src.size() >= 2 ) >at path_posix_windows.cpp:243 > >specifically checker==native. > >I had constructed path with boost::filesystem::native, but when I hacked >it up to do the following: > ># ifdef BOOST_WINDOWS > std::stringstream ss; ss << "checker=" << >reinterpret_cast<unsigned long>(checker) << std::endl > << "native=" << reinterpret_cast<unsigned long>(native) << >std::endl; > boost::throw_exception( filesystem_error( > "boost::filesystem::path", > ss.str() )); > > if ( (checker == no_check || checker == native) && src.size() >= 2 ) > > >I got the following results from calling the line: >boost::filesystem::path p(s,boost::filesystem::native); > > >linking to libboost_filesystem-mgw-d-1_32.lib: >checker=4201048 native=4201048 > >linking to boost_filesystem-mgw-d-1_32.dll: >checker=4263776 native=1649966248 > > >so, it appears that testing the checker using the address of a function >is unreliable in a DLL context? Have I compiled my program/library >incorrectly? I am not too familiar with DLL details etc, can someone >else please shed some light on this? I'm not a DLL expert either, but it certainly looks like there is some problem with address of functions across DLL boundaries. This code will be going away in the next version of the library, so I'm not sure if it is worth putting a lot of effort into fixing it. But I'll try to reproduce the problem here. If it does reproduce, it shouldn't be too hard to come up with an interim fix. Thanks for the report, --Beman ------------------------------ Message: 2 Date: Fri, 21 Jan 2005 16:15:48 +0000 From: Daniel James <daniel(a)calamity.org.uk> Subject: [Boost-users] Re: unordered_map/hash_table bug? To: boost-users(a)lists.boost.org Message-ID: <csr9ro$ma$1(a)sea.gmane.org> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Thorsten Ottosen wrote: > "Martin Wartens" <martin.wartens(a)my-mail.ch> wrote in message > news:380-22005121815022188@my-mail.ch... > Hi, > has anybody tried the implementation of unordered map that can be found at > http://groups.yahoo.com/group/boost/files/jtc1-sc22-wg21-2003-n1456.tar. gz ? > I believe there is a bug in the rehash function of the underlying > hash_table. The new bucket indices are computed using the old number of > buckets. That means that the items stored in these buckets cannot be found > anymore later. > ------- > > Btw, would you mind to submit a patch to me to fix this bug? > > Thanks > > Thorsten Hi Thorsten, I'm working a new version which fixes this (and a few other) bugs. I'll upload it the file vault soon. Daniel ------------------------------ Message: 3 Date: Fri, 21 Jan 2005 11:21:43 -0500 From: "Gennadiy Rozental" <gennadiy.rozental(a)thomson.com> Subject: [Boost-users] Re: Re: (newbie) Linking problem using unit testframework(Mac OSX 10.3.7 gcc 3.3 XCode 1.5). To: boost-users(a)lists.boost.org Message-ID: <csra6n$1sg$1(a)sea.gmane.org> > c++filt _ZTv0_n12_NSoD0Ev > virtual thunk to std::basic_ostream<char, std::char_traits<char> >::~basic_ostream() > Then I tried to run just this: > #include <iostream> > > int main (int arc, char** argv) > { > std::cout << "test"; > } > ... and it failed with the same error. > However, if I remove from the project the unit test framework files, it runs fine. Hmm... > I am using libstdc++.a. I don't understand what is happening. So do I. > Why when I add the unit test framework code it doesn't find the standard library ~basic_ostream() anymore ? Most probably looks like compiler bug > It seems these last 5 years doing only Java got me really rusty with C++ (I'd rather work with C++ but the market forced me to go to Java). I don't think 'last 5 years doing only Java' has anything to do with this. Let's try couple more thigs: 1. Could you locate where this undefined symbol referenced from? 2. Could you build framework as a standalone library and link with it? Gennadiy ------------------------------ _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users End of Boost-users Digest, Vol 437, Issue 3 ******************************************* This message, including any attachments, is intended only for the person(s) to whom it is addressed. If you received it in error, please let us know and delete the message from your system. This message may be confidential and may fall under the duty of non-disclosure. Any use by others than the intended addressee is prohibited. Trema shall not be liable for any damage related to the electronic transmission of this message, such as failure or delay of its delivery, interception or manipulation by third parties, or transmission of viruses or other malicious code.

2 1

How to automatically release legacy resources?
by Aaron W. LaFramboise 22 Jan '05

22 Jan '05

I was writing some simple code today, and rediscovered this general sort of problem, and realized I have not yet decided on an optimal solution. Given: 1) During a particular function, a type-int variable is initialized with a value corresponding to a POSIX file descriptor. 2) There are multiple paths of exit from the function, including both returns and exceptions. Problem: What is the best way to ensure that the file descriptor is automatically close()ed when the function is exited? An additional thorn is that there must be code for handling that case where close() fails. The solution must handle both cases where I'd like to throw an exception, or cases where I'd just like to print an error message and continue. I have considered various solutions, some involving throw away classes, and none of them appear to be satisfactory. So far, the best solution I have is to create a reusable helper (based on templates and boost::function) that is created as an automatic variable and is passed the file descriptor, and a functor (which may be a boost.lambda expression) that calls close(), and contains any other necessary error-processing code. But seriously, for such a simple problem, this is insane! Solutions I don't particularly like involve creating a non-reusable throw-away class that handles just this one particular case, or lack sufficient mechanisms for handling errors. Any ideas? Aaron W. LaFramboise

5 8

[Boost-users - newbie]Conditional insertion into a mpl::list_c
by suresh.t＠philips.com 21 Jan '05

21 Jan '05

hi, I am new to boost. I have a class that takes in 10 template parameters (std::size_t N1 to N10). I need to create a mpl::list_c using N1 to N10. I have an empty mpl::list_c (acc). I plan to check each of N1 to N10 and if the value > 0 i will insert into the list. Can someone please tell me how i could do this. I have tried for one N1 alone using an mpl::if_ but that doest seem to work template <std::size_t N1,std::size_t N2 =0,std::size_t N3 = 0, std::size_t N4 = 0,std::size_t N5 = 0, std::size_t N6 = 0,std::size_t N7 = 0, std::size_t N8 = 0,std::size_t N9 = 0,std::size_t N10 = 0> struct access_list{ typedef mpl::list_c<int> acc; //I tried for N1 this way but this does not word typedef mpl::if_< mpl::bool_<N1 != 0>, typename mpl::push_back<acc,mpl::int_<N1> >::type, mpl::false_ >::type type; }; --------------------------------------------------------------------------------------------------------- Suresh

1 0

Boost.Preprocessor question
by Cory Nelson 21 Jan '05

21 Jan '05

I am initializing an array like: unsigned char tmp[256]={0, 1, 2, 3, ...} I feel like this is something Boost.Preprocessor could do for me, but am unable to find out how. Anyone know? -- Cory Nelson http://www.int64.org

2 2

implicit conversion (long --> bigint)
by Benjamin Schmeling 20 Jan '05

20 Jan '05

Hi, thanks Ben your advice with radd worked fine. Now when I am going further for my bigint class I have the problem that methods which take an bigint as an parameter do not accept longs. For example: >>import _PythonLiDIA >>x=123L; >>c=_PythonLiDIA.bigint(); >>_PythonLiDIA.gcd(c,x); Traceback (most recent call last): File "test.py", line 132, in ? _PythonLiDIA.gcd(a,x); Boost.Python.ArgumentError: Python argument types in _PythonLiDIA.gcd(bigint, long) did not match C++ signature: gcd(LiDIA::bigint, LiDIA::bigint) I don't know how to achieve implicit convertion at this point, turning an long automatically into an bigint. The other way round, turning an bigint into long can be realized by defining __long__. Is it possible?/Any idea? Benjamin -- GMX im TV ... Die Gedanken sind frei ... Schon gesehen? Jetzt Spot online ansehen: http://www.gmx.net/de/go/tv-spot

1 0

Failed compiling luabind using boost on AIX (xlC): configuration problem?
by Christoph Jaeschke 20 Jan '05

20 Jan '05

Hi all, I failed compiling luabind using boost 1.3.2 on AIX 5.1 (xlC) xlC -c class_rep.cpp -o class_rep.o ... -I.. -I/some_dir/include/boost-1_32 "/some_dir/include/boost-1_32/boost/mpl/aux_/O1_size_impl.hpp", line 33.38: 1540-0827 (S) The constant expression on the #if directive contains a syntax error at "BOOST_TESTED_AT". "/some_dir/include/boost-1_32/boost/mpl/aux_/include_preprocessed.hpp", line 31.13: 1540-0836 (S) The #include file "boost/mpl/aux_/preprocessed/AUX_PREPROCESSED_HEADER" is not found. "/some_dir/include/boost-1_32/boost/mpl/aux_/include_preprocessed.hpp", line 31.13: 1540-0836 (S) The #include file "boost/mpl/aux_/preprocessed/AUX_PREPROCESSED_HEADER" is not found. -- <snipped> -- To me it looks like a configuration problem, but bjam nicely installed the boost-base as specified without any errors. Any help is very appreciated! Christoph

1 0

Problems with std::min when I switched from 1.31 to 1.32
by Scott Moore 20 Jan '05

20 Jan '05

I just switched from boost 1.31 to 1.32 and now any code that uses std::min() or std::max() gives me this error with Visual Studio 2003: ReportResults.cpp(791) : error C2589: '(' : illegal token on right side of '::' ReportResults.cpp(791) : error C2059: syntax error : '::' I even tried something simple like this: int i = std::min(1, 2); And that fails as well. If I switch back to boost 1.31, no problems. I'm sure there must be a simple solution. Any help would be appreciated! Thanks, Scott

5 6

boost::bind and methods of managed classes
by Vasco Lohrenscheit 19 Jan '05

19 Jan '05

Hi, is there a easy way/workaround to use methods of managed classes with boost::bind? boost::signal<void (int value)> testSignal; public __gc class TestManagedClass { public: TestManagedClass() {testSignal.connect(boost:bind(???)); } void test(int i); }; how can I connect the TestManagedClass::test method of a instance of a TestManagedClass to the signal ? It seem already not be allowed to get the adress of the method &OpenGlTestGUI::testMethod (compile error c2843, vc++7.1). Are there any work arounds? Has anybody alread used boost::bind and boost::signal with managed classes? best regards, Vasco Lohrenscheit

3 4

BOOST_FOREACH is not working under VC7.0
by Yaroslav Yanovsky 19 Jan '05

19 Jan '05

Hello boost-users, I know, BOOST_FOREACH is not distributed with boost, but I don't know where else should I write about it so I decided to post it here. BOOST_FOREACH is not compiling under VC 7.0 Here I've wrote small example that represents problem: ----------------------- #include <iostream> #include <list> #include <boost/foreach.hpp> using std::list; class BNamespace { public: list<int> contents; int Find(int what) const; }; inline int BNamespace::Find(int what) const { BOOST_FOREACH (int i, this->contents) //BOOST_FOREACH (const int& i, this->contents) // will fail too if (i==what) return i; return 0; } int main() { BNamespace lst; lst.contents.push_back(4); lst.contents.push_back(5); lst.contents.push_back(6); int i=lst.Find(6); std::cout<<i<<std::endl; return 0; } ----------------------- Compilation of this code on VC 7.0 leads to following errors: a.cpp(15) : error C2667: 'boost::for_each::wrap' : none of 2 overloads have a best conversion f:\Libs\boost\boost\foreach.hpp(138): could be 'boost::for_each::container<T,boost::mpl::true_> boost::for_ each::wrap(const T &)' f:\Libs\boost\boost\foreach.hpp(132): or 'boost::for_each::container<T,boost::mpl::false_> boost::for _each::wrap(T &)' while trying to match the argument list '(const std::list<_Ty,_Ax>)' with [ _Ty=int, _Ax=std::allocator<int> ] a.cpp(15) : error C2668: 'boost::for_each::wrap' : ambiguous call to overloaded function f:\Libs\boost\boost\foreach.hpp(138): could be 'boost::for_each::container<T,boost::mpl::true_> boost::for_ each::wrap(const T &)' f:\Libs\boost\boost\foreach.hpp(132): or 'boost::for_each::container<T,boost::mpl::false_> boost::for _each::wrap(T &)' while trying to match the argument list '(const std::list<_Ty,_Ax>)' with [ _Ty=int, _Ax=std::allocator<int> ] ----------------------- I've tried to compile same code with MinGW and it succeded. Can anyone help me with this problem? Thanks! -- Best regards, Yaroslav mailto:yaroslav@enkord.com

2 2

Re: [Boost-users] Re: (de)serializing vector<const A*>
by Zoltan Szatmary 19 Jan '05

19 Jan '05

Dear Robert Thank you for answering. I am sorry I was not very specific (though please don't think I would put the question without RTFM first ;) ) The part of documentation you pointed to told me to do const_cast manually. It is fine in case of const members of a class, but this time the const type is contained by a vector. I could manually write the serialization code for my vector<const A*> type but I hoped I could use the built-in vector serialization templates in vector.hpp To be clear I copy here the piece of code I am talking about #include <fstream> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/vector.hpp> using namespace std; class A { friend class boost::serialization::access; template<class Archive> void serialize (Archive &ar, const unsigned int version) { } }; /* NEITHER OF THESE HELPS namespace boost { namespace serialization { template <class Archive> inline void serialize (Archive &ar, const A *p, const unsigned int version) { ar & const_cast<A*>(p); } template <class Archive> inline void serialize (Archive &ar, const A &p, const unsigned int version) { ar & const_cast<A&>(p); } }} */ int main() { A a; vector<const A*> v(1, &a); ofstream ofs ("vectorofconstptr"); boost::archive::text_oarchive oa(ofs); oa << v; ofs.close(); // UNTIL THIS POINT EVERYTHING IS FINE // BUT DESERIALIZATION FAILS TO COMPILE ifstream ifs("vectorofconstptr"); boost::archive::text_iarchive ia(ifs); vector<const A*> p; ia >> p; ifs.close(); } Please tell me if I am doing something wrong. I tried to look into the documentation, I have even followed the serialization library code for a while, but eventually decided to ask. Thank you in advance Zoltan >Look in the documentation under Reference/Class Serialization/const members >Robert Ramey >Zoltan Szatmary wrote: >> Hello >> >> could you help please? what is the easiest way to (de)serialize a >> member of type vector<const A*> (A being a base class)? Serializing >> is fine, but deserialization fails to compile since the vector >> deserialization code tries to deserialize a const A* pointer without >> const_cast-ing it (I guess). >> >> Thank you in advance >> >> Zoltan

2 1

long + bigint
by Benjamin Schmeling 19 Jan '05

19 Jan '05

Hi, I am wrapping a class "bigint" from c++ to python. I have overloaded the add method to do something like this on python: >>>n=bigint(5); >>>n+5L 5 This works well, but if I try to do it vice versa my overloaded add method isn't called by python: >>>n=bigint(5); >>>5L+n Causes error. My add methods look like this: bigint add_bigint_l(bigint const& b, long_ const& l) bigint add_l_bigint(long_ const& l,bigint const& b) and are defined by .def("__add__", add_bigint_l) .def("__add__", add_l_bigint) Can someone tell me howto realize it? Benjamin Schmeling -- GMX im TV ... Die Gedanken sind frei ... Schon gesehen? Jetzt Spot online ansehen: http://www.gmx.net/de/go/tv-spot

2 1

re: strange filesystem dll behaviour
by Paul 19 Jan '05

19 Jan '05

Bugger, I forgot to mention: I'm using boost 1.32 and GCC 3.4.2 on a Windows 2000 computer. Thanks Paul Find local movie times and trailers on Yahoo! Movies. http://au.movies.yahoo.com

1 0

RE: [Boost-users] boost::bind and methods of managed classes
by Bjorn.Karlsson＠readsoft.com 19 Jan '05

19 Jan '05

Hello Vasco, > From: Vasco Lohrenscheit [mailto:valoh@krautgames.de] > > is there a easy way/workaround to use methods of managed classes with > boost::bind? It's not exactly easy, but I think it can be done. First of all, you won't be able to take the address of TestManagedClass::test because it's a managed class. Second, the calling conventions of invoking the signal (default: __stdcall) and the function test (__clrcall) are different. Here's a workaround that should work: * Create a nested __nogc class in the __gc class (technically, it doesn't need to be nested, just __nogc). * In the nested class, store a pointer (using gcroot<>, as it's a managed class) to the outer class. * In the constructor of the outer class, create an instance of the nested class. * Define a callback member in both classes. In the inner class, simply forward to the corresponding function in the outer class. * Create the bind expression using the address of the nested class' function. * Invoke the signal and keep your fingers crossed. Here's an example that demonstrates the technique: #include "boost/bind.hpp" #include "boost/signals.hpp" #include "vcclr.h" // For gcroot<> boost::signal<void (int)> sig; __gc class managed_class { public: managed_class() : inner_(new unmanaged_class(this)) { // Connect to the signal sig.connect(boost::bind(&managed_class::unmanaged_class::callback,inner_,_1) ); } void callback(int i) { // This is the managed "callback" } private: // Here's the nested class __nogc class unmanaged_class { public: unmanaged_class(managed_class* outer) : outer_(outer) {} void callback(int i) { outer_->callback(i); } private: gcroot<managed_class*> outer_; }; unmanaged_class* inner_; }; void main() { managed_class* p=new managed_class(); sig(42); // Invokes the signal, // which invokes the binder, // which invokes unmanaged_class::callback(), // which invokes managed_class::callback(). } Bjorn Karlsson

1 0

[Boost-users] Compile on OSX hangs, huge memory usage, xml_grammar.o
by Stian Soiland 19 Jan '05

19 Jan '05

Tried to build boost_1_32_0 on OSX today, but the build process brought the machine to trashing, as cc1plus ended up using all available memory. The problem seems related to libs/serialization - removing it made the rest of boost build almost OK. Here are the details: Mac OS X 10.3.7, with gcc version 3.3 20030304 (Apple Computer, Inc. build 1666) Lots of programs from fink installed to /sw Lots of programs from opendarwin installed to /opt 1. port install boost-jam (3.1.10) 2. Downloaded boost_1_32_0.tar.bz2 from boost.org and unpacked 3. bjam -sTOOLS=darwin stage 4. Start top in another terminal 5. Wait some hours until your hard drive starts to make crazy noises 6. Last bjam output will be: darwin-C++-action bin/boost/libs/serialization/build/libboost_serialization.a/darwin/ release/xml_grammar.o Top will show something like: Processes: 88 total, 2 running, 1 stuck, 85 sleeping... 223 threads 17:46:32 Load Avg: 1.72, 1.89, 1.45 CPU usage: 9.5% user, 30.2% sys, 60.3% idle SharedLibs: num = 131, resident = 7.25M code, 404K data, 136K LinkEdit MemRegions: num = 28961, resident = 896M + 2.28M private, 16.7M shared PhysMem: 111M wired, 601M active, 300M inactive, 1013M used, 10.6M free VM: 7.65G + 88.6M 1116924(79) pageins, 1865004(459) pageouts PID COMMAND %CPU TIME #TH #PRTS #MREGS RPRVT RSHRD RSIZE VSIZE 28631 cc1plus 11.5% 1:51.55 1 12 16184 842M- 804K 543M- 1.09G+ 28630 g++-3.3 0.0% 0:00.03 1 11 18 0K 264K 76K 21.8M 28628 bjam 0.0% 0:07.44 1 12 52 4K 264K 92K 31.2M rm -rf libs/serialization to avoid problem. But I guess some people actually need those xml-grammars.. -- Stian Søiland You can't say civilization don't Trondheim, Norway advance, however, for in every war http://www.soiland.no/ they kill you in a new way. [Rogers] =/\=

2 1

[stringalgo] Tokenizer with string delimiters?
by Stefan Slapeta 19 Jan '05

19 Jan '05

Hi, please could anybody tell if it's possible to use split() to tokenize a string where the token delimiters are strings of - n characters, e.g. "\r\n" - m..n characters, e.g. "\n" _or_ "\r\n" If not, are there alternatives? Thanks, Stefan

2 1

Re: [Boost-users] Re: Re: gregoran::year_based_generator and=?ISO-8859-1?Q? mingw-3.4.2?=
by Antonio Coralles 19 Jan '05

19 Jan '05

boost-users(a)lists.boost.org wrote: > On Tue, 18 Jan 2005 17:19:56 -0700, Bart wrote > >> > i've also tried to compile some other examples - they work, like the >> > rest of my program; maybe there is something wrong with my > installation >> > - but i don't know what. it is also really strange that mingw accepts >> > partial_date [in my app] which is derived from year_based_generator > but >> > refuses to work with year_based_generator*. >> > >> > antonio >> >> I'm stumped. >> >> I tried upgrading to gcc/g++ 3.4 (I extracted these into my original >> mingw installation) and am unable to duplicate your errors. >> >> If you can spare the time, try downloading a fresh boost_1_32_0 archive >> and attempting a print_holidays compile with that source tree. I'm >> wondering if your source tree may have been corrupted somehow. > > That would be my guess at this point too. The fact that the example fails > means something is really off. I just compiled 1_32 with mingw dev-cpp > with > compiler version 3.3.1. The regression tests also succeed for your > combination. More than likely it would have to be something messed up in > boost/date_time/date_generators.hpp -- so you could try just getting the > latest version of that file and replacing it. > > > Jeff i'll try a complete reinstallation of the boost-libraries in the next few days. i think it is more likely that the library isn't correctly installed because i had the same problems with 1_31_0. it is eaven possible that there is something wrong with my mingw installation. antonio

1 0

(de)serializing vector<const A*>
by Zoltan Szatmary 19 Jan '05

19 Jan '05

Hello could you help please? what is the easiest way to (de)serialize a member of type vector<const A*> (A being a base class)? Serializing is fine, but deserialization fails to compile since the vector deserialization code tries to deserialize a const A* pointer without const_cast-ing it (I guess). Thank you in advance Zoltan

2 1

Re: [Boost-users] Re: gregoran::year_based_generator and mingw-3.4.2
by Antonio Coralles 19 Jan '05

19 Jan '05

[snip] > boost-users(a)lists.boost.org <mailto:boost-users@lists.boost.org> wrote: >> "Antonio Coralles" <noche.suapie(a)reflex.at > <mailto:noche.suapie@reflex.at> <mailto:>> wrote in message >> news:41EBE2F0.7020003@reflex.at... >>> i'm writing on a programm which uses the boost date_time library >>> [boost-version = 1.32.0] heavily; while i normally programm in linux >> using >>> gcc-3.3.5 i also need to compile my program in windows from time to >> time. >>> because it makes life easier with another library [gtkmm-2.4.8] i'm >> using >>> mingw-3.4.2; everthing worked fine (my code contains about 10 000 lines >>> using boost_date_time) until i started using a >>> boost::gregorian::year_based_generator. while gcc-3.3.5 in liux >> accepts my >>> code without even a single warning [with -Wall], mingw-3.4.2 complains - >>> it seems that the compiler has problems with year_based_generator: > [snip] [snip] >> Are you able to build the print_holidays example? It uses pointers to >> year_base_generators. [snip] > > i'll try that in the next time and post the results of this experiment; > be the way, i've now compiled my app in win succesfully by putting > evrything which is somehow connected to year_based_generator into > #ifndef WIN32_COMPILE .... #endif. that isn't too bad for the moment, > because i don't use these methods by now in > other parts of my prog [except unit tests]. but sooner or later i will ... > [snip] i've now tried to compile the print_holidays example: this is what i got: $ g++ -lboost_date_time-mgw-1_32 print_holidays.cpp -o test.exe print_holidays.cpp: In function `int main()': print_holidays.cpp:43: error: `year_based_generator' undeclared (first use this function) print_holidays.cpp:43: error: (Each undeclared identifier is reported only once for each function it appears in.) print_holidays.cpp:43: error: template argument 1 is invalid print_holidays.cpp:43: error: template argument 2 is invalid print_holidays.cpp:43: error: invalid type in declaration before ';' token print_holidays.cpp:44: error: `push_back' has not been declared print_holidays.cpp:44: error: request for member of non-aggregate type before '( ' token print_holidays.cpp:45: error: `push_back' has not been declared print_holidays.cpp:45: error: request for member of non-aggregate type before '( ' token print_holidays.cpp:46: error: `push_back' has not been declared print_holidays.cpp:46: error: request for member of non-aggregate type before '( ' token print_holidays.cpp:53: error: `push_back' has not been declared print_holidays.cpp:53: error: request for member of non-aggregate type before '( ' token print_holidays.cpp:55: error: `push_back' has not been declared print_holidays.cpp:55: error: request for member of non-aggregate type before '( ' token print_holidays.cpp:57: error: `push_back' has not been declared print_holidays.cpp:57: error: request for member of non-aggregate type before '( ' token print_holidays.cpp:59: error: `push_back' has not been declared print_holidays.cpp:59: error: request for member of non-aggregate type before '( ' token print_holidays.cpp:64: error: template argument 1 is invalid print_holidays.cpp:64: error: template argument 2 is invalid print_holidays.cpp:64: error: expected `;' before '::' token print_holidays.cpp:65: error: `it' undeclared (first use this function) print_holidays.cpp:65: error: `end' has not been declared print_holidays.cpp:65: error: request for member of non-aggregate type before '( ' token ' token i've also tried to compile some other examples - they work, like the rest of my program; maybe there is something wrong with my installation - but i don't know what. it is also really strange that mingw accepts partial_date [in my app] which is derived from year_based_generator but refuses to work with year_based_generator*. antonio

3 2

mpl::sequence question
by Martin Pasdzierny 19 Jan '05

19 Jan '05

Hello meta programmers, I am looking for a way to extract a sub sequence of a given type list by identifying the begin/end of the sub sequence by the corresponding iterators <code> #include <boost/mpl/vector.hpp> #include <boost/mpl/for_each.hpp> #include <boost/mpl/less.hpp> #include <boost/mpl/greater.hpp> #include <boost/mpl/and.hpp> #include <boost/mpl/find.hpp> #include <boost/mpl/lambda_fwd.hpp> #include <boost/mpl/lambda.hpp> #include <boost/mpl/placeholders.hpp> #include <boost/mpl/if.hpp> #include <boost/mpl/copy.hpp> #include <boost/mpl/copy_if.hpp> #include <boost/mpl/remove_if.hpp> #include <boost/mpl/back_inserter.hpp> #include <boost/mpl/transform.hpp> #include <boost/mpl/push_back.hpp> #include <boost/mpl/int.hpp> // these namespace clauses are motivated from "C++ Template Metaprogramming" by D.Abrahams,A.Gurtovoy: namespace mpl = boost::mpl ; using mpl::placeholders; // But why do I still need to type 'mpl::_1' instead of plain '_1' ? // here is my type list typedef mpl::vector<int,double,std::string > my_types; // from_pos and to_pos are start and end iterators of the subsequence typedef typename mpl::find<my_types,int>::type from_pos; typedef typename mpl::find<my_types,std::string>::type to_pos; // all elements (types) of my_types should be copied into the new seuqence my_sub_types if their iterator (index) is inside the given interval (from_pos,to_pos) typedef mpl::copy_if<my_types, mpl::and_< mpl::greater< mpl::find<my_types,mpl::_1>::type, mpl::int_<from_pos> > , mpl::less< mpl::find<my_types,mpl::_1>::type, mpl::int_<to_pos> > >, mpl::back_inserter< mpl::vector<> > >::type my_sub_types; </code> This code (and lots of slight variations) does not compile. Why ? Any hint (conceptual,syntactical,etc.) is welcome ! regards,Martin. <martin(a)pasdzierny.de>

2 1

Re: [Boost-users] Re: gregoran::year_based_generator and mingw-3.4.2
by Antonio Coralles 18 Jan '05

18 Jan '05

boost-users(a)lists.boost.org wrote: > > "Antonio Coralles" <noche.suapie(a)reflex.at <mailto:>> wrote in message > news:41EBE2F0.7020003@reflex.at... >> i'm writing on a programm which uses the boost date_time library >> [boost-version = 1.32.0] heavily; while i normally programm in linux > using >> gcc-3.3.5 i also need to compile my program in windows from time to > time. >> because it makes life easier with another library [gtkmm-2.4.8] i'm > using >> mingw-3.4.2; everthing worked fine (my code contains about 10 000 lines >> using boost_date_time) until i started using a >> boost::gregorian::year_based_generator. while gcc-3.3.5 in liux > accepts my >> code without even a single warning [with -Wall], mingw-3.4.2 complains - >> it seems that the compiler has problems with year_based_generator: >> >> calendar.hpp:60: error: variable or field `insertGenerator' declared void >> calendar.hpp:60: error: expected `;' before '(' token >> calendar.hpp:92: error: expected `)' before '*' token >> calendar.hpp:95: error: using-declaration for non-member at class scope >> calendar.hpp:95: error: expected `;' before '*' token >> >> here is the header: >> > ...snip... >> maybe somebody can give me a hint - or maybe point out an error in this >> header which is ignored by gcc-3.3.5. >> thanks, >> antonio > > I don't have mingw 3.4 available to me (I have 3.2). I do know the > regressions tests are passing for date_generators and 3.4 though. > > Are you able to build the print_holidays example? It uses pointers to > year_base_generators. > > It's in libs/date_time/example/gregorian. > > Bart > i'll try that in the next time and post the results of this experiment; be the way, i've now compiled my app in win succesfully by putting evrything which is somehow connected to year_based_generator into #ifndef WIN32_COMPILE .... #endif. that isn't too bad for the moment, because i don't use these methods by now in other parts of my prog [except unit tests]. but sooner or later i will ... antonio

1 0

boost::tokenizer problems with Sun CC 5.3
by Debajit Adhikary 18 Jan '05

18 Jan '05

For the following code: // start of code #include <iostream> #include <string> #include <boost/tokenizer.hpp> int main() { using namespace std; using namespace boost; string s = "first second third"; tokenizer<> tok(s); for(tokenizer<>::iterator i = tok.begin(); i != tok.end(); ++i) cout << *i << "\n"; } // end of code With the Sun CC compiler (Sun WorkShop 6 update 2 C++ 5.3), I get the following error message: "/usr/include/boost/iterator/iterator_facade.hpp", line 623: Error: Could not find a match for boost::iterator_core_access::equal<boost::iterator_core_access::Facade1, boost::iterator_core_access::Facade2>(const boost::token_iterator<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>, const boost::token_iterator<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>, boost::is_convertible<boost::token_iterator<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>, boost::token_iterator<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>>). "t.cpp", line 15: Where: While instantiating "boost::operator!=<boost::token_iterator<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>, std::basic_string<char, std::char_traits<char>, std::allocator<char>>, boost::forward_traversal_tag, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, int, boost::token_iterator<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>, std::basic_string<char, std::char_traits<char>, std::allocator<char>>, boost::forward_traversal_tag, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, int>(const boost::iterator_facade<boost::token_iterator<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>, std::basic_string<char, std::char_traits<char>, std::allocator<char>>, boost::forward_traversal_tag, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, int>&, const boost::iterator_facade<boost::token_iterator<boost::char_delimiters_separator<char, std::char_traits<char>>, const char*, std::basic_string<char, std::char_traits<char>, std::allocator<char>>>, std::basic_string<char, std::char_traits<char>, std::allocator<char>>, boost::forward_traversal_tag, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, int>&)". "t.cpp", line 15: Where: Instantiated from non-template code. 1 Error(s) detected. What could be the problem here? If Sun CC 5.3 doesnt support boost::tokenizer at all, are there any workarounds that I could use?

1 0

gregoran::year_based_generator and mingw-3.4.2
by Antonio Coralles 18 Jan '05

18 Jan '05

i'm writing on a programm which uses the boost date_time library [boost-version = 1.32.0] heavily; while i normally programm in linux using gcc-3.3.5 i also need to compile my program in windows from time to time. because it makes life easier with another library [gtkmm-2.4.8] i'm using mingw-3.4.2; everthing worked fine (my code contains about 10 000 lines using boost_date_time) until i started using a boost::gregorian::year_based_generator. while gcc-3.3.5 in liux accepts my code without even a single warning [with -Wall], mingw-3.4.2 complains - it seems that the compiler has problems with year_based_generator: calendar.hpp:60: error: variable or field `insertGenerator' declared void calendar.hpp:60: error: expected `;' before '(' token calendar.hpp:92: error: expected `)' before '*' token calendar.hpp:95: error: using-declaration for non-member at class scope calendar.hpp:95: error: expected `;' before '*' token here is the header: /* This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ #ifndef CL_CALENDAR #define CL_CALENDAR #include "boost/date_time/gregorian/gregorian.hpp" #include <stdexcept> #include <vector> #include <map> #ifndef BG #define BG boost::gregorian #endif /*!@brief besides of providing you with information if the day you are looking at is a * working day / saturday / sunday you can also store and retrieve additional * information about specific dates */ class calendar { public: enum dayChar { NORMAL_DAY = 0, SATURDAY = 1, SUNDAY = 2, PUBLIC_HOLIDAY = 3, SPECIAL_DAY = 4 }; /*!@brief obtain a calendar for a given context*/ static calendar& get(unsigned context=0); /*!@brief remove all calendar instances which have been created so far*/ static void removeAll(); /*!@brief remove the instance for a given context * * @remark you should call this function if you don't need the instance associated with * with context any more to avoid memory leaks ! */ static void remove(unsigned context); /*!@param[in] tDay the day to mark * @param[in] character the new character * @return true if the operation was succesfull * @note you cant lower the default character of a given day - e.g. you can't * give a sunday the character of a normal working day*/ bool markDay(const BG::date& tDay, dayChar character); /*!@return true if succesfull*/ bool unmarkDay(const BG::date& tDay); /*!@brief mark a day for every year using a partial_date * * @param[in] pDate a partial date * @param[in] character the new character*/ void markDay(const BG::partial_date& pDate, dayChar character); /*!@return true if succesfull*/ bool unmarkDay(const BG::partial_date& tDate); /*!@brief use this function to define more sophisticated (holi)days * * @param[in] gen a pointer to a year_based_generator optained from new * @param[in] manage if true the calendar is responsible for deleting*/ void insertGenerator(BG::year_based_generator *gen, dayChar character, bool manage=true); /*!@brief removes all generators inserted with insertGenerator*/ void removeGenerators(); /*!@brief get information from our calendar*/ dayChar getDayCharacter(const BG::date& thatDay) const; void reset(); int getRegularWorkingDaysWithin(const BG::date_period& tPeriod) const; /*!@remark this function can be usefull to dump our calendar to a file */ const std::map<BG::date, dayChar>& getDateMap() const { return _dMap; } /*!@remark this function can be usefull to dump our calendar to a file */ const std::map<BG::partial_date, dayChar>& getPartialDateMap() const { return _pMap; } private: calendar() {}; ~calendar(); //no copy-construction, no assignement calendar(const calendar&); calendar& operator=(const calendar&); static dayChar getDefaultCharacter(const BG::date& tDate); //data std::map<BG::date, dayChar> _dMap; std::map<BG::partial_date, dayChar> _pMap; struct hlp { hlp(BG::year_based_generator *gen, dayChar tChar, bool man) : generator(gen), character(tChar), manage(man) {} BG::year_based_generator *generator; dayChar character; bool manage; }; std::vector<hlp> _genVec; static std::map<unsigned, calendar*> _sc_calMap; }; std::ostream& operator<<(std::ostream& os, calendar::dayChar dChar); std::istream& operator>>(std::istream& is, calendar::dayChar& dChar); #endif maybe somebody can give me a hint - or maybe point out an error in this header which is ignored by gcc-3.3.5. thanks, antonio

2 1

spirit (boost 1.32.0) grammar.ipp won't compile
by Sergey Skorniakov 18 Jan '05

18 Jan '05

Hello, All! I had tryed to compile some code with Microsoft (R) C/C++ Optimizing Compiler Version 14.00.2207 for AMD64 (from Server 2003 DDK) and got an error: C:\boost_1_32_0\boost\spirit\core\non_terminal\impl\grammar.ipp(308) : error C2784: 'std::mem_fun_t<_R,_Ty> std::mem_fun(_R (__cdecl _Ty::* ) (void))' : could not deduce template argument for 'T1 (__cdecl T2::* )(void)' from 'int (__cdecl boost::spirit::impl::grammar_helper_base<GrammarT>::* )(GrammarT *)' with [ GrammarT=boost::spirit::grammar<boost::archive::basic_xml_grammar<wchar_t>>::self_t ] Just changing std::mem_fun(&helper_base_t::undefine) to std::mem_fun1(&helper_base_t::undefine) resolves this problem. Modified successfully compiles under VC7.1, too. With best regards, Sergey.

2 2

Have anyone used boost on ARM platform?
by Vyacheslav E. Andrejev 17 Jan '05

17 Jan '05

Hello All. I'm interested in possibility of using boost library on ARM9 platform. Does anyone do it before? Any pitfalls and hidden dangers? What toolchain for compilation is better to use? Is there some performance drawbacks when using boost compared with pure C? -- Vyacheslav E. Andrejev System Architect, Excelsior, LLC

2 1

counting_iterator and iterator_adaptor problem
by Felipe Magno de Almeida 17 Jan '05

17 Jan '05

I'm trying to create an iterator from a class that is almost an iterator, it worked fine for const iterator with counting_iterator, but when I needed to dereference it, it complained about this: error C2440: 'return' : cannot convert from 'const xmlmanager::xml_basic_node<T>' to 'boost::iterator_facade<Derived,Value,CategoryOrTraversal,Reference,Difference>::reference' I think it is because it is still a const iterator... But I need a mutable iterator, and I have no clue in how to do it... I've tried the documentation, but it just explains what it is, but not ho to do it. The way I'm doing the iterator is: template <typename T> class xml_basic_node : public xml_basic_container<T>, public boost::iterator<boost::iterator_archetypes::readable_lvalue_iterator_t, xml_basic_node<T> > { public: // some specifics constructors bool operator == (xml_basic_node<T> const &n) const { // compares equality } xml_basic_node<T> &operator ++() { // advances... return *this; } }; and the iterator through counting_iterator: template <typename T> class acontainer { typedef boost::counting_iterator<xml_basic_node<T> > iterator; }; If someone could, please point me where I am getting wrong... I am days already trying to figure out how to do it... Sorry for the size of the mail and thanks in advance. -- Felipe Magno de Almeida UIN: 2113442 email: felipe.almeida@ic unicamp br, felipe.m.almeida@gmail com I am a C, modern C++, MFC, ODBC, Windows Services, MAPI developer from synergy, and Computer Science student from State University of Campinas(UNICAMP). To know more about: Unicamp: http://www.ic.unicamp.br Synergy: http://www.synergy.com.br current work: http://www.mintercept.com

3 3

Environment variable library?
by Aaron W. LaFramboise 17 Jan '05

17 Jan '05

Is there a Boost library that supports manipulating process environment variables? I realize that accessing environment variables in the normal way is typically trivial, but it would be nice to have the entire thing wrapped up in a system-independent interface that is natural for C++. Aaron W. LaFramboise

4 4

shared_from_this and custom deleters
by Niklas Wiberg 17 Jan '05

17 Jan '05

Hi, I have the following situation: In the constructor body of class A, I need to call functions that take a shared_ptr<A> as a parameter. These functions do not store the shared_ptr<A>, but in some situations a weak_ptr<A>. There is not yet any shared_ptr owning the A instance, since this is during A construction... At first, I thought using a shared_ptr<A> tmpThis(this, NullDeleter()) was a good idea. But when I later on (when another shared_ptr actually owns the A instance) want to use shared_from_this on A, I get an exception since the use_count of the internal weak_ptr is based on the first temporary shared_ptr that I used during construction (with the NullDeleter). Am I correct in my assumption that the internal weak_ptr in enable_shared_from_this is initialized by the first shared_ptr and that will prevent any later use of shared_from_this when I have another shared_ptr (with a default deleter) owning the element? I guess that a static create function would solve the problem, but changing that would be quite a big undertaking in this particular case so I thought I'd check if someone knows a simple solution to this... I added a small example code snipped below... Best regards, Niklas Example: void foo(shared_ptr<A> a); void otherFunction(shared_ptr<A> a); class A : public enable_shared_from_this<A> { A() { // Can't use shared_from_this since no shared_ptr owns this yet shared_ptr<A> thisTmp(this, NullDeleter()); foo(thisTmp); } bar() { otherFunction(shared_from_this()); // Throws exception... } }; int main() { shared_ptr<A> a(new A()); a->otherFunction(); ... }

2 1

How to pass a member variable with boost::ref() in boost::bind()?
by tom gee 17 Jan '05

17 Jan '05

Here is the work around: class A { ... private: typedef struct _ONE_RECORD_ { string sGUID; string sID; string sName; string sSupport; string sModify; } ONE_RECORD; vector<ONE_RECORD> m_v; private: void FillOneLine(const ONE_RECORD& one_line); void FillAllLines(); }; void A::FillAllLines() { ... // method 1 for_each(m_v.begin(), m_v.end(), boost::bind(&A::FillOneLine, this,_1)); // OK // method 2 for_each(m_v.begin(), m_v.end(), boost::bind(&A::FillOneLine, this, ref(_1))); // error ... } Since ONE_RECORD can be large, I prefer to calling bind() as method 2, but, compiled under VC7.1 it generates such an error: e:\Boost\include\boost-1_32\boost\bind.hpp(285): error C2664: 'R boost::_mfi::mf1<R,T,A1>::operator ()<A>(U & ,A1) const' : cannot convert parameter 2 from 'boost::arg<I>' to 'A::ONE_RECORD' with [ R=void, T=A, A1=A::ONE_RECORD, U=A * ] and [ I=1 ] Can any body help to explain why and give a solution? Thanks.

2 1

Smart pointers
by Kercso Jozsef 17 Jan '05

17 Jan '05

Hi! I would have several questions regarding to smart pointers. They are completely new for me, and I'm not sure if my design is the best. Feel free to comment it. :) The "safe" pointer problem: There is a class Data, whom instances are used by many other Processor objects. It can happen, that a Manager object deletes the Data object, so the Processors have invalid pointers. It must be made such a design, where the Processors can check the Data pointers before using it, if it is still valid or not. My solution: class Handler; class Data { boost::shared_ptr< Data > m_sharedPtr; //shared pointer to myself public: Data(); ~Data() {}; Handler getHandler(); int aMethod(); .... }; class Handler { boost::weak_ptr< CTrain > m_weakPtr; //weak pointer to the handled Data public: Handler(boost::shared_ptr< Data > data) bool aMethod(int& result); ... }; Data::Data() : m_sharedPtr(this) {} Data::~Data() {} Handler Data::getHandler() { return Handler(m_sharedPtr); } int Data::aMethod() { return 1; } Handler::Handler(boost::shared_ptr< Data > data) : m_weakPtr(train) {} bool Handler::aMethod(int& result) { bool retVal = !m_weakPtr.expired(); if (retVal) { boost::shared_ptr< Data > p = m_weakPtr.lock(); result = p->aMethod(); } return retVal; } When somebody wants to access a Data object, it gets only a Handler to it. The Handler can check with its weak pointer, if the corresponding shared pointer is expired (data object deleted) or not. Thus it can be assured, that no invalid pointer of the Data object will be used by the Processors. If the Manager object (who has a container of Data* ) deletes a data object, the corresponding Handler gives false back, because m_weakPtr.expired() returns false. So everything seems to be OK, but there are several problems and questions: 1. the destructor of the Data object will be called twice, when the Manager calls 'delete data;': - Once, when by the delete. - Once by the m_sharedPtr. After this the use_count() method returns -1 (!!!) and the m_weakPtr.expired() returns true (!!!). To eliminate this problem I initialize the m_sharedPtr in the Data constructor in the following way: m_sharedPtr(this, emptyDeleter), where emptyDeleter is an empty method: void emptyDeleter(Data* data) { } 2. What happens, if one of the Processors locks its m_weakPtr to obtain a shared pointer to acces the Data, but after obtaining the shared pointer the manager deletes the corresponding data object? If the Processor tries to acces again the (deleted) data object --> core dump. I have found the following solution to this problem: - before deletion the Manager somehow checks if data->m_sharedPtr.unique() returns true. If not, it refuses to delete the data object. 3. The Data object will be accessed many times by many Processors, and by every access the following construction will be used: if (!m_weakPtr.expired()) { boost::shared_ptr< Data > p = m_weakPtr.lock(); // do job on p ... } My question is: how "expensive" is such a construction? How fast is to obtain a shared pointer from a weak pointer unsing lock()? If you already met the problem of these "safe" pointers and have an other solution, please share it with us. Or if you have a comment to my solution, then say it too. :) Thanks, Jozsef Kercso

1 0

Boost with mingw creates .lib not .a
by John Arbash Meinel 17 Jan '05

17 Jan '05

I was wondering if there is a specific reason still that when using mingw to build the boost libraries it defaults to using the .lib extension? I was only able to find the following post: http://article.gmane.org/gmane.comp.lib.boost.devel/79594 Which is where David Abrahams states that file extensions are based on platform and not based on toolset. I've been using mingw lately, and at least current versions are able to find a library with a .lib extension without any problem. However, visual studio can not use that file as a library, and mingw will look for a .a first. What I'm thinking is that at least for the undecorated versions of the libraries (boost_python.lib) it should use the common convention for the compiler, that way you could have both in the same directory, and have the compiler pick the right one. I realize I can force this with a '-sSUFLIB=.a', I was just wondering if there was a reason the extension is based on platform, and not on TOOLS. John =:->

2 1

boost::filesystem::path question
by matthew.j.polder＠itt.com 16 Jan '05

16 Jan '05

Hi, I typically work on Windows and Unix. Our network has a bunch of shared drives that I can access from both Windows and Unix by using the form: //filesystem/some/path/ It looks like boost::filesystem is getting rid of the double slash at the beginning and replacing it with a single slash. This will work on Unix but WIndows needs the double slashes. Any way around this? thanks, matthew ************************************ This e-mail and any files transmitted with it are proprietary and intended solely for the use of the individual or entity to whom they are addressed. If you have received this e-mail in error please notify the sender. Please note that any views or opinions presented in this e-mail are solely those of the author and do not necessarily represent those of ITT Industries, Inc. The recipient should check this e-mail and any attachments for the presence of viruses. ITT Industries accepts no liability for any damage caused by any virus transmitted by this e-mail. ************************************

5 8

boost 1.32 with gcc 3.3 for darwin
by Becky Bendick 15 Jan '05

15 Jan '05

To anyone who is interested: With the assistance of a huge number of very useful people, I've sorted out how to successfully install the boost 1.32 package on Mac Darwin with gcc 3.3. There are two problems to solve: 1. some libraries are made but not usable because of errors like: /sw/include/boost/numeric/ublas/vector_expression.hpp:1837: error: due > to a defect in the G++ 3.2 ABI, G++ has assigned the same mangled > name to > twodifferent types In file included from > /sw/include/boost/numeric/ublas/matrix.hpp:23, > from conftest.cc:100: > /sw/include/boost/numeric/ublas/matrix_expression.hpp:5156: error: > due to a > defect in the G++ 3.2 ABI, G++ has assigned the same mangled name > to two > different types > configure:23533: $? = 1 > configure: failed program was: > | /* confdefs.h. */ The solution is to put -fabi-version=0 into your CFLAGS and CXXFLAGS, rebuild bjam, and install boost with the rebuilt bjam. 2. Install hangs on xml_grammar. The solution is outlined in http://lists.boost.org/MailArchives/boost/msg76758.php Or include the following: <darwin><release><inline>off Thanks to everyone who helped out. ------------------------------------------------------------------------ ---------------------- Rebecca Bendick, Ph.D. Bullard Laboratories University of Cambridge Madingley Road CAMBRIDGE CB3 0EZ United Kingdom bendick(a)esc.cam.ac.uk

1 0

boost1.32
by Becky Bendick 14 Jan '05

14 Jan '05

I need the boost libraries in order to compile a new application. I installed the boost1.31 package from the fink release, using fink install boost 1.31 without any trouble, but when I then tried to configure the dependent application, it found that the boost/numeric/ublas/matrix.hpp library was unusable. On the advice of the boost-users list, I then installed boost 1.32, using the prebuilt executable for Darwin available on the boost web site. The install hung several times creating the serialization libraries, so I installed using the tag --without-serialization, and completed the install successfully that way. However, I still get an error when I configure the dependent package, saying that the matrix.hpp library is unusable. The config.log says: checking for boost/numeric/ublas/matrix.hpp usability... configure:22782: g++ -c -I/sw/include -O2 -ansi -Wall -Wno-unused -I/sw/include -I/usr/local/include /boost-1_32 conftest.cc >&5 In file included from /usr/local/include/boost-1_32/boost/numeric/ublas/traits.hpp:27, from /usr/local/include/boost-1_32/boost/numeric/ublas/storage.hpp:29, from /usr/local/include/boost-1_32/boost/numeric/ublas/matrix.hpp:21, from configure:22826: /usr/local/include/boost-1_32/boost/numeric/ublas/ returntype_deduction.hpp:53: warning: use of `long double' type; its size may change in a future release /usr/local/include/boost-1_32/boost/numeric/ublas/ returntype_deduction.hpp:53: warning: (Long double usage is reported only once for each file. /usr/local/include/boost-1_32/boost/numeric/ublas/ returntype_deduction.hpp:53: warning: To disable this warning, use -Wno-long-double.) In file included from /usr/local/include/boost-1_32/boost/numeric/ublas/vector.hpp:24, from /usr/local/include/boost-1_32/boost/numeric/ublas/matrix.hpp:22, from configure:22826: /usr/local/include/boost-1_32/boost/numeric/ublas/ vector_expression.hpp:1924: error: due to a defect in the G++ 3.2 ABI, G++ has assigned the same mangled name to two different types In file included from /usr/local/include/boost-1_32/boost/numeric/ublas/matrix.hpp:23, from configure:22826: /usr/local/include/boost-1_32/boost/numeric/ublas/ matrix_expression.hpp:5201: error: due to a defect in the G++ 3.2 ABI, G++ has assigned the same mangled name to two different types configure:22785: $? = 1 configure: failed program was: | #line 22760 "configure" | /* confdefs.h. */ Higher in the config.log is another error (unrelated?) that doesn't seem to cause any trouble: gcc -E -I/sw/include conftest.c configure:15096:28: ac_nonexistent.h: No such file or directory configure:15085: $? = 1 configure: failed program was: | #line 15070 "configure" | /* confdefs.h. */ Here's the info on my gcc. What is wrong with it ? And how can I fix it? gcc -v </dev/null >&5 Reading specs from /usr/libexec/gcc/darwin/ppc/3.3/specs Thread model: posix gcc version 3.3 20030304 (Apple Computer, Inc. build 1671) Thanks! Becky ------------------------------------------------------------------------ ---------------------- Rebecca Bendick, Ph.D. Bullard Laboratories University of Cambridge Madingley Road CAMBRIDGE CB3 0EZ United Kingdom bendick(a)esc.cam.ac.uk

2 2