Improve the implementation of SRANDMEMBER

[PragmaTwice]

Search before asking

• I had searched in the issues and found no similar issues.

Motivation

Currently it just returns the first N members, which is not actually random.

We can improve it just like the implementation of HRANDMEMBER.
(Or if you have better ideas for random, feel free to implement them)

Solution

No response

Are you willing to submit a PR?

• I'm willing to submit a PR!

[wsehjk]

hello could you please assign this to. Interested in this problem

[git-hulk]

@wsehjk assigned, thank you!

[wsehjk]

Thanks, I'm newbie to this project. Does this project have any community where developers can communicate?

[git-hulk]

Yes, you can join the WeChat group via the official account at the bottom of README if you're using WeChat. Or you can join the Slack channel which is also mentioned in README.

[wsehjk]

Hi, here is a question. If the number of member (k) is less than the count we want to select, under the context of random, does it ok to generate results less than k?

[mapleFU]

@wsehjk https://github.com/apache/kvrocks/pull/1565/files this is a example for our current impl

[wsehjk]

@wsehjk https://github.com/apache/kvrocks/pull/1565/files this is a example for our current impl

thanks, i will take a look at this. And i'm gonna try Reservoir Sampling