MissingH 1.1.0.1 → 1.1.0.2

raw patch · 3 files changed

+7/−6 lines, 3 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• MissingH.cabal +1/−2
• src/Data/List/Utils.hs +6/−4
• src/System/Time/ParseDate.hs +0/−0

@@ -1,5 +1,5 @@ Name: MissingH-Version: 1.1.0.1+Version: 1.1.0.2 License: GPL Maintainer: John Goerzen <jgoerzen@complete.org> Author: John Goerzen@@ -70,7 +70,6 @@   Build-Depends: network, parsec, base,                haskell98, mtl, HUnit, regex-compat,-               QuickCheck >= 1.0 && < 2.0,                filepath,                hslogger  If flag(splitBase)

@@ -59,7 +59,7 @@                      -- sub,                     ) where import Data.List(intersperse, concat, isPrefixOf, isSuffixOf, elemIndices,-                elemIndex, elemIndices, tails, find, findIndex, isInfixOf)+                elemIndex, elemIndices, tails, find, findIndex, isInfixOf, nub) import Control.Monad.State(State, get, put) import Data.Maybe(isJust) @@ -473,10 +473,12 @@ You should not rely on this function necessarily preserving order, though the current implementation happens to. -This function is not compatible with infinite lists. -}+This function is not compatible with infinite lists.++This is presently an alias for Data.List.nub+ -} uniq :: Eq a => [a] -> [a]-uniq [] = []-uniq (x:xs) = x : uniq (filter (/= x) xs)+uniq = nub  ----- same as --uniq (x:xs) = x : [y | y <- uniq xs, y /= x]