US4064557A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for merging data flow
Assignee: International Business Machines Corp
•
Filing: 1975-07-14
•
Granted: 1977-12-20
•
Expires: 1995-07-14
Abstract
Abstract A system for merging data flow having a typewriter electronically connected to a buffer, which is a dynamic electronic shift register, for inputting data into sections of the buffer and for merging the data in the sections into a single printout. System control logic is provided to allow (1) a separator, or partition, code to be input into the buffer for defining sections (2) codes corresponding to hold and operation flags to be input into the sections, and (3) text data codes corresponding to characters and switching and/or stopping points to be input into the sections. In addition, the system control logic is operable to allow the operator to insert characters into and delete characters from the sections of the buffer for text editing and revision. The sectioned buffer formed by the input of a separator code, or flag, can also be in electronic association with a record reader, or reader-recorder, such that the operator, by depressing a section store button and operating an alternate section button, can store the contents of records such as cards, tapes, etc., into the desired section of the buffer. With the codes and characters stored in the buffer, the section containing the first text to be printed is addressed, printout is initiated from the operation flag and continues until a switch code is encountered. Then the positions of the hold and operation flags contained in the two different sections are automatically exchanged and printout continues in the other section from the operation flag with the result being the merging of text stored in the sections.
Inventors
- 👤 Robert Glenn Bluethman
- 👤 Michael Eudell McBride
- 👤 Wayne Finis Rogers
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 17:44
CPC Classifications
G; G06; G06F; G06F3/00; G06F3/09
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
185 words
A method of merging groups of data codes stored in a memory upon output of said codes to a printer, said method comprising the steps of: dividing said memory into sections by a first separator control code generated by a separator control code generator; storing in one section of said memory (a) a second operating point control code generated by an operating point control code generator, (b) data codes, and (c) at least one switch code; storing in another section of said memory (a) a third holding point control code generated by a holding point control code generator, (b) data codes, and (c) at least one switch code; decoding said codes by a decoder; outputting from said memory to said printer said data codes adjacent said second control code in said one of said sections until said switch code in said one of said sections is decoded adjacent said second control code; exchanging the memory locations of said second and third control codes in said memory sections; and outputting to said printer said data codes adjacent said second control code insaid another of said sections.
Claim 2
Independent Claim
185 words
A method of merging groups of data codes stored in a memory upon output of said codes to a printer, said method comprising the steps of: dividing said memory into sections by a first separator control code generated by a separator control code generator; storing in one section of said memory (a) a second operating point control code generated by an operating point control code generator, (b) data codes, and (c) at least one switch code; storing in another section of said memory (a) a third holding point control code generated by a holding point control code generator, (b) data codes, and (c) at least one switch code; decoding said codes by a decoder; outputting from said memory to said printer said data codes adjacent said second control code in said one of said sections until said switch code in said one of said sections is decoded adjacent said second control code; exchanging the memory locations of said second and third control codes in said memory sections; and outputting to said printer said data codes adjacent said second control code insaid another of said sections.
Claim 3
Dependent Claim
43 words
The method of claim 1 wherein said exchanging said second and third control codes further comprises: writing another third control code over said second control code in said one of said sections when said switch code is decoded adjacent said second control code.
Claim 4
Dependent Claim
43 words
The method of claim 2 wherein said exchanging said second and third control codes further comprises: writing another second control code over said third control code in said another of said sections when said switch code is decoded adjacent said second control code.
Claim 5
Independent Claim
308 words
A system for arranging and storing groups of data codes in a memory for merging said groups of codes upon output of said codes to a printer, said system comprising: a. first means for inputting (1) a first separator control code into said memory to partition said memory to establish two sections in said memory, (2) data codes and switch codes into each of said sections of said memory, and (3) a second operating point control code into a first of said sections for defining an operating point in said memory and a third holding point control code into a second of said sections for defining a holding point in said memory; b. second means coupled to said first means for inputting, for decoding said control, data, and switch codes; c. third memory outputting means, upon decoding said second control code by said second means, for outputting a data code adjacent said second control code, from said first of said sections of said memory to said printer and for advancing said second control code through said first of said sections of said memory after each of said data codes adjacent said second control code is output until one of said switch codes is decoded adjacent said second control code; d. fourth means, upon said switch code being decoded by said second means, for exchanging the memory locations of said second control code and said third control code; and e. fifth means included in said third means, upon again decoding said second control code by said second means, for outputting a data code adjacent said second control code in said second of said sections of said memory to said printer and for advancing said second control code through said second of said sections of said memory after each of said data codes adjacent said second control code is output.
Claim 6
Independent Claim
308 words
A system for arranging and storing groups of data codes in a memory for merging said groups of codes upon output of said codes to a printer, said system comprising: a. first means for inputting (1) a first separator control code into said memory to partition said memory to establish two sections in said memory, (2) data codes and switch codes into each of said sections of said memory, and (3) a second operating point control code into a first of said sections for defining an operating point in said memory and a third holding point control code into a second of said sections for defining a holding point in said memory; b. second means coupled to said first means for inputting, for decoding said control, data, and switch codes; c. third memory outputting means, upon decoding said second control code by said second means, for outputting a data code adjacent said second control code, from said first of said sections of said memory to said printer and for advancing said second control code through said first of said sections of said memory after each of said data codes adjacent said second control code is output until one of said switch codes is decoded adjacent said second control code; d. fourth means, upon said switch code being decoded by said second means, for exchanging the memory locations of said second control code and said third control code; and e. fifth means included in said third means, upon again decoding said second control code by said second means, for outputting a data code adjacent said second control code in said second of said sections of said memory to said printer and for advancing said second control code through said second of said sections of said memory after each of said data codes adjacent said second control code is output.
Claim 7
Dependent Claim
36 words
The system of claim 4 wherein said fourth means includes means, upon decoding said switch code, for writing another third control code over said second control code in said first of said sections of said memory.
Claim 8
Dependent Claim
31 words
The system of claim 5 wherein said fourth means includes means for writing another second control code over said third control code in said second of said sections of said memory.
Claim 9
Dependent Claim
44 words
The system of claim 6 wherein said forth means includes inhibiting means for inhibiting the input of a second control code into another memory section containing a third control code when said another memory section has no data codes past said third control code.
Claim 10
Dependent Claim
68 words
The system according to claim 7 wherein said first means includes means for inputting repeat codes into said sections of said memory, and said second means includes means for decoding said repeat codes, and furter comprising means for repeating the outputting of data codes from the section containing said second control code to said printer in response to a repeat code being decoded adjacent said second control code.
Claim 11
Dependent Claim
21 words
The system according to claim 8 further comprising means for deleting data codes from either of said sections of said memory.
Claim 12
Dependent Claim
14 words
The system of claim 9 wherein said memory further comprises a dynamic shift register.
References Cited (Backward Citations)
US2969913A
Cited
US2947976A
Cited
US3017610A
Cited
US3235848A
Cited
US3343133A
Cited
US3694813A
Cited
US3675216A
Cited
US3696343A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1980-12-19 | 1981-06-20 | 1981-12-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1984-12-19 | 1985-06-20 | 1985-12-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1988-12-19 | 1989-06-20 | 1989-12-20 | $7700.00 | Window Closed / Lapsed |