   Liden's article about reasoning with waypoints
  Hello everyone, I have a problem understanding the bit string class in Lars Liden's article about reasoning with waypoints. The article can be found here: http://liden.cc/lars/WEB/Resume/Papers/2002_AIWisdom.pdf If you have read and understood it, please take a look at this sentence:"An effective technique is to store connectivity and visibility information in a bitstring class that consists of a string of bits of arbitrary length with operators for Boolean operations such as <and>, <or> and <not>."What I don't understand is "...with operators for Boolean operations such as <and>, <or> and <not>."What does he mean here? Does the class contain functions for Boolean operations or is it the bits that contain either <and> or <or> or <not>? Or is it something else?Very greatful for help!   
  It's like a std::bitset that just stores an array of booleans but using one bit per entry.  Then you have an operator that takes two bitsets and combines them together using AND, OR, XOR, etc.I believe the TR1 or Boost also has support for these bitfields in C++, maybe even those boolean operations.  Either way, it should be easy to write!   ;Quote:Original post by alexjcI believe the TR1 or Boost also has support for these bitfields in C++, maybe even those boolean operations. boost::dynamic_bitset