JP2001344221A - Electronic computer and storage medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide an electronic computer capable of storing and displaying history even when data exceeding the maximum number of items to be stored as history are inputted and correcting history items and executing reculculation due to the correction by having consistency between operation results and the history and a storage medium storing a program for the electronic computer. SOLUTION: When a new operator is inputted in a state that the maximum number of items is stored in an operational history memory, all items stored in the memory are erased in a step a4. In a step a5, operational results stored in a Y register are stored in a 1st item of the memory and input values and operators stored in an X register and an operator flag are stored in a 2nd item of the memory, so that even when data exceeding the maximum number of items allowed to be stored as history are inputted, the operational history having consistency between the operational results and the history can be stored and displayed.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an electronic computer for performing an operation based on an input numerical value and an operator, and a storage medium for storing an electronic computer program, and more particularly to an electronic computer having a function of holding a calculation history and an electronic computer. The present invention relates to a storage medium for storing an application program.

[0002]

2. Description of the Related Art A desk top addition, subtraction, multiplication and division calculator disclosed in Japanese Patent Application Laid-Open No. 11-66012 has a normal mode and a history mode. In the normal mode, input values are displayed together with input item numbers and total input items. The numerical value and the operator are stored in the history memory for each term. In the history mode, the input numerical value and the operator in the history memory are sequentially displayed and can be corrected, and can be recalculated after the correction. Also,
Currently available electronic desk calculators with a calculation history function include Citizen ST1210 and Casio DJ-100.

FIG. 11 is a diagram showing an operation example of a conventional computer. First, an input operation and a display screen at that time will be described with reference to FIG.

On the display screen, a numerical section 10a for displaying input numerical values and calculation results, a counter section 10b for displaying the number of items of the stored operation history, and a symbol section 10c for displaying key codes such as operators. There is.

(1) Since the screen is in the initial state before the calculation, the numerical value portion 10a of the display device is 0. Since no calculation history is stored, “0” is displayed on the counter section 10b.

(2) By inputting [1] and pressing the [+] key, (, 1) is stored as a calculation history. Since there is one item of operation history, the counter section 10b becomes "1". The operation history stores an operator and a numerical value as one item, and here, one stored item is represented by “(operator, numerical value)”.

(3) By inputting [2] and pressing the [+] key, (+, 2) is stored as a calculation history. Since two calculation histories are stored, the counter section 10b displays "2" and the numerical value section 10a displays "3." which is in the middle of the calculation.

(4) [3] [+] [4] [+]... [1]
When adding in order as [0] [+], (+,
3) (+, 4)... (+, 10) and 10 items are stored in the operation history memory. Since there are 10 operation histories, the counter section displays “10” and “5” indicating that the calculation is in progress.
5. Is displayed.

(5) When [1] [1] [=] is input, the calculation result "66." is displayed. Since the eleventh and subsequent items are not stored in the operation history memory, the counter section remains "10".

Next, FIG. 11B shows the internal state of the operation history memory after the above operation. Only 10 cases ((, 1)... (+, 10) are stored, and the eleventh case (+, 11) is not stored anywhere. Therefore, the calculation result and the calculation history do not match.

As another conventional example, when the calculation result and the calculation history do not match, the calculation history display key and the like are invalidated, so that the calculation history cannot be displayed at all.

[0012]

Problems to be Solved by the Invention
In Japanese Patent Laid-Open Publication No. 2002-115, there is no particular reference to the operation when the number of inputs exceeds the size of the history holding storage means. When the number of items entered as described above exceeds the maximum number of items that can be stored in the history, the electronic desktop calculator that is actually sold displays only the history of the number of items that can be stored or displays the history. Either could not at all.

As described above, since only the history of the number of items that can be held is held, only a part of the items actually input can be confirmed, and the calculation result and the display derived from the expression held in the history are displayed. There is no consistency with the calculation result displayed in the section. Further, since there is no consistency, it is not possible to perform correction of the history item and recalculation associated therewith.

An object of the present invention is to store and display a history even if there is an input exceeding the maximum number of items that can be stored in the history. An object of the present invention is to provide a computer capable of performing a correction and a recalculation accompanying the correction, and a storage medium storing a program for the computer.

[0015]

According to the present invention, there is provided an input numerical value storage means in which an input numerical value is written, an operator storage means in which an input operator is written, and an operation result storage means in which an operation result value is written. And an operation history storage unit that stores an input numerical value and an operator as one item, and stores each item from a predetermined history item start position to a preset maximum number of items in the order of input. And the operator is written in the operator storage means, the value stored in the input numerical value storage means and the input operator are stored in the operation history storage means, and the value of the operation result storage means and the value of the input numerical value storage means are stored. Are calculated on the basis of the input operator, and the calculation result is written in the calculation result storage means. In the state where the operation history is stored, when an operator is input, the computer program deletes all the items stored in the operation history storage unit, and stores the input numerical value storage unit and the operator storage unit. And an input numerical value, an operator, and an operation result stored in the operation result storage means are stored in the operation history storage means.

According to the present invention, when an operator is input while the maximum number of items is stored in the operation history storage means, first, all items stored in the operation history storage means are deleted. Next, the operation result stored in the operation result storage unit is stored in the operation history storage unit, and the input numerical value and the operator stored in the input numerical value storage unit and the operator storage unit are stored in the operation history storage unit. Therefore, even if there is an input exceeding the maximum number of items that can be stored in the history, it is possible to store and display the history having consistency between the operation result and the history.

Further, according to the present invention, when it is determined that the number of items stored in the operation history storage means exceeds the maximum number of items by input of an operator for creating two or more items, the computer program is executed in advance. All the items stored in the operation history storage unit are deleted, and the input numerical value, the operator, and the operation result stored in the input numerical value storage unit, the operator storage unit, and the operation result storage unit are stored in the operation history storage unit. It is characterized by the following.

According to the present invention, when the operation history storage means exceeds the maximum number of items due to the input of a new operator for creating two or more items, all the items previously stored in the operation history storage means are deleted. I do. Since the calculation result stored in the calculation result storage means is stored in the calculation history storage means, and the input numerical value and the operator stored in the input numerical value storage means and the operator storage means are stored in the calculation history storage means, Even if there is an input exceeding the maximum number of items that can be stored in the history, it is possible to store and display the history with consistency between the operation result and the history, and whether the number of items exceeds the maximum number of items that can be stored in the history. It is possible to eliminate useless processing for determining whether or not to perform the determination.

According to the present invention, there is provided an input numerical value storage means in which an input numerical value is written, an operator storage means in which an input operator is written, an operation result storage means in which an operation result value is written, an input numerical value and an operator. And an operation history storage means capable of storing each item from a predetermined history item start position to a preset maximum number of items in the order of input, and when an operator is input, the operator is operated. The value stored in the input storage unit and the value stored in the input value storage unit and the value of the input value storage unit are stored in the operation history storage unit. In a storage medium for storing a computer program for performing a calculation based on an operator and writing the calculation result to the calculation result storage means, the calculation history is stored in the calculation history storage means up to the maximum item. In this state, when there is an input of an operator, the computer program executes an operation based on the first item and the second item stored in the operation history storage means and puts it into the first item. , By transferring each item stored thereafter to the previous item one by one, making a space in the last item of the operation history storage means, and storing the item generated by the input there. It is a storage medium.

According to the present invention, when an operator is input while the operation history is stored up to the maximum item in the operation history storage means, the first item and the second item stored in the operation history storage means are input. By executing the calculation of the items, the items are collected into one item and stored in the calculation history storage unit. Newly generated items are stored in the free space created by transferring each item stored thereafter to the previous item one by one, so the history storage and display with consistency between the calculation result and the history Is possible.

Further, according to the present invention, when it is determined that the number of items stored in the operation history storage means exceeds the maximum number of items by inputting an operator for creating two or more items, the computer program executes the operation. Of the items stored in the history storage means, the operations for the number of items exceeding the maximum number of items by the input are executed from the first item and summarized into the first item, and each item stored thereafter is set to the maximum number of items. In this case, at the end of the operation history storage means, a space for the number of items exceeding the maximum number of items is created, and the items generated by the input are stored there. .

According to the present invention, when the operation history storage means exceeds the maximum number of items due to the input of a new operator for creating two or more items, of the items stored in the operation history storage means, By executing calculations from one item up to the number of items exceeding the maximum number of items by the input, the items are collected into one item and stored in the calculation history storage means. The newly created items are stored in the free space created by combining multiple items into one and transferring each item to be stored thereafter by the number of items that exceeds the maximum number of items before. And display of a history having consistency with the history. Further, it is possible to eliminate unnecessary processing for checking whether or not the maximum number of items that can be stored in the history has been exceeded one by one.

According to the present invention, there is provided an input numerical value storage unit in which an input numerical value is written, an operator storage unit in which an input operator is written, an operation result storage unit in which an operation result value is written, an input numerical value and an operator. And an operation history storage means capable of storing each item from a predetermined history item start position to a preset maximum number of items in the order of input, and when an operator is input, the operator is operated. The value stored in the input storage unit and the value stored in the input value storage unit and the value of the input value storage unit are stored in the operation history storage unit. In a storage medium storing a computer program for performing an operation based on an operator and writing the operation result in an operation result storage unit, the computer program includes an input of the operator. Therefore, when it is determined that the number of items to be stored in the calculation history storage means exceeds the maximum number of items, one or more items of calculation are executed from the history start position and collected to make room for newly stored items. The storage medium is characterized in that one item is stored in a position of a last item of the plurality of items, and this position is set as a new history item start position.

According to the present invention, an item obtained by calculating a plurality of items already stored in the calculation history storage means is stored as a first item at the position of the last item among the plurality of items. , Items generated by operator input can be stored without transferring the items. The present invention is an electronic computer equipped with the storage medium.

[0025]

FIG. 1 is a block diagram showing an electric configuration of an electronic computer (hereinafter, simply referred to as a "computer") 1 according to a first embodiment of the present invention. Calculator 1 has a CPU
(Central processing unit) 2, ROM (read only memory) 3, RAM (random access memory) 4, display device 5, keyboard 6, switch 7, and external storage device 8
It is comprised including.

The CPU 2 controls a key reading process, a calculation process including four arithmetic calculations, a calculation history holding process, a numerical value display process, and the like. The ROM 3 stores a history retention control program, a program for the CPU 2 to control peripheral devices, a display font, and the like.

The RAM 4 has an X register 4a, a Y register 4
b, an operator flag 4c, an operation history memory 4d, a history holding number work 4e, and a history start position work 4f. The X register 4a is an input numerical value storage unit that stores the input numerical value input from the keyboard 6 and the value of the calculation result. The Y register 4b is an operation result storage unit that stores the value of the previous operation result. Operator flag 4c
Is an operator storage unit that holds the type of the operator key pressed last, and refers to this flag when executing an operation to determine the content of the operation. The operation history memory 4d is an operation history storage unit that stores a set of a key code of an operator or the like and an input numerical value at that time or a numerical value of an operation result as a single item up to a predetermined maximum number of items. In this embodiment,
It is assumed that there is an operation history storage unit capable of storing 10 items of history.

The history start position work 4f stores the history position of the first item of the operation history stored in the operation history memory 4d. The history holding number work 4e stores the number of items of the operation history stored in the operation history memory 4d. When storing an item in the calculation history memory 4d, the CPU 2 refers to a value stored in the history start position work 4f and the history holding number work 4e, and stores the item in a position corresponding to the value. The X register 4a, the Y register 4b and the operator flag 4c are provided irrespective of the presence or absence of the calculation history holding function, and the operation history storage means 4d and the history holding number work 4e are provided for realizing the calculation history holding function. Is what it is. The history start position work 4f is used in a third embodiment described later, and is not used in the first embodiment and a second embodiment described later.

The display device 5 is composed of a liquid crystal display device and its driving circuit, etc., and displays a key code such as a counter unit 5a indicating which item of the input or displayed numerical value is the operation history and an operator. A symbol section 5b and a numerical value display section 5c for displaying input numerical values, calculation results, and calculation history values are provided.

The keyboard 6 includes a numerical key and a decimal point key for inputting numerical values, an operator key and an [=] key for executing an operation, and [NEX] for displaying an operation history.
[T] and [PREV] keys or a key for editing the operation history, and other keys for realizing functions provided in the device, and are used by the user to perform these operations. The switch 7 is for the user to specify a rounding method of the calculation result. The external storage device 8 is a device for storing an operation history, an operation program, and the like in an FD (floppy (registered trademark) disk) 9 or the like, and is realized by a floppy disk drive or the like.

FIG. 2 is a diagram showing a flowchart of the operation history processing in the computer according to the first embodiment. This processing is performed when the operation history is stored by processing keys such as operator keys. FIG. 3 shows an operation example of the computer according to the first embodiment.

Since (1) in FIG. 3A is the screen in the initial state before the calculation, the numerical value portion 5c of the display device is 0. Since the operation history is not stored, the counter unit 5a
Is displayed as 0.

In (2) of FIG. 3A, when [1] is input, 1 is stored in the X register 4a, and when the [+] key is pressed next, the operation history processing is performed in step a1 in the flowchart of FIG. Start. In step a2, it is determined whether the [=] key has been pressed. Here, since the [+] key is pressed, the process proceeds to step a3, and it is determined whether or not the number of history records is 10 by referring to the number of history records 4e. Since the number of history records is 0, the process proceeds to step a6.

At step a6, the operator stored in the operator flag 4c and the numerical value stored in the X register 4a are stored in the operation history memory 4d. Since this is the first item, no operator is stored in the operator flag, and (, 1) is stored as the operation history. The operation history processing ends, and the operator [+] is stored in the operator flag 4c. Further, since the number of history records 4e is incremented by 1, the counter unit 5a displays 1.

In (3) of FIG. 3A, when [2] is input, 2 is stored in the X register 4a, and when the [+] key is pressed next, the operation history processing is performed in step a1 in the flowchart of FIG. Start. After processing similar to (2) in FIG. 3A, the calculation history becomes (+, 2).
Is stored. The operation history processing ends, and the operator [+] is stored in the operator flag 4c and the operation result 3
Is stored in the Y register 4b. Also, the number of history records 4
Since +1 is added to e, the counter unit 5a displays 2.

In (4) of FIG. 3A, [3]
[+] [4] [+]... [1] [0] [+] When sequentially added like (+, 3) (+, 4) ... (+, 10)
And up to 10 items are stored in the operation history memory 4d.

In (5) of FIG. 3A, [1]
When [1] is input, 11 is stored in the X register 4a,
Next, when the [+] key is pressed, the calculation history processing starts at step a1 in the flowchart of FIG. In step a2, it is determined whether the [=] key has been pressed. In this case, since the [+] key is pressed, the process proceeds to step a3, and the number of history records is 10
Judge whether it is a case. Since the number of records retained is 10, the process proceeds to step a4.

At step a4, the operation history memory 4d is cleared. Specifically, the number of history records 4e is set to 0, and the process proceeds to step a5. At step a5, 55 stored in the Y register 4b is stored in the operation history memory 4d.
This is the first value in the expression, so leave a blank in the operator field. Specifically, after storing at the position corresponding to the number of history records 4e in the operation history memory 4d, that is, storing (, 55) in the first item, the number of history records 4e is incremented by one.

Next, the process proceeds to step a6, where the X register 4a
11 and [+] stored in the operator flag 4c are replaced with the number 4e of history records stored in the operation history memory 4d.
Is stored in the position corresponding to. That is, (+, 11) is stored in the second item. The operation history processing ends, and the operator [+] is stored in the operator flag 4c. Also, +1 is added to the number of history records 4e. As a result, as shown in (5), the number of held items is displayed on the counter section 5a.

At this time, the expression inside the operation history memory 4d is "55 + 11" as shown in FIG. 3B, and 66, which is the progress of the operation displayed in the numerical value part 5c, and the operation history memory 4d Is kept consistent with the formula stored in.

FIG. 4 shows an operation example when the [=] key is pressed in the computer according to the first embodiment.

When the [=] key is pressed, two operation histories are created. The calculation history processing at this time will be described below.

The calculation history processing and operations in (1) to (3) of FIG. 4A are the same as those in (1) to (3) of FIG.

In (4) of FIG. 4A, [3]
[+] [4] [+] ... [1] [0] [=] When sequentially added, nine items are calculated as (+, 3) (+, 4) ... (+, 9). [=] In the state stored in the history memory 4d
Key is pressed. When the [=] key is pressed, the history holding process starts in the flowchart of FIG. In step a2, it is determined whether the [=] key has been pressed. By pressing the [=] key, two item histories (+, 10) and (=, 55) are created. Since the [=] key has been pressed, the process proceeds to step a7, where it is determined whether or not the sum of the current number of stored history items and the two items of the number of history items created by the [=] key exceeds ten. Do. In this operation example, since the total is 11 and exceeds 10, the process proceeds to step a8.

In step a8, the operation history memory 4d is cleared. Specifically, the number of history records 4e is set to 0, and the process proceeds to step a9. In step a9, the value 45 stored in the Y register 4b is stored in the operation history memory 4d.
This is the first value in the expression, so leave a blank in the operator field. Specifically, after storing at the position corresponding to the number of history records 4e in the operation history memory 4d, that is, storing (, 45) in the first item, the number of history records 4e is incremented by one.

Then, the process proceeds to a step a10, wherein the X register 4
a stored in the operation history memory 4d and 10 stored in the operator flag 4a and [+] stored in the operator flag 4c.
It is stored in the position corresponding to e. That is, (+, 10) is stored in the second item, and the number of history records 4e is incremented by 1, and the process proceeds to step a11. In step a11, the Y register 4
An operation is performed on 45 stored in b and 10 stored in the X register 4a based on the operator flag 4c, and the operation result 55 is stored in the X register 4a.

Next, at step a12, the operation result stored in the X register 4a is stored as an operation history. Since the value is the result of the [=] key, put '=' in the operator column. After storing at the position corresponding to the number of history records 4e in the history storage memory 4d, that is, after storing (=, 55) in the third item, the calculation history processing is terminated.
The history holding number 4e is incremented by one. As a result, as shown in (4), the number 3 of stored items is displayed on the counter section 5a.

At this time, the expression in the operation history memory 4d is "45 + 10 = 55" as shown in FIG.
Thus, the consistency between the calculation result displayed in the numerical value part 5c and the formula stored in the calculation history memory 4d is maintained.

If the total is 10 or less in step a7, the maximum number of items in the operation history memory 4d will not be exceeded during the [=] key processing, so the flow advances to step a10, and steps a11 and a12 are performed in the same manner as described above.
After that, the calculation history processing ends.

FIG. 5 is a flow chart showing the operation history processing in the computer according to the second embodiment of the present invention.

The block diagram of the computer according to the second embodiment is the same as that of FIG. This processing is performed when the operation history is stored by processing keys such as operator keys. FIG. 6 shows an operation example of the computer according to the second embodiment.

Since (1) in FIG. 6A is the screen in the initial state before the calculation, the numerical value part 5c of the display device is 0. Since the operation history is not stored, the counter unit 5a
Is displayed as 0.

In (2) of FIG. 6A, when [1] is input, 1 is stored in the X register 4a, and when the [+] key is pressed next, the operation history processing is performed in step b1 in the flowchart of FIG. Start. In step b2, it is determined whether the [=] key has been pressed. Here, since the [+] key is pressed, the process proceeds to step b3, and it is determined whether or not the number of history records is 10 by referring to the number of history records 4e. Since the number of history records is 0, the process proceeds to step b8.

At step b8, the operator stored in the operator flag 4c and the numerical value stored in the X register 4a are stored in the operation history memory 4d. Since this is the first item, no operator is stored in the operator flag, and (, 1) is stored as the operation history. The operation history processing ends, and the operator [+] is stored in the operator flag 4c. Further, since the number of history records 4e is incremented by 1, the counter unit 5a displays 1.

In (3) of FIG. 6A, when [2] is input, 2 is stored in the X register 4a, and when the [+] key is pressed next, the operation history processing is performed in step b1 in the flowchart of FIG. Start. (+, 2) is stored as the operation history through the same processing as (2) in FIG. The operation history processing ends, and the operator [+] is stored in the operator flag 4c, and the operation result 3 is stored in the Y register 4b. Further, since the number of history records 4e is incremented by 1, the counter unit 5a displays 2.

In (4) of FIG. 6A, [3]
[+] [4] [+]... [1] [0] [+] When sequentially added like (+, 3) (+, 4) ... (+, 10)
And up to 10 items are stored in the operation history memory 4d.

In (5) of FIG. 6A, [1]
When [1] is input, 11 is stored in the X register 4a,
Next, when the [+] key is pressed, the calculation history processing starts at step b1 in the flowchart of FIG. In step b2, it is determined whether the [=] key has been pressed. Here, since the [+] key is pressed, the process proceeds to step b3, and the number of history records is 10
Judge whether it is a case. Since the number of history records is 10, the process proceeds to step b4.

At step b4, the contents of the first and second items in the operation history memory 4d are exchanged with the contents of the Y register 4b, the X register 4a and the operator flag 4c. That is, (, 1) and (+, 2) and the Y register 4b,
"55.", "11." and "+" stored in the X register 4a and the operator flag 4c are exchanged. Next, in step b5, the Y register 4b and the X register 4a are operated based on the operator flag 4c, and the operation result is stored in the Y register 4b. As a result, the first two items stored in the calculation history memory 4d are calculated.

After the operation, the process proceeds to step b6, where the contents of the first item and the second item of the operation history memory 4d and the Y register 4
b, the operator flag 4c and the contents of the X register 4a are exchanged again. As a result, “55.” is set in the Y register 4b, the X register 4a, and the operator flag 4c.
"11." and '+' are stored and the state returns to the initial state, and the first item in the operation history memory 4d is the operation result obtained by operating the first item and the second item ((3), (3)). Two items are (+, 2).

Since (+, 2) of the second item is unnecessary,
Next, at step b7, the third item of the operation history memory 4d is set to 2
Transfer to item. Similarly, if each item is forwarded one item at a time, a free area for one item can be secured for the tenth item. At step b8, the value of the X register 4a and the operator flag 4c are stored in the operation history memory 4d as the number of history records 4e.
Is stored in the position corresponding to. That is, (+,
11) is stored, and the number of history records 4e is incremented by one.

At this time, the expression in the operation history memory 4d is "3 + 3 + 4 + 5 + 6" as shown in FIG.
+ 7 + 8 + 9 + 10 + 11 ", and the consistency between 66, which is the progress of the calculation displayed in the numerical value part 5c, and the formula stored in the calculation history memory 4d is maintained.

FIG. 7 shows an operation example when the [=] key is pressed in the computer according to the second embodiment.

When the [=] key is pressed, two items of operation history are created. The calculation history processing at this time will be described below.

The calculation history processing and operations in (1) to (4) in FIG. 7A are the same as those in (1) to (4) in FIG.

In (5) of FIG. 7A, [1]
When [1] is input, 11 is stored in the X register 4a,
Next, when the [=] key is pressed, the calculation history processing starts at step b1 in the flowchart of FIG. In step b2, it is determined whether the [=] key has been pressed. By pressing the [=] key, two item histories (+, 11) and (=, 66) are created. Since the [=] key has been pressed, the process proceeds to step b9, where it is determined whether or not the sum of the current number of stored history items and the two history items created by the [=] key exceeds 10 items. Do. In this operation example, since the total is 12 and exceeds 10, the process proceeds to step b10.

At step b10, the operation history memory 4d
And the contents of the first and second items and the Y register 4b, X
The contents of the register 4a and the operator flag 4c are exchanged. That is, "55.", "11." and "+" stored in (, 1) and (+, 2), Y register 4b, X register 4a and operator flag 4c, respectively.
Exchange with Next, in step b11, the Y register 4b and the X register 4a are operated based on the operator flag 4c, and 3 which is the operation result is stored in the Y register 4b.

Next, at step b12, the operation history memory 4d
It is determined whether operations for the number of items exceeding the maximum number of items have already been executed. In this embodiment, the number of items exceeding the maximum number of items is two. Since only one item has been calculated, the process proceeds to step b13. Step b1
At 3, the next item (+, 3) of the item in the operation history memory 4d which has already been used for the operation is stored in the X register 4a and the operator flag 4c, and the process returns to step b11 to repeat the operation. Return. In step b11, the Y register 4b and the X register 4a are operated again based on the operator flag 4c, and the operation result 6 is stored in the Y register 4b.

Since the operations for the number of items exceeding the maximum number of items have been executed, the process proceeds to step b14, where the contents of the first item and the second item of the operation history memory 4d and the Y register 4b, X
The contents of the register 4a and the contents of the operator flag 4c are exchanged again. Thereby, the Y register 4b, the X register 4
a and the operator flag 4c include "55."
1. "And" + "are stored and the state returns to the initial state. The first item in the operation history memory 4d is the operation result obtained by calculating the first to third items ((6)), and the second item is (+, 3).

Since (+, 3) and (+, 3) of the second and third items are unnecessary, the fourth item in the operation history memory 4d is transferred to the second item in step b15.
Similarly, if each item is forwarded by two items, a vacant area for two items can be secured in the ninth and tenth items. In step b16, the value of the X register 4a and the operator flag 4c are stored in the operation history memory 4d at a position corresponding to the number of history records 4e. That is, (+, 1)
1) is stored and the number of history records 4e is incremented by one. In step b17, an operation is performed on 55 stored in the Y register 4b and 11 stored in the X register 4a based on the operator flag 4c, and the operation result 66 is stored in the X register 4a.

Next, at step b18, the operation result stored in the X register 4a is stored as an operation history. Since the value is the result of the [=] key, put '=' in the operator column. After storing at the position corresponding to the number of history records 4e in the history storage memory 4d, that is, after storing (=, 66) in the tenth item, the calculation history processing is terminated,
The history holding number 4e is incremented by one. As a result, as shown in (5), 10 of the number of stored items is displayed on the counter section 5a.

At this time, the expression inside the operation history memory 4d is "6 + 4 + 5 + 6 + 7" as shown in FIG.
+ 8 + 9 + 10 + 11 = 66 ", which is the calculation result 66 displayed in the numerical value part 5c and the calculation history memory 4d.
Is kept consistent with the formula stored in.

FIG. 8 is a diagram showing a flowchart of the operation history processing in the computer according to the third embodiment of the present invention.

The block diagram of the computer according to the third embodiment is the same as that of FIG. The calculation history start position work 4f is used in the third embodiment, and stores the history start position in the calculation history memory 4d.

This processing is performed when the operation history is stored by processing keys such as operator keys. FIG. 9 shows an operation example of the computer according to the third embodiment.

The operation is the same as that of FIG. 6A, and only the internal operation for securing a free area is different from that of the second embodiment. Therefore, the different operation, step c6 and step c7 of FIG. 8, will be described. .

At step c5, the Y register 4b and the X register 4a are operated based on the operator flag 4c, and the operation result is stored in the Y register 4b. As a result, the first two items stored in the calculation history memory 4d are calculated.

Proceeding to step c6, the operation history memory 4d
And the contents of the first and second items are exchanged again with the contents of the Y register 4b, the operator flag 4c and the X register 4a. At this time, the value stored in the Y register 4b is stored in the second item, the values stored in the operator flag 4c and the X register 4a are stored in the first item, and the value stored in the first item is stored in the Y item. The value stored in the second item is stored in the register 4b in the operator flag 4c and the X register 4a. As a result, “55.” and “1” are stored in the Y register 4b, the X register 4a, and the operator flag 4c.
1. "And '+' are stored and the state returns to the initial state. The first item in the operation history memory 4d is (+, 2), and the second item is the operation result obtained by operating the first item and the second item. There is (, 3).

Next, at step c7, the history start position 4f
In order to create a free space in the front side by shifting to the back, the number of items exceeding the maximum number of items is added to the history start position 4f of the operation history memory 4d to set a new history start position 4f. In this operation example, since the number of items exceeding the maximum number of items is one, the second item is set as a new first item. If the storage format of the operation history memory 4d is a ring buffer format, the position which was the first item first becomes an empty area due to the change of the history start position 4f, and is stored in the X register 4a and the operator flag 4c in step c8. The stored value is stored in that position.

At this time, the expression inside the operation history memory 4d is “3 + 3 + 4 + 5 + 6” as shown in FIG.
+ 7 + 8 + 9 + 10 + 11 ", and the consistency between 66, which is the progress of the calculation displayed in the numerical value part 5c, and the formula stored in the calculation history memory 4d is maintained.

FIG. 10 shows an operation example when the [=] key is pressed in the computer according to the third embodiment.

When the [=] key is pressed, two items of operation history are created. The calculation history processing at this time will be described below.

The operation is the same as that of FIG. 7A, and only the internal operation for securing an empty area is different from that of the second embodiment.
Step c16 will be described.

If it is determined in step c12 that the calculation for two items, which is the number of items exceeding the maximum number of items in the operation history memory 4d, has already been executed, the process proceeds to step c14.
The calculation result stored in the Y register 4b is stored in the position of the third item which is the item used last in the calculation in the calculation history memory 4d, and the process proceeds to step c15.

At step c15, the operation history memory 4d
And the contents of the first and second items and the Y register 4b, X
The contents of the register 4a and the contents of the operator flag 4c are exchanged again. Thereby, the Y register 4b, the X register 4
a and the operator flag 4c include "55."
1. "And '+' are stored and return to the initial state, and the first to third items of the operation history memory 4d are (, 6), (+, 3) and (, 6), respectively.

Next, at step c16, the history start position 4
In order to create a free space in front by shifting f backward, a new history start position 4f is set by adding the number of items exceeding the maximum number of items to the history start position 4f of the operation history memory 4d. In this operation example, since the number of items exceeding the maximum number of items is two, the third item is set as a new first item. Assuming that the storage format of the operation history memory 4d is a ring buffer format, the position that was the first and second items first becomes an empty area due to the change of the history start position 4f.
At 17, the values stored in the X register 4a and the operator flag 4c are stored at that position.

At this time, the expression in the operation history memory 4d is "6 + 4 + 5 + 6 +" as shown in FIG.
7 + 8 + 9 + 10 + 11 = 66 ", and the calculation result 66 displayed in the numerical value part 5c and the calculation history memory 4
Consistency with the expression stored in d is maintained.

[0087]

As described above, according to the present invention, it is determined that the maximum number of items that can be stored in the history is exceeded by inputting an operator, and a free area for storing a newly created item is determined. Since the calculation history can be secured in the calculation history storage unit, even if there is an input exceeding the maximum number of items, it is possible to store and display a calculation history having consistency between the calculation result and the history.

According to the present invention, even when two or more history items are created by inputting an operator, it is determined in advance that the number of history items exceeds the maximum number of items that can be held, and a necessary empty area is created. , The operation history can be stored and displayed with consistency between the operation result and the history.

Further, according to the present invention, an empty area can be secured by setting the storage position of the first item in the operation history storage means, so that it is not necessary to transfer each item when securing the empty area. Processing time can be shortened.

[Brief description of the drawings]

FIG. 1 is a block diagram illustrating an electrical configuration of a computer 1 according to a first embodiment of the present invention.

FIG. 2 is a diagram showing a flowchart of an operation history process in the electronic computer of the first embodiment.

FIG. 3 is a diagram illustrating an operation example in the computer according to the first embodiment.

FIG. 4 is a diagram illustrating an operation example when the [=] key is pressed in the computer according to the first embodiment.

FIG. 5 is a diagram showing a flowchart of an operation history process in the computer according to the second embodiment of the present invention.

FIG. 6 is a diagram illustrating an operation example in the computer according to the second embodiment.

FIG. 7 is a diagram illustrating an operation example when the [=] key is pressed in the computer according to the second embodiment.

FIG. 8 is a diagram showing a flowchart of an operation history process in the computer according to the third embodiment of the present invention.

FIG. 9 is a diagram illustrating an operation example in the computer according to the third embodiment.

FIG. 10 is a diagram illustrating an operation example when the [=] key is pressed in the computer according to the third embodiment.

FIG. 11 is a diagram showing an operation example of a conventional computer.

[Explanation of symbols]

 Reference Signs List 1 electronic computer 2 CPU (central processing unit) 3 ROM (read only memory) 4 RAM (random access memory) 4a X register 4b Y register 4c operator flag 4d operation history memory 4e history holding number work 4f history start position work

Claims (6)

[Claims] 1. An input numerical value storage means in which an input numerical value is written, an operator storage means in which an input operator is written, an operation result storage means in which an operation result value is written, and an input numerical value and an operator. Operation history storage means for storing each item from a predetermined history item start position to a preset maximum number of items in the order of input, and when an operator is input, the operator is stored as an operator Means, the value stored in the input numerical value storage means and the input operator are stored in the operation history storage means, and the value of the operation result storage means and the value of the input numerical value storage means are stored in the input operator. In a storage medium for storing a computer program for processing so as to write the calculation result into the calculation result storage means, the calculation history is stored up to the maximum item in the calculation history storage means. In this state, when an operator is input, the computer program deletes all the items stored in the operation history storage unit and stores them in the input numerical value storage unit, the operator storage unit, and the operation result storage unit. A storage medium for storing the input numerical value, the operator, and the calculation result in a calculation history storage unit. 2. When the number of items stored in the operation history storage means is determined to exceed the maximum number of items by the input of an operator for creating two or more items, the computer program preliminarily calculates the operation history. All the items stored in the means are deleted, and the input numerical value, the operator and the operation result stored in the input numerical value storage means, the operator storage means and the operation result storage means are stored in the operation history storage means. The storage medium according to claim 1, wherein 3. An input numerical value storage means in which an input numerical value is written, an operator storage means in which an input operator is written, an operation result storage means in which an operation result value is written, and an input numerical value and an operator. Operation history storage means for storing each item from a predetermined history item start position to a preset maximum number of items in the order of input, and when an operator is input, the operator is stored as an operator Means, the value stored in the input numerical value storage means and the input operator are stored in the operation history storage means, and the value of the operation result storage means and the value of the input numerical value storage means are stored in the input operator. In a storage medium for storing a computer program for processing so as to write the calculation result into the calculation result storage means, the calculation history is stored up to the maximum item in the calculation history storage means. In this state, when there is an input of an operator, the computer program executes an operation based on the first item and the second item stored in the operation history storage means and summarizes the first item. A space in the last item of the operation history storage means by transferring each item stored in the item to the previous item, and storing the item generated by the input there. . 4. When the number of items stored in the operation history storage means is determined to exceed the maximum number of items by input of an operator for creating two or more items, the computer program stores the operation history storage means. Among the items stored in the first item, the operations for the number of items exceeding the maximum number of items by the input are executed from the first item, and the items are stored in the first item, and the items stored thereafter are items exceeding the maximum number of items. By transferring several minutes before, at the end of the operation history storage means,
4. The storage medium according to claim 3, wherein a space for the number of items exceeding the maximum number of items is created, and the items generated by the input are stored therein. 5. An input numerical value storage means in which an input numerical value is written, an operator storage means in which an input operator is written, an operation result storage means in which an operation result value is written, and an input numerical value and an operator. Operation history storage means for storing each item from a predetermined history item start position to a preset maximum number of items in the order of input, and when an operator is input, the operator is stored as an operator Means, the value stored in the input numerical value storage means and the input operator are stored in the operation history storage means, and the value of the operation result storage means and the value of the input numerical value storage means are stored in the input operator. The computer-readable storage medium stores a computer program that performs a calculation based on the following formula and writes the calculation result to a calculation result storage unit. When it is determined that the number of items to be stored in the calculation history storage means exceeds the maximum number of items, one or more items of calculation are executed from the history start position to collectively make room for newly stored items. A storage medium wherein one item is stored in a position of a last item of the plurality of items, and this position is set as a new history item start position. 6. An electronic computer comprising the storage medium according to claim 1.