#461 lookup objects need tail pointers

[Darren]

various data structures used for pools (destination lists, hash tables, etc) all use simple double linked lists to store data. to avoid O(N) insertion times, data was being inserted at the head but this made printing the correct order more difficult. to simplify the printing, add a tail pointer to all of these objects. to make insertion O(1)