How is a min hash function implemented in java ?

See more:

Java

hash

I'm working on a java project where I have to find the similarity between 2 documents
using min hashing algorithm to compute the Jaccard coefficient . I'm new to the concept of hashing and for my project I have to use 100 hash functions .In my project it is
said that a text of words S is distributed in k values min(hi(w) , wE(S)} for i = 1..100
. How can min(hi(w)) be computed for i=1...100 ?
My hash function is computed below . It takes a pair of integers (a,b) as a function .
Thank you for your time .

What I have tried:

private IntegerPair hashFuncGen() 
	{		
		
        int a = rnd.nextInt(10000)+1; 
        int b = rnd.nextInt(10000)+1; 

		IntegerPair hashfunc = new IntegerPair(a,b);
		
		
		return hashfunc;
	}
	
	private  long hash(IntegerPair ip, int x) {
		
		double   L = 52.981;
		
		long  function = (long)(ip.getA()*x + ip.getB())%(long)L;
		
		
		return function;
	}