Browse Prior Art Database

Printing System With Tab Rack Implemented As a Binary Tree

IP.com Disclosure Number: IPCOM000041535D
Original Publication Date: 1984-Feb-01
Included in the Prior Art Database: 2005-Feb-02

Publishing Venue

IBM

Related People

Authors:
Allen, WH Cory, TM Thornton, RA [+details]

Abstract

In processor-controlled printing systems, tab racks are conventionally used to set up the tab positions in the printer. The present novel tab rack is implemented as a binary tree. Therefore, the tabs do not have to be set up in any particular order. The binary tree will automatically sort the tabs and delete any duplicate tabs which may have been entered. Figs. 1 and 2 give examples of binary tree tab racks. In Fig. 1, tab stops are set up for positions 5, 10, 20, 30, 40 and 50. In Fig. 2, the same tab rack is shown with the tab stop for position 15 added. There are several advantages to implementing a tab rack with a dynamic binary tree. The binary tree will use only as many memory locations as there are tabs. A non-dynamic method must reserve as many locations as the maximum number of tabs allowed.