anchor.diff:      NextKey = find_next_objects(Table, NKey, EndKey),
       find_deleted_objects(Table, NextKey, EndKey, Text, NewLimit, NewAcc).
   
  +-spec find_next_objects(binary(), atom() | binary(), binary()) -> atom() | binary().
   find_next_objects(_Table, '$end_of_table', _EndKey) -> '$end_of_table';
   find_next_objects(_Table, Key, EndKey) when Key > EndKey -> '$end_of_table';
   find_next_objects(Table, KeyBin, EndKey) ->
       find_next_objects(Table, binterm_to_term_key(KeyBin), KeyBin, EndKey).
   
  +-spec find_next_objects(binary(), list(), atom() | binary(), binary()) -> atom() | binary().
   find_next_objects(_Table, [_,_,_|_], KeyBin, _EndKey) ->
       KeyBin;
   find_next_objects(Table, [_,_] = Key, KeyBin, EndKey) ->
  
positive.code:         _ ->
              Acc
      end,
      NextKey = find_deleted_next(Table, imem_meta:next(Table, Key), EndKey, Len),
      find_deleted(Table, NextKey, EndKey, Text, true, Len, NewAcc);
  find_deleted(Table, Key, EndKey, Text, false, Len, Acc) ->
      NewAcc =  case imem_meta:read(Table, Key) of
          [#skvhHist{cvhist = [#skvhCL{nvalue = Value}| _]}] ->
              [LValue] = imem_index:vnf_lcase_ascii(Value),
  
negative.code:             hist_read(User, Channel, DecodedKeys)
      end.
  
  -spec hist_read_deleted(ddEntityId(), binary(), term()) -> binary().
  hist_read_deleted(User, Channel, DecodedKey) ->
  [#{cvhist := [#{ovalue := Value} |_]}] = hist_read(User, Channel, [DecodedKey]),
      Value.
  
  -spec hist_read_shallow(ddEntityId(), binary(), term(), boolean()) -> list().
  hist_read_shallow(User, Channel, Key, DelStatus) ->
      Len = length(Key) + 1,
      Results = imem_dal_skvh:search_deleted(User, Channel, <<>>, Key, Key ++ <<255>>, DelStatus),
      [R || {CKey, _} = R <- Results, length(CKey) == Len].
  
  -spec search_deleted_init(binary(), binary(), binary(), binary()) -> list().
  search_deleted_init(CKey1, CKey2, Text, Channel) ->
      Key1 = term_key_to_binterm(CKey1),
  