Remove all the elements in the sorted set at key with a score between min and max (including
elements with score equal to min or max).
<p>
<b>Time complexity:</b>
<p>
O(log(N))+O(M) with N being the number of elements in the sorted set and M the number of
elements removed by the operation
@param key
@param min
@param max
@return Integer reply, specifically the number of elements removed.
Remove all the elements in the sorted set at key with a score between min and max (including elements with score equal to min or max). <p> <b>Time complexity:</b> <p> O(log(N))+O(M) with N being the number of elements in the sorted set and M the number of elements removed by the operation @param key @param min @param max @return Integer reply, specifically the number of elements removed.