In article <slr### [at] fwicom> , Ron Parker 
<ron### [at] povrayorg>  wrote:

> It wouldn't be any slower than a regular binary tree, but it would have a
> limit on the maximum depth, it would take up more storage than absolutely
> necessary, and it couldn't be balanced.

Actually, this implies it isn't possible to make an array (of arbitrary size,
of course) an element of another array, or is this possible?  I have to admit
I never tried, but from the code I cannot really see a reason why it shouldn't
be possible other than as being a yet another parser limitation...

    Thorsten

____________________________________________________
Thorsten Froehlich, Duisburg, Germany
e-mail: tho### [at] trfde

Visit POV-Ray on the web: http://mac.povray.org

Post a reply to this message