optimize the search of empty slot in the hashid_node array

As the players come and go, empty slots will appear evenly in the hashid_node array. If the search always starts from hi->count, new elments will be put in both ends, but the central part of the array will become sparse. And the following searches will be slowed down.