summaryrefslogtreecommitdiff
path: root/src/runtime/haskell
diff options
context:
space:
mode:
authorpeter.ljunglof <peter.ljunglof@gu.se>2012-08-29 21:45:10 +0000
committerpeter.ljunglof <peter.ljunglof@gu.se>2012-08-29 21:45:10 +0000
commita7de16c34b7ccffc5ae0ac4fd004dfc155b4f546 (patch)
treea39529476f339e06ba4b9283ef9073c9b5dcaf75 /src/runtime/haskell
parente2ecdfed1fea8dcc77ab3c8d83f74fc577908f5b (diff)
Added an O(n log n) version of nub
The new nub is called nub', and it replaces the old sortNub which was not lazy and did not retain the order between the elements.
Diffstat (limited to 'src/runtime/haskell')
-rw-r--r--src/runtime/haskell/PGF/Optimize.hs1
1 files changed, 0 insertions, 1 deletions
diff --git a/src/runtime/haskell/PGF/Optimize.hs b/src/runtime/haskell/PGF/Optimize.hs
index f7fb79779..833684fe0 100644
--- a/src/runtime/haskell/PGF/Optimize.hs
+++ b/src/runtime/haskell/PGF/Optimize.hs
@@ -20,7 +20,6 @@ import qualified Data.IntMap as IntMap
import qualified GF.Data.TrieMap as TrieMap
import qualified Data.List as List
import Control.Monad.ST
-import GF.Data.Utilities(sortNub)
optimizePGF :: PGF -> PGF
optimizePGF pgf = pgf{concretes=fmap (updateConcrete (abstract pgf) .