Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. module Combinatorics.Battleship.Count.CountMap

   No documentation available.

2. fromMap :: Storable a => Map (Key w) a -> T w a

   battleship-combinatorics	Combinatorics.Battleship.Count.CountMap

   No documentation available.

3. toMap :: Storable a => T w a -> Map (Key w) a

   battleship-combinatorics	Combinatorics.Battleship.Count.CountMap

   No documentation available.

4. foldMap :: Monoid m => (Use -> m) -> T w -> m

   battleship-combinatorics	Combinatorics.Battleship.Count.Frontier

   Can be faster than toList since it does not build a list. It ignores Free squares at the end of the frontier.

5. type CountMap w = T w Count

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

   No documentation available.

6. type CountMapPath w = Path w Count

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

   No documentation available.

7. countBoundedFleetsFromMap :: CountMap w -> Map T Integer

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

   No documentation available.

8. countBoundedFleetsFromMap_ :: CountMap w -> Map T Integer

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

   No documentation available.

9. countBoundedFromMap :: (C a, Storable a) => T -> T w a -> a

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

   No documentation available.

10. printMapSizes :: IO ()

    battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

    No documentation available.

Page 1121 of many | Previous | Next