Version 0.99.1: (July 29, 2006) The three packages, nom.tam.fits, nom.tam.util and nom.tam.image are combined into a single JAR file for the convenience of the user. Added new methods to delete rows and columns from both binary and ASCII tables. There are changes to many of the table classes including util/ColumnTable. These changes were suggested by row deletion code written by R. Mathar, but the actual implementation is entirely independent and errors are handled somewhat differently than in his code. There are deleteColumns and deleteRows methods in TableHDU that delete either a specified range or all tables or columns after (and including) the one specified. The util.HashedList implementation has been completely revised. It now uses a HashedMap for keyed access and an ArrayList for sequential access. It no longer implements a simple but custom list structure. The public interface was not significantly changed. Header now sorts keywords before a header is written to ensure that required keywords come where they need to be. Previously users needed to work to make sure that they wrote required keywords in the right location in the header. A new class, HeaderOrder, is used. A number of errors in the handling of variable length arrays were fixed. These were pointed out by Guillame Belanger. This included changes to util.ColumnTable but mostly BinaryTable and FitsHeap. A number of changes mostly to BinaryTable or documentation in other routines suggested by R. MAthar.