use Ord for nub

O(n*logn)

Author: matthewleon

src/Data/Array.purs

@@ -117,9 +117,10 @@ import Prelude
 import Control.Alt ((<|>))
 import Control.Alternative (class Alternative)
 import Control.Lazy (class Lazy, defer)
+import Control.Monad.Eff (Eff)
 import Control.Monad.Rec.Class (class MonadRec, Step(..), tailRecM2)
-import Control.Monad.ST (pureST)
-import Data.Array.ST (unsafeFreeze, emptySTArray, pokeSTArray, pushSTArray, modifySTArray, withArray)
+import Control.Monad.ST (ST, pureST)
+import Data.Array.ST (STArray, unsafeFreeze, unsafeThaw, emptySTArray, pokeSTArray, pushSTArray, modifySTArray, withArray)
 import Data.Array.ST.Iterator (iterator, iterate, pushWhile)
 import Data.Foldable (class Foldable, foldl, foldr, traverse_)
 import Data.Foldable (foldl, foldr, foldMap, fold, intercalate, elem, notElem, find, findMap, any, all) as Exports
@@ -873,8 +874,19 @@ groupBy op xs =
 -- | nub [1, 2, 1, 3, 3] = [1, 2, 3]
 -- | ```
 -- |
-nub :: forall a. Eq a => Array a -> Array a
-nub = nubBy eq
+nub :: forall a. Ord a => Array a -> Array a
+nub arr = case head sorted of
+  Nothing -> []
+  Just x -> pureST do
+     result <- unsafeThaw $ singleton x
+     unsafeFreeze =<< foldRecM assimilate result sorted
+  where
+  sorted = sort arr
+
+  assimilate :: forall h. STArray h a -> a -> Eff (st :: ST h) (STArray h a)
+  assimilate acc x = do
+     lst <- unsafePartial (fromJust <<< last) <$> unsafeFreeze acc
+     if lst == x then pure acc else pushSTArray acc x *> pure acc
 
 -- | Remove the duplicates from an array, where element equality is determined
 -- | by the specified equivalence relation, creating a new array.