Hi Stephen,
I will need a function that computes prime (normal?) form, of course, and
it is just begging to be memoized. I wonder if that is possible with
Data.Set, or whether it would be much faster using the bit vector
representation?
Thanks,
Mike
Stephen Tetley wrote:
Postscript...
Hi Mike
I rather overlooked your efficiency concerns, however I wouldn't be so
concerned. By the nature of what they represent I wouldn't expect
pitch classes to grow to a size where a bit representation out weighs
the convenience of a list or Data.Set.
By the same reason - I'd only use an array for the pitch matrix if I
felt an interface favouring index-lookup was most 'comfortable'.
Best wishes
Stephen
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
