mirror of
https://github.com/vocdoni/arbo.git
synced 2026-01-10 06:17:58 -05:00
0b2c3b07ed
- Update public methods signatures - Remove 'lastAccess' param - Add option to pass root for tree.Dump, Iterate, IterateWithStop, Graphviz (and related) - Move error messages to const defined error messages for external usage
27 lines
693 B
Go
27 lines
693 B
Go
package arbo
|
|
|
|
import "math/big"
|
|
|
|
// SwapEndianness swaps the order of the bytes in the byte slice.
|
|
func SwapEndianness(b []byte) []byte {
|
|
o := make([]byte, len(b))
|
|
for i := range b {
|
|
o[len(b)-1-i] = b[i]
|
|
}
|
|
return o
|
|
}
|
|
|
|
// BigIntToBytes converts a *big.Int into a byte array in Little-Endian
|
|
func BigIntToBytes(blen int, bi *big.Int) []byte {
|
|
// var b [blen]byte // TODO make the length depending on the tree.hashFunction.Len()
|
|
b := make([]byte, blen)
|
|
copy(b[:], SwapEndianness(bi.Bytes()))
|
|
return b[:]
|
|
}
|
|
|
|
// BytesToBigInt converts a byte array in Little-Endian representation into
|
|
// *big.Int
|
|
func BytesToBigInt(b []byte) *big.Int {
|
|
return new(big.Int).SetBytes(SwapEndianness(b))
|
|
}
|