Overview
Comment: | Added encoding/fibonacci (cc: 100%) |
---|---|
Downloads: | Tarball | ZIP archive | SQL archive |
Timelines: | family | ancestors | descendants | both | trunk |
Files: | files | file ages | folders |
SHA1: |
7a1684ea05c2226b8ed1c63840808e17 |
User & Date: | spaskalev on 2014-12-30 14:03:58 |
Other Links: | manifest | tags |
Context
2014-12-30
| ||
15:01 | Minor opmitization to fibonacci's decoding. Changed plaindiff to show line numbers starting from 1. check-in: 9f5054e305 user: spaskalev tags: trunk | |
14:03 | Added encoding/fibonacci (cc: 100%) check-in: 7a1684ea05 user: spaskalev tags: trunk | |
2014-12-28
| ||
18:06 | [mtf] Removed :to indices from copy(..) destinations. check-in: c07658474d user: spaskalev tags: trunk | |
Changes
Added src/0dev.org/encoding/fibonacci/fib.go version [bab2f5c2b7].
> > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | 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 | // Package provides a shifted, reversed fibonacci encoding of bytes // // http://en.wikipedia.org/wiki/Fibonacci_coding maps positive integers as // 1 - 11, 2 - 011, 3 - 0011, 4 - 1011, 5 - 00011 // // Incrementing input bytes 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 package fibonacci type Numbers []uint64 // Returns the n-th fibonacci number // The result is stored after calculation func (f Numbers) Nth(index int) uint64 { switch { case index <= 1: return 1 case f[index] > 0: break default: f[index] = f.Nth(index-1) + f.Nth(index-2) } return f[index] } // Returns a fibonacci code for an integer as specified in the package doc. func (f Numbers) Code(value uint64) (result uint64) { // Increment to encode zero as one value++ // Find the nearest fibonacci number i := 0 for f.Nth(i+1) <= value { i++ } // Leading bit that signals the start of a fibonacci-encoded integer result |= 1 // Find the Zeckendorf's representation by raising a bit for each // fibonacci number that is less or equal to the difference // between the value and the previous such number for ; i >= 1; i-- { result <<= 1 if f.Nth(i) <= value { result |= 1 value -= f.Nth(i) } } return } // Returns an integer from a fibonacci code as specified in the package doc. func (f Numbers) Decode(value uint64) (result uint64) { i := 1 for (value & 3) != 3 { if (value & 1) == 1 { result += f.Nth(i) } value >>= 1 i++ } result += f.Nth(i) - 1 return } |
Added src/0dev.org/encoding/fibonacci/fib_test.go version [5949178ed8].
> > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | 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 | package fibonacci import ( "testing" ) func TestNumbers(t *testing.T) { n := make(Numbers, 32) expected := []uint64{1, 1, 2, 3, 5, 8, 13, 21} for i, v := range expected { if f := n.Nth(i); f != v { t.Error("Unexpected value for", i, f, "expected", v) } } } func TestCoding(t *testing.T) { n := make(Numbers, 32) for i := uint64(0); i < 1024; i++ { enc := n.Code(i) dec := n.Decode(enc) if i != dec { t.Errorf("Unexpected value for %d - enc is %b, dec is %d\n", i, enc, dec) } } } |