如何迭代一个切片的所有可能的分区(非空子切片)？

package main

import (
    "fmt"
)

// partition 函数生成切片的所有非空子切片的组合
func partition(slice []int) [][]int {
    n := len(slice)
    var result [][]int

    // 递归函数来生成所有可能的组合
    var generate func(start int, current []int)
    generate = func(start int, current []int) {
        if len(current) > 0 {
            temp := make([]int, len(current))
            copy(temp, current)
            result = append(result, temp)
        }
        for i := start; i < n; i++ {
            current = append(current, slice[i])
            generate(i+1, current)
            current = current[:len(current)-1]
        }
    }

    generate(0, []int{})
    return result
}

func main() {
    slice := []int{1, 2, 3}
    partitions := partition(slice)
    for _, part := range partitions {
        fmt.Println(part)
    }
}