for (let i = indices[h], j = indices[h + 1]; i < j; i++) {
                    if (neighborhood.includesPosition(keyFn(items[entries[i]])))
                        return true;
                }