anchor.diff:  build_delta_recovery_buckets_loop(MappedConfigs, DeltaRecoveryBuckets, Acc) ->
       [{Bucket, BucketConfig, RecoverResult0} | RestMapped] = MappedConfigs,
   
  -    NeedBucket = case DeltaRecoveryBuckets of
  -                     all -> true;
  -                     _List -> lists:member(Bucket, DeltaRecoveryBuckets)
  -                 end,
  +    NeedBucket = lists:member(Bucket, DeltaRecoveryBuckets),
       RecoverResult = case NeedBucket of
                           true ->
                               RecoverResult0;
  
positive.code:             find_delta_recovery_map_loop(Rest, Config, Bucket, Options, DeltaNodes)
      end.
  
  build_delta_recovery_buckets(_AllNodes, [] = _DeltaNodes, _AllBucketConfigs, _DeltaRecoveryBuckets) ->
      {ok, []};
  build_delta_recovery_buckets(AllNodes, DeltaNodes, AllBucketConfigs, DeltaRecoveryBuckets) ->
      Config = ns_config:get(),
  
      %% such non-lazy computation of recovery map is suboptimal, but
      %% it's not that big deal suboptimal. I'm doing it for better
  
negative.code:                       BucketConfig,
                        find_delta_recovery_map(Config, AllNodes, DeltaNodes,
                                                Bucket, BucketConfig)}
                       || {Bucket, BucketConfig} <- MembaseBuckets],
  
      case build_delta_recovery_buckets_loop(MappedConfigs, DeltaRecoveryBuckets, []) of
          {ok, Recovered0} ->
  