I have a hashset where I know ahead the number of elements it will contain. In a vector, I'll just use this capacity. However, hashmaps usually keep some space empty for better performance.
You don't need to manually account for that load factor though. Reserve the amount you actually want, and the implementation will pad that up and also round up to the next power of two.