Abstract: Technologies are disclosed that help developers determine server resource usage caused by client application generated events. Embodiments may be employed while an application is under development to balance the benefit of a given event with an estimated cost to process the event once the application is deployed. One aspect of the present disclosure provides a telemetry application that receives application generated events and estimates a resource cost they cause to data collection servers. The resource cost may be based on historic data captured from similar or related events, as well as data about how often the event and related events are raised by the application.

Abstract: Technologies are disclosed that help developers determine server resource usage caused by client application generated events. Embodiments may be employed while an application is under development to balance the benefit of a given event with an estimated cost to process the event once the application is deployed. One aspect of the present disclosure provides a telemetry application that receives application generated events and estimates a resource cost they cause to data collection servers. The resource cost may be based on historic data captured from similar or related events, as well as data about how often the event and related events are raised by the application.

Abstract: Example systems, methods, and data structures are directed at synchronizing documents. One example data structure includes receiving a request from a first client to edit a document, and sending short-term check out metadata to the first client to begin an editing session. The data structure includes a plurality of cells and a plurality of data objects defining content of the document. Each data object is associated with one of the cells and has an object identifier that uniquely identifies the data object within the associated cell, and is configured to communicate with other cells and with objects within the associated cell. In addition, each of the cells is defined so that each other cell remains unaffected by changes to data objects of the cell.

Abstract: An undo process performed on a data object includes selecting a stored prior state of the data object; comparing the stored prior state with the current state of the data object to determine differences between the stored prior state and the current state of the data object other than the effect of the undesired editing operation; and applying the differences to the stored prior state of the data object to obtain a new state of the data object. Each prior state of the data object corresponds to an effect of one of previously performed editing operations on the data object.

Abstract: Example systems, methods, and data structures are directed at synchronizing documents. One example data structure includes receiving a request from a first client to edit a document, and sending short-term check out metadata to the first client to begin an editing session. The data structure includes a plurality of cells and a plurality of data objects defining content of the document. Each data object is associated with one of the cells and has an object identifier that uniquely identifies the data object within the associated cell, and is configured to communicate with other cells and with objects within the associated cell. In addition, each of the cells is defined so that each other cell remains unaffected by changes to data objects of the cell.

Abstract: Example systems, methods, and data structures are directed at synchronizing documents. One example data structure includes receiving a request from a first client to edit a document, and sending short-term check out metadata to the first client to begin an editing session. The data structure includes a plurality of cells and a plurality of data objects defining content of the document. Each data object is associated with one of the cells and has an object identifier that uniquely identifies the data object within the associated cell, and is configured to communicate with other cells and with objects within the associated cell. In addition, each of the cells is defined so that each other cell remains unaffected by changes to data objects of the cell.

Abstract: An undo process performed on a data object includes selecting a stored prior state of the data object; comparing the stored prior state with the current state of the data object to determine differences between the stored prior state and the current state of the data object other than the effect of the undesired editing operation; and applying the differences to the stored prior state of the data object to obtain a new state of the data object. Each prior state of the data object corresponds to an effect of one of previously performed editing operations on the data object.

Abstract: An undo process performed on a data object includes selecting a stored prior state of the data object; comparing the stored prior state with the current state of the data object to determine differences between the stored prior state and the current state of the data object other than the effect of the undesired editing operation; and applying the differences to the stored prior state of the data object to obtain a new state of the data object. Each prior state of the data object corresponds to an effect of one of previously performed editing operations on the data object.

Abstract: Tools and techniques are described for merging versions of documents using multiple masters. These tools may provide methods that include syncing a first peer system with at least a second peer system, with the first and second peer systems receiving respective instances of a document for collaborative editing. The first and second peer systems may maintain respective version histories associated with the document, with these version histories capturing and storing revisions occurring locally at the first and second peer systems. The first and second peer systems may exchange version histories, and merge these version histories.

Abstract: Tools and techniques are described for merging versions of documents using multiple masters. These tools may provide methods that include syncing a first peer system with at least a second peer system, with the first and second peer systems receiving respective instances of a document for collaborative editing. The first and second peer systems may maintain respective version histories associated with the document, with these version histories capturing and storing revisions occurring locally at the first and second peer systems. The first and second peer systems may exchange version histories, and merge these version histories.

Abstract: Example systems, methods, and data structures are directed at synchronizing documents. One example data structure includes receiving a request from a first client to edit a document, and sending short-term check out metadata to the first client to begin an editing session. The data structure includes a plurality of cells and a plurality of data objects defining content of the document. Each data object is associated with one of the cells and has an object identifier that uniquely identifies the data object within the associated cell, and is configured to communicate with other cells and with objects within the associated cell. In addition, each of the cells is defined so that each other cell remains unaffected by changes to data objects of the cell.

Abstract: Described is a mechanism for importing data into an outline aware application if the data does not include outline structure, and for creating outline structure in the data based on indicia of visual structure that may be present in the data. In one aspect, data is selected for import into the outline application. The data is devoid of outline structure, such as relative level information or parent/child relationship information. However, the data includes indicia of visual structure, such as markup attributes or tab characters. The outline application (or some related component) transforms the selected data into outline structured data based on the indicia of visual structure.

Abstract: Techniques to synchronize information between fidelity domains are described. A computer system may include a first application program having a low fidelity domain, and a second application program having a high fidelity domain. The second application program may include a fidelity synchronization module to synchronize modifications between a low fidelity version of a document made using the first application program and a high fidelity version of the document made using the second application program using a three-way merge. Other embodiments are described and claimed.

Abstract: An undo process performed on a data object includes selecting a stored prior state of the data object; comparing the stored prior state with the current state of the data object to determine differences between the stored prior state and the current state of the data object other than the effect of the undesired editing operation; and applying the differences to the stored prior state of the data object to obtain a new state of the data object. Each prior state of the data object corresponds to an effect of one of previously performed editing operations on the data object.

Abstract: A shared document is displayed in a customized form with highlighted content that identifies significant portions of the document. The highlighted content draws a user's attention to the portions of the document that may have been modified, deleted or added by others since the last time the user accessed the document. The highlighted content directs a user to modified document portions that the user has not yet read.

Abstract: Described is a mechanism for importing data into an outline aware application if the data does not include outline structure, and for creating outline structure in the data based on indicia of visual structure that may be present in the data. In one aspect, data is selected for import into the outline application. The data is devoid of outline structure, such as relative level information or parent/child relationship information. However, the data includes indicia of visual structure, such as markup attributes or tab characters. The outline application (or some related component) transforms the selected data into outline structured data based on the indicia of visual structure.