7577189746

Committed 18 Jan 2024 11:22PM CUT coverage: 100.0%. Remained the same

Build # 7577189746

Build Type

push

github

Committed by

web-flow

Commit Message

Exchange with relation targets, more batch ops (#342)

Adds methods to allow for exchanging components and setting relation targets at the same time. Includes batch operations and generic API.

* adds methods `Relations.Exchange()`, `Relations.ExchangeBatch()`, `Relations.ExchangeBatchQ()` for exchange with relation target
* adds `Exchange.WithRelation()` and optional target argument for operations with relation target
* adds `MapX.AddBatch()`, `MapX.AddBatchQ()`, `MapX.RemoveBatch()`and `MapX.RemoveBatchQ()`
* adds optional relation target argument to most `MapX` methods
* adds `FilterX.Filter()` to get an `ecs.Filter` from a generic one

Run Details

6036 of 6036 relevant lines covered (100.0%)

53013.97 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,838,350✔
17	chunk, bit := bit/wordSize, bit%wordSize	2,838,350✔
18	if value {	2,868,845✔
19	b.data[chunk] \|= uint64(1 << bit)	30,495✔
20	} else {	2,838,350✔
21	b.data[chunk] &= uint64(^(1 << bit))	2,807,855✔
22	}	2,807,855✔
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,827✔
34	chunks, bit := length/wordSize, length%wordSize	32,827✔
35	if bit > 0 {	37,997✔
36	chunks++	5,170✔
37	}	5,170✔
38	if len(b.data) >= chunks {	65,336✔
39	return	32,509✔
40	}	32,509✔
41
42	old := b.data	318✔
43	b.data = make([]uint64, chunks)	318✔
44		318✔
45	copy(b.data, old)	318✔
46	}

mlange-42 / arche / 7577189746

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