96
97
// TestScanAllTrees test
99
>
resp, err := s.ExecutionManager.GetAllHistoryTreeBranches(s.ctx, &p.GetAllHistoryTreeBranchesRequest{
100
>
PageSize: 1,
101
>
})
102
>
s.Nil(err)
103
>
s.Equal(0, len(resp.Branches), "some trees were leaked in other tests")
104
>
105
>
trees := map[string]bool{}
106
>
totalTrees := 1002
107
>
pgSize := 100
108
>
109
>
for range totalTrees {
110
>
treeID := uuid.NewString()
111
>
bi, err := s.newHistoryBranch(treeID)
112
>
s.Nil(err)
113
>
114
>
events := s.genRandomEvents([]int64{1, 2, 3}, 1)
115
>
err = s.appendNewBranchAndFirstNode(bi, events, 1, "branchInfo")
116
>
s.Nil(err)
117
>
trees[string(treeID)] = true
118
>
}
119
121
>
for {
122
>
resp, err := s.ExecutionManager.GetAllHistoryTreeBranches(s.ctx, &p.GetAllHistoryTreeBranchesRequest{
123
>
PageSize: pgSize,
124
>
NextPageToken: pgToken,
125
>
})
126
>
s.Nil(err)
127
>
for _, br := range resp.Branches {
128
>
uuidTreeId := br.BranchInfo.TreeId
129
>
if trees[uuidTreeId] {
130
>
delete(trees, uuidTreeId)
131
>
132
>
s.True(br.ForkTime.AsTime().UnixNano() > 0)
133
>
s.True(len(br.BranchInfo.BranchId) > 0)
134
>
s.Equal("branchInfo", br.Info)
135
>
} else {
136
s.Fail("treeID not found", br.BranchInfo.TreeId)
137
}
138
}
139
141
>
break
142
}
144
}
145
147
}
148