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

tolower not in std::
by ccullum 17 Jun '02

17 Jun '02

I am getting a message stating that tolower is not found in the std::, but transform can be found. Has anyone seen this before? Thanks, Christopher cullum ccullum(a)uprizer.com

2 1

[BGL] using Borland C++Builder 5
by Alex Henderson 17 Jun '02

17 Jun '02

Hi, I had a problem compiling both the test file (libs/graph/test/graph.cpp) and the first example (libs/graph/example/file_dependencies.cpp) of the BGL and traced the problem to the support for tuples. The offending line is line 40 of boost/tuple/tuple.hpp which incorporates tuples::get into the boost namespace. Commenting out this line allows the files above to compile and run OK. Leaving it in invokes an internal compiler error. The test file for tuples works OK with Builder 5 and so I guess there's a dependency somewhere. The question is - if I comment out this line am I going to get hit with problems elsewhere in the BGL? I'm new to the BGL and don't know whether the whole thing is built on the abilities of tuples. [Using boost_1_28_0, BCC5 sp1, Win2000 sp2] Thanks for any thoughts. Alex

1 0

RE: [Boost-Users] MS VS 6: passing boost::shared_ptr<T> to a dll function
by Smith, Eric V. 16 Jun '02

16 Jun '02

How about some sample code? It's hard to help if we don't know exactly what you're trying to do. > -----Original Message----- > From: lognez [mailto:corno@dds.nl] > I am trying to pass a smart pointer (boost::shared_ptr<T>) as an > argument to > a function that is implemented by a dll and called by an executable, > but > whenever I execute the application, it goes into a loop, no matter > what the > type of T is. When the function is implemented in the exe or > when the function is called from inside the dll it works > fine. Does anybody have a clue what could be happening? BTW, > I'm not implicating a bug in boost, I know that it could as well > be a > MS VC++ bug but I would just like to know how this comes and how I > can solve > it.

1 0

Re: Static power() function, to add in common_factor
by Daryle Walker 14 Jun '02

14 Jun '02

on 6/12/02 12:11 AM, ravioli(a)softhome.net wrote: > Is there an interest into having a power() template calculating the N-th power > of any number, when N is known at compile-time ?t uses the algorithm of the > STL power function(), and runs between two or three times faster, and maybe > could be of interest in the " <boost/math/common_factor.hpp> which provides > run-time and compile-time evaluation of the greatest common divisor (GCD) or > least common multiple (LCM) Proposals for new libraries usually go to the regular Boost list, not this one. Besides that: What would this have to do with the common-factor library? I've never heard of a function called "power". Is it a STL function that didn't get into the standard? Are there any docs for it? How do you know what algorithm it uses? > It simply works this way, for example to have PI at exponent three : > double a = power_const<3>( 3.14159) > > As the single include file is very short, please apologize if I give it > straight on, just to save your time and to have an idea how badly you judge my > poor code ;) [TRUNCATE code] I don't think your implementation will work for negative exponents. -- Daryle Walker Mac, Internet, and Video Game Junkie darylew AT mac DOT com

2 1

Dynamic Bitset formal review - half way point
by Mat Marcus 14 Jun '02

14 Jun '02

Reminder - We have just past the half way point for the formal review of dynamic bitset. So far we have: 1 formal yes vote 1 formal no vote Discussion regarding iterators for dynamic bitset and comparison to vector<bool>. Some minor corrections and updates. I would like to see more formal reviews (including a yes or no vote) before the review period ends on the 17th. Thanks, Mat ##### > The formal review of Dynamic Bitset by Chuck Alison and > Jeremy Siek will commence today Saturday June 8th and run > through Monday, June 17th. > > The library is currently available at > <http://groups.yahoo.com/group/boost/files/dyn_bitset.tar.gz> > > > Below is an excerpt from the library's documentation: > > The dyn_bitset class represents a set of bits. It provides > accesses to the value of individual bits via an operator[] > and provides all of the bitwise operators that one can > apply to builtin integers, such as operator&& and > operator<<. The number of bits in the set is specified at > runtime via a parameter to the constructor of the > dyn_bitset. > > Each bit represents either the Boolean value true (set) or > false (reset). To toggle a bit is to change the value to > true if it is false and to false if it is true. Each bit > has a non-negative position pos. The position pos == 0 > corresponds to the least significant bit and pos == size() > - 1 is the most significant bit. When converting an > instance of dyn_bitset to or from an unsigned long, the > bit position pos corresponds to the bit value 1 << pos. > > The dyn_bitset class is nearly identical to the > std::bitset class. The difference is that the size of the > dyn_bitset (the number of bits) is specified at run-time > during the construction of a dyn_bitset object, whereas > the size of a std::bitset is specified at compile-time > through an integer template parameter. > > > For information about submitting a Formal Review, see > http://www.boost.org/more/formal_review_process.htm > > Please try out the library and comment during the review > period. Be sure to say whether or not you think the library > should be accepted by Boost. > > Compiler notes: This library has been tested using the > following compiler platforms: > > Gcc 2.95 and 3.01 > Kai C++ > Metrowerks Codewarrior 8 (beta, Mac) > Visual C++ 7.0 > Comeau > > The library presently requires template friend support and is > known not to compile with CodeWarrior 7.2 or Visual C++ 6.0. > > The library has not been tested with Borland. > > > The Formal Review manager is Mat Marcus. > > > > > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost-announce

1 0

RE: [Boost-Users] shared_ptr in Borland C++ Builder
by scleary＠jerviswebb.com 12 Jun '02

12 Jun '02

> From: Craigus [mailto:yg-boost-users@m.gmane.org] > > Hi > > I'm new to using the Boost library. Welcome! :) > I have Codeguard turned on (detects memory leaks, accessing freed memory, > overwriting memory illegally and the like). When the shared_ptr object > count goes to zero operator() in checked_deleter eventually gets called. > Codeguard is reporting (in poor English): > > Method called on illegally casted object If you want to fix the problem: uncheck Project Options -> C++ -> Zero length empty class members. Then rebuild (not remake). The rest of this e-mail is just explaining what the error is and why this fixes it. Here's the problem: CodeGuard is complaining that the 'this' pointer for the checked_deleter object is invalid when its operator() is called. (The error is not reported if you uncheck the "Validate the 'this' pointer on member function entry" and rebuild). Many function objects contain no data or base classes, but operator() cannot be static, so for these function objects (including checked_deleter), a sort of unspoken convention has arisen: never use the 'this' pointer. But CodeGuard validates the 'this' pointer anyway... In common implementations of Standard C++, CG's validation would work: in the case where a function object is used as a most-derived class, it has non-zero size (according to the Standard), so 'this' would reference a "placeholder" memory location for that object. in the case where a function object is used as a base class, then the most-derived class has non-zero size, and 'this' would reference a member in some derived class. C++ Builder, however, has a non-Standard-conforming option that is on by default: Project Options -> C++ -> Zero length empty class members. This creates a "loophole" in the first case described above: in the case where a function object is used as a most-derived class *as a member of another class*, it has zero-size(!) -- and therefore if it is the last member of that class, 'this' would reference memory *after* the most-derived class. Unchecking this option allows CG's validations to work in the way described above, closing the "loophole". Happy coding! :) -Steve

2 1

bit_iterator
by Jan Langer 12 Jun '02

12 Jun '02

hello, i do use iterator adaptor to build a bit_iterator, which return single bits of the elements of an underlying iterator. the base_type of my iterator_adaptor is std::pair <BaseIterator, unsigned int> representing the iterator and the bit position. now my iterator does not work if i adapt istreambuf_iterator because self operator++(int) { self tmp(*this); ++*this; return tmp; } of iterator_adaptor is not able to use the proxy returned by the postfix increment of the input iterator. now i searched the archive and found in: Subject: Re: [boost] (infinite) sequences using recurrence relations From: Corwin Joy < cjoy@xxxx > Date: Fri, 10 Aug 2001 01:21:28 -0500 the following sentence: >In table 72, p. 511 of the standard you will notice something weird about >the postfix increment operator: >Namely, it is specified as (void)r++. >In other words, unlike all other standard iterator types, an input iterator >is not required to return a copy of its old value! but this would mean that the expression *i++ is wrong in most cases. is there a trick to make iterator_adaptor also handle this case or shall i hope that nobody types *i++ with my bit_iterator based on such an input iterator, or did i understand something incorrectly? regards -- jan langer ... jan(a)langernetz.de "pi ist genau drei"

2 1

shared_ptr in Borland C++ Builder
by Craigus 12 Jun '02

12 Jun '02

Hi I'm new to using the Boost library. I'm using the shared_ptr because I can't do what I want to do with the std::auto_ptr (which is to have them stored in other STL containers). I ran into the following problem in C++ Builder 5, patch 1- I have Codeguard turned on (detects memory leaks, accessing freed memory, overwriting memory illegally and the like). When the shared_ptr object count goes to zero operator() in checked_deleter eventually gets called. Codeguard is reporting (in poor English): Method called on illegally casted object It doesn't matter what type the shared_ptr holds. I even tried a console program that contains only the following line (apart from return 0; of course :-): boost::shared_ptr< int > tmp( new int ); As soon as that object goes out of scope it is destroyed and operator() is called as I indicated above and Codeguard reports the error. Has anyone else seen this behaviour ? I was originally using Boost 1.27, which gave me the same error when I used the reset method. I downloaded 1.28 and that went away so that now it's only happening when the actual shared_ptr object is destroyed. I don't have much idea of what's going on inside the shared_ptr, so I don't even know where to start looking. Any help will be much appreciated. Thanks Craigus

1 0

Re: Re: How to use Iterator Adaptors?
by David Abrahams 12 Jun '02

12 Jun '02

"Duane Murphy" <duanemurphy(a)mac.com> wrote in message news:20020610181043.12388@mail.murphyslogic.com... > --- At Tue, 4 Jun 2002 13:02:08 +0100, Keith MacDonald wrote: > > >> So, what is the "normal" way of creating an iterator out of thin air as > >> it were? > > > >That was the question in my mind, which the first sentence of the Iterator > >Adaptors documentation led me to hope it would answer: "The Iterator Adaptor > >library allows you transform an arbitrary ``base'' type into a > >standard-conforming iterator". If the base type is a container, how do you > >do it? > > Keith, > Your email was delayed in my queue for some reason. Were you able to > figure out how to do an iterator from a container from the discussion > between Dave Abrahms and myself? Well, of course you have to think about what data the iterator will need in order to do the iteration. The Base type can't be just a container if you want the iterator to traverse the container's elements -- you need to store some indication of the position within the container -- e.g. a node pointer, and index, or an interator -- as (part of) the Base type. -Dave

1 0

[BGL]
by Angelique Michaut 12 Jun '02

12 Jun '02

Hello, I use the BGL to read a graphviz file and I do a depth_first_search on the graph. I would like to determine the fontname (times-roman for example) the fontcolor (black for example) and the position of each node when the depth_first_search is done. Could you help me? Thinks

1 0

How to use Iterator Adaptors?
by keithmac66 11 Jun '02

11 Jun '02

Hi, I'm struggling to understand how to use Iterator Adaptors, due to a lack of simple examples. This is disappointing, given that supposedly "Using iterator_adaptor, you can easily implement an iterator class" (www.boost.org/libs/utility/iterator_adaptors.htm) Can anyone help, by explaining how to implement a random access iterator for a custom collection class? e.g.: template <class T> class DumbCollection { public: DumbCollection(T data[10]) { for (int i = 0; i < 10; i++) m_data[i] = data[i]; } iterator begin(); iterator end(); private: T m_data[10]; }; Thanks, Keith

7 15

how to compile the boost/regex without comand line
by Aza Lsaja 11 Jun '02

11 Jun '02

Hi, I'm new on this list as well as on C++ world. I try to install boost library but failed. This is what I did: [Win98, MSVC 6.0 without service pack] 1. Download and extract the zip file to root directory. I have C:\boost_1_27_0 now. (success) 2. Download Boost.Build for windows from sourceforge, unpack and installing, reboot (success) 3. go to c:\boost_1_27_0 directory, then execute this in command prompt: jam -sBOOST_ROOT=. -sTOOLS="msvc" (fail) the dos prompt yield many lines but I cant read it. It's too fast. I think it's error messages. Or maybe I missing some procedure? please let me know. I guess my compiler is broken and I need MSVC service pack. But, I can't download it at this time. Acctually, I just want to use the boost's regex library. Can I compile the regex manually (by the IDE) so I can use it with include ( #include <boost/regex.hpp> ) in my codes? If yes, how? Sorry for my english, I hope you understand me. Thanks. Aza ------------------- Kemudahan Hosting PlasaCom ---------------------------------- Hosting menjadi lebih mudah dan murah dengan keringanan 50% biaya registrasi mail hosting dan webhosting selama bulan Juni 2002. Klik http://idc.plasa.com untuk pendaftaran ---------------------------------------------------------------------------------

3 2

[BGL] How can my visitors visit?
by �ڱ�� 11 Jun '02

11 Jun '02

Compiling below, It's OK. but executing, visitors do nothing. What's the problem? Is this slicing problem? why? thank you in advance. ---------------------- below ------------------------ // bfs visitor 1. just printing every vertex in breath first order. struct graph_printer1 : public default_bfs_visitor { template<typename Vertex, typename Graph> void discover_vertex(Vertex u, Graph& g) { cout << " graph printer 1" << u <<"\n"; } }; // bfs visitor 2. same as visitor 1 except message. struct graph_printer2 : public default_bfs_visitor { template<typename Vertex, typename Graph> void discover_vertex(Vertex u, Graph& g) { cout << " graph printer 2" << u <<"\n"; } }; // graph wrapper class graph_wrapper { protected: adjacency_list<vecS, vecS, bidirectionalS, VertexProperty, EdgeProperty> m_graph; public: // HERE. this Visit function does nothing.!! void Visit(default_bfs_visitor* vis, int vertexID ) { breadth_first_search(m_graph, vertex(vertexID, m_graph), visitor(*vis)); } }; int main() { graph_wrapper holder; graph_printer1 vis1; graph_printer2 vis2; holder.Visit(&vis1); holder.Visit(&vis2); return 0; } ---------------------------------------- Ki-Soo, Park e-mail: park(a)erhouse.co.kr wfms123(a)hotmail.com

1 0

Hi!
by rajanik3 11 Jun '02

11 Jun '02

Hi! Could some body tell me how to use boost libraries in Unix. I am using tcsh shell. After downloading, what should I change in order for the compiler to locate the boost library headers. Thanks, Raj.

1 0

thread::join() usage
by rgalek2002 10 Jun '02

10 Jun '02

Hi, I have an application which starts a number of threads, and I want the application to wait for the threads to finish before exiting. Standard stuff, I know, but never having used threads before I am wondering what the stadard way is to accomplish this. I have (psuedo code) for (each record in database) { thread thrd(func(), data); } I could imagine storing all my thread objects in a list, and then calling join() on each one. For example something like list <thread> threads; for (each rec in db) { thread thrd(func(), data); threads.insert(threads.begin(),thrd); } list<thread>::iterator i; for (i=threads.begin(); i!=threads.end(); i++) { thread t = *i; t.join(); } Does this seem reasonable? Is there a better/standard way? One thing I don't like here is that each join will block, when what I would like to do is something more like join_all(); Thanks, Rich

2 1

Intel-win32 Build Problem
by thorneg 09 Jun '02

09 Jun '02

I'm getting errors in xtime.cpp relating to uint64_t when building with the Intel-win32 v6.0 compiler. The errors are: xtime.cpp libs\thread\build\../src\xtime.cpp(80): error: namespace "boost" has no member "uint64_t" const boost::uint64_t TIMESPEC_TO_FILETIME_OFFSET = ((boost::uint64_t)27111902UL << 32) + (boost::uint64_t)3577643008UL; Has anyone else run into this? Any help is appreciated. Glenn

1 0

Dynamic Bitset Formal Review June 8-17
by Mat Marcus 08 Jun '02

08 Jun '02

The formal review of Dynamic Bitset by Chuck Alison and Jeremy Siek will commence today Saturday June 8th and run through Monday, June 17th. The library is currently available at <http://groups.yahoo.com/group/boost/files/dyn_bitset.tar.gz> Below is an excerpt from the library's documentation: The dyn_bitset class represents a set of bits. It provides accesses to the value of individual bits via an operator[] and provides all of the bitwise operators that one can apply to builtin integers, such as operator&& and operator<<. The number of bits in the set is specified at runtime via a parameter to the constructor of the dyn_bitset. Each bit represents either the Boolean value true (set) or false (reset). To toggle a bit is to change the value to true if it is false and to false if it is true. Each bit has a non-negative position pos. The position pos == 0 corresponds to the least significant bit and pos == size() - 1 is the most significant bit. When converting an instance of dyn_bitset to or from an unsigned long, the bit position pos corresponds to the bit value 1 << pos. The dyn_bitset class is nearly identical to the std::bitset class. The difference is that the size of the dyn_bitset (the number of bits) is specified at run-time during the construction of a dyn_bitset object, whereas the size of a std::bitset is specified at compile-time through an integer template parameter. For information about submitting a Formal Review, see http://www.boost.org/more/formal_review_process.htm Please try out the library and comment during the review period. Be sure to say whether or not you think the library should be accepted by Boost. Compiler notes: This library has been tested using the following compiler platforms: Gcc 2.95 and 3.01 Kai C++ Metrowerks Codewarrior 8 (beta, Mac) Visual C++ 7.0 Comeau The library presently requires template friend support and is known not to compile with CodeWarrior 7.2 or Visual C++ 6.0. The library has not been tested with Borland. The Formal Review manager is Mat Marcus.

1 0

MacOS.hpp and PowerPlant incompatibility
by Bobby Thomale 08 Jun '02

08 Jun '02

I am trying to use the boost libraries with a PowerPlant project on the MacOS, and I ran into a small incompatibility between the headers. I am not sure which codebase is at fault here. The issue is with the __MACH__ symbol. In the Boost code where it is checking for what platform I am using, it correctly identifies my platform as MacOS. Then, in a file called MacOS.hpp, it uses the __MACH__ symbol to determine if I am using the BSD standard C libraries or MSL. (I am using MSL.) It does this by checking for the EXISTANCE of the __MACH__ symbol, not the value of it: // If __MACH__, we're using the BSD standard C library, not the MSL: #if defined(__MACH__) However, in the PowerPlant header PP_Macros.h, the __MACH__ symbol is defined and set to zero: #ifndef __dest_os // For MSL #ifndef __MACH__ #define __MACH__ 0 #endif #if __MACH__ #include <ansi_prefix.mach.h> #else #define __dest_os __mac_os #endif #endif I was able to work around the problem for now by making the Boost libraries check for both the existance of __MACH__ and the value: #if defined(__MACH__) && __MACH__ Seems to work. However, I am curious. Which way is the right way? Is the __MACH__ symbol's existance or its value supposed to signal whether or not it is "turned on"? The boost headers seem to think it is its existance, but the PowerPlant headers seem to think it is its value. I want to report the problem, but I am not sure whose code needs to change, PowerPlant or Boost. Ideas? -- Bobby --------------------------------------------------------------------- Bobby Thomale Senior Software Developer Inoveon Corporation http://www.inoveon.com/ ---------------------------------------------------------------------

4 5

[BGL] How can I use vertex object rather than integer?
by �ڱ�� 07 Jun '02

07 Jun '02

for example, class Node { public: int m_id; }; class Edge { public: int from_node_id; int to_node_id; }; How can I use this class to make graph? many examples show only integer id graph.. thanks in advance ---------------------------------------- Ki-Soo, Park HP: 82-11-9040-4957 e-mail: park(a)erhouse.co.kr wfms123(a)hotmail.com

4 3

[BGL] how to use visitor with functor?
by �ڱ�� 06 Jun '02

06 Jun '02

Can I use visitor with functor ? In BGL example on visitor, int main() { : boost::breadth_first_search (G, vertex(0, G), visitor(make_bfs_visitor( std::make_pair(print_edge("tree", on_tree_edge()), print_edge("cycle", on_non_tree_edge()))))); : } I want to do like this boost::breadth_first_search (G, vertex(0, G), visitor(make_bfs_visitor( std::make_pair(print_edge("tree", on_tree_edge(), MyFunctor1() ), print_edge("cycle", on_non_tree_edge(), MyFunction2() ))))); can i do this? how? why? thanks in advance.. ps. ths is my first posting. ---------------------------------------- Ki-Soo, Park e-mail: park(a)erhouse.co.kr wfms123(a)hotmail.com

2 1

Boost::Python constructor overloading problems
by John Hunter 06 Jun '02

06 Jun '02

I have been using boost python for some time now and recently upgraded to boost_1_28_0 and gcc 3.0.4. I started getting a segmentation fault when using a library with an overloaded constructor. In trying to track down the source of the problem, I wrote a simple class with an overloaded constructor and still get the seg fault. Perhaps there is something wrong with code or the compile statement, but I have been unable to find. it. So I've also included some additional info below that may give someone a clue as to what is going wrong. Here is the python script which calls the simple class. The second constructor crashes with a seg fault: from TestSimple import Simple # Default constructor OK d1 = Simple() print d1.get() i = 1 d2 = Simple(i) # this line causes the seg fault print d2.get() ---- Here is the code I use to make the module TestSimple: #include <boost/python/class_builder.hpp> class SimpleClass { public: SimpleClass() : i(-1) {}; SimpleClass(int i) : i(i) {}; int get() const { return i; } private: const int i; }; namespace python = boost::python; BOOST_PYTHON_MODULE_INIT(TestSimple) { python::module_builder m( "TestSimple" ); python::class_builder<SimpleClass> simple(m, "Simple"); simple.def(python::constructor<>()); simple.def(python::constructor<int>()); simple.def(&SimpleClass::get, "get"); } ---- Here are the compile commands: /usr/local/bin/g++ -I/usr/local/include/python2.1 -I/usr/local/include -ggdb -Wall -fPIC -ftemplate-depth-21 -c TestSimplePy.cpp /usr/local/bin/g++ -shared -L/usr/local/lib -ggdb -Wall -fPIC -ftemplate-depth-21 TestSimplePy.o -o TestSimple.so -lboost_python ---- I run the script in a controlled environment with: #!/bin/sh export LD_LIBRARY_PATH=/usr/local/lib /usr/local/bin/python2.1 ./testSimple.py ---- Here is the ldd for the TestSimple module: mother:~/c/trade/test> ldd TestSimple.so libboost_python.so.1.28.0 => /usr/local/lib/libboost_python.so.1.28.0 (0x40011000) libstdc++.so.3 => /usr/local/lib/libstdc++.so.3 (0x40078000) libm.so.6 => /lib/i686/libm.so.6 (0x40112000) libgcc_s.so.1 => /usr/local/lib/libgcc_s.so.1 (0x40136000) libc.so.6 => /lib/i686/libc.so.6 (0x4013e000) libutil.so.1 => /lib/libutil.so.1 (0x4026e000) /lib/ld-linux.so.2 => /lib/ld-linux.so.2 (0x80000000) ---- All the version info looks right -- python2.1 was compiled with the same gcc (3.0.4) that the module was. Thanks for any suggestions, John Hunter

2 4

CW project file
by NOEL Bruno 06 Jun '02

06 Jun '02

Hello, As I am much more familiar with the Metrowerks IDE than with standard makefiles, has anyone made a .mcp project file able to compile whole of the boost library with Codewarrior ? Thanks for the answers and possible files ! Bruno NOËL

1 0

Re: problem with c_regex_traits.cpp
by René Gutschmidt 06 Jun '02

06 Jun '02

>> i have problems with the file c_regex_traits.cpp. I work under CodeWarrior >> 6/7 with a Macintosh. >> These problem ist with boost 1.25.1,1.26. >> >> template <class charT> >> unsigned int BOOST_REGEX_CALL re_get_message(charT* buf, unsigned int >> len, unsigned int id) >> { >> unsigned int size = _re_get_message((char*)0, 0, id); >> if(len < size) >> return size; >> boost::scoped_array<char> cb(new char[size]); >> _re_get_message(cb.get(), size, id); >> size = boost::c_regex_traits<wchar_t>::strwiden(buf, len, cb.get()); >> return size; >> } >> >> inline unsigned int BOOST_REGEX_CALL re_get_message(char* buf, unsigned >> int len, unsigned int id) >> { >> return _re_get_message(buf, len, id); >> } >> >> Is that a known problem? Do you know a workaround? >> (Renaming one of the 're_get_message()' functions does >> the job, but I'm not sure about the implications.) > > I've had a chance to experiment a little with this - if BOOST_NO_WREGEX is > defined (i.e. wide character support is disabled), then removing the > template version of re_get_message is harmless (and may therefore be the fix > that you are looking for). If BOOST_NO_WREGEX is not defined, then > obviously this won't work - so that being the case, what happens if you > surround the definition of > > template <class charT> > unsigned int BOOST_REGEX_CALL re_get_message(charT* buf, unsigned int len, > unsigned int id) > > with > > #ifndef BOOST_NO_WREGEX > ... > #endif > > regards, > > John Maddock Sorry, but I haven't had a chance to answer. Ok it's works. But I need 'wide character support' much later. best regards, Rene Gutschmidt

2 4

RE: [Boost-Users] Re: boost::noncopyable usage question
by Michael Davis 06 Jun '02

06 Jun '02

Thank you for the clarification. :) -----Original Message----- From: Darin Adler To: Boost-Users(a)yahoogroups.com Sent: 6/6/2002 12:57 AM Subject: Re: [Boost-Users] Re: boost::noncopyable usage question On Wednesday, June 5, 2002, at 03:14 PM, Michael Davis wrote: > According to the C++ Standard, 12.8/10, the assignment operator cannot > be > inherited because if it is not provided, the compiler will provide one > implicitly. Or at least, that is my understanding of it. > > Given this, how can boost::noncopyable work? The assignment operator provided by the compiler for the class derived from noncopyable has to copy the part of the object that's inherited from noncopyable. To do that, it has to use the assignment operator from the noncopyable class; but if it's inaccessible, like the private one in noncopyable, it has to report an error. This rule is mentioned in 12.8/14. -- Darin 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/

1 0

type_traits::is_POD<> problem
by s9801758 06 Jun '02

06 Jun '02

Hello, I'm using MSVC6.0 with service-pack 6.0 installed. But I'm getting some weird problems. Consider the following simple program: ---------------------------------------------------- struct q { int x; }; int main() { int t; t = boost::is_POD< int >::value; // Ok, t = true; t = boost::is_POD< void >::value; // Ok?, t = true (is 'void' considered a POD?); t = boost::is_POD< q >::value; // Error, t = false } ---------------------------------------------------- Unless my definition of a POD type is incorrect, I think that q is considered POD, right? Am I doing something wrong here, or is the combination boost and msvc fatal once again? Just to be complete, I have the following defines in my main header: #define BOOST_NO_FUNCTION_PTR_TEMPLATE_PARAMETERS #define BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION Thanks in advance, Jaap Suter

2 1

Boost regex and MacOS X.
by Mystical Catty Tananeka 06 Jun '02

06 Jun '02

I've been trying to make MacOS X compile the example snippets from boost_1_28_0/libs/regex/example/snippets/ and I keep getting these messy link errors. It looks like /usr/bin/c++ is having trouble linking to libboost_regex.a here's an example: localhost% c++ -o regex_grep_example_1 regex_grep_example_1.cpp -lboost_regex /usr/bin/ld: Undefined symbols: __._Q25boostt14reg_expression3ZcZQ25boostt12regex_traits1ZcZt9allocator1Zc ___Q25boostt14reg_expression3ZcZQ25boostt12regex_traits1ZcZt9allocator1ZcPCc UiRCB2 ___Q35boost9re_detailt18match_results_base2ZPCcZt9allocator1ZcRCB1 _allocator__CQ25boostt14reg_expression3ZcZQ25boostt12regex_traits1ZcZt9alloc ator1Zc _allocator__CQ35boost9re_detailt18match_results_base2ZPCcZt9allocator1Zc _cow__Q35boost9re_detailt18match_results_base2ZPCcZt9allocator1Zc _m_free__Q35boost9re_detailt18match_results_base2ZPCcZt9allocator1Zc _set_first__Q35boost9re_detailt18match_results_base2ZPCcZt9allocator1ZcPCc _set_first__Q35boost9re_detailt18match_results_base2ZPCcZt9allocator1ZcPCcUl _set_size__Q35boost9re_detailt18match_results_base2ZPCcZt9allocator1ZcUlPCcn 1 localhost% I haven't enough experience with boost to know how to fix this, or even what it means, exactly. If its informative, c++ -v returns: Apple Computer, Inc. version gcc-934.3, based on gcc version 2.95.2 19991024 (release)

2 1

BGL: subgraph<..> Problems
by Matthias Kronenberger 06 Jun '02

06 Jun '02

1. How to create a subgraph from a given simple boost graph type? 2. Why are modell subgraph not the same concept as the underlying graph type? Why are not all non-member function defined for the only graph modell adjacence_list<> also available for subgraph? 3. I've defined something like class NG { public: typedef boost::property<boost::vertex_all_t, SomeIterator, Vertex_Property > vertex_SPIterator_Prop; // GridSP_type::iterator typedef Default::Graph<vertex_SPIterator_Prop, Edge_Property>::Subgraph::Undirected Graph; ... }; where struct Default { ..... template<class VertexProperties=boost::no_property, class EdgeProperties=boost::no_property, class GraphProperties=boost::no_property, class EdgeList=boost::hash_setS, class VertexList=boost::listS > struct Graph { ........ struct Subgraph { typedef typename boost::subgraph < boost::adjacency_list<EdgeList, VertexList, boost::undirectedS, boost::property<boost::vertex_index_t,int, VertexProperties>, boost::property<boost::edge_index_t, int, EdgeProperties > ,GraphProperties> > Undirected; }; .... }; and then i'm doing somewhere else { vertex_descriptor v=boost::add_vertex( theGraph); IteratorMap[Prop ] =v; boost::put( boost::vertex_all_t() , theGraph, v, Prop); return v; } I get a nice error with MSVC 6.5 d:\matthias\programmieren\boost\boost\graph\subgraph.hpp(751): error C2679: Binaerer Operator '=': Kein Operator definiert, der einen rechtsseitigen Operator vom Typ 'const _Ht_iter<pair<int const,surrect::PNSurfel<vectorD<float,3>>>,_Nonconst_trait............ (no operator= defined for the type conversion used in put pmap[k] = val;) But using a simple adjacence_list<..> instead of the subgraph< adjacence_list<...> this mess compiles fine. What am i doing wrong? Are there better ways to create a property map containing (const) iterators, that don't modell STL::RandomAccesIterator? Matthias

1 0

RE: [Boost-Users] Re: boost::noncopyable usage question
by Michael Davis 06 Jun '02

06 Jun '02

According to the C++ Standard, 12.8/10, the assignment operator cannot be inherited because if it is not provided, the compiler will provide one implicitly. Or at least, that is my understanding of it. Given this, how can boost::noncopyable work?

2 1

RE: [Boost-Users] boost::noncopyable usage question
by Mark Storer 05 Jun '02

05 Jun '02

This is more of a C++ question than a boost one (which is why I can answer it;). Your deletes are fine. The only way this would cause a problem is to delete through a boost::noncopyable pointer (in which case everything derived from it would leak). I'm guessing the author, Dave Abrahams, didn't think anyone was going to declare a noncopyable*, so decided to pass on that little bit of extra overhead involved in declaring a destructor virtual. Or it could be a mistake. Dave has posted to this list at least once... So tell us, did you mean to leave it non-virtual? --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Bobby Thomale [mailto:bthomale@mac.com] Sent: Wednesday, June 05, 2002 9:30 AM To: Boost Users List Subject: [Boost-Users] boost::noncopyable usage question I have a simple question about the usage of boost::noncopyable. I think I know the answer, but I am not sure. The noncopyable class defines a non-virtual destructor. Generally speaking, overriding a non-virtual destructor is considered a "bad thing" but in certain cases (like, I am guessing, this one) it is okay and works like you'd expect. Here's what I am worried about: Let's say I have a base class of an inheritance tree that I want to be non-copyable. So I do this: class MyBase : private boost::noncopyable { public: MyBase (); virtual ~MyBase (); ... }; Then I derive from it class A: class A : public MyBase { public: A (); virtual ~A(); }; and define a destructor for class A, too. Does this do what I would expect, ie whether I delete a MyBase* or an A*, it calls the destructors for both A and MyBase like it is supposed to? I suppose the trivial, empty noncopyable destructor never gets called (which is okay) whether I delete a MyBase* or an A*, correct? (Just curious...) -- Bobby --------------------------------------------------------------------- Bobby Thomale Senior Software Developer Inoveon Corporation http://www.inoveon.com/ --------------------------------------------------------------------- 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/

4 3

boost::noncopyable usage question
by Bobby Thomale 05 Jun '02

05 Jun '02

I have a simple question about the usage of boost::noncopyable. I think I know the answer, but I am not sure. The noncopyable class defines a non-virtual destructor. Generally speaking, overriding a non-virtual destructor is considered a "bad thing" but in certain cases (like, I am guessing, this one) it is okay and works like you'd expect. Here's what I am worried about: Let's say I have a base class of an inheritance tree that I want to be non-copyable. So I do this: class MyBase : private boost::noncopyable { public: MyBase (); virtual ~MyBase (); ... }; Then I derive from it class A: class A : public MyBase { public: A (); virtual ~A(); }; and define a destructor for class A, too. Does this do what I would expect, ie whether I delete a MyBase* or an A*, it calls the destructors for both A and MyBase like it is supposed to? I suppose the trivial, empty noncopyable destructor never gets called (which is okay) whether I delete a MyBase* or an A*, correct? (Just curious...) -- Bobby --------------------------------------------------------------------- Bobby Thomale Senior Software Developer Inoveon Corporation http://www.inoveon.com/ ---------------------------------------------------------------------

2 2

Tupls browsing...
by Igor Korzinek 04 Jun '02

04 Jun '02

Hi, I did not take a look at the tuple internals, but it seems that there is some head-tail connection probably built in compile time. So can someone from template gurus answer if it makes sense and if it is possible to add some method that will make sequential access possible. Some function that will getNext() or some kind of search within a tuple ? Is it too stupid or just impossible ? Igor

1 0

Is it worth using if I use MSVC
by Igor Korzinek 04 Jun '02

04 Jun '02

Hi, I'm new to boost. The doc I've browsed seems fine and something what I need. I'm focusing on TUPLEs part. So, besides mentioned cref and ref stuff, is there any other issue I can expect with awful (but a must for me) MS VC 6 ? And are there any sample for using this part of boost ? THX, Igor

1 1

Newbie Thread Installation Problem
by gclee46 03 Jun '02

03 Jun '02

(Please excuse me it this is a duplicate post - I tried to send it yesterday and it didn't seem to arrive) I have Boost 1_28_0 and installed the prebuilt version of Jam for Windows. After installing threads with C:\boost_1_28_0>bjam "-sTOOLS=borland" I get, after skipping the pyton stuff, and all the install messages: ...found 390 targets... However when I try to use the thread I get the following: Borland C++ 5.5.1 for Win32 Copyright (c) 1993, 2000 Borland testthread1.cpp: Fatal F1003 \boost_1_28_0\boost/thread/thread.hpp 17: Error directive: Thread support is unavailable! *** 1 errors in Compile *** I believe that I followed all the directions...I'm using Windows XP Home. Any help would be greatly appreciated. Greg

1 0

BGL and MS compilers (VC++ and Wince)
by a_schweitzer 03 Jun '02

03 Jun '02

I am having difficulting getting BGL to compiler with VC++ 6.0 and Windows CE 3.0, platform builder. In both cases I get internal compiler errors, although at different lines in the compiler. VC++ worked when I had all my code in one cpp file. When I broke it out into multiple files I couldn't get it to compile even when I put it back in one file. I have tried the Zm and Z7 switches to no avail. Perhaps I need the service pack? Wince dies much more quickly, I think when it sees adjacency_list.hpp or depth_first_search.hpp. Does anyone have some perspective on how BGL projects with MS work out? Is there any hope for Wince?

1 0

Dynamic Bitset - Upcoming Formal Review
by Mat Marcus 03 Jun '02

03 Jun '02

The formal review of Dynamic Bitset by Chuck Alison and Jeremy Siek will commence on Saturday June 8th and run through Monday, June 17th. The library is currently available at <http://groups.yahoo.com/group/boost/files/dyn_bitset.tar.gz> Below is an excerpt from the library's documentation: The dyn_bitset class represents a set of bits. It provides accesses to the value of individual bits via an operator[] and provides all of the bitwise operators that one can apply to builtin integers, such as operator&& and operator<<. The number of bits in the set is specified at runtime via a parameter to the constructor of the dyn_bitset. Each bit represents either the Boolean value true (set) or false (reset). To toggle a bit is to change the value to true if it is false and to false if it is true. Each bit has a non-negative position pos. The position pos == 0 corresponds to the least significant bit and pos == size() - 1 is the most significant bit. When converting an instance of dyn_bitset to or from an unsigned long, the bit position pos corresponds to the bit value 1 << pos. The dyn_bitset class is nearly identical to the std::bitset class. The difference is that the size of the dyn_bitset (the number of bits) is specified at run-time during the construction of a dyn_bitset object, whereas the size of a std::bitset is specified at compile-time through an integer template parameter. For information about submitting a Formal Review, see http://www.boost.org/more/formal_review_process.htm Please try out the library so that you will be prepared to to say whether or not you think the library should be accepted by Boost during the upcoming review period next week Compiler notes: This library has been tested using the following compiler platforms: Gcc 2.95 and 3.01 Kai C++ Metrowerks Codewarrior 8 (beta, Mac) The library presently requires template friend support and therfore is known not to compile with CodeWarrior 7.2. The library has not been tested with VC++ or Borland. The Formal Review manager will be Mat Marcus.

1 0

Compilation question
by rgalek2002 03 Jun '02

03 Jun '02

Hi, I am a new user of the boost libs, so sorry for the supid questions. I am running into a compilation error while trying to compile listing 2 and listing 3 from Bill Kempf's article at http://www.cuj.com/articles/2002/0205/0205a/0205a.htm, giving simple usage examples of boost threads. 1. When I compile listing 2, the compiler chokes on the lines boost::thread thrd1(count(1)); boost::thread thrd2(count(2)); with the errors listing2.C:27: no matching function for call to `count (int)' listing2.C:28: no matching function for call to `count (int)' As you can see in the listing online, count is defined as 'struct count{...}' Upon perusal of threah.hpp, I see that, indeed, the class thread constructor is looking for a function, not a struct or class as count is defined in this code. Am I missing something, or is the code in error? 2. In listing 2, I get the following errors when compiling: listing3.C:29: no matching function for call to `bind ({unknown type}, int)' listing3.C:31: no matching function for call to `bind ({unknown type}, int)' This is in response to the lines: boost::thread thrd1(boost::bind(&count, 1)); boost::thread thrd2(boost::bind(&count, 2)); Again, am I missing something or what? I have pasted the code directly from the source as provided online. TIA for your help Richard

3 2

regex Guidance
by Duane Murphy 31 May '02

31 May '02

Fellow Boosters, I am looking for a little guidance with the regex library. I have an application that I would like to use regex for. I am new to regex so I am not sure how to approach it. Mostly I am reading. The examples so far have been very impressive, but so complicated as to make it difficult to understand how to do something simple. What I would like to do is process a string (or file) that has many symbols that are delimited with something like "&foo;". The delimiters are not that interesting. Just something to make them easy to locate. The string between the delimiters is then used to lookup a replacement string and substituted. I would search for something like "&.*;". The examples show how a basic search and replace would work, but how would I do something with a looked-up replace? ...Duane -- "If tyranny and oppression come to this land, it will be in the guise of fighting a foreign enemy." - James Madison

1 1

regex and CodeWarrior?
by Duane Murphy 31 May '02

31 May '02

I am using Boost 1.27. Is there instructions or examples for how to use the regex library with Metrowerks CodeWarrior on a Macintosh (9.x)? ...Duane -- "If tyranny and oppression come to this land, it will be in the guise of fighting a foreign enemy." - James Madison

2 1

regex++ error
by adryio55 31 May '02

31 May '02

Hello, it seems there's an error in reg_expression::operator< in regex_compile.hpp file: bool BOOST_REGEX_CALL reg_expression<charT, traits, Allocator>::operator<(const reg_expression<charT, traits, Allocator>& e)const { // // we can't offer a diffinitive ordering, but we can be consistant: if(_flags != e.flags()) return _flags < e.flags(); if(_expression_len != e._expression_len) return _expression_len < e._expression_len; //error //return std::memcmp(expression(), e.expression(), _expression_len); //right return std::memcmp(expression(), e.expression(), _expression_len) < 0; } The error makes (regular expressions with equal _flags and _expression_len) memcmp() result -1 and +1, to be coverted in the same true bool return value; Thanks, Adriano

2 1

Regex++ regression test failed
by bustamam98 31 May '02

31 May '02

I've compiled boost 1.28 and tried the regex++ regression testing on test1252.txt. It looks like it's failing on some of the input lines. I'm running Linux RH72. Have anyone have any success with this file? Thanks Bustamam Error in line 10 of file test1252.txt Expression: [[:lower:]]+ Search text: Þßàáâãäåæçèéêëìíîïðñòóôõöøùúûüýþ÷ Flags: REG_EXTENDED | REG_PERL | REG_AWK | REG_EGREP | basic | char_classes | intervals | bk_refs | normal | basic | extended Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using POSIX API Error in line 11 of file test1252.txt Expression: [[:upper:]]+ Search text: ¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖØÙÚÛÜÝÞß Flags: REG_EXTENDED | REG_PERL | REG_AWK | REG_EGREP | basic | char_classes | intervals | bk_refs | normal | basic | extended Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using POSIX API Error in line 12 of file test1252.txt Expression: [[:punct:]]+ Search text: ¡¢£¤¥¦§¨©ª«¬®¯°±²³´µ¶·¸¹º»¼½¾¿À Flags: REG_EXTENDED | REG_PERL | REG_AWK | REG_EGREP | basic | char_classes | intervals | bk_refs | normal | basic | extended Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using POSIX API Error in line 13 of file test1252.txt Expression: [[:print:]]+ Search text: ¡¢£¤¥¦§¨©ª«¬®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêë= ìíîïðñòóôõö÷øùúûüýþ Flags: REG_EXTENDED | REG_PERL | REG_AWK | REG_EGREP | basic | char_classes | intervals | bk_refs | normal | basic | extended Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using POSIX API Error in line 14 of file test1252.txt Expression: [[:graph:]]+ Search text: ¡¢£¤¥¦§¨©ª«¬®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêë= ìíîïðñòóôõö÷øùúûüýþ Flags: REG_EXTENDED | REG_PERL | REG_AWK | REG_EGREP | basic | char_classes | intervals | bk_refs | normal | basic | extended Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using POSIX API Error in line 15 of file test1252.txt Expression: [a-z]+ Search text: ßàáâãäåæçèéêëìíîïðñòóôõöøùúûüýþ Flags: REG_EXTENDED | REG_PERL | REG_AWK | REG_EGREP | basic | char_classes | intervals | bk_refs | normal | basic | extended Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using POSIX API Error in line 16 of file test1252.txt Expression: [a-z]+ Search text: ¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖØÙÚÛÜÝÞ Flags: REG_EXTENDED | REG_PERL | REG_AWK | REG_EGREP | basic | char_classes | intervals | bk_refs | normal | basic | extended Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using POSIX API Error in line 17 of file test1252.txt Expression: [[:word:]]+ Search text: ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖØÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòóôõöøùúûüýþ Flags: REG_EXTENDED | REG_PERL | REG_AWK | REG_EGREP | basic | char_classes | intervals | bk_refs | normal | basic | extended Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using POSIX API Error in line 19 of file test1252.txt Expression: [[=a=]]+ Search text: aAàáâãäåÀÁÂÃÄÅ Flags: REG_EXTENDED | REG_PERL | REG_AWK | REG_EGREP | basic | char_classes | intervals | bk_refs | normal | basic | extended regex++ API result mismatch in sub-expression 0, found (0,1) expected (0,14) regex++ API result mismatch in regex_match(iterator, iterator, match_results&, const reg_expression&, int) regex++ API result mismatch in regex_match(const std::string&, match_results&, const reg_expression&, int) regex++ API result mismatch in regex_match(const char_t*, match_results&, const reg_expression&, int) regex++ API result mismatch in sub-expression 0, found (0,1) expected (0,14) regex++ API result mismatch in regex_match(iterator, iterator, match_results&, const reg_expression&, int) regex++ API result mismatch in regex_match(const std::string&, match_results&, const reg_expression&, int) regex++ API result mismatch in regex_match(const char_t*, match_results&, const reg_expression&, int) regex++ API result mismatch in sub-expression 0, found (0,1) expected (0,14) POSIX API result mismatch in sub-expression 0, found (0,1) expected (0,14) Error in line 25 of file test1252.txt Expression: ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖØÙÚÛÜÝ Search text: ßàáâãäåæçèéêëìíîïðñòóôõöøùúûüýþ Flags: REG_EXTENDED | REG_ICASE | REG_PERL | REG_AWK | REG_EGREP | basic | char_classes | intervals | bk_refs | normal | basic | extended Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using regex++ API Match expected but not found using POSIX API 35 lines, 10 tests completed in file test1252.txt **** returning with error code 10 ********** errors detected; see stdout for details ***********

2 3

RE: [Boost-Users] shared_ptr and lazy copy
by Michael Davis 30 May '02

30 May '02

There is an implementation of the method you described (const and non-const versions of operator-> and operator*) at the following website: http://ootips.org/yonat/4dev/ Perhaps this guy might be talked into submitting it. -----Original Message----- From: Mark Storer To: 'Boost-Users(a)yahoogroups.com' Sent: 5/30/2002 1:35 PM Subject: [Boost-Users] shared_ptr and lazy copy Is there an easier way to use shared_ptr as a lazy copy method? It seems to me that the only way to do it would be by testing unique() (or use_count()) every time the pointed-to object was to be changed: boost::shared_ptr<foo> bar(new foo); boost::shared_ptr<foo> baz = bar; if(!baz->unique()) ... // make a deep copy baz->ChangeAFoo(); I can't think of a good way to alter shared_ptr either. The only thing I came up with would be const and non-const versions of operator-> and operator* where the non-const versions checked unique() and made a deep copy. This would seem to fall into that last question in the FAQ anyway... "Why doesn't shared_ptr provide (your pet feature here)". I'd think this could easily lead to unnecessary deep copies unless the programmer took explicit steps (lots of const_cast's) to avoid it. Am I missing anything? --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; 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/

1 0

shared_ptr and lazy copy
by Mark Storer 30 May '02

30 May '02

Is there an easier way to use shared_ptr as a lazy copy method? It seems to me that the only way to do it would be by testing unique() (or use_count()) every time the pointed-to object was to be changed: boost::shared_ptr<foo> bar(new foo); boost::shared_ptr<foo> baz = bar; if(!baz->unique()) ... // make a deep copy baz->ChangeAFoo(); I can't think of a good way to alter shared_ptr either. The only thing I came up with would be const and non-const versions of operator-> and operator* where the non-const versions checked unique() and made a deep copy. This would seem to fall into that last question in the FAQ anyway... "Why doesn't shared_ptr provide (your pet feature here)". I'd think this could easily lead to unnecessary deep copies unless the programmer took explicit steps (lots of const_cast's) to avoid it. Am I missing anything? --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

1 0

Problem with Boost.Thread and HP aCC
by raulh39 29 May '02

29 May '02

We are trying to compile Boost.Thread with HP aCC (with -AA option). In boost/function/function_base.hpp the compiler give us this error: Error 20: "function_base.hpp", line 37 # '<type name>' expected before '>'. template<bool> struct truth {}; We are using Boost 1.28.0. The line 37 in function_base.hpp has: template<bool> struct truth {}; We have found two ways to make it work: 1.- Comment out the line !! 2.- Replace with: template<bool a> struct truth {}; We think that the compiler is wrong but, is ok to comment this line? In earlier versions of this file this line doesn't exists, and it is never used, so it is necesary? Regards, Raúl.

2 1

RE: [Boost-Users] Problem with Boost.Thread and HP aCC
by Tom Matelich 29 May '02

29 May '02

When I first started trying to support aCC with Boost that was a common issue. Most of them were ferreted out. I don't think anybody is actively looking at that compiler, perhaps Jens Maurer still is. Anyway, the proper solution is to name the template parameter, your option 2. I've cc'ed Bill Kempf in case he doesn't follow this list. Tom Matelich -----Original Message----- From: raulh39 [mailto:rhuertas@tcpsi.es] Sent: Wednesday, May 29, 2002 10:15 AM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] Problem with Boost.Thread and HP aCC We are trying to compile Boost.Thread with HP aCC (with -AA option). In boost/function/function_base.hpp the compiler give us this error: Error 20: "function_base.hpp", line 37 # '<type name>' expected before '>'. template<bool> struct truth {}; We are using Boost 1.28.0. The line 37 in function_base.hpp has: template<bool> struct truth {}; We have found two ways to make it work: 1.- Comment out the line !! 2.- Replace with: template<bool a> struct truth {}; We think that the compiler is wrong but, is ok to comment this line? In earlier versions of this file this line doesn't exists, and it is never used, so it is necesary? Regards, Raúl. 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/

1 0

VC7, threads, and threads starting other threads
by Bill Eidson 28 May '02

28 May '02

Hi all, I am using boost 1.28 and the threads library on windows with VC7.Net. I am creating threads in a threadgroup use function objects. Inside of these threads, I am creating other threads again using function objects. The problem is at run time the debug environment is informing me of a call type collision indicating the return address/stack is set up incorrectly. The debug message: "The value of ESP was not properly saved across afunction call. This is usually a result of calling a function declared with one calling convention with a function pointer declared with a different calling convention." this is in the declaration template<typename Functor> void assign_to(Functor f) { this->assign_to(f,tag()); } The error is at the end of the function First, is it legal in boost::thread to start one thread in another Second, If it is, what is going on with the function_template.hpp code here Thanks bille

1 0

problem with c_regex_traits.cpp
by René Gutschmidt 28 May '02

28 May '02

Hi, i have problems with the file c_regex_traits.cpp. I work under CodeWarrior 6/7 with a Macintosh. These problem ist with boost 1.25.1,1.26. template <class charT> unsigned int BOOST_REGEX_CALL re_get_message(charT* buf, unsigned int len, unsigned int id) { unsigned int size = _re_get_message((char*)0, 0, id); if(len < size) return size; boost::scoped_array<char> cb(new char[size]); _re_get_message(cb.get(), size, id); size = boost::c_regex_traits<wchar_t>::strwiden(buf, len, cb.get()); return size; } inline unsigned int BOOST_REGEX_CALL re_get_message(char* buf, unsigned int len, unsigned int id) { return _re_get_message(buf, len, id); } Is that a known problem? Do you know a workaround? (Renaming one of the 're_get_message()' functions does the job, but I'm not sure about the implications.) Regards, Rene

2 2

any_ptr
by cl_corba_at 27 May '02

27 May '02

Hi all! any_ptr was a typo in an older documentation, but this leads me to this question: any stores the type values in the template class holder, which is derived from placeholder to provide an uniform interface. This approach works fine for new classes where the data representation is done inside the any class, but for legacy code I would also like to have an any_ptr, which uses a holder that POINTS to a variable rather than containing it. With this I could extend existing classes with algorithms depending on any. Has any_ptr considered in the past and if yes, what have been the reasons to decide against it? Thanks in advance, CL

1 0

BGL, 6 degrees of Kevin Bacon and MSVC 6 compile error
by a_schweitzer 25 May '02

25 May '02

Hello, I am trying to build the "6 degrees of kevin bacon" example of the BGL in MSVC 6. When I do I get an "internal compile error". Does anyone know a fix/work-around? The compilation gets to this line (about #73): typedef adjacency_list < vecS, vecS, undirectedS, property<vertex_name_t,std::string >, property < edge_name_t,std::string > > Graph; Graph g; If Graph g is declared I get the following ugly error: d:\program files\microsoft visual studio\vc98\include\xmemory(59) : fatal error C1001: INTERNAL COMPILER ERROR (compiler file 'msc1.cpp', line 1794) Please choose the Technical Support command on the Visual C++ Help menu, or open the Technical Support help file for more information Note that if I change the std::string in vertex_name property to an int the compilation proceeds. Thanks for any help Andy Schweitzer

3 3

RE: [Boost-Users] boost::lexical_cast string to string problem - New proposition available
by Terje Slettebø 25 May '02

25 May '02

>--- In Boost-Users@y..., Tom Matelich <tmatelich@z...> wrote: > I and many others have requested fixes for this for a very long time. > Basically, it involves creating class templates to do the actual conversion. > It's not the most complicated system, just nobody has done it yet. If you > search the boost list archives, you'll see a lot of mail about this. There > is no quick solution to your problem though. I've searched the archive, now, and see that there's been quite a few propositions for changes, but apparently none of them have ended up in the lexical_cast implementation. There's also a couple of propositions, here (http://groups.yahoo.com/group/boost/files/lexical_cast_propositions/) Some of the proposed changes are: - wlexical_cast - A version that can use wide characters - basic_lexical_cast - A version that takes the interpreter (stringstream) as a parameter, to support things like changing locale - Being able to set number base (dec, oct or hex). This would be implicitly possible using basic_lexical_cast - Being able to set precision for numerical conversions. This may also be done with basic_lexical_cast - Checking for change of sign, when using unsigned numbers. This is addressed using an integer adapter, in the above lexical_cast_propositions One problem with doing these changes, after having talked with Kevlin Henney a while ago (without knowing it had been already proposed, I proposed an extra parameter, for setting the number base). is that he prefers to not have extra parameters in the interface, as it then will no longer look like a cast, and it may be less generic, depending on the way it's done. For example, a base-setting argument wouldn't make much sense if you converted from floating point to string. In any case, I have actually just now made a version of lexical_cast, that fixes the problem pointed out by OP, here, and I've made it available in the Boost files section (http://groups.yahoo.com/group/boost/files/lexical_cast_proposition/) I've also put a unit test for it, there. Feedback is welcome. It doesn't change the interface in any way, so it should be ok. The new version supports conversion between string and char, including char containing whitespace, and when the string is empty, or containing only whitespace. If the source or destination (or both) is basic_string or char/wchar_t, it will set the interpreter to use the char type used, so it implicitely supports wide characters. Wide character support requires partial specialisation if one of the operands is not either basic_string or char/wchar_t. In the case where the source is basic_string, it also uses pass by const reference, for efficiency. It's tested on Intel C++ 6.0, MSVC 6.0 and BCC 5.6. Regards, Terje

2 4

boost::shared_ptr and atomic_count_linux.hpp
by Jerry Napoli 24 May '02

24 May '02

Hi, I'm using boost version 1.27.0 on an x86 linux platform and have just upgraded my kernel to 2.4.18. After the upgrade, boost::shared_ptr fails to compile because functions such as "atomic_inc_and_test", "atomic_dec_and_test", etc.. which were previously defined in "atomic.h" are no longer defined there. I can get around the problem by using an older "atomic.h" or by using pthreads, but I was wondering why those functions were removed from the header. Any ideas? Thanks, Jerry jnapoli(a)iteamsolutions.com [Non-text portions of this message have been removed]

3 2