anchor.diff:  deleteGTLT(Cmd, {TN,AN}, Key1, Key2) ->
   	MatchHead = {skvhTable, '$1', '$2', '$3'},
   	MatchFunction = {MatchHead, [{'>', '$1', Key1}, {'<', '$1', Key2}], ['$1']},
  -	{L,true} = imem_dal:select(TN, [MatchFunction]),
  +	{L,true} = imem_meta:select(TN, [MatchFunction]),
   	delete(Cmd, {TN,AN}, L, []).
   
   debug(Cmd, Resp) ->
  
positive.code:         ?assertEqual({ok,[<<"[1,a]",9,"undefined">>]}, read(Channel, <<"[1,a]">>)),
          ?assertEqual({ok,[<<"[1,b]",9,"undefined">>]}, read(Channel, <<"[1,b]">>)),
          ?assertEqual({ok,[<<"[1,c]",9,"undefined">>]}, read(Channel, <<"[1,c]">>)),
  
  
          ?assertEqual(ok, imem_meta:drop_table(skvhTEST)),
  
negative.code: 
  -export([ write/2 					%% (Channel, KVTable)    			' resource may not exist
  		, read/2					%% (Channel, KeyTable)   			' return empty Arraylist if none of these resources exists
  		, readGELT/4				%% (Channel, Item, CKey1, CKey2)	  start with first key after CKey1, end with last key before CKey2
   		, readGT/4					%% (Channel, Item, CKey1, Limit)	' start with first key after CKey1, return Limit results or less
   		, delete/2					%% (Channel, KeyTable)    			' do not complain if keys do not exist
   		, deleteGELT/3				%% (Channel, CKey1, CKey2)			
  