Adaptive binding
AssigneeDesign Intelligence, Inc.
InventorMichael B. Orr
Life of this patent
Estimating the term…
Loading patent…
AssigneeDesign Intelligence, Inc.
InventorMichael B. Orr
Estimating the term…
The invention includes an efficient method of dynamically binding an operation (22) to an implementation. During a first occurrence of the operation, the operation identifier and argument information are compared with entries (52) in a dictionary (50) to determine an appropriate implementation. The operation is modified by replacing the operation identifier (58) and argument information (60) with a reference to a matching entry (52). Upon subsequent execution of the operation, the interpreter checks to see whether the types of the arguments in the current function call match those in the dictionary entry. If they match, the implementation referenced by the dictionary entry is executed. If they do not match, the dictionary is searched for a matching entry. Because most operations do not change types of arguments during most function calls, the invention results in greatly improved efficiency.
A computer-implemented method for dispatching a function call to an implementation during program execution, the function call occurring in a code segment and associated with a function identifier and actual function arguments describable by actual function argument information, the method comprising:
A method of binding an entity to an identifier, the entity being selected in accordance with selection criteria from a dictionary including more than one entity, the selection criteria and the entity bound to the identifier capable of changing during program execution, the method comprising:
A computer-implemented method of binding a function call to an implementation in a p-code environment, the function call having associated therewith during each occurrence thereof function argument information including the number and types of arguments, the method comprising:
Dependencies are inferred from the claim text.