-
Notifications
You must be signed in to change notification settings - Fork 0
/
filter.go
66 lines (52 loc) · 1.1 KB
/
filter.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
/*
* Copyright (c) 2023, Dana Burkart <dana.burkart@gmail.com>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
package plan
import (
"github.com/dburkart/fossil/pkg/query/ast"
"github.com/dburkart/fossil/pkg/query/types"
"sync"
)
type FilterStage struct {
next Stage
root *ast.DataFunctionNode
input chan []WrappedEntry
once sync.Once
}
func MakeFilterStage(node *ast.DataFunctionNode) *FilterStage {
var f FilterStage
f.input = make(chan []WrappedEntry)
f.root = node
return &f
}
func (f *FilterStage) Chain(next Stage) {
f.next = next
}
func (f *FilterStage) Next() Stage {
return f.next
}
func (f *FilterStage) Add(entries []WrappedEntry) {
f.input <- entries
}
func (f *FilterStage) Finish() {
f.once.Do(func() {
close(f.input)
})
}
func (f *FilterStage) Execute() {
for entries := range f.input {
symbols := make(SymbolMap)
for idx, arg := range f.root.Arguments {
symbols[arg.Value()] = entries[idx].Value()
}
fn := MakeFunction(symbols)
ast.Walk(&fn, f.root)
allowed := types.BooleanVal(fn.Result[0])
if allowed {
f.Next().Add(entries)
}
}
f.Next().Finish()
}