anchor.diff:    %% Stop the consumer of the lifo queue so we can test it hangs around
     %% when a normal remove is done
     ?assertEqual(ok, valvex_queue:stop_consumer(valvex_queue_lifo_backend, KeyLifo)),
  -  ?assertEqual(ok, do_until(LifoConFun, false, 30)),
  +  ?assertEqual(ok, do_until(LifoConFun, false, 999999)),
     ?assertEqual(ok, valvex:push(Valvex, KeyLifo, RawLifoFun)),
  -  ?assertEqual(ok, do_until(LifoSizeFun, 1, 30)),
  +  ?assertEqual(ok, do_until(LifoSizeFun, 1, 999999)),
     ?assertEqual(ok, valvex:remove(Valvex, KeyLifo)),
     ?assertEqual(true, valvex_queue:is_tombstoned(valvex_queue_lifo_backend, KeyLifo)),
     ?assertEqual(ok, valvex_queue:start_consumer(valvex_queue_lifo_backend, KeyLifo)),
  -  ?assertEqual(ok, do_until(LifoConFun, true, 30)),
  -  ?assertEqual(ok, do_until(LifoSizeFun, 0, 1000)),
  -  ?assertEqual(ok, do_until(RawLifoFun, {error, key_not_found}, 1000)),
  +  ?assertEqual(ok, do_until(LifoConFun, true, 999999)),
  +  ?assertEqual(ok, do_until(LifoSizeFun, 0, 999999)),
  +  ?assertEqual(ok, do_until(RawLifoFun, {error, key_not_found}, 999999)),
     %% Stop the consumer of the fifo queue so we can test locking
     ?assertEqual(ok, valvex_queue:stop_consumer(valvex_queue_fifo_backend, KeyFifo)),
  -  ?assertEqual(ok, do_until(FifoConFun, false, 30)),
  +  ?assertEqual(ok, do_until(FifoConFun, false, 9999999)),
     ?assertEqual(ok, valvex:push(Valvex, KeyFifo, RawFifoFun)),
  -  ?assertEqual(ok, do_until(FifoSizeFun, 1, 30)),
  +  ?assertEqual(ok, do_until(FifoSizeFun, 1, 9999999)),
     ?assertEqual(ok, valvex:remove(Valvex, KeyFifo, lock_queue)),
     ?assert(valvex_queue:is_locked(valvex_queue_fifo_backend, KeyFifo)),
     %% Push work to the PBTest queue so we can be sure force remove doesn't care
     ?assertEqual(ok, valvex_queue:stop_consumer(valvex_queue_fifo_backend, KeyPBTest)),
  -  ?assertEqual(ok, do_until(PBTestConFun, false, 30)),
  +  ?assertEqual(ok, do_until(PBTestConFun, false, 999999)),
     ?assertEqual(ok, valvex:push(Valvex, KeyPBTest, RawPBTestFun)),
  -  ?assertEqual(ok, do_until(FifoSizeFun, 1, 30)),
  +  ?assertEqual(ok, do_until(FifoSizeFun, 1, 9999999)),
     ?assertEqual(ok, valvex:remove(Valvex, KeyPBTest, force_remove)),
  -  ?assertEqual(ok, do_until(RawPBTestFun, {error, key_not_found}, 1000)).
  +  ?assertEqual(ok, do_until(RawPBTestFun, {error, key_not_found}, 999999)).
   
   test_tombstone(suite)                         -> [];
   test_tombstone({init, Config})                -> Config;
  
positive.code:   ?assertEqual(ok, valvex:push(Valvex, KeyLifo, SecondWorkFun)),
    ?assertEqual(ok, valvex:push(Valvex, KeyFifo, FirstWorkFun)),
    ?assertEqual(ok, valvex:push(Valvex, KeyFifo, SecondWorkFun)),
    ?assertEqual(ok, do_until(LifoSizeFun, 2, 30)),
    ?assertEqual(ok, do_until(FifoSizeFun, 2, 30)),
    %% Pop queues and check correct order
    ?assertMatch({{value, {SecondWorkFun, _}}, _}, valvex_queue:pop(valvex_queue_lifo_backend, KeyLifo)),
    ?assertMatch({{value, {FirstWorkFun, _}}, _}, valvex_queue:pop(valvex_queue_lifo_backend, KeyLifo)),
  
negative.code:   ?assertEqual(ok, valvex:push(Valvex, KeyLifo, SecondWorkFun)),
    ?assertEqual(ok, valvex:push(Valvex, KeyFifo, FirstWorkFun)),
    ?assertEqual(ok, valvex:push(Valvex, KeyFifo, SecondWorkFun)),
    ?assertEqual(ok, do_until(LifoSizeFun, 2, 999999)),
    ?assertEqual(ok, do_until(FifoSizeFun, 2, 999999)),
    %% Pop queues and check correct order
    ?assertMatch({{value, {FirstWorkFun, _}}, _}, valvex_queue:pop_r(valvex_queue_lifo_backend, KeyLifo)),
    ?assertMatch({{value, {SecondWorkFun, _}}, _}, valvex_queue:pop_r(valvex_queue_lifo_backend, KeyLifo)),
  