For an university project i need to design a data structure (in haskell) that's capable of representing a unix filesystem and therefore fast insertion/deletion. Support for persistent storage is also required.
Principally i was thinking to use a Binary Search Tree or an AVL Tree but since this is my first real world application in Haskell I'm not so sure if this is a good (performant) solution.
Any advice is welcome!
Regards, Gerd.
_________________________________________________________________
MSN 8 with e-mail virus protection service: 2 months FREE* http://join.msn.com/?page=features/virus
_______________________________________________ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
