mirror of
https://github.com/EchoVault/SugarDB.git
synced 2025-10-05 16:06:57 +08:00
Implemented unit tes for ZUNIONSTORE command handler
This commit is contained in:
@@ -1590,7 +1590,6 @@ func Test_HandleZINTERSTORE(t *testing.T) {
|
||||
mockServer.KeyRUnlock(test.destination)
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
func Test_HandleZMPOP(t *testing.T) {}
|
||||
@@ -1940,4 +1939,388 @@ func Test_HandleZUNION(t *testing.T) {
|
||||
}
|
||||
}
|
||||
|
||||
func Test_HandleZUNIONSTORE(t *testing.T) {}
|
||||
func Test_HandleZUNIONSTORE(t *testing.T) {
|
||||
mockServer := server.NewServer(server.Opts{})
|
||||
|
||||
tests := []struct {
|
||||
preset bool
|
||||
presetValues map[string]interface{}
|
||||
destination string
|
||||
command []string
|
||||
expectedValue *SortedSet
|
||||
expectedResponse int
|
||||
expectedError error
|
||||
}{
|
||||
{ // 1. Get the union between 2 sorted sets.
|
||||
preset: true,
|
||||
presetValues: map[string]interface{}{
|
||||
"key1": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
{value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5},
|
||||
}),
|
||||
"key2": NewSortedSet([]MemberParam{
|
||||
{value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6},
|
||||
{value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
}),
|
||||
},
|
||||
destination: "destination1",
|
||||
command: []string{"ZUNIONSTORE", "destination1", "key1", "key2"},
|
||||
expectedValue: NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
{value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6},
|
||||
{value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
}),
|
||||
expectedResponse: 8,
|
||||
expectedError: nil,
|
||||
},
|
||||
{
|
||||
// 2. Get the union between 3 sorted sets with scores.
|
||||
// By default, the SUM aggregate will be used.
|
||||
preset: true,
|
||||
presetValues: map[string]interface{}{
|
||||
"key3": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
{value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6},
|
||||
{value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
}),
|
||||
"key4": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
{value: "thirty-six", score: 36}, {value: "twelve", score: 12},
|
||||
{value: "eleven", score: 11}, {value: "eight", score: 8},
|
||||
}),
|
||||
"key5": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "eight", score: 8},
|
||||
{value: "nine", score: 9}, {value: "ten", score: 10},
|
||||
{value: "twelve", score: 12}, {value: "thirty-six", score: 36},
|
||||
}),
|
||||
},
|
||||
destination: "destination2",
|
||||
command: []string{"ZUNIONSTORE", "destination2", "key3", "key4", "key5", "WITHSCORES"},
|
||||
expectedValue: NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 3}, {value: "two", score: 4}, {value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6}, {value: "seven", score: 7}, {value: "eight", score: 24},
|
||||
{value: "nine", score: 9}, {value: "ten", score: 10}, {value: "eleven", score: 11},
|
||||
{value: "twelve", score: 24}, {value: "thirty-six", score: 72},
|
||||
}),
|
||||
expectedResponse: 13,
|
||||
expectedError: nil,
|
||||
},
|
||||
{
|
||||
// 3. Get the union between 3 sorted sets with scores.
|
||||
// Use MIN aggregate.
|
||||
preset: true,
|
||||
presetValues: map[string]interface{}{
|
||||
"key6": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 100}, {value: "two", score: 2},
|
||||
{value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6},
|
||||
{value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
}),
|
||||
"key7": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
{value: "thirty-six", score: 36}, {value: "twelve", score: 12},
|
||||
{value: "eleven", score: 11}, {value: "eight", score: 80},
|
||||
}),
|
||||
"key8": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1000}, {value: "eight", score: 800},
|
||||
{value: "nine", score: 9}, {value: "ten", score: 10},
|
||||
{value: "twelve", score: 12}, {value: "thirty-six", score: 72},
|
||||
}),
|
||||
},
|
||||
destination: "destination3",
|
||||
command: []string{"ZUNIONSTORE", "destination3", "key6", "key7", "key8", "WITHSCORES", "AGGREGATE", "MIN"},
|
||||
expectedValue: NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2}, {value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6}, {value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
{value: "nine", score: 9}, {value: "ten", score: 10}, {value: "eleven", score: 11},
|
||||
{value: "twelve", score: 12}, {value: "thirty-six", score: 36},
|
||||
}),
|
||||
expectedResponse: 13,
|
||||
expectedError: nil,
|
||||
},
|
||||
{
|
||||
// 4. Get the union between 3 sorted sets with scores.
|
||||
// Use MAX aggregate.
|
||||
preset: true,
|
||||
presetValues: map[string]interface{}{
|
||||
"key9": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 100}, {value: "two", score: 2},
|
||||
{value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6},
|
||||
{value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
}),
|
||||
"key10": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
{value: "thirty-six", score: 36}, {value: "twelve", score: 12},
|
||||
{value: "eleven", score: 11}, {value: "eight", score: 80},
|
||||
}),
|
||||
"key11": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1000}, {value: "eight", score: 800},
|
||||
{value: "nine", score: 9}, {value: "ten", score: 10},
|
||||
{value: "twelve", score: 12}, {value: "thirty-six", score: 72},
|
||||
}),
|
||||
},
|
||||
destination: "destination4",
|
||||
command: []string{
|
||||
"ZUNIONSTORE", "destination4", "key9", "key10", "key11", "WITHSCORES", "AGGREGATE", "MAX",
|
||||
},
|
||||
expectedValue: NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1000}, {value: "two", score: 2}, {value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6}, {value: "seven", score: 7}, {value: "eight", score: 800},
|
||||
{value: "nine", score: 9}, {value: "ten", score: 10}, {value: "eleven", score: 11},
|
||||
{value: "twelve", score: 12}, {value: "thirty-six", score: 72},
|
||||
}),
|
||||
expectedResponse: 13,
|
||||
expectedError: nil,
|
||||
},
|
||||
{
|
||||
// 5. Get the union between 3 sorted sets with scores.
|
||||
// Use SUM aggregate with weights modifier.
|
||||
preset: true,
|
||||
presetValues: map[string]interface{}{
|
||||
"key12": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 100}, {value: "two", score: 2},
|
||||
{value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6},
|
||||
{value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
}),
|
||||
"key13": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
{value: "thirty-six", score: 36}, {value: "twelve", score: 12},
|
||||
{value: "eleven", score: 11}, {value: "eight", score: 80},
|
||||
}),
|
||||
"key14": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1000}, {value: "eight", score: 800},
|
||||
{value: "nine", score: 9}, {value: "ten", score: 10},
|
||||
{value: "twelve", score: 12},
|
||||
}),
|
||||
},
|
||||
destination: "destination5",
|
||||
command: []string{
|
||||
"ZUNIONSTORE", "destination5", "key12", "key13", "key14",
|
||||
"WITHSCORES", "AGGREGATE", "SUM", "WEIGHTS", "1", "2", "3",
|
||||
},
|
||||
expectedValue: NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 3102}, {value: "two", score: 6}, {value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6}, {value: "seven", score: 7}, {value: "eight", score: 2568},
|
||||
{value: "nine", score: 27}, {value: "ten", score: 30}, {value: "eleven", score: 22},
|
||||
{value: "twelve", score: 60}, {value: "thirty-six", score: 72},
|
||||
}),
|
||||
expectedResponse: 13,
|
||||
expectedError: nil,
|
||||
},
|
||||
{
|
||||
// 6. Get the union between 3 sorted sets with scores.
|
||||
// Use MAX aggregate with added weights.
|
||||
preset: true,
|
||||
presetValues: map[string]interface{}{
|
||||
"key15": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 100}, {value: "two", score: 2},
|
||||
{value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6},
|
||||
{value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
}),
|
||||
"key16": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
{value: "thirty-six", score: 36}, {value: "twelve", score: 12},
|
||||
{value: "eleven", score: 11}, {value: "eight", score: 80},
|
||||
}),
|
||||
"key17": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1000}, {value: "eight", score: 800},
|
||||
{value: "nine", score: 9}, {value: "ten", score: 10},
|
||||
{value: "twelve", score: 12},
|
||||
}),
|
||||
},
|
||||
destination: "destination6",
|
||||
command: []string{
|
||||
"ZUNIONSTORE", "destination6", "key15", "key16", "key17",
|
||||
"WITHSCORES", "AGGREGATE", "MAX", "WEIGHTS", "1", "2", "3"},
|
||||
expectedValue: NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 3000}, {value: "two", score: 4}, {value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6}, {value: "seven", score: 7}, {value: "eight", score: 2400},
|
||||
{value: "nine", score: 27}, {value: "ten", score: 30}, {value: "eleven", score: 22},
|
||||
{value: "twelve", score: 36}, {value: "thirty-six", score: 72},
|
||||
}),
|
||||
expectedResponse: 13,
|
||||
expectedError: nil,
|
||||
},
|
||||
{
|
||||
// 7. Get the union between 3 sorted sets with scores.
|
||||
// Use MIN aggregate with added weights.
|
||||
preset: true,
|
||||
presetValues: map[string]interface{}{
|
||||
"key18": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 100}, {value: "two", score: 2},
|
||||
{value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6},
|
||||
{value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
}),
|
||||
"key19": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
{value: "thirty-six", score: 36}, {value: "twelve", score: 12},
|
||||
{value: "eleven", score: 11}, {value: "eight", score: 80},
|
||||
}),
|
||||
"key20": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1000}, {value: "eight", score: 800},
|
||||
{value: "nine", score: 9}, {value: "ten", score: 10},
|
||||
{value: "twelve", score: 12},
|
||||
}),
|
||||
},
|
||||
destination: "destination7",
|
||||
command: []string{
|
||||
"ZUNIONSTORE", "destination7", "key18", "key19", "key20",
|
||||
"WITHSCORES", "AGGREGATE", "MIN", "WEIGHTS", "1", "2", "3",
|
||||
},
|
||||
expectedValue: NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 2}, {value: "two", score: 2}, {value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6}, {value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
{value: "nine", score: 27}, {value: "ten", score: 30}, {value: "eleven", score: 22},
|
||||
{value: "twelve", score: 24}, {value: "thirty-six", score: 72},
|
||||
}),
|
||||
expectedResponse: 13,
|
||||
expectedError: nil,
|
||||
},
|
||||
{ // 8. Throw an error if there are more weights than keys
|
||||
preset: true,
|
||||
presetValues: map[string]interface{}{
|
||||
"key21": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
{value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6},
|
||||
{value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
}),
|
||||
"key22": NewSortedSet([]MemberParam{{value: "one", score: 1}}),
|
||||
},
|
||||
destination: "destination8",
|
||||
command: []string{"ZUNIONSTORE", "destination8", "key21", "key22", "WEIGHTS", "1", "2", "3"},
|
||||
expectedResponse: 0,
|
||||
expectedError: errors.New("number of weights should match number of keys"),
|
||||
},
|
||||
{ // 9. Throw an error if there are fewer weights than keys
|
||||
preset: true,
|
||||
presetValues: map[string]interface{}{
|
||||
"key23": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
{value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6},
|
||||
{value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
}),
|
||||
"key24": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
}),
|
||||
"key25": NewSortedSet([]MemberParam{{value: "one", score: 1}}),
|
||||
},
|
||||
destination: "destination9",
|
||||
command: []string{"ZUNIONSTORE", "destination9", "key23", "key24", "key25", "WEIGHTS", "5", "4"},
|
||||
expectedResponse: 0,
|
||||
expectedError: errors.New("number of weights should match number of keys"),
|
||||
},
|
||||
{ // 10. Throw an error if there are no keys provided
|
||||
preset: true,
|
||||
presetValues: map[string]interface{}{
|
||||
"key26": NewSortedSet([]MemberParam{{value: "one", score: 1}}),
|
||||
"key27": NewSortedSet([]MemberParam{{value: "one", score: 1}}),
|
||||
"key28": NewSortedSet([]MemberParam{{value: "one", score: 1}}),
|
||||
},
|
||||
command: []string{"ZUNIONSTORE", "WEIGHTS", "5", "4"},
|
||||
expectedResponse: 0,
|
||||
expectedError: errors.New(utils.WRONG_ARGS_RESPONSE),
|
||||
},
|
||||
{ // 11. Throw an error if any of the provided keys are not sorted sets
|
||||
preset: true,
|
||||
presetValues: map[string]interface{}{
|
||||
"key29": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
{value: "three", score: 3}, {value: "four", score: 4},
|
||||
{value: "five", score: 5}, {value: "six", score: 6},
|
||||
{value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
}),
|
||||
"key30": "Default value",
|
||||
"key31": NewSortedSet([]MemberParam{{value: "one", score: 1}}),
|
||||
},
|
||||
destination: "destination11",
|
||||
command: []string{"ZUNIONSTORE", "destination11", "key29", "key30", "key31"},
|
||||
expectedResponse: 0,
|
||||
expectedError: errors.New("value at key30 is not a sorted set"),
|
||||
},
|
||||
{ // 12. If any of the keys does not exist, skip it.
|
||||
preset: true,
|
||||
presetValues: map[string]interface{}{
|
||||
"key32": NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2},
|
||||
{value: "thirty-six", score: 36}, {value: "twelve", score: 12},
|
||||
{value: "eleven", score: 11},
|
||||
}),
|
||||
"key33": NewSortedSet([]MemberParam{
|
||||
{value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
{value: "nine", score: 9}, {value: "ten", score: 10},
|
||||
{value: "twelve", score: 12},
|
||||
}),
|
||||
},
|
||||
destination: "destination12",
|
||||
command: []string{"ZUNIONSTORE", "destination12", "non-existent", "key32", "key33"},
|
||||
expectedValue: NewSortedSet([]MemberParam{
|
||||
{value: "one", score: 1}, {value: "two", score: 2}, {value: "seven", score: 7}, {value: "eight", score: 8},
|
||||
{value: "nine", score: 9}, {value: "ten", score: 10}, {value: "eleven", score: 11}, {value: "twelve", score: 12},
|
||||
{value: "thirty-six", score: 36},
|
||||
}),
|
||||
expectedResponse: 9,
|
||||
expectedError: nil,
|
||||
},
|
||||
{ // 13. Command too short
|
||||
preset: false,
|
||||
command: []string{"ZUNIONSTORE"},
|
||||
expectedResponse: 0,
|
||||
expectedError: errors.New(utils.WRONG_ARGS_RESPONSE),
|
||||
},
|
||||
}
|
||||
|
||||
for _, test := range tests {
|
||||
if test.preset {
|
||||
for key, value := range test.presetValues {
|
||||
if _, err := mockServer.CreateKeyAndLock(context.Background(), key); err != nil {
|
||||
t.Error(err)
|
||||
}
|
||||
mockServer.SetValue(context.Background(), key, value)
|
||||
mockServer.KeyUnlock(key)
|
||||
}
|
||||
}
|
||||
res, err := handleZUNIONSTORE(context.Background(), test.command, mockServer, nil)
|
||||
if test.expectedError != nil {
|
||||
if err.Error() != test.expectedError.Error() {
|
||||
t.Errorf("expected error \"%s\", got \"%s\"", test.expectedError.Error(), err.Error())
|
||||
}
|
||||
continue
|
||||
}
|
||||
if err != nil {
|
||||
t.Error(err)
|
||||
}
|
||||
rd := resp.NewReader(bytes.NewBuffer(res))
|
||||
rv, _, err := rd.ReadValue()
|
||||
if err != nil {
|
||||
t.Error(err)
|
||||
}
|
||||
if rv.Integer() != test.expectedResponse {
|
||||
t.Errorf("expected response integer %d, got %d", test.expectedResponse, rv.Integer())
|
||||
}
|
||||
if test.expectedValue != nil {
|
||||
if _, err = mockServer.KeyRLock(context.Background(), test.destination); err != nil {
|
||||
t.Error(err)
|
||||
}
|
||||
set, ok := mockServer.GetValue(test.destination).(*SortedSet)
|
||||
if !ok {
|
||||
t.Errorf("expected vaule at key %s to be set, got another type", test.destination)
|
||||
}
|
||||
for _, elem := range set.GetAll() {
|
||||
if !test.expectedValue.Contains(elem.value) {
|
||||
t.Errorf("could not find element %s in the expected values", elem.value)
|
||||
}
|
||||
}
|
||||
mockServer.KeyRUnlock(test.destination)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user