That is now what I have, chers. Sean. -----Original Message----- From: boost-users-bounces@lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Gevorg Voskanyan Sent: 10 September 2008 14:02 To: boost-users@lists.boost.org Subject: Re: [Boost-users] Comparing two vectors element by element Sean Farrow wrote:

It's not allower, the sizes aren't identical. Sean.

Then I think you can perfectly use the function below: bool bitset_vector_less( const std::vector< std::bitset< 6 > > & lhs, const std::vector< std::bitset< 6 > > & rhs ) { assert( lhs.size() == rhs.size() ); return std::equal( lhs.begin(), lhs.end(), rhs.begin(), BitSetComp() ); } where BitSetComp is the predicate you have shown earlier. HTH, Gevorg _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users __________ Information from ESET NOD32 Antivirus, version of virus signature database 3431 (20080910) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com __________ Information from ESET NOD32 Antivirus, version of virus signature database 3431 (20080910) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com