set-cover-0.1.1: Solve exact set cover problems like Sudoku, 8 Queens, Soma Cube, Tetris Cube

Safe HaskellNone

Math.SetCover.BitPriorityQueue

Documentation

data Queue bits e Source

null :: Queue bits e -> BoolSource

fromSets :: (Enum e, C bits) => EnumMap e (Set bits) -> Queue bits eSource

elemUnions :: Enum e => Queue t e -> EnumSet eSource

partition :: (C bits, Enum e) => Queue bits e -> Set bits -> (Queue bits e, Queue bits e)Source

difference :: (C bits, Enum e) => Queue bits e -> Queue bits e -> Queue bits eSource

findMin :: C bits => Queue bits e -> Maybe (EnumSet e)Source

findMinValue :: C bits => Queue bits e -> Maybe (Set bits, EnumSet e)Source