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
|
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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
|
-
+
+
+
+
+
+
+
+
-
+
-
-
-
+
+
-
+
-
-
+
+
-
+
-
+
-
+
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
|
// Package provides a shifted, reversed fibonacci encoding of unsigned integers.
// Package provides a shifted fibonacci encoding of unsigned integers.
//
// http://en.wikipedia.org/wiki/Fibonacci_coding maps positive integers as
// 1 - 11, 2 - 011, 3 - 0011, 4 - 1011, 5 - 00011
//
// Incrementing input by one to allow for zero gives
// 0 - 11, 1 - 011, 2 - 0011, 3 - 1011, 4 - 00011
//
// The codes are then reversed so that they are easily stored in uints
// 0 - 11, 1 - 110, 2 - 1100, 3 - 1101, 4 - 11000
// (so that they are always comparable with each other as there is no need to
// store the leading number of zeroes which are otherwise required)
package fibonacci
import (
_ "fmt"
"io"
)
type Numbers []uint64
// Returns a slice with fibonacci numbers up to the given length
func New(size int) Numbers {
var fibs Numbers = make(Numbers, size)
copy(fibs, []uint64{1, 1})
for i := 2; i < size; i++ {
fibs[i] = fibs[i-1] + fibs[i-2]
}
return fibs
}
// Returns a fibonacci code for an integer as specified in the package's doc.
func (f Numbers) Code(value uint64) (result uint64) {
func (f Numbers) Code(value uint64) (result uint64, length byte) {
// Increment to encode zero as one
value++
// Find the nearest fibonacci number
i := 0
for f[i+1] <= value {
i++
for ; i >= 1; i-- {
for i := length - 1; i >= 1; i-- {
result <<= 1
if f[i] <= value {
result |= 1
value -= f[i]
}
}
return
}
// Returns an integer from a fibonacci code as specified in the package's doc.
func (f Numbers) Decode(value uint64) (result uint64) {
i := 1
func (f Numbers) Decode(value uint64) (result uint64, length byte) {
length = 1
// Loop until the lowest two bits are both raised
for (value & 3) != 3 {
// Add the fibonacci number for the current bit if it is raised
if (value & 1) == 1 {
result += f[i]
result += f[length]
// We know that the next bit cannot be raised by Zeckendorf's theorem
value >>= 2
i += 2
length += 2
continue
}
value >>= 1
i++
length++
}
result += f[i] - 1
result += f[length] - 1
return
}
func Writer(target io.Writer) io.Writer {
var enc encoder
enc.Numbers = New(16)
enc.target = target
enc.buffer = enc.backing[:0:len(enc.backing)]
return &enc
}
type encoder struct {
Numbers
target io.Writer
backing [3]byte // TODO - verify that this can be reduced to 2 bytes
buffer []byte
remaining byte
length byte
}
func (e *encoder) Write(input []byte) (int, error) {
var (
total int
err error
)
// Flush on a nil slice
if input == nil {
e.backing[0] = byte(e.remaining)
_, err = e.target.Write(e.buffer[:1])
return 0, err
}
for _, currentByte := range input {
// Get the fibonacci code and bit length for the current byte
enc, len := e.Code(uint64(currentByte))
// Add current bits to higher positions
e.remaining |= byte(enc << e.length)
// maximum length of added bits to e.remaining
added := 8 - e.length
// Shift the the encoded value and account for its length
enc >>= added
e.length += len
len -= added
// Not enough bits to write
if e.length < 8 {
continue
}
// Clearing e.length is not necessary as it will be overwritten later
// Stage the complete byte for writing
e.buffer = append(e.buffer, byte(e.remaining))
// Stage every full byte from the encoded value for writing
for enc > 128 {
e.buffer = append(e.buffer, byte(enc))
enc >>= 8
len -= 8
}
// Store the remaining bits
e.remaining, e.length = byte(enc), len
// Write the staged bytes
_, err = e.target.Write(e.buffer)
// Abort write on error
if err != nil {
break
}
// Account for the just-written byte
total++
// Clear the buffer
e.buffer = e.buffer[:0]
}
return total, err
}
// func Reader(source io.Reader) io.Reader {
// var dec decoder
// dec.Numbers = New(16)
// dec.source = source
// return &dec
// }
// type decoder struct {
// Numbers
// source io.Reader
// buffer uint64
// at byte
// }
// func (d *decoder) Read(output []byte) (int, error) {
// return 0, nil
// }
|