CN110109586B - Data processing method and device, computer equipment and storage medium - Google Patents
Data processing method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN110109586B CN110109586B CN201910407632.2A CN201910407632A CN110109586B CN 110109586 B CN110109586 B CN 110109586B CN 201910407632 A CN201910407632 A CN 201910407632A CN 110109586 B CN110109586 B CN 110109586B
- Authority
- CN
- China
- Prior art keywords
- data
- data content
- instruction
- storage queue
- data storage
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/048—Interaction techniques based on graphical user interfaces [GUI]
- G06F3/0481—Interaction techniques based on graphical user interfaces [GUI] based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/048—Interaction techniques based on graphical user interfaces [GUI]
- G06F3/0484—Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range
- G06F3/04842—Selection of displayed objects or displayed text elements
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- User Interface Of Digital Computer (AREA)
Abstract
The disclosure relates to a data processing method, a data processing device, a computer device and a storage medium. When a special pasting instruction is received, the data content stored in the data storage queue is displayed, so that a user can select the data content to be pasted based on the display of the data content, and the data storage queue stores the data content corresponding to the repeated copying operation within a period of time, so that the repeated copying required when some copied data content needs to be pasted is avoided, and the complexity of the operation is greatly reduced.
Description
Technical Field
The present disclosure relates to the field of data processing, and in particular, to a data processing method and apparatus, a computer device, and a storage medium.
Background
Copy and paste is a common operation method in data processing, and in the related art, a clipboard is generally used to implement copy and paste, for example, when a user wants to copy and paste certain data content, the data content may be copied to the clipboard first, and then the data content that has been copied to the clipboard is pasted to a certain position through a paste operation.
However, the paste operation in this copy and paste manner is only for the currently copied data content, so that if the data content copied before the current copy needs to be pasted, the data content needs to be copied again by a tedious operation, resulting in low operation efficiency.
Disclosure of Invention
The present disclosure provides a data processing method, apparatus, computer device and storage medium, to at least solve the problem of inefficient copy and paste operations in the related art. The technical scheme of the disclosure is as follows:
according to a first aspect of the embodiments of the present disclosure, there is provided a data processing method, including
Determining to receive a first paste instruction, wherein the first paste instruction is used for triggering display of data contents stored in a data storage queue, and the data storage queue is used for storing data contents corresponding to multiple copying operations;
displaying a data content selection interface based on at least one piece of data content stored in the data storage queue, wherein the data content selection interface comprises at least one information item, and one information item corresponds to one piece of data content stored in the data storage queue;
and according to the selected instruction of any first information item in the data content selection interface, pasting the data content corresponding to the first information item to a target position.
In one possible implementation, the display data content selection interface includes:
generating a content summary of at least one piece of data content stored in the data storage queue based on the at least one piece of data content;
generating the at least one first information item according to the content summary of the at least one data content and the queue order of the at least one data content in the data storage queue;
and loading the at least one first information item to the data content selection interface for display.
In one possible implementation manner, after determining that the first paste instruction is received, the method further includes:
displaying at least one second information item in a display data content selection interface, wherein the second information item corresponds to a data address and a content abstract of a piece of data content which is listed in a preset time period;
according to a selected instruction of any second information item in the data content selection interface, acquiring data content in a data address according to the data address in the second information item, and pasting the acquired data content to the target position.
In one possible implementation manner, before displaying the data content selection interface based on at least one piece of data content stored in the data storage queue, the method further includes:
and according to the received replication instruction or cutting instruction, queuing the data content corresponding to the replication instruction or cutting instruction into the data storage queue.
In one possible implementation, the enqueuing data content corresponding to the copy instruction or the cut instruction into the data storage queue includes:
detecting the queue storage condition of the data storage queue;
when the data storage queue is full, dequeuing the data content in the head of the data storage queue, and enqueuing the data content corresponding to the copy instruction or the cut instruction to the tail of the data storage queue;
and when the data storage queue is not full, the data content corresponding to the copying instruction or the cutting instruction is queued to the tail of the data storage queue.
In one possible implementation manner, the enqueuing, to the data storage queue, data content corresponding to the copy instruction includes:
detecting the queue storage condition of the data storage queue;
when the data storage queue is full, dequeuing the data content with the pasting times larger than the target times in the data storage queue, and enqueuing the data content corresponding to the copying instruction or the cutting instruction to the tail of the data storage queue;
and when the data storage queue is not full, the data content corresponding to the copying instruction or the cutting instruction is queued to the tail of the data storage queue.
In one possible implementation, the enqueuing data content corresponding to the copy instruction or the cut instruction into the data storage queue includes:
detecting the queue storage condition of the data storage queue;
when the data storage queue is full, displaying based on at least one piece of data content stored in the data storage queue, removing the data content from the data storage queue according to a selected instruction of any one piece of data content in the at least one piece of data content, and queuing the data content corresponding to the copying instruction or the cutting instruction to the tail of the data storage queue;
and when the data storage queue is not full, the data content corresponding to the copying instruction or the cutting instruction is queued to the tail of the data storage queue.
In one possible implementation, the method further includes:
and when a second paste instruction is received, pasting the data content in the tail of the data storage queue to the target position, wherein the second paste instruction is different from the first paste instruction.
In a possible implementation manner, the first paste instruction is a pressing instruction performed on the first key, the second key, and the third key at the same time.
According to a second aspect of the embodiments of the present disclosure, there is provided a data processing apparatus including:
a determination unit configured to determine that the first paste instruction is received;
the display unit is configured to display a data content selection interface based on at least one piece of data content stored in a data storage queue, wherein the data content selection interface comprises at least one information item, one information item corresponds to one piece of data content stored in the data storage queue, and the data storage queue is used for storing data content corresponding to multiple copying operations;
and the pasting unit is configured to paste the data content corresponding to any first information item in the data content selection interface to a target position according to a selection instruction of the first information item.
In one possible implementation, the display unit is configured to generate a content summary of at least one piece of data content stored in the data storage queue based on the at least one piece of data content; generating the at least one first information item according to the content summary of the at least one data content and the queue order of the at least one data content in the data storage queue; and loading the at least one first information item to the data content selection interface for display.
In one possible implementation, the display unit is further configured to display at least one second information item in the display data content selection interface, wherein the second information item corresponds to a data address and a content summary of a piece of data content which has been listed within a preset time period;
the acquisition unit is configured to acquire data content in a data address according to a data address in any second information item in the data content selection interface according to a selection instruction of the second information item;
the pasting unit is further configured to paste the acquired data content to the target location.
In one possible implementation, the apparatus further includes:
and the queue processing unit is configured to enqueue data contents corresponding to the copy instruction or the cut instruction into the data storage queue according to the received copy instruction or the cut instruction.
In one possible implementation, the queue processing unit is configured to detect a queue storage condition of the data storage queue; when the data storage queue is full, dequeuing the data content in the head of the data storage queue, and enqueuing the data content corresponding to the copy instruction or the cut instruction to the tail of the data storage queue; and when the data storage queue is not full, the data content corresponding to the copying instruction or the cutting instruction is queued to the tail of the data storage queue.
In one possible implementation, the queue processing unit is configured to detect a queue storage condition of the data storage queue; when the data storage queue is full, dequeuing the data content with the pasting times larger than the target times in the data storage queue, and enqueuing the data content corresponding to the copying instruction or the cutting instruction to the tail of the data storage queue; and when the data storage queue is not full, the data content corresponding to the copying instruction or the cutting instruction is queued to the tail of the data storage queue.
In one possible implementation, the queue processing unit is configured to detect a queue storage condition of the data storage queue; when the data storage queue is full, displaying based on at least one piece of data content stored in the data storage queue, removing the data content from the data storage queue according to a selected instruction of any one piece of data content of the at least one piece of data content, and queuing the data content corresponding to the copying instruction or the cutting instruction to the tail of the data storage queue; and when the data storage queue is not full, the data content corresponding to the copying instruction or the cutting instruction is queued to the tail of the data storage queue.
In one possible implementation, the pasting unit is further configured to paste from the data content in the tail of the data storage queue to the target location when receiving a second paste instruction, which is different from the first paste instruction.
In a possible implementation manner, the first paste instruction is a pressing instruction performed on the first key, the second key, and the third key at the same time.
According to a third aspect of embodiments of the present disclosure, there is provided a computer device comprising:
a processor;
a memory for storing the processor-executable instructions;
wherein the processor is configured to execute the instructions to implement the data processing method of any one of the above.
According to a fourth aspect of embodiments of the present disclosure, there is provided a storage medium having instructions that, when executed by a processor of a computer device, enable the computer device to perform the data processing method according to any one of the above.
According to a fifth aspect of embodiments of the present disclosure, there is provided a computer program product comprising executable instructions that, when executed by a processor of a computer device, enable the computer device to perform the data processing method of any one of the above.
The technical scheme provided by the embodiment of the disclosure at least brings the following beneficial effects:
when a special pasting instruction is received, the data content stored in the data storage queue is displayed, so that a user can select the data content to be pasted based on the display of the data content, and the data storage queue stores the data content corresponding to the repeated copying operation within a period of time, so that the repeated copying required when some copied data content needs to be pasted is avoided, and the complexity of the operation is greatly reduced.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the disclosure and are not to be construed as limiting the disclosure.
FIG. 1 is a flow chart illustrating a method of data processing according to an exemplary embodiment.
FIG. 2 is a flow diagram illustrating an implementation of data content enqueueing based on a copy operation or a cut operation, according to an example embodiment.
FIG. 3 is a flow diagram illustrating an implementation of data content enqueueing based on a copy operation or a cut operation, according to an example embodiment.
FIG. 4 is a flow diagram illustrating an implementation of data content enqueueing based on a copy operation or a cut operation, according to an example embodiment.
FIG. 5 is a flow chart illustrating a method of data processing according to an exemplary embodiment.
FIG. 6 is a flowchart illustrating an operation according to an exemplary embodiment.
FIG. 7 is a block diagram illustrating a data processing apparatus according to an example embodiment.
FIG. 8 is a block diagram illustrating a computer device in accordance with an exemplary embodiment.
Detailed Description
In order to make the technical solutions of the present disclosure better understood by those of ordinary skill in the art, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the disclosure described herein are capable of operation in sequences other than those illustrated or otherwise described herein. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.
The user information to which the present disclosure relates may be information authorized by the user or sufficiently authorized by each party.
Fig. 1 is a flowchart illustrating a data processing method according to an exemplary embodiment, which is used in a computer device, as shown in fig. 1, and includes the following steps.
In step 101, it is determined that a first paste instruction is received, where the first paste instruction is used to trigger display of data contents stored in a data storage queue, and the data storage queue is used to store data contents corresponding to multiple copy operations.
In step 102, a data content selection interface is displayed based on at least one piece of data content stored in the data storage queue, wherein the data content selection interface comprises at least one information item, and one information item corresponds to one piece of data content stored in the data storage queue.
In step 103, according to a selection instruction for any first information item in the data content selection interface, data content corresponding to the first information item is pasted to a target position.
According to the embodiment provided by the disclosure, when a special pasting instruction is received, the data content stored in the data storage queue is displayed, so that a user can select the data content to be pasted at this time based on the display of the data content, and the data storage queue stores the data content corresponding to the repeated copying operation within a period of time, so that the repeated copying required when some copied data content needs to be pasted is avoided, and the complexity of the operation is greatly reduced.
In one possible implementation, the display data content selection interface includes:
generating a content summary of at least one piece of data content stored in the data storage queue based on the at least one piece of data content;
generating the at least one first information item according to the content summary of the at least one data content and the queue order of the at least one data content in the data storage queue;
and loading the at least one first information item to the data content selection interface for display.
In one possible implementation, the method further comprises:
displaying at least one second information item in a display data content selection interface, wherein the second information item corresponds to a data address and a content abstract of a piece of data content which is listed in a preset time period;
and according to a selected instruction of any second information item in the data content selection interface and a data address in the second information item, acquiring the data content in the data address, and pasting the acquired data content to the target position.
In one possible implementation manner, before the displaying the data content selection interface based on at least one piece of data content stored in the data storage queue, the method further includes:
and according to the received copy instruction or the cut instruction, the data content corresponding to the copy instruction or the cut instruction is queued in the data storage queue.
In one possible implementation, the enqueuing data content corresponding to the copy instruction or the cut instruction into the data storage queue includes:
detecting the queue storage condition of the data storage queue;
when the data storage queue is full, dequeuing the data content in the head of the data storage queue, and enqueuing the data content corresponding to the copy instruction or the cut instruction to the tail of the data storage queue;
and when the data storage queue is not full, the data content corresponding to the copy instruction or the cut instruction is queued to the tail of the data storage queue.
In one possible implementation, the enqueuing data content corresponding to the copy instruction or the cut instruction into the data storage queue includes:
detecting the queue storage condition of the data storage queue;
when the data storage queue is full, dequeuing the data content with the pasting times larger than the target times in the data storage queue, and enqueuing the data content corresponding to the copying instruction or the cutting instruction to the tail of the data storage queue;
and when the data storage queue is not full, the data content corresponding to the copy instruction or the cut instruction is queued to the tail of the data storage queue.
In one possible implementation, the enqueuing data content corresponding to the copy instruction or the cut instruction into the data storage queue includes:
detecting the queue storage condition of the data storage queue;
when the data storage queue is full, displaying based on at least one piece of data content stored in the data storage queue, removing the data content corresponding to the selected instruction from the data storage queue according to the selected instruction of any data content in the at least one piece of data content, and queuing the data content corresponding to the copying instruction or the cutting instruction to the tail of the data storage queue;
and when the data storage queue is not full, the data content corresponding to the copy instruction or the cut instruction is queued to the tail of the data storage queue.
In one possible implementation, the method further comprises:
and when a second paste instruction is received, pasting the data content in the tail of the data storage queue to the target position, wherein the second paste instruction is different from the first paste instruction.
In one possible implementation manner, the first paste instruction is triggered by simultaneous pressing operations on the first key, the second key and the third key.
The above embodiment is only a brief introduction of an embodiment of the present disclosure and various possible implementation manners, and in order to implement the data processing method, in one possible implementation manner, for a received copy instruction or a cut instruction, data content corresponding to the copy instruction or the cut instruction needs to be listed in the data storage queue. And for how specifically listed, embodiments of the present disclosure may be implemented by any of the possible implementations shown in fig. 2-4 described below.
Referring to fig. 2, fig. 2 is a flowchart illustrating an implementation of data content listing based on a copy instruction or a cut instruction according to an exemplary embodiment, where the implementation specifically includes the following steps:
in step 201, a queue store condition of the data store queue is detected.
When any data content is to be queued, the computer device can determine whether some data content needs to be dequeued by detecting the queue storage condition of the first-in first-out, thereby providing storage space for the data content. The detection process may be performed by detecting a head pointer and a tail pointer of the data storage queue, where when the head pointer and the tail pointer point to the same address, the data storage queue is empty, and when an address difference between the head pointer and the tail pointer is a length of the data storage queue, the data storage queue is full, and when the address difference between the head pointer and the tail pointer is smaller than the length of the data storage queue, the data storage queue is not full.
In step 202, when the data storage queue is full, the data content in the head of the data storage queue is dequeued, and the data content corresponding to the copy instruction or the cut instruction is queued to the tail of the data storage queue.
In step 203, when the data storage queue is not full, the data content corresponding to the copy instruction or the cut instruction is queued to the tail of the data storage queue.
In the above steps 202 and 203, the data storage queue may be a First In First Out (FIFO) queue, that is, elements can be added only from the end of the queue and removed from the head of the queue, which ensures that the First enqueued element is always the First dequeued. The FIFO queue performs data maintenance based on the occurrence time of the copy operation of the data content, so that the data content with the longest storage event can be guaranteed to be dequeued only when the queue is full, the possibility of being reused is low due to long storage time, and data loss and the like caused by dequeuing are avoided.
Referring to fig. 3, fig. 3 is a flowchart illustrating an implementation of data content listing based on a copy instruction or a cut instruction according to an exemplary embodiment, where the implementation specifically includes the following steps:
in step 301, a queue store condition of the data store queue is detected.
Step 301 is similar to step 201, and will not be described herein.
In step 302, when the data storage queue is full, dequeuing the data content whose pasting times are greater than the target times in the data storage queue, and enqueuing the data content corresponding to the copy instruction or the cut instruction to the tail of the data storage queue.
For the data storage queue, dequeuing can be determined based on the pasting times of each stored data content, wherein the pasting times are greater than the target times, which indicates that the data content is already used and is likely not to be reused subsequently, and therefore, such data content can be dequeued to meet the current copying requirement. That is, the method may further include adding 1 to the number of pasting times of any one data content in the data storage queue when a paste instruction of the data content is received, so as to statistically paste the word count for the data content in the data storage queue.
In a possible implementation manner, the listed data contents may be determined by combining the number of times of pasting and the occurrence time of the pasting operation, and the data contents corresponding to some pasting operations with earlier occurrence time are likely not to be reused subsequently, so that such data contents may be listed to meet the current copying requirement, and the data contents repeatedly subjected to the pasting operation in a relatively short time may be prevented from being wrongly listed due to the consideration of the occurrence time. That is, this step 302 can also be replaced by: when the data storage queue is full, acquiring the pasting times of each data content in the data storage queue and the occurrence time of each pasting operation, determining the data content of which the pasting times are greater than the target times and the time interval between the occurrence time of the last pasting operation and the current time is greater than a time interval threshold, dequeuing the data content, and enqueuing the data content corresponding to the copying operation to the tail of the data storage queue.
In step 303, when the data storage queue is not full, the data content corresponding to the copy instruction or the cut instruction is queued to the tail of the data storage queue.
Referring to fig. 4, fig. 4 is a flowchart illustrating an implementation of data content listing based on a copy instruction or a cut instruction according to an exemplary embodiment, where the implementation specifically includes the following steps:
in step 401, a queue store condition of the data store queue is detected.
Step 401 is similar to step 201, and will not be described herein.
In step 402, when the data storage queue is full, displaying based on at least one piece of data content stored in the data storage queue, according to a selected instruction for any one of the at least one piece of data content, removing the data content corresponding to the selected instruction from the data storage queue, and enqueuing the data content corresponding to the copy instruction or the cut instruction to the tail of the data storage queue.
The data storage queue can also provide an optional deletion function, namely, when there is a copy demand, the user can manually select to determine which data content does not need to be stored in the data storage queue any more, so that data loss caused by error dequeuing can be greatly avoided. Certainly, at this time, the user may select one or more pieces of data content to delete, so that the current copy requirement is ensured, and the occupation of the storage space is reduced.
In step 403, when the data storage queue is not full, the data content corresponding to the copy instruction or the cut instruction is queued to the tail of the data storage queue.
Fig. 5 is a flowchart illustrating a data processing method, as shown in fig. 5, for use in a computer device, according to an exemplary embodiment, including the following steps.
In step 501, it is determined that a first paste instruction is received, where the first paste instruction is used to trigger display of data contents stored in a data storage queue, and the data storage queue is used to store data contents corresponding to multiple copy operations.
For a computer device, a first paste instruction may be triggered by a first paste operation, which may be preset to provide a function of selectively pasting the history data content stored in the clipboard. The first paste operation may correspond to the same key operation as a current general paste operation, and may be Ctrl + V, or may correspond to a different key operation as a current general paste operation, and the first paste operation is, for example, a pressing operation performed on the first key, the second key, and the third key at the same time, and may be Ctrl + Shift + V, and of course, the number of keys and the specific keys corresponding to the first paste operation are specific, and this is not limited in the embodiment of the present disclosure, and may be a default setting of an operating system, or may be set by a user of the computer device according to a usage habit of the user.
The general paste operation may trigger a second paste instruction, that is, the method further includes: and when a second paste instruction is received, pasting the data content in the tail of the data storage queue to the target position, wherein the second paste instruction is different from the first paste instruction. By providing different paste operations to trigger corresponding paste instructions, a more flexible paste function is provided.
In step 502, a content summary of at least one piece of data content is generated based on the at least one piece of data content stored in the data storage queue.
The content abstract may be a preset number of characters of the data content, or may also be a title of the data content, and the like, which is not limited in this disclosure. In one possible implementation, the computer device may read at least one piece of data content stored in the data storage queue, and extract a predetermined number of characters from the at least one piece of data content as a content digest of the at least one piece of data content, respectively.
In step 503, the at least one first information item is generated according to the content summary of the at least one data content and the queue order of the at least one data content in the data storage queue.
The data content may be in a different queue order in the queue according to different enqueuing times, and when the at least one first information item is generated, in order to represent the queue order, a display order of the first information item needs to be determined according to the queue order.
In step 504, the at least one first information item is loaded to the data content selection interface for display.
The data content selection interface may display first information items corresponding to all data contents in the data storage queue in one interface, may also display first information items corresponding to a preset number of data contents in one interface in a folding manner, may provide display of other first information items in a page turning manner, and may also provide display of other first information items through a sliding operation, etc., which is not limited in this disclosure.
The above steps 501 to 504 are processes of displaying a data content selection interface based on at least one piece of data content stored in a data storage queue, where the data content selection interface includes at least one first information item, and one first information item corresponds to one piece of data content stored in the data storage queue. In a possible implementation manner, the first information item may also be the data content itself, without generating a content summary, so as to ensure that the user can visually see all the content of the data content, and avoid operations such as wrong selection.
In a possible implementation manner, a second information item may be further displayed on the data content selection interface, where the second information item is used to provide data content that has been dequeued from the data storage queue, that is, after the data content corresponding to the copy operation is enqueued in the data storage queue, the method further includes: displaying at least one second information item in a display data content selection interface, wherein the second information item corresponds to a data address and a content abstract of a piece of data content which is listed in a preset time period; and according to a selected instruction of any second information item in the data content selection interface and a data address in the second information item, acquiring the data content in the data address, and pasting the acquired data content to the target position. The data address may be a data source address, for example, a storage address of the data content when the copy instruction is executed, and the data address may also be a data paste address, for example, a destination address of the data content when the paste instruction is executed. For a text stored in the data storage queue based on a copy instruction, the data source address may be the original storage address of the text, and the data paste address may refer to the storage address to which the text is pasted.
For some data contents which are listed in a certain period of time, a user is likely to have paste requirements on the data contents, so that the data addresses and the content summaries of the listed data contents can be cached for a period of time, the range of the provided data contents can be expanded, and the copy and paste operation of the user can be simplified more possibly. That is, the method may include: when any data content is listed, the data address and the content abstract of the data content are stored as a second information item, and when the storage duration of the second information item exceeds the duration of a preset time period, the second information item is deleted. The second information item may also be stored on the basis of a first-in-first-out queue, and when any data content is dequeued from the data storage queue, if the first-in-first-out queue is full, the second information item at the head of the queue may be dequeued from the first-in-first-out queue, and then the second information item of the data content may be dequeued to the tail of the first-in-first-out queue.
In step 505, according to a selected instruction of any first information item in the data content selection interface, data content corresponding to the first information item is pasted to a target position.
In the data content selection interface, selection can be performed by operation such as mouse or touch. In a possible implementation manner, a checkbox may be further displayed on a first item or a last item in the data content selection interface, and the checkbox may be controlled to move up and down through a scrolling operation of a mouse, and when it is detected that the checkbox stops on any one of the first information items and a confirmation instruction is received, the first information item where the checkbox stops is taken as the selected first information item, and the data content corresponding to the first information item is pasted to the target position. The target position refers to a position corresponding to the paste instruction, and the target position may be determined by a current position of the cursor, which is not described in detail in this disclosure.
According to the embodiment provided by the disclosure, when a special pasting instruction is received, the data content stored in the data storage queue can be displayed, so that a user can select the data content to be pasted at this time based on the display of the data content, and the data storage queue stores the data content corresponding to the repeated copying operation within a period of time, so that the repeated copying required when some copied data content needs to be pasted is avoided, and the complexity of the operation is greatly reduced.
The implementation method provided by the embodiment can be compatible with the existing pasting method, can also be used for pasting the data content before the time point of the last copying on the basis of the existing pasting method, can be finished without copying back and forth under the condition of multiple copying, and improves the operation efficiency of copying and pasting.
For deepening understanding of implementation of the embodiment of the present disclosure, the data processing method is described below based on an operation flowchart provided in fig. 6, taking a data storage queue as a first-in first-out queue as an example, referring to fig. 6, when the user performs the copy operation by clicking "Ctrl + C", the computer device stores the data content based on the fifo queue, and when the fifo queue is full, dequeuing the "first copy contents" in the FIFO queue, enqueuing the data contents to the tail of the FIFO queue, when the user performs the first paste operation by clicking "Ctrl + Shift + V", the computer device may display a data content selection interface as shown in fig. 6 for selection by the user, and when the user performs the second paste operation by clicking "Ctrl + V", the computer device may paste the data content copied the nth time in fig. 6 directly to the corresponding location.
FIG. 7 is a block diagram illustrating a data processing apparatus according to an example embodiment. Referring to fig. 7, the apparatus includes a determination unit 701, a display unit 702, and a pasting unit 703.
A determination unit 701 configured to determine that a first paste instruction is received;
a display unit 702 configured to display a data content selection interface based on at least one piece of data content stored in a data storage queue, where the data content selection interface includes at least one information item, and one information item corresponds to one piece of data content stored in the data storage queue, and the data storage queue is used for storing data content corresponding to multiple copy operations;
the pasting unit 703 is configured to paste the data content corresponding to any one first information item in the data content selection interface to a target position according to a selection instruction for the first information item.
In one possible implementation, the display unit is configured to generate a content summary of at least one piece of data content stored in the data storage queue based on the at least one piece of data content; generating the at least one first information item according to the content summary of the at least one data content and the queue order of the at least one data content in the data storage queue; and loading the at least one information item to the data content selection interface for display.
In one possible implementation, the display unit is further configured to display at least one second information item in the display data content selection interface, wherein the second information item corresponds to a data address and a content summary of a piece of data content which has been listed within a preset time period;
the acquisition unit is configured to acquire data content in a data address according to a data address in any second information item in the data content selection interface according to a selection instruction of the second information item;
the pasting unit is further configured to paste the acquired data content to the target location.
In one possible implementation, the apparatus further includes:
and the queue processing unit is configured to enqueue data contents corresponding to the copy instruction or the cut instruction into the data storage queue according to the received copy instruction or the cut instruction.
In one possible implementation, the queue processing unit is configured to detect a queue storage condition of the data storage queue; when the data storage queue is full, dequeuing the data content in the head of the data storage queue, and enqueuing the data content corresponding to the copy instruction or the cut instruction to the tail of the data storage queue; and when the data storage queue is not full, the data content corresponding to the copying instruction or the cutting instruction is queued to the tail of the data storage queue.
In one possible implementation, the queue processing unit is configured to detect a queue storage condition of the data storage queue; when the data storage queue is full, dequeuing the data content with the pasting times larger than the target times in the data storage queue, and enqueuing the data content corresponding to the copying instruction or the cutting instruction to the tail of the data storage queue; and when the data storage queue is not full, the data content corresponding to the copying instruction or the cutting instruction is queued to the tail of the data storage queue.
In one possible implementation, the queue processing unit is configured to execute a queue processing operation
Detecting the queue storage condition of the data storage queue; when the data storage queue is full, displaying based on at least one piece of data content stored in the data storage queue, removing the data content corresponding to the second selection instruction from the data storage queue according to a selection instruction of any one piece of data content in the at least one piece of data content, and queuing the data content corresponding to the copying instruction or the cutting instruction to the tail of the data storage queue; and when the data storage queue is not full, the data content corresponding to the copying instruction or the cutting instruction is queued to the tail of the data storage queue.
In one possible implementation, the pasting unit is further configured to paste from the data content in the tail of the data storage queue to the target location when receiving a second paste instruction, which is different from the first paste instruction.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
FIG. 8 is a block diagram illustrating a computer device in accordance with an exemplary embodiment. The server 800 may generate a large difference due to different configurations or performances, and may include one or more processors (CPUs) 801 and one or more memories 802, where the memory 802 stores at least one instruction, and the at least one instruction is loaded and executed by the processor 801 to implement the data processing method provided by the above-mentioned method embodiments. Of course, the server may also have components such as a wired or wireless network interface, a keyboard, and an input/output interface, so as to perform input/output, and the server may also include other components for implementing the functions of the device, which are not described herein again.
In an exemplary embodiment, a storage medium comprising instructions, such as the memory 804 comprising instructions, executable by the processor 820 of the apparatus 800 to perform the method described above is also provided. Alternatively, the storage medium may be a non-transitory computer readable storage medium, which may be, for example, a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.
Claims (10)
1. A data processing method, comprising:
detecting a queue storage condition of a data storage queue according to a received replication instruction or a received cutting instruction, wherein the data storage queue is used for storing data contents corresponding to multiple replication operations; when the data storage queue is full, dequeuing the data content with the pasting times larger than the target times in the data storage queue, and enqueuing the data content corresponding to the copying instruction or the cutting instruction to the tail of the data storage queue; when the data storage queue is not full, the data content corresponding to the copying instruction or the cutting instruction is queued to the tail of the data storage queue;
determining that a first paste instruction is received, wherein the first paste instruction is used for triggering display of data contents stored in the data storage queue;
displaying a data content selection interface based on at least one piece of data content stored in the data storage queue, wherein the data content selection interface comprises at least one information item, and one information item corresponds to one piece of data content stored in the data storage queue;
according to a selection instruction of any first information item in the data content selection interface, pasting the data content corresponding to the first information item to a target position;
displaying at least one second information item in the data content selection interface, wherein one second information item corresponds to a data address and a content abstract of a piece of data content listed in a preset time period, and the data address is a data source address or a data paste address;
according to a selected instruction of any second information item in the data content selection interface, acquiring data content in a data address according to the data address in the second information item, and pasting the acquired data content to the target position.
2. The data processing method of claim 1, wherein the displaying a data content selection interface comprises:
generating a content summary of at least one piece of data content stored in the data storage queue based on the at least one piece of data content;
generating the at least one first information item according to the content summary of the at least one data content and the queue order of the at least one data content in the data storage queue;
and loading the at least one first information item to the data content selection interface for display.
3. The data processing method of claim 1, wherein the method further comprises:
and when a second paste instruction is received, pasting the data content in the tail of the data storage queue to the target position, wherein the second paste instruction is different from the first paste instruction.
4. The data processing method according to claim 1, wherein the first paste command is a simultaneous pressing command for the first key, the second key, and the third key.
5. A data processing apparatus, comprising:
the data processing unit is configured to detect a queue storage condition of a data storage queue according to a received copy instruction or a cut instruction, wherein the data storage queue is used for storing data contents corresponding to multiple copy operations; when the data storage queue is full, dequeuing the data content with the pasting times larger than the target times in the data storage queue, and enqueuing the data content corresponding to the copying instruction or the cutting instruction to the tail of the data storage queue; when the data storage queue is not full, the data content corresponding to the copying instruction or the cutting instruction is queued to the tail of the data storage queue;
a determining unit configured to determine that a first paste instruction is received, the first paste instruction being used to trigger display of data content stored in the data storage queue;
a display unit configured to display a data content selection interface based on at least one piece of data content stored in the data storage queue, the data content selection interface including at least one information item, one information item corresponding to the piece of data content stored in the data storage queue;
the pasting unit is configured to paste the data content corresponding to any first information item to a target position according to a selection instruction of the first information item in the data content selection interface;
the display unit is further configured to display at least one second information item in a display data content selection interface, wherein one second information item corresponds to a data address and a content abstract of a piece of data content which is listed in a preset time period, and the data address is a data source address or a data paste address;
the acquisition unit is configured to acquire data content in a data address according to a data address in any second information item in the data content selection interface according to a selection instruction of the second information item;
the pasting unit is further configured to paste the acquired data content to the target location.
6. The data processing apparatus according to claim 5, wherein the display unit is configured to generate a content summary of at least one piece of data content stored in the data storage queue based on the at least one piece of data content; generating the at least one first information item according to the content summary of the at least one data content and the queue order of the at least one data content in the data storage queue; and loading the at least one first information item to the data content selection interface for display.
7. The data processing apparatus according to claim 5, wherein the pasting unit is further configured to paste from data content in a tail of the data storage queue to the target position when receiving a second paste instruction, the second paste instruction being different from the first paste instruction.
8. The data processing apparatus according to claim 5, wherein the first paste instruction is a press instruction to simultaneously press the first key, the second key, and the third key.
9. A computer device, comprising:
one or more processors;
a memory for storing the processor-executable instructions;
wherein the processor is configured to execute the instructions to implement the data processing method of any one of claims 1 to 4.
10. A storage medium, characterized in that instructions in the storage medium, when executed by a processor of a computer device, enable the computer device to perform the data processing method of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910407632.2A CN110109586B (en) | 2019-05-16 | 2019-05-16 | Data processing method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910407632.2A CN110109586B (en) | 2019-05-16 | 2019-05-16 | Data processing method and device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110109586A CN110109586A (en) | 2019-08-09 |
| CN110109586B true CN110109586B (en) | 2021-02-12 |
Family
ID=67490481
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910407632.2A Active CN110109586B (en) | 2019-05-16 | 2019-05-16 | Data processing method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110109586B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110633159A (en) * | 2019-08-14 | 2019-12-31 | 视联动力信息技术股份有限公司 | Data object tracing method and device |
| CN110764928A (en) * | 2019-10-15 | 2020-02-07 | 维沃移动通信有限公司 | Pasting method and electronic equipment |
| CN112530205A (en) * | 2020-11-23 | 2021-03-19 | 北京正安维视科技股份有限公司 | Airport parking apron airplane state detection method and device |
| US11922026B2 (en) | 2022-02-16 | 2024-03-05 | T-Mobile Usa, Inc. | Preventing data loss in a filesystem by creating duplicates of data in parallel, such as charging data in a wireless telecommunications network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105511862A (en) * | 2015-11-30 | 2016-04-20 | 用友优普信息技术有限公司 | Information copy paste method and copy paste device |
| CN108228058A (en) * | 2018-03-19 | 2018-06-29 | 网易（杭州）网络有限公司 | Information stickup method and device, electronic equipment, storage medium |
| CN109388506A (en) * | 2018-09-30 | 2019-02-26 | 联想(北京)有限公司 | A kind of data processing method and electronic equipment |
| CN109684022A (en) * | 2018-12-28 | 2019-04-26 | 天津字节跳动科技有限公司 | Word input processing method, device and electronic equipment |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102253927A (en) * | 2010-05-19 | 2011-11-23 | 深圳市金蝶中间件有限公司 | Copy and paste method and device |
| CN106980447B (en) * | 2017-02-09 | 2020-01-14 | Oppo广东移动通信有限公司 | Information processing method and device and terminal |
| CN106959901B (en) * | 2017-03-17 | 2018-06-26 | 维沃移动通信有限公司 | A kind of multipath replicates method of attaching and mobile terminal |
| CN109144747B (en) * | 2018-07-24 | 2022-04-19 | 努比亚技术有限公司 | Data processing method, terminal and computer readable storage medium |
| CN109189593A (en) * | 2018-09-03 | 2019-01-11 | 合肥智慧龙图腾知识产权股份有限公司 | A kind of method, apparatus of data processing, computer equipment and storage medium |
-
2019
- 2019-05-16 CN CN201910407632.2A patent/CN110109586B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105511862A (en) * | 2015-11-30 | 2016-04-20 | 用友优普信息技术有限公司 | Information copy paste method and copy paste device |
| CN108228058A (en) * | 2018-03-19 | 2018-06-29 | 网易（杭州）网络有限公司 | Information stickup method and device, electronic equipment, storage medium |
| CN109388506A (en) * | 2018-09-30 | 2019-02-26 | 联想(北京)有限公司 | A kind of data processing method and electronic equipment |
| CN109684022A (en) * | 2018-12-28 | 2019-04-26 | 天津字节跳动科技有限公司 | Word input processing method, device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110109586A (en) | 2019-08-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110109586B (en) | Data processing method and device, computer equipment and storage medium | |
| US20240089230A1 (en) | Method and system for organizing and interacting with messages on devices | |
| JP6479079B2 (en) | Extension activation for related documents | |
| US6803929B2 (en) | Method, apparatus and computer program product for moving or copying information | |
| EP2731320B1 (en) | Method and apparatus for managing messages in an electronic device | |
| US8020101B2 (en) | User specified transfer of data between applications | |
| US11470036B2 (en) | Email assistant for efficiently managing emails | |
| US20140304616A1 (en) | Mobile terminal and method for processing notification information | |
| US20150113436A1 (en) | Providing Enhanced Message Management User Interfaces | |
| EP1643426A2 (en) | Method and computer-readable medium for navigating between attachments to electronic mail messages | |
| US20160291843A1 (en) | Batch processing method and terminal | |
| CN104657038A (en) | Method for processing content | |
| CN107408242B (en) | Providing interactive previews of content within communications | |
| KR102052777B1 (en) | System and method for blended presentation of locally and remotely stored electronic messages | |
| JP2015515703A (en) | Auto-complete content | |
| CN104219639A (en) | Method and device for displaying text message record | |
| CN104657341A (en) | Terminal | |
| US20190058756A1 (en) | Method, Terminal, and System for Sending Office Document | |
| CN110032418A (en) | Screenshot method, screenshot system, terminal equipment and computer-readable storage medium | |
| EP2708999A2 (en) | Method for editing display information and electronic device thereof | |
| US9880706B2 (en) | Gesture for selecting multiple items in a list | |
| CN111049981A (en) | Message identification method, device, user equipment and computer readable storage medium | |
| CN110633159A (en) | Data object tracing method and device | |
| JP2009176119A (en) | File use circumstance determination system | |
| KR102156193B1 (en) | Apparatus and method for input editing of mobile device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230113 Address after: Room 1101, Room 1001, Room 901, No. 163, Pingyun Road, Tianhe District, Guangzhou, Guangdong 510065 Patentee after: Guangzhou Tangzhi Cosmos Technology Co.,Ltd. Address before: 101d1-7, 1st floor, building 1, No. 6, Shangdi West Road, Haidian District, Beijing 100085 Patentee before: Beijing Dajia Internet Information Technology Co.,Ltd. |