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
Document File: 2 page(s) / 35K

Publishing Venue

IBM

Related People

Allen, WH: AUTHOR [+3]

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.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 2

Printing System With Tab Rack Implemented As a Binary Tree

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. When a tab is placed into the tree, it may readily be inserted into the proper node to maintain a sorted order. Duplicate tabs may be readily discarded, i.e., no two nodes will be the same.

1

Page 2 of 2

2

[This page contains 3 pictures or other non-text objects]