use containers nubOrd

Author: MaximilianAlgehed

src/Constrained/Core.hs

@@ -22,7 +22,6 @@ module Constrained.Core (
   NonEmpty ((:|)),
   Evidence (..),
   unionWithMaybe,
-  nubOrd,
 ) where
 
 import Constrained.List (
@@ -130,14 +129,3 @@ instance Typeable c => Show (Evidence c) where
 -- | Take the union of two `Maybe` values with a given union operator
 unionWithMaybe :: (a -> a -> a) -> Maybe a -> Maybe a -> Maybe a
 unionWithMaybe f ma ma' = (f <$> ma <*> ma') <|> ma <|> ma'
-
--- | Strip out duplicates (in n-log(n) time, by building an intermediate Set)
-nubOrd :: Ord a => [a] -> [a]
-nubOrd =
-  loop mempty
-  where
-    loop _ [] = []
-    loop s (a : as)
-      | a `Set.member` s = loop s as
-      | otherwise =
-          let s' = Set.insert a s in s' `seq` a : loop s' as

src/Constrained/NumOrd.hs

@@ -56,14 +56,15 @@ module Constrained.NumOrd (
 import Constrained.AbstractSyntax
 import Constrained.Base
 import Constrained.Conformance
-import Constrained.Core (Value (..), unionWithMaybe, nubOrd)
+import Constrained.Core (Value (..), unionWithMaybe)
 import Constrained.FunctionSymbol
 import Constrained.GenT
 import Constrained.Generic
 import Constrained.List
 import Constrained.PrettyUtils
 import Control.Applicative ((<|>))
 import Control.Arrow (first)
+import Data.Containers.ListUtils
 import Data.Foldable
 import Data.Kind
 import Data.List (nub)