anchor.diff:      {reply, {ok, NewAcc}, State};
       
   handle_call(is_empty, _From, State) ->
  -    IsEmpty = mi_ift_server:term_count() == 0,
  -    {reply, IsEmpty, State};
  +    %% TODO - Address this. Check the current buffer and the offset
  +    %% files.
  +    {reply, false, State};
   
   handle_call(drop, _From, State) ->
       #state { buffers=Buffers, segments=Segments } = State,
  
positive.code:     GroupIterator = build_iterator_tree(BufferIterators ++ SegmentIterators),
  
      %% Start streaming...
      stream_inner(F, undefined, undefined, undefined, undefined, GroupIterator()),
      ok.
  stream_inner(F, LastIndex, LastField, LastTerm, LastValue, {{Index, Field, Term, Value, Props, TS}, Iter}) ->
      %% Check in reverse order, more efficient.
      IsDuplicate = (LastValue == Value) andalso (LastTerm == Term) andalso (LastField == Field) andalso (LastIndex == Index),
      IsDeleted = (Props == undefined),
      case (not IsDuplicate) andalso (not IsDeleted) of
          true  -> 
              F(Index, Field, Term, Value, Props, TS);
          false -> 
              skip
      end,
      stream_inner(F, Index, Field, Term, Value, Iter());
  stream_inner(_, _, _, _, _, eof) -> ok.
  
  %% Chain a list of iterators into what looks like one single iterator.
  build_iterator_tree(Iterators) ->
  
negative.code:     scheduled_compaction,
      is_compacting
  }).
  
  -define(RESULTVEC_SIZE, 1000).
  
  init([Root]) ->
      %% Load from disk...
  