Abstract: A method of generating a schema including receiving a data record having a record type name and one or more data values is provided. The data values are associated with data value names. The method includes determining whether a set of existing schemas includes a schema associated with the record type name, determining whether the schema includes an element having the same name as a corresponding data element of the record, and validating the corresponding data element against the schema element. A new schema element is added to the schema, the new schema element having the same name and type as the corresponding data element of the record. The method can further include indexing at least one of the one or more data values, which involves querying the indexed data, forming subscription lists for the data values, and forming a derived data value associated with one or more data values.

Abstract: An embodiment of an object property management system using a dataflow architecture that expresses an application data as a directed acyclic graph and propagates data through the graph in an ordered, predictable way based on connections between the graph nodes. In one embodiment, the object property management system uses proxy nodes to arrange a dynamic graph for property data propagation for nested properties to allow property relationships to automatically adjust based on changes to a property value within the hierarchy of the property path.

Abstract: In one embodiment, a non-transitory computer-readable medium stores instructions for implementing an application dataflow aware property and bindings system that implements two-way binding via a unidirectional directed acyclic graph and propagates data through the graph based on the connections between the graph nodes. In one embodiment, properties in a binding relationship are arranged in an upstream and downstream manner. Each property has an upstream node and a downstream node to send and receive messages from other properties. Where a first property is arranged upstream of a second property in the binding graph, the first property is more authoritative than the second property. The most upstream property is the truth for the binding. Requests to update the value of the property are propagated upstream via the upstream nodes and notifications of changes in the value of the property are propagated downstream via the downstream nodes.

Abstract: An embodiment of an object property management system using a dataflow architecture that expresses an application data as a directed acyclic graph and propagates data through the graph in an ordered, predictable way based on connections between the graph nodes. In one embodiment, the object property management system uses proxy nodes to arrange a dynamic graph for property data propagation for nested properties to allow property relationships to automatically adjust based on changes to a property value within the hierarchy of the property path.

Abstract: In one embodiment, a non-transitory computer-readable medium stores instructions for implementing an application dataflow aware property and bindings system that implements two-way binding via a unidirectional directed acyclic graph and propagates data through the graph based on the connections between the graph nodes. In one embodiment, properties in a binding relationship are arranged in an upstream and downstream manner. Each property has an upstream node and a downstream node to send and receive messages from other properties. Where a first property is arranged upstream of a second property in the binding graph, the first property is more authoritative than the second property. The most upstream property is the truth for the binding. Requests to update the value of the property are propagated upstream via the upstream nodes and notifications of changes in the value of the property are propagated downstream via the downstream nodes.

Abstract: Techniques are provided for optimizing operations, such as scrolling, that move rendered views for items in a collection relative to a viewable window. An application initially renders only those views within the viewable window. In a background process, the application also builds a pool of rendered views that are outside of the viewable window. Background rendering occurs is timed to not interfere with the user's experience. The pool is constrained in size so as not to over-utilize device memory. When a new item is scrolled or otherwise moved into the viewable window, the application first checks the pool to determine if a view of the new item is already rendered. If so, the application simply displays the pre-rendered view, resulting in minimal processor utilization. The application thus provides the user with a “smoother” scrolling experience. A priority queue for identifying views to replace or overwrite is also discussed.

Abstract: A method of generating a schema including receiving a data record having a record type name and one or more data values is provided. The data values are associated with data value names. The method includes determining whether a set of existing schemas includes a schema associated with the record type name, determining whether the schema includes an element having the same name as a corresponding data element of the record, and validating the corresponding data element against the schema element. A new schema element is added to the schema, the new schema element having the same name and type as the corresponding data element of the record. The method can further include indexing at least one of the one or more data values, which involves querying the indexed data, forming subscription lists for the data values, and forming a derived data value associated with one or more data values.

Abstract: Techniques are provided for optimizing operations, such as scrolling, that move rendered views for items in a collection relative to a viewable window. An application initially renders only those views within the viewable window. In a background process, the application also builds a pool of rendered views that are outside of the viewable window. Background rendering occurs is timed to not interfere with the user's experience. The pool is constrained in size so as not to over-utilize device memory. When a new item is scrolled or otherwise moved into the viewable window, the application first checks the pool to determine if a view of the new item is already rendered. If so, the application simply displays the pre-rendered view, resulting in minimal processor utilization. The application thus provides the user with a “smoother” scrolling experience. A priority queue for identifying views to replace or overwrite is also discussed.