( smallset []uint16, largeset []uint16, )
| 257 | } |
| 258 | |
| 259 | func onesidedgallopingintersect2by2Bool( |
| 260 | smallset []uint16, |
| 261 | largeset []uint16, |
| 262 | ) bool { |
| 263 | k1 := 0 |
| 264 | k2 := 0 |
| 265 | s1 := largeset[k1] |
| 266 | s2 := smallset[k2] |
| 267 | mainwhile: |
| 268 | for { |
| 269 | if s1 < s2 { |
| 270 | k1 = advanceUntil(largeset, k1, len(largeset), s2) |
| 271 | if k1 == len(largeset) { |
| 272 | break mainwhile |
| 273 | } |
| 274 | s1 = largeset[k1] |
| 275 | } |
| 276 | if s2 < s1 { |
| 277 | k2++ |
| 278 | if k2 == len(smallset) { |
| 279 | break mainwhile |
| 280 | } |
| 281 | s2 = smallset[k2] |
| 282 | } else { |
| 283 | // (set2[k2] == set1[k1]) |
| 284 | return true |
| 285 | } |
| 286 | |
| 287 | } |
| 288 | return false |
| 289 | } |
| 290 | |
| 291 | func localintersect2by2( |
| 292 | set1 []uint16, |
no test coverage detected
searching dependent graphs…