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

MPL::lambda issue: what am I doing wrong?
by Brian Simpson 11 Jul '03

11 Jul '03

I want to express a "type-mapping" scheme. My implementation idea is this: have the user define an MPL sequence comprised exclusively of std::pair derivations. He can then instantiate my template class with his sequence as the argument. My template then derives two MPL sequences, one containing the "first" types, the other containing the "second" types. Here is the attempt: <code> namespace ls { using namespace boost::mpl; using namespace placeholders; template <class TypePairSequence> struct list_splitter { template <class STDPAIR> struct first_type { typedef typename STDPAIR::first_type type; }; template <class STDPAIR> struct second_type { typedef typename STDPAIR::second_type type; }; typedef typename transform < TypePairSequence , first_type<_1> > ::type first_types; typedef typename transform < TypePairSequence , second_type<_1> >::type second_types; }; }//end namespace ls </code> Here is an attempt to instantiate: 1> typedef boost::mpl::list< std::pair<long, short>, std::pair<char, double> > associated_types; 2> typedef ls::list_splitter<associated_types> split_associated_types; 3> typedef split_associated_types::first_types first_types; 4> typedef split_associated_types::second_types second_types; 5> typedef boost::mpl::at_c<first_types, 0>::type first_first_t; Code lines 1-2 compile fine. When I add line 3, I get the following error: "no type named `first_type' in `struct boost::mpl::arg<1>'". If you need more: <error> temp.h: In instantiation of `ls::list_splitter<associated_types>::first_type<boost::mpl::arg<1> >': boost/mpl/transform.hpp:41: instantiated from `boost::mpl::apply1<ls::list_splitter<associated_types>::first_type<boost::m pl::arg<1> >, std::pair<char, double> >' boost/mpl/transform.hpp:41: instantiated from `boost::mpl::aux::transform_op<ls::list_splitter<associated_types>::first_ty pe<boost::mpl::arg<1> > >::apply<boost::mpl::null_node, std::pair<char, double> >' boost/mpl/aux_/preprocessed/gcc/fold_backward_impl.hpp:74: instantiated from `boost::mpl::aux::fold_backward_impl<2, boost::mpl::list_iterator<boost::mpl::list2<std::pair<long int, short int>, std::pair<char, double> > >, boost::mpl::list_iterator<boost::mpl::null_node>, boost::mpl::null_node, boost::mpl::protect<boost::mpl::aux::transform_op<ls::list_splitter<associat ed_types>::first_type<boost::mpl::arg<1> > > >, boost::mpl::arg<1> >' boost/mpl/fold_backward.hpp:45: instantiated from `boost::mpl::fold_backward<associated_types, boost::mpl::null_node, boost::mpl::protect<boost::mpl::aux::transform_op<ls::list_splitter<associat ed_types>::first_type<boost::mpl::arg<1> > > >, boost::mpl::arg<1> >' boost/mpl/transform.hpp:64: instantiated from `boost::mpl::algo_::transform<associated_types, ls::list_splitter<associated_types>::first_type<boost::mpl::arg<1> > >' temp.h:35: instantiated from `ls::list_splitter<associated_types>' temp.h:53: instantiated from here temp.h:19: no type named `first_type' in `struct boost::mpl::arg<1>' </error> I'm sure I'm overlooking something simple. Could someone point me in the right direction? I'm using gcc3.2.2 on Solaris 9. TIA, Brian

2 4

Defining tuples and variants based on mpl::sequences
by Brian Simpson 11 Jul '03

11 Jul '03

Here is the problem: A tuple or variant needs to be defined, whose types are derived from an mpl::list (or other model of MPL Sequence). How is it to be done? I have considered that I might be able to define the tuple/variant with the types and then generate the sequence from there, but that still leaves me wondering how to define another tuple/variant with a sub- or super-set of the types in the generated sequence. Consider that I am supplied with a sequence of types, and that I want to define either 1)a tuple of pointers to them, or 2)a variant based on those types as well as pointers to them. I have considered that it would be a good thing to provide sequence-based tuples/variants and still provide the current variadic template (<--is that the correct term?) versions--which could be implemented in terms of the sequence-based ones (in my uneducated opinion). But I wonder if there is another solution already available which I have not considered. TIA for your consideration, Brian

1 0

Boost.Python interface to Boost Graph Library (BGL)
by BP 11 Jul '03

11 Jul '03

I would like to use the Boost Graph Library (BGL), but I'm not much of a C++ programmer. I'd feel much more comfortable working in Python. Can I download the Boost Graph Library wrapped in Boost.Python? I'd rather not wrap myself if it already exists. Thanks. - BP __________________________________ Do you Yahoo!? SBC Yahoo! DSL - Now only $29.95 per month! http://sbc.yahoo.com

3 2

templated 'handle' in pimpl code? (Slightly off topic)
by Kevin Wheatley 11 Jul '03

11 Jul '03

Hi, I wondered if there are any examples of a templated handle class within the boost code base I could look at? I'm trying to hide both the implementation of the body class and that of the template type, something like that below but my compiler is complaining about partial specialization in the declaration of the implementation class in handle.cpp I know its not strictly boost related, but I don't get any of the comp.lang.* groups. Also before anybody suggests I should be using a smart pointer for the impl variable I'd like to avoid having to introduce the boost library to the user of the two .h files. My goal was that the users would only need the *.h files and I could provide fred.o fred2.o fred3.o etc. as new options for "fred" come along. I know that using the template doesn't appear to be getting me anywhere towads my original goal (generally needing the implementation to get the templated code to work!) but I'd like to see if I could at least get the code to compile by studying anything similar as it may have some use in other areas. Thanks Kevin // -------------- fred.h class fred { public: void somefunction(); }; // -------------- handle.h template <typename T> class handle { public: handle(); ~handle(); void callsomefunctionviaimpl(); private: template <typename U> class handleimpl; handleimpl<T> *impl; }; // -------------- fred.cpp #include <iostream> using namespace std; #include "fred.h" void fred::somefunction() { cout << "fred::somefunction()" << endl; } // -------------- handle.cpp #include <iostream> using namespace std; #include "handle.h" template <class T, class U> class handle<T>::handleimpl<U> { public: void implfunctiononfred() { myfred.somefunction(); } private: static T myfred; }; template <class T> handle<T>::handle() : impl(new handle<T>::handleimpl<T>) { } template <class T> handle<T>::~handle() { delete impl; } template <class T> void handle<T>::callsomefunctionviaimpl() { cout << "handle calling" << endl; impl->implfunctiononfred(); } // ----------- Main code ---------------- #include "fred.h" #include "handle.h" int main(int argc, char** argv) { handle<fred> foo; foo.callsomefunctionviaimpl(); return 0; } -- | Kevin Wheatley | These are the opinions of | | Senior Do-er of Technical Things | nobody and are not shared | | Cinesite (Europe) Ltd | by my employers |

1 1

multi-array versus valarray
by lformaggia 11 Jul '03

11 Jul '03

Hi, I am a new user of boost and I am interest in the multi-array library. However it is not clear to me which are the advantages versus the std::valarray and std::slice classes. There are quite a few numeric functions provided by C++ that work on valarrays (the pow() for example), is there any equivalent for multi-arrays )it would be very nice to have a norm() function at least for two-dimensional arrays!) or you have to write your own. Sorry if this question may seem trivial, yet I have to choose which basic multiarray classes to implemet for my code (it is numerical code based on the finite element method) and so far my choice is between multi-array or valarray + slice. Maybe somebody of you have some experience on this matter and my help in taking an appropriate decision. Thank you Luca

1 0

Having problems with boost::signal and boost::function
by subsample 11 Jul '03

11 Jul '03

I'm having a problem (which was really hard to decipher) when connecting a function object to a signal. Thing is I default construct (no argument) a function object and connect it to the signal (using boost::ref), then at a later point in time I actually assign something to the function object (using boost::bind). But firing the signal after this causes a bad_function_call to be thrown. On the other hand; if I construct the function object with some dummy object before connecting it to the signal, and later do the assignment, the signal does its thing. If someone could enlighten me as to whats going on here, I'd be grateful .. : )

2 1

Signals library safety
by Eugene Talagrand 11 Jul '03

11 Jul '03

Hello to all, I'm looking into using the Boost.Signals. The library claims not to be thread safe. What does this mean exactly? When using Boost.Threads, can I make concurrent calls to connect as long as I wrap each call in a Mutex? If this is possible, do tackable objects also still work (if two trackable objects get destroyed in two different threads there might be a problem from what I understand) On an different note, I am trying to use Boost.Signals for network event handling. I'd like to set it up so that it uses something similar to he JavaScript event model, where every slot returns a boolean value. If that value is false, the remaining slots are not called. Would anyone have any recommendations on how to do this? Should I wrap each slot in a function that takes the return value and sets a global flag, then every subsequent slot checks the flag? It looks like combiners would not be appropriate, as it appears they are used after each slot is called (unless the InputIterator' opeator* actually calls the slot??) Thanks for any help -Eugene

2 1

stream operators and random number generators
by Witz 10 Jul '03

10 Jul '03

hi, in my code i need to be able to save the state of my program including that of he random number generators but under MSVC 7.1.3088 the following code: int main() { boost::mt19937 rng; std::cout << rng; return 0; } won't compile and gives the error: "error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'boost::mt19937' (or there is no acceptable conversion)" there a workaround for this (beyond my hacky solution of adding load and save functions to the mersenne_twister class)? thanks in advance, ian whittley

1 0

BOOST_MPL_DEPENDENT_TEMPLATE_TYPEDEF
by Joaquín Mª López Muñoz 10 Jul '03

10 Jul '03

I've read on some archived post in the boost mailing list about BOOST_MPL_DEPENDENT_TEMPLATE_TYPEDEF, but seems like it is not in the 1.30 distribution anymore. Anyone knows what happened to it? I'm in need of this sort or workaround. Aleksey, are you there? :) Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

deadlock in filesystem?
by Ken Alverson 10 Jul '03

10 Jul '03

I'm running into an odd deadlock situation, and I was wondering if it's a known issue, or if there's likely something wrong with my code, or if I've misconfigured something? First off, a stack trace: ntdll.dll!77f5b7f4() kernel32.dll!77e61bf5() scanner.exe!boost::detail::sp_counted_base::release() Line 132 + 0xf C++ scanner.exe!boost::detail::shared_count::~shared_count() Line 380 C++ scanner.exe!boost::shared_ptr<boost::filesystem::directory_iterator::dir_itr_i mp>::~shared_ptr<boost::filesystem::directory_iterator::dir_itr_imp>() + 0x2e C++ scanner.exe!boost::shared_ptr<boost::filesystem::directory_iterator::dir_itr_i mp>::reset() Line 217 C++ scanner.exe!boost::filesystem::directory_iterator::m_inc() Line 256 C++ scanner.exe!boost::filesystem::directory_iterator::operator++() Line 88 + 0x2b C++ scanner.exe!std::for_each(boost::filesystem::directory_iterator _First={...}, boost::filesystem::directory_iterator _Last={...}, scan_file _Func={...}) Line 20 + 0xa C++ I'm using boost 1.30.0 running a staticly linked debug build of the filesystem lib, on vc7. The for_each is actually the most recursed level of a recursive directory search - I'm pretty sure that code is fine; I'm very familiar with STL iteration and I'm not doing anything strange, just: std::for_each( fs::directory_iterator(dir), fs::directory_iterator(), scan_files(fileset)); where scan_files will recurse on directories and process on files. I don't touch the iterators directly other than to pass them to for_each. Now, the strange part is this program works completely fine when I simply run it from the command line. However, I am building it into a windows service, and when it runs as a service under the SYSTEM account (I haven't tried running it as a service under a different account, yet), I get deadlock. I suspected the problem might be related to funny permissions on the directory in question, but SYSTEM has full rights to the directory, so that shouldn't be the problem. Oddly, when I use the release filesystem lib it deadlocks in a different location in the search, but in the same sp_counted_base::release() function - this time in an attempt to unwind after a filesystem exception. I tried to search the mailing list for similar problems, but the search seems to be broken at the moment. I'm hoping this is an easy fix, known issue, because I'm at a loss as to how I could be causing it, especially since I'm not getting anywhere near the internals of the directory iterators. I am a fairly new user to boost, but up until now I've had no problems. Sorry if this is a jumble...I've been banging my head against this for the past few hours and my coffee is wearing off. Ken

3 11

newbie build problems with msvc-stlport toolset
by uncle_buck_598 10 Jul '03

10 Jul '03

I am attempting to build the complete boost library set with the command line: bjam -sTOOLS=msvc-stlport "-BUILD=debug release <stlport-iostream>on" Unfortunately, 5 of the release DLLs fail to link with the following error: unresolved external symbol "public: static void __cdecl _STL::_STLP_mutex_spin<0>::_M_do_lock(long volatible *)" ("_M_do_lock@?$_S_STLP_mutex_spin@$0A@@_STL@@SAXPCJ@Z) What is confusing is that the debug DLLs all build with out a hitch! I am using MSVC 6.0 SP5, STLport-4.5.3, and Windows Platform SDK - Nov2002. Any help would be greatly appreciated!! --Jamie

1 0

configuring MSVC 7.1 to use boost build
by Dave Gomboc 10 Jul '03

10 Jul '03

I'm trying to use boost::signals and boost::regex with MSVC 7.1 I retrieved the current CVS state with WinCVS, downloaded a binary of bjam (3.1.4), used the Visual Studio .NET 2003 Command Prompt, invoked bjam with the argument "-sTOOLS=vc7.1", and have added the boost path to Tools|Options|Projects|VC++ Directories (Include Files). When I compile programs I get link errors, e.g. signals_test.obj : error LNK2019: unresolved external symbol "public: void __thiscall boost::signals::connection::disconnect(void)const " (?disconnect@connection@signals@boost@@QBEXXZ) referenced in function "public: __thiscall boost::signals::connection::~connection(void)" (??1connection@signals@boost@@QAE@XZ) signals_test.obj : error LNK2019: unresolved external symbol "public: __thiscall boost::signals::detail::signal_base::~signal_base(void)" (??1signal_base@detail@signals@boost@@QAE@XZ) referenced in function "public: __thiscall boost::signal0<void,struct boost::last_value<void>,int,struct std::less<int>,class boost::function0<void,class std::allocator<class boost::function_base> > >::~signal0<void,struct boost::last_value<void>,int,struct std::less<int>,class boost::function0<void,class std::allocator<class boost::function_base> > >(void)"(??1?$signal0@XU?$last_value@X@boost@@HU?$less@H@std@@V?$functio n0@XV?$allocator@Vfunction_base@boost@@@std@@@2@@boost@@QAE@XZ) I have tried to add library paths in the IDE in a similar fashion to how I added the include path, but I had no success when building a test project. What do I need to do to successfully link? Thanks, Dave P.S. It might be a good idea to add the "vc7.1" target to http://www.boost.org/tools/build/index.html#Configuring.

2 1

Re: CRC problem with 8 bit truncated polynomial
by Daryle Walker 10 Jul '03

10 Jul '03

On Wednesday, July 9, 2003, at 11:02 AM, Victoria Ames wrote: [SNIP] > However, when I have tried examples using 8 bit truncated > polynomials I fail to get a meaningful checksum. > > Example that doesn't work : > std::cout << "Expected CRC-8 : EA" << std::endl; > boost::crc_optimal<8, 0x9B, 0, 0, false, false> crc_8; > crc_8 = std::for_each( data, data + data_len, crc_8 ); > std::cout << "Optimal CRC-8 : " << std::hex << crc_8() << std::endl; > > The results I get are : [SNIP] > Expected CRC-8 : EA > Optimal CRC-8 : Û > > Does anyone know why the 8 bit example does not seem to work? I can't tell at this point. The problem could be that the results of the "crc_8" object is an "unsigned char". The built-in character types can take the same numeric operations as the bigger built-in integral types (i.e. "int"). However, the character types differ from the other integral types since the character types act as C++ text system types. So when an object of a built-in character type is printed, its text value is printed instead of its numeric value. The solution is to convert the result to a numeric-only integral type. Try std::cout << std::hex << static_cast<unsigned>( crc_8() ) << std::endl; to check the numeric value of the result. Then you can tell if the result is correct. If it's not, send us another message. With my hypothesis, the problem is only in the printing. You would have no problem in using the result for further mathematical analyses. Daryle

1 0

RE: [Boost-Users] RE: Re: CRC problem with 8 bit truncated polyno mial
by Jim.Hyslop 09 Jul '03

09 Jul '03

Vladimir Prus wrote: > Sorry, I don't understand what you're saying... > > std::cout << "Optimal CRC-8 : " << std::hex << (unsigned)crc_8() > << std::endl; > > is the same as > > std::cout << "Optimal CRC-8 : " << std::hex << (unsigned int)crc_8() > << std::endl; Sorry, I wasn't very clear in my last message. The results can be unexpected, depending on whether the result of crc_8() (or more precisely, operator() ) is signed or unsigned. If operator() returns an unsigned value, there will be no problems, and the output will be ea. On the other hand, if operator() returns a signed value, then it will first be promoted to a signed int, then converted to an unsigned int. Using the original example values posted by Victoria, the output would be ffffffea. In this scenario, the return value must be first cast to an unsigned char, then to an unsigned int: ... << static_cast<unsigned>( static_cast<unsigned char>( crc_8() ) ) I just had a quick look at the crc.hpp file, and operator() returns an unsigned value, thus banishing my caveat to the dusty corners where all academic footnotes end up ;-) -- Jim

2 1

RE: [Boost-Users] Re: CRC problem with 8 bit truncated polynomial
by Jim.Hyslop 09 Jul '03

09 Jul '03

Vladimir Prus wrote: > I'm guessing this should be > > std::cout << "Optimal CRC-8 : " << std::hex << (unsigned)crc_8() > << std::endl; > > The way iostreams format chars is most likely not what you wanted. True enough - and that includes signed vs. unsigned chars (both are handled the same, at least with my compiler). The result needs to be put into an unsigned *int* for cout to display the numeric value. -- Jim

3 2

RE: [Boost-Users] CRC problem with 8 bit truncated polynomial
by Jim.Hyslop 09 Jul '03

09 Jul '03

victoriaames wrote: > Example that doesn't work : > std::cout << "Expected CRC-8 : EA" << std::endl; > boost::crc_optimal<8, 0x9B, 0, 0, false, false> crc_8; > crc_8 = std::for_each( data, data + data_len, crc_8 ); > std::cout << "Optimal CRC-8 : " << std::hex << crc_8() << std::endl; > > The results I get are : > > Expected CRC-CCITT : 29B1 > Optimal CRC-CCITT : 29b1 > > Expected CRC-8 : EA > Optimal CRC-8 : Û > > Does anyone know why the 8 bit example does not seem to work? I haven't used this library, but judging from the output it looks to me like it's working just fine. The result is an 8-bit value, i.e. a (possibly unsigned) char, with the value 0xEA. Think about what cout does with 'char'. -- Jim

1 0

CRC problem with 8 bit truncated polynomial
by victoriaames 09 Jul '03

09 Jul '03

When I have tried examples using 16 or 32 bit truncated polynomials this library works perfectly. Example that works : unsigned char const data[] = { 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39 }; std::size_t const data_len = sizeof( data ) / sizeof( data[0] ); std::cout << "Expected CRC-CCITT : 29B1" << std::endl; // Simulate CRC-CCITT with the optimal version boost::crc_optimal<16, 0x1021, 0xFFFF, 0, false, false> crc_ccitt2; crc_ccitt2 = std::for_each( data, data + data_len, crc_ccitt2 ); std::cout << "Optimal CRC-CCITT : " << std::hex << crc_ccitt2() << std::endl; However, when I have tried examples using 8 bit truncated polynomials I fail to get a meaningful checksum. Example that doesn't work : std::cout << "Expected CRC-8 : EA" << std::endl; boost::crc_optimal<8, 0x9B, 0, 0, false, false> crc_8; crc_8 = std::for_each( data, data + data_len, crc_8 ); std::cout << "Optimal CRC-8 : " << std::hex << crc_8() << std::endl; The results I get are : Expected CRC-CCITT : 29B1 Optimal CRC-CCITT : 29b1 Expected CRC-8 : EA Optimal CRC-8 : Û Does anyone know why the 8 bit example does not seem to work? Victoria

2 1

[help] thread on intel solaris 8
by meg_r123 09 Jul '03

09 Jul '03

Hi all, I've succesfully compiled the boost library 1.30.0, and the tests for the libthread runs fine, but I get an "abort" when I try to execute a simple test written by me. I suppose it is a link problem, this is the command in the Makefile: (I'm using GCC) CC = g++ OBJS = test_thread.o TARGET = test_thread $(TARGET): $(OBJS) $(CC) -o $(TARGET) $(OBJS) -L$(HOME)/local/lib/ -lboost_thread Any idea to suggest me? Thank you, meg

3 4

[boost::date_time] posix_time::to_simple_string and posix_time::time_from_string
by Russell Hind 08 Jul '03

08 Jul '03

These 2 functions don't seem to work together. to_simple_string will produce a string such as 2003-Jul-08 11:55:47 But time_from_string expects 2003-07-08 11:55:47 This means you can't convert to a string (to store in a text file) then read back in and convert it back to a ptime. Is this a bug, or have I missed a conversion function that can handle this? Thanks Russell

2 3

Const strangeness and indirect_iterator generators.
by Tim Robertson 08 Jul '03

08 Jul '03

Hi, I've been trying to get indirect_iterator working in what seems (to me) to be a straightforward context -- I have a std::vector of boost::shared_ptr objects, and I need both const and non-const iterators into the vector (I'm using the vector as the sole data member of a container class, and I need the iterators to properly handle const and non-const container types). This looks something like this: class MyClass { // ... }; class MyContainer { public: typedef MyClass value_type; typedef value_type & reference; typedef value_type * pointer; // and so on, for const_reference, const_pointer, etc... // ... private: std::vector<boost::shared_ptr<MyClass> > _data; }; Now, the trouble comes when I attempt to define the iterators for MyContainer using the indirect_iterator generators. If I do the obvious: Approach #1: ------------ typedef indirect_iterator_pair_generator< vector<shared_ptr<MyClass> >::iterator, value_type, reference, const_reference, std::random_access_iterator_tag, pointer, const_pointer>::itgen; typedef typename itgen::iterator my_iterator; typedef typename itgen::const_iterator my_const_iterator; I find that the const_iterator generated is inadequate for use in a container context. Particularly, it produces a my_const_iterator that has the following constructor signature: my_const_iterator(shared_ptr<MyClass> *) Whereas, a const std::vector<shared_ptr<MyClass> > will produce const_iterators that look like this: const shared_ptr<MyClass> * const This causes compilation problems, because inevitably, in this context, you'll want to construct a my_const_iterator from a vector::const_iterator. The problem seems obvious: the indirect_iterator_pair_generator class is considering only non-const base iterators. This led me to try the following: Approach #2: ----------- typedef typename indirect_iterator_generator <typename vector<shared_ptr<MyClass> >::iterator, value_type, reference, pointer, std::random_access_iterator_tag>::type my_iterator; typedef typename indirect_iterator_generator <typename vector<shared_ptr<MyClass> >::const_iterator, value_type, const_reference, const_pointer, std::random_access_iterator_tag>::type my_const_iterator; It seemed that this would solve the problem by independently generating the two types of iterators that are needed (note how I've made the base iterator type ::iterator in one, and ::const_iterator in the other). However, with this method I always obtain compilation errors -- whereever there is a use of the operator->(), the following error is produced (g++ 3.0.3 and 3.2 do the same thing, Linux and Mac OSX): "result of `operator->()' yields non-pointer result" I have yet to figure out what is causing this error. This led me to attempt the following "solution" to the problem: Approach #3: ----------- typedef indirect_iterator_pair_generator <typename vector<shared_ptr<MyClass> >::iterator, value_type,reference,const_reference, std::random_access_iterator_tag, pointer,const_pointer> itgen; typedef typename itgen::iterator my_iterator; typedef indirect_iterator_pair_generator <typename vector<shared_ptr<MyClass> >::const_iterator, value_type,reference,const_reference, std::random_access_iterator_tag, pointer,const_pointer> itgen2; typedef typename itgen2::const_iterator my_const_iterator; This actually works! I can't explain why -- it seems like indirect_iterator_pair_generator and indirect_iterator_generator should behave identically when their template parameters are identical.... The way I see it, there's a bug in at least one of the indirect_iterator generator objects. At the very least, indirect_iterator_pair_generator and indirect_iterator_generator are behaving differently when their parameter types are the same (compare approaches #2 and #3). But there's also the issue of why approach #1 didn't work to begin with -- it *seems* like indirect_iterator_pair_generator should produce a const_iterator type that can be initialized with an iterator from a const vector. This isn't the case. If anyone can explain this to me, and convince me that I'm not going insane, I'd appreciate it greatly ;-) (Standard bug-report disclaimers: Current boost distribution, g++ 3.0.x/3.2.x, both Mac OSX and Linux exhibit identical behaviour.) -Tim

2 1

Ublas >> operators
by Amit Bhatia 08 Jul '03

08 Jul '03

Hello All, I was looking for sowe way to write the matrix to some filestream and read the same way from some file stream. Was just wondering if Ublas has any operators as << and >> defined default? I have been able to find none though. thanks, regards, amit.

2 1

Re: Using BOOST_REQUIRE outside the Test framework?
by Gennadiy E. Rozental 08 Jul '03

08 Jul '03

> Is there some macro/facility/whatever which behaves like assert(): > a) works without the Boost Test Framework > b) *AND* integrates into the BTF in those cases where the BTF is used? > > Regards, > > Joaquín M López Muñoz > Telefónica, Investigación y Desarrollo Jonh Torio developing SMART_ASSERT facility that supposed to satisfy your requirements. Look into main list archive. Gennadiy.

1 0

boost_1_30_0: cannot compile red hat gcc
by sebMarc 07 Jul '03

07 Jul '03

I must be freakin stupid. I have the simplest config possible, gcc 2.96 with a red hat system. Downloaded boot1_30_0, unzipped it, tried to compile thread and got: bash-2.05a$ bjam "-sTOOLS=gcc" ...found 341 targets... ...updating 37 targets... MkDir1 ../../../libs/thread/build/bin-stage : command not found MkDir1 ../../../libs/thread/build/bin : command not found mkdir: cannot create directory `\r': File exists mkdir ../../../libs/thread/build/bin ...failed MkDir1 ../../../libs/thread/build/bin... Being jam ignorant, this is it, i am stuck :-(. Sigh.. Tried to run configure and got: bash-2.05a$ chmod +x configure bash-2.05a$ ./configure : bad interpreter: No such file or directory Seb.

3 3

Memory leaks in Solaris
by Lev Assinovsky 07 Jul '03

07 Jul '03

Hi All! I caught a memory leak (24 bytes) when using recursive_mutex class. This class initializes a pthread_mutexattr attribute but never destroys it thus leaving the leak. We use tons of the recursive mutexes in our huge app and that leak leads to significant memory loss. Regards, Lev Assinovsky Aelita Software Corporation O&S Core Division, Programmer ICQ# 165072909

1 0

Using BOOST_REQUIRE outside the Test framework?
by Joaquín Mª López Muñoz 07 Jul '03

07 Jul '03

I'm deploying a library which implements some basic invariant checking when a certain control macro is defined. class A { void foo1(){VERIFY(*invariant conditions *); ...} ... void foon(){VERIFY(*invariant conditions *); ...} }; I use the word VERIFY for reference purposes only. Now, VERIFY is resolved to a call to assert(), which is sensible enough as: * Invariant errors are critical * Invariant checking is only enabled explictly by the user, presumably under testing conditions. On a second thought, it'd be nice if VERIFY could be seamlessly integrated into the Boost Test Framework, i.e. invariant errors are caught by the test execution monitor as other errors defined by BOOST_CHECK, BOOST_REQUIRE etc. Unfortunately, replacing VERIFY with say BOOST_REQUIRE forces the user to link with the Boost Test Framewok object modules. So my question is: Is there some macro/facility/whatever which behaves like assert(): a) works without the Boost Test Framework b) *AND* integrates into the BTF in those cases where the BTF is used? Regards, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

multi_array performance
by Marco Segurini 07 Jul '03

07 Jul '03

Hi, I am very new in using Boost library. I start replacing row memory array with 'multi_array' class template but the performace slow down a lot. Running this test program... //begin------------------ #include "windows.h" #include <iostream> #include "boost\multi_array.hpp" using namespace std; using namespace boost; int main() { const size_t DimX = 2000; const size_t DimY = 1500; const size_t DimZ = 1; multi_array<int,3> V3(extents[DimZ][DimY][DimX]); int iVal; unsigned long time1 = GetTickCount(); for (size_t Z=0; Z<DimZ; ++Z) for (size_t Y=0; Y<DimY; ++Y) for (size_t X=0; X<DimX; ++X) iVal = V3[Z][Y][X]; unsigned long time2 = GetTickCount(); cout << "Multi_array: " << time2-time1 << endl; int * pInt = V3.data(); time1 = GetTickCount(); for (size_t Z=0; Z<DimZ; ++Z) for (size_t Y=0; Y<DimY; ++Y) for (size_t X=0; X<DimX; ++X) iVal = pInt[(Z*DimY+Y)*DimX+X]; time2 = GetTickCount(); cout << "Pointer....: " << time2-time1 << endl; return 0; } //end------------------ ... the output (using vc++ in release mode with no optimization) is Multi_array: 1663 Pointer....:70 So, where am I wrong? Thanks. Marco.

6 6

[BGL] dijkstra_shortest_paths and the single-pair problem
by Richard Jepps 04 Jul '03

04 Jul '03

I would like to use the dijkstra_shortest_paths algorithm to find the shortest path from one specified vertex to another. The standard Boost implementation will find this, but it will continue until it has found the shortest paths to all nodes in the graph (i.e. solved the single source problem). The BGL book (Section 5.1, pp76) says: "It turns out that there are no algorithms for solving the single-pair problem that are asymptotically faster than the algorithms that solve the single-source problem". I think this is because the single-source algorithms all have the property that it is possible to determine whether the shortest path to any given node has been found during the execution of the algorithm, therefore you can use the same algorithm to solve both types of problem provided that the termination criterion is appropriate to the problem. Consider this problem: "find the shortest path from a source vertex u to a nearby destination vertex v in an infinitely large directed weighted graph G in finite time." The single-source problem can only be solved in infinite time, but the single-pair problem can be solved relatively quickly (because the two vertices are near each other). I think that the termination criterion is quite straightforward using a DijkstraVisitor - it is when vis.finish_vertex(u, g) is called and u == destination_node. Unfortunately I can't see how to stop the algorithm in a reasonable way. An unreasonable solution is to provide a custom graph and turn off all its edges when the termination criterion is met. This is unreasonable because the responsibility for termination belongs to the algorithm, not the data structure - I shouldn't have to modify the data structure to terminate the algorithm. It's also unreasonable because I have to customise both the graph and the algorithm to do something very simple. Is there a better way? Thanks Richard

3 5

function object with lambda
by Matt Hurd 04 Jul '03

04 Jul '03

Not sure how to force a for_each with a lambda to invoke the random function object successively. In the for_each version below get_long is called just once. Not sure how to use var, std_function, bind or something else to overcome this. I'm sure the answer is straight forward... anyone? Regards, Matt. #include <iostream> #include <boost/random.hpp> #include <vector> #include <boost/lambda/lambda.hpp> #include <boost/lambda/bind.hpp> typedef boost::mt19937 base_generator_type; base_generator_type generator( 100123u ); boost::uniform_int<base_generator_type,long> gen_long(generator,-100,100); using namespace std; using namespace boost::lambda; int main(int argc, char *argv[]) { vector<long> v(10); for_each(v.begin(),v.end(), _1 = gen_long() ); for_each(v.begin(), v.end(), cout << _1 << ' '); cout << "\n"; for( vector<>::iterator i = v.begin(); i != v.end(); ++i ) { *i = gen_long(); } for_each(v.begin(), v.end(), cout << _1 << ' '); cout << "\n"; system("PAUSE"); return 0; }

2 4

Re: [Boost-Users] [BGL] dijkstra_shortest_paths and the single-pair problem
by JOAQUIN LOPEZ MU?Z 03 Jul '03

03 Jul '03

Throw an exception? Joaquín M López Muñoz Telefónica, Investigación y Desarrollo ----- Mensaje Original ----- De: Richard Jepps <yg-boost-users(a)m.gmane.org> Fecha: Martes, Julio 1, 2003 3:00 pm Asunto: [Boost-Users] [BGL] dijkstra_shortest_paths and the single-pair problem > I would like to use the dijkstra_shortest_paths algorithm to find the > shortest path from one specified vertex to another. > > The standard Boost implementation will find this, but it will > continue until > it has found the shortest paths to all nodes in the graph (i.e. > solved the > single source problem). > > The BGL book (Section 5.1, pp76) says: "It turns out that there > are no > algorithms for solving the single-pair problem that are asymptotically > faster than the algorithms that solve the single-source problem". > I think this is because the single-source algorithms all have the > propertythat it is possible to determine whether the shortest path > to any given node > has been found during the execution of the algorithm, therefore > you can use > the same algorithm to solve both types of problem provided that the > termination criterion is appropriate to the problem. > > Consider this problem: "find the shortest path from a source > vertex u to a > nearby destination vertex v in an infinitely large directed > weighted graph G > in finite time." > The single-source problem can only be solved in infinite time, but the > single-pair problem can be solved relatively quickly (because the two > vertices are near each other). > > I think that the termination criterion is quite straightforward > using a > DijkstraVisitor - it is when vis.finish_vertex(u, g) is called and > u == > destination_node. Unfortunately I can't see how to stop the > algorithm in a > reasonable way. > > An unreasonable solution is to provide a custom graph and turn off > all its > edges when the termination criterion is met. > This is unreasonable because the responsibility for termination > belongs to > the algorithm, not the data structure - I shouldn't have to modify > the data > structure to terminate the algorithm. > It's also unreasonable because I have to customise both the graph > and the > algorithm to do something very simple. > > Is there a better way? > > Thanks > > Richard > > > > > > > > ------------------------ Yahoo! Groups Sponsor -------------------- > -~--> > Get A Free Psychic Reading! Your Online Answer To Life's Important > Questions.http://us.click.yahoo.com/Lj3uPC/Me7FAA/ySSFAA/EbFolB/TM > ------------------------------------------------------------------- > --~-> > > Info: <" target="l">http://www.boost.org> > Wiki: <" target="l">http://www.crystalclearsoftware.com/cgi- > bin/boost_wiki/wiki.pl>Unsubscribe: <')" >mailto:boost-users- > unsubscribe(a)yahoogroups.com> > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > >

5 5

boost::numeric::ublas::map_array support for the complete std::map interface?
by Markus Werle 03 Jul '03

03 Jul '03

Hi! While trying to test boost::numeric::ublas::map_array as replacement for a std::map in my own code, I found that some memfuns like lower_bound and key_comp are missing. I also found that these can be added quite easily, since e.g. lower_bound exists as external function and only needs to be called in an appropriate way. Though the functions mentioned may not be useful in ublas apps, they would help improve the reusability of map_array. Before I start stalking through the code: Are there any plans to add these features already? Or is there somebody who knows the ublas code better than me and can help me avoid breaking existsing code? best regards, Markus -- Build your own Expression Template Library with Daixtrose! Visit http://daixtrose.sourceforge.net/

2 1

RE: [Boost-Users] Re: [BGL] dijkstra_shortest_paths and the singl e-pair problem
by Jim.Hyslop 03 Jul '03

03 Jul '03

Mark Sizer wrote: > Eeek! Exceptions as flow control are, well, not exceptions. > > I have no solution to offer (I don't even fully understand the > question), but I hope someone has a better answer. At this time, the only solution is to throw an exception. This whole issue was discussed in September, including the morality of using exceptions for flow control. Please see the thread entitled "[BGL] Best way to abort an algorithm from within a visitor?": http://groups.yahoo.com/group/Boost-Users/message/1819 -- Jim

2 1

regular expression control
by Enrico 03 Jul '03

03 Jul '03

Hi all, I'm using regex with a list of regular expressions written by my team. They start from a set of rules and write down the expression (s). What I'm requested to do now is a function that given a regular expression write down all the combinations available, with some limitations of course: if for example an expression has an infinity of combination this could not be achieved. Since all the expression have a limited number of combinations in this case a warning will suffice. I searched for such a function in the regex code but didn't find it. Any idea? Thanks, Enrico

1 0

Boost.Thread and fork
by Pavol Droba 02 Jul '03

02 Jul '03

Hi, I have problem with boost.threads on linux ( under gcc ). I have a multithreaded aplication using Boost.Thread. It works just fine. However, I want to make a daemon out of it. So I tried to fork() at the start of the program and run all the relevant code ( including all threading ) in the child process. But when I do so, first call to create_thread hangs the process. I'm quite new to linux threading, so it is possible, that the problem is not related to Boost.Threads. Any hints? Thanks in advance. Pavol

4 4

another newbie question on bjam
by Karsten Weinert 01 Jul '03

01 Jul '03

Hi, still trying to set up bjam, I am stumbling on the following problem: I want to use jamfile.jam instead of jamfile (because my editor uses extensions to define actions on files). But when I run bjam on it, with bjam -f jamfile.jam -sTOOLS=mingw it complains about an unknown rule exe. What can I do? Here is the jamfile.jam: exe hello : hello.cpp : <include>c:$(SLASH)dev-cpp$(SLASH)include$(SLASH)c++ <include>c:$(SLASH)dev-cpp$(SLASH)include$(SLASH)c++$(SLASH)mingw32 <include>c:$(SLASH)dev-cpp$(SLASH)include$(SLASH)c++$(SLASH)backward ; Furthermore, can you please advise me how to simplify this jamfile? In my opinion, the include-statements belong to mingw-tools.jam, but how can I specify several include directories there? Any comments appreciated, Karsten

2 1

newbie bjam question
by Karsten Weinert 30 Jun '03

30 Jun '03

Hi, there are two questions about bjam I tried to answer, but failed: * which files are read by bjam in which order * where can I declare the standard include path I am using mingw on win98. Would be nice if someone could help me here, Karsten Weinert

2 1

BGL problem with filtered_graph and adjacency_matrix
by Matthias Rupp 30 Jun '03

30 Jun '03

Hi, i'm new to boost and encountered the following problem with the boost graph library and this code: #include "boost/graph/adjacency_list.hpp" #include "boost/graph/adjacency_matrix.hpp" #include "boost/graph/filtered_graph.hpp" int main (void) { using namespace boost; typedef adjacency_matrix<undirectedS> Graph; //typedef adjacency_list<vecS, vecS, undirectedS> Graph; typedef filtered_graph<Graph, keep_all> FilteredGraph; Graph g (5); FilteredGraph fg (g, keep_all ()); } This results in a lot of error messages from the compiler (see end of email), all located in the bgl files. If i use adjacency_list (as in the commented line above) instead of adjacency_matrix, everything's fine. I use gcc 3.3 under linux and version 1.30 of the boost library. Is this a bug? Is there an easy way to make filtered_graph work with adjacency_matrix? (I'd like to use adjacency_matrix because my graphs are almost complete graphs). Best regards, Matthias Rupp The first error messages from the compiler (the rest are also complaints about forming references to void): ../boost_1_30_0/boost/iterator_adaptors.hpp: In instantiation of `boost::iterator_adaptor<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>*, boost::multi_pass_input_iterator_tag, ptrdiff_t>': ../boost_1_30_0/boost/graph/filtered_graph.hpp:216: instantiated from `boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all>' complaint.cpp:23: instantiated from here ../boost_1_30_0/boost/iterator_adaptors.hpp:852: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:927: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp: In instantiation of `boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>': ../boost_1_30_0/boost/type_traits/is_convertible.hpp:128: instantiated from `boost::detail::is_convertible_basic_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_convertible.hpp:191: instantiated from `boost::detail::is_convertible_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::is_convertible<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::detail::is_enum_helper<false>::type<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::detail::is_enum_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_scalar.hpp:36: instantiated from `boost::is_enum<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_scalar.hpp:36: instantiated from `boost::detail::is_scalar_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_class.hpp:76: instantiated from `boost::is_scalar<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_class.hpp:76: instantiated from `boost::detail::is_class_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_empty.hpp:75: instantiated from `boost::is_class<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_empty.hpp:75: instantiated from `boost::detail::is_empty_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::is_empty<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::compressed_pair<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::iterator_adaptor<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>*, boost::multi_pass_input_iterator_tag, ptrdiff_t>' ../boost_1_30_0/boost/graph/filtered_graph.hpp:216: instantiated from `boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all>' complaint.cpp:23: instantiated from here ../boost_1_30_0/boost/iterator_adaptors.hpp:1313: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:1315: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:1344: error: forming reference to void [...]

1 0

New file uploaded to Boost-Users
by Boost-Users＠yahoogroups.com 30 Jun '03

30 Jun '03

Hello, This email message is a notification to let you know that a file has been uploaded to the Files area of the Boost-Users group. File : /uBLA Performance.pdf Uploaded by : sumohurd <matt(a)finray.net> Description : Updated to correctly use n^2*(2n-1) for notional FLOP count You can access this file at the URL http://groups.yahoo.com/group/Boost-Users/files/uBLA%20Performance.pdf To learn more about file sharing for your group, please visit http://help.yahoo.com/help/us/groups/files Regards, sumohurd <matt(a)finray.net>

1 0

boost with WS6U1
by Gabe E. Nydick 30 Jun '03

30 Jun '03

Has anyone gotten boost 1.29 to work with Sun WS6U1? If so, could you please help me out with some patch files to get it working? - Gabe [Non-text portions of this message have been removed]

1 0

boost::function and VC6 compile failure
by Vincent Finn 30 Jun '03

30 Jun '03

Hi, I am using the function classes in VC6 and have hit a problem The problem is that the compiler can't allocate enough space to build (The error mesages are at the bottom) Nomally you use the /ZmXXX compiler flag to make this bigger but that doesn't work in this case Has anyone hit this before? Is there a simple workaround? In case it makes a differnce the problem arises as follows I have a template class which has instances of boost::function1 and 2 If I build with only one version of my class everything is fine when I have more versions (I need about 12 different types) it stops Vin boost_1_30_0\boost\type_traits\has_trivial_copy.hpp(31): fatal error C1204: compiler limit : internal structure overflow boost_1_30_0\boost\type_traits\has_trivial_copy.hpp(43): see reference to class template instantiation 'boost::detail::has_trivial_copy_impl<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\type_traits\is_stateless.hpp(31): see reference to class template instantiation 'boost::has_trivial_copy<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\type_traits\is_stateless.hpp(43): see reference to class template instantiation 'boost::detail::is_stateless_impl<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\function\function_base.hpp(193): see reference to class template instantiation 'boost::is_stateless<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\function\function_template.hpp(431): see reference to class template instantiation 'boost::detail::function::get_function_tag<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\function\function_template.hpp(293): see reference to function template instantiation 'void boost::function2<bool,unsigned char,unsigned char,int>::assign_to(less_equal<unsigned char>)' being compil ed

2 2

RE: [Boost-Users] Any luck with HP-UX 11i (11.11) using aCC 3.39
by Tom Matelich 27 Jun '03

27 Jun '03

> -----Original Message----- > From: Toon Knapen [mailto:toon.knapen@fft.be] > > > Thanks for the update Toon. I think we're going to migrate > > to the gcc compiler on HP-UX for all our future work. That > > or we're going to go with Linux and bag HP altogether. > > OK but nevertheless some related info : > HP says that gcc only obtains 1/3th of the performance of aCC (never > checked myself though). And you should also now that I tried > to compile > boost with gcc (oops it's not shown anymore on the status pages, I'll > have to update it) and I had trouble compiling it (mostly to do with > posix threads AFAICT). > Not sure where that performance statistic comes from, but I didn't really notice it when we went from aCC to gcc a while back (but that was on 10.20, acc 1.18 -> gcc 2.9x). I'd recommend you use at least gcc 3.3 if you are going to go to gcc. There are a few big bugs. On 3.2.x we've had to drop to -O1 due to what appear to be optimizer bugs. GCC says they fixed some of those with 3.3, though I haven't had the chance to verify. In any case, back when Jens Maurer and I were trying to get Boost on aCC going, we were told Boost was going to become part of their test suite, but the lack of progress seems to indicate that didn't happen. And, if you have the opportunity, run as fast as you can away from HP to Linux. When Douglas Schmidt singles out a platform as being hard to work with (can't remember the exact reference, but it wasn't complimentary), you know its a pain. ----------------------------------------------------------------------- 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

Unelegant constructs in date_time
by Claus Tondering 27 Jun '03

27 Jun '03

Here's a list of a few things I find unelegant in the date_time package: 1. Order or parameters Consider these declarations: date d(year, month, day); partial_date pd(day, month); So date() uses month before day, while partial_date() uses day before month. 2. No += and -= I can say date1 = date1 + date_duration(3); but not date1 += date_duration(3); 3. Namespace problems Date generators are in different namespaces: Both partial_date and first_kday_of_month are found in boost::date_time, but partial_date is also carried over in boost::gregorian, whereas first_kday_of_month is not. 4. Inconsistent abbreviations If I want the first Thursday in September, I must write: boost::date_time::first_kday_of_month<date> fts(Thursday, Sep); 'Thursday' must not be abbreviated to 'Thu'. 'Sep' must not be unabbreviated to 'September'. 5. Misleading exception string This code: try { date d(2003, Feb, 29); } catch (std::out_of_range exc) { std::cout << "Caught exception: " << exc.what() << std::endl; } surprisingly outputs this text: Caught exception: Day of month value is out of range 1..31 So, it seems that 29 is not in the range 1..31. -- Claus Tondering

2 1

RE: [Boost-Users] Any luck with HP-UX 11i (11.11) using aCC 3.39
by Murray, Charlie H 27 Jun '03

27 Jun '03

Thanks for the update Toon. I think we're going to migrate to the gcc compiler on HP-UX for all our future work. That or we're going to go with Linux and bag HP altogether. -----Original Message----- From: Toon Knapen [mailto:toon.knapen@fft.be] Sent: Friday, 27 June 2003 01:04 To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] Any luck with HP-UX 11i (11.11) using aCC 3.39 > Has anyone had any luck building Boost 1.30.0 on HP-UX 11i > (11.11) using the aCC version 3.39 compiler? The Compiler > Status page for HP-UX lists the 5.38 version of aCC, but it > looks like I'm having many of the same problems. > > Any help would be greatly appreciated. First of all, I'm planning to sync the status pages on HP/aCC every day. But yes, the aCC compiler fails misereably on compiling boost. I've started to try to isolate code that is legal but can't be handled by the aCC compiler and send it to their experts. By exchanging such code-snippets we could improve our understanding of the (deficiencies of the) aCC compiler and improve portability of the boost libraries. So I'll end with the same line as your post : any help would be greatly appreciated. toon 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/

2 1

boost::lambda::select2nd
by Markus Werle 27 Jun '03

27 Jun '03

Hi! I would like to write code like int main() { namespace l = boost::lambda; std::map<int, double> M; M[1] = 5.0; M[3] = 7.0; std::for_each(M.begin(), M.end(), l::select2nd(l::_1) *= 6.0); } Is it hard to implement this for boost::lambda? Markus

3 8

BGL problem with filtered_graph and adjacency_matrix
by Matthias Rupp 27 Jun '03

27 Jun '03

Hi, i'm new to boost and encountered the following problem with the boost graph library: #include "boost/graph/adjacency_list.hpp" #include "boost/graph/adjacency_matrix.hpp" #include "boost/graph/filtered_graph.hpp" int main (void) { using namespace boost; typedef adjacency_matrix<undirectedS> Graph; //typedef adjacency_list<vecS, vecS, undirectedS> Graph; typedef filtered_graph<Graph, keep_all> FilteredGraph; Graph g (5); FilteredGraph fg (g, keep_all ()); } This results in a lot of error messages from the compiler (see end of email), all located in the bgl files. If i use adjacency_list (as in the commented line above) instead of adjacency_matrix, everything's fine. I use gcc 3.3 under linux. Is this a bug? Is there an easy way to make filtered_graph work with adjacency_matrix? (I'd like to use adjacency_matrix because my graphs are almost complete graphs). Best regards, Matthias Rupp The first error messages from the compiler (the rest are also complaints about forming references to void): ../boost_1_30_0/boost/iterator_adaptors.hpp: In instantiation of `boost::iterator_adaptor<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>*, boost::multi_pass_input_iterator_tag, ptrdiff_t>': ../boost_1_30_0/boost/graph/filtered_graph.hpp:216: instantiated from `boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all>' complaint.cpp:23: instantiated from here ../boost_1_30_0/boost/iterator_adaptors.hpp:852: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:927: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp: In instantiation of `boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>': ../boost_1_30_0/boost/type_traits/is_convertible.hpp:128: instantiated from `boost::detail::is_convertible_basic_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_convertible.hpp:191: instantiated from `boost::detail::is_convertible_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::is_convertible<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::detail::is_enum_helper<false>::type<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::detail::is_enum_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_scalar.hpp:36: instantiated from `boost::is_enum<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_scalar.hpp:36: instantiated from `boost::detail::is_scalar_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_class.hpp:76: instantiated from `boost::is_scalar<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_class.hpp:76: instantiated from `boost::detail::is_class_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_empty.hpp:75: instantiated from `boost::is_class<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_empty.hpp:75: instantiated from `boost::detail::is_empty_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::is_empty<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::compressed_pair<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::iterator_adaptor<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>*, boost::multi_pass_input_iterator_tag, ptrdiff_t>' ../boost_1_30_0/boost/graph/filtered_graph.hpp:216: instantiated from `boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all>' complaint.cpp:23: instantiated from here ../boost_1_30_0/boost/iterator_adaptors.hpp:1313: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:1315: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:1344: error: forming reference to void [...]

1 0

Any luck with HP-UX 11i (11.11) using aCC 3.39
by Murray, Charlie H 27 Jun '03

27 Jun '03

Has anyone had any luck building Boost 1.30.0 on HP-UX 11i (11.11) using the aCC version 3.39 compiler? The Compiler Status page for HP-UX lists the 5.38 version of aCC, but it looks like I'm having many of the same problems. Any help would be greatly appreciated. Charlie Murray Senior Software Engineer National Access Services Comcast Media Centers Phone: 303-267-9819 Email: charlie_murray(a)cable.comcast.com CONFIDENTIAL NOTICE This electronic mail transmission and any accompanying documents contain information belonging to the sender which may be confidential and legally privileged. If you are not the intended recipient, any disclosure, copying, distribution or action taken in reliance on the message is strictly prohibited. If you have received this message in error, please delete it immediately. Thank You

2 1

Cannot compile posix_time.hpp on MSVC
by Claus Tondering 26 Jun '03

26 Jun '03

If I include "boost/date_time/posix_time/posix_time.hpp" in a file and compile the file using the Gnu C++ compiler, everything works fine. But if I compile the file using Miscrosoft Visual C++, I get this error message from the lexical_cast.hpp file: ...\boost\lexical_cast.hpp(147): error C2678: binary '<<' : no operator found which takes a left-hand operand of type 'std::basic_stringstream<_Elem,_Traits,_Alloc>' (or there is no acceptable conversion) with [ _Elem=wchar_t, _Traits=std::char_traits<wchar_t>, _Alloc=std::allocator<wchar_t> ] The offending line in lexical_cast.hpp contains this function: bool operator<<(const Source &input) { return stream << input; } What am I doing wrong? -- Claus Tondering

2 1

Pyste and class methods
by Jim Wilson 26 Jun '03

26 Jun '03

Pystitos, Pyste digests foo.h: struct foo { static void bar(int); static int bar(); }; under guidance from foo.pyste: Class("foo", "foo.h") and silently yields foo.cpp devoid of any BOOST_PYTHON_MEMBER_OVERLOADS(...) macros. Consequently, gcc begins whining "no matches can be found converting function `bar' to type [..some incredibly complex C++ declaration that I'd never be able to type in correctly, much less understand...]" and suggests the obvious candidates. What stupid thing am I overlooking? Jim Wilson Gainesville, FL

1 0

Problem with filesystem attributes
by richard_fanta 26 Jun '03

26 Jun '03

Hiya, I've been trying to try out the attributes code in the boost-sandbox, but am running into some snags using VC++ version 7 (that comes with VS .NYET). One simple goal here would be to discern whether a file is writeable. Can this be done with the filesystem::attributes library?? The code for attr_test.cpp from the tests directory is included below; it's been slightly modified to run stand-alone instead of through the boost test harness. Problem #1: No string() method on the cache class. Problem #2: The "<<" operator won't work. For the latter, I've seen it suggested that typedefs might help, but don't understand what the underlying issue is. Is this a lingering Microsoft (i.e. VC++) specific issue? I'd greatly appreciate any clarification that people can offer. Much thanks, Richard Fanta ----------------Errors---------------------------------------------- x:\v\ReviewAgent\AttrTest\attr_test.cpp(23) : error C2039: 'string' : is not a member of 'boost::filesystem::cache' x:\ReviewAgent\Util\boost_1_30_0_filesystem\boost\filesystem\cache.hpp(33) : see declaration of 'boost::filesystem::cache' x:\v\ReviewAgent\AttrTest\attr_test.cpp(25) : error C2676: binary '<<' : 'boost::filesystem::cache' does not define this operator or a conversion to a type acceptable to the predefined operator x:\v\ReviewAgent\AttrTest\attr_test.cpp(26) : error C2676: binary '<<' : 'boost::filesystem::cache' does not define this operator or a conversion to a type acceptable to the predefined operator x:\v\ReviewAgent\AttrTest\attr_test.cpp(26) : error C2676: binary '<<' : 'boost::filesystem::cache' does not define this operator or a conversion to a type acceptable to the predefined operator ----------------Source---------------------------------------------- #include <iostream> #include <exception> #include <string> #include "boost/filesystem/attributes.hpp" #include "boost/filesystem/path.hpp" //#include "boost/test/minimal.hpp" namespace fs = boost::filesystem; //int test_main (int argc, char **argv) int main (int argc, char **argv) { for (int i = 1; i < argc; ++i) { fs::path file (argv [i], fs::native); fs::cache pm (file); std::cout //<< "name: " << get <fs::filename> (pm).string () << "; size: " << get <fs::size> (pm) << "; owner: " << get <fs::owner> (pm) << "; group: " << get <fs::group> (pm) << "\n"; }

1 0

Newbie lambda question
by Ian 25 Jun '03

25 Jun '03

Boosters: Try as I might, I cannot figure a way of converting the following code snippet to use std::for_each with boost::lamdba. Any ideas? unsigned int table[1000]; for ( unsigned int* it = table_; it != table_ + (sizeof(table_) / sizeof(unsigned int)); ++i ) { *it = ((int)it % 3); } The pointer to int cast is the killer, the docs mention the ret<> template briefly, but it does not seem to help... Cheers Ian

3 3

Ublas library
by Alexey Nikitin 25 Jun '03

25 Jun '03

Hello everyone, I am try to use Ublas library and have some questions. I am want to write next code: template<class Matrix> void ProcessRecursive(Matrix& m) { typedef matrix_range<typename Matrix::matrix_type> MatrixRange; ... MatrixRange mr = project(m, range(...), range(...)); ... ProcessRecursive(mr); ... } void StartProcess() { ... matrix<double> m; ... ProcessRecursive(m); } But I have not enough type matrix_type in class matrix<...> and function template<class M> matrix_range<M> project(matrix_range<M>& data, const range& r1, const range& r2); There is almost the same function project but reciving const referens to matrix_range and compiler can't find it even using partial template ordering. Do somebody help my to write this code correctly? Or fix library? Regards, Alexey.

2 4