Re: [LAD] tree sort

Previous message: [thread] [date] [author]
Next message: [thread] [date] [author]
To: lieven moors <lievenmoors@...>
Cc: linux-audio-dev@lists.linuxaudio.org <linux-audio-dev@...>
Date: Sunday, October 17, 2010 - 1:04 am

--0016e65b5ee44a07f80492c5a4fc
Content-Type: text/plain; charset=ISO-8859-1

On Sat, Oct 16, 2010 at 6:41 AM, lieven moors wrote:

> On Sat, Oct 16, 2010 at 11:06:19AM +0200, Jens M Andreasen wrote:

Hi, I'm not sure if this will help you, but I wrote a fixed block size
memory allocator which is really simple for the TI89 calculator. I wrote it
a while ago, and I think I'm the only one who's actually used it till now,
so it's not well tested, but it's available on google code:
http://code.google.com/p/lardalloc/ It should fit your requirements, as it
just uses the free blocks to implement a stack, and thus is really fast.
The only problem you might encounter is that because implemented for a
graphing calculator, it is limited to 2^16 blocks maximum. I wouldn't
expect it to cause any problems running on a non-calculator platform,
because it is written in standard C. Again, you'd still have to write a
tree implementation on top of it.

Jeremy

--0016e65b5ee44a07f80492c5a4fc
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

On Sat, Oct 16, 2010 at 6:41 AM, lieven =
moors <lieven=
moors@gmail.com
> wrote:

On Sat, Oct 16, 2010 at 11:06:19AM +0200, Jens M Andrease=
n wrote:

br>
ff

Hi Jens,

Thanks for the suggestion! That sounds exactly like what
I want to do.

Though I still wonder if there are any existing implementations
out there that use the stack directly...

Greetings,

Lieven

> On Sat, 2010-10-16 at 00:35 +0200, Lieven Moors wrote:

llowed),
io-dev@lists.linuxaudio.org
br>

_______________________________________________
Linux-audio-dev mailing list
Linux-audio-dev@lis=
ts.linuxaudio.org

http://lists.linuxaudio.org/listinfo/linux-audio-dev
Hi, I'm not sure if this will he=
lp you, but I wrote a fixed block size memory allocator which is really sim=
ple for the TI89 calculator.=A0 I wrote it a while ago, and I think I'm=
the only one who's actually used it till now, so it's not well tes=
ted, but it's available on google code: http://code.google.com/p/lardalloc/=A0 It should fit y=
our requirements, as it just uses the free blocks to implement a stack, and=
thus is really fast.=A0 The only problem you might encounter is that becau=
se implemented for a graphing calculator, it is limited to 2^16 blocks maxi=
mum.=A0 I wouldn't expect it to cause any problems running on a non-cal=
culator platform, because it is written in standard C.=A0 Again, you'd =
still have to write a tree implementation on top of it.

Jeremy

--0016e65b5ee44a07f80492c5a4fc--

Previous message: [thread] [date] [author]
Next message: [thread] [date] [author]

Messages in current thread:
[LAD] tree sort, Lieven Moors, (Fri Oct 15, 10:35 pm)
Re: [LAD] tree sort, Jens M Andreasen, (Sat Oct 16, 9:06 am)
Re: [LAD] tree sort, lieven moors, (Sat Oct 16, 10:42 am)
Re: [LAD] tree sort, Lieven Moors, (Sun Oct 17, 1:28 am)
Re: [LAD] tree sort, Jeremy, (Sun Oct 17, 1:04 am)
Re: [LAD] tree sort, Lieven Moors, (Sun Oct 17, 1:50 am)
Re: [LAD] tree sort, Lieven Moors, (Sun Oct 17, 1:50 am)