Date: Sun, 02 Dec 2001 13:00:06 +0000 From: Mark Murray <mark@grondar.za> To: "Andrey A. Chernov" <ache@nagual.pp.ru> Cc: arch@FreeBSD.ORG Subject: Re: BSD sort vs GNU sort. Message-ID: <200112021300.fB2D06036554@grimreaper.grondar.org> In-Reply-To: <20011202124701.GA60816@nagual.pp.ru> ; from "Andrey A. Chernov" <ache@nagual.pp.ru> "Sun, 02 Dec 2001 15:47:02 %2B0300." References: <20011202124701.GA60816@nagual.pp.ru>
next in thread | previous in thread | raw e-mail | index | archive | help
> Just check it. Cool! > BSD sort provide byte by byte sorting, so will understand only one byte > collation sequences, if collation support will be added there. GNU sort is > a little different: sometimes it compares parts of string, not bytes, so > it will lead to longer collation sequences understanding. > > 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? :-) M -- o Mark Murray \_ FreeBSD Services Limited O.\_ Warning: this .sig is umop ap!sdn 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?200112021300.fB2D06036554>