JPS6336475A - Data processor - Google Patents

Abstract

PURPOSE:To generate a data group having an arrangement mode corresponding to a transposed matrix concerning a matrix-shaped data group with simple constitution by providing a memory means to store the data group having the matrix-shaped arrangement mode. CONSTITUTION:A fixing memory part 17 and a memory part 18 constitute a memory means and stores a data group having the matrix-shaped arrangement mode. The data of one optional arrangement position of a data matrix stored into the memory means are stored into a register 31, and on the other hand, to the arrangement position of the data, the arrangement position corresponding in the transposed matrix of the matrix is calculated. To the arrangement position of the calculating result, the data from the register 31 are transferred. By repeating such a processing, a data column having the arrangement mode corresponding to the transposed matrix can be obtained from a data matrix.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to a data processing device capable of processing a data group in matrix form.

BACKGROUND ART Conventionally, a so-called pocket computer has been used to process a data group 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 prior art, the matrix (hereinafter mIT″n
A second storage element having at least the same storage capacity as a first storage element that stores a data group (described assuming a matrix of columns) is prepared. Of the data matrix stored in the first storage element, the i-th? 〒Jth column data aiJ('!
= 1.2 +..., m, J: 1.21...+
n) is stored in the arrangement position of row PJj and first 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 prior art of fiIJ2, regarding a program that processes a data group in an array, a process for exchanging rows and columns is inserted in all steps that process columns in the row direction and columns in the data group.

With such a conventional technique, it is possible to obtain a data group in the arrangement form of a transposed matrix for a data group in the form of an iterated column.

Problems to be Solved by the Invention In the prior art @1 as described above, the storage capacity of the storage element to be installed in the pocket combinator that performs such processing increases unnecessarily, and the configuration becomes complicated. It becomes what it is. Furthermore, the second prior art has problems such as the program for controlling the operation of the pocket computer becoming unnecessarily complicated.

The purpose of the present invention is to solve the above-mentioned problems and to provide a simple and
For a matrix-like data group, the array corresponding to its transposed matrix! ! ! An object of the present invention is to provide a data processing device capable of generating a data group in a similar manner.

Means for Solving the Problems The present invention includes a storage means for storing a data group having a matrix arrangement, a display means for displaying the data rows and columns, and a renostar, and using the renostar, Regarding the data matrix, the data processing apparatus is characterized in that a data matrix having an arrangement form of a transposed matrix is generated.

Operation The data processing device based on the present invention includes a storage means for storing a data group having a matrix arrangement. The data at any one array position of the data matrix stored in the storage means is
For the array position of the data stored in the renostar, the position is calculated in the corresponding array in the transposed matrix of this matrix. The data from the renostar is transferred to the array position of the calculation result. By repeating such processing, a data string having an arrangement pattern corresponding to the transposed matrix can be obtained from the data matrix.

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 calculation 8!1 will be explained 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, of 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 #5, which is used when entering characters such as item names when creating a table as described later, and also serves as a so-called function key, and a so-called numeric keypad. A group of numerical input keys 6, a group of operator keys (for example, "÷" or "+j, etc.) instruction keys 7, a group of cursor keys 8, etc. are arranged. Table function keys 9 are used to create table data as described later. The row direction key 10 has the function of selecting each row to be input in the data matrix when creating two-dimensional table data as described later. It has the function of instructing the column to be input in the matrix.Also, the exchange key 12 is
Regarding tabular data created as described below, it has a function of generating a data matrix in an arrangement format corresponding to a transposed matrix of the data matrix.

The total 11 includes a central processing unit (hereinafter abbreviated as CPU) 13 that controls various data processing of the computer 1 . C.P.
A key manual section 14 including the aforementioned character manual key group 5 is connected to U13 via a key cover 7747, and the display section 4 is connected via a display control section 15.

The display control unit 15 is provided with a display buffer 716, which temporarily stores data to be displayed on the display unit 4.

The CPU 13 also includes a fixed storage section 17 configured by, for example, ROM (read only memory).
For example, a storage unit 18 constituted by a RAM (random access memory) or the like is connected. Fixed storage unit 1
7 and the recording section 18 constitute a 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 programmer A l, r used in the computer 1 for high-level languages such as BASIC. A stored interpreter header 20, a table processing program area 21 in which a program for performing table processing as will be described later is stored, and a key human power section 14.
A program (hereinafter referred to as C
The GC program (abbreviated as GC program) includes a CG program area 22 where it is stored, and a system program header 23 where various other system programs are stored.

In addition, the storage unit 18 stores calculation 8! A user program area 24 for storing BASIC programs and various data arbitrarily created by the f1 operator, a table data area 25 for storing table data to be described later, and various buffers, counters, registers, etc. and the allocated system area 26. The system area 26 contains 11 counters 2, which are parameters corresponding to titles for identifying multiple tables.
7, a counter 31 which is a parameter for identifying the column direction position of each stage, that is, each lamp, and an n counter 29 which is a parameter for identifying each column. 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, which is used for this row/column swapping process,
Nosta 33, 34, 35, 36, 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 piece of data is stored for each input process described below or by an instruction for assigning variable data in a 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.

(Left below is blank space) From the first address side of the first table data area 25, a string function TI is used to assign the table title and the column item name of each row.
A definition area 38 is set in which +$(C) and a numerical value of the column order number (actually, the column order number +1) are defined and allocated. Hereinafter, using the count value C of the C register 33 as a parameter, the column item names shown in Table 1 are as follows: TO$(0) = "Sweet" ... (1)
Column item name areas 39a to 39e stored as follows are set.

Definition 1 area 40 continues to be set, and “Aoki” in Table 1
String function D to which line item name data such as
b$(L) is stored. Hereinafter, the line item name area 41a will be displayed using the count value as a parameter.

41b, 41c, . . . are set, and for example, D OS (0) = “Aoki” . . . (
The line item names are stored as shown in 2).

Subsequently, a definition area 42 is set in which a numerical function DI+(+1]) to which input data corresponding to the points in the case of Table 1 is assigned is defined, and data headers 43a and 43b are subsequently set.
+... is set and each input data is, for example, Do(0,0)=30...(3)
It is written like this. These data are automatically allocated to the table data area 25 for each input process, and are
It can also be allocated by a C language variable command. In addition, access to read each of these data is as follows:
The address value of the data position is calculated based on the number of items stored together with the variable name in 8.40.42, etc.

The data shown in the area 44 of the table data area 25 has the maximum length L in the column direction of the data matrix defined in the constant aa area 42.
This is data that is allocated when no input is performed by a total of 11 operations in the area assumed by O and the maximum row direction length Co, and all of this data is stored in the corresponding area of the table data area 25. Ru. Further, the data shown in the area 45 is data indicating the absence of data, and is stored when the missingness key 46 shown in figure m1 is created.

These numerical data are minimum/maximum value numerical data that can be used in total 11, and the reason why such numerical data is used to indicate non-input/absence of the data is as follows. That is, the computer 1 uses BASIC
Although special codes based on languages etc. can be used for the above purpose, the calculations are beyond the BAS I
It enables program processing in languages such as C language, and therefore uses various code systems. Therefore, the purpose is to avoid giving the ♂11 reduction to such a code system as much as possible. Furthermore, in data processing, the maximum value/i small value of the data processing capacity of the computer 1 almost never occurs.

FIG. 4 is a chart from 70 to 70 for explaining the procedure for inputting the table title and column item name in the calculator 1 shown in the first figure.

The operation of this embodiment will be described with reference to FIGS. 1 to 4. At step a1 in FIG. 4, the table function key 9 of the computer 1 is operated. With this operation, in step a2,
Store the numbers assigned to each of the input tables.H Renostar 27 count value] 1, for example rOJ
Initialize to .

In step a3, the CPU 13 selects the “table title”
, 'h+1;"=?" is stored in the display buffer 716 of the display control section 15 and displayed on the display section 4.

In step a4, the key input from the key input unit 14 of the calculator 1 is read, and in step a5, it is determined whether the pressed key is a character entry group 5 for inputting full 7 Abets, kana, etc. If the answer is negative, proceed to step a6. If the judgment in step a5 is affirmative, the process moves to step a7, where the key manually inputted character code is taken into the key manually inputted bar 7T47, and the code is developed into a character pattern using the CG program head area 22. , is given to the display control unit 15 in step a8, and displayed on the display unit 4. After this, the process returns to step a4 again, and steps a4 to
The process with a8 as one cycle is repeated, and in this way, the title of the table to be created in the subsequent process, "Seiseki Hitau", is stored in the key manual buffer 47 and displayed on the display section 4.

1 with the above entry template A5! If the result is negative, the process moves to step a6, and it is determined whether the operated key is the column designation key 11 or not. 1! IIFIR
If the result is negative, the process moves to step a9;
If affirmative, move to step alo. Step al.

Now, the memory contents of the keypad 7a 47, where the data was stored in step a7, are stored in the string function Tb$(C) (actually, h=o, C=O). The processing after this step alo is
Move on to input column item names.

If the judgment in the entry template a6 is negative, the process moves to step a9, and the operated key is the front function key 9.
Make a judgment as to whether or not. If the determination result is negative, the process returns to step a3, and the process described above is performed. If the determination in step a9 is affirmative, the process moves to step all, where it is determined whether the count value 11 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 in step all is negative, 71
- Arithmetic 8!1 allows further creation of a table, and in step a12 the count value 1] is incremented by +1, and the process returns to step a3. If the judgment result in step al l is 1, it is impossible to create any more tables, and in step a13 the count value 11 is
0'', the title of the first table is displayed on the display section 4, and the process returns to step a3.

The process subsequent to step alo is to input column item names, and in step a14, input C representing the column order number.
The count value C of the reno star 33 is initialized to, for example, "0". In step a15, the above step a3
A display asking for the column item name is displayed on the display unit 4 in a 7-ormat similar to the above. In step a16, the key manpower from the key manpower section 14 of Calculation 8!1 is read. step a1
7, it is determined whether or not the character-filled oyster group 5 has been operated. If negative, the process moves to step a18, and if positive, step a19. Moving on to a20, the steps a7. Similarly to a8, the input character food is stored in the key input buffer 47 and then displayed on the display section 4. The subsequent processing moves to step alG.

When the determination in step a17 is negative, it is determined in step a18 whether or not the column instruction key 11 has been operated;
If negative, the process returns to step a16 and the above-described process is repeated. If affirmative, the process moves to step a20, where it is determined whether the memory content of the key manual buffer 47 is blank.8If the judgment result is negative, the process moves to step a22, where the string function Th$( C
+1) is assigned the assignment contents of the string function Th$(C). Thereafter, in step a23, the current memory contents of the key manual buffer 47 are converted to the string function Tl+$
The allocation is memorized in (C). After this, step a24
Then, the count value C is incremented by +1, 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 string function TI+$(0) corresponding to C=0 is sequentially transferred to
is assigned the latest column item name.

If the judgment in step a21 is affirmative, it means that the column direction key 11 was operated without operating the character key group 5, that is, the input of the column item name has been completed in the table. After this, the process moves to the process of performing the line item name input shown in FIG.

FIG. 5 is a 70-chart illustrating the row item name manual processing that is performed subsequent to the processing of the 70-chart in FIG. Referring to FIGS. 1 to 5, the procedure for inputting line item names will be described. In step b1 of FIG. 5, the count value of the C counter 33 representing the number attached to the line item name is initialized to, for example, "0", and in step 1]2, "Gyaukou Moku";L;"= ?” data is displayed on the display section 4.

In the subsequent step b3, the key power from the key power section 14 is read, and step b4. At b5, it is determined whether the character entry key group 5 or the line direction key 10 has been operated.

If both keys have not been operated, the process returns to step b3 and the manual key reading operation is performed again. If the judgment result in step 1)4 is affirmative, step b6. Sequentially move to step b7, and step a7. shown in the fourth diagram. A character corresponding to the captured character code is displayed on the display section 4 in the same procedure as described in a8.

If the judgment in step b4 is negative, step b5
If the judgment in step b5 is positive, the input of the item name in one line of the table to be input has been completed and the input of the item name in the next line is requested. At this time, the process moves to step b8, and it is determined whether the memory contents of the key manual buffer 47 are blank. If the judgment is affirmative, the input of the line item name has been completed, and fifJ, which will be described later,
The process moves on to input processing of table data shown in FIG. Step 1〕8
If the judgment is negative, the process proceeds to step 1】9
, the current memory contents of the key buffer 47 are stored in the string function DI+$(L), and the following step 1
Increment the count value by +1 with ko10.

Subsequently, the process returns to step h 2 and displays on the display section 4 an indication as to whether or not to input a new line item.

If the input of the desired line item name has been completed, the line designation key 10 is operated again, and the process proceeds to step b4.
Move to step b8 via b5, key person cover y7y47
It is determined that the memory content of is blank. The process moves to a tabular data input processing mode, which will be described later with reference to FIG.

Figure 6 shows the procedure for inputting numerical data, which is the number of pages of the title "Seiseki Hitau" shown in Table 1 above.
It is a chart. The data input procedure will be explained with reference to FIGS. 1 to 6. In step d1 of Fig. 6,
Count values m of the bite counter 28 and n counter 29 indicating the column direction position and row direction position of input data,
n and I indicating the table number] Renosta's Kafunto value 11
For example, each is initialized to "0". step d2
Now, the numerical function Dh(m) defined in the definition area 42 of FIG.

n) (actually, I+=m=n=O), the data area 43 shown in FIG. 3 is set to the row direction maximum value CO and column direction maximum value L.
Only LOXCO is secured for O, and numerical data representing a data-uninput state shown in area 44 is stored.

Next, in step d3, string functions Th$(C) and D representing the column item names and row item names, respectively, are used.
For h$ (L), D h$ (m); T H$ (n): “=?”
-Display (A) on the display section 4, and read the keys operated by the key manual section 14 in step d4.

In steps c15, d6, and d7, the obtained key input is the numerical input key group 6, or the replacement key 12.
However, a judgment is made as to whether the key is the column designation key 11 or the column designation key 11, respectively. If the judgment is 11 constant in step d5, the numerical value input in step d8 is
747, and this numerical value is displayed on the display unit 4 in step d9. When input of such numerical data is completed, 63'', for example, is displayed in the first row and first column of the table displayed on display n4.

If the judgment in step d5 is negative and the judgment in step d6 is affirmative, the input of numerical data for the table is completed;
This means that a request is made to perform matrix permutation processing as will be described later, and step dl.

This process, which will be described later, is performed and the process returns to step d4.

Stella 7'd6's judgment is negative, step d7-4
If the judgment is positive, −
The input of column data is completed, and input of the next column is requested, and the process moves to step dll. step d
ll, the memory contents of the key manual pad 7a47 are the data function Dh(ω, n) (currently I+= m= n=
Q), and step d12''Ch determines whether the number of columns n of the table into which data has been input is the maximum number of columns CO determined in step d2.

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 +413, the count value n indicating the number of columns is incremented by +1, and the process returns to step J3.

If the judgment result in the input template d12 is affirmative, it means that data input across all columns of the row concerned has been completed, and the process moves to step d14, where a count value representing the number of rows in the table currently undergoing data input work is input. l is the step d2
It is determined in e11 whether the count is equal to the maximum count LO determined in . If they are equal, the data input process ends. If they are not equal, it is possible to input the next row, and step d1
5, the count value I is incremented by +1, the process advances to the next line, and the count value port is set to, for example, "0" in step d1G.
” to enable input in the first column of the row. After doing this, the process returns to step d3.

If the judgment result in step d7 is negative, it means that the operator is performing an operation that is not a data input operation, and the process proceeds to step d17゜di8. d
l9. The process sequentially moves to d20, and it is determined whether the operated key is the right key 48 of the cursor key group 8.
If the operated key is not the cursor key group 8, the process returns to step d4. It will be done.

In each of these judgment processing steps d17 to d20, the judgment result is 1! If r is constant, the processing is performed in steps d21, d22, respectively. d23. Moving to d24, the count value n indicating the column direction position is incremented by +1,
Further, the count value mark indicating the position in the row direction is incremented by +1, the count value . . . is decremented by -1, and the count value n is decremented by -1. These steps d21 to d24 are performed to obtain a display in which the cursor 52 is moved in an arbitrary direction indicated by the group of cursor keys 8 on the display section 4.

The processes after steps d21 to d24 commonly proceed to step d25, where the count value 11 representing the number of columns is first counted.
determine whether is equal to (CO+1),
This is tl Flt indicating whether the cursor 52 on the display unit 4 has exceeded the currently displayed table in the row direction. If this judgment is established, the cursor 52 is decremented by one in step d2 (3), and the process moves to step d21 without moving the cursor 52 out of the table.

If the judgment result in step d25 is negative, step d26 is not performed and step d26 is not performed.
Move on to 27.

In step d27, it is determined whether or not the cursor 52 on the display unit 4 is displayed at a position beyond the table in the column direction in the table being input. If the judgment result is affirmative, the count value l is decremented by one in step d2B, and the process moves to step d29 without moving the cursor 52 out of the table. 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 O 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. fJiF
If the IfrN result is closed, the count value m is set to O 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.

In this way, by performing the processes shown in Figures 4 to 6 above, the title, column item name, row item name,
and each data can be input. In this way, Table 1 above can be created.

FIG. 7 is a flowchart showing a processing procedure for replacing rows and columns of a created table according to an embodiment of the present invention. Figure 1~
This replacement process will be explained with reference to FIG.

As explained with reference to FIG. 6, the r code data function Dh(m,
n) was a two-variable data function with count values m and n, but only the numerical data part of Table 1 was calculated for each matrix element from the leftmost column in the top row to the right, and then in the second row. The matrix elements are counted sequentially from the leftmost column to the right, and a series of numbers are given to the matrix elements. A one-variable data function Dh(a) using these numbers as variables is defined as follows.

D b(a)m D b(+o,n)
・−(4) Here, a=(m −1)CO+n In this way, the data function D h(m, n) has 1
The data functions DI+(a) of the variables correspond in a 1:1 ratio. When only the numerical data portion of the above Table 1 is displayed using such one-variable data rA WLD b(a), the following Table 2 is obtained.

Table 2 The purpose of this embodiment is to transpose the rows and columns of Table 2 above to generate the data matrix of Table ttS3 below.

In step e1 of FIG. 7 of Table 3, the exchange key 12 shown in FIG. 1 is operated repeatedly, and by this operation, the count value a is initialized to "1" in step e2.

In step e3, the numerical data (r63J according to the example of the f51 table) assigned to Dh(1) is stored in the storage unit 18.
is stored in the X register 31 of. Here, the data relation fi
Db(a), together with the corresponding numerical data shown in Table 1 above, has a logical value of "1" when the replacement process described below is completed, and a logical value of "0" when it has not been completed.
A replacement completion flag is also assigned. In other words, at this moment, the replacement process has just been started, and the replacement completion flags for the data function DI+(a) for all count values a are all logical values "0", together with the numerical data shown in Table 1 above. , the contents of this flag are stored in the X register 31 in step e3.

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 DI+(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.

According to the fifth formula, the count value a (in this example, a=1°2
The data of the data function DI+(a) corresponding to 1..., 18) is calculated by the fifth formula a' (the numerical values are shown in the numerical values 1, 2..., 18 in Table 3). ). This correspondence is shown in Table 4 below.

Table 4 As shown in step e2 above, when a=1 is set, a'=1 is calculated from equation 5 and Table 4 above. Therefore, in step e8, Dh(a')(
The replacement completion flag for a' = 1) has already been set to "1" in step e5, so Dh(1) remains fixed at the position of a' = 1 in Table 3. , the process moves to step e9.

In step e9, the force want value a is incremented by +1, and in step elo it is determined whether this count value a exceeds the number of elements (18) of the numerical data in Table 1. At present, this judgment is denied.
The process returns to step e3.

In step e3, the data of Dh(2) is transferred to the X register 3.
1, and the replacement completion flag of the data relationship Dh(2) is set to "1" in step C5.

Hereinafter, steps eG and e7 are performed on the same persimmon as described above, and from the above formula 5 and table 4, from a=5, a
'=8 is calculated. Therefore, in step e8, it is determined whether the replacement completion flag of the data function D b (a') (a' = 8) is "1" or not.
At this point, the result is negative, and the process moves to step all, where the replacement completion flag of data function Dh(a') is set to "1".
Set to .

In step e12, the data function [)l+(a')(
The data including the contents of the replacement completion flag of a' = 8) and the data of the X register to which the data including the replacement completion flag of data function DI+(2) were transferred in step e6 are mutually exchanged. Let's do it. Therefore, data of the data function DI'+(2) is given to the data function Db(a') (a'=7).

In other words, the data function DI+(2) is a'=7 in Table 3.
Assigned to the placement position. Also here, X register 31
The data of the data function DI+(7) is stored in .

After this, the process returns to step e7 and the data function D
As is clear from the above f55 formula and Table 4 for t+(7), the data function D I+(a' ) (a' =
3) are associated. That is, as shown in Table 3, data function Dh(7) has one false value assigned to the arrangement position indicated by a'=3. Below, steps e7, e8, el
By repeating the process in which 1 and el2 are one cycle, a stage is reached where the process "4→2" in Table 4 above is performed. That is, at this time step e7
a'=2 is performed in . At this point, only the data function Dh(18) in Table 2 has not been replaced as shown in Table 3.

In step e8, the data function Dh(a')(a' =
It is determined whether the replacement completion flag of 2) is "1". At this time, the replacement completion flag of data function Db(1) has already been set to "1" in the process regarding a=1.
It is set to "1" in step e5,
Therefore, 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, and the process moves to step e12, whereupon this determination is negative and the process moves to step e3.

In step e3, the contents of the data function DI+(3) are transferred to the X register 31 together with the contents of the replacement completion flag, which has already been set to "1". Step e4
Then, the judgment result becomes affirmative, and the process moves to step e9. Similarly, step e9. clO, e3, e4
The process with 1 cycle is repeated, and the count value a
is sequentially incremented by +1, and step e9
It is reached when the result of incrementing in is a=19. At this time, the determination in step elo becomes affirmative, and the process moves to step e13, where all the replacement completion flags of the arbitrary count values a are reset to "0".

In this way, the row/column swapping process from the data matrix of table m2 to the data matrix of table 3 is completed.

As described above, according to this embodiment, by using the processing program shown in the chart 70 in FIG. It is possible to realize the replacement process.

In other words, the replacement program in the computer 1 using such a person and replacement program is greatly simplified,
Furthermore, as described in the prior art, there is no need to prepare a memory with an unnecessarily large storage capacity (and the configuration can be significantly simplified).

Effects As described above, according to the present invention, a simple program and a single renostar are used to perform the process of changing the arrangement positions of rows and columns of data having a matrix arrangement. This can be achieved by Therefore, the configuration of such a data processing device is greatly simplified, and the operability is also greatly improved.

[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 components of the computer 1, and FIG. 3 is a diagram showing the state of data allocation in the table data area 25. Figure 4 is a flowchart showing the procedure for manually inputting the table title and column item name in Calculator 1, and Figure 5 is a flowchart showing the procedure for manually inputting the row item name.
0-Chart, Figure 6 is 7C showing the table data entry process.
I-Chart, FIG. 7 is a flowchart showing the process of permuting rows and columns of a table. DESCRIPTION OF SYMBOLS 1...Calculator, 4...Display section, 5...1 group of character manual keys, 6...1 group of numerical manual keys, 9...table function keys,
1o... Row direction key, 11... Column direction key, 12.
...Replace key, 14...Key human resources department, 25...Table data area, 31...X reno star, three...Column item name desired area, 41...Row item name area, 43...・Data area, 47...Key human buffer agent Patent attorney Keibu Saikyo Figure 2 Figure 7

Claims (1)

[Scope of Claims] Storage means for storing a data group having a matrix arrangement; display means for displaying the data matrix; and a register, wherein the register is used to display a transposed matrix for the data matrix. A data processing device characterized in that it generates a data matrix having an arrangement form.