2020-01-03 10:13:16 +08:00
|
|
|
// Copyright 2020 Kentaro Hibino. All rights reserved.
|
|
|
|
// Use of this source code is governed by a MIT license
|
|
|
|
// that can be found in the LICENSE file.
|
|
|
|
|
2019-11-30 09:40:31 +08:00
|
|
|
package asynq
|
|
|
|
|
|
|
|
import (
|
|
|
|
"testing"
|
|
|
|
"time"
|
2019-12-21 23:42:32 +08:00
|
|
|
|
|
|
|
"github.com/google/go-cmp/cmp"
|
2019-12-30 01:41:00 +08:00
|
|
|
h "github.com/hibiken/asynq/internal/asynqtest"
|
2019-12-22 23:15:45 +08:00
|
|
|
"github.com/hibiken/asynq/internal/base"
|
2019-11-30 09:40:31 +08:00
|
|
|
)
|
|
|
|
|
|
|
|
func TestClient(t *testing.T) {
|
|
|
|
r := setup(t)
|
2019-12-30 05:42:49 +08:00
|
|
|
client := NewClient(r)
|
2019-11-30 09:40:31 +08:00
|
|
|
|
2020-01-05 05:13:46 +08:00
|
|
|
task := NewTask("send_email", map[string]interface{}{"to": "customer@gmail.com", "from": "merchant@example.com"})
|
2019-12-21 23:42:32 +08:00
|
|
|
|
2019-11-30 09:40:31 +08:00
|
|
|
tests := []struct {
|
2019-12-21 23:42:32 +08:00
|
|
|
desc string
|
|
|
|
task *Task
|
|
|
|
processAt time.Time
|
|
|
|
opts []Option
|
2020-01-06 22:53:40 +08:00
|
|
|
wantEnqueued map[string][]*base.TaskMessage
|
2019-12-30 01:41:00 +08:00
|
|
|
wantScheduled []h.ZSetEntry
|
2019-11-30 09:40:31 +08:00
|
|
|
}{
|
|
|
|
{
|
2019-12-21 23:42:32 +08:00
|
|
|
desc: "Process task immediately",
|
|
|
|
task: task,
|
|
|
|
processAt: time.Now(),
|
|
|
|
opts: []Option{},
|
2020-01-06 22:53:40 +08:00
|
|
|
wantEnqueued: map[string][]*base.TaskMessage{
|
|
|
|
"default": []*base.TaskMessage{
|
|
|
|
&base.TaskMessage{
|
|
|
|
Type: task.Type,
|
|
|
|
Payload: task.Payload.data,
|
|
|
|
Retry: defaultMaxRetry,
|
|
|
|
Queue: "default",
|
|
|
|
},
|
2019-12-21 23:42:32 +08:00
|
|
|
},
|
|
|
|
},
|
|
|
|
wantScheduled: nil, // db is flushed in setup so zset does not exist hence nil
|
|
|
|
},
|
|
|
|
{
|
|
|
|
desc: "Schedule task to be processed in the future",
|
|
|
|
task: task,
|
|
|
|
processAt: time.Now().Add(2 * time.Hour),
|
|
|
|
opts: []Option{},
|
|
|
|
wantEnqueued: nil, // db is flushed in setup so list does not exist hence nil
|
2019-12-30 01:41:00 +08:00
|
|
|
wantScheduled: []h.ZSetEntry{
|
2019-12-21 23:42:32 +08:00
|
|
|
{
|
2019-12-30 01:41:00 +08:00
|
|
|
Msg: &base.TaskMessage{
|
2019-12-21 23:42:32 +08:00
|
|
|
Type: task.Type,
|
2020-01-05 05:13:46 +08:00
|
|
|
Payload: task.Payload.data,
|
2019-12-21 23:42:32 +08:00
|
|
|
Retry: defaultMaxRetry,
|
|
|
|
Queue: "default",
|
|
|
|
},
|
2019-12-30 01:41:00 +08:00
|
|
|
Score: time.Now().Add(2 * time.Hour).Unix(),
|
2019-12-21 23:42:32 +08:00
|
|
|
},
|
|
|
|
},
|
|
|
|
},
|
|
|
|
{
|
|
|
|
desc: "Process task immediately with a custom retry count",
|
|
|
|
task: task,
|
|
|
|
processAt: time.Now(),
|
|
|
|
opts: []Option{
|
|
|
|
MaxRetry(3),
|
|
|
|
},
|
2020-01-06 22:53:40 +08:00
|
|
|
wantEnqueued: map[string][]*base.TaskMessage{
|
|
|
|
"default": []*base.TaskMessage{
|
|
|
|
&base.TaskMessage{
|
|
|
|
Type: task.Type,
|
|
|
|
Payload: task.Payload.data,
|
|
|
|
Retry: 3,
|
|
|
|
Queue: "default",
|
|
|
|
},
|
2019-12-21 23:42:32 +08:00
|
|
|
},
|
|
|
|
},
|
|
|
|
wantScheduled: nil, // db is flushed in setup so zset does not exist hence nil
|
2019-11-30 09:40:31 +08:00
|
|
|
},
|
|
|
|
{
|
2019-12-21 23:42:32 +08:00
|
|
|
desc: "Negative retry count",
|
|
|
|
task: task,
|
|
|
|
processAt: time.Now(),
|
|
|
|
opts: []Option{
|
|
|
|
MaxRetry(-2),
|
|
|
|
},
|
2020-01-06 22:53:40 +08:00
|
|
|
wantEnqueued: map[string][]*base.TaskMessage{
|
|
|
|
"default": []*base.TaskMessage{
|
|
|
|
&base.TaskMessage{
|
|
|
|
Type: task.Type,
|
|
|
|
Payload: task.Payload.data,
|
|
|
|
Retry: 0, // Retry count should be set to zero
|
|
|
|
Queue: "default",
|
|
|
|
},
|
2019-12-21 23:42:32 +08:00
|
|
|
},
|
|
|
|
},
|
|
|
|
wantScheduled: nil, // db is flushed in setup so zset does not exist hence nil
|
2019-11-30 09:40:31 +08:00
|
|
|
},
|
2019-12-22 02:02:03 +08:00
|
|
|
{
|
|
|
|
desc: "Conflicting options",
|
|
|
|
task: task,
|
|
|
|
processAt: time.Now(),
|
|
|
|
opts: []Option{
|
|
|
|
MaxRetry(2),
|
|
|
|
MaxRetry(10),
|
|
|
|
},
|
2020-01-06 22:53:40 +08:00
|
|
|
wantEnqueued: map[string][]*base.TaskMessage{
|
|
|
|
"default": []*base.TaskMessage{
|
|
|
|
&base.TaskMessage{
|
|
|
|
Type: task.Type,
|
|
|
|
Payload: task.Payload.data,
|
|
|
|
Retry: 10, // Last option takes precedence
|
|
|
|
Queue: "default",
|
|
|
|
},
|
|
|
|
},
|
|
|
|
},
|
|
|
|
wantScheduled: nil, // db is flushed in setup so zset does not exist hence nil
|
|
|
|
},
|
|
|
|
{
|
|
|
|
desc: "With queue option",
|
|
|
|
task: task,
|
|
|
|
processAt: time.Now(),
|
|
|
|
opts: []Option{
|
|
|
|
Queue("custom"),
|
|
|
|
},
|
|
|
|
wantEnqueued: map[string][]*base.TaskMessage{
|
|
|
|
"custom": []*base.TaskMessage{
|
|
|
|
&base.TaskMessage{
|
|
|
|
Type: task.Type,
|
|
|
|
Payload: task.Payload.data,
|
|
|
|
Retry: defaultMaxRetry,
|
|
|
|
Queue: "custom",
|
|
|
|
},
|
|
|
|
},
|
|
|
|
},
|
|
|
|
wantScheduled: nil, // db is flushed in setup so zset does not exist hence nil
|
|
|
|
},
|
|
|
|
{
|
|
|
|
desc: "Queue option should be case-insensitive",
|
|
|
|
task: task,
|
|
|
|
processAt: time.Now(),
|
|
|
|
opts: []Option{
|
|
|
|
Queue("HIGH"),
|
|
|
|
},
|
|
|
|
wantEnqueued: map[string][]*base.TaskMessage{
|
|
|
|
"high": []*base.TaskMessage{
|
|
|
|
&base.TaskMessage{
|
|
|
|
Type: task.Type,
|
|
|
|
Payload: task.Payload.data,
|
|
|
|
Retry: defaultMaxRetry,
|
|
|
|
Queue: "high",
|
|
|
|
},
|
2019-12-22 02:02:03 +08:00
|
|
|
},
|
|
|
|
},
|
|
|
|
wantScheduled: nil, // db is flushed in setup so zset does not exist hence nil
|
|
|
|
},
|
2019-11-30 09:40:31 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
for _, tc := range tests {
|
2019-12-30 01:41:00 +08:00
|
|
|
h.FlushDB(t, r) // clean up db before each test case.
|
2019-11-30 09:40:31 +08:00
|
|
|
|
2020-01-04 12:24:18 +08:00
|
|
|
err := client.Schedule(tc.task, tc.processAt, tc.opts...)
|
2019-11-30 09:40:31 +08:00
|
|
|
if err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
|
2020-01-06 22:53:40 +08:00
|
|
|
for qname, want := range tc.wantEnqueued {
|
|
|
|
gotEnqueued := h.GetEnqueuedMessages(t, r, qname)
|
|
|
|
if diff := cmp.Diff(want, gotEnqueued, h.IgnoreIDOpt); diff != "" {
|
|
|
|
t.Errorf("%s;\nmismatch found in %q; (-want,+got)\n%s", tc.desc, base.QueueKey(qname), diff)
|
|
|
|
}
|
2019-12-21 23:42:32 +08:00
|
|
|
}
|
|
|
|
|
2019-12-30 01:41:00 +08:00
|
|
|
gotScheduled := h.GetScheduledEntries(t, r)
|
|
|
|
if diff := cmp.Diff(tc.wantScheduled, gotScheduled, h.IgnoreIDOpt); diff != "" {
|
2019-12-22 23:15:45 +08:00
|
|
|
t.Errorf("%s;\nmismatch found in %q; (-want,+got)\n%s", tc.desc, base.ScheduledQueue, diff)
|
2019-11-30 09:40:31 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|