Path: csiph.com!newsfeed.hal-mli.net!feeder3.hal-mli.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!newsfeed.xs4all.nl!newsfeed6.news.xs4all.nl!newsgate.cistron.nl!newsgate.news.xs4all.nl!194.109.133.84.MISMATCH!newsfeed.xs4all.nl!newsfeed5.news.xs4all.nl!xs4all!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.001 X-Spam-Evidence: '*H*': 1.00; '*S*': 0.00; 'kind,': 0.05; 'lately': 0.07; 'python': 0.09; 'mem': 0.09; 'received:80.91': 0.09; 'received:80.91.229': 0.09; 'received:gmane.org': 0.09; 'received:list': 0.09; 'terry': 0.09; 'assume': 0.11; 'chunks.': 0.16; 'compares': 0.16; 'equality.': 0.16; 'received:80.91.229.3': 0.16; 'received:plane.gmane.org': 0.16; 'reedy': 0.16; 'roy': 0.16; 'threads': 0.16; 'string': 0.17; 'wrote:': 0.17; 'bytes': 0.17; 'comparing': 0.17; 'jan': 0.18; 'tests': 0.18; 'latter': 0.22; 'posted': 0.22; 'testing': 0.24; 'header:In-Reply-To:1': 0.25; 'header:User-Agent:1': 0.26; '(which': 0.26; 'wondering': 0.26; 'header:X-Complaints-To:1': 0.28; 'actual': 0.28; 'character.': 0.29; 'coded': 0.29; 'str': 0.29; "i'm": 0.29; 'ends': 0.30; 'to:addr:python-list': 0.33; 'done': 0.34; 'whatever': 0.35; 'faster': 0.35; 'pm,': 0.35; 'subject:?': 0.35; 'received:org': 0.36; 'compare': 0.36; 'anything': 0.36; 'two': 0.37; 'uses': 0.37; 'subject:: ': 0.38; 'instead': 0.39; 'to:addr:python.org': 0.39; 'header:Received:5': 0.40; 'days': 0.60; "you've": 0.61; 'first': 0.61; 'ago.': 0.66; 'dangerous': 0.66; 'obvious': 0.71; 'smith': 0.71; 'received:fios.verizon.net': 0.84; 'thing).': 0.84 X-Injected-Via-Gmane: http://gmane.org/ To: python-list@python.org From: Terry Reedy Subject: Re: Comparing strings from the back? Date: Tue, 04 Sep 2012 01:13:18 -0400 References: Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit X-Gmane-NNTP-Posting-Host: pool-173-75-251-66.phlapa.fios.verizon.net User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:15.0) Gecko/20120824 Thunderbird/15.0 In-Reply-To: X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.15 Precedence: list List-Id: General discussion list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 19 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1346735624 news.xs4all.nl 6926 [2001:888:2000:d::a6]:41106 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:28388 On 9/3/2012 9:54 PM, Roy Smith wrote: > There's been a bunch of threads lately about string implementations, and > that got me thinking (which is often a dangerous thing). > > Let's assume you're testing two strings for equality. You've already > done the obvious quick tests (i.e they're the same length), and you're > down to the O(n) part of comparing every character. > > I'm wondering if it might be faster to start at the ends of the strings > instead of at the beginning? I posted the 3.3 str (in)equality compare a few days ago. It first compares length and then kind, then the actual bytes in whatever chunks. If the latter uses the C/system mem compare, that is faster than anything coded in Python or even C. -- Terry Jan Reedy