@@ -312,10 +312,10 @@ var cases = []*testIndexerCase{
312
312
Expected : func (t * testing.T , data map [int64 ]* internal.IndexerData , result * internal.SearchResult ) {
313
313
assert .Equal (t , 5 , len (result .Hits ))
314
314
for _ , v := range result .Hits {
315
- assert .Equal (t , int64 ( 1 ), data [v .ID ].ProjectIDs )
315
+ assert .Contains (t , data [v .ID ].ProjectIDs , int64 ( 1 ) )
316
316
}
317
317
assert .Equal (t , countIndexerData (data , func (v * internal.IndexerData ) bool {
318
- return v .ProjectIDs [ 0 ] == 1
318
+ return slices . Contains ( v .ProjectIDs , 1 )
319
319
}), result .Total )
320
320
},
321
321
},
@@ -330,10 +330,10 @@ var cases = []*testIndexerCase{
330
330
Expected : func (t * testing.T , data map [int64 ]* internal.IndexerData , result * internal.SearchResult ) {
331
331
assert .Equal (t , 5 , len (result .Hits ))
332
332
for _ , v := range result .Hits {
333
- assert .Equal ( t , int64 ( 0 ) , data [v .ID ].ProjectIDs )
333
+ assert .Empty ( t , data [v .ID ].ProjectIDs )
334
334
}
335
335
assert .Equal (t , countIndexerData (data , func (v * internal.IndexerData ) bool {
336
- return v .ProjectIDs [ 0 ] == 0
336
+ return len ( v .ProjectIDs ) == 0
337
337
}), result .Total )
338
338
},
339
339
},
@@ -694,7 +694,7 @@ func generateDefaultIndexerData() []*internal.IndexerData {
694
694
}
695
695
projectIDs := make ([]int64 , id % 5 )
696
696
for i := range projectIDs {
697
- projectIDs [i ] = int64 (i ) + 1
697
+ projectIDs [i ] = int64 (i ) + 1 // ProjectID should not be 0
698
698
}
699
699
700
700
data = append (data , & internal.IndexerData {
@@ -710,6 +710,7 @@ func generateDefaultIndexerData() []*internal.IndexerData {
710
710
NoLabel : len (labelIDs ) == 0 ,
711
711
MilestoneID : issueIndex % 4 ,
712
712
ProjectIDs : projectIDs ,
713
+ NoProject : len (projectIDs ) == 0 ,
713
714
ProjectBoardID : issueIndex % 6 ,
714
715
PosterID : id % 10 + 1 , // PosterID should not be 0
715
716
AssigneeID : issueIndex % 10 ,
0 commit comments