anchor.diff:  -spec generate_b_tree_from_number_ets(pos_integer(), pos_integer(), pos_integer(), atom(), pid()) -> b_trees:b_tree().
   
   generate_b_tree_from_number_ets(Order, Number, Width, StateTargetName, Pid) when Order > 3, Number >= 0 ->
  -    B_TREE = b_trees:set_parameter(b_trees:empty(Order), state, {ets:new(StateTargetName, [ordered_set, public, {heir, Pid, []}, {keypos, 1}]), fun persistance_by_ets/3, fun persistance_by_ets/3, fun persistance_by_ets/3}),
  +    B_TREE = b_trees:set_parameter(b_trees:empty(Order), state, {ets:new(StateTargetName, [ordered_set, public, {heir, Pid, []}, {keypos, 1}]), fun persistence_by_ets/3, fun persistence_by_ets/3, fun persistence_by_ets/3}),
   
       generate_b_tree_by_key_1(lists:seq(1, Number), [], Width, B_TREE).
   
  
positive.code:     generate_keys_till/2,
      iterate_next_b_tree/3,
      map_value_to_new/2,
      persistance_by_ets/3,
      prepare_template_asc/1,
      prepare_template_desc/1,
      take_largest_b_tree/3,
  
negative.code:             true = ets:insert(StateTarget, {SubtreesKey, Subtrees}),
              SubtreesKey
      end;
  persistence_by_ets(StateTarget, lookup, SubtreesKey) ->
      case is_list(SubtreesKey) of
          true ->
              SubtreesKey;
  