JPH0556191A - Retrieving method of shortening area code retrieving time - Google Patents

Abstract

PURPOSE:To turn a table retrieving range narrow so as to shorten retrieving time at the time of retrieving an area code with a telephone set having a charging calculation function. CONSTITUTION:A starting pointer 1 and an ending pointer 2 are respectively set at the head and the ending of an area code table 3 before starting to table- retrieve the area code. Then, first dialling make the starting pointer to retrieve the area code dialled first down from 1 and up from the ending pointer and to set a result to a starting pointer 4 and an ending pointer 5. Next retrieving is executed in a range between the starting pointer 4 and the ending pointer 5. The retrieving range is turned narrow by repeating it so as to shorten retrieving time.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for shortening the area code search time in a telephone which calculates charges by searching an area code table.

[0002]

2. Description of the Related Art FIG. 2 shows a conventional area code search procedure. In FIG. 2, 11 is a start pointer for starting the table search, which is pointed to by the area code table 12. Reference numeral 13 is a start pointer for starting the next search when "0" is dialed in the state of FIG. 2 (A) and is pointed to in the area code table 14. Next, the operation of the above conventional example will be described. At the time of starting the search, the start pointer 11 points to the beginning of the area code table 12. If you dial "0" here, the start pointer 11
From the lower part of the area code table, the start pointer 13 is searched for the number "0"
Move to position. As described above, in the conventional area code search method, it is possible to find the area code by repeating the search for the dialed numbers 1st, 2nd ... until the end of the table based on the start pointer. Met.

[0003]

However, the above-mentioned conventional area code search method has a problem that it takes a long time to search from the start pointer to the end of the table. The present invention solves such a conventional problem, and an object of the present invention is to provide a shortened area code search time search method that can shorten the search time.

[0004]

In order to achieve the above object, the present invention provides an end pointer at the end of the search range,
The search range is narrowed down.

[0005]

Therefore, according to the present invention, the search is repeated each time dialed, so that the search range is narrowed and the search time is shortened.

[0006]

DESCRIPTION OF THE PREFERRED EMBODIMENTS FIG. 1 shows the procedure of area code search in an embodiment of the present invention. In FIG. 1, 1 is a start pointer that indicates the beginning of the search range at the start of the search, and 2 is an end pointer at the start of the search, which indicates the area code table 3. Reference numeral 4 is a start pointer that points to the beginning of the search range after the first dial input, and 5 is an end pointer after the first dial input, which points to the area code table 6. Reference numeral 7 is a start pointer that points to the beginning of the search range after the second dial input, and 8 is an end pointer after the second dial input, which points to the area code table 9.

Next, the operation of the above embodiment will be described.
In the above embodiment, as shown in FIG. 1 (A), at the start of the search, the start of the area code table 3 is initialized so that the start pointer 1 and the end of the area pointer 2 are respectively pointed out. For searching, for example, when the first digit "1" is dialed, the binary search is used to move the start pointer 1 downwards and the end pointer 2 upwards. Search from the station number table 3. The search result from above is set to the start pointer 4 and the search result from below is set to the end pointer 5, as shown in FIG. In this state, when the second digit, for example "1", is dialed, the binary search is used to move the second digit "1" downward from the start pointer 4 and upward from the end pointer 5 from the area code table 6. Search for. As shown in FIG. 1C, the search result is the start pointer 7
To the end pointer 8 respectively. 3 in this state
When the second digit, for example, "7" is dialed, the area code table 9 is searched and "117" is found. Thus, according to the above embodiment, the number of searches for the first “1” is 14,
The number of searches for the second "1" is 5, the number of searches for the third "7" is 2, and the total number of searches is 21, which reduces the total number of searches, and therefore the search time can be shortened. In the case of the conventional start pointer only, if a similar search is performed in the area code table of FIG. 1, the number of searches for the first “1” is 14, and the number of searches for the second “1” is 7, 3 The total number of searches for the second “7” is 27.

[0008]

As is apparent from the above-described embodiment, the present invention enables the search range to be narrowed for each search by providing the end pointer, and therefore the number of searches can be reduced, so that the search time can be shortened. Has the effect.

[Brief description of drawings]

FIG. 1 is a diagram showing a procedure of area code search in an embodiment of the present invention.

FIG. 2 is a diagram showing a conventional area code search procedure.

[Explanation of symbols]

1, 4, 7, 11, 13 ... Start pointer, 2, 5, 8 ... End pointer, 3, 6, 9, 12, 14 ... Area code table.

Claims (1)

[Claims] 1. In the area code search of a telephone having a charge calculation function, the start and end of the search range are searched by a binary search, and the search range is narrowed to shorten the search time. How to reduce the area code search time.