Change log for the set-cover package

0.0.8

• SetCover.Exact.Priority implements the Algorithm X using a priority queue that registers the sets each element is contained in. This allows for drastic speedup of the Nonogram example.

0.0.7

• ESC.bitVectorFromSetAssigns allows to turn sets into bit vectors without manual bit position gymnastics.

• Use it in Sudoku and Nonogram examples.

0.0.6

• Add SetCover.Exact.Set instances for Map, Integer, IntSet.

0.0.5.1

• example/Nonogram: explore different encodings of the problem