Is there a canonically “best” (most efficient) C++ structure to fill with a few thousand members in, say, ~20 groups, to then frequently query if a given member is already taken? For instance, for each group, the following would work: