Method and system for reducing the horizontal space required for displaying a column containing text data

• US 7,962,848 B2
• Filed: 10/16/2006
• Issued: 06/14/2011
• Est. Priority Date: 06/02/1998
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Bertram, Randal Lee
• Primary Examiner(s): Hong; Stephen S
• Assistant Examiner(s): YANG, I CHAN
• Application Number:
  US11/549,706
• Publication Number:
  US 20070130507A1
• Time in Patent Office: 1,702 Days
• Field of Search: 715/227, 715/261
• US Class Current: 715/254
• CPC Class Codes: H04L 41/22 comprising specially adapted graphical user interfaces [GUI]

Abstract

A method and system for reducing an amount of horizontal space required when displaying a plurality of columns on a display screen is disclosed. The at least one column of the plurality of columns has at least one entry containing text data. The method and system include obtaining the at least one entry from the at least one column, and abbreviating a width of the at least one entry, determining if there is another entry containing text data. The method and system further include repeating the steps of obtaining the at least one entry, abbreviating the at least one entry and determining if there is another entry until all of the at least one entries are abbreviated. The method and system further include displaying the at least one column having the at least one abbreviated entry.

Claims

1. A method implemented on a computer for abbreviating a word comprising:

a) defining spaces, lower case vowels, and lower case letters as character types to be deleted from the word;

b) assigning a character type value of one for spaces, a character type value of two for lower case vowels, and a character type value of three for lower case letters;

c) providing the word;

d) examining the word in sequential order first for characters associated with character type one, second for character associated with character type two, and third for characters associated with character type three;

e) deleting from said word all character types associated with character type values so assigned wherein deletion is executed in the sequential order in which the word is examined; and

f) displaying on a monitor the remaining portion of said word.

2. The method of claim 1 wherein e) includes deleting each one of said character type sequentially in the same order in which said character type values has been assigned.

3. The method of claim 2 further including setting a predefined width for said word;

and

testing a portion of the word remaining subsequent to deleting each one of said character type associated with each one of said character type values to determine a width of said portion.

4. The method of claim 3 wherein f) is executed only if the portion of the word remaining is less than or equal to the predefined width.

5. The method of claim 1 wherein the word includes at least a column heading in a table.

6. A method implemented on a computer for abbreviating a word comprising;

a) defining three character types wherein a first one of the three character types represents spaces, a second one of the three character types represents lower case vowels, and a third one of the three character types represents lower case letters;

b) defining a numeric value for each one of said three character types;

c) defining a sequence, based upon each of the numeric values, in which the word is to be examined;

d) examining the word sequentially in accordance with the defined sequence;

e) deleting character types, associated with the numeric values in the same order in which said numeric values are placed in the sequence, if detected in said word; and

f) displaying on a monitor a part of the word remaining subsequent to execution of e).

7. The method of claim 6 wherein the numeric values include one for spaces, two for lower case vowels, and three for lower case letters.

8. The method of claim 7 wherein the sequence is arranged in ascending order beginning with lowest numeric value to highest numeric value of the sequence.