When generating keys for 2dsphere indexes we calculate the cartesian products of all keys.

If documents contain locations with a large number of location coordinates compounded with an array of a large number of elements the resulting cartesian product can be massive in size.

When generating all these keys they are inserted into a single std::vector that needs to hold the cartesian product number of elements which can fail as the number is simply too large.