CounterExample ["NeMapPairs ((0,'a') :| [])"] (PropertyFalse Nothing)


NeIntMapPairs ((8,'a') :| [])deleteMax [(8,'a')] = [(8,'a')]; expected []


NeIntMapPairs ((6,'h') :| [])deleteMax [(6,'h')] = [(6,'h')]; expected []


NeIntMapPairs ((8,'s') :| [])deleteMax [(8,'s')] = [(8,'s')]; expected []


NeIntMapPairs ((1,'p') :| [])deleteMax [(1,'p')] = [(1,'p')]; expected []


NeIntMapPairs ((9,'u') :| [])deleteMax [(9,'u')] = [(9,'u')]; expected []


NeIntMapPairs ((0,'z') :| [])deleteMax [(0,'z')] = [(0,'z')]; expected []


NeIntMapPairs ((3,'p') :| [])deleteMax [(3,'p')] = [(3,'p')]; expected []


NeIntMapPairs ((3,'b') :| [])deleteMax [(3,'b')] = [(3,'b')]; expected []


NeIntMapPairs ((0,'a') :| []): deleteMax [(0,'a')] = [(0,'a')]; expected []


CounterExample ["NeIntMapPairs ((0,'a') :| [])"] (PropertyFalse Nothing)


NeSetElems (2 :| [])deleteMax [2] = [2]; expected []


NeSetElems (9 :| [])deleteMax [9] = [9]; expected []


NeSetElems (8 :| [])deleteMax [8] = [8]; expected []


NeSetElems (1 :| [])deleteMax [1] = [1]; expected []


NeSetElems (5 :| [])deleteMax [5] = [5]; expected []


NeSetElems (0 :| []): deleteMax [0] = [0]; expected []


CounterExample ["NeSetElems (0 :| [])"] (PropertyFalse Nothing)


NeIntSetElems (8 :| [])deleteMax [8] = [8]; expected []


NeIntSetElems (2 :| [])deleteMax [2] = [2]; expected []


NeIntSetElems (0 :| [])deleteMax [0] = [0]; expected []


NeIntSetElems (5 :| [])deleteMax [5] = [5]; expected []


NeIntSetElems (9 :| [])deleteMax [9] = [9]; expected []


NeIntSetElems (7 :| [])deleteMax [7] = [7]; expected []


NeIntSetElems (3 :| [])deleteMax [3] = [3]; expected []


NeIntSetElems (0 :| []): deleteMax [0] = [0]; expected []


CounterExample ["NeIntSetElems (0 :| [])"] (PropertyFalse Nothing)


NeSeqElems {neSeqElems = 20 :| [], neSeqSep = 22}intersperse 22 [20] has length 2; expected 1


NeSeqElems {neSeqElems = 45 :| [], neSeqSep = 21}intersperse 21 [45] has length 2; expected 1


NeSeqElems {neSeqElems = 26 :| [], neSeqSep = 69}intersperse 69 [26] has length 2; expected 1


NeSeqElems {neSeqElems = 28 :| [], neSeqSep = 61}intersperse 61 [28] has length 2; expected 1


NeSeqElems {neSeqElems = 98 :| [], neSeqSep = 63}intersperse 63 [98] has length 2; expected 1


NeSeqElems {neSeqElems = 44 :| [], neSeqSep = 71}intersperse 71 [44] has length 2; expected 1


NeSeqElems {neSeqElems = 48 :| [], neSeqSep = 5}intersperse 5 [48] has length 2; expected 1


NeSeqElems {neSeqElems = 26 :| [], neSeqSep = 72}intersperse 72 [26] has length 2; expected 1


NeSeqElems {neSeqElems = 44 :| [], neSeqSep = 95}intersperse 95 [44] has length 2; expected 1


NeSeqElems {neSeqElems = 39 :| [], neSeqSep = 76}intersperse 76 [39] has length 2; expected 1


NeSeqElems {neSeqElems = 0 :| [], neSeqSep = 0}: intersperse 0 [0] has length 2; expected 1


CounterExample ["NeSeqElems {neSeqElems = 0 :| [], neSeqSep = 0}"] (PropertyFalse Nothing)


CounterExample ["SplitArgs {splitPairs = (0,'a') :| [(1,'a'),(2,'a')]}"] (PropertyFalse Nothing)


SubmapArgs {submapA = (9,'r') :| [], submapB = (2,'p') :| []}isSubmapOfBy (==) m m == False for m = [(9,'r')]


SubmapArgs {submapA = (0,'a') :| [], submapB = (0,'a') :| []}: isSubmapOfBy (==) m m == False for m = [(0,'a')]


CounterExample ["SubmapArgs {submapA = (0,'a') :| [], submapB = (0,'a') :| []}"] (PropertyFalse Nothing)