MCPcopy Create free account
hub / github.com/RoaringBitmap/roaring / haveOverlap16

Function haveOverlap16

runcontainer.go:313–318  ·  view source on GitHub ↗

haveOverlap differs from canMerge in that it tells you if the intersection of a and b would contain an element (otherwise it would be the empty set, and we return false).

(a, b interval16)

Source from the content-addressed store, hash-verified

311// it would be the empty set, and we return
312// false).
313func haveOverlap16(a, b interval16) bool {
314 if int(a.last())+1 <= int(b.start) {
315 return false
316 }
317 return int(b.last())+1 > int(a.start)
318}
319
320// mergeInterval16s joins a and b into a
321// new interval, and panics if it cannot.

Callers 4

TestRleIntersection16Function · 0.85
intersectInterval16sFunction · 0.85
intersectMethod · 0.85
intersectCardinalityMethod · 0.85

Calls 1

lastMethod · 0.80

Tested by 1

TestRleIntersection16Function · 0.68

Used in the wild real call sites across dependent graphs

searching dependent graphs…