Abstract: A system is provided for enhancing a compiler with the capability to install a fastpath within a compiled program. The enhanced compiler allows a program to use the benefits of a fastpath without requiring the addition of new code to the source code. Any type of program, including multi-media, can benefit from the enhanced compiler. A program need only be evaluated to see if there are functions/procedures which can utilize a fastpath. A programmer may turn the enhancement on or off depending upon whether or not there are recurring calculations with results that do not change over time from the same input.

Abstract: A data processing system includes an operating system, a graphical user interface and a plurality of applications programs. The graphical user interface generates a window relating to an executing application programs. Menu items relating to an application program may be represented by an icon. A selected group of objects is defined over a portion of the menu and represented by a metaphor. The graphic metaphor, here an icon ring is displayed on a display device. The icon ring is evocative of an ordered arrangement of items of the selected group, includes the icon for a particular object open to selection, and is subject to direct manipulation for reordering of the underlying selected group.

Abstract: The automatic addition of hooks to software is provided by greatly simplified steps. A function which is to be hooked is renamed. A new function is then created utilizing the original function name to call the renamed function. The new function is provided with a hook entry and exit.

Abstract: Disclosed is a method of decompressing data mode up of a sequence of literal references, history references, and lexicon references. The method includes the steps of reading a reference from the sequence and emitting a lexicon string if the reference is of the type lexicon, emitting a history string if the reference is of the type history, and emitting a literal string if the reference is of the type literal. The string emitted is inserted into a history buffer and if the string is of the type history it is inserted in a lexicon.

Abstract: Disclosed is a method of compressing a sequence of data symbols. The method includes the steps of sequentially appending symbols to a working substring to find the longest string that is duplicated in a history buffer or a lexicon. If the string is duplicated in the history buffer, then a history reference is emitted. If the string is duplicated in the lexicon, then a lexicon reference is emitted. If the string is not duplicated in either the history buffer or the lexicon, then a literal reference is emitted. The history buffer is a record of uncompressed data that has most recently been processed. The lexicon is a record of strings that has been emitted by means of history references.

Abstract: Disclosed is a method of decoding a stream of compressed data made up of a sequence of literal references, history references, and lexicon references. If the first bit of the stream is a zero, then the first reference is of the type literal and the first bit is followed by the 8-bit literal symbol itself. If the first bit is a one, then the first reference is either a history reference or a lexicon reference. If the second bit is a zero, then the first reference is of the type history and the second bit is followed by an offset value and a length value. If the second bit is a one, then the first reference is of the type lexicon and the second bit is followed by an index value. After the character of the first reference has been determined, the process is repeated starting with the first bit following the first reference.

Abstract: A method of encoding compressed data for transmission or storage. The method includes converting the input data stream into a sequence of literal references, history references, and lexicon references. Each literal reference includes a literal identifier. Each history reference includes a history identifier. Each lexicon reference includes a lexicon identifier. The history references and lexicon references specify the location of strings of symbols in a history buffer and lexicon, respectively. The encoding method of the present invention encodes the location information in an optimal manner.