Return-Path: Delivered-To: apmail-apr-dev-archive@www.apache.org Received: (qmail 33526 invoked from network); 8 Jan 2009 03:34:17 -0000 Received: from hermes.apache.org (HELO mail.apache.org) (140.211.11.2) by minotaur.apache.org with SMTP; 8 Jan 2009 03:34:17 -0000 Received: (qmail 34957 invoked by uid 500); 8 Jan 2009 03:34:16 -0000 Delivered-To: apmail-apr-dev-archive@apr.apache.org Received: (qmail 34908 invoked by uid 500); 8 Jan 2009 03:34:16 -0000 Mailing-List: contact dev-help@apr.apache.org; run by ezmlm Precedence: bulk List-Post: List-Help: List-Unsubscribe: List-Id: Delivered-To: mailing list dev@apr.apache.org Received: (qmail 34888 invoked by uid 99); 8 Jan 2009 03:34:16 -0000 Received: from athena.apache.org (HELO athena.apache.org) (140.211.11.136) by apache.org (qpsmtpd/0.29) with ESMTP; Wed, 07 Jan 2009 19:34:16 -0800 X-ASF-Spam-Status: No, hits=2.2 required=10.0 tests=HTML_MESSAGE,SPF_PASS X-Spam-Check-By: apache.org Received-SPF: pass (athena.apache.org: local policy) Received: from [202.106.154.132] (HELO heian.cn.fujitsu.com) (202.106.154.132) by apache.org (qpsmtpd/0.29) with ESMTP; Thu, 08 Jan 2009 03:34:07 +0000 Received: from edo.cn.fujitsu.com (edo.cn.fujitsu.com [10.167.33.5]) by heian.cn.fujitsu.com (8.14.2/8.14.2) with ESMTP id n083XiHG018291 for ; Thu, 8 Jan 2009 11:33:45 +0800 (CST) Received: from ns1.fcc.cn.fujitsu.com (localhost [127.0.0.1]) by edo.cn.fujitsu.com (8.13.7/8.13.7) with ESMTP id n083Ximq024450 for ; Thu, 8 Jan 2009 11:33:45 +0800 (CST) X-Authentication-Warning: edo.cn.fujitsu.com: iscan owned process doing -bs Received: from jxjPC (unknown [10.167.174.76]) by ns1.fcc.cn.fujitsu.com (Postfix) with ESMTP id 8F17E1DD4FD for ; Thu, 8 Jan 2009 11:33:44 +0800 (CST) From: =?gb2312?B?vNbP/r2o?= To: Subject: How to use bucket more efficient? Date: Thu, 8 Jan 2009 11:35:13 +0800 Message-ID: <006b01c97142$1db76bf0$592643d0$@fujitsu.com> MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_006C_01C97185.2BDAABF0" X-Mailer: Microsoft Office Outlook 12.0 Thread-Index: AclxQhx0+GUuaZLfSlStBfXVhAQCgQ== Content-language: zh-cn x-cr-hashedpuzzle: AZX+ A3r7 CWOz CqtU DkgB EweM E5wG FGou FO+4 FtVV F2jP GIPv G9IF IwXy JE7C KR+e;1;ZABlAHYAQABhAHAAcgAuAGEAcABhAGMAaABlAC4AbwByAGcA;Sosha1_v1;7;{19199FB5-2F7E-418C-AEA7-16EA7226A1DB};agB4AGoAQABjAG4ALgBmAHUAagBpAHQAcwB1AC4AYwBvAG0A;Thu, 08 Jan 2009 03:35:11 GMT;SABvAHcAIAB0AG8AIAB1AHMAZQAgAGIAdQBjAGsAZQB0ACAAbQBvAHIAZQAgAGUAZgBmAGkAYwBpAGUAbgB0AD8A x-cr-puzzleid: {19199FB5-2F7E-418C-AEA7-16EA7226A1DB} X-Virus-Checked: Checked by ClamAV on apache.org UbJGR;7b MIME 8qJ=5D6`2?7VSJ<~!# ------=_NextPart_000_006C_01C97185.2BDAABF0 Content-Type: text/plain; charset="gb2312" Content-Transfer-Encoding: quoted-printable Hello everyone! In the article Introduction to Buckets and Brigades, the author mentions = =A1=B0=A1=B1=A1=B1Note that we created a new bucket every time we = replaced a character. Couldn't we have prepared four buckets in advance - one for each of the characters to be replaced - and then re-used them whenever the character occurred? The problem here is that each bucket is linked to its neighbours. So if = we re-use the same bucket, we lose the links, so that the brigade now jumps over any data between the two instances of it. Hence we do need a new = bucket every time. That means this technique becomes inefficient when a high proportion of input data has to be changed. We will show alternative techniques for such cases in other articles. =A1=B0=A1=B1=A1=B1 But I did not find the =A1=B0other articles=A1=B1 the author mentioned! = Would anyone please tell me where to find this article or how to do when we want to improve the efficiency of using buckets in such situation? =20 Thanks a lot! -------------------------------------------------------------------------= --- ---------- =BC=D6=CF=FE=BD=A8 E-mail:jxj@cn.fujitsu.com TEL: (010)5969 1000(Ext.5733) (010)5969 1582 =20 ------=_NextPart_000_006C_01C97185.2BDAABF0 Content-Type: text/html; charset="gb2312" Content-Transfer-Encoding: quoted-printable

Hello = everyone!

     In the = article Introduction to Buckets = and Brigades, the author mentions

=A1=B0=A1=B1=A1=B1Note that we = created a new bucket every time we replaced a character. Couldn't we have prepared four = buckets in advance - one for each of the characters to be replaced - and then = re-used them whenever the character occurred?

The problem here is that each bucket is linked to its = neighbours. So if we re-use the same bucket, we lose the links, so that the brigade now = jumps over any data between the two instances of it. Hence we do need a new = bucket every time. That means this technique becomes inefficient when a high proportion of input data has to be changed. We will show alternative = techniques for such cases in other articles.

=A1=B0=A1=B1=A1=B1

But I did not find the =A1=B0other articles=A1=B1 the author mentioned! Would anyone = please tell me where to find this article or how to do when we want to  improve = the efficiency of using buckets in such situation?

 

Thanks a lot!

--------------------------= ------------------------------------------------------------

=BC=D6=CF=FE=BD=A8

E-mail:jxj@cn.fujitsu.com<= o:p>

TEL: (010)5969 1000(Ext.5733)  (010)5969 1582

 

------=_NextPart_000_006C_01C97185.2BDAABF0--