JPH0728789A - Word processor - Google Patents

Abstract

PURPOSE:To efficiently search a document which is registered in a document file and is generated at a pertinent date by displaying a list of registered document names classified by generation dates at the time of calling the registered document. CONSTITUTION:Generation date information of all of document data registered in a document file 1 are read and are set to a generation date storage buffer 3. Date information set to the generation date storage buffer 3 are transposed in the order from the latest, and transposed date information are recorded in the storage position of date data of 'generation date index data'. Next, a window frame for call and a title are displated, and generation date information recorded at the first position of 'generation date index data' is displayed in the first row of the window. A pointer on 'registered name index data' is referred to take the registered document name corresponding to this date information, and this registered document name is displayed from the third row in the window.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a word processor which can be registered in a document file (recording medium) such as a floppy disk or a memory card.

[0002]

2. Description of the Related Art Conventionally, in a word processor, when a document is called from a document file, registered document names are displayed in a list in the order of registration numbers regardless of the creation date.

[0003]

In the conventional word processor, in order to search for a document created on what month and day by calling the registered document, all the documents registered in the document file are not displayed as a list on the display screen. I could not find the document efficiently.

[0004]

In order to solve the above problems, the word processor of the present invention has an input means capable of registering document data in a document file such as a floppy disk or a memory card, and a document file created from the input file. A reading unit that reads the date / registered document name, a creation date storage buffer that stores the creation date information read by the reading unit, and a creation date information stored in the creation date storage buffer with a new one at the beginning Date order sorting means for sorting the order, created date index memory for recording the sorted date information in the storage position of the date data, and registration created by reading the created date / registered document name reading means in order from the newest date. The registered name index memory that records the name in the storage location of the registered name data, and the It is characterized by comprising a recording destination pointer calculation means for acquiring the corresponding registered name by referring to a pointer, and a list display section for displaying the acquired registered name together with the creation date.

[0005]

Since the present invention has the above-described structure, when the registered document is called, a list of "registered document names" by date created can be displayed.

[0006]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A word processor (hereinafter referred to as "word processor") system of the present invention has a schematic configuration as shown in FIG. 1, and its signal or operation is as indicated by an arrow, and reference numeral 1 is a floppy disk or memory. A document file such as a card, 2 is a creation date when registered in the document file and a creation date / registered document name reading means for reading the registered document name, 3 is a creation date storage buffer for storing the creation date, and 4 is the creation date Date order sorting means for sorting the creation dates stored in the storage buffer 3 in the order of dates, 5 is a creation date index memory for storing a creation date index, and 6 is data stored in the memory. A list display section displayed on the display screen, 7 is a registered name index memory for storing a registered name index 8 is a registered destination pointer calculation means.

Specifically, the existing "call" function is shown in FIG.
As shown in the display screen of, the "By date" key for shifting to the document calling mode by date is provided. This "by date"
When the key is pressed, the processing contents described below are entered.

The processing contents of this word processor will be described with reference to the flowcharts shown in FIGS. The data to be used are "creation date storage buffer", "creation date index data" and "registered name index data".
Is.

Next, the creation date information (year, month, day) of all the document data registered in the document file is read,
It is set in the "creation date storage buffer" (step (hereinafter referred to as "S") 1).

The date information set in the "creation date storage buffer" is sorted from newest to oldest, with the newest one at the beginning. At this time, if there are a plurality of the same dates, they are made one (S2).

The rearranged date information is recorded in the storage position of the date data of "creation date index data" (S3).

Next, the head of the "registered name index data" is designated as a pointer Y. The head of the "creation date index data" is designated as a pointer X. The pointer Y is set to the first date of the "creation date index data". The registration name information corresponding to the date information being stored at the position pointed by the pointer X is searched from the document file. Once the document is found,
The registered name information is recorded from the pointer Y of "registered name index data". At that time, the pointer to which the next registered name information is recorded is calculated (S4 to S6).

As a method of calculating the above-mentioned pointer, since the data length of each registered name information is fixed, it is only necessary to sequentially add the data length per registered name information. The data length is Z, and the calculation formula is a pointer (Y + Z ×
n). However, n changes to 0, 1, 2, .... When you have finished searching to the end of the document file, move to the calculated pointer (Y
Record + Z × n). This series of processes is performed until the last date in the "creation date index data".

Next, the window frame and title of the call are displayed (S7).

The creation date information recorded at the beginning of the "creation date index data" is displayed on the first line of the window (S8).

The registered document name corresponding to the date information is
It is acquired by referring to the pointer on the "registered name index data" (S9).

The acquired registered document name is displayed from the third line of the window. The document names that can be displayed at once are 10 documents (S10).

After the document name is displayed, the key is accepted (S1
1).

When the "previous day" key is pressed, the process proceeds to S21 (S12).

When the "next day" key is pressed, the process proceeds to S31 (S13).

When the "execute" key is pressed, the process moves to the process of calling the selected document data (S14).

Next, it is determined whether or not there is a day obtained by subtracting one day from the present day. When it exists, it moves to S22. When it does not exist, it moves to S23 (S21).

The date obtained by subtracting one day from the current date is displayed on the first line of the window. After the display, jump to S9 (S2
2).

A message "There is no document created on (current day-1 day)" is displayed (S23).

Further, the date is subtracted one day at a time to find the date where the document data exists. If yes, move to S25. If not present, the process proceeds to S26 (S26).

The searched date is displayed on the first line of the window. After the display, jump to S9 (S25).

A message "There is no document created before (current day-1 day)" is displayed. After the display, S11
Jump to (S26).

Next, it is determined whether there is a day that is one day after the present day. When it exists, it moves to S32. When it does not exist, it moves to S33 (S31).

The date obtained by adding one day from the current date is displayed on the first line of the window. After the display, jump to S9 (S3
2).

A message "There is no document created on (current day + 1 day)" is displayed (S33).

Further, the dates are added one day at a time to find the date when the document data exists. If yes, move to S35. If not present, the process proceeds to S36 (S34).

The found date is displayed on the first line of the window. After the display, jump to S9 (S35).

A message "There is no document created after (current day + 1 day)" is displayed. After the display, S11
Jump to (S36).

The above is a description of the processing contents of this word processor. Explaining the registration contents of the "text file" shown in FIG. 5 as an example below, first, the creation date information is read in order from the beginning of the document file, The read creation date information is stored in the "creation date storage buffer" as shown in FIG. Therefore, sort from newest to oldest. Here, the data of 1993/02/10 is the latest. The above result is recorded in the "creation date index data" as in the state shown in FIG.

The head pointer of the "registered name index data" is recorded at 1993/02/10 at the head of the "creation date index data". Here, 000
Address 0

Next, the registered name corresponding to 1993/02/10 is searched from the text file. First, since "---- tatata" corresponds, this registered name information is recorded at the address 0000 of "registered name index data". The recording destination address for recording the next registered name information is calculated.
Assuming that the length of the data of one registered name information is 16 bytes, the calculation formula is 0000 + 10 _(hex) , and as a result, the recording destination address is the address 0010 _(hex) .

Next, "112 solstice" corresponds and is recorded in the "registered name index data", the next recording destination address is calculated, and 0010 _(hex) +10 _(hex) = 002.
It becomes 0 _{( hex)} . Since there are no registered names corresponding to 1993/02/10 at this point, the next date is 199
See 3/01/05. Before referencing, enter the current recording destination address in "Created date index data".
Record in the 93/02/05 area. When recording on both index data is completed, the result is as shown in FIGS.

Next, as a method of displaying the list on the list display section 6, the first date 1993/02/10 in the "creation date index data" shown in FIG. 7 is displayed in the window. Referring to the address 0000 of the "registered name index data" recorded next to the date information, "---- tatta" and "112 soso" correspond to this, and this is shown in FIG. To display in the window. When the "previous day" key is pressed, it is positioned next to 1993/02/10 in "creation date index data".
Documents corresponding to 1993/02/05 are displayed in a list as shown in FIG. As the function keys in FIGS. 10 and 11, the “previous screen” displays the previous list within the same date, and the “next screen” displays the next list within the same date. Also, "Normal" switches to the normal list display by registration number, "Previous day" displays the list of the previous day of the current target date, and "Next day" displays the list of the next day of the current target date. To do.

When the "next day" key is pressed, the original documents corresponding to 1993/02/10 are displayed in a list. In the list display of documents corresponding to 1993/02/10, even if the "next day" key is pressed, "there is no document created on February 10, 1993" because the next date does not exist. Will be.

[0040]

Since the word processor according to the present invention has the above-described configuration, it is possible to efficiently find the document registered on the document file and created on what month and day. In addition, it is convenient when deleting a document created on what month and day from a document file, when calling all, copying to another document file, or printing.

[Brief description of drawings]

FIG. 1 is a schematic configuration diagram of a word processor system of the present invention.

FIG. 2 is a call mode screen displayed on a list display unit according to the present invention.

FIG. 3 is a part of a flowchart showing the processing contents of a word processor of the present invention.

FIG. 4 is another part of the flowchart showing the processing contents of the word processor of the present invention.

FIG. 5 is a diagram showing registered contents of a document file according to the present invention.

FIG. 6 illustrates a creation date storage buffer according to the present invention.

FIG. 7 is a diagram showing creation date index data according to the present invention.

FIG. 8 is a diagram showing creation date index data after recording a pointer according to the present invention.

FIG. 9 is a diagram showing registered name index data according to the present invention.

FIG. 10 is a diagram showing a list display by date displayed on a list display unit according to the present invention.

FIG. 11 is a view showing another list display by date displayed on the list display unit according to the present invention.

[Explanation of symbols]

 1 Document File 2 Creation Date / Registered Document Name Reading Means 3 Creation Date Storage Buffer 4 Date Order Sorting Means 5 Creation Date Index Memory 6 List Display 7 Registered Name Index Memory 8 Recording Pointer Calculator

Claims (1)

[Claims] 1. Input means capable of registering document data in a document file such as a floppy disk or memory card, reading means for reading creation date / registered document name from the document file, and creation date information read by the reading means. A creation date storage buffer for storing the created date information, a date order sorting means for sorting the creation date information stored in the creation date storage buffer with the newest one at the beginning, and the sorted date information for the date data. There is a creation date index memory for recording in the storage position, and a registration name index memory for recording registration names read in order from a new date by the creation date / registered document name reading means in the storage position of the registration name data. Recording destination pointer calculation means for acquiring the registered name corresponding to the date by referring to the pointer, and the acquired registration A word processor that consists of a list display that displays names with the date of creation.