Abstract: Runtime polymorphism may be enabled with metadata that is usable for casting objects to casted objects. In an exemplary media implementation, processor-executable instructions cause operations including: discover at least one type of an object while in a runtime environment; and create a casted object from the object by casting the object to the casted object using metadata. An exemplary computing device implementation includes: one or more processors; and one or more media in operative communication therewith, the one or more media including: an object of a first type; metadata that is capable of being used to cast unknown objects in a runtime environment; and processor-executable instructions that, when executed, cause the one or more processors to perform an action including: casting the object of the first type to a casted object of a second type using the metadata in the runtime environment, the first type differing from the second type.

Abstract: Example embodiments improve the lookup times and modification costs of indexing on a dynamically sorted list by using a combination of data structures to determine index values for secondary keys and vice versa. More specifically, exemplary embodiments provide a combination of a binary tree (e.g., a balanced binary tree) with a lookup table (e.g., linear dynamic hash table) to provide scalable retrieval of entries by either an array index or a secondary key. For example, given a key, a hash thereof returns a node placement within a balanced binary tree. This positioning can then be used at runtime to determine an index value for a data record, resulting in a near real-time lookup cost. Also note that modifications, such as reordering, insertions, and deletions, become a function of the nodes depth in the binary tree, rather than a linear function of number of records within the data array.

Abstract: Apparatus and method for categorizing test failures are disclosed. In one embodiment, a data set of a current test failure is compared with the data sets of historical test failures to result in a set of correspondence values. The current test failure is categorized with respect to the historical test failures at least in part on the basis of the correspondence values.

Abstract: Example embodiments improve the lookup times and modification costs of indexing on a dynamically sorted list by using a combination of data structures to determine index values for secondary keys and vice versa. More specifically, exemplary embodiments provide a combination of a binary tree (e.g., a balanced binary tree) with a lookup table (e.g., linear dynamic hash table) to provide scalable retrieval of entries by either an array index or a secondary key. For example, given a key, a hash thereof returns a node placement within a balanced binary tree. This positioning can then be used at runtime to determine an index value for a data record, resulting in a near real-time lookup cost. Also note that modifications, such as reordering, insertions, and deletions, become a function of the nodes depth in the binary tree, rather than a linear function of number of records within the data array.

Abstract: Runtime polymorphism may be enabled with metadata that is usable for casting objects to casted objects. In an exemplary media implementation, processor-executable instructions cause operations including: discover at least one type of an object while in a runtime environment; and create a casted object from the object by casting the object to the casted object using metadata. An exemplary computing device implementation includes: one or more processors; and one or more media in operative communication therewith, the one or more media including: an object of a first type; metadata that is capable of being used to cast unknown objects in a runtime environment; and processor-executable instructions that, when executed, cause the one or more processors to perform an action including: casting the object of the first type to a casted object of a second type using the metadata in the runtime environment, the first type differing from the second type.