qlat_utils.sjackknife

qlat_utils.sjackknife(data_list, jk_idx_list, *, avg=None, is_hash_jk_idx=True, jk_idx_hash_size=None, rng_state=None, all_jk_idx=None, get_all_jk_idx=None, jk_blocking_func=None, eps=1)[source]

Super jackknife. Return jk_arr. len(jk_idx_list) == len(data_list) len(jk_arr) == len(all_jk_idx) jk_idx_list (after processed by jk_blocking_func) should be contained in all_jk_idx, otherwise, if is_hash_jk_idx is true, then, a hash of jk_idx will be used instead. Ideally, all_jk_idx should only contain distinct indices. However, if there are repeatations, indices appear later take precedence. if all_jk_idx and get_all_jk_idx are both None, then a trivial all_jk_idx will be created based on jk_idx_hash_size.