JP3138507B2 - Sequence management method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an array management method, and more particularly to an array management method for managing an array which is one of static data structures in a computer programming language.

[0002]

2. Description of the Related Art An array is one of static data structures in a computer programming language. Data having the same structure is arranged adjacent to a storage area.

In the conventional array management method, as shown in FIG. 4A, an array having n spaces at addresses 0 to n-1 for storing n data arranged adjacently on a storage area. 1
And a pointer 2 pointing to one of the n spaces of the array 1. When storing data in the array 1, the pointer 2 indicates in which space the data is to be stored next. I was

In this array 1, data A, B, C, D, E
The case where the five data items are stored in order will be described.

[0005] First, as shown in FIG.
Is stored in the space of the address 0 indicated by the pointer 2 of the array 1, the pointer 2 is advanced by +1 and set to the address 1. Next, as shown in FIG. 4C, the data B is stored in the space of the address 1 indicated by the pointer 2 of the array 1, and the pointer 2 is advanced by +1 and set to the address 2. Similarly, data C,
Addresses 2, 3, and 4 where D and E are indicated by pointer 2 of array 1
, And the pointer 2 is incremented by +1 each time and set to addresses 3, 4, and 5.

FIG. 4D shows a state where the data A to E have been stored as described above. That is, in array 1,
If any data is stored, the data stored in the address space -1 from the address indicated by the pointer 2 is the latest data.

[0007]

The above-described conventional array management method requires a pointer indicating the address of the latest data storage space in addition to the array for storing data.
There was a disadvantage that the program became complicated. Further, there is a disadvantage that it takes time to execute the program.

[0008]

According to the present invention, there is provided an array management method for managing an array having a data structure in which n pieces of data having the same structure are arranged adjacently on a storage area. A first address is assigned to each of the storage areas, and n spaces for setting the n data and storing the n data in the first address order, respectively, are set in the first address of the n data. Performing data movement processing for moving each of the n data to an adjacent space which is a space of a second address obtained by adding 1; the data movement processing inspecting the n space from address 0 in ascending order; Searching for a first space, which is the first empty space in which the first space has not been stored, and, when detecting the first space, assigns a first address of the first space to the first address. Show A second step of storing the first variable in the first variable, a third step of storing a second address obtained by subtracting 1 from the first variable in the second variable, and determining whether the first variable is 0. A fourth step of checking whether or not the first variable is not 0 in the fourth step, and the data of the second address of the second variable stored in the third step is stored in the fourth step. A fifth step of moving to the space of one address, and the first and second address values stored in each of the first and second variables are respectively set to 1
A sixth step of subtracting the first variable and returning to the fourth step, and a step of storing the additional data in the space of the address 0 when the first variable is 0 in the fourth step and ending the processing. 7 steps.

[0009]

Next, embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is a flowchart showing an embodiment of the sequence management method of the present invention.

FIG. 2 is a diagram showing an arrangement state according to an embodiment of the arrangement management method of the present invention.

As shown in FIG. 2A, the array management method according to this embodiment allocates n spaces at addresses 0 to n-1 for storing n data arranged adjacent to each other on a storage area. When storing data in the array 1, the previously stored data is sequentially advanced by +1 of the address, that is, moved to the next adjacent space, thereby storing the empty space. The following data is stored.

Next, the operation of this embodiment will be described.

First, at step A1, the spaces constituting the array 1 are checked in order from address 0, and the first empty space in which no data is stored is searched.

Next, in step A2, if an empty space to be searched is detected, the address of that space is stored in a variable S1 indicating the address. That is, S1 indicates the address of the detected empty space.

Next, at step A3, the variable S2 is set to S1.
-1, that is, the address of the space at the last storage position of the array element that is the data stored in array 1 is stored.

Next, at step A4, it is checked whether or not S1 is the address 0 of the space of the array 1. Otherwise, the process proceeds to step A5, in which the array element in the space of the address of S2 stored in step A3, that is, data
To the address space.

Next, in step A6, the address values stored in S1 and S2 are respectively decremented by 1 to prepare for the movement of the next array element.

Next, returning to step A4, steps A4 to A6 are repeated by the number of array elements.

Finally, in step A4, when S1 matches the address 0 in the space of the array 1, that is, when the movement of all array elements is completed, the flow branches to step A7, and additional data is stored in the space of the address 0 in the array 1. To complete the process.

Referring to FIG. 2, a case will be described in which five data A, B, C, D, and E are sequentially stored in the array 1 as in the conventional example.

FIG. 2A shows an array 1 having n spaces at addresses 0 to n-1 for storing n data arranged adjacently on a storage area.

First, the first data A is stored in the space at the address 0 of the array 1 (FIG. 2B).

Next, when the next data B is stored, all the data in the array 1 is moved to the adjacent space obtained by adding 1 to the address, and then the data B is stored in the space of the vacant address 0 (FIG. 8). 2 (C)).

Similarly, FIG. 2D shows the state of array 1 when data C, D, and E are sequentially stored.

As shown in FIGS. 2B to 2D, in the method of this embodiment, the latest data is always stored in the space of the array 1 at the address 0.

Next, a second embodiment of the present invention will be described.

FIG. 3 shows a second embodiment of the present invention.
(A), (C) is a diagram showing an example of a display screen, (B), (C)
(D) is a diagram showing an array corresponding to each of (A) and (C), and (E) is a block diagram.

This embodiment is applied to an image display processing portion in a microcomputer development support system shown in FIG. 3E, which comprises a display device 5, a personal computer 6, and a development support device 7. is there. This image display is based on a multi-window system that divides a screen into a plurality of areas and displays information. The multi-window display is used as window management means.

FIG. 3B shows the state of array 1 when three windows W1, W2, W3 as shown in FIG. 3A are displayed on the screen of the display device. Here, the latest data W3 indicates the foreground window on the screen.

Next, as shown in FIG. 3C, when a new window W4 is displayed, the state of the array 1 is changed to the state shown in FIG.
As shown in (D), the data of the foreground window W4 is stored in the address 0 space of the array 1. Therefore, the most recent window W which is the latest data
4 can be referenced by checking the space at address 0 of array 1.

[0032]

As described above, according to the array management method of the present invention, n spaces for storing n data in the order of addresses are set , and a new address of the new address obtained by adding 1 to the current address of the data is set . Movement processing for moving data to adjacent spaces is performed , and this data movement processing is performed by n pieces of data.
The space is checked in ascending order from address 0, and no data is stored.
Search the first space, which is the first empty space
When an interval is detected, the first address in the first space is copied.
Stored in a first variable indicating a first address of
Step 2 and a second variable obtained by subtracting 1 from the first variable.
A third step of storing the address in a second variable;
Fourth step to check if variable 1 is 0
And if the first variable is not 0 in the fourth step, the third
The data of the second address stored in the step
A fifth step of moving to a space of one address;
First and second addresses stored in the first and second variables, respectively;
A sixth step of subtracting each one of the
If the first variable is 0 in step 4, additional data
Is stored in the address 0 space, and the process ends.
By including the step, the latest data can be referred to by checking the space of the address 0 of the array, so that the pointer is not required, and thus the program can be simplified. In addition, there is a gutter cormorants effect that can reduce the execution time of the program.

[Brief description of the drawings]

FIG. 1 is a flowchart showing an embodiment of an array management method according to the present invention.

FIG. 2 is a state diagram of an array showing an example of an operation in the array management method of the embodiment.

FIG. 3 is a view showing a multi-window display screen, a state diagram of an arrangement, and a block diagram showing a second embodiment of the arrangement management method of the present invention.

FIG. 4 is a state diagram of an array showing an example of a conventional array management method.

[Explanation of symbols]

 Reference Signs List 1 array 2 pointer 5 display device 6 personal computer 7 development support device

Claims (2)

(57) [Claims] 1. An array management method for managing an array having a data structure in which n pieces of data having the same structure are arranged side by side on a storage area, wherein a first address is assigned to each of the storage areas. A second address space in which n spaces for setting and storing the n data in the order of the first address are set, and one is added to the first address of the n data. Performing data movement processing for moving the n data to the adjacent space, wherein the data movement processing is the first empty space in which the n spaces are checked in ascending order from address 0 and no data is stored. A first step of searching for a first space; and a second step of storing a first address of the first space in a first variable indicating the first address when the first space is detected. Steps and A third step of storing a second address obtained by subtracting 1 from the first variable in a second variable, a fourth step of checking whether or not the first variable is 0; In a fourth step, if the first variable is not 0,
A fifth step of moving the data of the second address of the second variable stored in the third step to the space of the first address, and storing the data in each of the first and second variables First and second
Of the fourth step by subtracting the address value of
A sixth step of returning to step S, and if the first variable is 0 in the fourth step,
A seventh step of storing the additional data in the address 0 space and ending the processing. 2. The array management method according to claim 1, wherein the data is data of individual windows in a multi-window system that divides a display screen into a plurality of regions and displays information on each of the regions.