JPH0470994A - Electronic cash registor - Google Patents

Abstract

PURPOSE:To reduce excess area and to effectively utilize a memory by composing a second storage means of more than one block making up a constant number of merchandise into one block. CONSTITUTION:An unpaid information file 32 is divided into common area 31 of an unpaid information file storing the sum of money, etc., and a menu file 33 storing registered menu (merchandise). This menu file 33 is composed of a constant number of menu blocks 34, and an arbitrary number of menu blocks 34 can be used in one unpaid information file 32, and either of unpaid information files 32 can use the menu block 34 when there is an unused menu block 34. So, when the number of menu increases to run short of the one block, a new block can be added and it is not necessary to fix the number of menu per one unpaid information file 32. Thus, the excess memory is reduced and the memory can be effectively used.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to an electronic cash register used in restaurants and the like.

(Prior Art) Conventionally used electronic cash registers first take a customer's order, store the order information in an unpaid information file in the electronic cash register, and then store the order information in an unpaid information file when the customer leaves. The system is configured to call up the unpaid information file, automatically calculate the total amount of the products ordered by the customer, and process the payment.

To this end, conventional electronic cash registers include memory for temporarily storing customer order information. However, because the size of the memory in the electronic cash register varies based on the size of the store, such as the price of the electronic cash register and the number of menus (products), the number of unpaid information files and the By setting the number of menus in advance, the memory area used for the unpaid information file is secured.

In a conventional electronic cash register, the entire memory 11 is configured as shown hierarchically in FIG.

A total unpaid information file 12 is secured in this total memory 11, and this total unpaid information file 12 has 13
As shown in , n unpaid information files GC[1 to G
IJn, and each unpaid information file has an area for storing an amount and m areas for storing menus (products), as shown at 14.

The number n of unpaid information files and the number m of menus are:
It can be set in advance, and this value determines the memory capacity to be secured.

Generally, these values (n, m) vary depending on the size of the store, and are determined by taking the size of the store into consideration when installing the electronic cash register.

Next, the operation of this conventional electronic cash register will be explained.

Here, as shown in FIG. 4, the explanation will be made assuming that the number n of unpaid information files is 5 and the number m of menus is 6.

First, when coffee is registered in the unpaid information file GC[1, this unpaid information file GCK1 is
The state shown in 22 changes to the state shown in 23, and is then temporarily tightened. Next, if there is an additional order, it will be added to the previous file as shown at 24.

The same process is carried out until the customer settles the payment, and when the customer leaves, the unpaid information file GCKI is called and the amount is automatically calculated, and once the payment is made, the unpaid information file GCK1 is deleted. .

(Problem to be Solved by the Invention) However, in such conventional electronic cash registers, even though the number of menus per unpaid information file m can be set, once it is set - degree, it becomes fixed. Even if the number of menus per unpaid information file is small, there is a problem in that a wasted area is created in the memory to secure memory for the set value.

Normally, the number of menus that are set is set to be large enough to prevent registration failures, resulting in a considerable amount of wasted area.

The present invention was devised to solve these conventional problems, and an object of the present invention is to provide an excellent electronic cash register that can reduce wasted area and make effective use of memory.

(Means for resolving charges) In order to achieve the above object, the present invention stores an unpaid information file, a common area of the unpaid information file that stores amounts, etc., and registered menus (products). This menu file is separated into
Consists of a certain number of menu blocks, any number of menu blocks can be used in one unpaid information file, and if there are any unused menu blocks,
The menu block is configured so that any unpaid information file can use the menu block.

(Operation) According to the present invention, the common area of the unpaid information file and the menu file are separated by the above-described configuration, and the menu file is connected to the unpaid information file in blocks, so that the number of menus increases. However, if one block is insufficient, a new block can be added, and there is no need to fix the number of menus per unpaid information file, and many types of menus can be registered. Even when the number of menus per unpaid information file is small, unused blocks can be used in other unpaid information files, so memory waste can be reduced and memory can be used effectively.

(Embodiment) The electronic cash register of the present invention includes an input means for inputting product registration, sales amount, etc., a storage means for storing manually entered products, sales memory, etc., and a memory means for calling up the stored information. It is provided with a calling means and an erasing means for erasing the called information, and further has a file structure as shown in FIG.

In FIG. 1, 31 is a common part of the unpaid information file GCK, and 32 is the content of the common part of 1 unpaid information file, which is composed of unpaid information file number L1, amount, handler, etc. It has a menu block number that indicates which menu block is used.

33 is a menu file composed of n menu blocks, and 34 indicates the configuration of one menu block, which has multiple menu columns and a menu block number column that continues at the end. are doing.

Next, the operation will be explained based on the flowchart shown in FIG.

(1) Enter the customer number corresponding to the table, etc. (2)
) Secure area L in the common section 31 of the unpaid information file. (3) Register the menu.

(4) Search for an empty menu block in the menu file 33, (5) When the empty area I is found, write the menu block number l to the unpaid information file 32, (6) Write the registered menu (7) An additional order is placed and the next menu is registered. (8) Search for an empty area within the menu block 34.
(9) As long as there is free space, the registered menu is written into the free menu block 34; (10) If there is no free space within the menu block 34, an unused menu block within the menu file 33 is written. (11) When a new unused menu block is found, the number of the new menu block is written at the end of the previous menu block 34, and the registered menu is written in the new menu block 34. (12) If no unused menu block is found in the menu file 33 in step (10), a message "r memory full" is displayed; in this case, registration is not possible.

Repeat the above series of operations.

(Effects of the Invention) As is clear from the description of the above embodiment, one unpaid information file can register menus as long as there is a menu block 34, and in an unpaid information file with a small number of menus, menus can be registered. - Since only one block is required and the number of menus per unpaid information file is variable, memory can be used effectively without wasting it.

[Brief explanation of drawings]

FIG. 1 is a memory configuration diagram in an embodiment of the electronic cash register of the present invention, FIG. 2 is a flow chart used to explain the operation of the embodiment, and FIGS. 3 and 4 are: FIG. 2 is a memory configuration diagram in a conventional electronic cash register. GCK common part menu file 31...Common part of unpaid information file (first storage means) 32...1 Unpaid information file 33...Menu file (second storage means) 34
...Menu block Figure 3

Claims (1)

[Claims] (1) Input means for inputting product registration, sales amount, etc.;
In an electronic cash register comprising a storage means for storing input products, sales amounts, etc., a calling means for calling the stored information, and an erasing means for erasing the retrieved information, the storage means is inputted. The second storage means is separated into a first storage means for storing the purchased products and a second storage means for storing the price, etc., and the second storage means is divided into one or more storage means for storing a certain number of products together as one block. An electronic cash register characterized by being composed of blocks.