料青山看我应如是
它并没有真正分页，而只是通过有界标识符（）查询数据。如果您知道组 ID，并且它们是连续的，则可以执行类似操作。这是使用纯Go完成的，您可以轻松地将gorm与此合并。GroupId去游乐场package mainimport ( "fmt")func main() { for _, q := range queries() { fmt.Println(q) }}func queries() (out []string) { groups := []int{10, 20, 30, 40, 50, 60, 70, 80, 90, 100} for i := 0; i < len(groups); i++ { var lower, upper int = 0, 0 if i != 0 { lower = groups[i-1] } upper = groups[i] q := fmt.Sprintf("SELECT * FROM MyTable WHERE GroupId >= %v AND GroupId < %v", lower, upper) out = append(out, q) } return}对打印出应运行以获取每个组中的所有结果的每个查询的调用。例如：queriesSELECT * FROM MyTable WHERE GroupId >= 0 AND GroupId < 10SELECT * FROM MyTable WHERE GroupId >= 10 AND GroupId < 20SELECT * FROM MyTable WHERE GroupId >= 20 AND GroupId < 30SELECT * FROM MyTable WHERE GroupId >= 30 AND GroupId < 40SELECT * FROM MyTable WHERE GroupId >= 40 AND GroupId < 50SELECT * FROM MyTable WHERE GroupId >= 50 AND GroupId < 60SELECT * FROM MyTable WHERE GroupId >= 60 AND GroupId < 70SELECT * FROM MyTable WHERE GroupId >= 70 AND GroupId < 80SELECT * FROM MyTable WHERE GroupId >= 80 AND GroupId < 90SELECT * FROM MyTable WHERE GroupId >= 90 AND GroupId < 100到目前为止，我们假设您已经确切地知道要查询的“组存储桶”。相反，如果我们假设我们知道有多少个顺序组（）以及每个查询想要多少个组（存储桶大小），我们可以轻松创建一个函数来为我们提供应该查询的存储桶。nsfunc groups(n, s int) (out []int) { for i := 0; i <= n; i++ { if i == 0 { continue } if i%s == 0 || i == n { out = append(out, i) } } return}