From mboxrd@z Thu Jan  1 00:00:00 1970
Return-Path: <gcc-bugs-return-460316-listarch-gcc-bugs=gcc.gnu.org@gcc.gnu.org>
Received: (qmail 25607 invoked by alias); 1 Sep 2014 15:34:35 -0000
Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm
Precedence: bulk
List-Id: <gcc-bugs.gcc.gnu.org>
List-Archive: <http://gcc.gnu.org/ml/gcc-bugs/>
List-Post: <mailto:gcc-bugs@gcc.gnu.org>
List-Help: <mailto:gcc-bugs-help@gcc.gnu.org>
Sender: gcc-bugs-owner@gcc.gnu.org
Received: (qmail 25557 invoked by uid 55); 1 Sep 2014 15:34:31 -0000
From: "joseph at codesourcery dot com" <gcc-bugzilla@gcc.gnu.org>
To: gcc-bugs@gcc.gnu.org
Subject: [Bug libstdc++/62318] optimization of string searches using Nigel Horspool's Boyer-Moore-Horpool algorithm
Date: Mon, 01 Sep 2014 15:34:00 -0000
X-Bugzilla-Reason: CC
X-Bugzilla-Type: changed
X-Bugzilla-Watch-Reason: None
X-Bugzilla-Product: gcc
X-Bugzilla-Component: libstdc++
X-Bugzilla-Version: 4.9.1
X-Bugzilla-Keywords:
X-Bugzilla-Severity: enhancement
X-Bugzilla-Who: joseph at codesourcery dot com
X-Bugzilla-Status: UNCONFIRMED
X-Bugzilla-Priority: P3
X-Bugzilla-Assigned-To: unassigned at gcc dot gnu.org
X-Bugzilla-Target-Milestone: ---
X-Bugzilla-Flags:
X-Bugzilla-Changed-Fields:
Message-ID: <bug-62318-4-24GgOMP3mq@http.gcc.gnu.org/bugzilla/>
In-Reply-To: <bug-62318-4@http.gcc.gnu.org/bugzilla/>
References: <bug-62318-4@http.gcc.gnu.org/bugzilla/>
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: 7bit
X-Bugzilla-URL: http://gcc.gnu.org/bugzilla/
Auto-Submitted: auto-generated
MIME-Version: 1.0
X-SW-Source: 2014-09/txt/msg00150.txt.bz2

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=62318

--- Comment #5 from joseph at codesourcery dot com <joseph at codesourcery dot com> ---
glibc's strstr already uses an asymptotically fast (i.e. O(m+n) instead of 
O(mn)) algorithm.  See string/str-two-way.h.