Date: Sun, 2 Dec 2001 16:08:04 +0300 From: "Andrey A. Chernov" <ache@nagual.pp.ru> To: Mark Murray <mark@grondar.za> Cc: arch@FreeBSD.ORG Subject: Re: BSD sort vs GNU sort. Message-ID: <20011202130804.GA61024@nagual.pp.ru> In-Reply-To: <200112021300.fB2D06036554@grimreaper.grondar.org> References: <20011202124701.GA60816@nagual.pp.ru> <200112021300.fB2D06036554@grimreaper.grondar.org>
next in thread | previous in thread | raw e-mail | index | archive | help
On Sun, Dec 02, 2001 at 13:00:06 +0000, Mark Murray wrote: > > It is still possible to add one byte collation support to BSD sort, also > > it will be harder than adding it to GNU sort, because whole collation > > table must be builded first, before runtime comparison. > > So, can you do it? > > And if so, _will_ you do it? :-) Yes, but it may takes some amount of time, it will be not easy patch as for GNU sort. BTW, what exactly is urgent in sort replacement idea? As I see by first look, BSD sort as designed will be somewhat faster, but needs lots of temporary files comparing to GNU sort. The next thing we need to check _before_ switch efforts is its POSIX conformance. -- Andrey A. Chernov http://ache.pp.ru/ To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-arch" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20011202130804.GA61024>