Analysis of a multiple dispatch algorithm
Independent thesis Basic level (professional degree)Student thesis
The development of the new programming language Scream, within the project Software Renaissance, led to the need of a good multiple dispatch algorithm. A multiple dispatch algorithm, called Compressed n-dimensional table with row sharing; CNT-RS, was developed from the algorithm Compressed n-dimensional table, CNT. The purpose of CNT-RS was to create a more efficient algorithm. This report is the result of the work to analyse the CNT-RS algorithm.
In this report the domain of multiple dispatch, the multiple dispatch algorithm CNT and the new extended algorithm CNT-RS are presented. The correctness of CNT- RS algorithm is shown and it’s proven that the CNT-RS algorithm is at least as good as the CNT algorithm, in regards to space complexity of the dispatch structure.
Place, publisher, year, edition, pages
Institutionen för datavetenskap , 2004.
Datalogi, dispatch, multiple dispatch, dispatch table, pole, multipole, influence, type hierarchy, pole hierarchy, multipole hierarchy
IdentifiersURN: urn:nbn:se:liu:diva-2218ISRN: LITH-IDA-EX--04/018--SEOAI: oai:DiVA.org:liu-2218DiVA: diva2:19548