deno.land / std@0.166.0 / node / _tools / test / parallel / test-zlib-random-byte-pipes.js

test-zlib-random-byte-pipes.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
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
// deno-fmt-ignore-file// deno-lint-ignore-file
// Copyright Joyent and Node contributors. All rights reserved. MIT license.// Taken from Node 16.13.0// This file is automatically generated by "node/_tools/setup.ts". Do not modify this file manually
// Copyright Joyent, Inc. and other Node contributors.//// Permission is hereby granted, free of charge, to any person obtaining a// copy of this software and associated documentation files (the// "Software"), to deal in the Software without restriction, including// without limitation the rights to use, copy, modify, merge, publish,// distribute, sublicense, and/or sell copies of the Software, and to permit// persons to whom the Software is furnished to do so, subject to the// following conditions://// The above copyright notice and this permission notice shall be included// in all copies or substantial portions of the Software.//// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE// USE OR OTHER DEALINGS IN THE SOFTWARE.
'use strict';const common = require('../common');if (!common.hasCrypto) common.skip('missing crypto');
const assert = require('assert');const crypto = require('crypto');const stream = require('stream');const zlib = require('zlib');
const Stream = stream.Stream;
// Emit random bytes, and keep a shasumclass RandomReadStream extends Stream { constructor(opt) { super();
this.readable = true; this._paused = false; this._processing = false;
this._hasher = crypto.createHash('sha1'); opt = opt || {};
// base block size. opt.block = opt.block || 256 * 1024;
// Total number of bytes to emit opt.total = opt.total || 256 * 1024 * 1024; this._remaining = opt.total;
// How variable to make the block sizes opt.jitter = opt.jitter || 1024;
this._opt = opt;
this._process = this._process.bind(this);
process.nextTick(this._process); }
pause() { this._paused = true; this.emit('pause'); }
resume() { // console.error("rrs resume"); this._paused = false; this.emit('resume'); this._process(); }
_process() { if (this._processing) return; if (this._paused) return;
this._processing = true;
if (!this._remaining) { this._hash = this._hasher.digest('hex').toLowerCase().trim(); this._processing = false;
this.emit('end'); return; }
// Figure out how many bytes to output // if finished, then just emit end. let block = this._opt.block; const jitter = this._opt.jitter; if (jitter) { block += Math.ceil(Math.random() * jitter - (jitter / 2)); } block = Math.min(block, this._remaining); const buf = Buffer.allocUnsafe(block); for (let i = 0; i < block; i++) { buf[i] = Math.random() * 256; }
this._hasher.update(buf);
this._remaining -= block;
this._processing = false;
this.emit('data', buf); process.nextTick(this._process); }}
// A filter that just verifies a shasumclass HashStream extends Stream { constructor() { super(); this.readable = this.writable = true; this._hasher = crypto.createHash('sha1'); }
write(c) { // Simulate the way that an fs.ReadStream returns false // on *every* write, only to resume a moment later. this._hasher.update(c); process.nextTick(() => this.resume()); return false; }
resume() { this.emit('resume'); process.nextTick(() => this.emit('drain')); }
end(c) { if (c) { this.write(c); } this._hash = this._hasher.digest('hex').toLowerCase().trim(); this.emit('data', this._hash); this.emit('end'); }}
for (const [ createCompress, createDecompress ] of [ [ zlib.createGzip, zlib.createGunzip ], // TODO(kt3k): Enable this when we support brotli in zlib // [ zlib.createBrotliCompress, zlib.createBrotliDecompress ],]) { const inp = new RandomReadStream({ total: 1024, block: 256, jitter: 16 }); const out = new HashStream(); const gzip = createCompress(); const gunz = createDecompress();
inp.pipe(gzip).pipe(gunz).pipe(out);
out.on('data', common.mustCall((c) => { assert.strictEqual(c, inp._hash, `Hash '${c}' equals '${inp._hash}'.`); }));}
std

Version Info

Tagged at
a year ago