aboutsummaryrefslogtreecommitdiffstats
path: root/lib/stdlib/doc/src/digraph_utils.xml
diff options
context:
space:
mode:
authorJosé Valim <[email protected]>2015-10-19 16:55:24 +0200
committerJosé Valim <[email protected]>2015-10-19 16:58:52 +0200
commitc0c2f6a204d83ee89cd179b0a6d5996e248539e5 (patch)
tree5f0172327edc4d23c71cbddb94d0bf86e6dc7d78 /lib/stdlib/doc/src/digraph_utils.xml
parent98647fcc1632f60871adee20031e294e5d5b6eb0 (diff)
downloadotp-c0c2f6a204d83ee89cd179b0a6d5996e248539e5.tar.gz
otp-c0c2f6a204d83ee89cd179b0a6d5996e248539e5.tar.bz2
otp-c0c2f6a204d83ee89cd179b0a6d5996e248539e5.zip
Use full list of bindings when matching on map keys
Prior to this patch, the following code would not eval: X = key, (fun(#{X := value}) -> true end)(#{X => value}) That's because the key evaluation was using the new list of bindings introduced on every anonymous fun. Since keys only match on values defined prior to the pattern and do not introduce any new binding, we must use the full and original list of binding.
Diffstat (limited to 'lib/stdlib/doc/src/digraph_utils.xml')
0 files changed, 0 insertions, 0 deletions