MissingH version 1.0.1 is now available from http://software.complete.org/missingh and Hackage.
Two new features in this version: * The Data.Quantity module now includes support for parsing quantities. Using the binaryOpts suffixes, it can parse things like 1.5m and 2g into the appropriate megabyte/gigabyte numbers. * New module Data.BinPacking, which provides a standard infrastructure for solving the bin-packing problem, as well as two algorithms for doing so. The bin-packing problem is finding the best way to fit items of varying sizes into bins if fixed sizes, using the fewest number of bins. This is useful, say, to fit data files onto the fewest number of CDs or DVDs. The example algorithms include a naive "pack in order given" function as well as a "pack largest valid object first" function. -- John _______________________________________________ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
