Hoogle Search

Within LTS Haskell 24.49 (ghc-9.10.3)

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

Exact lookup

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

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

   No documentation available.

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

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

   No documentation available.

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

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

   No documentation available.

4. nextFrontierBounded :: Nat w => Size w -> T -> CountMap w -> CountMap w

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

   Here we save memory and speed up the computation in the following way: We stop searching deeper if

   1. the fleet becomes larger than the requested fleet ("larger" means, that for at least one ship size the number of ships is larger than in the requested fleet)
   2. the cumulated fleet becomes larger than the cumulated requested fleet This is necessary, since we do not know the final length of the vertical ships at the frontier.
   In this approach, the fleet does not contain the vertical ships at the frontier.

5. nextFrontierBoundedExternal :: Nat w => Size w -> T -> CountMapPath w -> CountMap w -> IO ()

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

   No documentation available.

6. propCountBounded :: Property

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

   No documentation available.

7. transitionFrontierBounded :: Nat w => Size w -> T -> T w -> T -> [(T w, T)]

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip

   No documentation available.

8. distributionBoundedExternal :: (Nat w, Nat h) => Bool -> T -> IO (CountDistrPath w h)

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip.Distribution

   No documentation available.

9. nextFrontierBoundedExternal :: (Nat w, Nat h) => Size w -> T -> CountDistrPath w (Succ h) -> CountDistrMap w h -> IO ()

   battleship-combinatorics	Combinatorics.Battleship.Count.ShortenShip.Distribution

   No documentation available.

10. unbounded :: PgRangeBound a

    beam-postgres	Database.Beam.Postgres

    No documentation available.

Page 41 of many | Previous | Next