JPH096581A - Window system - Google Patents

Abstract

(57) [Summary] [Purpose] Partial playback was performed efficiently and it was possible to easily understand what operation caused the change in the display content. [Structure] After saving each instruction sequence including these interdependencies, the node Ci is specified and the command of the node Ci is re-executed (S21). Then, when the flag V of the node Ci is "0". Determines whether or not there is a section [Ci] on which the section Ci depends (S22 → S23 → S24). If the section [Ci] exists, the section [Ci] is set to the section Ci (S25 ) After the processing of step S21 and subsequent steps is executed, and when there is no section [Ci] on which the section Ci depends, after executing the section Ci (S26), the flag V is set to "1" and the processing ends. Further, it has a display means for visually displaying such operation contents.

Description

Detailed Description of the Invention

[0001]

FIELD OF THE INVENTION This invention relates to window systems.

[0002]

2. Description of the Related Art A window system is a system capable of displaying a plurality of different windows on a display. An interactive application operating environment is widely provided by using a terminal having a graphical display function and the window system operating on the terminal.

This type of window system is specifically a drawing command for drawing a character or a figure, a drawing attribute setting command for setting display attributes in the drawing command, and a window for operating a drawing target window. The system is driven by operating instructions.

Further, in the above window system, an input code obtained from the input device is converted into an internal code unique to the window system, which is further interpreted by an application to start an appropriate operation.

[0005]

By the way, in the above window system, in general, when the respective commands such as the drawing command, the drawing attribute setting command, and the window operation command are executed, the side effect that the display content of the screen changes , And there is an interdependence between the series of instructions based on the side effect. For example, when a drawing is created for a certain window, the window and drawing attributes are set prior to the drawing creation, and then a drawing command is issued.

However, in the above window system, an instruction sequence equivalent to the action of the preceding instruction sequence is not executed in advance based on the interdependence between the instructions, so random partial reproduction or designation of a specific window is performed. However, there is a problem in that it is extremely difficult to perform partial reproduction.

Further, since the operation on the input device such as the keyboard and the mouse does not appear directly on the display screen, in the menu operation by the mouse and the text editing by the keyboard, the operation content of the device is inferred from the change of the display content. Although it is possible to grasp, it is difficult to infer the operation content of the device from the change in the display content in the menu operation with the keyboard and the document editing with the mouse, so it is difficult to understand what operation caused the screen change. There is a problem in that it is difficult to understand, and it is inconvenient in education for beginners.

The present invention has been made in view of the above problems, and it is possible to efficiently perform partial reproduction and easily grasp what operation caused a change in display content. The purpose is to provide a window system.

[0009]

In order to achieve the above object, a window system according to the present invention includes a storage means for storing each instruction for a window including mutual dependency, and a series of the stored instruction sequence. It is characterized in that it is provided with a deciding means for deciding an instruction sequence to be partially re-executed from the inside, and a reproducing means for reproducing the operation content of the window based on the decided instruction sequence.

Further, the storage means stores the time information including the time information, and the reproduction means performs the reproduction processing while maintaining the temporal relation of the time information stored by the storage means. Is preferably characterized by having an evaluating means for evaluating an elapsed time between adjacent instructions, and the reproducing means performing a reproducing process based on the evaluating means.

According to the present invention, the storage means includes operation content storage means for storing operation content of the input device.
It is characterized by further comprising display means for visually displaying the operation content of the window reproduced by the reproduction means.

[0012]

According to the above construction, each instruction sequence is stored including the interdependency, and the window operation contents can be partially reproduced.

The operation contents of the reproduced window are visually displayed by the display means.

[0014]

Embodiments of the present invention will now be described in detail with reference to the drawings.

FIG. 1 is an overall block diagram showing an embodiment (first embodiment) of a window system according to the present invention, and FIG. 2 is a block diagram showing the structure of the window system.

The window system includes a keyboard 1 for inputting image information such as characters and figures, and a mouse 3 for operating a mouse button 2 to give a predetermined instruction to a window.
And an external storage device 4 such as a hard disk or a flexible disk for storing the input information from the mouse 3 or the keyboard 1, and an LCD or CRT for displaying the input image information.
And the like, and a control unit 7 which is connected to each of the above-mentioned components through a connection cable 6 and executes an instruction for each window. The control unit 7
Includes a memory 7b having a counter area and storing a predetermined control program, and a CPU 7a that controls the entire apparatus according to the control program.

FIG. 3 is a schematic diagram showing the above-mentioned window system instructions and the interdependence between them, and in the figure, Ci
(I = 1 to 5) are the labels of clauses having unique values in the graph. In this embodiment, the clauses that directly depend on the clause C1 are clauses C2 and C3, and the clauses that depend directly on the clause C2 are clause C.
4 and section C5. Also, section C4
Depends on node C1 indirectly via nodes C2 and C3. Therefore, the clause on which the clause Ci depends indirectly is generally the whole clause on which the clause on which the clause Ci directly depends depends directly or indirectly.

FIG. 4 shows the attributes of the section Ci. That is, regarding each section and the instruction content corresponding thereto, section C1 corresponds to an instruction corresponding to system initialization or a pseudo instruction, section C2 corresponds to a window creation instruction, section C3 corresponds to a drawing attribute creation instruction, and further section C4 corresponds to a drawing command, and section C5 corresponds to a window destruction command. Also, <w> and <p> are a window identifier and a drawing attribute identifier (real identifier) used in an actual command corresponding to the internal state of the window system, and are referred to as parameters in other commands. That is, in the drawing command of section C4, the window identifier <w> and the drawing attribute identifier <p>
Is used, and the window identifier <w> is used in the window destruction instruction in section C5. Further, the flag V is set in each section Ci to "1" when the instruction has been executed, and to "0" when the instruction has not been executed. Then, these pieces of information are stored in the storage device built in the control unit 7 or the external storage device 4 via a known information processing technique.

In a window system, a mutual dependency generally occurs between a series of instructions. In this case, if the number of internal states that change with one instruction is one, the clause corresponding to the identifier that appears in the parameter list of the instruction can be easily identified, but the internal state that changes with one instruction If there is more than one, it is necessary to identify the section by paying attention to the interdependence. Therefore, in the present embodiment, the nodes are decomposed into the changed number of internal states, stored, and connected in an arbitrary order to make the reproduction processing equivalent. That is, this makes it possible to represent the identifier of the internal state of the window system by the label of the clause, and as a result, it is possible to identify the clause corresponding to the identifier appearing in the parameter list of the instruction.

In the above embodiment, the interdependence of commands is mainly determined by the reference relationship of the real identifiers. However, it is said that there is an internal state corresponding to a change in the display content due to drawing, for example. In some cases, it cannot be handled as a reference relationship of real identifiers. However, even in such a case, for example, the area on the screen that is affected by the drawing instruction is fixed, a virtual identifier is given to the area, and the interdependence relationship between instructions is determined by the presence or absence of overlap between areas. Can be As described above, the method of extracting the interdependence relationship between instructions can be modified depending on the instruction configuration of the operating window system.

Next, the procedure for saving the window operation contents will be described with reference to the flowchart of FIG. The program is executed by the CPU 7a.

In step S1, the CPU 7a has the memory 7b.
The count value i of the counter area is set to "1", and in step S2, the CPU 7a creates a node Ci, that is, a node C1 and stores it in the memory 7b. Next, in step S3, the CPU 7a inputs an instruction for window operation, and in the following step S4, it is determined whether or not the instruction is an end instruction. If it is not the end instruction, the process proceeds to step S5, and it is determined whether or not the instruction is accompanied by a change in internal state. If the internal state does not change, the process proceeds to step S7. If the internal state changes, the internal identifier i is assigned as the internal state, and then the process proceeds to step S7. Next, in step S7, a parameter list is extracted from the command, and it is determined whether or not the parameter list includes a real identifier, that is, a window identifier <w> or a drawing attribute identifier <p> (step S).
8). Then, if neither the window identifier <w> nor the drawing attribute identifier <p> is included, the process proceeds to step S10, while if the window identifier <w> or the drawing attribute identifier <p> is included, The clause Ci corresponding to these identifiers is uniquely determined, and the preceding series of instructions is determined. If an internal identifier i is assigned in each preceding instruction, the series of internal identifiers is used as a list of preceding clauses. Then, after this, in step S10, the counter value i is incremented by "1", the process returns to step S2, the section C2 is created using the result obtained in step S9, and the above-described processing is repeated. When all the clauses Ci have been created and saved, an end command is input in step S3, and therefore the answer in step S4 becomes affirmative (Yes), and the process ends. As a result, the command for the window including the interdependence between the commands is saved.

The window identifier <w> and the drawing attribute identifier <p>, which are the real identifiers used in the actual command, are generally different from the internal identifier i used in the saving process. 1 for identifiers <w> and <p>
By monitoring the destruction instruction of the internal state corresponding to the pair 1 and also for the internal identifier i from the identifiers <w> and <p> to 1 in any step.
One-to-one correspondence is possible.

In the above-mentioned saving procedure, the internal state is not changed depending on the instruction, and the clause corresponding to the instruction is created and saved even though the internal state is not specified in the parameter list. Become. As an example of such an instruction, there is an inquiry instruction for the system, but it is preferable not to create such an instruction from the viewpoint of reduction of processing and saving of storage area.

FIG. 6 is a flow chart showing a modified example of the storage procedure in consideration of such a point. It is referred to again in step S11 whether or not the internal state is changed, and the internal state such as an inquiry command is changed. If not, step S3
By returning to step S3 and executing the processing of step S3 and thereafter, it is possible to avoid the creation of unnecessary nodes, reduce the system, and save the storage area.

Next, a reproducing procedure for partially reproducing the information stored by the storing procedure will be described.

FIG. 7 is a flow chart showing the reproduction procedure of this window system. This program is a CPU
7a.

First, the CPU 7a causes the node Ci (for example, node C
4) is designated and the instruction of the section Ci is re-executed (step S
21), and then checks the flag V of section Ci (step S2
2), it is determined whether the flag V is "1" (step S)
23). When the flag V is "1", the process is terminated as it is, while when the flag V is "0", the process proceeds to step S24, and it is determined whether or not there is a node [Ci] on which the node Ci depends. If the section [Ci] is present, the section [Ci] is set as the section Ci and the process returns to step S21 to repeat the series of processes described above. That is, for example, when the section C4 is designated, the section C4 is the section C4 as shown in FIG.
2 and the node C3 directly and indirectly on the node C4, but since these series of nodes have been saved by the above-described saving procedure, these are taken out and the steps S21 and the following steps are executed for these nodes. To do. When all the instructions that directly depend on the instruction Ci and the instructions that indirectly depend on the instruction Ci are executed and there is no section [Ci] on which the section Ci depends (for example, section C1), the process proceeds to step S26. The instruction is executed, the flag V is set to "1" (step S27), and the process ends. This makes it possible to partially reproduce the information stored in FIG. 5 or 6. That is, it is possible to efficiently perform partial re-execution while guaranteeing the interdependency between instructions.

By the way, step S21 of the above-mentioned reproduction procedure.
If the section C5 is specified in step 1, that is, if the window destruction instruction is specified and executed, for example, step S26.
Although the consistency of the interdependency is guaranteed by not executing the instruction Ci in step 1, in this case, an unnecessary internal state that is not reused is accumulated, which may cause an efficiency problem. To prevent this, step S2
It is necessary to execute the instruction Ci in 6 and invalidate the execution of the instruction of the clause corresponding to the identifier of the destroyed internal state and the instruction of all the clauses that depend directly or indirectly on it.

For example, the flags V of the sections C2 to C4 are all "1", and only the flag V of the section C5 is "0", which indicates unexecuted.
The procedure for invalidating all the clauses Ci in the case of will be described based on the flowchart of FIG.

In step S31, the node Ci (for example, C4) is designated, and the flag V is checked in the following step S32.
Then, in this case, the flag V is "1" indicating that it has already been executed, so the process proceeds to step S34, and it is determined whether or not there is a section [Ci] on which the section Ci depends. Then, when the answer is affirmative (Yes), the section [Ci] is set as the section Ci and the process returns to step S31 to repeat the above-described processing. That is, i =
In the case of 4, the nodes on which node C4 depends directly include node C2 and node C3, and indirectly node C1. Then, the instruction in steps S31 and S36 is set as an erase instruction, and the flag V of the node Ci erased in step S37 is set to 0. Incidentally, since there is no subsequent instruction for the node C5 which is the internal state destruction instruction, unnecessary destruction of the internal state does not occur.

When re-execution is performed again on the instruction sequence that has already been re-executed in FIG. 7, it can be executed by applying the above internal state destruction instruction. That is,
Since the re-execution becomes invalid by applying the internal state destruction instruction, the destruction instruction corresponding to the designated instruction is executed. When there is no corresponding destructive instruction, at least one corresponding destructive instruction is extracted from the instructions on which the designated instruction directly or indirectly depends, and the destructive instruction corresponding to the instruction is converted to the procedure of FIG. It should be executed based on the above.

As described above, in the first embodiment,
Instructions that do not have a mutual dependency are executed independently, and it is possible to reproduce a partial window operation situation or a window operation situation from an arbitrary point in time.

By the way, in the actual window operation, it is general to perform processing in parallel using a plurality of independent windows and drawing attributes. When a plurality of instructions that are not in a mutual dependency relationship are re-executed at the time of reproduction, it is desirable to re-execute these in accordance with the temporal order relationship at the time of saving, instead of re-executing them.

To this end, when the node Ci is created, the additional information corresponding to the temporal order relationship of the instructions is in one-to-one correspondence with the node Ci.
It is sufficient to make a change such that it is recorded as the attribute value of. In this case, the additional information can be realized by acquiring time information provided as a standard function of the operating system or by providing a counter and incrementing the counter each time a command in the saving process is processed. it can.

FIG. 9 is a flow chart in the case of re-executing a compound instruction C composed of a plurality of instructions ci, cj, ..., ck while maintaining the temporal order (second embodiment).

That is, in step S41, the temporal order list L (C) of nodes is all reset to empty. still,
Addition of elements to the temporal ordered list L (C) shall guarantee temporal ordered relation, and temporal ordered list L
The elements are extracted from (C) sequentially from the earliest in time.

Next, expansion processing is performed on the compound instruction C (step S42). That is, as shown in FIG. 10, it is determined whether or not the compound instruction C is empty (step S5).
1) When the answer is affirmative (Yes), the processing is terminated as it is, while when the answer is negative (No), an arbitrary instruction c is extracted from the compound instruction C, and the instruction c is converted from the compound instruction. It is removed (step S52), then the flag V of the node c is checked (step S53), and it is determined whether the flag V is "1" (step S54). Then, when the answer is affirmative (Yes), the process returns to step S51, while when the answer is negative (No), the re-execution has not been performed yet, so the process proceeds to step S55, the same as in the first embodiment. ,
Take a series of clauses [c] on which clause c depends, and c = [c]
Then, the processing from step S51 onward is repeated.

On the other hand, the answer to step S55 is negative (No).
When, that is, when there is no section [c] on which the section c depends, the section c is added to the temporal order list L (C) (step S57), and step S of the main routine (FIG. 9).
Proceed to 43. Then, in this state, the temporal ordered list L
Since (C) is a list of items that have not been re-executed, elements are taken out one by one from the temporal order list L (C) and the corresponding instruction is executed (step S43), and the executed section c The flag V is set to "1" and the process ends.

In the second embodiment, when absolute time is used as the time attribute of a node, real-time reproduction processing can be performed. That is, the clauses c, which are the elements of the temporal ordered list L (C), are arranged according to the temporal order as described above, and the temporal ordered list L (C ), The elapsed time between any adjacent elements can be obtained. Therefore, by re-executing the instruction according to the elapsed time between elements in step S43, it is possible to execute real-time reproduction processing.

Further, by making the elapsed time between elements variable, slow reproduction, fast forward, etc. can be easily realized.

FIG. 11 is a screen configuration diagram showing a case where the operation of the window system of the present invention is visually performed on the screen (third embodiment).

Reference numeral 8 is a window in which reproduction is performed, and reference numeral 9 shows the position of the mouse cursor when recording the operation content. 10 is a mouse figure showing a mouse, and 11
Is a keyboard figure showing a keyboard. Also, 12
Is a window in which the playback status is displayed and controlled by the user. The mouse figure 10 and the keyboard figure 11 are similar in shape to the mouse 3 and the keyboard 1 in FIG. 1, and their key positions and button positions are substantially the same. Further, the window 12 provides the user with various means in the reproduction process such as the designation of the speed and the range of the partial reproduction.

In the third embodiment, the storage process is performed as follows. That is, the instruction is expanded to include a keyboard operation, a mouse button operation, and a mouse movement operation. Then, for example, in the case of a window creation command, it is saved so as to include the start key of the command, the operation of the mouse button when the range is specified, and the like. Here, the interdependence relationship between these extended instructions is defined as one instruction sequence depending on the window in which the above operation has occurred, and is expressed as a series of one clause as shown in FIG. 3, for example. The sequence of these clauses has no branch, and there is no clause that depends on the clause on the sequence.

Next, the reproduction process is performed as follows. That is, since the stored instructions include a mouse movement operation, a mouse button operation, and a keyboard operation, the reproduction processing is performed by displaying the processing on the display screen of the display 5. Regarding the operation of moving the mouse, reproduction is performed by moving the mouse cursor 9 on the display screen. Especially in the saving process described above,
When the movement of the mouse includes entry / exit of the cursor window, the mouse cursor 9 is displayed / erased or the display color is changed in correspondence with the entry / exit of the cursor. The mouse button operation and the keyboard operation are represented by changing the display color of the corresponding button on the mouse graphic 10 or the keyboard graphic 11. This allows the operation status of the user's input device to be displayed in synchronization with the display content of the window.

The present invention is not limited to the above embodiment. Although the terminal device used in the above embodiment has both the saving process and the reproducing process, it is also possible to use a terminal that performs the saving process and a terminal that performs the reproducing process that are functionally different.

[0047]

As described above in detail, in the window system according to the present invention, the saving means for saving each instruction for the window including the interdependence relationship, and a part of the saved series of instructions are partially stored. Since it is provided with the determining means for determining the instruction sequence to be re-executed and the reproducing means for reproducing the operation content of the window based on the determined instruction sequence,
It is possible to efficiently perform random partial reproduction or partial reproduction by designating a specific window.

Further, the storage means includes operation content storage means for storing the operation content of the input device and display means for visually displaying the operation content of the window reproduced by the reproduction means. Therefore, it is possible to visually represent an input operation that does not appear directly on the screen, and it is possible to easily understand what operation caused the change in the display content.

[Brief description of drawings]

FIG. 1 is an overall configuration diagram schematically showing an embodiment of a window system according to the present invention.

FIG. 2 is a block diagram of the window system shown in FIG.

FIG. 3 is a schematic diagram showing commands of a window system and interdependence relationships between them.

FIG. 4 is a diagram showing attributes of each section Ci.

FIG. 5 is a flowchart showing a storage procedure.

FIG. 6 is a time chart showing a modified example of FIG.

FIG. 7 is a flowchart showing a reproduction procedure.

FIG. 8 is a flowchart showing a modified example of FIG.

FIG. 9 is a flowchart showing another embodiment (second embodiment) of the reproduction procedure.

FIG. 10 is a flowchart of a development processing routine executed in step S42 of FIG.

FIG. 11 is a screen configuration diagram showing a case where the operation of the window system of the present invention is visually performed on the screen (third embodiment).

[Explanation of symbols]

 5 display device 7 control unit (storing means, determining means, reproducing means)

Claims (4)

[Claims] 1. A saving means for saving each instruction for a window including interdependency, a deciding means for deciding an instruction sequence to be partially re-executed from the stored series of instructions, and the deciding process. And a reproducing means for reproducing the operation content of the window based on the generated command sequence. 2. The storage means stores the time information including the time information, and the reproduction means performs the reproduction processing while maintaining the temporal relation of the time information stored by the storage means. The window system according to item 1. 3. The window system according to claim 2, further comprising an evaluation unit that evaluates an elapsed time between adjacent instructions, and the reproduction unit performs reproduction processing based on the evaluation unit. 4. The storage means includes operation content storage means for storing the operation content of the input device, and also has display means for visually displaying the operation content of the window reproduced by the reproduction means. Claim 1 characterized by the above.
The window system according to claim 3.