From mboxrd@z Thu Jan 1 00:00:00 1970 Path: news.gmane.org!not-for-mail From: Ulrich Mueller Newsgroups: gmane.emacs.devel Subject: Re: Case mapping of sharp s Date: Wed, 18 Nov 2009 20:05:05 +0100 Message-ID: <19204.17761.161912.573670@a1i15.kph.uni-mainz.de> References: <19200.4158.380820.761685@a1i15.kph.uni-mainz.de> <83lji6mgg4.fsf@gnu.org> <83iqd9m14h.fsf@gnu.org> <83bpj0mq2v.fsf@gnu.org> NNTP-Posting-Host: lo.gmane.org Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Trace: ger.gmane.org 1258571385 2873 80.91.229.12 (18 Nov 2009 19:09:45 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Wed, 18 Nov 2009 19:09:45 +0000 (UTC) Cc: Eli Zaretskii , emacs-devel@gnu.org, Kenichi Handa To: Stefan Monnier Original-X-From: emacs-devel-bounces+ged-emacs-devel=m.gmane.org@gnu.org Wed Nov 18 20:09:37 2009 Return-path: Envelope-to: ged-emacs-devel@m.gmane.org Original-Received: from lists.gnu.org ([199.232.76.165]) by lo.gmane.org with esmtp (Exim 4.50) id 1NApuI-0006u6-3b for ged-emacs-devel@m.gmane.org; Wed, 18 Nov 2009 20:09:34 +0100 Original-Received: from localhost ([127.0.0.1]:59514 helo=lists.gnu.org) by lists.gnu.org with esmtp (Exim 4.43) id 1NApuH-0001cO-L2 for ged-emacs-devel@m.gmane.org; Wed, 18 Nov 2009 14:09:33 -0500 Original-Received: from mailman by lists.gnu.org with tmda-scanned (Exim 4.43) id 1NApqJ-0008PA-JX for emacs-devel@gnu.org; Wed, 18 Nov 2009 14:05:27 -0500 Original-Received: from exim by lists.gnu.org with spam-scanned (Exim 4.43) id 1NApqF-0008ML-2U for emacs-devel@gnu.org; Wed, 18 Nov 2009 14:05:27 -0500 Original-Received: from [199.232.76.173] (port=50742 helo=monty-python.gnu.org) by lists.gnu.org with esmtp (Exim 4.43) id 1NApqE-0008MF-QE for emacs-devel@gnu.org; Wed, 18 Nov 2009 14:05:22 -0500 Original-Received: from a1iwww1.kph.uni-mainz.de ([134.93.134.1]:44634) by monty-python.gnu.org with esmtps (TLS-1.0:DHE_RSA_AES_256_CBC_SHA1:32) (Exim 4.60) (envelope-from ) id 1NApqC-0006PI-DH; Wed, 18 Nov 2009 14:05:20 -0500 Original-Received: from a1i15.kph.uni-mainz.de (a1i15.kph.uni-mainz.de [134.93.134.92]) by a1iwww1.kph.uni-mainz.de (8.14.0/8.13.4) with ESMTP id nAIJ56j7030435; Wed, 18 Nov 2009 20:05:06 +0100 Original-Received: from a1i15.kph.uni-mainz.de (localhost [127.0.0.1]) by a1i15.kph.uni-mainz.de (8.14.3/8.14.2) with ESMTP id nAIJ55SJ032404; Wed, 18 Nov 2009 20:05:05 +0100 Original-Received: (from ulm@localhost) by a1i15.kph.uni-mainz.de (8.14.3/8.14.3/Submit) id nAIJ55CT032401; Wed, 18 Nov 2009 20:05:05 +0100 In-Reply-To: X-Mailer: VM 8.0.12 under 23.1.1 (x86_64-pc-linux-gnu) X-detected-operating-system: by monty-python.gnu.org: GNU/Linux 2.6 (newer, 1) X-BeenThere: emacs-devel@gnu.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: "Emacs development discussions." List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Original-Sender: emacs-devel-bounces+ged-emacs-devel=m.gmane.org@gnu.org Errors-To: emacs-devel-bounces+ged-emacs-devel=m.gmane.org@gnu.org Xref: news.gmane.org gmane.emacs.devel:117203 Archived-At: >>>>> On Wed, 18 Nov 2009, Stefan Monnier wrote: > Given the fact that all the strings in the set are very similar, > it should be possible to come up with an efficient algorithm for it. > The basic idea I'd try is to build the BM table for each of the > alternative strings and then merge them into a single table that > takes for each entry the smallest shift distance of each table. So if the string has n characters and each of them has two case variants, then 2^n keys would be needed for the search? (Or even more, if the extra slots of the case table are used.) Ulrich