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

Content deleted Content added
m clean up, typo(s) fixed: ically- → ically
m Haskell: WP:LINKs: update-standardize, needless WP:PIPEs > WP:NOPIPEs. MOS:FIRSTABBReviation clarify, define before WP:ABBR in parentheses.
Line 508:
 
===Haskell===
The [[Haskell (programming language)|Haskell]] programming language provides only one kind of associative container – a list of pairs:
 
<syntaxhighlight lang="haskell">
Line 520:
Note that the lookup function returns a "Maybe" value, which is "Nothing" if not found, or "Just 'result{{' "}} when found.
 
The [[Glasgow Haskell Compiler|GHC]] (GHC), the most commonly used implementation of Haskell, provides two more types of associative containers. Other implementations mightmay also provide these.
 
One is polymorphic functional maps (represented as immutable balanced binary trees):