From ... Path: supernews.google.com!sn-xit-02!sn-xit-03!supernews.com!news.tele.dk!129.240.148.23!uio.no!Norway.EU.net!127.0.0.1!nobody From: Erik Naggum Newsgroups: comp.emacs.xemacs,comp.lang.lisp Subject: Re: writing a search-algorithm in (X)Emacs-Lisp Date: 26 Oct 2000 06:07:22 +0000 Organization: Naggum Software; vox: +47 800 35477; gsm: +47 93 256 360; fax: +47 93 270 868; http://naggum.no; http://naggum.net Lines: 17 Message-ID: <3181529242535671@naggum.net> References: <8t7r38$efi$1@riker.addcom.de> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: oslo-nntp.eunet.no 972540630 4362 195.0.192.66 (26 Oct 2000 06:10:30 GMT) X-Complaints-To: newsmaster@eunet.no NNTP-Posting-Date: 26 Oct 2000 06:10:30 GMT mail-copies-to: never User-Agent: Gnus/5.0803 (Gnus v5.8.3) Emacs/20.7 Xref: supernews.google.com comp.emacs.xemacs:1696 comp.lang.lisp:2651 * "Michael Groeneweg" | I have a problem: I need to implement a search-algorithm in Lisp | (called Boyer-Moore, if s.o. wants to know). Searching a text | should be quite simple for (X)Emacs I thougt, so I wanted to program | it in Emacs-Lisp. The search algorithm in Emacs Lisp (please note the smaller number of hyphens in English compared to German) is already an adaptation of Boyer-Moore, both for string and regular expression searches, but it is naturally more efficient with string searches. (BTW, someone, somebody, something, etc, are not abbreviated in English, either.) #:Erik -- I agree with everything you say, but I would attack to death your right to say it. -- Tom Stoppard