From owner-freebsd-hackers Wed Jul 28 16:16:58 1999 Delivered-To: freebsd-hackers@freebsd.org Received: from smtp11.bellglobal.com (smtp11.bellglobal.com [204.101.251.53]) by hub.freebsd.org (Postfix) with ESMTP id 27E5914FD6 for ; Wed, 28 Jul 1999 16:16:45 -0700 (PDT) (envelope-from vanderh@ecf.toronto.edu) Received: from localhost.nowhere (ppp18328.on.bellglobal.com [206.172.130.8]) by smtp11.bellglobal.com (8.8.5/8.8.5) with ESMTP id TAA07497; Wed, 28 Jul 1999 19:18:39 -0400 (EDT) Received: (from tim@localhost) by localhost.nowhere (8.9.3/8.9.1) id TAA00380; Wed, 28 Jul 1999 19:15:31 -0400 (EDT) (envelope-from tim) Date: Wed, 28 Jul 1999 19:15:31 -0400 From: Tim Vanderhoek To: "Daniel C. Sobral" Cc: James Howard , freebsd-hackers@FreeBSD.ORG Subject: Re: replacing grep(1) Message-ID: <19990728191531.A318@mad> References: <379F3701.F79E10DF@newsguy.com> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Mailer: Mutt 0.95i In-Reply-To: <379F3701.F79E10DF@newsguy.com>; from Daniel C. Sobral on Thu, Jul 29, 1999 at 01:59:45AM +0900 Sender: owner-freebsd-hackers@FreeBSD.ORG Precedence: bulk X-Loop: FreeBSD.ORG On Thu, Jul 29, 1999 at 01:59:45AM +0900, Daniel C. Sobral wrote: > > Sorry, but a simplistic analysis like that just won't cut for grep. > The algorithmic complexity is highly relevant here. Try this: Algorithmic complexity!?! It's a freaking grep application. There is no freaking algorithmic complexity. At least not outside of our regex library, anyways. The test you suggested doesn't show anything about that algorithmic complexity, though. If we have a slow regex library, though, I would consider that a separate problem from a slow grep. -- This is my .signature which gets appended to the end of my messages. To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message