JPS59188739A - Address retrieving device - Google Patents

Abstract

PURPOSE:To send a line feed instruction after a pint instruction so as to avoid misprints with an address retrieving device, by dividing address element data with data sectioning codes and detecting the existence and number of line feed codes at every line of address blocks which are compared with retrieving key address element data and retrieved. CONSTITUTION:At n101 of the flow chart of a coincident block subroutine, skip mark codes in he first line of blocks stored in an RAM area are counted and a skip mark counter SMC used for this counting operation forms a line-wise line feed code detecting means. Then a command which prints out the data of the line is outputted to a printer 5 (n202) and, in addition to the command, another command which makes line feed by the number of the skip mark codes counted at n101 is outputted.

Description

DETAILED DESCRIPTION OF THE INVENTION (a) Technical Field The present invention relates to an address search device that can automatically search for three desired addresses from a pre-registered address file.

(b) Prior Art In conventional address search devices, the format of each address block in an address file is fixed. For example, as shown in FIG. Postal code, address in areas M2-M4, area M5. M6
I was trying to register my name. However, in such a fixed format, the input order is fixed when registering each address element data, and it is difficult to input data such as putting a telephone number between the address and the name, or after the name. It is not possible to register data flexibly, and when an address or name becomes very long, the format and amount of input data that can be stored in a predetermined area is limited.

(C) Purpose of the Invention The purpose of the present invention is to make address blocks free-form by using data delimiter codes, improve the flexibility and ease of handling of address element takes, and improve the ease of handling of address blocks. To provide an address retrieval device which can reduce the burden and further prevent printing in line spacing format or printing defective data by inserting a line feed code into an address block as appropriate.

(d+ Structure of the Invention In summary, the present invention consists of an address block consisting of a data group in which address element data is stored in a storage area having a certain size in the order of input via a data delimiter code, and when searching, each Each address element data in the address block is separated by a data delimiter code and compared with the specified search key address element data, regardless of the type of data entered at the time of data registration and the length of the data. Regardless of the format, data can be input in the desired format, and when searching, each address element data is divided using a data delimiter code, and the divided address element data is compared with the specified search key address element data. When the searched address block is printed out, the presence/absence and number of line feed codes in the address block are detected for each line of the address block. a line feed code detection means, and when the line feed code is detected,
The apparatus includes line feed processing means for outputting a print command for that line to the printer and then outputting a line feed command to the printer to cause the line feed to be performed by the number of detected line feed codes.

(El Embodiment FIG. 2 is an external perspective view of an address retrieval device that is an embodiment of the present invention.

In the figure, 1 is the search device body, 2 is the keyboard, and 3 is the main body of the search device.
4 is a dot matrix liquid crystal display, 4 is a floppy disk device, and 5 is a printer.

The floppy disk device 4 registers the address file, the dot matrix liquid crystal display 3 displays and outputs the input data and the search data, and the printer 5 displays the search data when the print mode is specified at the time of search. The roll loaded into the printer 5 is a label roll in which labels of a certain size are continuously pasted on a backing paper, and after printing, if the labels are peeled off from the backing paper, This makes it possible to immediately attach the label to an envelope or the like.

FIG. 3 is a professional diagram of the above address retrieval device. In the figure, Otsu 10 is a CPU, and I10 devices include a keyboard 28, a display 3. An FD control unit 1 to which the printers 5 are connected and which controls the floppy disk 4
1 is connected.

Further, 12 is a ROM that stores a control program, and 13 is a RAM to which a work area and the like are allocated.

FIG. 4 is a diagram showing the main part of the RAM 13. As shown in FIG. Area M
The BI stores message contents to be appropriately displayed on the dot matrix display 3. The message content is “
There are such things as ``Kinyuryoku OKJ''. In area MB2,
Management data indicating the address file registration status of the floppy disk device 4 is stored. Area MB3 constitutes a registered block buffer and has a size of one block of 40 columns x 6 lines. Area MB4 stores search key address element data or registered teeth to be searched during a search. Area M
B5 stores one block worth of address blocks (hereinafter simply referred to as blocks) read from the floppy disk device 4. Area MB6 is used when there are multiple blocks searched by the key data or registered teeth stored in area MB4, that is, when there are multiple blocks corresponding to the key data or registered teeth set in area MB4. , stores data specifying its calling order as a fixed criterion. 5 when the setting data is 1
The corresponding blocks are called in alphabetical order. When the setting data is 2, the corresponding blocks are called in the order of the designated codes assigned to each block in advance. Further, when the setting data is 3, it is assumed that there is no designation and calls are made at random. In addition, each block is automatically assigned a 50-syllabary code and a designation code such as a postal code when it is registered, and when searching, the calling order designation data is set to 1.
When this is the case, calls will be made in the order of the 50 syllabary codes with reference to the 50 syllabary code, and when the calling order designation data is 2, the calls will be made in the order of the designated codes such as this postal code.

Data specifying a search method is set in area MB7. When the setting data is 1, the search is performed using the search key address element data stored in the area MB4. Also, when the setting data is 2, the above area MB
Search is performed using registered teeth set to 4. Area MB8 stores one program's worth of address blocks to be displayed or printed as a result of the search. The HIMB9 stores a 50-syllabary code or a designation code attached to at least one searched address block. The searched blocks are rearranged in this area MB9.
This is done based on all the 50-note codes stored in the 50-note code or a specified code.

Note that when the calling order designation data set in area MB6 is 1, a 50-sound code is stored in area MB9, and when the calling order designation data is 2, a designation code is stored in area MB9. Area MBIO
All search blocks are stored.

In the above memory configuration, the area MBI is made up of non-volatile memory, and the message contents are continuously saved.

Furthermore, the management data in area MB2 is automatically read from the floppy disk in registration mode, search mode, or print mode, as will be described later. Also, area MB4 and area MB6. Data input from the keyboard 2 in search mode and print mode is stored in MB7.

Next, Figures 5 to 10 show the operating procedure of the address retrieval device.
This will be explained with reference to the flowchart shown in the figure. First, the fifth
In the figure, when the power is turned on, the system initializes by clearing the memory in step 7, step nl (hereinafter, step ni is simply referred to as ni), and then returns to step n2.
The key OKJ message is taken out from the area MBI and displayed on the dot matrix display 3. Then, at n3, the state is set to accept manual key power, and if there is manual key power, each subroutine from n5 to nlO is executed depending on the content of the operated key. In the registration mode in which n5 is executed, free format registration is performed with 40 columns and 6 lines as one block. In the search mode in which n6 is executed, each block is sequentially read from the floppy disk one block at a time based on the search key address element data set in the area MB4 and stored in the area MB5, and the matching blocks are stored in the area MBIO. The matching blocks are then sorted in the order of calling and displayed on the dot matrix display 3 in order from the first block. n
In the print mode in which step 7 is executed, matching blocks are searched from the floppy disk and stored in the area MBIO in the same manner as n6 above, and the matching blocks are rearranged in the order of calling and printed out in order. In the copy mode in which n8 is executed, file data is copied between floppies. In the clear mode when n9 is executed, all file data on the floppy disk will be erased. In the list mode in which nlO is executed, all files registered on the floppy disk are printed out.

FIG. 6 is a flowchart of a subroutine for executing registration mode. When the registration mode is entered, management data indicating the registration status is first stored in the area MB2 from the disk as nil. Check the management data at n12, and if there is a free file, proceed as n12 → n13 → n14, and if there is no free file, n 12-”n 13-n 15
and proceed. If there is no free file, use n15 to save MB of space.
From I, take out the message for disk full j, display it on the dot matrix display 3, and return to nil if the disk is replaced.When it is determined in n13 that there is a free file, accept the key input of the registered data in n14. At this stage, the operator continuously inputs address element data such as postal code, prefecture name, name, town name, etc. via the data delimiter code.The input data consists of 40 digits x
The registration block data in area MB3 having a size of 6 lines is stored in the sofa, and when all necessary address element data has been input, the registration block data stored in area MB3 is saved to a floppy disk (n 1
8). Then, if the end key is not pressed, n 19-'
Proceed to n 12 and move on to the next registration. If the end key is pressed, it is assumed that the registration operation is completed and the process returns.

Note that if a skip mark is input when inputting the address element data in step n14, line feed is automatically performed by the number of input skip marks during printing, as will be described later. In this embodiment, this skip mark code corresponds to the line feed code. If the total of print lines and feed lines exceeds 8, or if the total of print lines exceeds 6, printing for that block will automatically end, so set the skip mark appropriately at the input stage. By inserting it, you can print out only the necessary address element data. The details of the printout operation of the block including the skip mark will be described later.

Furthermore, when all address element data is input in step n14, a 50-syllabary code and a designation code are automatically added to the address block. The criteria for determining the 50-sound code and the designated code can be set in advance; for example, the first letter of a name can be set as the 50-sound code, and the postal code can be set as the designated code.

FIG. 7 is a flowchart when executing the search mode. When entering the search mode, first in n20, calling order designation data is sent to area MB6. As mentioned above, the calling order specification data is data that specifies the method of sorting all the blocks called from the disk based on the search key address element data, and when the data is 1, it is sorted in alphabetical order, ″r：
When it is 3, it is treated as sorting in the specified code order, and when it is 3, it is treated as not being sorted. Subsequently, in n21, a search method is specified. As mentioned above, this designation data is data that determines whether to perform a search using key data or registered teeth, and when the designation data is 1, a search is performed using key data, that is, using search key address element data. A search is performed, and when it is 2, a direct search is performed using registered teeth. In n22, search method specification data is 1
When the search key address element data is 2, the registered tooth is accepted and set in the area MB4 when the search method designation data is 2. Note that the search key address element data can be combined with a plurality of pieces of data using OR logic or AND logic. Similarly, for registered teeth, multiple pieces of data can be combined using OR logic.

After setting each data necessary for the search as described above, the management data is then read from the disk and stored in the area MB2 (n23). The reason why the management data is stored in the area MB2 at this stage is to omit the search for empty files in the following search operation and to shorten the search time as much as possible.

The search operation is performed after first reading the search method designation data stored in the area MB7 at n24 and distinguishing whether the search is based on the search key address element data or the registered floor. In the case of a search using search key address element data, the process proceeds from n24 to n25, where the calling order designation data stored in area MB6 is determined. When the specified data is 1 or 2, the process proceeds to n26, and when the specified data is 3, the process proceeds to n27. When the calling order designation data is 1 or 2, the first block is read from the disk in n26 and stored in area MB5, and in n28, the plurality of address element data stored in that block and the data stored in area MB4 are read. If there is even one address element data that matches the search key address element data in the block, the matching block is moved to area M at n30.
At the same time, the 50-syllabary code or specified code of the block is stored in the area MB9. As mentioned above, each block is automatically assigned a 50-note code or a specified code, so in n30, this 50-note code and specified code are called and the area M
Stored in B9. In this case, when the calling order designation data set in n20 is 1, the 50-sound code is stored, and when it is 2, the designated code is stored. Blocks that do not include search key address element data are ignored and skipped from n29 to n31. And n2
When the management data called in step 3 is referred to and the search processing of n26 to n30 for all valid blocks in the disk is completed, an END code is added to the end of the 50-sound code or specified code stored in area MB9. Then (n32) proceed to n33. Area MB in n33
Order processing, that is, sorting, is performed based on the calling order designation data set in No. 6. And n34
The first block is displayed at n34, and when the search key is pressed, the sequence advances from n35 to n33, the next block is stored in the area MB8 by sequential processing, and the block is displayed at n34. Above n33. Steps n34 are repeated until the end key is operated, at which point the process returns.

FIG. 8 is a flowchart of the sequential processing subroutine executed at n33. In this subroutine, the above n3
0, the block with the highest rank is selected from all the 50-sound codes or designated codes stored in the area @MB9 and stored in the area MB8. First, n50. At n51, address pointers A and B of the 50-syllabary code storage area or designated code storage area in area MB9 are initialized. As shown in FIG. 11, address pointer B specifies the next address of address pointer A, and when address pointer A specifies the start address of area MB9, address pointer B specifies the next address of area M8.
The next address after 9 is specified. Now, when n50 is executed for the first time, if address pointer A is set to 0, then n50. In n51, address pointer A=1. B=2, and as shown in FIG. 8, address pointers A and B point to the start address and next address of area MB9, respectively. address pointer A,
When the setting of B is completed, it is determined in n52 whether the data in the area specified by address pointer B is an END code. , if it is not an END code, the 50-syllabary code or designated code of the area designated by address pointers A and B is compared in n53. At this time, when the calling order designation data stored in the area MB6 is 1, the pentagram codes are compared, and when it is 2, the designation codes are compared. If the 50-syllabary code or specified code of the area specified by address pointer A is higher in rank than the 50-syllabary code or specified code of the area specified by address pointer B, the address pointer B is incremented by pressing n55;
Return to n52 again. Also, if the 50 syllabary code or specified code specified by address pointer A is
If the order is lower than the 5 o note code or specified code, the two are exchanged at n54, the address pointer B is incremented at n55, and the process returns to n52. That is, first, the first address of area MB9 and the next address are compared with each other's 50-on code or specified code, and if the order of the 50-on code or specified code in the area of the first address is higher, it is left as it is, and the next address is If the 50-on code or specified code of the address is larger than that of the first address, those 50-on codes or specified codes are exchanged. Then, the address of the area specified by address pointer B is updated, and the same process as above is performed so that the highest-ranked 50-syllabary code or specified code is always set in the area specified by address pointer A. Make it. Therefore, address pointer A is now in area MB9.
When specifying the start address of
If step 55 is repeated until address pointer B detects the F or ND code, the first address of area MB9 will be:
The 50-sound code or designated code of the block with the highest calling order among the searched target blocks is set. Address pointer B/'l at n52
< When the E N D code is detected, the block data corresponding to the 50-syllabary code or the specified code in the area specified by the address pointer A at that time is transferred to the area MB at n56.
When the search key is pressed again after the selected block is displayed at n34 by the above sequential processing operation in which the selected block is selected from IO, stored in area MB8, and returned, the address pointer A is set at n50 in the subsequent sequential processing. To be updated, the 50-on code or designated code corresponding to the block with the next highest calling order from among the remaining 50-on data or designated codes excluding the 50-on code or designated code set at the start address of area MB9. is set to the address next to the start address of area MB9.

Therefore, each time the search key is pressed, the address pointer A is incremented by one, and the 50-sound code or designated code corresponding to the block having the highest calling order is set in order from the first address of the area MB9. Then, the sorting ends when the number of updates of address pointer A matches the number of search blocks stored in area MBIO. When the rearrangement is completed and the key is pressed, the address pointer A again specifies the start address of the area MB9, and the same operation as above is repeated. FIG. 12(A) shows the area MB9 when a total of 8 search blocks are rearranged in the order of 50 syllable data.
(B) shows the memory state when the search blocks of 8t[lil are rearranged in the specified code order.
The storage status in MB9 is shown.

In n25 of FIG. 7, when it is determined that the calling order specification data of area MB6 is 3, the calling order is not specified. Therefore, each address element data of the block read from the disk in n27 and area MB4 Compare the set search key address element data (n37)
, if there is a block that includes search key address element data, store that block as is in area MB8 and display it n39. n40) If the search key is further operated to continue the search, the process returns to n27 and continues the file search unless all blocks in the disk are completed. Therefore, when proceeding to n25-+n27, each time the corresponding block is searched from the disk, it will be displayed as is.

On the other hand, when the search method designation data set in area MB7 at n24 is 2, that is, the search method using registered teeth is specified, the process proceeds from n24 to n43, and the block of the corresponding registered tooth is directly read from the disk, and the search method specified in area MB7 is set.
Set to 10. Further, in n44, the 50-sound code and designated code attached to the block set in the area MBIO are stored in the area MB9 together with the END code. Then, execute the order processing subroutine of n33,
Based on the 50-sound code or specified code stored in the area MB9, the data is sorted in the order of the 50-sound code or in the specified code according to the calling order designation data set in the area MB6, and the rearranged data is stored in n34.
During the above operation of displaying data in n28 and n37, as shown in FIG. This is performed using the set search key and address element data. Therefore, when the i-th block Qi is read from the disk in n26 or n27, the address element data AI located at the first address of the block is first compared with the search key address element data, and then the data A2 in the second row.
Furthermore, data delimiter code P4. The data A3 classified by P2 and each search key address element data are sequentially compared. Then, if there is matching address element data,
The block is regarded as the target block and the area MBIO is
Store in. In this way, by freeing the setting format of the address element data of each block and separating each piece of address element data with a data delimiter code, comparison with the search key address element data can be performed very easily. In other words, if the setting format of address element data is fixed, a program is required to determine where within a block the data to be compared with the search key address element data is set. If you set the address element data to a free format, such a program is not necessary at all, and simply by providing a judgment means that can distinguish the data delimiter code from other data, you can easily compare it with the search key address element data. I can do it. In addition, the first
As shown in Figure 3, in this example, the data delimiter code is
It includes normal data delimiter codes represented by P1 to P6, and skip codes represented by P7 and Pi. As described later,
The skip codes P7 and Pi are the data delimiter codes described above, and also serve as codes for instructing skipping of print lines during printing.

By the above operating procedure, it is possible to easily search each address block in which address element data is set in a free format. Furthermore, it is easy to change the calling order to the alphabetical order or the specified code order, and furthermore, it is possible to directly perform a search by registered teeth as well as a search by the usual search key address element data.

Next, the operation in the print mode will be explained with reference to the flowchart in FIG. The operational procedure during print mode differs from the operational procedure during search in FIG. 7 in steps n34. The point is that the display step n40 is replaced by the matching block print step n74-, n80. FIG. 10 shows a flowchart 1 of this matching block print subroutine. The matching block print subroutine is a routine in which the blocks stored in the area MB8 by the sequential processing subroutine shown in FIG. 8 are printed out on label roll paper by the printer 5. Furthermore, as described above, this routine also performs line feed processing by referring to the skip mark code in the block. First, in n1oO, R
Reset the skip mark counter SMC assigned b3 to AM13, and continue (in n101, the area M
Count the skip mark code in the first row of data of the block stored in B8. In this embodiment, this skip mark counter SMC constitutes line-by-line line feed code detection means. Next, a command to print out the data of that line is output to the printer 5 (n202), and a command to feed the line by the number of skip mark codes counted in n101 is output.

As a result, if the total number of printed lines and the number of line feeds is 8 or more, this matching block print subroutine ends and returns; if it is 8 or less, the total number of print lines is 6 in n105. , and if it has not reached 6, nLO is executed again.
Return to o. If the total number of print lines reaches 6,
Finish this subroutine and return. FIG. 14 shows an example of the matching block Qi stored in the area MB8. In the figure, address element data A1 is a postal code,
Address element data A2 to A7 are address data, address element data A8. A9 is name data, address element data AIO~A
12 constitute telephone number data, and the third line has a skip mark code P7 of 1 (hard), and the fourth line has three skip mark codes P8 to PLO inserted.

When printing out the above-mentioned flock Qj using the subroutine shown in FIG. A command to print out the data of A5 to A5 in order is output to the printer 5, and a command to print out the data of 86 and A7 is further output on the third line. Since the skip mark counter SMC is set to 1 by the skip mark code P7 when the printer 5 prints out the data of A6 and A7 on the third line, the printer 5 prints out the data A6. After printing A7, perform line feed once. Therefore, the next name data for A8 and A9 will be printed on the fifth line of the label. Since the skip mark counter SMC is set to 3 by the skip mark codes P8 to PLO when printing this name data, the printer 5 performs line feeding three times after printing the name data.

As a result, in n104, the total number of print lines and the number of feed lines is 8, so the output of the print command for this block is ended without printing the telephone number data Al0-Al2. By appropriately inserting a skip mark code in registration mode, printing out of unnecessary data can be prohibited, and as in the example above, name data is printed on the 5th line. Any number of blank lines can be formed in a label by simply inserting a skip mark code without providing a single blank space in a block. Furthermore, in order to perform line feeding by the number of skip mark codes, for example, if skip mark codes are inserted in the first and third lines of FIG. 14, when data A1 to A9 are printed on the label, the data A1 and data A2-A
5 and data A6. AV and data A8. Since one blank line is formed between A9 and A9, the printed state can be made very easy to see. In this way, by appropriately inserting skip mark codes, printing formats different from block formants can be created.
That is, it is possible to print out data in a print format that prohibits printing of unnecessary data or in a print format with blank lines.

By the way, as mentioned above, in the order processing and matching block print subroutines, all search blocks stored in area MB10 are not sorted and printed at the same time, but in the order processing subroutine n73, they are printed at that point. The block with the highest rank is selected, and the matching block print subroutine of n74 issues a print command for the selected block. Therefore, after a print command is issued at n74, the process returns to n73 and selects the next highest block, so n7 is used during actual printout.
3 sequential processing steps can be executed. That is,
The sequential processing procedure of n73 and the printout by the printer 5 are executed in parallel. Therefore, the processing time becomes extremely short, and even when there are many search blocks stored in the area MBIO, blocks are printed out continuously to the extent that the apparent order processing time of n73 above can be almost ignored. I'm getting lost. In this way, in the sequential processing procedure of n73, only the block with the highest rank at that time is selected, and the printout command for that block is issued in n74, so the processing time required for the search is minimized. It has the advantage of being short.

(f) Effects of the Invention As described above, according to the present invention, an address block is composed of a data group in which address element data is stored in a storage area having a certain size in the order of input via a data delimiter code, When searching, each address element data of each address block is separated by a data delimiter code and compared with the specified search key address element data, so the input format and amount of address element data can be freely set. It is possible to respond extremely flexibly to cases where addresses and names are extremely short or extremely long, and the usability is greatly improved. In addition, when searching, the program is extremely simple because each address element data separated by a data delimiter code is simply compared with the specified search key address element data in order, which has the advantage of greatly reducing the burden on the software. be. In addition, a line feed code detection means for each line is provided, and the next line is printed after infeeding the number of detected line feed codes, so line feed codes can be entered as appropriate when registering address element data. By simply setting this, printing using the line spacing format can be easily performed, and it is also extremely easy to prevent data that does not need to be printed from being printed.

[Brief explanation of drawings]

FIG. 1 is a diagram showing the address block form of a conventional address search device. Fig. 2 is an external perspective view of an address retrieval device according to an embodiment of the present invention, Fig. 3 is a block diagram of the same address retrieval device, Fig. 4 is a configuration diagram of main parts of the RAM 13, and Figs. Each figure is a flowchart showing the operation procedure of the same address search device, FIG. 11 is a diagram showing the relationship between area MB9 and address blanks A and B, and FIG. FIG. 12 is a diagram showing the storage state in area MB9 when rearranged in the order of 50 syllable data.
B) is a diagram showing the storage state in area MBQ when the above eight search blocks are rearranged in the order of specified codes, No. 13
14 are diagrams each showing an example of the address element data storage state in the search block Qi. Applicant: Daio Kai, Agent Patent Attorney: Hisao Komori Figure 2 Figure 4 Figure 5

Claims (1)

[Claims] (1) An address file in which address element data such as postal code 2 prefecture name is stored in blocks for each address, and an address block containing the search key address element data specified at the time of search is searched from the address file and displayed, or In an address retrieval device that outputs a printout, the address block is composed of a data group in which the address element data is stored in a storage area having a certain size in the order of input via a data delimiter code,
When searching, each address element data of each address block is separated by a data delimiter code and compared with the specified search key address element data, and when the searched address block is printed out, the address block is line-by-line line feed code detection means for detecting the presence or absence and number of line feed codes in each line of the address block;
and a line feed processing means for outputting a print command for the line to the printer when the line feed code is detected, and then outputting to the printer a line feed command to cause line feed by the number of detected line feed codes. Device.