Newsgroups: comp.lang.lisp,comp.lang.scheme,comp.lang.misc
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!gatech!howland.reston.ans.net!ix.netcom.com!netcom.com!hbaker
From: hbaker@netcom.com (Henry G. Baker)
Subject: Efficient Unaligned Bit-substring Search in Bitvectors
Message-ID: <hbakerD4qwE5.6B1@netcom.com>
Summary: How to do it
Organization: nil
Date: Wed, 1 Mar 1995 04:56:29 GMT
Lines: 10
Sender: hbaker@netcom23.netcom.com
Xref: glinda.oz.cs.cmu.edu comp.lang.lisp:16924 comp.lang.scheme:12218 comp.lang.misc:20664

I have just posted both WWW (.html) and compressed Postscript (.ps.Z)
versions of the following memo to my www/ftp directory.

"The Efficient Implementation of Common Lisp's SEARCH Function on
Bit-vectors".  Unpublished April, 1991 memo on how byte-parallelism
can be utilized to achieve high-speed on searches for an unaligned
bit-substring within a bit-vector.

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

