-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathreact.go
More file actions
102 lines (89 loc) · 1.84 KB
/
react.go
File metadata and controls
102 lines (89 loc) · 1.84 KB
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
package main
import (
"fmt"
)
type buffers struct {
value string
age int
stale bool
react int
}
const ARRMAX = 7 // Arbitrary buffer size
var ageval int
func main() {
const newinput = "Z"
var buffer = [ARRMAX]buffers{}
var alphabet []string
ageval = 1
for i := 1; i <= ARRMAX; i++ {
alphabet = append(alphabet, string('a'-1+i))
}
for x := range buffer {
buffer[x].value = alphabet[x]
buffer[x].age = ageval
buffer[x].stale = false
ageval++
}
alphabet = alphabet[:0]
for i := 1; i <= ARRMAX; i++ {
alphabet = append(alphabet, string('j'-1+i))
}
fmt.Println(buffer)
for x := range buffer {
if !findspace(buffer) {
buffer = removeoldest(buffer)
}
buffer = writebuffer(buffer, alphabet[x])
fmt.Println(buffer)
buffer = react(buffer)
}
}
func react(buffer [ARRMAX]buffers) [ARRMAX]buffers {
// f := 0
for i := 0; i < len(buffer); i++ {
if buffer[i].stale == true {
fmt.Printf("Field updated: %v\n", buffer[i].value)
buffer = reactoperation(buffer, i)
buffer[i].stale = false
}
}
return buffer
}
func reactoperation(buffer [ARRMAX]buffers, i int) [ARRMAX]buffers {
buffer[i].react = buffer[i].age * ARRMAX
return buffer
}
func writebuffer(buffer [ARRMAX]buffers, new string) [ARRMAX]buffers {
for i := 0; i < len(buffer); i++ {
if buffer[i].age == 0 {
buffer[i].age = ageval
buffer[i].value = new
buffer[i].stale = true
break
}
}
ageval++
return buffer
}
func findspace(buffer [ARRMAX]buffers) bool {
findspace := false
for i := 0; i < len(buffer); i++ {
if buffer[i].age == 0 {
findspace = true
break
}
}
return findspace
}
func removeoldest(buffer [ARRMAX]buffers) [ARRMAX]buffers {
oldestidx := 9999999
arridx := 0
for i := 0; i < len(buffer); i++ {
if buffer[i].age < oldestidx {
oldestidx = buffer[i].age
arridx = i
}
}
buffer[arridx].age = 0
return buffer
}