Mirror/CyberChef
1
0
Fork 0
mirror of https://github.com/gchq/CyberChef.git synced 2024-09-29 23:11:30 +02:00
Code Issues Packages Projects Releases Wiki Activity

Use all the arraybuffers

Browse Source 
cuts a solid 1/3 off the compression time
This commit is contained in:
Matt 2019-04-02 16:47:38 +01:00
parent c5698fcd65
commit 8445165491
No known key found for this signature in database
GPG Key ID: 2DD462FE98BF38C2
1 changed files with 3 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
src/core/operations/Bzip2Compress.mjs
View File

@ -24,7 +24,7 @@ class Bzip2Compress extends Operation {
this.description = "Bzip2 is a compression library developed by Julian Seward (of GHC fame) that uses the Burrows-Wheeler algorithm. It only supports compressing single files and its compression is slow, however is more effective than Deflate (.gz & .zip)."; this.description = "Bzip2 is a compression library developed by Julian Seward (of GHC fame) that uses the Burrows-Wheeler algorithm. It only supports compressing single files and its compression is slow, however is more effective than Deflate (.gz & .zip).";
this.infoURL = "https://wikipedia.org/wiki/Bzip2"; this.infoURL = "https://wikipedia.org/wiki/Bzip2";
this.inputType = "ArrayBuffer"; this.inputType = "ArrayBuffer";
this.outputType = "File"; this.outputType = "ArrayBuffer";
this.args = [ this.args = [
{ {
name: "Block size (100s of kb)", name: "Block size (100s of kb)",
@ -35,11 +35,6 @@ class Bzip2Compress extends Operation {
name: "Work factor", name: "Work factor",
type: "number", type: "number",
value: 30 value: 30
},
{
name: "Compressed filename",
type: "string",
value: "compressed.bz2"
} }
]; ];
} }
@ -63,7 +58,8 @@ class Bzip2Compress extends Operation {
if (bzip2cc.error !== 0) { if (bzip2cc.error !== 0) {
reject(new OperationError(bzip2cc.error_msg)); reject(new OperationError(bzip2cc.error_msg));
} else { } else {
resolve(new File([bzip2cc.output], filename)); const output = bzip2cc.output;
resolve(output.buffer.slice(output.byteOffset, output.byteLength + output.byteOffset));
} }
}); });
}); });