From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Spam-Checker-Version: SpamAssassin 3.1.3 (2006-06-01) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=AWL autolearn=disabled version=3.1.3 X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from discorde.inria.fr (discorde.inria.fr [192.93.2.38]) by yquem.inria.fr (Postfix) with ESMTP id 7C2DFBC69 for ; Sun, 8 Jul 2007 02:30:59 +0200 (CEST) Received: from ptb-relay03.plus.net (ptb-relay03.plus.net [212.159.14.214]) by discorde.inria.fr (8.13.6/8.13.6) with ESMTP id l680UwOa010970 (version=TLSv1/SSLv3 cipher=AES256-SHA bits=256 verify=NO) for ; Sun, 8 Jul 2007 02:30:59 +0200 Received: from [80.229.56.224] (helo=beast.local) by ptb-relay03.plus.net with esmtp (Exim) id 1I7Kfy-0003Zh-Cz for caml-list@yquem.inria.fr; Sun, 08 Jul 2007 01:30:58 +0100 From: Jon Harrop Organization: Flying Frog Consultancy Ltd. To: caml-list@yquem.inria.fr Subject: Data compression Date: Sun, 8 Jul 2007 01:25:28 +0100 User-Agent: KMail/1.9.7 MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Disposition: inline Message-Id: <200707080125.28354.jon@ffconsultancy.com> X-Miltered: at discorde with ID 46903042.001 by Joe's j-chkmail (http://j-chkmail . ensmp . fr)! X-Spam: no; 0.00; ocaml:01 haskell:01 haskell:01 ocaml:01 frog:98 lazy:02 data:02 data:02 algorithms:03 programming:03 element:03 kth:05 thread:05 trick:06 uses:07 When I first learned the C programming language I found data compression algorithms very educational. Does anyone have references to toy data compression implementations written in OCaml? There was a thread in the Haskell mailing list recently about a Burrows-Wheeler implementation that is very concise and quite efficient in Haskell. In particular, it uses the lazy sort to get the kth smallest element in O(n) time trick... :-) -- Dr Jon D Harrop, Flying Frog Consultancy Ltd. The OCaml Journal http://www.ffconsultancy.com/products/ocaml_journal/?e