-
Notifications
You must be signed in to change notification settings - Fork 35
/
unique_obj_finder.go
134 lines (106 loc) · 2.28 KB
/
unique_obj_finder.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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
// Copyright 2017 The go-hep Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package fads
import (
"reflect"
"go-hep.org/x/hep/fwk"
)
type ObjPair struct {
In string
Out string
}
type UniqueObjectFinder struct {
fwk.TaskBase
colls []ObjPair
}
func (tsk *UniqueObjectFinder) Configure(ctx fwk.Context) error {
var err error
for _, pair := range tsk.colls {
err = tsk.DeclInPort(pair.In, reflect.TypeOf([]Candidate{}))
if err != nil {
return err
}
err = tsk.DeclOutPort(pair.Out, reflect.TypeOf([]Candidate{}))
if err != nil {
return err
}
}
return err
}
func (tsk *UniqueObjectFinder) StartTask(ctx fwk.Context) error {
var err error
return err
}
func (tsk *UniqueObjectFinder) StopTask(ctx fwk.Context) error {
var err error
return err
}
func (tsk *UniqueObjectFinder) Process(ctx fwk.Context) error {
var err error
store := ctx.Store()
type Pair struct {
In []Candidate
Out []Candidate
}
colls := make([]Pair, 0, len(tsk.colls))
for i, pair := range tsk.colls {
v, err2 := store.Get(pair.In)
if err2 != nil {
return err2
}
input := v.([]Candidate)
output := make([]Candidate, 0, len(input))
colls = append(colls, Pair{
In: input,
Out: output,
})
defer func(i int) {
err2 := store.Put(tsk.colls[i].Out, colls[i].Out)
if err2 != nil {
err = err2
}
}(i)
}
for icol := range colls {
pair := &colls[icol]
input := pair.In
output := pair.Out
for i := range input {
cand := &input[i]
unique := false
uniqueloop:
for jcol := 0; jcol < icol; jcol++ {
jcands := colls[jcol].In
for j := range jcands {
jcand := &jcands[j]
if cand.Overlaps(jcand) {
unique = true
break uniqueloop
}
}
}
if !unique {
continue
}
output = append(output, *cand)
}
pair.Out = output
}
return err
}
func newUniqueObjectFinder(typ, name string, mgr fwk.App) (fwk.Component, error) {
var err error
tsk := &UniqueObjectFinder{
TaskBase: fwk.NewTask(typ, name, mgr),
colls: make([]ObjPair, 0),
}
err = tsk.DeclProp("Keys", &tsk.colls)
if err != nil {
return nil, err
}
return tsk, err
}
func init() {
fwk.Register(reflect.TypeOf(UniqueObjectFinder{}), newUniqueObjectFinder)
}