From a7de16c34b7ccffc5ae0ac4fd004dfc155b4f546 Mon Sep 17 00:00:00 2001 From: "peter.ljunglof" Date: Wed, 29 Aug 2012 21:45:10 +0000 Subject: 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. --- src/runtime/haskell/PGF/Optimize.hs | 1 - 1 file changed, 1 deletion(-) (limited to 'src/runtime') 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) . -- cgit v1.2.3