![]() | |||||||||||||||
Messages in this thread |
On Wed, May 12, 2004 at 09:16:56AM +1000, Rusty Russell wrote: > A binary search as stands doesn't help much because we still need to > iterate through the names. We could do "address, nameindex" pairs, but > with stem compression we need to at least wade back some way to decode > the name. Yes, but that iteration is bounded. > > I have a 30-line static huffman decoder (from the IDE mini-oopser) which > we could use instead of stem compression, which we could combine with > "address, bitoffset" pairs which would be about 20k smaller and faster > than the current approach, but is it worth the trouble? Probably not. -Andi - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/ | ||||||||||||||
| Last update: 2005-03-22 13:03 [from the cache] ©2003-2008 | |||||||||||||||