Use UniqDSet for finding free names in the Linker
authorBartosz Nitka <niteria@gmail.com>
Thu, 2 Jun 2016 18:36:44 +0000 (11:36 -0700)
committerBartosz Nitka <niteria@gmail.com>
Thu, 2 Jun 2016 19:49:29 +0000 (12:49 -0700)
commitd753ea2a546733cb29c2970232ac870023aee22f
treea4f7bf1f3899298c74630884ee3ddf1ac9de651e
parentdad39ff04a6585ab9cf3a2572ea922e309e6385f
Use UniqDSet for finding free names in the Linker

This is not necessary for determinism, but it's a choice
between making this deterministic and using `nonDetEltsUFM`
and a comment explaining that it doesn't matter.

Test Plan: ./validate

Reviewers: austin, hvr, bgamari, simonmar

Reviewed By: simonmar

Subscribers: thomie

Differential Revision: https://phabricator.haskell.org/D2295

GHC Trac Issues: #4012
compiler/ghci/ByteCodeAsm.hs
compiler/ghci/Linker.hs