jonasduregard / lazy-search Goto Github PK

The unsafe function, usearch, has it's type specified to Boolean predicates only. Is there a reason for this, or is this a bug?

usearch :: Enumerable a => Int -> (a -> Bool) -> [a]
usearch n p = usearch' (defOptions p) n p

Strategies with fairness or choice-subset detection don't respect sequentiality. For example, let's look at the following program:

import Control.Search
import Data.Coolean

main :: IO ()
main = do
  let total = toCool
  let partial True = true
  mapM_ print =<< search' OSF 10 (\b -> total b !&& partial b)

The expected behaviour for this program is to print True. Instead, it fails with the following error:

test/Spec.hs:7:7-25: Non-exhaustive patterns in function partial