#!/usr/bin/env python3
# Source: t2-statistics.html
def benjamini_hochberg(pvals, q=0.05):
    m = len(pvals)
    order = sorted(range(m), key=lambda i: pvals[i])
    cutoff = 0
    for rank, i in enumerate(order, start=1):
        if pvals[i] <= rank * q / m:
            cutoff = rank          # largest rank that passes
    return sorted(order[:cutoff])

def holm(pvals, alpha=0.05):
    m = len(pvals)
    order = sorted(range(m), key=lambda i: pvals[i])
    keep = []
    for rank, i in enumerate(order):
        if pvals[i] > alpha / (m - rank):
            break                  # stop at first failure
        keep.append(i)
    return sorted(keep)

p = [0.001, 0.008, 0.012, 0.030, 0.041, 0.20, 0.45, 0.62, 0.77, 0.91]
print("Bonferroni:", [i for i, x in enumerate(p) if x <= 0.05 / len(p)])
print("Holm:      ", holm(p))
print("BH:        ", benjamini_hochberg(p))
