anchor.diff:  
   %% @doc Push a term to the queue. This function has a constant-time complexity.
   push(Mem, Term) ->
  -  Bin = term_to_binary(Term),
  +  push(Mem, Term, 0).
  +
  +%% @doc Push a term to the queue. This function has a constant-time complexity.
  +%% `Compression' is the compression level from `0' to `9', where `0' is no compression.
  +push(Mem, Term, Compression) when is_integer(Compression), Compression >= 0, Compression < 10 ->
  +  Bin = term_to_binary(Term, [{compressed, 0}, {minor_version, 2}]),
     Sz0 = byte_size(Bin)+8,
     Pad = Sz0 rem 8,
     Sz  = Sz0 + Pad,
  
positive.code: %%%-----------------------------------------------------------------------------
  -module(emmap_queue).
  -export([open/3, close/1, flush/1]).
  -export([purge/1, is_empty/1, length/1, push/2,
           pop/1, pop/3, peek_front/1, peek_back/1, peek/3, rpeek/3, try_pop/2,
           pop_and_purge/1, try_pop_and_purge/2]).
  
  
negative.code: 
    ?assertEqual([a,b,c,1,2,3], lists:reverse(peek(Mem, [], fun(I,S) -> {cont, [I | S]} end))),
  
    ?assertEqual({16,106,106,1024}, header(Mem)),
    ?assertEqual(6, length(Mem)),
  
    % Dequeue data
  