Function frank::rank_dense_greater

pub fn rank_dense_greater<T: PartialOrd + Clone>(vector: &[T]) -> Vec<usize>

rank_dense_greater(&generictea) returns dense ranks where large values get smaller ranks, and small values get larger ranks. Dense Ranks Explained: If three javelin throwers win in a tie should they be awarded three third place metals and no first place metals, or three first places? And would the second place and third place metals get be awarded to other competitors? If scored with dense ranks, the answer is yes there are three first places, and yes there is a second and third place rank, no ranks get skipped. Uneven steps between clusters can hatch data illusions, and dense ranks always have predictable steps. That said, dense ranks do lose cluster size information.