-
-
Notifications
You must be signed in to change notification settings - Fork 7
/
test.js
109 lines (90 loc) · 3.06 KB
/
test.js
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
var tape = require('tape')
var bitfield = require('bitfield')
var rle = require('./')
tape('encodes and decodes', function (t) {
var bits = bitfield(1024)
var deflated = rle.encode(bits.buffer)
t.ok(deflated.length < bits.buffer.length, 'is smaller')
var inflated = rle.decode(deflated)
t.same(inflated, trim(bits.buffer), 'decodes to same buffer')
t.end()
})
tape('encodingLength', function (t) {
var bits = bitfield(1024)
var len = rle.encodingLength(bits.buffer)
t.ok(len < bits.buffer.length, 'is smaller')
var deflated = rle.encode(bits.buffer)
t.same(len, deflated.length, 'encoding length is similar to encoded buffers length')
t.end()
})
tape('encodes and decodes with all bits set', function (t) {
var bits = bitfield(1024)
for (var i = 0; i < 1024; i++) bits.set(i, true)
var deflated = rle.encode(bits.buffer)
t.ok(deflated.length < bits.buffer.length, 'is smaller')
var inflated = rle.decode(deflated)
t.same(inflated, trim(bits.buffer), 'decodes to same buffer')
t.end()
})
tape('encodes and decodes with some bits set', function (t) {
var bits = bitfield(1024)
bits.set(500, true)
bits.set(501, true)
bits.set(502, true)
bits.set(999, true)
bits.set(1000, true)
bits.set(0, true)
var deflated = rle.encode(bits.buffer)
t.ok(deflated.length < bits.buffer.length, 'is smaller')
var inflated = rle.decode(deflated)
t.same(inflated, trim(bits.buffer), 'decodes to same buffer')
t.end()
})
tape('encodes and decodes with random bits set', function (t) {
var bits = bitfield(8 * 1024)
for (var i = 0; i < 512; i++) {
bits.set(Math.floor(Math.random() * 8 * 1024), true)
}
var deflated = rle.encode(bits.buffer)
t.ok(deflated.length < bits.buffer.length, 'is smaller')
var inflated = rle.decode(deflated)
t.same(inflated, trim(bits.buffer), 'decodes to same buffer')
t.end()
})
tape('encodes and decodes with random bits set (not power of two)', function (t) {
var bits = bitfield(8 * 1024)
for (var i = 0; i < 313; i++) {
bits.set(Math.floor(Math.random() * 8 * 1024), true)
}
var deflated = rle.encode(bits.buffer)
t.ok(deflated.length < bits.buffer.length, 'is smaller')
var inflated = rle.decode(deflated)
t.same(inflated, trim(bits.buffer), 'decodes to same buffer')
t.end()
})
tape('encodes empty bitfield', function (t) {
var deflated = rle.encode(new Buffer(0))
var inflated = rle.decode(deflated)
t.same(inflated, new Buffer(0), 'still empty')
t.end()
})
tape('throws on bad input', function (t) {
t.throws(function () {
rle.decode(new Buffer([100]))
}, 'invalid delta count')
t.throws(function () {
rle.decode(new Buffer([10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0]))
}, 'missing delta')
t.end()
})
tape('not power of two', function (t) {
var deflated = rle.encode(new Buffer([255, 255, 255, 240]))
var inflated = rle.decode(deflated)
t.same(inflated, new Buffer([255, 255, 255, 240]), 'output equal to input')
t.end()
})
function trim (b) {
var len = b.length
while (len > 0 && !b[len - 1]) len--
return b.slice(0, len)
}