Boost logo

Boost Users :

Subject: Re: [Boost-users] Comparing two vectors element by element
From: Jeff Flinn (TriumphSprint2000_at_[hidden])
Date: 2008-09-10 08:25:28


Sean Farrow wrote:
> Hi Gevorg:
> In this case it's the second, for more background for interest:
> Each vector represents a braille cell.
> A braille cell has 6 dots hence the std::bitset<6> so:
> A vector can have up to 6 bitsets, each bitset represents one dots
> state.
> Hth.
> Sean.

If your vector length is bounded why not just use
boost::array<std::bitset<6>,6> or std::bitset<36>.

If the unused values space savings are important why not
boost::dynamic_bit_set? It already has the comparison operators defined.

Jeff Flinn


Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net