Abstract: Systems and methods are directed to a compression scheme for stable universally unique identities in a collaborative editing environment. A client receives edits to a document and immediately creates a local short identity for an element of each edit, whereby the local short identity represents an offset from a base unique identity associated with the client from which a unique identifier assigned to the element is derivable. The local short identity information including the local short identity for each element is transmitted to a server. Subsequently, global short identity information is received from the server from which one or more global short identities that each map to a local short identity of a client of a plurality of clients collaborating on the document can be determined by the client. Each global short identity is a compact identity that is universally unique to the plurality of clients including the client.

Abstract: Systems and methods for automatically resolving incompatible changes made by different users to collaborative content by capturing changes in the form of command records, where the command records store user changes as context associated with a user command and related content such as a recursive record of the commands called by each command, anchors, creation descriptors, invariant parameters, observations, and constraints. Using the stored command records, systems and methods described herein are able to “rebase” the changes to create a resolved content state even in situations where one user may delete content and another user may later add/edit that otherwise deleted content. The system provides efficient and automatic resolution of incompatible edits based on the context from the command records underlying the user's intent when creating the command. Ultimately, the system increases user productivity by coordinating content creation within the collaborative content automatically.

Abstract: Systems and methods are directed to a compression scheme for stable universally unique identities in a collaborative editing environment. A client receives edits to a document and immediately creates a local short identity for an element of each edit, whereby the local short identity represents an offset from a base unique identity associated with the client from which a unique identifier assigned to the element is derivable. The local short identity information including the local short identity for each element is transmitted to a server. Subsequently, global short identity information is received from the server from which one or more global short identities that each map to a local short identity of a client of a plurality of clients collaborating on the document can be determined by the client. Each global short identity is a compact identity that is universally unique to the plurality of clients including the client.

Abstract: Systems and methods are directed to a compression scheme for stable universally unique identities in a collaborative editing environment. A client receives edits to a document and immediately creates a local short identity for an element of each edit, whereby the local short identity represents an offset from a base unique identity associated with the client from which a unique identifier assigned to the element is derivable. The local short identity information including the local short identity for each element is transmitted to a server. Subsequently, global short identity information is received from the server from which one or more global short identities that each map to a local short identity of a client of a plurality of clients collaborating on the document can be determined by the client. Each global short identity is a compact identity that is universally unique to the plurality of clients including the client.

Abstract: Systems and methods for automatically resolving incompatible changes made by different users to collaborative content by capturing changes in the form of command records, where the command records store user changes as context associated with a user command and related content such as a recursive record of the commands called by each command, anchors, creation descriptors, invariant parameters, observations, and constraints. Using the stored command records, systems and methods described herein are able to “rebase” the changes to create a resolved content state even in situations where one user may delete content and another user may later add/edit that otherwise deleted content. The system provides efficient and automatic resolution of incompatible edits based on the context from the command records underlying the user's intent when creating the command. Ultimately, the system increases user productivity by coordinating content creation within the collaborative content automatically.

Abstract: Systems and methods are directed to a compression scheme for stable universally unique identities in a collaborative editing environment. A client receives edits to a document and immediately creates a local short identity for an element of each edit, whereby the local short identity represents an offset from a base unique identity associated with the client from which a unique identifier assigned to the element is derivable. The local short identity information including the local short identity for each element is transmitted to a server. Subsequently, global short identity information is received from the server from which one or more global short identities that each map to a local short identity of a client of a plurality of clients collaborating on the document can be determined by the client. Each global short identity is a compact identity that is universally unique to the plurality of clients including the client.

Abstract: An API is provided for positioning items in a table. The API allows a number of columns or a number of rows, or both, to be specified for a table. Any items to be placed in the table may be identified for the API. Items may be “moveable,” or not associated with fixed positions in the table. The moveable items may be placed adjacently in the table to fill a first row. New rows or columns may be generated to accommodate additional items. Items may also be “fixed,” or associated with fixed positions in the table. Moveable items may fill in around the fixed items. A novel algorithm is provided to efficiently place both moveable and fixed items in a table. An on-demand reservation grid may be used in conjunction with the algorithm, thereby accommodating items that span multiple columns and/or rows.