On Thu 25 Mar 2021 at 12:23, Alexander Burger <a...@software-lab.de> wrote: > On Thu, Mar 25, 2021 at 12:11:55PM +0100, Alexander Burger wrote: >> Binary heaps are close, but not the same. > > And useless for the intended purpose. At least I see no way to insert and look > up by number (?)
because you always take the position in the binary heap as the key. if picolisp had arrays, your use case would be reduced to trivial constant time array lookup but binary heaps can be much more useful if one can use a key which is not a position in the binary heap btw iirc representing trees this way was invented by a german guy a few centuries ago, when he tried to draw those family trees so popular with aristocrats -- UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=Unsubscribe
