Combinatorics.Battleship.Count.Frontier

Documentation

data T w

Efficient representation of a (Map Position Use).

We need it for description of a cut of a board with ships.

   ....#.....
   ....#.....
   ..........
   ####......
   ..........
___...#...#..___
   ##.#...#..
   ...#......
   ...#..###.
   ..........

Say, we are constructing the board with ships beginning from the bottom. Using information from the cut, we want to know at what positions in the upper plane are ships allowed. In the example the frontier at the cut would be

fromString "xxx3x.x1x."

The numbers 3 and 1 denotes lengths of the parts of vertical ships below the cut. The x's denote blocked columns, i.e. in these columns it is not allowed to place ships immediately above the cut.

Instances

Eq (T w)

Defined in Combinatorics.Battleship.Count.Frontier

Methods

(==) :: T w -> T w -> Bool

(/=) :: T w -> T w -> Bool

Ord (T w)

Defined in Combinatorics.Battleship.Count.Frontier

Methods

compare :: T w -> T w -> Ordering

(<) :: T w -> T w -> Bool

(<=) :: T w -> T w -> Bool

(>) :: T w -> T w -> Bool

(>=) :: T w -> T w -> Bool

max :: T w -> T w -> T w

min :: T w -> T w -> T w

Nat w => Show (T w)

Defined in Combinatorics.Battleship.Count.Frontier

Methods

showsPrec :: Int -> T w -> ShowS

show :: T w -> String

showList :: [T w] -> ShowS

Nat w => Arbitrary (T w)

Defined in Combinatorics.Battleship.Count.Frontier

Methods

arbitrary :: Gen (T w)

shrink :: T w -> [T w]

Storable (T w)

Defined in Combinatorics.Battleship.Count.Frontier

Methods

sizeOf :: T w -> Int

alignment :: T w -> Int

peekElemOff :: Ptr (T w) -> Int -> IO (T w)

pokeElemOff :: Ptr (T w) -> Int -> T w -> IO ()

peekByteOff :: Ptr b -> Int -> IO (T w)

pokeByteOff :: Ptr b -> Int -> T w -> IO ()

peek :: Ptr (T w) -> IO (T w)

poke :: Ptr (T w) -> T w -> IO ()

type Position = Int

maxShipSize :: Int

data Use

Constructors

Free

Blocked

Vertical Int

Instances

Eq Use

Defined in Combinatorics.Battleship.Count.Frontier

Methods

(==) :: Use -> Use -> Bool

(/=) :: Use -> Use -> Bool

Show Use

Defined in Combinatorics.Battleship.Count.Frontier

Methods

showsPrec :: Int -> Use -> ShowS

show :: Use -> String

showList :: [Use] -> ShowS

blockBounded :: Nat w => Size w -> Position -> T w -> T w

Inserts at positions outside of the bounds are ignored. You may overwrite Free or Blocked fields, but not Vertical ones.

empty :: T w

insertNew :: Nat w => Position -> Use -> T w -> T w

Only allowed at positions containing Free.

isFree :: Nat w => T w -> Position -> Bool

dilate :: Size w -> T w -> T w

lookup :: Nat w => T w -> Position -> Use

reverse :: Nat w => T w -> T w

data Reverse w

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

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

toList :: Nat w => T w -> [Use]

mapToVector :: (Nat w, Storable a) => Size w -> (Use -> a) -> T w -> Vector a

fromList :: [Use] -> T w

fromString :: String -> T w

propDilate :: Property

propReverse4 :: T N4 -> Bool

propReverse5 :: T N5 -> Bool

propReverse6 :: T N6 -> Bool

propReverse7 :: T N7 -> Bool

propReverse8 :: T N8 -> Bool

propReverse9 :: T N9 -> Bool

propReverse10 :: T N10 -> Bool