@aws-sdk/sha256-tree-hash 3.29.0 → 3.36.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +38 -0
- package/dist-cjs/index.js +77 -0
- package/dist-es/index.js +94 -0
- package/{dist/types → dist-types}/index.d.ts +0 -0
- package/{dist/types → dist-types}/ts3.4/index.d.ts +0 -0
- package/package.json +16 -12
- package/dist/cjs/index.js +0 -109
- package/dist/es/index.js +0 -125
- package/src/index.ts +0 -119
- package/tsconfig.cjs.json +0 -10
- package/tsconfig.es.json +0 -11
package/CHANGELOG.md
CHANGED
|
@@ -3,6 +3,44 @@
|
|
|
3
3
|
All notable changes to this project will be documented in this file.
|
|
4
4
|
See [Conventional Commits](https://conventionalcommits.org) for commit guidelines.
|
|
5
5
|
|
|
6
|
+
# [3.36.0](https://github.com/aws/aws-sdk-js-v3/compare/v3.35.0...v3.36.0) (2021-10-08)
|
|
7
|
+
|
|
8
|
+
|
|
9
|
+
### Features
|
|
10
|
+
|
|
11
|
+
* publish files in dist-* only ([#2873](https://github.com/aws/aws-sdk-js-v3/issues/2873)) ([53b4243](https://github.com/aws/aws-sdk-js-v3/commit/53b4243b066f25ff2412d5f0dea1036054b2df32))
|
|
12
|
+
|
|
13
|
+
|
|
14
|
+
|
|
15
|
+
|
|
16
|
+
|
|
17
|
+
# [3.35.0](https://github.com/aws/aws-sdk-js-v3/compare/v3.34.0...v3.35.0) (2021-10-04)
|
|
18
|
+
|
|
19
|
+
**Note:** Version bump only for package @aws-sdk/sha256-tree-hash
|
|
20
|
+
|
|
21
|
+
|
|
22
|
+
|
|
23
|
+
|
|
24
|
+
|
|
25
|
+
# [3.34.0](https://github.com/aws/aws-sdk-js-v3/compare/v3.33.0...v3.34.0) (2021-09-24)
|
|
26
|
+
|
|
27
|
+
|
|
28
|
+
### Features
|
|
29
|
+
|
|
30
|
+
* **non-clients:** remove comments from transpiled JS files ([#2813](https://github.com/aws/aws-sdk-js-v3/issues/2813)) ([e6fc7f3](https://github.com/aws/aws-sdk-js-v3/commit/e6fc7f3e0fa74785590ac19e7ed143c916bb9b6e))
|
|
31
|
+
|
|
32
|
+
|
|
33
|
+
|
|
34
|
+
|
|
35
|
+
|
|
36
|
+
# [3.32.0](https://github.com/aws/aws-sdk-js-v3/compare/v3.31.0...v3.32.0) (2021-09-17)
|
|
37
|
+
|
|
38
|
+
**Note:** Version bump only for package @aws-sdk/sha256-tree-hash
|
|
39
|
+
|
|
40
|
+
|
|
41
|
+
|
|
42
|
+
|
|
43
|
+
|
|
6
44
|
# [3.29.0](https://github.com/aws/aws-sdk-js-v3/compare/v3.28.0...v3.29.0) (2021-09-02)
|
|
7
45
|
|
|
8
46
|
**Note:** Version bump only for package @aws-sdk/sha256-tree-hash
|
|
@@ -0,0 +1,77 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.TreeHash = void 0;
|
|
4
|
+
const MiB = 1048576;
|
|
5
|
+
class TreeHash {
|
|
6
|
+
constructor(Sha256, fromUtf8) {
|
|
7
|
+
this.Sha256 = Sha256;
|
|
8
|
+
this.fromUtf8 = fromUtf8;
|
|
9
|
+
this.collectedHashDigests = [];
|
|
10
|
+
}
|
|
11
|
+
hashBuffer() {
|
|
12
|
+
if (!this.buffer) {
|
|
13
|
+
return;
|
|
14
|
+
}
|
|
15
|
+
let remainingSize = this.buffer.byteLength;
|
|
16
|
+
while (remainingSize >= MiB) {
|
|
17
|
+
const hash = new this.Sha256();
|
|
18
|
+
hash.update(this.buffer.subarray(0, MiB));
|
|
19
|
+
this.collectedHashDigests.push(hash.digest());
|
|
20
|
+
this.buffer = this.buffer.subarray(MiB);
|
|
21
|
+
remainingSize = this.buffer.byteLength;
|
|
22
|
+
}
|
|
23
|
+
}
|
|
24
|
+
update(data) {
|
|
25
|
+
const chunk = this.convertToBuffer(data);
|
|
26
|
+
if (!this.buffer) {
|
|
27
|
+
this.buffer = chunk;
|
|
28
|
+
}
|
|
29
|
+
else {
|
|
30
|
+
const totalSize = this.buffer.byteLength + chunk.byteLength;
|
|
31
|
+
const tempBuffer = new Uint8Array(totalSize);
|
|
32
|
+
tempBuffer.set(this.buffer);
|
|
33
|
+
tempBuffer.set(chunk, this.buffer.byteLength);
|
|
34
|
+
this.buffer = tempBuffer;
|
|
35
|
+
}
|
|
36
|
+
this.hashBuffer();
|
|
37
|
+
}
|
|
38
|
+
async digest() {
|
|
39
|
+
let collectedHashDigests = this.collectedHashDigests;
|
|
40
|
+
this.collectedHashDigests = [];
|
|
41
|
+
if (this.buffer && this.buffer.byteLength > 0) {
|
|
42
|
+
const smallHash = new this.Sha256();
|
|
43
|
+
smallHash.update(this.buffer);
|
|
44
|
+
collectedHashDigests.push(smallHash.digest());
|
|
45
|
+
this.buffer = void 0;
|
|
46
|
+
}
|
|
47
|
+
while (collectedHashDigests.length > 1) {
|
|
48
|
+
const higherLevelHashDigests = [];
|
|
49
|
+
for (let i = 0; i < collectedHashDigests.length; i += 2) {
|
|
50
|
+
if (i + 1 < collectedHashDigests.length) {
|
|
51
|
+
const [digest1, digest2] = await Promise.all([collectedHashDigests[i], collectedHashDigests[i + 1]]);
|
|
52
|
+
const chunk = new Uint8Array(digest1.byteLength + digest2.byteLength);
|
|
53
|
+
chunk.set(digest1);
|
|
54
|
+
chunk.set(digest2, digest1.byteLength);
|
|
55
|
+
const hash = new this.Sha256();
|
|
56
|
+
hash.update(chunk);
|
|
57
|
+
higherLevelHashDigests.push(hash.digest());
|
|
58
|
+
}
|
|
59
|
+
else {
|
|
60
|
+
higherLevelHashDigests.push(collectedHashDigests[i]);
|
|
61
|
+
}
|
|
62
|
+
}
|
|
63
|
+
collectedHashDigests = higherLevelHashDigests;
|
|
64
|
+
}
|
|
65
|
+
return collectedHashDigests[0];
|
|
66
|
+
}
|
|
67
|
+
convertToBuffer(data) {
|
|
68
|
+
if (typeof data === "string") {
|
|
69
|
+
return this.fromUtf8(data);
|
|
70
|
+
}
|
|
71
|
+
if (ArrayBuffer.isView(data)) {
|
|
72
|
+
return new Uint8Array(data.buffer, data.byteOffset, data.byteLength / Uint8Array.BYTES_PER_ELEMENT);
|
|
73
|
+
}
|
|
74
|
+
return new Uint8Array(data);
|
|
75
|
+
}
|
|
76
|
+
}
|
|
77
|
+
exports.TreeHash = TreeHash;
|
package/dist-es/index.js
ADDED
|
@@ -0,0 +1,94 @@
|
|
|
1
|
+
import { __awaiter, __generator, __read } from "tslib";
|
|
2
|
+
var MiB = 1048576;
|
|
3
|
+
var TreeHash = (function () {
|
|
4
|
+
function TreeHash(Sha256, fromUtf8) {
|
|
5
|
+
this.Sha256 = Sha256;
|
|
6
|
+
this.fromUtf8 = fromUtf8;
|
|
7
|
+
this.collectedHashDigests = [];
|
|
8
|
+
}
|
|
9
|
+
TreeHash.prototype.hashBuffer = function () {
|
|
10
|
+
if (!this.buffer) {
|
|
11
|
+
return;
|
|
12
|
+
}
|
|
13
|
+
var remainingSize = this.buffer.byteLength;
|
|
14
|
+
while (remainingSize >= MiB) {
|
|
15
|
+
var hash = new this.Sha256();
|
|
16
|
+
hash.update(this.buffer.subarray(0, MiB));
|
|
17
|
+
this.collectedHashDigests.push(hash.digest());
|
|
18
|
+
this.buffer = this.buffer.subarray(MiB);
|
|
19
|
+
remainingSize = this.buffer.byteLength;
|
|
20
|
+
}
|
|
21
|
+
};
|
|
22
|
+
TreeHash.prototype.update = function (data) {
|
|
23
|
+
var chunk = this.convertToBuffer(data);
|
|
24
|
+
if (!this.buffer) {
|
|
25
|
+
this.buffer = chunk;
|
|
26
|
+
}
|
|
27
|
+
else {
|
|
28
|
+
var totalSize = this.buffer.byteLength + chunk.byteLength;
|
|
29
|
+
var tempBuffer = new Uint8Array(totalSize);
|
|
30
|
+
tempBuffer.set(this.buffer);
|
|
31
|
+
tempBuffer.set(chunk, this.buffer.byteLength);
|
|
32
|
+
this.buffer = tempBuffer;
|
|
33
|
+
}
|
|
34
|
+
this.hashBuffer();
|
|
35
|
+
};
|
|
36
|
+
TreeHash.prototype.digest = function () {
|
|
37
|
+
return __awaiter(this, void 0, void 0, function () {
|
|
38
|
+
var collectedHashDigests, smallHash, higherLevelHashDigests, i, _a, digest1, digest2, chunk, hash;
|
|
39
|
+
return __generator(this, function (_b) {
|
|
40
|
+
switch (_b.label) {
|
|
41
|
+
case 0:
|
|
42
|
+
collectedHashDigests = this.collectedHashDigests;
|
|
43
|
+
this.collectedHashDigests = [];
|
|
44
|
+
if (this.buffer && this.buffer.byteLength > 0) {
|
|
45
|
+
smallHash = new this.Sha256();
|
|
46
|
+
smallHash.update(this.buffer);
|
|
47
|
+
collectedHashDigests.push(smallHash.digest());
|
|
48
|
+
this.buffer = void 0;
|
|
49
|
+
}
|
|
50
|
+
_b.label = 1;
|
|
51
|
+
case 1:
|
|
52
|
+
if (!(collectedHashDigests.length > 1)) return [3, 7];
|
|
53
|
+
higherLevelHashDigests = [];
|
|
54
|
+
i = 0;
|
|
55
|
+
_b.label = 2;
|
|
56
|
+
case 2:
|
|
57
|
+
if (!(i < collectedHashDigests.length)) return [3, 6];
|
|
58
|
+
if (!(i + 1 < collectedHashDigests.length)) return [3, 4];
|
|
59
|
+
return [4, Promise.all([collectedHashDigests[i], collectedHashDigests[i + 1]])];
|
|
60
|
+
case 3:
|
|
61
|
+
_a = __read.apply(void 0, [_b.sent(), 2]), digest1 = _a[0], digest2 = _a[1];
|
|
62
|
+
chunk = new Uint8Array(digest1.byteLength + digest2.byteLength);
|
|
63
|
+
chunk.set(digest1);
|
|
64
|
+
chunk.set(digest2, digest1.byteLength);
|
|
65
|
+
hash = new this.Sha256();
|
|
66
|
+
hash.update(chunk);
|
|
67
|
+
higherLevelHashDigests.push(hash.digest());
|
|
68
|
+
return [3, 5];
|
|
69
|
+
case 4:
|
|
70
|
+
higherLevelHashDigests.push(collectedHashDigests[i]);
|
|
71
|
+
_b.label = 5;
|
|
72
|
+
case 5:
|
|
73
|
+
i += 2;
|
|
74
|
+
return [3, 2];
|
|
75
|
+
case 6:
|
|
76
|
+
collectedHashDigests = higherLevelHashDigests;
|
|
77
|
+
return [3, 1];
|
|
78
|
+
case 7: return [2, collectedHashDigests[0]];
|
|
79
|
+
}
|
|
80
|
+
});
|
|
81
|
+
});
|
|
82
|
+
};
|
|
83
|
+
TreeHash.prototype.convertToBuffer = function (data) {
|
|
84
|
+
if (typeof data === "string") {
|
|
85
|
+
return this.fromUtf8(data);
|
|
86
|
+
}
|
|
87
|
+
if (ArrayBuffer.isView(data)) {
|
|
88
|
+
return new Uint8Array(data.buffer, data.byteOffset, data.byteLength / Uint8Array.BYTES_PER_ELEMENT);
|
|
89
|
+
}
|
|
90
|
+
return new Uint8Array(data);
|
|
91
|
+
};
|
|
92
|
+
return TreeHash;
|
|
93
|
+
}());
|
|
94
|
+
export { TreeHash };
|
|
File without changes
|
|
File without changes
|
package/package.json
CHANGED
|
@@ -1,43 +1,47 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@aws-sdk/sha256-tree-hash",
|
|
3
|
-
"version": "3.
|
|
3
|
+
"version": "3.36.0",
|
|
4
4
|
"scripts": {
|
|
5
|
+
"build": "yarn build:cjs && yarn build:es && yarn build:types",
|
|
5
6
|
"build:cjs": "tsc -p tsconfig.cjs.json",
|
|
6
7
|
"build:es": "tsc -p tsconfig.es.json",
|
|
7
|
-
"build": "
|
|
8
|
-
"downlevel-dts": "downlevel-dts dist
|
|
8
|
+
"build:types": "tsc -p tsconfig.types.json",
|
|
9
|
+
"downlevel-dts": "downlevel-dts dist-types dist-types/ts3.4",
|
|
9
10
|
"test": "jest"
|
|
10
11
|
},
|
|
11
|
-
"main": "./dist
|
|
12
|
-
"module": "./dist
|
|
13
|
-
"types": "./dist
|
|
12
|
+
"main": "./dist-cjs/index.js",
|
|
13
|
+
"module": "./dist-es/index.js",
|
|
14
|
+
"types": "./dist-types/index.d.ts",
|
|
14
15
|
"author": {
|
|
15
16
|
"name": "AWS SDK for JavaScript Team",
|
|
16
17
|
"url": "https://aws.amazon.com/javascript/"
|
|
17
18
|
},
|
|
18
19
|
"license": "Apache-2.0",
|
|
19
20
|
"dependencies": {
|
|
20
|
-
"@aws-sdk/types": "3.
|
|
21
|
+
"@aws-sdk/types": "3.36.0",
|
|
21
22
|
"tslib": "^2.3.0"
|
|
22
23
|
},
|
|
23
24
|
"devDependencies": {
|
|
24
25
|
"@aws-crypto/sha256-js": "^1.0.0",
|
|
25
|
-
"@aws-sdk/util-hex-encoding": "3.
|
|
26
|
-
"@aws-sdk/util-utf8-node": "3.
|
|
26
|
+
"@aws-sdk/util-hex-encoding": "3.36.0",
|
|
27
|
+
"@aws-sdk/util-utf8-node": "3.36.0",
|
|
27
28
|
"@types/jest": "^26.0.4",
|
|
28
29
|
"jest": "^26.1.0",
|
|
29
|
-
"typescript": "~4.
|
|
30
|
+
"typescript": "~4.3.5"
|
|
30
31
|
},
|
|
31
32
|
"engines": {
|
|
32
33
|
"node": ">= 10.0.0"
|
|
33
34
|
},
|
|
34
35
|
"typesVersions": {
|
|
35
36
|
"<4.0": {
|
|
36
|
-
"dist
|
|
37
|
-
"dist
|
|
37
|
+
"dist-types/*": [
|
|
38
|
+
"dist-types/ts3.4/*"
|
|
38
39
|
]
|
|
39
40
|
}
|
|
40
41
|
},
|
|
42
|
+
"files": [
|
|
43
|
+
"dist-*"
|
|
44
|
+
],
|
|
41
45
|
"homepage": "https://github.com/aws/aws-sdk-js-v3/tree/main/packages/sha256-tree-hash",
|
|
42
46
|
"repository": {
|
|
43
47
|
"type": "git",
|
package/dist/cjs/index.js
DELETED
|
@@ -1,109 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
exports.TreeHash = void 0;
|
|
4
|
-
const MiB = 1048576;
|
|
5
|
-
/**
|
|
6
|
-
* A Hash that will calculate a Sha256 tree hash.
|
|
7
|
-
*/
|
|
8
|
-
class TreeHash {
|
|
9
|
-
/**
|
|
10
|
-
* Initializes a TreeHash.
|
|
11
|
-
* @param Sha256 A Sha256 hash constructor.
|
|
12
|
-
*/
|
|
13
|
-
constructor(Sha256, fromUtf8) {
|
|
14
|
-
this.Sha256 = Sha256;
|
|
15
|
-
this.fromUtf8 = fromUtf8;
|
|
16
|
-
this.collectedHashDigests = [];
|
|
17
|
-
}
|
|
18
|
-
/**
|
|
19
|
-
* Generates Sha256 hashes from 1 MiB chunks of the
|
|
20
|
-
* internal buffer.
|
|
21
|
-
* Will set the internal buffer to any bytes remaining
|
|
22
|
-
* that is less than 1 MiB.
|
|
23
|
-
*/
|
|
24
|
-
hashBuffer() {
|
|
25
|
-
if (!this.buffer) {
|
|
26
|
-
return;
|
|
27
|
-
}
|
|
28
|
-
let remainingSize = this.buffer.byteLength;
|
|
29
|
-
while (remainingSize >= MiB) {
|
|
30
|
-
const hash = new this.Sha256();
|
|
31
|
-
hash.update(this.buffer.subarray(0, MiB));
|
|
32
|
-
this.collectedHashDigests.push(hash.digest());
|
|
33
|
-
this.buffer = this.buffer.subarray(MiB);
|
|
34
|
-
remainingSize = this.buffer.byteLength;
|
|
35
|
-
}
|
|
36
|
-
}
|
|
37
|
-
/**
|
|
38
|
-
* Updates the tree hash with byte data.
|
|
39
|
-
* @param chunk Byte data to apply to the tree hash.
|
|
40
|
-
*/
|
|
41
|
-
update(data) {
|
|
42
|
-
const chunk = this.convertToBuffer(data);
|
|
43
|
-
if (!this.buffer) {
|
|
44
|
-
this.buffer = chunk;
|
|
45
|
-
}
|
|
46
|
-
else {
|
|
47
|
-
// determine size of both pieces
|
|
48
|
-
const totalSize = this.buffer.byteLength + chunk.byteLength;
|
|
49
|
-
const tempBuffer = new Uint8Array(totalSize);
|
|
50
|
-
tempBuffer.set(this.buffer);
|
|
51
|
-
tempBuffer.set(chunk, this.buffer.byteLength);
|
|
52
|
-
this.buffer = tempBuffer;
|
|
53
|
-
}
|
|
54
|
-
// hasBuffer will set this.buffer with remaining data
|
|
55
|
-
this.hashBuffer();
|
|
56
|
-
}
|
|
57
|
-
/**
|
|
58
|
-
* Calculates the digest for the tree hash.
|
|
59
|
-
*/
|
|
60
|
-
async digest() {
|
|
61
|
-
let collectedHashDigests = this.collectedHashDigests;
|
|
62
|
-
// remove the reference to collected hashes to free up space
|
|
63
|
-
this.collectedHashDigests = [];
|
|
64
|
-
// loop through collected hashes
|
|
65
|
-
if (this.buffer && this.buffer.byteLength > 0) {
|
|
66
|
-
const smallHash = new this.Sha256();
|
|
67
|
-
smallHash.update(this.buffer);
|
|
68
|
-
collectedHashDigests.push(smallHash.digest());
|
|
69
|
-
// remove the remaining buffer
|
|
70
|
-
this.buffer = void 0;
|
|
71
|
-
}
|
|
72
|
-
while (collectedHashDigests.length > 1) {
|
|
73
|
-
const higherLevelHashDigests = [];
|
|
74
|
-
for (let i = 0; i < collectedHashDigests.length; i += 2) {
|
|
75
|
-
if (i + 1 < collectedHashDigests.length) {
|
|
76
|
-
// concatenate the pair of hashes
|
|
77
|
-
const [digest1, digest2] = await Promise.all([collectedHashDigests[i], collectedHashDigests[i + 1]]);
|
|
78
|
-
const chunk = new Uint8Array(digest1.byteLength + digest2.byteLength);
|
|
79
|
-
chunk.set(digest1);
|
|
80
|
-
chunk.set(digest2, digest1.byteLength);
|
|
81
|
-
const hash = new this.Sha256();
|
|
82
|
-
hash.update(chunk);
|
|
83
|
-
higherLevelHashDigests.push(hash.digest());
|
|
84
|
-
}
|
|
85
|
-
else {
|
|
86
|
-
// move a lone hash up a level
|
|
87
|
-
higherLevelHashDigests.push(collectedHashDigests[i]);
|
|
88
|
-
}
|
|
89
|
-
}
|
|
90
|
-
collectedHashDigests = higherLevelHashDigests;
|
|
91
|
-
}
|
|
92
|
-
return collectedHashDigests[0];
|
|
93
|
-
}
|
|
94
|
-
/**
|
|
95
|
-
* Converts source data into a Uint8Array.
|
|
96
|
-
* @param data Data to convert to a Uint8Array.
|
|
97
|
-
*/
|
|
98
|
-
convertToBuffer(data) {
|
|
99
|
-
if (typeof data === "string") {
|
|
100
|
-
return this.fromUtf8(data);
|
|
101
|
-
}
|
|
102
|
-
if (ArrayBuffer.isView(data)) {
|
|
103
|
-
return new Uint8Array(data.buffer, data.byteOffset, data.byteLength / Uint8Array.BYTES_PER_ELEMENT);
|
|
104
|
-
}
|
|
105
|
-
return new Uint8Array(data);
|
|
106
|
-
}
|
|
107
|
-
}
|
|
108
|
-
exports.TreeHash = TreeHash;
|
|
109
|
-
//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;AAEA,MAAM,GAAG,GAAG,OAAO,CAAC;AAEpB;;GAEG;AACH,MAAa,QAAQ;IAInB;;;OAGG;IACH,YAA6B,MAAuB,EAAmB,QAAiB;QAA3D,WAAM,GAAN,MAAM,CAAiB;QAAmB,aAAQ,GAAR,QAAQ,CAAS;QANhF,yBAAoB,GAA0B,EAAE,CAAC;IAMkC,CAAC;IAE5F;;;;;OAKG;IACK,UAAU;QAChB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO;SACR;QAED,IAAI,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC;QAC3C,OAAO,aAAa,IAAI,GAAG,EAAE;YAC3B,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAC1C,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YAE9C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACxC,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC;SACxC;IACH,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,IAAgB;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;SACrB;aAAM;YACL,gCAAgC;YAChC,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;YAC5D,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;YAE7C,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC5B,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC9C,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC;SAC1B;QAED,qDAAqD;QACrD,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,MAAM;QACjB,IAAI,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACrD,4DAA4D;QAC5D,IAAI,CAAC,oBAAoB,GAAG,EAAE,CAAC;QAE/B,gCAAgC;QAChC,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,EAAE;YAC7C,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACpC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC9B,oBAAoB,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;YAC9C,8BAA8B;YAC9B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;SACtB;QAED,OAAO,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE;YACtC,MAAM,sBAAsB,GAA0B,EAAE,CAAC;YACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,oBAAoB,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;gBACvD,IAAI,CAAC,GAAG,CAAC,GAAG,oBAAoB,CAAC,MAAM,EAAE;oBACvC,iCAAiC;oBACjC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBAErG,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;oBACtE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;oBACnB,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;oBAEvC,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;oBAC/B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;oBACnB,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;iBAC5C;qBAAM;oBACL,8BAA8B;oBAC9B,sBAAsB,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;iBACtD;aACF;YACD,oBAAoB,GAAG,sBAAsB,CAAC;SAC/C;QAED,OAAO,oBAAoB,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAED;;;OAGG;IACK,eAAe,CAAC,IAAgB;QACtC,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;YAC5B,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;SAC5B;QAED,IAAI,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YAC5B,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,iBAAiB,CAAC,CAAC;SACrG;QAED,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;CACF;AA/GD,4BA+GC","sourcesContent":["import { Decoder, Hash, HashConstructor, SourceData } from \"@aws-sdk/types\";\n\nconst MiB = 1048576;\n\n/**\n * A Hash that will calculate a Sha256 tree hash.\n */\nexport class TreeHash implements Hash {\n  private buffer?: Uint8Array;\n  private collectedHashDigests: Promise<Uint8Array>[] = [];\n\n  /**\n   * Initializes a TreeHash.\n   * @param Sha256 A Sha256 hash constructor.\n   */\n  constructor(private readonly Sha256: HashConstructor, private readonly fromUtf8: Decoder) {}\n\n  /**\n   * Generates Sha256 hashes from 1 MiB chunks of the\n   * internal buffer.\n   * Will set the internal buffer to any bytes remaining\n   * that is less than 1 MiB.\n   */\n  private hashBuffer() {\n    if (!this.buffer) {\n      return;\n    }\n\n    let remainingSize = this.buffer.byteLength;\n    while (remainingSize >= MiB) {\n      const hash = new this.Sha256();\n      hash.update(this.buffer.subarray(0, MiB));\n      this.collectedHashDigests.push(hash.digest());\n\n      this.buffer = this.buffer.subarray(MiB);\n      remainingSize = this.buffer.byteLength;\n    }\n  }\n\n  /**\n   * Updates the tree hash with byte data.\n   * @param chunk Byte data to apply to the tree hash.\n   */\n  public update(data: SourceData) {\n    const chunk = this.convertToBuffer(data);\n    if (!this.buffer) {\n      this.buffer = chunk;\n    } else {\n      // determine size of both pieces\n      const totalSize = this.buffer.byteLength + chunk.byteLength;\n      const tempBuffer = new Uint8Array(totalSize);\n\n      tempBuffer.set(this.buffer);\n      tempBuffer.set(chunk, this.buffer.byteLength);\n      this.buffer = tempBuffer;\n    }\n\n    // hasBuffer will set this.buffer with remaining data\n    this.hashBuffer();\n  }\n\n  /**\n   * Calculates the digest for the tree hash.\n   */\n  public async digest(): Promise<Uint8Array> {\n    let collectedHashDigests = this.collectedHashDigests;\n    // remove the reference to collected hashes to free up space\n    this.collectedHashDigests = [];\n\n    // loop through collected hashes\n    if (this.buffer && this.buffer.byteLength > 0) {\n      const smallHash = new this.Sha256();\n      smallHash.update(this.buffer);\n      collectedHashDigests.push(smallHash.digest());\n      // remove the remaining buffer\n      this.buffer = void 0;\n    }\n\n    while (collectedHashDigests.length > 1) {\n      const higherLevelHashDigests: Promise<Uint8Array>[] = [];\n      for (let i = 0; i < collectedHashDigests.length; i += 2) {\n        if (i + 1 < collectedHashDigests.length) {\n          // concatenate the pair of hashes\n          const [digest1, digest2] = await Promise.all([collectedHashDigests[i], collectedHashDigests[i + 1]]);\n\n          const chunk = new Uint8Array(digest1.byteLength + digest2.byteLength);\n          chunk.set(digest1);\n          chunk.set(digest2, digest1.byteLength);\n\n          const hash = new this.Sha256();\n          hash.update(chunk);\n          higherLevelHashDigests.push(hash.digest());\n        } else {\n          // move a lone hash up a level\n          higherLevelHashDigests.push(collectedHashDigests[i]);\n        }\n      }\n      collectedHashDigests = higherLevelHashDigests;\n    }\n\n    return collectedHashDigests[0];\n  }\n\n  /**\n   * Converts source data into a Uint8Array.\n   * @param data Data to convert to a Uint8Array.\n   */\n  private convertToBuffer(data: SourceData): Uint8Array {\n    if (typeof data === \"string\") {\n      return this.fromUtf8(data);\n    }\n\n    if (ArrayBuffer.isView(data)) {\n      return new Uint8Array(data.buffer, data.byteOffset, data.byteLength / Uint8Array.BYTES_PER_ELEMENT);\n    }\n\n    return new Uint8Array(data);\n  }\n}\n"]}
|
package/dist/es/index.js
DELETED
|
@@ -1,125 +0,0 @@
|
|
|
1
|
-
import { __awaiter, __generator, __read } from "tslib";
|
|
2
|
-
var MiB = 1048576;
|
|
3
|
-
/**
|
|
4
|
-
* A Hash that will calculate a Sha256 tree hash.
|
|
5
|
-
*/
|
|
6
|
-
var TreeHash = /** @class */ (function () {
|
|
7
|
-
/**
|
|
8
|
-
* Initializes a TreeHash.
|
|
9
|
-
* @param Sha256 A Sha256 hash constructor.
|
|
10
|
-
*/
|
|
11
|
-
function TreeHash(Sha256, fromUtf8) {
|
|
12
|
-
this.Sha256 = Sha256;
|
|
13
|
-
this.fromUtf8 = fromUtf8;
|
|
14
|
-
this.collectedHashDigests = [];
|
|
15
|
-
}
|
|
16
|
-
/**
|
|
17
|
-
* Generates Sha256 hashes from 1 MiB chunks of the
|
|
18
|
-
* internal buffer.
|
|
19
|
-
* Will set the internal buffer to any bytes remaining
|
|
20
|
-
* that is less than 1 MiB.
|
|
21
|
-
*/
|
|
22
|
-
TreeHash.prototype.hashBuffer = function () {
|
|
23
|
-
if (!this.buffer) {
|
|
24
|
-
return;
|
|
25
|
-
}
|
|
26
|
-
var remainingSize = this.buffer.byteLength;
|
|
27
|
-
while (remainingSize >= MiB) {
|
|
28
|
-
var hash = new this.Sha256();
|
|
29
|
-
hash.update(this.buffer.subarray(0, MiB));
|
|
30
|
-
this.collectedHashDigests.push(hash.digest());
|
|
31
|
-
this.buffer = this.buffer.subarray(MiB);
|
|
32
|
-
remainingSize = this.buffer.byteLength;
|
|
33
|
-
}
|
|
34
|
-
};
|
|
35
|
-
/**
|
|
36
|
-
* Updates the tree hash with byte data.
|
|
37
|
-
* @param chunk Byte data to apply to the tree hash.
|
|
38
|
-
*/
|
|
39
|
-
TreeHash.prototype.update = function (data) {
|
|
40
|
-
var chunk = this.convertToBuffer(data);
|
|
41
|
-
if (!this.buffer) {
|
|
42
|
-
this.buffer = chunk;
|
|
43
|
-
}
|
|
44
|
-
else {
|
|
45
|
-
// determine size of both pieces
|
|
46
|
-
var totalSize = this.buffer.byteLength + chunk.byteLength;
|
|
47
|
-
var tempBuffer = new Uint8Array(totalSize);
|
|
48
|
-
tempBuffer.set(this.buffer);
|
|
49
|
-
tempBuffer.set(chunk, this.buffer.byteLength);
|
|
50
|
-
this.buffer = tempBuffer;
|
|
51
|
-
}
|
|
52
|
-
// hasBuffer will set this.buffer with remaining data
|
|
53
|
-
this.hashBuffer();
|
|
54
|
-
};
|
|
55
|
-
/**
|
|
56
|
-
* Calculates the digest for the tree hash.
|
|
57
|
-
*/
|
|
58
|
-
TreeHash.prototype.digest = function () {
|
|
59
|
-
return __awaiter(this, void 0, void 0, function () {
|
|
60
|
-
var collectedHashDigests, smallHash, higherLevelHashDigests, i, _a, digest1, digest2, chunk, hash;
|
|
61
|
-
return __generator(this, function (_b) {
|
|
62
|
-
switch (_b.label) {
|
|
63
|
-
case 0:
|
|
64
|
-
collectedHashDigests = this.collectedHashDigests;
|
|
65
|
-
// remove the reference to collected hashes to free up space
|
|
66
|
-
this.collectedHashDigests = [];
|
|
67
|
-
// loop through collected hashes
|
|
68
|
-
if (this.buffer && this.buffer.byteLength > 0) {
|
|
69
|
-
smallHash = new this.Sha256();
|
|
70
|
-
smallHash.update(this.buffer);
|
|
71
|
-
collectedHashDigests.push(smallHash.digest());
|
|
72
|
-
// remove the remaining buffer
|
|
73
|
-
this.buffer = void 0;
|
|
74
|
-
}
|
|
75
|
-
_b.label = 1;
|
|
76
|
-
case 1:
|
|
77
|
-
if (!(collectedHashDigests.length > 1)) return [3 /*break*/, 7];
|
|
78
|
-
higherLevelHashDigests = [];
|
|
79
|
-
i = 0;
|
|
80
|
-
_b.label = 2;
|
|
81
|
-
case 2:
|
|
82
|
-
if (!(i < collectedHashDigests.length)) return [3 /*break*/, 6];
|
|
83
|
-
if (!(i + 1 < collectedHashDigests.length)) return [3 /*break*/, 4];
|
|
84
|
-
return [4 /*yield*/, Promise.all([collectedHashDigests[i], collectedHashDigests[i + 1]])];
|
|
85
|
-
case 3:
|
|
86
|
-
_a = __read.apply(void 0, [_b.sent(), 2]), digest1 = _a[0], digest2 = _a[1];
|
|
87
|
-
chunk = new Uint8Array(digest1.byteLength + digest2.byteLength);
|
|
88
|
-
chunk.set(digest1);
|
|
89
|
-
chunk.set(digest2, digest1.byteLength);
|
|
90
|
-
hash = new this.Sha256();
|
|
91
|
-
hash.update(chunk);
|
|
92
|
-
higherLevelHashDigests.push(hash.digest());
|
|
93
|
-
return [3 /*break*/, 5];
|
|
94
|
-
case 4:
|
|
95
|
-
// move a lone hash up a level
|
|
96
|
-
higherLevelHashDigests.push(collectedHashDigests[i]);
|
|
97
|
-
_b.label = 5;
|
|
98
|
-
case 5:
|
|
99
|
-
i += 2;
|
|
100
|
-
return [3 /*break*/, 2];
|
|
101
|
-
case 6:
|
|
102
|
-
collectedHashDigests = higherLevelHashDigests;
|
|
103
|
-
return [3 /*break*/, 1];
|
|
104
|
-
case 7: return [2 /*return*/, collectedHashDigests[0]];
|
|
105
|
-
}
|
|
106
|
-
});
|
|
107
|
-
});
|
|
108
|
-
};
|
|
109
|
-
/**
|
|
110
|
-
* Converts source data into a Uint8Array.
|
|
111
|
-
* @param data Data to convert to a Uint8Array.
|
|
112
|
-
*/
|
|
113
|
-
TreeHash.prototype.convertToBuffer = function (data) {
|
|
114
|
-
if (typeof data === "string") {
|
|
115
|
-
return this.fromUtf8(data);
|
|
116
|
-
}
|
|
117
|
-
if (ArrayBuffer.isView(data)) {
|
|
118
|
-
return new Uint8Array(data.buffer, data.byteOffset, data.byteLength / Uint8Array.BYTES_PER_ELEMENT);
|
|
119
|
-
}
|
|
120
|
-
return new Uint8Array(data);
|
|
121
|
-
};
|
|
122
|
-
return TreeHash;
|
|
123
|
-
}());
|
|
124
|
-
export { TreeHash };
|
|
125
|
-
//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";AAEA,IAAM,GAAG,GAAG,OAAO,CAAC;AAEpB;;GAEG;AACH;IAIE;;;OAGG;IACH,kBAA6B,MAAuB,EAAmB,QAAiB;QAA3D,WAAM,GAAN,MAAM,CAAiB;QAAmB,aAAQ,GAAR,QAAQ,CAAS;QANhF,yBAAoB,GAA0B,EAAE,CAAC;IAMkC,CAAC;IAE5F;;;;;OAKG;IACK,6BAAU,GAAlB;QACE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO;SACR;QAED,IAAI,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC;QAC3C,OAAO,aAAa,IAAI,GAAG,EAAE;YAC3B,IAAM,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAC1C,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YAE9C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACxC,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC;SACxC;IACH,CAAC;IAED;;;OAGG;IACI,yBAAM,GAAb,UAAc,IAAgB;QAC5B,IAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;SACrB;aAAM;YACL,gCAAgC;YAChC,IAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;YAC5D,IAAM,UAAU,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;YAE7C,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC5B,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC9C,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC;SAC1B;QAED,qDAAqD;QACrD,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAED;;OAEG;IACU,yBAAM,GAAnB;;;;;;wBACM,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,CAAC;wBACrD,4DAA4D;wBAC5D,IAAI,CAAC,oBAAoB,GAAG,EAAE,CAAC;wBAE/B,gCAAgC;wBAChC,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,EAAE;4BACvC,SAAS,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;4BACpC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;4BAC9B,oBAAoB,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;4BAC9C,8BAA8B;4BAC9B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;yBACtB;;;6BAEM,CAAA,oBAAoB,CAAC,MAAM,GAAG,CAAC,CAAA;wBAC9B,sBAAsB,GAA0B,EAAE,CAAC;wBAChD,CAAC,GAAG,CAAC;;;6BAAE,CAAA,CAAC,GAAG,oBAAoB,CAAC,MAAM,CAAA;6BACzC,CAAA,CAAC,GAAG,CAAC,GAAG,oBAAoB,CAAC,MAAM,CAAA,EAAnC,wBAAmC;wBAEV,qBAAM,OAAO,CAAC,GAAG,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAA;;wBAA9F,KAAA,sBAAqB,SAAyE,KAAA,EAA7F,OAAO,QAAA,EAAE,OAAO,QAAA;wBAEjB,KAAK,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;wBACtE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;wBACnB,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;wBAEjC,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;wBAC/B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;wBACnB,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;;;wBAE3C,8BAA8B;wBAC9B,sBAAsB,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;;;wBAdR,CAAC,IAAI,CAAC,CAAA;;;wBAiBvD,oBAAoB,GAAG,sBAAsB,CAAC;;4BAGhD,sBAAO,oBAAoB,CAAC,CAAC,CAAC,EAAC;;;;KAChC;IAED;;;OAGG;IACK,kCAAe,GAAvB,UAAwB,IAAgB;QACtC,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;YAC5B,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;SAC5B;QAED,IAAI,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YAC5B,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,iBAAiB,CAAC,CAAC;SACrG;QAED,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IACH,eAAC;AAAD,CAAC,AA/GD,IA+GC","sourcesContent":["import { Decoder, Hash, HashConstructor, SourceData } from \"@aws-sdk/types\";\n\nconst MiB = 1048576;\n\n/**\n * A Hash that will calculate a Sha256 tree hash.\n */\nexport class TreeHash implements Hash {\n  private buffer?: Uint8Array;\n  private collectedHashDigests: Promise<Uint8Array>[] = [];\n\n  /**\n   * Initializes a TreeHash.\n   * @param Sha256 A Sha256 hash constructor.\n   */\n  constructor(private readonly Sha256: HashConstructor, private readonly fromUtf8: Decoder) {}\n\n  /**\n   * Generates Sha256 hashes from 1 MiB chunks of the\n   * internal buffer.\n   * Will set the internal buffer to any bytes remaining\n   * that is less than 1 MiB.\n   */\n  private hashBuffer() {\n    if (!this.buffer) {\n      return;\n    }\n\n    let remainingSize = this.buffer.byteLength;\n    while (remainingSize >= MiB) {\n      const hash = new this.Sha256();\n      hash.update(this.buffer.subarray(0, MiB));\n      this.collectedHashDigests.push(hash.digest());\n\n      this.buffer = this.buffer.subarray(MiB);\n      remainingSize = this.buffer.byteLength;\n    }\n  }\n\n  /**\n   * Updates the tree hash with byte data.\n   * @param chunk Byte data to apply to the tree hash.\n   */\n  public update(data: SourceData) {\n    const chunk = this.convertToBuffer(data);\n    if (!this.buffer) {\n      this.buffer = chunk;\n    } else {\n      // determine size of both pieces\n      const totalSize = this.buffer.byteLength + chunk.byteLength;\n      const tempBuffer = new Uint8Array(totalSize);\n\n      tempBuffer.set(this.buffer);\n      tempBuffer.set(chunk, this.buffer.byteLength);\n      this.buffer = tempBuffer;\n    }\n\n    // hasBuffer will set this.buffer with remaining data\n    this.hashBuffer();\n  }\n\n  /**\n   * Calculates the digest for the tree hash.\n   */\n  public async digest(): Promise<Uint8Array> {\n    let collectedHashDigests = this.collectedHashDigests;\n    // remove the reference to collected hashes to free up space\n    this.collectedHashDigests = [];\n\n    // loop through collected hashes\n    if (this.buffer && this.buffer.byteLength > 0) {\n      const smallHash = new this.Sha256();\n      smallHash.update(this.buffer);\n      collectedHashDigests.push(smallHash.digest());\n      // remove the remaining buffer\n      this.buffer = void 0;\n    }\n\n    while (collectedHashDigests.length > 1) {\n      const higherLevelHashDigests: Promise<Uint8Array>[] = [];\n      for (let i = 0; i < collectedHashDigests.length; i += 2) {\n        if (i + 1 < collectedHashDigests.length) {\n          // concatenate the pair of hashes\n          const [digest1, digest2] = await Promise.all([collectedHashDigests[i], collectedHashDigests[i + 1]]);\n\n          const chunk = new Uint8Array(digest1.byteLength + digest2.byteLength);\n          chunk.set(digest1);\n          chunk.set(digest2, digest1.byteLength);\n\n          const hash = new this.Sha256();\n          hash.update(chunk);\n          higherLevelHashDigests.push(hash.digest());\n        } else {\n          // move a lone hash up a level\n          higherLevelHashDigests.push(collectedHashDigests[i]);\n        }\n      }\n      collectedHashDigests = higherLevelHashDigests;\n    }\n\n    return collectedHashDigests[0];\n  }\n\n  /**\n   * Converts source data into a Uint8Array.\n   * @param data Data to convert to a Uint8Array.\n   */\n  private convertToBuffer(data: SourceData): Uint8Array {\n    if (typeof data === \"string\") {\n      return this.fromUtf8(data);\n    }\n\n    if (ArrayBuffer.isView(data)) {\n      return new Uint8Array(data.buffer, data.byteOffset, data.byteLength / Uint8Array.BYTES_PER_ELEMENT);\n    }\n\n    return new Uint8Array(data);\n  }\n}\n"]}
|
package/src/index.ts
DELETED
|
@@ -1,119 +0,0 @@
|
|
|
1
|
-
import { Decoder, Hash, HashConstructor, SourceData } from "@aws-sdk/types";
|
|
2
|
-
|
|
3
|
-
const MiB = 1048576;
|
|
4
|
-
|
|
5
|
-
/**
|
|
6
|
-
* A Hash that will calculate a Sha256 tree hash.
|
|
7
|
-
*/
|
|
8
|
-
export class TreeHash implements Hash {
|
|
9
|
-
private buffer?: Uint8Array;
|
|
10
|
-
private collectedHashDigests: Promise<Uint8Array>[] = [];
|
|
11
|
-
|
|
12
|
-
/**
|
|
13
|
-
* Initializes a TreeHash.
|
|
14
|
-
* @param Sha256 A Sha256 hash constructor.
|
|
15
|
-
*/
|
|
16
|
-
constructor(private readonly Sha256: HashConstructor, private readonly fromUtf8: Decoder) {}
|
|
17
|
-
|
|
18
|
-
/**
|
|
19
|
-
* Generates Sha256 hashes from 1 MiB chunks of the
|
|
20
|
-
* internal buffer.
|
|
21
|
-
* Will set the internal buffer to any bytes remaining
|
|
22
|
-
* that is less than 1 MiB.
|
|
23
|
-
*/
|
|
24
|
-
private hashBuffer() {
|
|
25
|
-
if (!this.buffer) {
|
|
26
|
-
return;
|
|
27
|
-
}
|
|
28
|
-
|
|
29
|
-
let remainingSize = this.buffer.byteLength;
|
|
30
|
-
while (remainingSize >= MiB) {
|
|
31
|
-
const hash = new this.Sha256();
|
|
32
|
-
hash.update(this.buffer.subarray(0, MiB));
|
|
33
|
-
this.collectedHashDigests.push(hash.digest());
|
|
34
|
-
|
|
35
|
-
this.buffer = this.buffer.subarray(MiB);
|
|
36
|
-
remainingSize = this.buffer.byteLength;
|
|
37
|
-
}
|
|
38
|
-
}
|
|
39
|
-
|
|
40
|
-
/**
|
|
41
|
-
* Updates the tree hash with byte data.
|
|
42
|
-
* @param chunk Byte data to apply to the tree hash.
|
|
43
|
-
*/
|
|
44
|
-
public update(data: SourceData) {
|
|
45
|
-
const chunk = this.convertToBuffer(data);
|
|
46
|
-
if (!this.buffer) {
|
|
47
|
-
this.buffer = chunk;
|
|
48
|
-
} else {
|
|
49
|
-
// determine size of both pieces
|
|
50
|
-
const totalSize = this.buffer.byteLength + chunk.byteLength;
|
|
51
|
-
const tempBuffer = new Uint8Array(totalSize);
|
|
52
|
-
|
|
53
|
-
tempBuffer.set(this.buffer);
|
|
54
|
-
tempBuffer.set(chunk, this.buffer.byteLength);
|
|
55
|
-
this.buffer = tempBuffer;
|
|
56
|
-
}
|
|
57
|
-
|
|
58
|
-
// hasBuffer will set this.buffer with remaining data
|
|
59
|
-
this.hashBuffer();
|
|
60
|
-
}
|
|
61
|
-
|
|
62
|
-
/**
|
|
63
|
-
* Calculates the digest for the tree hash.
|
|
64
|
-
*/
|
|
65
|
-
public async digest(): Promise<Uint8Array> {
|
|
66
|
-
let collectedHashDigests = this.collectedHashDigests;
|
|
67
|
-
// remove the reference to collected hashes to free up space
|
|
68
|
-
this.collectedHashDigests = [];
|
|
69
|
-
|
|
70
|
-
// loop through collected hashes
|
|
71
|
-
if (this.buffer && this.buffer.byteLength > 0) {
|
|
72
|
-
const smallHash = new this.Sha256();
|
|
73
|
-
smallHash.update(this.buffer);
|
|
74
|
-
collectedHashDigests.push(smallHash.digest());
|
|
75
|
-
// remove the remaining buffer
|
|
76
|
-
this.buffer = void 0;
|
|
77
|
-
}
|
|
78
|
-
|
|
79
|
-
while (collectedHashDigests.length > 1) {
|
|
80
|
-
const higherLevelHashDigests: Promise<Uint8Array>[] = [];
|
|
81
|
-
for (let i = 0; i < collectedHashDigests.length; i += 2) {
|
|
82
|
-
if (i + 1 < collectedHashDigests.length) {
|
|
83
|
-
// concatenate the pair of hashes
|
|
84
|
-
const [digest1, digest2] = await Promise.all([collectedHashDigests[i], collectedHashDigests[i + 1]]);
|
|
85
|
-
|
|
86
|
-
const chunk = new Uint8Array(digest1.byteLength + digest2.byteLength);
|
|
87
|
-
chunk.set(digest1);
|
|
88
|
-
chunk.set(digest2, digest1.byteLength);
|
|
89
|
-
|
|
90
|
-
const hash = new this.Sha256();
|
|
91
|
-
hash.update(chunk);
|
|
92
|
-
higherLevelHashDigests.push(hash.digest());
|
|
93
|
-
} else {
|
|
94
|
-
// move a lone hash up a level
|
|
95
|
-
higherLevelHashDigests.push(collectedHashDigests[i]);
|
|
96
|
-
}
|
|
97
|
-
}
|
|
98
|
-
collectedHashDigests = higherLevelHashDigests;
|
|
99
|
-
}
|
|
100
|
-
|
|
101
|
-
return collectedHashDigests[0];
|
|
102
|
-
}
|
|
103
|
-
|
|
104
|
-
/**
|
|
105
|
-
* Converts source data into a Uint8Array.
|
|
106
|
-
* @param data Data to convert to a Uint8Array.
|
|
107
|
-
*/
|
|
108
|
-
private convertToBuffer(data: SourceData): Uint8Array {
|
|
109
|
-
if (typeof data === "string") {
|
|
110
|
-
return this.fromUtf8(data);
|
|
111
|
-
}
|
|
112
|
-
|
|
113
|
-
if (ArrayBuffer.isView(data)) {
|
|
114
|
-
return new Uint8Array(data.buffer, data.byteOffset, data.byteLength / Uint8Array.BYTES_PER_ELEMENT);
|
|
115
|
-
}
|
|
116
|
-
|
|
117
|
-
return new Uint8Array(data);
|
|
118
|
-
}
|
|
119
|
-
}
|
package/tsconfig.cjs.json
DELETED
package/tsconfig.es.json
DELETED
|
@@ -1,11 +0,0 @@
|
|
|
1
|
-
{
|
|
2
|
-
"compilerOptions": {
|
|
3
|
-
"lib": ["dom", "es5", "es2015.promise", "es2015.collection", "es2015.iterable", "es2015.symbol.wellknown"],
|
|
4
|
-
"declarationDir": "./dist/types",
|
|
5
|
-
"rootDir": "./src",
|
|
6
|
-
"outDir": "./dist/es",
|
|
7
|
-
"baseUrl": "."
|
|
8
|
-
},
|
|
9
|
-
"extends": "../../tsconfig.es.json",
|
|
10
|
-
"include": ["src/"]
|
|
11
|
-
}
|