Blog articles/Data
From HaskellWiki
(Difference between revisions)
(→Generics) |
(→Data structures) |
||
| Line 3: | Line 3: | ||
== Data structures == | == Data structures == | ||
| - | + | === Trees === | |
| + | |||
* [http://scienceblogs.com/goodmath/2006/12/a_tree_grows_up_in_haskell_bui_1.php A Tree Grows Up in Haskell: Building a Dictionary Type] | * [http://scienceblogs.com/goodmath/2006/12/a_tree_grows_up_in_haskell_bui_1.php A Tree Grows Up in Haskell: Building a Dictionary Type] | ||
| - | * [http:// | + | * [http://notvincenz.blogspot.com/2007/07/flatten-benchmark.html Flattening trees] |
| - | + | ||
* [http://www.randomhacks.net/articles/2007/02/10/map-fusion-and-haskell-performance Map fusion: Making Haskell 225% faster] | * [http://www.randomhacks.net/articles/2007/02/10/map-fusion-and-haskell-performance Map fusion: Making Haskell 225% faster] | ||
| + | |||
| + | === Stacks === | ||
| + | |||
| + | * [http://progexpr.blogspot.com/2006/11/haskell-stacks-two-different-ways.html Haskell Stacks : Two Different Ways] | ||
| + | |||
| + | === Queues === | ||
| + | |||
| + | * [http://www.randomhacks.net/articles/2007/02/08/haskell-queues-without-pointers Queues without pointers] | ||
| + | |||
| + | === Zipper === | ||
* [http://cgi.cse.unsw.edu.au/~dons/blog/2007/05/17#xmonad_part1b_zipper Roll Your Own Window Manager: Tracking Focus with a Zipper] | * [http://cgi.cse.unsw.edu.au/~dons/blog/2007/05/17#xmonad_part1b_zipper Roll Your Own Window Manager: Tracking Focus with a Zipper] | ||
| + | |||
===Strings=== | ===Strings=== | ||
| Line 21: | Line 32: | ||
* [http://neilmitchell.blogspot.com/2007/06/boilerplate-considered-harmful-uniplate.html Boilerplate considered harmful (Uniplate edition!)] | * [http://neilmitchell.blogspot.com/2007/06/boilerplate-considered-harmful-uniplate.html Boilerplate considered harmful (Uniplate edition!)] | ||
| + | |||
| + | === Miscelleanous === | ||
| + | * [http://syntaxfree.wordpress.com/2007/02/11/finally-some-hacking-of-my-own-a-counter-datatype/ A counter datatype with constant-time update] | ||
=== Further reading === | === Further reading === | ||
Revision as of 00:04, 8 July 2007
Contents |
1 Data structures
1.1 Trees
- A Tree Grows Up in Haskell: Building a Dictionary Type
- Flattening trees
- Map fusion: Making Haskell 225% faster
1.2 Stacks
1.3 Queues
1.4 Zipper
1.5 Strings
1.6 Mutable data
1.7 Generics
1.8 Miscelleanous
1.9 Further reading
2 Control structures
See also the subsections for monads and comonads.
