Mirror/betaflight-configurator
1
0
Fork 0
mirror of https://github.com/betaflight/betaflight-configurator.git synced 2025-07-24 00:35:26 +03:00
Code Issues Wiki Activity

Change lexical scope remaing root

Browse source
This commit is contained in:
Mark Haslinghuis 2020-12-08 20:13:20 +01:00
parent 317f937fd5
commit 57539eb6de
10 changed files with 55 additions and 59 deletions
Download patch file Download diff file Expand all files Collapse all files

23
src/js/huffman.js
View file

@ -1,14 +1,13 @@
'use strict';
var HUFFMAN_EOF = -1;
const HUFFMAN_EOF = -1;
function huffmanDecodeBuf(inBuf, inBufCharacterCount, huffmanTree, huffmanLenIndex)
{
var code = 0;
var codeLen = 0;
var testBit = 0x80;
var eof = false;
var outBuf = [];
function huffmanDecodeBuf(inBuf, inBufCharacterCount, huffmanTree, huffmanLenIndex) {
let code = 0;
let codeLen = 0;
let testBit = 0x80;
let eof = false;
const outBuf = [];
while (!eof && inBuf.byteLength != 0) {
if (outBuf.length == inBufCharacterCount) {
@ -35,10 +34,10 @@ function huffmanDecodeBuf(inBuf, inBufCharacterCount, huffmanTree, huffmanLenInd
// check if the code is a leaf node or an interior node
if (huffmanLenIndex[codeLen] != -1) {
// look for the code in the tree, only leaf nodes are stored in the tree
for (var i = huffmanLenIndex[codeLen]; (i < huffmanTree.length) && (huffmanTree[i].codeLen == codeLen); ++i) {
if (huffmanTree[i].code == code) {
for (let i = huffmanLenIndex[codeLen]; (i < huffmanTree.length) && (huffmanTree[i].codeLen === codeLen); ++i) {
if (huffmanTree[i].code === code) {
// we've found the code, so it is a leaf node
var value = huffmanTree[i].value;
const value = huffmanTree[i].value;
if (value == HUFFMAN_EOF) {
eof = true;
@ -57,4 +56,4 @@ function huffmanDecodeBuf(inBuf, inBufCharacterCount, huffmanTree, huffmanLenInd
}
return new Uint8Array(outBuf);
}
}