Add best effort mechanism to return non-expired randomkey in 128 tries

internal/eval/eval.go

@@ -5147,13 +5147,25 @@ func evalRANDOMKEY(args []string, store *dstore.Store) *EvalResponse {
 	}
 
 	if len(availKeys) > 0 {
-		randKeyIdx, err := rand.Int(rand.Reader, big.NewInt(int64(len(availKeys))))
-		if err != nil {
-			return &EvalResponse{Result: nil,
-				Error: errors.New(string(diceerrors.NewErrWithMessage("could not generate a random key seed")))}
-		}
+		maxIters := 128
+		for range maxIters {
+			randKeyIdx, err := rand.Int(rand.Reader, big.NewInt(int64(len(availKeys))))
+			if err != nil {
+				continue
+			}
 
-		return &EvalResponse{Result: availKeys[randKeyIdx.Uint64()], Error: nil}
+			randKey := availKeys[randKeyIdx.Uint64()]
+			keyObj := store.Get(randKey)
+			if keyObj == nil {
+				continue
+			}
+
+			currTimeMs := uint64(utils.GetCurrentTime().UnixMilli())
+			expireTimeMs, isExpirySet := dstore.GetExpiry(keyObj, store)
+			if (isExpirySet && expireTimeMs > currTimeMs) || !isExpirySet {
+				return &EvalResponse{Result: clientio.Encode(randKey, false), Error: nil}
+			}
+		}
 	}
 
 	return &EvalResponse{Result: clientio.RespNIL, Error: nil}

internal/eval/eval_test.go

@@ -1166,11 +1166,14 @@ func testEvalRANDOMKEY(t *testing.T, store *dstore.Store) {
 		results := make(map[string]int)
 		for i := 0; i < 10000; i++ {
 			result := evalRANDOMKEY([]string{}, store)
-			results[result.Result.(string)]++
+			if res, ok := result.Result.([]byte); ok {
+				results[string(res)]++
+			}
 		}
 
 		for key, _ := range data {
-			if results[key] == 0 {
+			returnedKey := clientio.Encode(key, false)
+			if results[string(returnedKey)] == 0 {
 				t.Errorf("key %s was never returned", key)
 			}
 		}