battleship-combinatorics 0.0.0.2 → 0.0.0.3
raw patch · 1 files changed
+9/−9 lines, 1 filesdep ~randomdep ~temporarydep ~transformersPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: random, temporary, transformers
API changes (from Hackage documentation)
- Combinatorics.Battleship: Board :: (Int, Int) -> (Set (Int, Int)) -> Board
+ Combinatorics.Battleship: Board :: (Int, Int) -> Set (Int, Int) -> Board
- Combinatorics.Battleship.Count.CountMap: fromMap :: (Storable a) => Map (Key w) a -> T w a
+ Combinatorics.Battleship.Count.CountMap: fromMap :: Storable a => Map (Key w) a -> T w a
- Combinatorics.Battleship.Count.CountMap: readFile :: (Storable a) => Path w a -> IO (T w a)
+ Combinatorics.Battleship.Count.CountMap: readFile :: Storable a => Path w a -> IO (T w a)
- Combinatorics.Battleship.Count.CountMap: singleton :: (Storable a) => Key w -> a -> T w a
+ Combinatorics.Battleship.Count.CountMap: singleton :: Storable a => Key w -> a -> T w a
- Combinatorics.Battleship.Count.CountMap: toAscList :: (Storable a) => T w a -> [KeyCount w a]
+ Combinatorics.Battleship.Count.CountMap: toAscList :: Storable a => T w a -> [KeyCount w a]
- Combinatorics.Battleship.Count.CountMap: toMap :: (Storable a) => T w a -> Map (Key w) a
+ Combinatorics.Battleship.Count.CountMap: toMap :: Storable a => T w a -> Map (Key w) a
- Combinatorics.Battleship.Count.CountMap: writeFile :: (Storable a) => Path w a -> T w a -> IO ()
+ Combinatorics.Battleship.Count.CountMap: writeFile :: Storable a => Path w a -> T w a -> IO ()
- Combinatorics.Battleship.Count.Counter: sum :: (C a) => [a] -> a
+ Combinatorics.Battleship.Count.Counter: sum :: C a => [a] -> a
- Combinatorics.Battleship.Count.Frontier: blockBounded :: (Nat w) => Size w -> Position -> T w -> T w
+ Combinatorics.Battleship.Count.Frontier: blockBounded :: Nat w => Size w -> Position -> T w -> T w
- Combinatorics.Battleship.Count.Frontier: foldMap :: (Monoid m) => (Use -> m) -> T w -> m
+ Combinatorics.Battleship.Count.Frontier: foldMap :: Monoid m => (Use -> m) -> T w -> m
- Combinatorics.Battleship.Count.Frontier: insertNew :: (Nat w) => Position -> Use -> T w -> T w
+ Combinatorics.Battleship.Count.Frontier: insertNew :: Nat w => Position -> Use -> T w -> T w
- Combinatorics.Battleship.Count.Frontier: isFree :: (Nat w) => T w -> Position -> Bool
+ Combinatorics.Battleship.Count.Frontier: isFree :: Nat w => T w -> Position -> Bool
- Combinatorics.Battleship.Count.Frontier: lookup :: (Nat w) => T w -> Position -> Use
+ Combinatorics.Battleship.Count.Frontier: lookup :: Nat w => T w -> Position -> Use
- Combinatorics.Battleship.Count.Frontier: toList :: (Nat w) => T w -> [Use]
+ Combinatorics.Battleship.Count.Frontier: toList :: Nat w => T w -> [Use]
- Combinatorics.Battleship.Count.ShortenShip: canonicalFrontier :: (Nat w) => T w -> T w
+ Combinatorics.Battleship.Count.ShortenShip: canonicalFrontier :: Nat w => T w -> T w
- Combinatorics.Battleship.Count.ShortenShip: count :: (Nat w) => (Size w, Int) -> T -> Count
+ Combinatorics.Battleship.Count.ShortenShip: count :: Nat w => (Size w, Int) -> T -> Count
- Combinatorics.Battleship.Count.ShortenShip: countBounded :: (Nat w) => (Size w, Int) -> T -> Count
+ Combinatorics.Battleship.Count.ShortenShip: countBounded :: Nat w => (Size w, Int) -> T -> Count
- Combinatorics.Battleship.Count.ShortenShip: countTouching :: (Nat w) => (Size w, Int) -> T -> Count
+ Combinatorics.Battleship.Count.ShortenShip: countTouching :: Nat w => (Size w, Int) -> T -> Count
- Combinatorics.Battleship.Count.ShortenShip: insertVertical :: (Nat w) => T -> Int -> Position -> StateT (T w, T) [] ()
+ Combinatorics.Battleship.Count.ShortenShip: insertVertical :: Nat w => T -> Int -> Position -> StateT (T w, T) [] ()
- Combinatorics.Battleship.Count.ShortenShip: mergeSymmetricFrontiers :: (Nat w) => [(T w, fleet)] -> [(T w, fleet)]
+ Combinatorics.Battleship.Count.ShortenShip: mergeSymmetricFrontiers :: Nat w => [(T w, fleet)] -> [(T w, fleet)]
- Combinatorics.Battleship.Count.ShortenShip: nextFrontier :: (Nat w) => Size w -> CountMap w -> CountMap w
+ Combinatorics.Battleship.Count.ShortenShip: nextFrontier :: Nat w => Size w -> CountMap w -> CountMap w
- Combinatorics.Battleship.Count.ShortenShip: nextFrontierBounded :: (Nat w) => Size w -> T -> CountMap w -> CountMap w
+ Combinatorics.Battleship.Count.ShortenShip: nextFrontierBounded :: Nat w => Size w -> T -> CountMap w -> CountMap w
- Combinatorics.Battleship.Count.ShortenShip: nextFrontierBoundedExternal :: (Nat w) => Size w -> T -> CountMapPath w -> CountMap w -> IO ()
+ Combinatorics.Battleship.Count.ShortenShip: nextFrontierBoundedExternal :: Nat w => Size w -> T -> CountMapPath w -> CountMap w -> IO ()
- Combinatorics.Battleship.Count.ShortenShip: nextFrontierTouching :: (Nat w) => Size w -> T -> CountMap w -> CountMap w
+ Combinatorics.Battleship.Count.ShortenShip: nextFrontierTouching :: Nat w => Size w -> T -> CountMap w -> CountMap w
- Combinatorics.Battleship.Count.ShortenShip: nextFrontierTouchingExternal :: (Nat w) => Size w -> T -> CountMapPath w -> CountMap w -> IO ()
+ Combinatorics.Battleship.Count.ShortenShip: nextFrontierTouchingExternal :: Nat w => Size w -> T -> CountMapPath w -> CountMap w -> IO ()
- Combinatorics.Battleship.Count.ShortenShip: transitionFrontier :: (Nat w) => Size w -> T w -> T -> [(T w, T)]
+ Combinatorics.Battleship.Count.ShortenShip: transitionFrontier :: Nat w => Size w -> T w -> T -> [(T w, T)]
- Combinatorics.Battleship.Count.ShortenShip: transitionFrontierBounded :: (Nat w) => Size w -> T -> T w -> T -> [(T w, T)]
+ Combinatorics.Battleship.Count.ShortenShip: transitionFrontierBounded :: Nat w => Size w -> T -> T w -> T -> [(T w, T)]
- Combinatorics.Battleship.Count.ShortenShip: transitionFrontierTouching :: (Nat w) => Size w -> T -> T w -> T -> [(T w, T)]
+ Combinatorics.Battleship.Count.ShortenShip: transitionFrontierTouching :: Nat w => Size w -> T -> T w -> T -> [(T w, T)]
- Combinatorics.Battleship.Count.ShortenShip: widthRange :: (Nat w) => Size w -> [Int]
+ Combinatorics.Battleship.Count.ShortenShip: widthRange :: Nat w => Size w -> [Int]
- Combinatorics.Battleship.Count.ShortenShip.Distribution: addFrontierToDistr :: (Nat w) => T w -> CountDistr w h -> CountDistr w (Succ h)
+ Combinatorics.Battleship.Count.ShortenShip.Distribution: addFrontierToDistr :: Nat w => T w -> CountDistr w h -> CountDistr w (Succ h)
- Combinatorics.Battleship.Count.ShortenShip.Distribution: avg :: (Integral a) => a -> a -> a
+ Combinatorics.Battleship.Count.ShortenShip.Distribution: avg :: Integral a => a -> a -> a
- Combinatorics.Battleship.Count.ShortenShip.Distribution: baseCase :: (Nat w) => CountDistrMap w Zero
+ Combinatorics.Battleship.Count.ShortenShip.Distribution: baseCase :: Nat w => CountDistrMap w Zero
- Combinatorics.Battleship.Count.ShortenShip.Distribution: constant :: (Storable a) => Size2 w h -> a -> Distr w h a
+ Combinatorics.Battleship.Count.ShortenShip.Distribution: constant :: Storable a => Size2 w h -> a -> Distr w h a
- Combinatorics.Battleship.Count.ShortenShip.Distribution: countFromDistr :: (Storable a) => Distr w h a -> a
+ Combinatorics.Battleship.Count.ShortenShip.Distribution: countFromDistr :: Storable a => Distr w h a -> a
- Combinatorics.Battleship.Count.ShortenShip.Distribution: peekWithSize :: (Storable a) => Size2 w h -> Ptr (Distr w h a) -> IO (Distr w h a)
+ Combinatorics.Battleship.Count.ShortenShip.Distribution: peekWithSize :: Storable a => Size2 w h -> Ptr (Distr w h a) -> IO (Distr w h a)
- Combinatorics.Battleship.Count.ShortenShip.Distribution: rowFromFrontier :: (Nat w) => Size w -> Count -> T w -> Row w Count
+ Combinatorics.Battleship.Count.ShortenShip.Distribution: rowFromFrontier :: Nat w => Size w -> Count -> T w -> Row w Count
- Combinatorics.Battleship.Count.ShortenShip.Distribution: rowsFromDistr :: (Storable a) => Size w -> Distr w h a -> [Row w a]
+ Combinatorics.Battleship.Count.ShortenShip.Distribution: rowsFromDistr :: Storable a => Size w -> Distr w h a -> [Row w a]
- Combinatorics.Battleship.Count.ShortenShip.Distribution: sizeOfWithSize :: (Storable a) => Size2 w h -> Distr w h a -> Int
+ Combinatorics.Battleship.Count.ShortenShip.Distribution: sizeOfWithSize :: Storable a => Size2 w h -> Distr w h a -> Int
- Combinatorics.Battleship.SetCover: enumerateGen :: (Monad m) => ([AssignShipBitSet] -> m AssignShipBitSet) -> (Int, Int) -> [(ShipSize, Int)] -> m (Map (Int, Int) Bool)
+ Combinatorics.Battleship.SetCover: enumerateGen :: Monad m => ([AssignShipBitSet] -> m AssignShipBitSet) -> (Int, Int) -> [(ShipSize, Int)] -> m (Map (Int, Int) Bool)
- Combinatorics.Battleship.SetCover: listsFromBoard :: (Num a) => (a -> b) -> (Int, Int) -> Map (Int, Int) a -> [[b]]
+ Combinatorics.Battleship.SetCover: listsFromBoard :: Num a => (a -> b) -> (Int, Int) -> Map (Int, Int) a -> [[b]]
- Combinatorics.Battleship.SetCover: select :: (RandomGen g) => [a] -> StateT g Maybe a
+ Combinatorics.Battleship.SetCover: select :: RandomGen g => [a] -> StateT g Maybe a
Files
battleship-combinatorics.cabal view
@@ -1,10 +1,10 @@ Name: battleship-combinatorics-Version: 0.0.0.2+Version: 0.0.0.3 License: BSD3 License-File: LICENSE Author: Henning Thielemann <haskell@henning-thielemann.de> Maintainer: Henning Thielemann <haskell@henning-thielemann.de>-Homepage: http://hub.darcs.net/thielema/battleship-combinatorics/+Homepage: https://hub.darcs.net/thielema/battleship-combinatorics/ Category: Math Synopsis: Compute number of possible arrangements in the battleship game Description:@@ -13,17 +13,17 @@ . <https://en.wikipedia.org/wiki/Battleship_(game)> Tested-With: GHC==7.4.2, GHC==7.8.4-Cabal-Version: >=1.14+Cabal-Version: 1.14 Build-Type: Simple Source-Repository this- Tag: 0.0.0.2+ Tag: 0.0.0.3 Type: darcs- Location: http://hub.darcs.net/thielema/battleship-combinatorics/+ Location: https://hub.darcs.net/thielema/battleship-combinatorics/ Source-Repository head Type: darcs- Location: http://hub.darcs.net/thielema/battleship-combinatorics/+ Location: https://hub.darcs.net/thielema/battleship-combinatorics/ Library Build-Depends:@@ -31,17 +31,17 @@ pooled-io >=0.0.2 && <0.1, combinatorial >=0.0 && <0.2, set-cover >=0.0.7 && <0.1,- temporary >=1.1 && <1.3,+ temporary >=1.1 && <1.4, directory >=1.1 && <1.4, filepath >=1.3 && <1.5,- random >=1.0 && <1.2,+ random >=1.0 && <1.3, storable-record >=0.0.3 && <0.1, storablevector >=0.2.11 && <0.3, containers >=0.4.2 && <0.7, deepseq >=1.3 && <1.5, non-empty >=0.2.1 && <0.4, semigroups >=0.1 && <1.0,- transformers >=0.3 && <0.6,+ transformers >=0.3 && <0.7, utility-ht >=0.0.8 && <0.1, prelude-compat >=0.0 && <0.0.1, base >=4.5 && <5