July 2002 - Boost-users - lists.boost.org

Re: [boost] Iterator Adaptor Poll
by David Abrahams 26 Jul '02

26 Jul '02

From: "Toon Knapen" <toon.knapen(a)si-lab.org> > > Sure, I'm all for toys, as in "this doesn't really do everything I'd want > > from a real example, but it shows me how the system works". The problem I > > have with ia_experiment.cpp is that my first reaction was "why would anyone > > want an "iterator" which does *that*?" The fact that it iterates over only > > two elements and stores its value internally is pretty weird. I think most > > people who have only seen the standard iterators would have a hard time > > imagining that this is also an iterator. Though technically, it is an > > iterator, it's so different in nature from most iterators that it seems > > like it would be completely foreign. > > > > What about a singly-linked-list iterator example? Wouldn't that show > > everything you're illustrating, but more transparently? > > Why not some kind of rotation iterator. The advantage of this example is that > there's a std::rotate in the STL which modifies the container whereas the > rotation_iterator_adaptor can give you the same result but withouth modifying > the containers. AFAICT this is a strong argument in favour of the IA. That's neat, but we already have the permutation adaptor, and I don't think it's really a simple enough example. Beman's example just makes a simple iterator, not an adaptor, and I think that's an important feature for a "hello, world"-type introduction. -Dave ----------------------------------------------------------- David Abrahams * Boost Consulting dave(a)boost-consulting.com * http://www.boost-consulting.com

3 7

XML
by J.M. Thompson 26 Jul '02

26 Jul '02

I'm writing an XML based project right now. I haven't been able to find any good, open source XML parser to incorporate into my application, so I am using MSXMLDOM. This is a bummer. It seems like a good XML database manager would be a valuable addition to the Boost libraries. Is anyone working on one?

3 2

[thread] All tests crashing...
by Christophe Galerne 26 Jul '02

26 Jul '02

Hi, OS: cygwin uptodate Boost: 1.28 C++ comp: g++ 2.95.3-5 After what appears like a warning | error free compilation of the thread library. I'm trying to compile the examples, like this: $ g++ -I/data/boost_1_28_0 -o monitor monitor.cpp /data/boost_1_28_ 0/libs/thread/build/bin/libboost_thread.lib/gcc/release/runtime-link- static/threading-multi/libboost_thread.lib Which compiles fine, however when trying to run the example, I get: $ ./monitor.exe Segmentation fault (core dumped) This happening with all the examples, I'm guessing that I must be doing something wrong... =:-D At the same time I'm doing not doing anything particularly wacky so if someone could point my obvious mistake. Do I need to link against boost_threadmon also? Tia, Christophe

2 1

RE: [Boost-Users] XML
by schalk_cronje＠nai.com 26 Jul '02

26 Jul '02

> I'm writing an XML based project right now. I haven't been > able to find > any good, open source XML parser to incorporate into my > application, so I What's wrong with Xerces?

1 0

Re: [Boost-Users] Re: [boost] Iterator Adaptor Poll
by David Abrahams 26 Jul '02

26 Jul '02

From: "Kresimir Fresl" <fresl(a)grad.hr> > > Jeremy Siek wrote: > > > On Fri, 26 Jul 2002, David Abrahams wrote: > > > dave> Don't you think people will find an iterator which traverses the > > dave> elements of a real sequence to be more-obvious? That's why I'm > > dave> suggesting the singly-linked list iterator. > > > The singly-linked list example was the second thing that popped into my > > mind... I like that a lot too. Perhaps we should do both :) > > What about `strided_iterator', i.e. iterator that with each > increment/decrement skips given number of elements in > a sequence? Testing for `end' can be interesting ;o) Yes, too interesting. We're looking for a simple "hello, world" example here. ----------------------------------------------------------- David Abrahams * Boost Consulting dave(a)boost-consulting.com * http://www.boost-consulting.com

1 0

Re: [boost] Re: Iterator Adaptor Poll
by David Abrahams 26 Jul '02

26 Jul '02

From: "Gennadiy Rozental" <rogeeff(a)emailaccount.com> > BTW, you may consider CycleIteratorAdaptor or JoiningIteratorAdaptor. They > both really simple and illustrative. No simpler than the transform adaptor, though? As I've repeatedly posted, I think any introductory example ought to build a simple iterator, not an adaptor. -Dave ----------------------------------------------------------- David Abrahams * Boost Consulting dave(a)boost-consulting.com * http://www.boost-consulting.com

1 0

RE: [Boost-Users] Re: [boost] Iterator Adaptor Poll
by Elliot Murphy 26 Jul '02

26 Jul '02

I really like that example iterator (I was just typing up an email to suggest it when I received this one). The example does something useful, and you can easily see the difference between reading lines of input without the iterator, and with the iterator. The comment on page 5 of that book really emphasizes just how much this example would benefit from using iterator_adaptor "Don't worry if you don't yet understand why everything in the line_iterator class is there; parts of it are only necessary for technical reasons." -elliot -----Original Message----- From: Jeremy Siek [mailto:jsiek@cs.indiana.edu] Sent: Friday, July 26, 2002 10:29 AM To: Boost-Users(a)yahoogroups.com Cc: boost(a)lists.boost.org Subject: Re: [Boost-Users] Re: [boost] Iterator Adaptor Poll Here's another idea for a "hello world" example. A rewrite of Matt Austern's line_iterator example from his Generic Programming and the STL book. The line_iterator call getline() and then return a std::string from operator*. On Fri, 26 Jul 2002, David Abrahams wrote: dave> dave> That's neat, but we already have the permutation adaptor, and I dave> don't think it's really a simple enough example. Beman's example dave> just makes a simple iterator, not an adaptor, and I think that's an dave> important feature for a "hello, world"-type introduction. dave> dave> -Dave ---------------------------------------------------------------------- Jeremy Siek http://php.indiana.edu/~jsiek/ Ph.D. Student, Indiana Univ. B'ton email: jsiek(a)osl.iu.edu C++ Booster (http://www.boost.org) office phone: (812) 855-3608 ---------------------------------------------------------------------- Yahoo! Groups Sponsor Click here to find your contact lenses! Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.

1 0

RE: [Boost-Users] Fw: [boost] Iterator Adaptor Poll
by Hickman, Greg 26 Jul '02

26 Jul '02

> -----Original Message----- > From: David Abrahams [mailto:dave@boost-consulting.com] > Sent: Thursday, July 25, 2002 4:00 PM > To: Boost-Users(a)yahoogroups.com > Subject: [Boost-Users] Fw: [boost] Iterator Adaptor Poll > > > Hi Everyone, > > Have you tried to use iterator adaptors and found the documentation > wanting? I have recently updated the documentation in the CVS: > http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/*checkout*/boos > t/boost/libs/ > utility/iterator_adaptors.htm?rev=HEAD > > However, enough people have had problems approaching this > library that I > thought it would be useful to ask about what would make a gentle > introductory example. Beman recently sent me the enclosed, > but it seems to > define such an oddball toy iterator that I'm not sure it > would be a very > good motivating example. I'm asking for input, especially > from anyone who > has "gotten over the hump" so to speak, with iterator adaptors. I'm brand new to iterator_adaptors, and this is probably way too trivial an example, but I have several classes in my project which aggregate other polymorphic objects in part-whole relationships. I'd like clients who call 'the_aggregate.begin()' to be able to call non-const methods on the aggregate's Parts, but I'd like to prevent direct replacement of the underlying container element 'Part*' itself. Likewise, I'd like clients who call 'the_aggregate.begin() const' to be prevented from doing anything with the aggregate's Parts other than calling it's const methods. Of course, the STL container-supplied iterators aren't intended to work in this way. If this situation is common enough, and iterator_adaptor can be used to quickly generate iterators with the desired behavior (I haven't completely tested it as of yet, but it seems to work), then perhaps this is just one example of a reasonable "Hello, world" introduction to iterator_adaptors. Greg

2 1

Regex matching quoted strings
by Poulson, Shawn 26 Jul '02

26 Jul '02

Hello all, I got Regex to compile and link into a project using MSVC6. My problem is in trying to implementing a command line parsing regexp that handles quoted strings. I have code that will selectively match quoted strings but somehow ignores non-quoted strings. The code fragment is below. I've read over Mastering Regular Expressions and some Perl Cookbook stuff but nothing works straight out of the book. Any tips? The code below finds all three parameters (in the spec var), but has no match for 'parm1'. Any help is certainly appreciated. Thanks. ----- 8< ----- 8< ----- boost::regex exp( "\"(?:(\\\\.|[^\"])*)\"[:space:]*" "|" "([^[:space:]]+)[:space:]*" ); std::string str = "parm1 \"parm2 parm3\" \"parm4 \\\"yo\\\"\""; std::string::const_iterator start = str.begin(), end = str.end(); boost::match_results<std::string::const_iterator> what; unsigned int flags = boost::match_default; while (boost::regex_search(start, end, what, exp, flags)) { std::string spec(what[0].first, what[0].second-what[0].first); std::string match(what[1].first, what[1].second-what[1].first); start = what[0].second; } ----- 8< ----- 8< ----- --- Shawn Poulson

2 1

Re: [boost] Iterator Adaptor Poll
by Beman Dawes 26 Jul '02

26 Jul '02

At 04:46 PM 7/25/2002, David Abrahams wrote: >However, enough people have had problems approaching this library that I >thought it would be useful to ask about what would make a gentle >introductory example. Beman recently sent me the enclosed, but it seems to >define such an oddball toy iterator that I'm not sure it would be a very >good motivating example. ia_experiment.cpp is definitely oddball and definitely a toy. It was written to help me understand why I was getting compile errors from a real adaptor. Someone else can probably come up with an introductory example which is less oddball. But I'd like to defend the general principle of "toy" introductory examples. When someone knows nothing about a topic, a toy example is the best introduction. It is "known good", and can be used to verify that compilations using the library work as expected. It can be modified to see the effect of changes. Because it is a toy, it is totally non-threatening. It makes the reader feel superior, rather than like a dunce. The "C Programming Language" and "C++ Programming Language" books both started with a little "hello, world" program, very much a toy. Although simple, it starts the ball rolling with something that works and is understandable almost every reader. In the case of ia_experiment.cpp, it illustrates the relationship between the finished iterator, the Base class, and the Policies class with greater clarity IMO than documentation in any form other than C++ code. --Beman

2 1

pass through buffer
by Tom Howard 26 Jul '02

26 Jul '02

Hi, I found some old emails about a pass through stream buffer, but I can't find it in the boost library. Am I going blind? Basically I'm in the middle of writing a gzstream class that compresses and decompresses data to and from a iostream and I thought this pass through buffer would be exactly what I need. Anyone know where it is or have any other pointers for me? Thanks in advance. Cheers, Tom Howard

4 4

Fw: [boost] Iterator Adaptor Poll
by David Abrahams 25 Jul '02

25 Jul '02

Hi Everyone, Have you tried to use iterator adaptors and found the documentation wanting? I have recently updated the documentation in the CVS: http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/*checkout*/boost/boost/libs/ utility/iterator_adaptors.htm?rev=HEAD However, enough people have had problems approaching this library that I thought it would be useful to ask about what would make a gentle introductory example. Beman recently sent me the enclosed, but it seems to define such an oddball toy iterator that I'm not sure it would be a very good motivating example. I'm asking for input, especially from anyone who has "gotten over the hump" so to speak, with iterator adaptors. TIA, Dave --------------------------------- David Abrahams * Boost Consulting dave(a)boost-consulting.com * http://www.boost-consulting.com ----- Original Message ----- From: "Beman Dawes" <bdawes(a)acm.org> To: "Dave Abrahams" <david.abrahams(a)rcn.com> Cc: "Jeremy Siek" <jsiek(a)cs.indiana.edu> Sent: Thursday, July 25, 2002 3:21 PM Subject: Iterator adaptor example > Dave, > > Thanks for fixing the docs. I fixed and committed to CVS one more change > of BaseType -> Base. > > I found I needed an even more basic example than anything in the docs to > play with, particularly for creating an iterator from scratch, and put > together the attached. > > It is very simple, and does not demonstrate advanced features, but it > answered newbie questions I had in a way that only running code, modifying > it, and running again can do. (Not to mention fixing all the errors I made > before it would compile!) > > Feel free to include it in the distribution if you think it would help > others. Needs a better name of course. > > --Beman ---------- // Really dumb iterator_adaptor example program -----------------------------// // (C) Copyright Beman Dawes 2002. Permission to copy, use, modify, sell and // distribute this software is granted provided this copyright notice appears // in all copies. This software is provided "as is" without express or implied // warranty, and with no claim as to its suitability for any purpose. #include <boost/iterator_adaptors.hpp> #include <string> #include <iostream> class my_base { public: std::string name; my_base() : name( "foo" ) {} void operator++() { name = "bar"; } bool operator==( const my_base & rhs ) const { return name == rhs.name; } }; // if my_base had "const std::string & operator*() const { return name; }" // then custom policies would not be required. class my_policies : public boost::default_iterator_policies { public: template <class IteratorAdaptor> typename IteratorAdaptor::reference dereference(const IteratorAdaptor& x) const { return x.base().name; } }; typedef boost::iterator_adaptor< my_base, my_policies, // default_iterator_policies would do if my_base::op* were present const std::string, const std::string &, const std::string *, std::forward_iterator_tag, std::string::difference_type > my_iterator; int main() { my_iterator itr; my_iterator::value_type str( "hello, iterator\n" ); //verify value_type present std::cout << str; std::cout << *itr << std::endl; // foo std::cout << *++itr << std::endl; // bar std::cout << (itr == my_iterator() ? "bingo!" : "oops!" ) << std::endl; // oops std::cout << (itr == ++my_iterator() ? "bingo!" : "oops!" ) << std::endl; // bingo return 0; } [Non-text portions of this message have been removed]

2 1

using boost::python v1
by Srivatsan Raghavan 25 Jul '02

25 Jul '02

hello all.. i've got some questions about using bpl, and i've searched the docs & the examples, and i can find no answer this example illustrates the issues i'm having <cpp> class B ; class C ; class A { public: A() ; virtual bool func1 ( ) ; virtual bool func2 ( ) = 0 ; virtual ~A() ; virtual int func3 ( std::list<C> ) ; protected : B m_Bobj ; std::string m_Aname ; } ; </cpp> now , i know how to expose the virtual and pure virtual functions to pyhon, i just write a derived class A_callback, and write some static default functions that forward the impl to the virtual function in A . my problem is in the func3() and the protected members do i need to write my own wrapper functions to python for mapping a list<C> ? or does bpl do this itself in some way? and how do i expose the protected members to python? if i do something like this : <cpp> boost::python::class_builder<A , A_callback> a_class ( this_module , "A" ) ; a_class.def ( &A::m_Bobj , "m_Bobj" ) ; </cpp> that line of code gets me this error (in msvc 6 : sp 5 ) : error C2248: 'm_Bobj': cannot access protected member declared in class 'Logging::Endpoint' <file-name> : see declaration of 'm_Bobj' how can i get this to work?

2 1

Is bellman_ford_shortest_paths supposed to work for undirected graphs?
by Louis Lavery 25 Jul '02

25 Jul '02

int main() { enum {A,B,Z}; char const name[] = "ABZ"; int const numVertex = static_cast<int>(Z); typedef std::pair<int,int> Edge; Edge edge_array[] = {Edge(B,A)}; int const numEdges = sizeof(edge_array) / sizeof(Edge); int const weight[numEdges] = {11}; typedef adjacency_list<vecS,vecS,undirectedS,no_property,property<edge_weight_t,int> > Graph; Graph g(edge_array, edge_array + numEdges, numVertex); Graph::edge_iterator ei, ei_end; property_map<Graph,edge_weight_t>::type weight_pmap = get(edge_weight, g); int i = 0; for(tie(ei, ei_end) = edges(g); ei != ei_end; ++ei, ++i) { weight_pmap[*ei] = weight[i]; } std::vector<int> parent(numVertex); for(i = 0; i < numVertex; ++i) { parent[i] = i; } std::vector<int> distance(numVertex, std::numeric_limits<int>::max()); distance[A] = 0; // Set source distance to zero bool const r = bellman_ford_shortest_paths(g, int (numVertex), weight_map(weight_pmap).distance_map(&distance[0]). predecessor_map(&parent[0])); if (r) { for(int i = 0; i < numVertex; ++i) { std::cout << name[i] << ": " << std::setw(3) << distance[i] << " " << name[parent[i]] << std::endl; } } else { std::cout << "negative cycle" << std::endl; } return EXIT_SUCCESS; } Expected Output:- A: 0 A B: 11 A Actual Output:- A: 0 A B: 2147483647 B Louis.

3 3

BGL: traversal algorithm for tree
by Björn Lindberg 25 Jul '02

25 Jul '02

I have implemented a rooted tree structure as a BGL graph. I need to be able to traverse the tree from root to leaves, while doing something at each vertex. I need to be able to do this as inorder and postorder traversal. My question is if it's possible to do this with any of the existing algorithms in BGL. My current thinking is to implement a function traversal( ... ), but if there already exists an alternative, I would prefer to use it. Björn

2 14

iterator_adaptor Question
by Hickman, Greg 24 Jul '02

24 Jul '02

I have a class that holds a container of pointers to polymorphic Base classes. I'd like clients who iterate over those Bases using a mutating iterator type to be able to call non-const Base class member functions (but I do not want those clients to be able to replace the Base* directly). I'd also like clients who iterate using a const_iterator type to be able to call only const Base class member functions. In the following test code, I've attempted to use boost::iterator_adaptor to create a const iterator with these properties, but the const_iterator still allows calls to non-const operations. Can anyone help me see where I've gone wrong? #include <boost/iterator_adaptors.hpp> #include <boost/utility.hpp> #include <iostream> #include <list> class Base : private boost::noncopyable { public: virtual ~Base() {} virtual void foo() const = 0; }; class Derived : public Base { public: virtual void foo() const { std::cout << "Derived::foo" << std::endl; } }; struct Bases { typedef std::list<Base*> Bases_imp; typedef boost::iterator_adaptor< Bases_imp::iterator, boost::default_iterator_policies, Base*, Base* const&, Base* const* > iterator; typedef boost::iterator_adaptor< Bases_imp::const_iterator, boost::default_iterator_policies, Base const*, Base const* const&, Base const* const* > const_iterator; void foo() const { const_iterator i(bases_.begin()); const_iterator end(bases_.end()); for (; i != end; ++i) (*i)->foo(); // Oops - const_iterator allows call to non-const method } Bases_imp bases_; };

3 2

RE: Mail server problems (was: Boost Sockets)
by Jim.Hyslop 24 Jul '02

24 Jul '02

Jim.Hyslop (jim.hyslop(a)Leitch.com) wrote: > No, I don't think so, Phil - please tell us what you _really_ > think ;-) No, this is not a case of deja-vu - our Exchange server burped last night and re-sent a whole bunch of emails. Sorry 'bout that. -- Jim

1 0

boost shared_ptr - thread safe and non thread safe editions
by Ren� Dalby Carlsen 24 Jul '02

24 Jul '02

Hi. Is there any easy way to get a thread safe edition of the shared_ptr (BOOST_HAS_THREADS) and a "non" thread safe edition (BOOST_DISABLE_THREADS) inside the same project? The thread safe edition of the shared_ptr is a bit slower and I would like to able to use the non thread safe shared_ptr, when I known it only be used on the same thread. As a solution I thought I could do something like this, so I would not have to edit/copy any boost .hpp file : // // MyApp.cpp // #define BOOST_HAS_THREADS #include "boost/smart_ptr.hpp" namespace boost_nothread { #define BOOST_DISABLE_THREADS #include "boost/smart_ptr.hpp" } void f() { boost::shared_ptr <int> spIntTS; // thread safe smart pointer boost_nothread::shared_ptr <int> spInt; // non thread safe smart pointer } //////// The above sample does not work - what should I do instead? Regards, René

2 3

Python: class hierarchies; return pointer to base
by Jacek Generowicz 23 Jul '02

23 Jul '02

Hi, I'm trying to use Boost.Python to create an extension module based on some existing code. Therein I have a class hierarchy which I would like to expose in a way that would make it possible to subclass any of its classes in python. I run into a problem when I try to expose C++ functions which return pointers to the base class of the hierarchy. In the minimal example I am using for testing purposes I have: // An abstract base class class abstract { ... virtual void thing() const = 0; }; // A conctrete subclass implemented in C++ class concrete : public abstract { ... virtual void thing const { ... } }; // Callback to allow happy subclassing of abstract in python class abstract_callback : public abstract { ... }; // Callback to allow happy subclassing of concrete in python class concrete_callback : public abstract { ... }; BOOST_PYTHON_MODULE_INIT(abstract) { ... python::class_builder<abstract, abstract_callback> abs_class(this_module, "abstract"); ... python::class_builder<concrete, concrete_callback> con_class(this_module, "concrete"); con_class.declare_base(abs_class); ... } This all works fine, until I try to expose to python a function such as abstract* ret_p_abs( ... ); When compiling (gcc 2.95.2) the module, I get the error no matching function for call to `py_extension_class_converters (boost::python::type<abstract *>)' I infer from comments in the source code that this is to be expected if the class in question has not been wrapped as an extension class. This makes sense, as abstract has, indeed, not been wrapped ... but I don't think that it should be; abstract_callback was created for that purpose. How should I proceed ? Thanks,

1 0

Regexp linking problems with VC++6.0 + STLPort
by Noel Llopis 22 Jul '02

22 Jul '02

I've read through all the other previous messages dealing with problems with Regexp and VC++, but I wasn't able to find a good answer for my problem. I compiled Regexp++ without any problems. I added the correct directory path for the libraries, so that happens automatically (in my case it links with boost_regex_vc6-stlport_mssd.lib (multithreaded, static run, static link, debug). However, as soon as I try to use any regexp function or class from my code, it comes back with a link error. For example, trying to use the RegExp class, I get: error LNK2001: unresolved external symbol "public: __thiscall boost::RegEx::RegEx(class _STL::basic_string<char,struct std::char_traits <char>,class _STL::allocator<char> > const &,bool)" (?? 0RegEx@boost@@QAE@ABV?$basic_string@DU?$char_trai ts@D@std@@V?$allocator@D@_STL@@@_STL@@_N@Z) bin/XXXXXX.exe : fatal error LNK1120: 1 unresolved externals Can anybody guess as to what might be wrong? I'm using VC++ 6.0 with the latest upgrades and STLPort 4.5.3. Thanks. --Noel llopis(a)comcast.net

2 3

RE: [Boost-Users] Boost Config problem - MSVC 7, boost 1.28.0
by Tom Matelich 22 Jul '02

22 Jul '02

Cool, thanks. I really hate modifying third party libraries. > -----Original Message----- > From: John Maddock [mailto:john_maddock@compuserve.com] > Sent: Saturday, July 20, 2002 5:03 AM > To: Boost-Users(a)yahoogroups.com > Subject: Re: [Boost-Users] Boost Config problem - MSVC 7, boost 1.28.0 > > > > I was running into problems with min and max being macros > when attempting > to > > port my code to .NET. When I went to look at visualc.hpp, > I saw that > > NOMINMAX was only defined when _MSC_VER <= 1200. My break > seems to have > > happened where a boost file was included, then a windows > header came in, > so > > the macros were enabled. > > > > I know we are not supposed to rely on Boost.Config in our > code, but it > sure > > is nice :). > > I've modified the config system so that NOMINMAX is defined > in the win32 > platform configuration rather than for VC6 specifically, > likewise the undefs > for min and max are in there now as well, hopefully this won't break > anything ... :-) > > John Maddock > http://ourworld.compuserve.com/homepages/john_maddock/index.htm > > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Access your PC just like Web Mail > http://us.click.yahoo.com/r5uw2C/zncEAA/Ey.GAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

1 0

HELP, boost::thread in freebsd, run example/monitor core dumped
by wugui 22 Jul '02

22 Jul '02

system: FreeBSD 4.6 gcc: version 2.95.3 prog: example/monitor cause: recursive_mutex ? do_test<boost::recursive_mutex>(); link with: libboost_threadd.a libboost_threadds.a assertion "res == 0" failed: file "libs/thread/build/../src/condition.cpp", line 347 link with: libboost_thread.a libboost_threads.a OK, BUT ! I'M NOT SURE THAT !

1 1

test_pool_alloc.cpp will not compile with CW 8.1
by Ray S. Gallimore 20 Jul '02

20 Jul '02

Sorry if double posted (originally sent via gmane.comp.lib.boost.user but never showed up). To get test_pool_alloc.cpp to compile with CW 8.1 (Windows), I had to define BOOST_NO_PROPER_STL_DEALLOCATE. Once compiled, the test does run ok. Ray Gallimore [Non-text portions of this message have been removed]

1 0

Boost Config problem - MSVC 7, boost 1.28.0
by Tom Matelich 20 Jul '02

20 Jul '02

I was running into problems with min and max being macros when attempting to port my code to .NET. When I went to look at visualc.hpp, I saw that NOMINMAX was only defined when _MSC_VER <= 1200. My break seems to have happened where a boost file was included, then a windows header came in, so the macros were enabled. I know we are not supposed to rely on Boost.Config in our code, but it sure is nice :). ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

3 3

Boost compilation, Windows 98 SE and gcc
by J.Flenter 19 Jul '02

19 Jul '02

Hi, I'm trying to compile boost with gcc (the version currently distributed with cygwin: 2.95.3-5 and not the pre-release version 3.1.1) but when I run bjam with either -sTOOLS=gcc-stlport or sTOOLS=gcc I get an error: gcc-Link-action actions too long (max 1023): g++ -Wl,--export-all-symbols -Wl,--exclude-symbols,_bss_end__:_bss_start__: _data_end__:_data_start__ -Wl,--out-implib,libs\regex\build\bin\boost_regex. dll\ gcc-stlport\debug\runtime-link-dynamic\boost_regex.lib -g -shared -o "libs\reg ex\build\bin\boost_regex.dll\gcc-stlport\debug\runtime-link-dynamic\boost_re gex. dll" "libs\regex\build\bin\boost_regex.dll\gcc-stlport\debug\runtime-link-dyn amic\c_regex_traits.obj" "libs\regex\build\bin\boost_regex.dll\gcc-stlport\debug \runtime-link-dynamic\c_regex_traits_common.obj" "libs\regex\build\bin\boost_reg ex.dll\gcc-stlport\debug\runtime-link-dynamic\cpp_regex_traits.obj" "libs\regex\ build\bin\boost_regex.dll\gcc-stlport\debug\runtime-link-dynamic\cregex.obj" "li bs\regex\build\bin\boost_regex.dll\gcc-stlport\debug\runtime-link-dynamic\fi leit er.obj" "libs\regex\build\bin\boost_regex.dll\gcc-stlport\debug\runtime-link-dyn amic\posix_api.obj" "libs\regex\build\bin\boost_regex.dll\gcc-stlport\debug\runt ime-link-dynamic\regex.obj" "libs\regex\build\bin\boost_regex.dll\gcc-stlport\de bug\runtime-link-dynamic\regex_debug.obj" "libs\regex\build\bin\boost_regex.dll\ gcc-stlport\debug\runtime-link-dynamic\regex_synch.obj" "libs\regex\build\bin\bo ost_regex.dll\gcc-stlport\debug\runtime-link-dynamic\w32_regex_traits.obj" "libs \regex\build\bin\boost_regex.dll\gcc-stlport\debug\runtime-link-dynamic\wide _pos ix_api.obj" "libs\regex\build\bin\boost_regex.dll\gcc-stlport\debug\runtime-link -dynamic\instances.obj" "libs\regex\build\bin\boost_regex.dll\gcc-stlport\debug\ runtime-link-dynamic\winstances.obj" -lstlport_cygwin_stldebug Am I doing something wrong? Some may have noticed that I have already posted something on this newsgroup, for which I already had a working version of boost, that's true. Unfortunately I ran in some problems using inherited classes and I found on the internet some bug reports on the Visual Studio 6.0 and the error: error C2275: 'referenceCounter' : illegal use of this type as an expression, this happens at the line linkedList_class.declare_base(referenceCounter); That is the reason why I switched to GCC. However, any help would be appreciated. Jacco Flenter

3 3