U.S. Places Hash Table

The file http://rabbit.eng.miami.edu/class/een318/named-places.txt,
also accessible as /home/www/class/een318/named-places.txt on rabbit, contains
information on all officially named places in the United States. Each line
has exactly the same format. All the data is strictly aligned in columns,
but the columns have minimal width, so in some cases they are not space-
separated.

The information on each line is:
  8 digit numeric code
  2 letter state abbreviation
  Place name, which may include spaces
  Population
  Area in square miles
  Latitude, degrees North
  Longitude, degrees East
  5 digit code for representative road intersection
  distance to that intersection in miles

Write a program that reads all of that information in, creates an object
to represent all the data for a place, with numeric parts converted to
ints, doubles, or floats as appropriate, and with the spaces trimmed
from the ends of place names.

Store all of those objects in a well-constructed hash table, designed so
that given the name of a place (case insensitive, "Miami" and "miami"
should match) it will very rapidly find the objects representing all
matching locations.

Make it interactive: in a loop, the user types a place name, and the
program prints everything known about any place with the same name.

Submit a nicely readable word document containing code and sample runs.