12591295022

Committed 03 Jan 2025 01:30AM CUT coverage: 100.0%. Remained the same

Build # 12591295022

Build Type

Pull #457

github

Committed by

web-flow

Commit Message

Merge c94060e8e into 75038f42c

Pull Request Pull Request #457: Improve sub-package docs for navigation and findability

Run Details

6487 of 6487 relevant lines covered (100.0%)

115666.96 hits per line

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

100.0

/ecs/bitset.go

package ecs

// Data structure for compact storage of booleans.
type bitSet struct {
        data []uint64
}

// Get a value.
func (b *bitSet) Get(bit eid) bool {
        chunk, bit := bit/wordSize, bit%wordSize
        mask := uint64(1 << bit)
        return b.data[chunk]&mask == mask
}

// Set a value.
func (b *bitSet) Set(bit eid, value bool) {
        chunk, bit := bit/wordSize, bit%wordSize
        if value {
                b.data[chunk] |= uint64(1 << bit)
        } else {
                b.data[chunk] &= uint64(^(1 << bit))
        }
}

// Reset all values.
func (b *bitSet) Reset() {
        for i := range b.data {
                b.data[i] = 0
        }
}

// Extend to hold at least the given bits.
func (b *bitSet) ExtendTo(length int) {
        chunks, bit := length/wordSize, length%wordSize
        if bit > 0 {
                chunks++
        }
        if len(b.data) >= chunks {
                return
        }

        old := b.data
        b.data = make([]uint64, chunks)

        copy(b.data, old)
}

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,534,729✔
10	chunk, bit := bit/wordSize, bit%wordSize	3,534,729✔
11	mask := uint64(1 << bit)	3,534,729✔
12	return b.data[chunk]&mask == mask	3,534,729✔
13	}	3,534,729✔
14
15	// Set a value.
16	func (b *bitSet) Set(bit eid, value bool) {	3,842,280✔
17	chunk, bit := bit/wordSize, bit%wordSize	3,842,280✔
18	if value {	3,872,781✔
19	b.data[chunk] \|= uint64(1 << bit)	30,501✔
20	} else {	3,842,280✔
21	b.data[chunk] &= uint64(^(1 << bit))	3,811,779✔
22	}	3,811,779✔
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) {	39,128✔
34	chunks, bit := length/wordSize, length%wordSize	39,128✔
35	if bit > 0 {	50,496✔
36	chunks++	11,368✔
37	}	11,368✔
38	if len(b.data) >= chunks {	77,817✔
39	return	38,689✔
40	}	38,689✔
41
42	old := b.data	439✔
43	b.data = make([]uint64, chunks)	439✔
44		439✔
45	copy(b.data, old)	439✔
46	}

mlange-42 / arche / 12591295022

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

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