[Haskell-beginners] How to convert a Data.Set to a Descending List?

[David Place]

On Aug 21, 2011, at 9:46 AM, Sunil S Nandihalli wrote:

> I currently have a Set I want to take a couple of elements on either
> side of a given key. How can I do this?

I'll bet this is very easy using Finger Trees.  

> http://www.soi.city.ac.uk/~ross/papers/FingerTree.html

> http://hackage.haskell.org/packages/archive/fingertree/0.0/doc/html/Data-FingerTree.html


____________________
David Place   
Owner, Panpipes Ho! LLC
http://panpipesho.com
d at vidplace.com