|
|
|
|
@ -93,7 +93,7 @@ var cases = []*testIndexerCase{
|
|
|
|
|
Name: "default",
|
|
|
|
|
SearchOptions: &internal.SearchOptions{},
|
|
|
|
|
Expected: func(t *testing.T, data map[int64]*internal.IndexerData, result *internal.SearchResult) {
|
|
|
|
|
assert.Equal(t, len(data), len(result.Hits))
|
|
|
|
|
assert.Len(t, result.Hits, len(data))
|
|
|
|
|
assert.Equal(t, len(data), int(result.Total))
|
|
|
|
|
},
|
|
|
|
|
},
|
|
|
|
|
@ -526,7 +526,7 @@ var cases = []*testIndexerCase{
|
|
|
|
|
SortBy: internal.SortByCreatedDesc,
|
|
|
|
|
},
|
|
|
|
|
Expected: func(t *testing.T, data map[int64]*internal.IndexerData, result *internal.SearchResult) {
|
|
|
|
|
assert.Equal(t, len(data), len(result.Hits))
|
|
|
|
|
assert.Len(t, result.Hits, len(data))
|
|
|
|
|
assert.Equal(t, len(data), int(result.Total))
|
|
|
|
|
for i, v := range result.Hits {
|
|
|
|
|
if i < len(result.Hits)-1 {
|
|
|
|
|
@ -542,7 +542,7 @@ var cases = []*testIndexerCase{
|
|
|
|
|
SortBy: internal.SortByUpdatedDesc,
|
|
|
|
|
},
|
|
|
|
|
Expected: func(t *testing.T, data map[int64]*internal.IndexerData, result *internal.SearchResult) {
|
|
|
|
|
assert.Equal(t, len(data), len(result.Hits))
|
|
|
|
|
assert.Len(t, result.Hits, len(data))
|
|
|
|
|
assert.Equal(t, len(data), int(result.Total))
|
|
|
|
|
for i, v := range result.Hits {
|
|
|
|
|
if i < len(result.Hits)-1 {
|
|
|
|
|
@ -558,7 +558,7 @@ var cases = []*testIndexerCase{
|
|
|
|
|
SortBy: internal.SortByCommentsDesc,
|
|
|
|
|
},
|
|
|
|
|
Expected: func(t *testing.T, data map[int64]*internal.IndexerData, result *internal.SearchResult) {
|
|
|
|
|
assert.Equal(t, len(data), len(result.Hits))
|
|
|
|
|
assert.Len(t, result.Hits, len(data))
|
|
|
|
|
assert.Equal(t, len(data), int(result.Total))
|
|
|
|
|
for i, v := range result.Hits {
|
|
|
|
|
if i < len(result.Hits)-1 {
|
|
|
|
|
@ -574,7 +574,7 @@ var cases = []*testIndexerCase{
|
|
|
|
|
SortBy: internal.SortByDeadlineDesc,
|
|
|
|
|
},
|
|
|
|
|
Expected: func(t *testing.T, data map[int64]*internal.IndexerData, result *internal.SearchResult) {
|
|
|
|
|
assert.Equal(t, len(data), len(result.Hits))
|
|
|
|
|
assert.Len(t, result.Hits, len(data))
|
|
|
|
|
assert.Equal(t, len(data), int(result.Total))
|
|
|
|
|
for i, v := range result.Hits {
|
|
|
|
|
if i < len(result.Hits)-1 {
|
|
|
|
|
@ -590,7 +590,7 @@ var cases = []*testIndexerCase{
|
|
|
|
|
SortBy: internal.SortByCreatedAsc,
|
|
|
|
|
},
|
|
|
|
|
Expected: func(t *testing.T, data map[int64]*internal.IndexerData, result *internal.SearchResult) {
|
|
|
|
|
assert.Equal(t, len(data), len(result.Hits))
|
|
|
|
|
assert.Len(t, result.Hits, len(data))
|
|
|
|
|
assert.Equal(t, len(data), int(result.Total))
|
|
|
|
|
for i, v := range result.Hits {
|
|
|
|
|
if i < len(result.Hits)-1 {
|
|
|
|
|
@ -606,7 +606,7 @@ var cases = []*testIndexerCase{
|
|
|
|
|
SortBy: internal.SortByUpdatedAsc,
|
|
|
|
|
},
|
|
|
|
|
Expected: func(t *testing.T, data map[int64]*internal.IndexerData, result *internal.SearchResult) {
|
|
|
|
|
assert.Equal(t, len(data), len(result.Hits))
|
|
|
|
|
assert.Len(t, result.Hits, len(data))
|
|
|
|
|
assert.Equal(t, len(data), int(result.Total))
|
|
|
|
|
for i, v := range result.Hits {
|
|
|
|
|
if i < len(result.Hits)-1 {
|
|
|
|
|
@ -622,7 +622,7 @@ var cases = []*testIndexerCase{
|
|
|
|
|
SortBy: internal.SortByCommentsAsc,
|
|
|
|
|
},
|
|
|
|
|
Expected: func(t *testing.T, data map[int64]*internal.IndexerData, result *internal.SearchResult) {
|
|
|
|
|
assert.Equal(t, len(data), len(result.Hits))
|
|
|
|
|
assert.Len(t, result.Hits, len(data))
|
|
|
|
|
assert.Equal(t, len(data), int(result.Total))
|
|
|
|
|
for i, v := range result.Hits {
|
|
|
|
|
if i < len(result.Hits)-1 {
|
|
|
|
|
@ -638,7 +638,7 @@ var cases = []*testIndexerCase{
|
|
|
|
|
SortBy: internal.SortByDeadlineAsc,
|
|
|
|
|
},
|
|
|
|
|
Expected: func(t *testing.T, data map[int64]*internal.IndexerData, result *internal.SearchResult) {
|
|
|
|
|
assert.Equal(t, len(data), len(result.Hits))
|
|
|
|
|
assert.Len(t, result.Hits, len(data))
|
|
|
|
|
assert.Equal(t, len(data), int(result.Total))
|
|
|
|
|
for i, v := range result.Hits {
|
|
|
|
|
if i < len(result.Hits)-1 {
|
|
|
|
|
|