cartesian product of 2 id sets.
(a, b []driver.Value)
| 2065 | |
| 2066 | // cartesian product of 2 id sets. |
| 2067 | func product(a, b []driver.Value) [][2]driver.Value { |
| 2068 | c := make([][2]driver.Value, 0, len(a)*len(b)) |
| 2069 | for i := range a { |
| 2070 | for j := range b { |
| 2071 | c = append(c, [2]driver.Value{a[i], b[j]}) |
| 2072 | } |
| 2073 | } |
| 2074 | return c |
| 2075 | } |
no outgoing calls
no test coverage detected
searching dependent graphs…