#!/usr/bin/env python3
# Source: t6-practitioner-toolkit.html
import numpy as np

def dcg_at_k(rels, k):
    rels = np.asarray(rels, dtype=float)[:k]
    # gain 2^rel - 1 rewards high grades more; log2(rank+1) discount
    return np.sum((2 ** rels - 1) / np.log2(np.arange(2, len(rels) + 2)))

def ndcg_at_k(rels_in_model_order, k):
    ideal = sorted(rels_in_model_order, reverse=True)
    idcg = dcg_at_k(ideal, k)
    return dcg_at_k(rels_in_model_order, k) / idcg if idcg > 0 else 0.0

def mrr(list_of_binary_rels):
    out = []
    for rels in list_of_binary_rels:
        hits = np.flatnonzero(rels)
        out.append(1.0 / (hits[0] + 1) if len(hits) else 0.0)
    return float(np.mean(out))

print(round(ndcg_at_k([3, 2, 0, 1], k=4), 3))   # 0.993
print(mrr([[0, 1, 0], [1, 0, 0], [0, 0, 0]]))   # 0.5
