12631492639

Committed 06 Jan 2025 11:14AM CUT coverage: 100.0%. Remained the same

Build # 12631492639

Build Type

Pull #459

github

Committed by

web-flow

Commit Message

Merge d1147bb20 into b2a90dd81

Pull Request Pull Request #459: Optimize removal in archetypes

Run Details

67 of 67 new or added lines in 5 files covered. (100.0%)

6537 of 6537 relevant lines covered (100.0%)

113528.1 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,508,762✔
10	chunk, bit := bit/wordSize, bit%wordSize	3,508,762✔
11	mask := uint64(1 << bit)	3,508,762✔
12	return b.data[chunk]&mask == mask	3,508,762✔
13	}	3,508,762✔
14
15	// Set a value.
16	func (b *bitSet) Set(bit eid, value bool) {	3,816,304✔
17	chunk, bit := bit/wordSize, bit%wordSize	3,816,304✔
18	if value {	3,846,805✔
19	b.data[chunk] \|= uint64(1 << bit)	30,501✔
20	} else {	3,816,304✔
21	b.data[chunk] &= uint64(^(1 << bit))	3,785,803✔
22	}	3,785,803✔
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,351✔
34	chunks, bit := length/wordSize, length%wordSize	39,351✔
35	if bit > 0 {	50,939✔
36	chunks++	11,588✔
37	}	11,588✔
38	if len(b.data) >= chunks {	78,260✔
39	return	38,909✔
40	}	38,909✔
41
42	old := b.data	442✔
43	b.data = make([]uint64, chunks)	442✔
44		442✔
45	copy(b.data, old)	442✔
46	}

mlange-42 / arche / 12631492639

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