packages feed

bktrees 0.3 → 0.3.1

raw patch · 2 files changed

+10/−6 lines, 2 filesdep ~basePVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: base

API changes (from Hackage documentation)

- Data.Set.BKTree: instance (Eq a) => Metric [a]
+ Data.Set.BKTree: instance Eq a => Metric [a]
- Data.Set.BKTree: class (Eq a) => Metric a
+ Data.Set.BKTree: class Eq a => Metric a
- Data.Set.BKTree: closest :: (Metric a) => a -> BKTree a -> Maybe (a, Int)
+ Data.Set.BKTree: closest :: Metric a => a -> BKTree a -> Maybe (a, Int)
- Data.Set.BKTree: delete :: (Metric a) => a -> BKTree a -> BKTree a
+ Data.Set.BKTree: delete :: Metric a => a -> BKTree a -> BKTree a
- Data.Set.BKTree: distance :: (Metric a) => a -> a -> Int
+ Data.Set.BKTree: distance :: Metric a => a -> a -> Int
- Data.Set.BKTree: elemsDistance :: (Metric a) => Int -> a -> BKTree a -> [a]
+ Data.Set.BKTree: elemsDistance :: Metric a => Int -> a -> BKTree a -> [a]
- Data.Set.BKTree: fromList :: (Metric a) => [a] -> BKTree a
+ Data.Set.BKTree: fromList :: Metric a => [a] -> BKTree a
- Data.Set.BKTree: insert :: (Metric a) => a -> BKTree a -> BKTree a
+ Data.Set.BKTree: insert :: Metric a => a -> BKTree a -> BKTree a
- Data.Set.BKTree: member :: (Metric a) => a -> BKTree a -> Bool
+ Data.Set.BKTree: member :: Metric a => a -> BKTree a -> Bool
- Data.Set.BKTree: memberDistance :: (Metric a) => Int -> a -> BKTree a -> Bool
+ Data.Set.BKTree: memberDistance :: Metric a => Int -> a -> BKTree a -> Bool
- Data.Set.BKTree: union :: (Metric a) => BKTree a -> BKTree a -> BKTree a
+ Data.Set.BKTree: union :: Metric a => BKTree a -> BKTree a -> BKTree a
- Data.Set.BKTree: unions :: (Metric a) => [BKTree a] -> BKTree a
+ Data.Set.BKTree: unions :: Metric a => [BKTree a] -> BKTree a

Files

Data/Set/BKTree.hs view
@@ -434,8 +434,8 @@             = do printf "%-25s :" s                  result <- quickCheckResult prop                  case result of-                   Success _   -> return ()-                   GaveUp  _ _ -> return ()-                   _           -> exitFailure+                   Success _ _ _ -> return ()+                   GaveUp  _ _ _ -> return ()+                   _             -> exitFailure                     #endif
bktrees.cabal view
@@ -1,5 +1,5 @@ name:		bktrees-version:	0.3+version:	0.3.1 license:	BSD3 license-file:	LICENSE author:		Josef Svenningsson@@ -12,17 +12,21 @@ 		approximate member search, allowing you to search for  		elements that are of a certain distance from the element  		you are searching for.-cabal-version: >=1.2+cabal-version: >=1.6 extra-source-files: 	test/Test.hs extra-source-files:	README build-type:	Simple +source-repository head+  type:     darcs+  location: http://patch-tag.com/r/josef/bktrees+ flag splitBase   description: Choose the new smaller, split-up base package.  library   if flag(splitBase)-    build-depends: base >= 3, base < 4, containers, array+    build-depends: base >= 3, base < 5, containers, array   else     build-depends: base < 3