- 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