Pseudo-random permutation using 128 bit seed

I'm looking for a couple of functions that permute the index of a vector in an efficient way by seeding with 128-bit key. Optimization is critical for me since i'm doing the same operation multiple times.

Can anyone suggest a C/C++ open-source library in which 128 bit seeding is available and it supports a function like permute(seed, range(min,max),sample_size)?

For example; if permute(1, [0,10], 10) function gives the result as: 3 6 7 2 4 9 8 1 0 5, then permute(1, [0,10], 5) should give 3 6 7 2 4.

min, max and sample_size parameters are dynamic variables. It changes at each iteration.