We currently use a boost::container::static_vector<RndId, 10> to store the used random vector ids. Then we use set intersection to find whether some id has been used already. Instead we could just use a bitfield where each id is a bit. Intersection is then dead-easy with &. This will take less cycles and also less memory and makes the code easier.
We currently use a
boost::container::static_vector<RndId, 10>to store the used random vector ids. Then we use set intersection to find whether some id has been used already. Instead we could just use a bitfield where each id is a bit. Intersection is then dead-easy with&. This will take less cycles and also less memory and makes the code easier.