• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

mlange-42 / arche / 12041170297

27 Nov 2024 12:08AM CUT coverage: 100.0%. Remained the same
12041170297

push

github

web-flow
Update changelog for v0.13.3 (#434)

6367 of 6367 relevant lines covered (100.0%)

75928.18 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

100.0
/ecs/bitset.go
1
package ecs
2

3
// Data structure for compact storage of booleans.
4
type bitSet struct {
5
        data []uint64
6
}
7

8
// Get a value.
9
func (b *bitSet) Get(bit eid) bool {
3,005,662✔
10
        chunk, bit := bit/wordSize, bit%wordSize
3,005,662✔
11
        mask := uint64(1 << bit)
3,005,662✔
12
        return b.data[chunk]&mask == mask
3,005,662✔
13
}
3,005,662✔
14

15
// Set a value.
16
func (b *bitSet) Set(bit eid, value bool) {
3,315,760✔
17
        chunk, bit := bit/wordSize, bit%wordSize
3,315,760✔
18
        if value {
3,346,261✔
19
                b.data[chunk] |= uint64(1 << bit)
30,501✔
20
        } else {
3,315,760✔
21
                b.data[chunk] &= uint64(^(1 << bit))
3,285,259✔
22
        }
3,285,259✔
23
}
24

25
// Reset all values.
26
func (b *bitSet) Reset() {
33✔
27
        for i := range b.data {
3,900✔
28
                b.data[i] = 0
3,867✔
29
        }
3,867✔
30
}
31

32
// Extend to hold at least the given bits.
33
func (b *bitSet) ExtendTo(length int) {
36,084✔
34
        chunks, bit := length/wordSize, length%wordSize
36,084✔
35
        if bit > 0 {
44,455✔
36
                chunks++
8,371✔
37
        }
8,371✔
38
        if len(b.data) >= chunks {
71,783✔
39
                return
35,699✔
40
        }
35,699✔
41

42
        old := b.data
385✔
43
        b.data = make([]uint64, chunks)
385✔
44

385✔
45
        copy(b.data, old)
385✔
46
}
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2025 Coveralls, Inc