Talk:Dynamic Language Runtime

Computing Unassessed

This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks. ??? This article has not yet received a rating on Wikipedia's content assessment scale. ??? This article has not yet received a rating on the project's importance scale.

"Since in dynamic languages, the type of an object, as well as the members it contain, can change during a program lifetime, a method invocation must search through the method list to see if the invocation is a valid one."

^^ is using a hash table for method look-up technically 'searching through'? Inhahe (talk) 11:51, 2 April 2008 (UTC)Reply

Yep, any kind of lookup (given something find something else) is "searching through". Since you cannot do method invocation without looking up in dynamic languages, how you do the lookup is the key to an efficient implementation. --soum ^talk 12:21, 2 April 2008 (UTC)Reply

I think inhahe's question concerns the language nuance of "search through". The phrase suggests a linear search. How about "... a method invocation must check the method list ..." Leotohill (talk) 15:34, 2 April 2008 (UTC)Reply

WP:SOFIXIT. :-P --soum ^talk 15:43, 2 April 2008 (UTC)Reply