12290622555

Committed 12 Dec 2024 05:46AM UTC coverage: 75.942% (-0.02%) from 75.964%

Build # 12290622555

Build Type

push

github

Committed by

shamcode

Commit Message

Add iter.Seq to Iterator

Run Details

4 of 6 new or added lines in 1 file covered. (66.67%)

1875 of 2469 relevant lines covered (75.94%)

38.78 hits per line

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

85.71

/executor/iterator.go

package executor

import (
        "context"
        "iter"

        "github.com/shamcode/simd/record"
)

type Iterator[R record.Record] interface {
        Next(ctx context.Context) bool
        Item() R
        Size() int
        Err() error
        Seq(ctx context.Context) iter.Seq[R]
}

type heapIterator[R record.Record] struct {
        from      int
        index     int
        max       int
        size      int
        heap      *binaryHeap[R]
        lastError error
}

func (i *heapIterator[R]) Next(ctx context.Context) bool {
        select {
        case <-ctx.Done():
                i.lastError = ctx.Err()
                return false
        default:
                result := i.index < i.max
                if result {
                        i.index += 1
                }
                return result
        }
}

func (i *heapIterator[R]) Item() R {
        return i.heap.Remove(i.from)
}

func (i *heapIterator[R]) Err() error {
        return i.lastError
}

func (i *heapIterator[R]) Size() int {
        return i.size
}

func (i *heapIterator[R]) Seq(ctx context.Context) iter.Seq[R] {
        return func(yield func(R) bool) {
                for i.Next(ctx) {
                        if !yield(i.Item()) {
                                return
                        }
                }
        }
}

func newHeapIterator[R record.Record](heap *binaryHeap[R], from, to, size int) Iterator[R] {
        return &heapIterator[R]{ //nolint:exhaustruct
                from:  from,
                index: from,
                max:   to,
                size:  size,
                heap:  heap,
        }
}

1	package executor
2
3	import (
4	"context"
5	"iter"
6
7	"github.com/shamcode/simd/record"
8	)
9
10	type Iterator[R record.Record] interface {
11	Next(ctx context.Context) bool
12	Item() R
13	Size() int
14	Err() error
15	Seq(ctx context.Context) iter.Seq[R]
16	}
17
18	type heapIterator[R record.Record] struct {
19	from int
20	index int
21	max int
22	size int
23	heap *binaryHeap[R]
24	lastError error
25	}
26
27	func (i *heapIterator[R]) Next(ctx context.Context) bool {	173✔
28	select {	173✔
29	case <-ctx.Done():	×
30	i.lastError = ctx.Err()	×
31	return false	×
32	default:	173✔
33	result := i.index < i.max	173✔
34	if result {	292✔
35	i.index += 1	119✔
36	}	119✔
37	return result	173✔
38	}
39	}
40
41	func (i *heapIterator[R]) Item() R {	120✔
42	return i.heap.Remove(i.from)	120✔
43	}	120✔
44
45	func (i *heapIterator[R]) Err() error {	34✔
46	return i.lastError	34✔
47	}	34✔
48
49	func (i *heapIterator[R]) Size() int {	52✔
50	return i.size	52✔
51	}	52✔
52
53	func (i *heapIterator[R]) Seq(ctx context.Context) iter.Seq[R] {	21✔
54	return func(yield func(R) bool) {	42✔
55	for i.Next(ctx) {	71✔
56	if !yield(i.Item()) {	50✔
NEW 57	return	×
NEW 58	}	×
59	}
60	}
61	}
62
63	func newHeapIterator[R record.Record](heap *binaryHeap[R], from, to, size int) Iterator[R] {	78✔
64	return &heapIterator[R]{ //nolint:exhaustruct	78✔
65	from: from,	78✔
66	index: from,	78✔
67	max: to,	78✔
68	size: size,	78✔
69	heap: heap,	78✔
70	}	78✔
71	}	78✔

shamcode / simd / 12290622555

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