JPH0586579B2 - - Google Patents

Description

[Detailed description of the invention]

FIELD OF INDUSTRIAL APPLICATION The present invention relates to a device for creating a transposed matrix from an original matrix. 2. Description of the Related Art Conventionally, so-called pocket computers have been used that process data groups having a two-dimensional matrix arrangement. In such a pocket computer, when attempting to obtain a data group having an arrangement pattern corresponding to a transposed matrix with respect to the matrix-like data group, the following technique is typically used. In the first conventional technique, the above-mentioned matrix form (hereinafter, explanation will be given assuming a matrix with a maximum number of columns C0 and a maximum number of rows L0)
A second storage element having at least the same storage capacity as the first storage element that stores a data group is prepared. Of the data matrix stored in the first storage element, data aij(i =1,2,…,C0;j=1,2,…,
L0) is stored in the j-th row and 0th column of the second storage element. In this way, a data matrix having an arrangement pattern corresponding to the transposed matrix of the data matrix stored in the first storage element can be obtained in the second storage element. In the second prior art, with respect to a program that processes a data group in a matrix, all steps for processing columns in the row direction and columns in the data group include:
Insert processing to swap rows and columns. With such a conventional technique, it is possible to obtain a data group in the arrangement form of a transposed matrix for a matrix-like data group. Problems to be Solved by the Invention In the first prior art as described above, the storage capacity of the storage element to be installed in the pocket computer that performs such processing increases unnecessarily, and the configuration becomes complicated. I end up. Further, the second prior art has problems such as the program for controlling the operation of the pocket computer becoming unnecessarily complicated. An object of the present invention is to solve the above-mentioned problems and to provide a transposed matrix creation device that can generate a data group with a matrix-like data group in an arrangement format corresponding to the transposed matrix using a simple configuration. It is to provide. Means for Solving the Problems The present invention provides the following methods: (a) Each matrix element constituting an original matrix having a maximum number of columns C0 and a maximum number of rows L0 is sequentially divided into 1 elements in each row in the row direction. (b) display means for displaying a matrix constituted by matrix elements stored in the storage means; (c) register 31; (d) m-th row The matrix elements of column n are stored in the register 31, the first value a corresponding to the matrix element of the mth row and nth column is determined as a=(m-1)C0+n, and then the second value a ' is obtained as a'={(a-1)-[a-1/C0]C0}L0+{[a-1/C0]+1} and stored in the storage means corresponding to the second value a'. The matrix element stored in the register 31 is exchanged with the matrix element stored in the register 31, and after the exchange, a second value a' is calculated for the matrix element stored in the register 31 and stored in the storage means. transposed matrix creation means for replacing the matrix element corresponding to the first value a and repeating such switching operation to create matrix elements constituting the transposed matrix as one-dimensional data. This is a matrix creation device. Effect According to the present invention, the original matrix has a maximum number of columns C0 and a maximum number of rows L0, and each matrix element is stored in the storage means as one-dimensional data in the row direction (i.e. The register 31 stores matrix elements in the m-th row (i.e., the m-th from the top) and the n-th column (i.e., the n-th from the left) of the original matrix in the register 31. The first value a is determined, the second value a' is determined based on the first value a, and the second value a' is stored in the storage means corresponding to the second value a'. Swap the matrix element with the matrix element stored in the register 31, and after the swap, calculate the first value a and the second value a' for the matrix element stored in the register 31, By exchanging the matrix elements corresponding to the first value a of the original matrix that is equal to the second value a' and repeating this operation, the matrix elements constituting the transposed matrix can be converted into one-dimensional data. can be created and stored in the storage means. Embodiment FIG. 1 is a front view of a so-called pocket computer (hereinafter referred to as a computer) 1, which is a data processing device according to an embodiment of the present invention, and FIG. 2 is a block diagram showing the electrical configuration of the computer 1. It is a diagram. The configuration of the computer 1 will be described with reference to FIGS. 1 and 2. At one corner of the front panel 2 of the computer 1, there is provided a display section 4 which is a display means and is realized by, for example, a liquid crystal display element (LCD). The display section 4 is, for example, a matrix drive type, and has a display capacity for one line of, for example, 24 digits. Near the display section 4, there is a character input key group 5, which is used to input characters such as item names when creating a table as described later, and which also serves as a so-called function key, and a numerical input key, which is a so-called numeric keypad. A key group 6, an operator (for example, "÷", "+", etc.) instruction key group 7, a cursor key group 8, and the like are arranged. Further, the table function key 9 realizes a table data creation function as described later, and the row direction key 10
has a function of selecting each row to be input in the data matrix when creating two-dimensional table data as described later. Similarly, the column designation key 11 has the function of designating the column to be input in the data matrix. Further, the replacement key 12 has a function of generating a data matrix in an arrangement format corresponding to a transposed matrix of the data matrix with respect to tabular data created as described later. The computer 1 includes a central processing unit (hereinafter abbreviated as CPU) 1 that controls various data processing of the computer 1.
Equipped with 3. A key input unit 14 including the aforementioned character input key group 5 is connected to the CPU 13 via a key input buffer 47, and a display control unit 15 is connected to the CPU 13.
The display section 4 is connected via the. The display control unit 15 is provided with a display buffer 16.
Data to be displayed on the display unit 4 is temporarily stored. Also connected to the CPU 13 are a fixed storage section 17 made up of, for example, a ROM (read only memory), and a storage section 18 made up of, for example, a RAM (random access memory). Fixed storage section 17 and storage section 18 constitute storage means. The fixed storage unit 17 includes an initial program area 19 that stores an initial program that controls initial setting processing when the computer 1 is started, and an interpreter program for a high-level language such as BASIC used in the computer 1. The code is extracted from an interpreter area 20, a table processing program area 21 in which a program for performing table processing as described later is stored, and character code data input to the CPU 13 in response to key operations in the key input unit 14. It includes a CG program area 22 in which a program (hereinafter abbreviated as CG program) for generating a dot pattern of a display character corresponding to the above is stored, and a system program area 23 in which various other system programs are stored. The storage unit 18 also includes a user program area 24 for storing BASIC programs and various data arbitrarily created by the operator of the computer 1, a table data area 25 for storing table data to be described later, and various buffers, It also includes a system area 26 to which counters, registers, etc. are allocated. The system area 26 includes an h counter 27 which is a parameter corresponding to the title for identifying a plurality of tables, an m counter 31 which is a parameter identifying the position in the column direction (vertical direction) of each table, that is, each row, It includes an n counter 29 which is a parameter for identifying each column which is each position in the row direction (horizontal direction). Furthermore, there is an F register 30 which is a set of row/column swapping completion flags set for each data in the table, an X register 31 used for this row/column swapping process, a C,
M, N, A, B registers 33, 34, 35, 3
6 and 37 are set, respectively. FIG. 3 is a diagram showing how various types of data are allocated in the table data area 20. The table data area 25 is allocated to a part of the user program area 24, and each data is stored for each input process described below or
It is stored by the conversion data allocation command of the BASIC program, and table data is created. The data example of the table data area 25 shown in FIG. 3 corresponds to the following table 1, and each item of the table data is formed with a fixed length of, for example, 16 bytes.

[Table] From the top address side of the table data area 25,
A definition area 38 is set in which the string function ThS|(C) to which the table title and column item name of each table are assigned, and the numerical value of the number of column items (actually, the number of column items + 1) are defined and assigned. Ru. Below, C register 33
Using the count value C as a parameter, column item areas 39a to 39e are set in which the column names shown in Table 1 are stored as T0S|(0)="Suugaku"...(1). Subsequently, a definition area 40 is set, and a string function DhS|(L) to which row item name data such as "Aoki" in Table 1 is assigned is stored. Hereinafter, the line item name area 41a,
41b, 41c, . . . are set, and the line item names are stored, for example, D0S|(0)=“Aoki” . . . (2). Subsequently, the definition area 42 in which the numerical function Dh (m, n) to which input data corresponding to the points in the case of Table 1 is assigned is defined is set, and subsequently the data areas 43a, 43b, ... are set and inputted. Each data is stored as, for example, D0(0,0)=30...(3). These data are automatically allocated to the table data area 25 for each input process,
It can also be allocated by variable commands in the BASIC language. Furthermore, access to read each of these data is performed according to the number of items stored in the definition areas 38, 40, 42, etc. along with the variable names.
The address value of the data location is calculated. The data shown in the area 44 of the table data area 25 is
The maximum number of columns C0 (the maximum number of matrix elements in the row direction, that is, the horizontal direction) and the maximum number of rows L0 (the maximum number of matrix elements in the column direction, that is, the vertical direction) of the data matrix defined in the definition area 42. Therefore, this data is allocated when no input is made by operating the computer 1 in the assumed area, and all of this data is stored in the corresponding area of the table data area 25. Further, the data shown in the area 45 is data indicating the absence of data, and is stored when the missing value key 46 shown in FIG. 1 is operated. These numerical data are maximum value/maximum value numerical data that can be used in the calculator 1, and the reason why such numerical data is used to indicate non-input/absence of the data is as follows. That is, although the computer 1 can use special codes based on the BASIC language or the like for the above purpose, the computer 1 is capable of processing programs such as the BASIC language, and thus uses various code systems. Therefore, the aim is to place as few restrictions as possible on such a code system. .
Furthermore, in data processing, the maximum/minimum value of the data processing capacity of the computer 1 almost never occurs. FIG. 4 is a flowchart illustrating the procedure for inputting table titles and column item names in the calculator 1 shown in the first figure. The operation of this embodiment will be described with reference to FIGS. 1 to 4. Figure 4 Step a
1, operate the table function key 9 of the calculator 1. By this operation, in step a2, the count value h of the h register 27, which stores the numbers assigned to each of the plurality of input tables, is initialized to, for example, "0". In step a3, the CPU 13 transfers the data “Table title”; h+1; “=?” to the display buffer 16 of the display control unit 15.
and displayed on the display section 4. In step a4, the key input unit 14 of the computer 1
At step a5, it is determined whether the operated key is the character input key group 5 for inputting alphabets, kana, etc., and if the answer is negative, the process moves to step a6. If the judgment in step a5 is affirmative, the process moves to step a7, where the key-input character code is taken into the key-input buffer 47, and the code is developed into a character pattern using the CG program area 22. Then, in step a8, it is given to the display control section 15 and displayed on the display section 4. After this, the process returns to step a4 again, and the process returns to step a4 described above.
The process with steps 4 to a8 as one cycle is repeated. In this way, the title of the table to be created in the subsequent process, "Seiseki Hiyo", is stored in the key input buffer 47 and displayed on the display section 4. If the result of the determination at step a5 is negative, the process moves to step a6, where it is determined whether the operated key is the column designation key 11 or not. If the judgment result is negative, the process moves to step a9, and if the judgment result is affirmative, the process moves to step a10. In step a10, the contents of the key input buffer 47 in which data was stored in step a7 are converted to the string function ThS|(C) (actually, h
= 0, C = 0). The processing from step a10 onwards moves to input of column item names. If the determination at step a6 is negative, the process moves to step a9, where it is determined whether the operated key is the front function key 9 or not. If the result of the determination is negative, the process returns to step a3, and the process described above is performed. If the determination at step a9 is affirmative, the process moves to step a11, where it is determined whether the count value h is, for example, 9. That is, the computer 1 of this embodiment has a function of creating, for example, nine tables. Of course, the number of items in this table may be greater than or equal to nine, or may be less than nine. If the judgment at step a11 is negative,
Calculator 1 is now able to create another table, increments the count value h by +1 at step a12, and returns the process to step a3. step a1
If the judgment result in step 1 is affirmative, it is impossible to create any more tables, and in step a13 the count value h is initialized to "0" and the title of the first table is displayed on the display section 4. , the process returns to step a3. The process subsequent to step a10 is to input the column item name, and in step a14, the count value C of the C register 33 representing the column item number is initialized to, for example, "0". At step a15, a table display asking for column item names is displayed on the display section 4 in a format similar to step a3. At step a16, key inputs from the key input section 14 of the computer 1 are read. In step a17, it is determined whether or not the character input key group 5 has been operated.
If negative, the process moves to step a18, and if affirmative, the process moves to steps a19 and a20, where the input character code is stored in the key input buffer 47 and then displayed on the display section 4, similarly to steps a7 and a8. do. The subsequent processing is step a16.
Move to. If the determination in step a17 is negative, it is determined in step a18 whether the column designation key 11 has been operated or not, and if negative, the process returns to step a16 and the above-described process is repeated. If affirmative,
Proceeding to step a20, it is determined whether the stored contents of the key input buffer 47 are blank.
If the judgment result is negative, the process proceeds to step a22.
, the allocation contents of the string function ThS|(C) are assigned to the string function ThS|(C+1). Thereafter, in step a23, the current memory contents of the key input buffer 47 are allocated and stored in the string function ThS|(C). Thereafter, the count value C is incremented by +1 at step a24, and the process returns to step a15 again. To summarize the processing in steps a22 to a24, each time a column item name is input, the table title stored for each string function is sequentially changed to the adjacent string function whose address increases. The latest column item name is assigned to the string function ThS|(0) corresponding to C=0. If the judgment in step a21 is affirmative, it means that the column instruction key 11 was operated without operating the character input key group 5, which means that the input of the column item name has ended in the table. ,
Thereafter, the process moves to a process for inputting line item names as shown in FIG. FIG. 5 is a flowchart illustrating the process of inputting line item names, which is performed subsequent to the process in the flowchart of FIG. With reference to Figures 1 to 5,
The procedure for inputting line item names will be explained. In step b1 of FIG. 5, the count value L of the C counter 33 representing the number attached to the line item name is, for example, "0".
In step b2, data such as "L";"=?" is displayed on the display section 4. In the subsequent step b3, the key input from the key input unit 14 is read, and in steps b4 and b5, it is determined whether the character input key group 5 or the line instruction key 10 has been operated, respectively. If both keys have not been operated, the process returns to step b3 and the key input reading operation is performed again. If the judgment result in step b4 is affirmative, step b
Steps 6 and b7 are sequentially moved to steps a7 and b7 shown in FIG.
The character corresponding to the character code taken in is displayed on the display section 4 in the same procedure as described in a8. If the judgment at step b4 is negative, the process moves to step b5, and if the judgment at step b5 is affirmative, the input of the first line item name of the table to be input is completed and the input of the next line item name is requested. This means that At this time, the process moves to step b8, and it is determined whether the stored contents of the key input buffer 47 are blank. If the determination is affirmative, input of line item names has been completed, and the process moves on to input processing of table data shown in FIG. 6, which will be described later. If the determination at step b8 is negative, the process moves to step b9, where the contents of the current key input buffer 47 are stored in the string function DhS|(L), and at the following step b10, the count value L is incremented by +1. Subsequently, the process returns to step b2, and a message indicating whether or not to input a new line item is displayed on the display section 4. If the input of the desired line item name has been completed, the line specification key 10 is operated again, and at this time the process moves to step b8 via steps b4 and b5, and the memory contents of the key input buffer 47 are blank. Something is determined. The process moves to a tabular data input processing mode, which will be described later with reference to FIG. FIG. 6 is a flowchart illustrating the procedure for inputting numerical data, which is the score for the title "Seiseki Hiyo" shown in Table 1 above. The data input procedure will be explained with reference to FIGS. 1 to 6. At step d1 in FIG. 6, the count values m and n of the m counter 28 and the n counter 29 indicating the column direction position and row direction position of the input data and the count value h of the h register indicating the table number are set to, for example, " Initialize each to 0. In step d2,
The data area 43 shown in FIG. 3 of the numerical function Dh (m, n) (actually h=m=n=0) defined in the definition area 42 of FIG. Only L0×C0 is secured for the value L0, and numerical data representing a data-uninput state shown in area 44 is stored. Next, in step d3, a string function ThS|
Regarding (C), DhS|(L), DhS|(m); THS|(n); “=?” …(A) is displayed on the display section 4, and the key input section 14 is operated in step d4. Load the key. In steps d5, d6, and d7, it is determined whether the obtained key input is the numerical input key group 6, the exchange key 12, or the column instruction key 11, respectively. If the determination at step d5 is affirmative, the input numerical value is stored in the key input buffer 47 at step d8, and this numerical value is displayed on the display section 4 at step d9. When inputting such numerical data is completed, "63", for example, is displayed in the first row and first column of the table displayed on the display section 4. If the judgment at step d5 is negative, step d
If the judgment in step 6 is affirmative, it means that the input of numerical data in the table has been completed and a request is made to perform matrix permutation processing as described later, and the process proceeds to step d1.
This process, which will be described later, is carried out at step 0, and the process returns to step d4. If the judgment at step d6 is negative, step d
If the judgment in step 7 is affirmative, it means that the input of one column of data in the data input of the row concerned has been completed and the input of the next column is requested, and the process returns to step d.
Move on to 11. In step d11, the memory contents of the key input buffer 47 are changed to the data function Dh(m,n).
(currently h = m = n = 0), and in step d12, the number n of columns in the table into which data has been input is changed to the maximum number of columns (matrix elements in the row direction, that is, in the horizontal direction) determined in step d2. is the maximum number of
In the matrix of Table 2, which will be described later, it is determined whether C0 = 3). That is, it is determined whether data input for all columns of the row has been completed. If the judgment result is negative, it becomes possible to input data for the next column, and in step d13, the count value n indicating the number of columns is incremented by +1, and the process returns to step d3. If the judgment result in step d12 is affirmative, it means that data input for all columns of the row has been completed, and the process moves to step d14, where a count value m representing the number of rows in the table currently undergoing data input work is input.
is the maximum number of rows L0 determined in step d2 (the maximum number of matrix elements in the column direction, that is, the vertical direction,
In the matrix of Table 2, which will be described later, it is determined whether it is equal to L0=6). If they are equal, the data input process ends. If they are not equal, it is possible to input the next line, and in step d15 the count value m
is incremented by +1, the process advances to the next row, and in step d16 the count value n is initialized to, for example, "0", making it possible to input the first column of the row. After doing this, the process goes to step d.
Returned to 3. If the judgment result in step d7 is negative, it means that the operator is performing an operation other than data input operation, and the process proceeds to step d1.
7, d18, d19, and d20 in sequence, and the operated key is either the right key 48 or the down key 49 of the cursor key group 8.
, the upper key 50, or the left key 51. If the operated key is not in the cursor key group 8, the process returns to step d4. In these judgment processing steps d17 to d20, if the judgment result is affirmative, the processing proceeds to steps d21, d22, d23, and d2, respectively.
4, the count value n indicating the column position in the row direction (that is, the horizontal direction) is incremented by +1, and the count value m indicating the column position in the column direction (that is, the vertical direction) is incremented by +1, and this count value m is decremented by -1, and the count value n is decremented by -1.These steps d2
Processes 1 to d24 are performed to obtain a display in which the cursor 52 is moved in an arbitrary direction indicated by the cursor key group 8 on the display section 4. The processes from steps d21 to d24 commonly proceed to step d25, where it is first determined whether the count value n representing the number of columns is equal to (C0+1). This is the cursor 52 on the display section 4.
It is determined whether the table exceeds the currently displayed table in the row direction. If this judgment is established, the count value n is decremented by -1 in step d26, and
The process moves to step d27 without bringing the cursor 52 out of the way. If the result of the judgment at step d25 is negative, the process moves to step d27 without performing the process of step d26. In step d27, it is determined whether or not the cursor 52 on the display section 4 is displayed at a position beyond the table being input in the column direction. If the result of the judgment is affirmative, the count value m is decremented by -1 in step d28, and the process moves to step d29 without moving the cursor 52 out of sight. If the above judgment is negative, the process moves to step d29 without performing the process of step d28. In step d29, it is determined whether the count value n is negative. This is a determination as to whether the cursor on the display section 4 is displayed at a position beyond the table to the left. If the judgment result is affirmative, the count value n is set to 0 in step d30, and the process moves to step d31. If the above judgment is negative, the process moves to step d31 without performing step d30. In step d31, it is determined whether the count value m is negative. This is a determination as to whether or not the cursor on the display section 4 is displayed above the table. If the judgment result is affirmative, the count value m is set to 0 in step d32, and the process moves to step d4. If the above judgment is negative, the process moves to step d4 without performing the process of step d32. By performing the processes shown in FIGS. 4 to 6 in this manner, the title, column item name, row item name, and each data of the table to be created can be input. In this way, Table 1 above can be created. FIG. 7 is a flowchart showing a processing procedure for exchanging rows and columns of a created table according to an embodiment of the present invention. This replacement process will be explained with reference to FIGS. 1 to 7. The data function Dh(m, n) explained with reference to FIG. , in the top row from the leftmost column to the right, and then in the second row from the leftmost column to the right, sequentially count the matrix elements and give a series of numbers, and use this number as a variable to create a one-variable data function Dh (a) is defined as follows. Dh(a)≡Dh(m,n)...(4) Here, a=(m-1)C0+n In this way, the data function Dh(m,n) has a one-variable data function Dh(a) corresponds to 1:1.
Using such a one-variable data function Dh(a),
If you display only the numerical data part of Table 1 above,
The following Table 2 is obtained.

[Table] The purpose of this embodiment is to transpose the rows and columns of Table 2 above to generate the data matrix shown in Table 3 below.

[Table] Replace key 1 shown in Figure 1 at step e1 in Figure 7
2, and by this operation, the count value is initialized to "1" in step e2. At step e3, the numerical data assigned to Dh(1) ("63" according to the example in Table 1) is stored in the X register 31 of the storage section 18. Here, the data function Dh(a), together with the corresponding numerical data shown in Table 1, has a logical value of "1" when the replacement process described later is completed, and a logical value of "1" when it is not completed. A replacement completion flag of "0" is also assigned. In other words, at this moment, the replacement process has just been started, and the replacement completion flags regarding the data function Dh(a) of all count values a are all logical values "0", and together with the numerical data shown in Table 1 above, , the contents of this flag are stored in the X register 3 in step e3.
It is stored in 1. In step e4, it is determined whether the switching completion flag assigned to the data function Dh(a) has a logical value of "1". At this moment, this flag has a logical value of "0", and the process moves to step e5, where the replacement completion flag of this data function Dh(1) is set to a logical value of "1". At step e6, data including the replacement completion flag of logical value "1" is stored in the X register 31 again. In step e7, a new count value a' that can realize the process of replacing the count value a from the second table to the third table is calculated based on the following formula. a'={(a-1)-[a-1/C0]C0}L0+{[a-1/C0]+1}...(5) The count value a (in this example, a
= 1, 2, ..., 18) corresponding data function Dh(a)
data, a′ (third
The numbers are shown in numbers 1, 2, ..., 18 in the table)
This corresponds to This correspondence is shown in Table 4 below. In the fifth equation above, the meaning of (1) of [a-1/c0] is the largest integer that does not exceed the value of the operation result of a-1/C0, for example, a-1=4, c0= If it is 3, [a-1/c0] becomes 1, and if a-1=8 and c0=3, it becomes 2.

[Table] As shown in step e2 above, when a=1 is set, a'=1 is calculated from the fifth equation and Table 4 above. Therefore, step e
The replacement completion flag of Dh(a') (a'=1) in step e5 has already been set to "1" in step e5, so Dh(1) is set to a'=1 in Table 3. The process moves to step e9 while the position remains fixed. At step e9, the count value a is incremented by +1, and at step e10, it is determined whether this count value a exceeds the number of elements S|(18) of the numerical data in Table 1. At this point, this determination is negative, and the process returns to step e3. At step e3, the data of Dh(2) is stored in the X register 31, and at step e5, the data relationship is
The replacement completion flag of Dh(2) is set to "1". Hereinafter, steps e6 and e are similar to the above explanation.
7 is performed, and a'=8 is calculated from a=5 from the fifth equation and Table 4 above. Therefore, in step e8, it is determined whether the replacement completion flag of the data function Dh(a') (a'=8) is "1", and the result is negative at this time, and the process moves to step e11, where the data Set the replacement completion flag of function Dh(a') to "1". In step e12, the data function Dh(a') (a'=
8) Data including the contents of the replacement completion flag,
X where data including the replacement completion flag of data function Dh(2) is transferred in step e6
Data is exchanged with the data in the register. Therefore, the data of the data function Dh(2) is given to the data function Dh(a') (a'=7). That is, the data function Dh(2) is assigned to the location a'=7 in Table 3. Also here, X register 3
1 stores the data of the data function Dh(7) of the transposed matrix. Therefore, the data matrix of the transposed matrix can be generated by setting the numerical data of the register to the matrix element of the data function Dh(a') in the arrangement form of the transposed matrix. Thereafter, the process returns to step e7, and the data function Dh(7) is associated with the data function Dh(a') (a'=3), as is clear from equation 5 and Table 4 above. That is, as shown in Table 3, the data function Dh(7) is assigned to the location indicated by a'=3. Below, steps e7, e8, e11, e1
By repeating the process in which 2 is one cycle, a stage is reached where the process of "4→2" in Table 4 above is performed. That is, at this time, a'=2 is calculated in step e7. At this point, only the data function Dh(18) in Table 2 has not been replaced as shown in Table 3. At step e8, data function Dh(a') (a'=2)
It is determined whether the replacement completion flag of is "1". At this time, the replacement completion flag of the data function Dh(1) has already been set in the process regarding a=1.
It is set to "1" at step e5, so the determination at step e8 is affirmative, and the process moves to step e9. At step e9, the count value is incremented by +1, and a
=3, the process moves to step e12, this judgment becomes negative, and the process moves to step e3. In step e3, the contents of the data function Dh(3) are
It is transferred to the X register 31 together with the contents of the replacement completion flag, which has already been set to "1".
At step e4, the determination result is affirmative, and the process moves to step e9. Similarly, step e
9, e10, e3, and e4 are repeated as one cycle, and the count value a is sequentially incremented by +1 until the count value a is reached when the incremented result at step e9 becomes a=19. At this time, the judgment at step e10 becomes affirmative, and the process moves to step e13, where all the replacement completion flags for the arbitrary count value a are reset to "0". In this way, the row/column swapping process from the data matrix in Table 2 to the data matrix in Table 3 is completed. As described above, according to this embodiment, by using the processing program shown in the flowchart of FIG. 7 and using only the X register 31, which is a working register for exchanging rows and columns,
Column swapping processing can be realized. In other words, the replacement program in the electronic computer 1 that uses such a replacement program is greatly simplified, and there is no need to prepare a memory with an unnecessarily large storage capacity as described in the prior art, and the configuration is significantly simplified. be able to. Effects As described above, according to the present invention, a simple program and a
This can be realized by using a single register. Therefore, the configuration of such a data processing device is greatly simplified, and the operability is also greatly improved. That is, according to the present invention, each matrix element constituting the original matrix is stored as one-dimensional data in the storage means, and the first value a and the second value a' are calculated and stored in the register 31. By repeatedly exchanging matrix elements, the storage contents of the storage stage can be reconfigured as one-dimensional data of a transposed matrix, and the register 31 has a storage capacity that can store one matrix element. , and the calculation of the first value a and the second value a' is relatively simple, thus making it possible to easily obtain the transposed matrix from the original matrix.

[Brief explanation of the drawing]

FIG. 1 is a plan view of a computer 1 according to an embodiment of the present invention, FIG. 2 is a block diagram showing the electrical configuration of the computer 1, FIG. 3 is a diagram showing the data allocation state of the table data area 25, and FIG. The figure is a flowchart showing the procedure for inputting table titles and column item names in calculator 1.
FIG. 5 is a flowchart showing the procedure for inputting row item names, FIG. 6 is a flowchart showing table data input processing, and FIG. 7 is a flowchart showing table row/column replacement processing. 1...Calculator, 4...Display section, 5...Character input key group, 6...Numeric input key group, 9...Table function key, 10
... Row direction key, 11 ... Column direction key, 12 ... Replace key, 14 ... Key input section, 25 ... Table data area,
31...X register, 39...column item name area, 41...
Line item name area, 43...data area, 47...key input buffer.

Claims (1)

[Scope of Claims] 1 (a) Each matrix element constituting an original matrix having a maximum number of columns C0 and a maximum number of rows L0 is stored as one-dimensional data, each row sequentially and sequentially in the row direction. (b) display means for displaying a matrix constituted by matrix elements stored in the storage means; (c) a register 31; (d) a matrix in the m-th row and n-th column. The element is stored in the register 31, the first value a corresponding to the matrix element in the mth row and nth column is determined as a=(m-1)C0+n, and the second value a' is then a ' = {(a-1)-[a-1/C0]C0]L0 +{[a-1/C0]+1}, and the matrix stored in the storage means corresponding to the second value a' The element and the matrix element stored in the register 31 are swapped, and after the swap, a second value a' is calculated for the matrix element stored in the register 31, and the first value stored in the storage means is calculated. A transposed matrix creating device, comprising a transposed matrix creating means for exchanging the matrix elements corresponding to a and repeating such an exchanging operation to act as one-dimensional data on the matrix elements constituting the transposed matrix.