Each entry is stored in sorted alphanumeric order so that a binary search can be used to efficiently find any record. The record also holds the file number from division.lkp and the offsets in the data and sequence files for that entry. The file has the usual 300 byte header, and a sorted list of record by accession number. After the usual 300 byte header, each record simply holds the record number in entryname.idx. An accession number search will use acnum.trg to find a start position and number of records to read in this file, and will then simply read the entryname.idx records for each entry in turn.
Data files None.
The indexing method depends on each entry having a unique entry name. Diagnostic Error Messages None. It always exits with status 0. Known bugs None. This program is intended to be used by everyone and everything, from naive users to embedded scripts.