anchor.diff:      %% Entries should be unique
       SortFun = fun(A, B) -> (element(1, A) < element(1, B)) orelse
                              (element(1, A) ?EQ element(1, B)) end,
  -    lists:usort(SortFun, [Entry || Entry <- Data]).
  +    lists:usort(SortFun, Data).
   
   check_db(DB, ExpData, Note) ->
       InDb = ?TEST_DB:foldl(DB, fun(E, AIn) -> [E | AIn] end, []),
  
positive.code:                             [],
                              Interval,
                              MaxNum),
      ?equals_w_note(lists:sort(ScrubbedData), lists:sort(AllFold), "test_foldl1"),
      ?equals_w_note(lists:sort(ExpInInterval), lists:sort(IntervalFold), "test_foldl2"),
      ?equals_w_note(lists:sort(ExpInIntervalCounted),
                     lists:sort(IntervalCountFold), "test_foldl3"),
      ?TEST_DB:close(DB1),
      true.
  
  
negative.code:                             MaxNum),
      %% ct:pal("ExpInInterval: ~p~nIntervalFold: ~p~nInterval: ~p~n", [ExpInInterval,
      %%                                                  IntervalFold, Interval]),
      ?equals_w_note(ScrubbedData, AllFold, "test_foldr1"),
      ?equals_w_note(ExpInInterval, IntervalFold, "test_foldr2"),
      ?equals_w_note(ExpInIntervalCounted, IntervalCountFold, "test_foldr3"),
      ?TEST_DB:close(DB1),
      true.
  
  