# Difference between revisions of "Applications and libraries/Data structures"

From HaskellWiki

(Moved Partial to Data structures) |
|||

Line 7: | Line 7: | ||

:Chris Okasaki is developing a library of efficient data structures. It provides sequences, finite maps, priority queues, and sets/bags. ([http://www.eecs.usma.edu/Personnel/okasaki/pubs.html#hw00 overview paper]). |
:Chris Okasaki is developing a library of efficient data structures. It provides sequences, finite maps, priority queues, and sets/bags. ([http://www.eecs.usma.edu/Personnel/okasaki/pubs.html#hw00 overview paper]). |
||

⚫ | |||

+ | ;[http://homepages.nildram.co.uk/~ahey/HLibs/Data.Tree.AVL/ Data.Tree.AVL] |
||

⚫ | |||

+ | :An implementation of AVL trees and related utilities. |
||

;[http://www.cs.orst.edu/~erwig/fgl/ FGL - A Functional Graph Library] |
;[http://www.cs.orst.edu/~erwig/fgl/ FGL - A Functional Graph Library] |
||

Line 24: | Line 24: | ||

;[http://www.lochan.org/2005/keith-cl/libs/ Partial v0.1] |
;[http://www.lochan.org/2005/keith-cl/libs/ Partial v0.1] |
||

:The Partial library provides a partial order class. It also provides routines for generating a Hasse diagram from a set and a partial order. Renderers are provided for the abstract Hasse diagram representation into LaTeX (via Xy-pic) and into dot, the format for AT&T's Graphviz tools. Since no horizontal sorting is done, the Xy-pic output is rather poor at present; dot does a much better job with its layout optimisation algorithm. |
:The Partial library provides a partial order class. It also provides routines for generating a Hasse diagram from a set and a partial order. Renderers are provided for the abstract Hasse diagram representation into LaTeX (via Xy-pic) and into dot, the format for AT&T's Graphviz tools. Since no horizontal sorting is done, the Xy-pic output is rather poor at present; dot does a much better job with its layout optimisation algorithm. |
||

+ | |||

⚫ | |||

⚫ |

## Revision as of 19:28, 22 March 2006

*The copyright status of this work is not known. Please help resolve this on the talk page.*

*This page contains a list of libraries and tools in a certain category. For a comprehensive list of such pages, see Applications and libraries.*

## Haskell Libraries and Tools for Data Structures

- Edison
- Chris Okasaki is developing a library of efficient data structures. It provides sequences, finite maps, priority queues, and sets/bags. (overview paper).

- Data.Tree.AVL
- An implementation of AVL trees and related utilities.

- FGL - A Functional Graph Library
- The functional graph library provides a collection of graph operations.

- Strafunski
- A bundle for generic programming. It provides programming support for generic traversal as useful in the implementation of program transformations.

- The Haskell STate Preprocessor
- This is a short preprocessor for stateful Haskell programs. It aleviates the pain of performing single array lookup/write/update functions with some syntax to support it. It also supports hash table operations based on the HashTable implementation available from the author. Finally, it supports monadic if and monadic case constructions. It is lightweight in the sense that it performs no syntactic analysis and is essentially a character transformer.

- Fast Packed Strings
- The FPS library provides mmapped and malloc'd packed strings (byte arrays held by a ForeignPtr), along with a list interface to these strings. It lets you do extremely fast IO in Haskell; in some cases, even faster than typical C implementations, as well as conserving space.

- Partial v0.1
- The Partial library provides a partial order class. It also provides routines for generating a Hasse diagram from a set and a partial order. Renderers are provided for the abstract Hasse diagram representation into LaTeX (via Xy-pic) and into dot, the format for AT&T's Graphviz tools. Since no horizontal sorting is done, the Xy-pic output is rather poor at present; dot does a much better job with its layout optimisation algorithm.

- Binary/BinArray library
*(This link is dead. Fix it or remove it.)* - A port of Malcolm Wallace's Binary library for NHC13, offering facilities for heap compression and binary I/O. A related library, BinArray, uses Binary to implement imperative binary arrays.