Abstract: A technique for providing automatic modification of a computer application program adopts the program for compatibility with hardware different from that for which the program was originally written and tested. Upon initial loading of the application program, a search is made to determine the existence of a set of exception tables, external to the application program. If the exception tables are present, all code conversion tables within the application program relating to I/O operations are modified according to the set of exception tables. Plural sets of exception tables may be included with the ability of the operator to choose which set of exception tables will be used to modify the program, thereby allowing the operator to use a single program with a variety of different hardwawre configurations, assuring with each configuration that the intended characters and symbols are displayed and printed.

Abstract: Record data on a disk file is sorted in a text/data processor by means of an algorithm that transfers such records on the basis of rank to a sort buffer on the basis of qualifying criteria. Each qualified file record is compared with the lowest ranked record previously transferred and located in the sort buffer. When a higher ranked record is identified it is transferred into the buffer at a location based on qualification. Lower ranked records are deleted from the sort buffer if space does not permit the storing of such records within the space available. When the sort buffer has been loaded with the highest ranked records remaining in the disk file without overflowing the buffer is unloaded to an output device. The sort program recycles through a subsequent pass again transferring the highest ranked remaining records into the sort buffer. To minimize recycle time, a presort algorithm is run to set record identifying bits in a bit map section of the sort buffer.