forked from ryanbressler/CloudForest
-
Notifications
You must be signed in to change notification settings - Fork 0
/
splitter.go
68 lines (55 loc) · 1.43 KB
/
splitter.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
package CloudForest
import (
//"fmt"
)
//Splitter contains fields that can be used to cases by a single feature. The split
//can be either numerical in which case it is defined by the Value field or
//categorical in which case it is defined by the Left and Right fields.
type Splitter struct {
Feature string
Numerical bool
Value float64
Left map[string]bool
}
//func
/*
Split splits a slice of cases into left, right and missing slices without allocating
a new underlying array by sorting cases into left, missing, right order and returning
slices that point to the left and right cases.
*/
func (s *Splitter) Split(fm *FeatureMatrix, cases []int) (l []int, r []int, m []int) {
length := len(cases)
lastleft := -1
lastright := length
swaper := 0
f := fm.Data[fm.Map[s.Feature]]
//Move left cases to the start and right cases to the end so that missing cases end up
//in between.
hasmissing := f.MissingVals()
for i := 0; i < lastright; i++ {
if hasmissing && f.IsMissing(cases[i]) {
continue
}
if f.GoesLeft(cases[i], s) {
lastleft++
if i != lastleft {
swaper = cases[i]
cases[i] = cases[lastleft]
cases[lastleft] = swaper
i--
}
} else {
//Right
lastright--
swaper = cases[i]
cases[i] = cases[lastright]
cases[lastright] = swaper
i--
}
}
//fmt.Println(cases, lastleft, lastright)
l = cases[:lastleft+1]
r = cases[lastright:]
m = cases[lastleft+1 : lastright]
return
}