(t *testing.T)
| 938 | } |
| 939 | |
| 940 | func TestIntersectsWithInterval(t *testing.T) { |
| 941 | bm := NewBitmap() |
| 942 | bm.AddRange(21, 26) |
| 943 | |
| 944 | // Empty interval in range |
| 945 | assert.False(t, bm.IntersectsWithInterval(22, 22)) |
| 946 | // Empty interval out of range |
| 947 | assert.False(t, bm.IntersectsWithInterval(27, 27)) |
| 948 | |
| 949 | // Non-empty interval in range, fully included |
| 950 | assert.True(t, bm.IntersectsWithInterval(22, 23)) |
| 951 | // Non-empty intervals partially overlapped |
| 952 | assert.True(t, bm.IntersectsWithInterval(19, 23)) |
| 953 | assert.True(t, bm.IntersectsWithInterval(23, 30)) |
| 954 | // Non-empty interval covering the full range |
| 955 | assert.True(t, bm.IntersectsWithInterval(19, 30)) |
| 956 | |
| 957 | // Non-empty interval before start of bitmap |
| 958 | assert.False(t, bm.IntersectsWithInterval(19, 20)) |
| 959 | // Non-empty interval after end of bitmap |
| 960 | assert.False(t, bm.IntersectsWithInterval(28, 30)) |
| 961 | |
| 962 | // Non-empty interval inside "hole" in bitmap |
| 963 | bm.AddRange(30, 40) |
| 964 | assert.False(t, bm.IntersectsWithInterval(28, 29)) |
| 965 | |
| 966 | // Non-empty interval, non-overlapping on the open side |
| 967 | assert.False(t, bm.IntersectsWithInterval(28, 30)) |
| 968 | // Non-empty interval, overlapping on the open side |
| 969 | assert.True(t, bm.IntersectsWithInterval(28, 31)) |
| 970 | } |
| 971 | |
| 972 | func TestRangePanic(t *testing.T) { |
| 973 | bm := NewBitmap() |
nothing calls this directly
no test coverage detected
searching dependent graphs…