Date: Wed, 28 Jul 1999 19:15:31 -0400 From: Tim Vanderhoek <vanderh@ecf.utoronto.ca> To: "Daniel C. Sobral" <dcs@newsguy.com> Cc: James Howard <howardjp@wam.umd.edu>, freebsd-hackers@FreeBSD.ORG Subject: Re: replacing grep(1) Message-ID: <19990728191531.A318@mad> In-Reply-To: <379F3701.F79E10DF@newsguy.com>; from Daniel C. Sobral on Thu, Jul 29, 1999 at 01:59:45AM %2B0900 References: <Pine.GSO.4.10.9907272344440.19477-100000@rac9.wam.umd.edu> <379F3701.F79E10DF@newsguy.com>
next in thread | previous in thread | raw e-mail | index | archive | help
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
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?19990728191531.A318>