What you can do is, take an existing implementation and preallocate a fixed number of objects in a linked list, like a stack. Then you pop off the first object whereever there is a malloc() and push it on again whereever there is a free()
On Sat, 2010-10-16 at 00:35 +0200, Lieven Moors wrote: > Hi everyone, > > I am looking for a self balancing binary tree implementation > in C or C++ that I can use in the JACK proces callback. > I was thinking about something like multiset in c++ (equal keys allowed), > but that doesn't use dynamic memory allocation. > > Thanks for your help > > Greetings, > > Lieven > > > > > > _______________________________________________ > Linux-audio-dev mailing list > [email protected] > http://lists.linuxaudio.org/listinfo/linux-audio-dev -- eins, zwei, drei ... tekno tekno?? http://www.youtube.com/watch?v=ZEgbW1FxR78 _______________________________________________ Linux-audio-dev mailing list [email protected] http://lists.linuxaudio.org/listinfo/linux-audio-dev
