(t *testing.T)
| 62 | } |
| 63 | |
| 64 | func TestArrayOffset(t *testing.T) { |
| 65 | nums := []uint16{10, 100, 1000} |
| 66 | expected := make([]int, len(nums)) |
| 67 | offtest := uint16(65000) |
| 68 | v := container(newArrayContainer()) |
| 69 | for i, n := range nums { |
| 70 | v = v.iaddReturnMinimized(n) |
| 71 | expected[i] = int(n) + int(offtest) |
| 72 | } |
| 73 | l, h := v.addOffset(offtest) |
| 74 | |
| 75 | var w0card, w1card int |
| 76 | wout := make([]int, len(nums)) |
| 77 | |
| 78 | if l != nil { |
| 79 | w0card = l.getCardinality() |
| 80 | |
| 81 | for i := 0; i < w0card; i++ { |
| 82 | wout[i] = l.selectInt(uint16(i)) |
| 83 | } |
| 84 | } |
| 85 | |
| 86 | if h != nil { |
| 87 | w1card = h.getCardinality() |
| 88 | |
| 89 | for i := 0; i < w1card; i++ { |
| 90 | wout[i+w0card] = h.selectInt(uint16(i)) + 65536 |
| 91 | } |
| 92 | } |
| 93 | |
| 94 | assert.Equal(t, 3, w0card+w1card) |
| 95 | for i, x := range wout { |
| 96 | assert.Equal(t, expected[i], x) |
| 97 | } |
| 98 | } |
| 99 | |
| 100 | func TestArrayContainerMassiveSetAndGet(t *testing.T) { |
| 101 | v := container(newArrayContainer()) |
nothing calls this directly
no test coverage detected
searching dependent graphs…