Revision as of 03:27, 26 November 2012 edit GoingBatty (talk \| contribs) Autopatrolled, Extended confirmed users, IP block exemptions, Pending changes reviewers, Rollbackers 663,009 edits bad link repair, general fixes & manual clean up, typos fixed: a immutable → an immutable, replaced: {{Citation needed\|date=December 2008}}. → .{{Citation needed\|date=December 2008}}, [ using AWB (8686) ← Previous edit		Revision as of 03:41, 26 November 2012 edit undo Chris the speller (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 894,181 edits m →Haskell: per WP:HYPHEN, sub-subsection 3, points 3,4,5, replaced: commonly- → commonly using AWB (8564) Next edit →
Line 321: Note that the lookup function returns a "Maybe" value, which is "Nothing" if not found, or "Just ''result''" when found. [[Glasgow Haskell Compiler\|GHC]], the most commonly- used implementation of Haskell, provides two more types of associative containers. Other implementations might also provide these. One is polymorphic functional maps (represented as immutable balanced binary trees):

Comparison of programming languages (associative array): Difference between revisions