Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!nntp.club.cc.cmu.edu!goldenapple.srv.cs.cmu.edu!das-news2.harvard.edu!news.dfci.harvard.edu!camelot.ccs.neu.edu!news.mathworks.com!howland.erols.net!ix.netcom.com!hbaker
From: hbaker@netcom.com (Henry Baker)
Subject: Re: fast bit-shuffling algorithms requested
Content-Type: text/plain; charset=ISO-8859-1
Message-ID: <hbaker-0904971257560001@10.0.2.1>
Sender: hbaker@netcom6.netcom.com
Content-Transfer-Encoding: 8bit
Organization: nil
X-Newsreader: Yet Another NewsWatcher 2.2.0
References: <lspector-0904971039550001@pc206-229.hampshire.edu>
Mime-Version: 1.0
Date: Wed, 9 Apr 1997 20:57:56 GMT
Lines: 11

In article <lspector-0904971039550001@pc206-229.hampshire.edu>,
lspector@hampshire.edu (Lee Spector) wrote:

> I'm looking for very fast algorithms (for Common Lisp) for rearranging
> the bits either in bit-arrays or in integers according to a transformation
> map.

This isn't exactly what you want, but it may give you some good ideas:

ftp://ftp.netcom.com/pub/hb/hbaker/Bitvectors.html  (also .ps.Z)
                                  /BitSearch.html   (also .ps.Z)
