Integer hash

intgash.go

import "sort"


/*
Generates n unique numbers mod m. v is used as deterministic source.
*/
func Inthash(v, n, m int) []int {
	if n>m { panic("less unique numbers than slots") }
	r := make([]int,n)
	for i := range r {
		r[i] = v%m
		v/=m
		m--
	}
	for i := range r {
		cv := r[i]
		for j := i+1 ; j<n ; j++ {
			if r[j]==cv { r[j]++ }
		}
	}
	sort.Ints(r)
	return r
}