7908991760

Committed 15 Feb 2024 12:03AM CUT coverage: 100.0%. Remained the same

Build # 7908991760

Build Type

push

github

Committed by

web-flow

Commit Message

Arche user manual, 4/x (#384)

# Summary

* write the rest of the pages
* move Quickstart up to be a top-levle entry
* tweak shortcodes

# Commits

* add design chapter, move relations benchmarks
* move and refine chapter on architecture
* make quickstart a separate page on top level
* tweak quickstart and page titles
* remove ecs page, link to S. Mertens' ECS FAQ
* amend docs landing page
* add citation to landing page
* proofreading, tweaks, update changelog

Run Details

6366 of 6366 relevant lines covered (100.0%)

76235.9 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,010,868✔
10	chunk, bit := bit/wordSize, bit%wordSize	3,010,868✔
11	mask := uint64(1 << bit)	3,010,868✔
12	return b.data[chunk]&mask == mask	3,010,868✔
13	}	3,010,868✔
14
15	// Set a value.
16	func (b *bitSet) Set(bit eid, value bool) {	3,321,022✔
17	chunk, bit := bit/wordSize, bit%wordSize	3,321,022✔
18	if value {	3,351,523✔
19	b.data[chunk] \|= uint64(1 << bit)	30,501✔
20	} else {	3,321,022✔
21	b.data[chunk] &= uint64(^(1 << bit))	3,290,521✔
22	}	3,290,521✔
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,024✔
34	chunks, bit := length/wordSize, length%wordSize	36,024✔
35	if bit > 0 {	44,336✔
36	chunks++	8,312✔
37	}	8,312✔
38	if len(b.data) >= chunks {	71,668✔
39	return	35,644✔
40	}	35,644✔
41
42	old := b.data	380✔
43	b.data = make([]uint64, chunks)	380✔
44		380✔
45	copy(b.data, old)	380✔
46	}

mlange-42 / arche / 7908991760

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