Abstract: A condition handling method and means capable of handling programs written in a plurality computer programming languages is created by a set of routines which implement the Common Condition Handling (CCH) function. These routines have entry points which are declared as external or entry variables which enables application programs to link to them. The compilers and application programs can then interact with the condition handling process by calling or branching to the entry points in the common condition handling code when the program is executing. Language specific condition handling routines and user condition handlers are invoked using a last-in-first-out (LIFO) queue to associate the handlers with the current stack frame. Any handler may respond to the CCH with one of three types of requests: Resume, Percolate, and Promote. A separate means is provided for registering Exit Handlers and to move the resume cursor.

Abstract: An apparatus for tensioning an outer layer or web material about a roll of web material includes a tension roller assembly. The tension roller assembly is defined by a rotatable idler roller that is movable into and out of contact with the outer layer of web material by way of a linear drive mechanism. Idler roller contact with the web material outer layer tensions the outer layer about the roll of web material. A tensioner associated with the idler roller adjusts the rotational drag on the idler roller which controls the amount of tension that the idler roller applies to the web material outer layer. A vacuum retraction assembly of the tensioning apparatus acts to further tension the web material outer layer. The vacuum retraction assembly includes a vacuum bar having a plurality of vacuum cups coupled to a vacuum source.

Abstract: A method of encoding data records comprised of null or variable length fields of data bytes such that the sortabilty of the resulting string of data is permitted via simple byte comparisons. The first field is examined to determine if it is a null field. A null field is a field containing no data. It should sort out before a field containing any data, even all zeros. If a null field is detected, it is represented in the encoded string of data by a null field indicator. If the field is not a null field, the bytes in the field are examined. Zero value bytes are encoded based on the number of consecutive zero value bytes while non-zero bytes remain unchanged. An end of field indicator designates the end of each field in the resulting string of encoded data.