JPH04188268A - Document processor - Google Patents

Abstract

PURPOSE:To rearrange the page of a document with a simple operation by providing a page buffer and rearranging the document while information for one page in the document is copied. CONSTITUTION:A memory area for page rearrangement 41 in a size obtained by adding one page to the number of total pages of the document executing a processing is set in RAM 13. Namely, the memory area for page rearrangement 41 is constituted by memory areas 42-1 to 42-6 in which each memory capacity is one page and which consist of a total of six pages when the pages are rearranged as to the document whose total pages were five pages. When the order of the pages is rearranged, an operator has to arrange the page number of an 'order column' in a 'page rearrangement property' in the altered order. Thus, the content of the document can freely be exchanged in a page unit and editing work can efficiently be executed.

Description

[Detailed Description of the Invention] "Field of Industrial Application" The present invention relates to a document processing device, such as a Japanese word processor or a workstation, that can manage documents page by page. The present invention relates to a document processing device that can be easily processed.

"Prior Art" Document processing devices such as Japanese word processors are frequently used in offices and homes. Unlike conventional typewriters, such a document processing device allows editing such as copying a part of a document to another location or deleting a part. Particularly recently, it has become common practice to include tables and images page by page in documents, and it is also common practice to rearrange such items page by page. It has become. For example, when creating an anthology, one person's manuscript is posted on each page, but if the order of writing changes, this can be done by rearranging the pages. ing.

By the way, in conventional document processing apparatuses, for example, when rearranging the first page with the last page, this is done using the following first or second method.

(i) First method: Create one empty page before the first page, and then copy the contents of the last page to this empty page. Then, delete the contents of the last page that was copied.

(ii) Second method: Display the contents of the final page on the screen, and specify the range from the first line to the last line with the cursor. Then, the first page is displayed on the screen by setting the text movement mode, the cursor is moved to the top position, and the content of the last page previously specified with the cursor is inserted into the first page.

``Problem to be solved by the invention'' The former method involves placing a blank page in the text and copying the page to be rearranged into this page, making the process extremely complicated. There was a problem.

Furthermore, in the latter method, the so-called word movement process is performed on a page-by-page basis, which simplifies the work itself, but it is complicated because it is necessary to display on the screen the page of the document to be moved and the page to which it is to be moved. Furthermore, if the amount of documents on each page is different, there is also the problem that the boundaries of the pages become distorted after the movement.

Furthermore, in either method, when rearranging a plurality of pages, it is necessary to repeat the operation for each page multiple times, which makes the work complicated and increases the risk of making mistakes.

Therefore, a first object of the present invention is to provide a document processing device that can rearrange the pages of a document with a simple operation.

A second object of the present invention is to provide a document processing device that can efficiently rearrange a plurality of pages.

"Means for Solving the Problem" The invention according to claim 1 includes a document storage means for storing documents in page units, a page input means for sequentially inputting pages after document rearrangement, and document rearrangement. a display means for displaying a subsequent page; a page buffer for storing at least one page of document;
A document processing device is provided with a rearrangement control means for rearranging documents while appropriately copying page contents.

That is, the invention according to claim 1 is characterized in that a page buffer is provided, and documents are rearranged while copying information for one page of a document to the page buffer. a storage means, a display for displaying the contents of the document, a window display means for displaying a window for instructing document attributes on the display, and a page for sequentially inputting rearranged pages of the document into this window. A document processing device is provided with an input means, a page buffer for storing at least one page of documents, and a rearrangement control means for rearranging the documents while appropriately copying the contents of one page of the document to the page buffer. .

That is, in the invention described in claim 2, a window for instructing page rearrangement is opened, the rearrangement order is inputted into the window, and the page rearrangement is realized using a page buffer.

"Example" The present invention will be described in detail below with reference to Examples.

This document processing device is equipped with a CPU (central processing unit) 11. The CPU II is connected to various circuit devices through a bus 12 such as a data bus. Of these, RAM
Reference numeral 13 denotes a random access memory for storing a program for controlling the rearrangement of pages of this document processing device and temporary data for controlling. The disk control device 14 is a device for controlling input and output of data to and from the magnetic disk 15. The magnetic disk 15 stores the aforementioned programs and various document data. The input circuit 16 is connected to a keyboard 17, and is used to input data such as characters. A mouse 18 as a pointing device is connected to the keyboard 17.

The display control circuit 21 is connected to a display 22 such as a CRT, and is configured to visually display data on this display. The communication control circuit 23 connects the cable 2
It is connected to other devices (not shown) via 4, and can input and output data. For example, the print data can be sent to a printing device (not shown) via the cable 24 and printed out there. Further, the image information is read by an image reading device (not shown),
The results are transferred to the document processing device via cable 24.

FIG. 2 shows an example of a display screen when a document is being created with this document processing device. A display screen 31 of the display 22 includes a window 3 for displaying documents.
2 has been opened, and the content 33 of the document being created is displayed here.

FIG. 3 shows a state in which a page property window for setting or changing page properties is additionally displayed on the display screen. The page property window 35 can be displayed on the display screen 31 by pressing a property key (not shown) on the keyboard 17 shown in FIG. 1, for example.

Figures 4 and 5 specifically show the contents of the page property window, of which Figure 4 shows an example of the display state before the page rearrangement operation is performed, and Figure 5 shows an example of the display state before the page rearrangement operation is performed. indicates that a page rearrangement operation has been performed. The page property window 35 has two buttons, "Complete" and "Cancel", arranged in its upper column. When the "Complete" button is clicked with the mouse 18, the display contents of the page property window 35 are finalized. For this, click the "Cancel" button with the mouse 18
If you click , you can cancel the entered settings and enter them again.

Setting areas for "page margin property" and "page rearrangement property" are arranged in the portion of the page property window 35 excluding the upper column. The operator says, ``
These margins for printing can be set by inputting numerical values from the keyboard 17 into the left, right, top, and bottom columns of "Page Margin Properties".

As shown in FIG. 4, the number of pages of the document that is currently being created or has been completed and the order in which these pages are arranged are initially displayed in the "page rearrangement property" area.

When rearranging the order of the pages, the operator only has to arrange the page numbers in the "order column" in the "page rearrangement property" in the changed order, as shown in FIG. In the example shown in FIG. 4, the order is “1, 3, 2.4°5.
”, so the third page of the document contents, which was originally arranged in page order “1.2, 3.4゜5”, will be rearranged with the second page.Of course, this document In the processing device, it is also possible to specify and execute multiple sets of rearrangements at the same time, as will be explained later.

FIG. 6 shows a memory area used for rearranging pages. A memory area 41 for page rearrangement is set in the RAM 13 shown in FIG. 1 with a size equal to one page added to the total number of pages of the document to be processed. Corresponding to FIG. 5, if page rearrangement is performed for a document with a total of 5 pages, the page rearrangement memory area 41 has a memory capacity of 1 page each, and a total of 6 pages. Area 42-142-2,
..., 42-6. Of these, the sixth memory area 42-6 is a buffer area for one page. First to fifth memory areas 42-1.42-2
, 42-5 includes two pieces of address information. The first address information relates to the order "n", and the second address information relates to the content "m" after the pages are rearranged. In this example, the second and third pages are rearranged as shown in FIG. 5, so the content "m" for these pages has been changed.

FIG. 7 is a diagram for explaining page rearrangement control by this document processing device. However, this example describes a more complicated rearrangement than the examples shown in FIGS. 5 and 6. That is, as shown in the content "m" of the page rearrangement memory area 41 in FIG.
．． A 5-page document arranged in the order of ``4.5'' is
, 3゜2.4.1''.

That is, in this example, the first and fifth pages are rearranged, and the second and third pages are rearranged.

In the initial state of the page rearrangement memory area 41 shown in FIG. 8, the first to fifth memory areas 42-1, 42-2, . -5 stores the text contents from the first page to the fifth page.

Now, the CPU II shown in FIG. 1 initializes the inside of the RAM 13 to the following state (step 2 in FIG. 7).

Content "m" = 1 Order "n" = 1 MAX 'n' - Number of pages = 5 Buffer area = Empty CPU I next determines whether order "n' is greater than MAX "n" (step ■).

Since it is not large at this point (N), the order [n) is “5”.
” is checked (step ■).“
5'' (N), it is determined whether the buffer area (sixth memory area 42-6>) is full (step ■).The buffer area is empty (N). , the entire order (n), i.e. the first
The contents of the first page stored in the memory area 42-1 are copied to the buffer area 42-6 (step
). This sets a flag indicating that the buffer area is full (step ■).

Then, the order "η" is incremented by +1 to become "2" (step ■).

FIG. 9 shows the memory area for page rearrangement when the order "n" becomes "2". It can be seen that the text content of the first page has been copied to the sixth memory area 42-6.

In the state shown in FIG. 9, the aspect ratio of the page specified so that the order [71) is "m", that is, becomes one page after rearrangement is performed (step (2)). The order [n] is “
2'', m=3, so the process returns to step (2) and checks whether the buffer area 42-6 is full.In this case, the buffer area 42-6 is full, so the process proceeds to step (2). The order “n” is increased by +1 and becomes “3”.
In this state, since m=2, the process returns to step 2 and checks whether the buffer area 42-6 is full.Then, the process proceeds to step 2 and the order ``n'' is returned.
is increased by +1 and becomes "4". In this state, m = 4, so return to step ■, proceed to step ■, and select "n".
is increased by +1 and becomes "5". At this time, m=1 for the first time, and both match (Y).

Therefore, the CPU II copies the entire sequence "5" to the sequence "1" (step ■). Then, the contents of the buffer area, ie, the sixth memory area 42-6, are copied to the order "5" (step 0).

After this, the buffer area is cleared and becomes empty (step 0).

FIG. 10 shows the state of the page rearrangement memory area at this point. It can be seen that the rearrangement of the first and fifth pages has been completed.

Next, the CPU II converts the order “n” to “m+1” or “
2" (Step 2), and the content "m" is set to "m+l", that is, "2" (Step 0).

Then, return to step ■ and the order “n” is MAX “n”
Determine whether it is larger than (step ■). Since it is still not large at this point (N), it is checked whether the order [1] is "3" (step ■). “3”
Since this is not the case (N), it is determined whether the buffer area is full (step ■). Since the buffer area is empty (N), the entire sequence [n], that is, the contents of the second page stored in the second memory area 42-2, is copied to the buffer area 42-6 (step ). This sets a flag indicating that the buffer area is full (step ■). And the order “
n# is incremented by +1 and becomes "3" (step ■).

FIG. 11 shows the page rearrangement memory area at the time when this order "n" becomes "2". 6th
It can be seen that the text content of the second page has been copied to the memory area 42-6.

In the state shown in FIG. 11, a page whose order (n) is "m", that is, a page designated to have two pages after rearrangement, is detected (step (2)). The order [n) is “
2", m=3, so the process returns to step (2) and checks whether the buffer area 42-6 is full. In this case, since the buffer area 42-6 is full, the process proceeds to step (2). The order “n” is increased by +1 and becomes “3”.
becomes. In this state, since m=2 (step ■; Y)
, CPU II copies the entire sequence "3" to sequence "2" (step ■). Then, the buffer area, that is, the sixth
The contents of the memory area 42-6 are copied to the order "3" (step ■).

After this, the buffer area is cleared and becomes empty (step 0).

FIG. 12 shows the state of the page rearrangement memory area at this point. It can be seen that in addition to the rearrangement of the first and fifth pages, the rearrangement of the second and third pages has been completed.

Next, the CPU II converts the order “n” to “m+1” or “
3'' (step O), and the content "m" is set to "m+1", that is, "3" (step 0).

Then, return to step ■ and the order “n” is MAX “n”
Determine whether it is larger than (step ■). Since it is still not large at this point (N), it is checked whether the order [n] is "3" (step 2). “3”
Therefore, it is determined whether the buffer area is full (step ■). Since the buffer area is empty (N), the order (all nl,
That is, the contents of the second page stored in the third memory area 42-3 are copied to the buffer area 42-6 (step 2). This sets a flag indicating that the buffer area is full (step ■). Then, the order “n” is incremented by 1 and becomes “4” (step ■
).

FIG. 13 shows the memory area for page rearrangement when the order "n" becomes "4". 6th
It can be seen that the text content of page j32 has been copied to the memory area 42-6 of .

In the state shown in FIG. 13, a page whose order [n] is designated as "n", that is, 3 pages after rearrangement, is detected (step (2)). The order [n] is “
4", m=4, so the process returns to step (2) and checks whether the buffer area 42-6 is full. In this case, since the buffer area 42-6 is full, the process proceeds to step (2). The order “n” is increased by +1 and becomes “5”.
becomes. If the order [n] is "5", m=1, so go back to step ■ and proceed to step ■, where the order [n] is "6".
become. When the order [n] is “6”, the sixth memory area 42
-6 stores the document content of the second page, so m=
3, and the entire order [n), that is, the contents of the second page stored in the sixth memory area 42-6, becomes the order "3".
” (step ■). After this, the contents of the buffer area, that is, the sixth memory area 42-6 are copied in the order “6”.
" is copied to the same area as the memory area (step ■), and the contents of the sixth memory area 42-6 are cleared (step 0).Then, the order "n" becomes "4", and the contents "n" ” becomes “4”.

In this state, the CPU II returns to step ■ and returns to the order “n”.
It is determined whether or not is larger than MAX "n" (step ■). Since it is not large at this point (N), the order [
It is checked whether nl is "4" (step ■). Since it is "4", both the order "n" and the content "m" are incremented by 1 to become "5" (step [Yes]). Then, returning to step (2), it is determined whether or not the order "n" is greater than MAX "n" (step (2)). Since it is still not large at this point (N), it is checked whether or not the order [n) is "5" (step 2).

Since it is not "5", it is determined whether the buffer area is full (step ■). Since the buffer area is empty (N), the entire sequence [η], that is, the contents of the first page stored in the fifth memory area 42-5, is copied to the buffer area 42-6 (step ). This sets a flag indicating that the buffer area is full (step ■). Then, the order "n" is incremented by 1 to become "6" (step ■).

FIG. 14 shows the memory area for page rearrangement when the order "n" becomes "6". 6th
It can be seen that the text content of the first page has been copied to the memory area 42-6.

In the state shown in FIG. 14, the pages specified in the order [nE is "m", that is, the number of pages after rearrangement is 5 are detected (step 2). The order [n] is “
6'' does not match, so the process returns to step (2) and it is checked whether the buffer area 42-6 is full.

In this case, since the buffer area 42-6 is full, the process proceeds to step (2) and the order "n" is incremented by 1 to become "7".
”.If the order [n] is “7”, the first memory area 4
Returning to 2-1, m=5 (step ■; Y). In this state, step ■ and step @ are not executed, and the sixth memory area 42-6 is cleared (step 0).
, the order “n” becomes “8” and the content “m” becomes “6” (
step 0.0). Then go back to step ■Order“
Since n" has become larger than MAX"n", all the work is completed (end). At this time, the state of the page rearrangement memory area 41 is as shown in FIG. are the same.

An example of rearranging four pages in a document with a total of five pages has been shown above, but it is of course possible to rearrange pages in a more complicated manner than this.

"Effect of the invention" As described above, according to the invention claimed in claim 1, at least one
I decided to rearrange the pages while saving one page's worth of document content to the page's buffer memory.
Document contents can be freely exchanged on a page-by-page basis, making editing work more efficient. Also, claim 2
According to the described invention, since a window showing document attributes is displayed to rearrange the pages, the contents to be rearranged are clearly shown, and there is no need to provide a special display means. However, the advantage is that the information necessary for sorting can be displayed using the multi-window system.

[Brief explanation of the drawing]

The drawings are for explaining one embodiment of the present invention. Among these, Fig. 1 is a block diagram showing the main part of the circuit configuration of a document processing device, and Fig. 2 shows a window for displaying documents on a display screen. Front view of the display showing the state in which
The figure is a front view of the display showing a state in which a page property window has been added to this display screen, Figure 4 is a plan view showing an example of how the page property window is displayed before an instruction is given to rearrange the pages, and Figure 5 is a top view of the display. A plan view showing a display example of the page property window after an instruction to rearrange the pages, FIG. 6 is an explanatory diagram showing the stored contents of the memory area for page rearrangement corresponding to FIG. 5, and FIG. 7 is an illustration of the page rearrangement. A flowchart showing the change control, and FIGS. 8 to 14 are explanatory diagrams showing the storage contents of the page rearrangement memory area when rearranging a total of four pages. Of these, FIG. 8 is an explanatory diagram showing the initial state. Figure 9 is an explanatory diagram showing the state in which the first page is stored in the buffer area, Figure 10 is an explanatory diagram showing the state in which a set of pages has been rearranged, and Figure 11 is an explanatory diagram showing the state in which the first page is stored in the buffer area. Explanatory diagram showing the state stored in the area, 1st
Figure 2 is an explanatory diagram showing the state in which the other set of pages has been rearranged, Figure 13 is an explanatory diagram showing the state in which the second page is stored in the buffer area, and Figure 14 is an explanatory diagram showing the state in which the second page is stored in the buffer area. FIG. 11...CPU, 13...RAM. 15...Magnetic disk, 17...Keyboard, 18...Mouse, 22...Display, 32...Document display window, 35...
...Page properties window, 41...
-Memory area for page rearrangement, 42...Memory area (in page units). Applicant Fuji Xerox Co., Ltd. Agent Patent Attorney Umeo Yamauchi Fig. 1 Fig. 2 Fig. 3 Fig. 154 Fig. 5 Fig. 6 Fig. 8 Fig. 9 Fig. 10 Fig. 7 Fig. 111 Fig. 12 Figure 13 Figure 14

Claims (1)

[Scope of Claims] 1. Document storage means for storing documents in page units; page input means for sequentially inputting pages after document rearrangement; and display means for displaying pages after document rearrangement. , a document processing device comprising: a page buffer for storing at least one page of a document; and a rearrangement control means for rearranging the documents while appropriately copying the contents of one page of the document to the page buffer. Device. 2. A document storage means for storing documents in page units; a display for displaying the contents of the document; a window display means for displaying a window for indicating attributes of the document on this display; A page input means for sequentially inputting changed pages; a page buffer for storing at least one page of documents; and a sorter for rearranging documents while appropriately copying the contents of one page of documents to this page buffer. A document processing device comprising: a control means.