US2017199628A1PendingUtilityA1

Smart copy/paste of graphical nodes

Assignee: MICROSOFT TECHNOLOGY LICENSING LLCPriority: Nov 17, 2005Filed: Mar 28, 2017Published: Jul 13, 2017
Est. expiryNov 17, 2025(expired)· nominal 20-yr term from priority
G06F 40/137G06F 3/0481G06F 17/2241G06F 17/00
53
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

When using graphical diagrams, cutting and pasting operations may take advantage of predefined relationships to intelligently insert and remove items from the diagram. A text data model may be interpreted sequentially or hierarchically to construct various diagrams. Pasting operations will bring new data into the diagram and data model while conforming the new data to the diagram definition. Cutting operations may cause the data model and diagram to be healed to conform to the diagram definition.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
         1 . A method, comprising:
 presenting, via a computer system, a data view of a diagram that includes a first text item;   receiving, via the computer system, user input comprising at least a command to add a second text item, with at least a portion of the user input being directed at the data view; and   in response to receiving the user input, inserting via the computer system, the second text item into the data view, with the inserting comprising responding to the user input by inserting a graphical object corresponding to the second text item into a pictorial view that includes a graphical object corresponding to the first text item, with the pictorial view being distinct from and non-overlapping with respect to the data view.   
     
     
         2 . The method of  claim 1 , wherein inserting the graphical object comprises:
 displaying the graphical object corresponding to the first text item and the graphical object corresponding to the second text item in the pictorial view in a manner that visually indicates in the pictorial view an establishment of a relationship between the first text item and the second text item.   
     
     
         3 . The method of  claim 2 , wherein the relationship is a hierarchical relationship type. 
     
     
         4 . The method of  claim 2 , wherein the relationship is a sequential relationship type. 
     
     
         5 . The method of  claim 2 , wherein the relationship is a peer to peer relationship type. 
     
     
         6 . The method of  claim 2 , wherein the relationship is in accordance with a set of computer-readable relationship rules stored in the computer system. 
     
     
         7 . A computer readable storage hardware comprising computer executable instructions configured to perform a method comprising:
 presenting a data view of a diagram that includes a first text item;   receiving user input comprising at least a command to add a second text item, with at least a portion of the user input being directed at the data view; and   in response to receiving the user input, inserting the second text item into the data view, with the inserting comprising responding to the user input by inserting a graphical object corresponding to the second text item into a pictorial view that includes a graphical object corresponding to the first text item, with the pictorial view being distinct from and non-overlapping with respect to the data view.   
     
     
         8 . The computer readable storage hardware of  claim 7 , wherein the inserting of the graphical object comprises:
 displaying the graphical object corresponding to the first text item and the graphical object corresponding to the second text item in the pictorial view in a manner that visually indicates in the pictorial view an establishment of a relationship of an acceptable relationship type between the first text item and the second text item.   
     
     
         9 . The computer readable storage hardware of  claim 8 , wherein the acceptable relationship type is hierarchical. 
     
     
         10 . The computer readable storage hardware of  claim 8 , wherein the acceptable relationship type is sequential. 
     
     
         11 . The computer readable storage hardware of  claim 8 , wherein the acceptable relationship type is peer to peer. 
     
     
         12 . The computer readable storage hardware of  claim 8 , wherein the inserting of the second text item is performed in accordance with a set of computer-readable relationship rules. 
     
     
         13 . A system, comprising:
 an instruction execution apparatus; and   a computer storage media that stores computer readable instructions, the computer readable instructions being executable by the instruction execution apparatus to perform steps comprising:
 presenting a data view of a diagram that includes a plurality of text items; 
 receiving user input indicating that a text item should be added to the data view, with at least a portion of the user input directed at the text item in the data view; and 
 in response to receiving the user input, inserting the text item in the data view, with the inserting comprising responding to the user input by inserting a graphical object corresponding to the inserted text item into a pictorial view that includes a graphical object corresponding to the inserted text item, with the pictorial view being distinct from and non-overlapping with respect to the data view. 
   
     
     
         14 . The system of  claim 13 , wherein inserting the inserted text item in the data view comprises forming a relationship of an acceptable relationship type between the inserted text item and an existing text item, wherein the inserting of the graphical object corresponding to the inserted text item comprises displaying the inserted graphical object corresponding to the inserted text item and a graphical object corresponding to the existing text item in the pictorial view in a manner that visually indicates in the pictorial view the forming of the relationship between the inserted text item and the existing text item. 
     
     
         15 . The system of  claim 14 , wherein the acceptable relationship type is hierarchical. 
     
     
         16 . The system of  claim 14 , wherein the acceptable relationship type is sequential. 
     
     
         17 . The system of  claim 14 , wherein the acceptable relationship type is peer to peer. 
     
     
         18 . The system of  claim 14 , wherein the user input indicating that the inserted text item should be inserted into the data view comprises user input indicating that the inserted text item should be inserted into the data view as a parent of the existing text item. 
     
     
         19 . The system of  claim 14 , wherein the user input indicating that the inserted text item should be inserted into the data view comprises user input indicating that the inserted text item should be inserted into the data view as a child of the existing text item. 
     
     
         20 . The system of  claim 14 , wherein the user input indicating that the inserted text item should be inserted into the data view comprises user input indicating that the inserted text item should be inserted into the data view as a peer of the existing text item.

Join the waitlist — get patent alerts

Track US2017199628A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.