7515952855

Committed 14 Jan 2024 01:00AM CUT coverage: 100.0%. Remained the same

Build # 7515952855

Build Type

push

github

Committed by

web-flow

Commit Message

Reduce archetype size by storing layouts in a growing slice (#327)

Use a growing slice to hold archetype mem layouts, instead of a fixes-size array.

Reduces archetype size from 4 kB to 88 B, plus the heap-allocated slice. The slice starts with size 16 (i.e. 16 component types) and grows in steps of 16 up to 256.

# Commits

* reduce archetype size by storing components in a growing slice
* re-arrange test functions
* document undefined behavior for IDs out of range, update changelog
* move non-zero capacity calculation to a separate function
* check component registry limit vs. int, not uint8
* move arche-serde up in the tools list in README

Run Details

4871 of 4871 relevant lines covered (100.0%)

65485.4 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 {	2,525,721✔
10	chunk, bit := bit/wordSize, bit%wordSize	2,525,721✔
11	mask := uint64(1 << bit)	2,525,721✔
12	return b.data[chunk]&mask == mask	2,525,721✔
13	}	2,525,721✔
14
15	// Set a value.
16	func (b *bitSet) Set(bit eid, value bool) {	2,837,837✔
17	chunk, bit := bit/wordSize, bit%wordSize	2,837,837✔
18	if value {	2,867,909✔
19	b.data[chunk] \|= uint64(1 << bit)	30,072✔
20	} else {	2,837,837✔
21	b.data[chunk] &= uint64(^(1 << bit))	2,807,765✔
22	}	2,807,765✔
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) {	32,808✔
34	chunks, bit := length/wordSize, length%wordSize	32,808✔
35	if bit > 0 {	37,968✔
36	chunks++	5,160✔
37	}	5,160✔
38	if len(b.data) >= chunks {	65,304✔
39	return	32,496✔
40	}	32,496✔
41
42	old := b.data	312✔
43	b.data = make([]uint64, chunks)	312✔
44		312✔
45	copy(b.data, old)	312✔
46	}

mlange-42 / arche / 7515952855

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