(column1 string, pk1 []driver.Value, column2 string, pk2 []driver.Value)
| 2054 | } |
| 2055 | |
| 2056 | func matchIDs(column1 string, pk1 []driver.Value, column2 string, pk2 []driver.Value) *sql.Predicate { |
| 2057 | p := matchID(column1, pk1) |
| 2058 | if len(pk2) > 1 { |
| 2059 | // Use "IN" predicate instead of list of "OR" |
| 2060 | // in case of more than on nodes to connect. |
| 2061 | return sql.And(p, sql.InValues(column2, pk2...)) |
| 2062 | } |
| 2063 | return sql.And(p, sql.EQ(column2, pk2[0])) |
| 2064 | } |
| 2065 | |
| 2066 | // cartesian product of 2 id sets. |
| 2067 | func product(a, b []driver.Value) [][2]driver.Value { |
no test coverage detected
searching dependent graphs…