/
lebig_private.go
81 lines (69 loc) · 1.6 KB
/
lebig_private.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
package lebig
import (
"math/bits"
)
//-------------------------------------------
func sizeInWordsFromBits(sizeInBits uint) uint {
lenInWords := sizeInBits / uint(64)
if sizeInBits%64 != 0 {
lenInWords++
}
return lenInWords
}
func sizeInWordsFromBytes(sizeInBytes uint) uint {
lenInWords := sizeInBytes / uint(8)
if sizeInBytes%8 != 0 {
lenInWords++
}
return lenInWords
}
func sizeInBytes(sizeInBits uint) uint {
lenInBytes := sizeInBits / 8
if sizeInBits%8 != 0 {
lenInBytes++
}
return lenInBytes
}
func recalcSizeInBytes(inWords []uint64) (outSizeInBytes uint) {
lastLenBits := bits.Len64(inWords[len(inWords)-1])
lastlenBytes := sizeInBytes(uint(lastLenBits))
if len(inWords) > 0 {
if lastLenBits > 0 {
outSizeInBytes = uint((len(inWords) * 8) - 8 + int(lastlenBytes))
} else {
outSizeInBytes = uint(len(inWords) * 8)
}
} else {
outSizeInBytes = 0
}
return outSizeInBytes
}
func RemoveMostSignificantZeroesFromBytes(in []byte) (out []byte) {
removeMostSignificantZeros := true
removeCounter := 0
for i := len(in) - 1; i >= 0; i-- {
if in[i] == 0 && removeMostSignificantZeros {
removeCounter++
} else {
removeMostSignificantZeros = false
}
}
out = in[0 : len(in)-removeCounter]
if len(out) == 0 {
return in[0:1]
}
return out
}
func RemoveMostSignificantZeroesFromWords(in []uint64) (out []uint64) {
removeMostSignificantZeros := true
removeCounter := 0
for i := len(in) - 1; i >= 0; i-- {
if in[i] == 0 && removeMostSignificantZeros {
removeCounter++
} else {
removeMostSignificantZeros = false
}
}
out = in[0 : len(in)-removeCounter]
return out
}