Author: Dan Andersson
Date: 13:05:20 01/14/02
Go up one level in this thread
Read 'Efficient Dynamic Dispatch without Virtual Function Tables. The SmallEiffel Compiler.' by Olivier ZENDRA, Dominique COLNET, Suzanne COLLIN. It outlines the theory of indexing junps versus conditional branches. For smaller sets of cases, a conditional tree is faster (smaller number used to be less than 128 different cases). In the case of the P4 it might never be true ;) http://smalleiffel.loria.fr/papers/papers.html#OOPSLA97 http://smalleiffel.loria.fr/papers/oopsla97.ps.gz MvH Dan Andersson
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.