/
i2data.go
117 lines (108 loc) · 2.15 KB
/
i2data.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
package main
import (
"errors"
"fmt"
"os"
mmap "github.com/edsrzf/mmap-go"
)
func RunI16(filename string, ncols int, nrows int, fun func([]int16, int, int) error) error {
f, e := os.Open(filename)
if e != nil {
return e
}
defer f.Close()
m, e := mmap.Map(f, mmap.RDONLY, 0)
if e != nil {
return e
}
defer m.Unmap()
fs := unsafeBytesAsInt16([]byte(m))
if len(fs) != ncols*nrows {
return errors.New("Dimensions don't match to data size")
}
return fun(fs, ncols, nrows)
}
func DumpI16(fs []int16, ncols int, nrows int) error {
rbase := 0
var dmin, dmax, dnum, errD, min, max, ldmin, ldmax int32
var dsum int64
var dminC, dminR, dmaxC, dmaxR int
var maxErr float64
var arr [2000]int
for row := 0; row < nrows; row++ {
prev := int32(fs[rbase+0])
for col := 0; col < ncols; col++ {
x := int32(fs[rbase+col])
d := x - prev
if d < dmin {
dmin = d
dminC = col
dminR = row
}
if d > dmax {
dmax = d
dmaxC = col
dmaxR = row
}
if prev >= 0 && x >= 0 {
if d < ldmin {
ldmin = d
}
if d > ldmax {
ldmax = d
}
}
dnum++
dsum += int64(d)
/*
ev := math.Abs(float64(half.From32(d).To32() - d))
if ev > maxErr {
maxErr = ev
errD = d
}
*/
aidx := int(d/10) + 500
if aidx >= len(arr) {
aidx = len(arr) - 1
}
if aidx < 0 {
aidx = 0
}
arr[aidx]++
prev = int32(fs[rbase+col])
if prev < min {
min = prev
}
if prev > max {
max = prev
}
}
rbase += ncols
}
fmt.Println("min/max", min, max)
fmt.Println("ldmin/ldmax", ldmin, ldmax)
fmt.Println("dmin", dmin, "at", dminC, dminR)
fmt.Println("dmax", dmax, "at", dmaxC, dmaxR)
fmt.Println("num", dnum)
fmt.Println("sum", dsum)
fmt.Println("avg", dsum/int64(dnum))
fmt.Println("err16", maxErr, "from", errD)
fmt.Println("\n\nmin")
for c := dminC - 4; c < dminC+3; c++ {
fmt.Print(fs[(dminR*ncols)+c], " ")
}
fmt.Println("\n\nmax")
for c := dmaxC - 4; c < dmaxC+3; c++ {
fmt.Print(fs[(dmaxR*ncols)+c], " ")
}
fmt.Println()
/*
fmt.Println("\n\narr")
for i, v := range arr {
if v > 1 {
fmt.Printf("%5d %d\n", (i-500)*10, v)
}
}
*/
return nil
}